source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/Atomix%20%28video%20game%29
|
Atomix is a puzzle video game developed by Günter Krämer (as "Softtouch") and published by Thalion Software, released for the Amiga and other personal computers in late 1990. The object of the game is to assemble molecules from compound atoms by moving the atoms on a two-dimensional playfield.
Atomix was received positively; reviewers noted the game's addictiveness and enjoyable gameplay, though criticized its repetitiveness.
Gameplay
Atomix takes place on a playfield consisting of a number of walls, with the atoms scattered throughout. The player is tasked with assembling a molecule from the atoms. The atoms must be arranged to exactly match the molecule displayed on the left side of the screen. The player can choose an atom and move it in any of the four cardinal directions. A moved atom keeps sliding in one direction until it hits a wall or another atom. Solving the puzzles requires strategic planning in moving the atoms, and on later levels with little free space, even finding room for the completed molecule can be a problem. Once the molecule is assembled, the player is given a score; the faster the puzzle was completed, the higher the score.
Each puzzle must be completed within a time limit. A portion of the player's score can be spent to restart a failed puzzle. The entire game consists of 30 puzzles of increasing difficulty. In addition, after every five puzzles, there is a bonus level where the player must move laboratory flasks filled with various amounts of liquid to arrange them from empty to full.
The game also offers a two-player mode, where two players work on the same puzzle; they take turns which last up to thirty seconds.
Development
Amiga Format reviewed a pre-release version in its May, 1990 issue. It was almost a complete version of the game although it lacked sound.
Initially the game was released for Amiga, Atari ST and the IBM PC; as of May 1990, the C64 version was not yet planned, and was only released a few months later. A ZX Spectrum version was also planned. It was to be distributed by U.S. Gold, but was never released.
The game was published for Enterprise 128 in 2006, this version was written by Zoltán Povázsay from Hungary.
A clone for the Atari Jaguar called Atomic has been released in 2006, written by Sébastien Briais (AKA Seb from the Removers). A second version called Atomic Reloaded has been released in 2009.
Reception
Atomix received warm reactions from reviewers. They stated it was highly enjoyable and addictive despite its high difficulty level. Reviewers also pointed out the possible educational application of the game.
However, certain reviewers criticized the game for its repetitiveness and stated that it lacked replayability. Some reviewers also wrote about the game's unoriginality, noting similarities to earlier games, Xor and Leonardo.
Graphics were generally considered adequate, though not spectacular; Zzap!64 called them "a bit dull and repetitive" and "simplistic, but slick and effect
|
https://en.wikipedia.org/wiki/RAYDAC
|
The RAYDAC (for Raytheon Digital Automatic Computer) was a one-of-a-kind computer built by Raytheon. It was started in 1949 and finished in 1953. It was installed at the Naval Air Missile Test Center at Point Mugu, California.
The RAYDAC used 5,200 vacuum tubes and 18,000 crystal diodes. It had 1,152 words of memory (36 bits per word), using delay-line memory, with an access time of up to 305 microseconds. Its addition time was 38 microseconds, multiplication time was 240 microseconds, and division time was 375 microseconds. (These times exclude the memory-access time.)
See also
List of vacuum-tube computers
External links
Erwin Tomash photo of General Front View From Right Side of RAYDAC Test Control Board (image)
Erwin Tomash drawing of RADAC Computer Control Room Showing Main Computer and Operator's Console (image)
References
One-of-a-kind computers
Vacuum tube computers
36-bit computers
Raytheon Company products
|
https://en.wikipedia.org/wiki/EdGCM
|
The Educational Global Climate Model or EdGCM is a fully functional global climate model (GCM) that has been ported for use on desktop computers (Windows PCs and Macs). It operates through a graphical user interface and is integrated with a relational database and scientific visualization utilities, all of which aim at helping improve the quality of teaching and understanding of climatology by making real-world research experiences more accessible. EdGCM is designed to permit teachers and students to conduct in-depth investigations of past, present and future climate scenarios in a manner that is essentially identical to the techniques used by national and international climate research organizations.
EdGCM was developed at the Goddard Institute for Space Studies as a joint project of Columbia University and NASA scientists and programmers. The Global Climate Model at the core of EdGCM is GISS Model II. During the 1980s and early 1990s this GCM was one of NASA's primary climate research tools. Results from the model have appeared in hundreds of scientific publications.
The coarser resolution of the climate model in EdGCM (8° x 10°, latitude x longitude) makes it inexpensive to run. But, because it contains most of the key atmospheric physics of modern GCMs, EdGCM is also used by climate researchers who do not have access to the most recent GCM versions.
See also
NASA Goddard Institute for Space Studies
NCAR Community Climate System Model
NOAA GFDL CM2.X
Earth Simulator
HadCM3 - explanation of an AOGCM
External links
EdGCM at Columbia University
Numerical climate and weather models
Meteorology and climate education
NASA spin-off technologies
|
https://en.wikipedia.org/wiki/Byte%20Bandit
|
Byte Bandit is a boot sector computer virus created for the Amiga personal computer. It first appeared in January 1988.
In contrast to the feared Amiga viruses like the infamous Lamer Exterminator and SADDAM, Byte Bandit was not destructive. It just spread automatically from system to system.
Byte Bandit made no attempt to disguise itself as modern viruses, trojans, and worms do. While it naturally over-wrote the bootblock, it also hooked into the system, remaining reset-resident and causing system data corruption and system failures. The virus increments a copy counter every time it writes itself to a disk, which is in the text string "Virus by Byte Bandit in 9.87. Number of copys:" which also gives a date of September 1987 for the creation, as well as the assumed name of the programmer.
External links
http://www.sca.ch/ – Swiss Cracking Association's homepage
Byte Bandit-Virus description at the Amiga Virus Encyclopedia
Amiga viruses
Hacking in the 1980s
|
https://en.wikipedia.org/wiki/DWAO-TV
|
DWAO-TV (channel 37) is a television station in Metro Manila, Philippines, serving as the flagship of UNTV network. Owned and operated by the Progressive Broadcasting Corporation, owned by Alfredo "Atom" Henares. It is maintained by the Breakthrough and Milestones Productions International, headed by veteran broadcaster Daniel Razon. the station maintains studios at the La Verdad Christian College - Caloocan Building, 351 EDSA, Brgy. Bagong Barrio West, Caloocan, and its hybrid analog and digital transmitter facility is located at Emerald Hills, Sumulong Highway, Antipolo.
History
In July 2001, the Progressive Broadcasting Corporation (PBC) owned by businessman Alfredo "Atom" Henares ventured into UHF television through UNTV-37 (pronounced as "un-tee-vee"). It serves as television counterpart to PBC's FM radio station NU 107, airing rock and alternative rock music videos. The station gained a cult following through comedy and reality show Strangebrew known as "Ang show na may tama" and "In the Raw."
In 2004, UNTV gradually reduced, until it eventually abandoned airing rock-oriented music videos after its airtime were acquired by Tapatan, Inc. headed by veteran broadcaster Jay Sonza. The station also began airing MCGI religious programs after Henares had a deal with the Ang Dating Daan group. Since then, UNTV became the permanent home of the religious program Ang Dating Daan (The Old Path) after leaving SBN 21. Later, the station was rebranded as "UN Television (UNTV)" (pronounced as "you-en-tee-vee.")
The new UNTV humbly started with a one-room broadcast studio located at the AIC Gold Tower in Ortigas Center, Pasig.
The station transferred to Brgy. Damayang Lagi New Manila, Quezon City in 2006 as it needs bigger space for its growing public service initiatives. In 2008, UNTV transferred to its own building at 907 Philam Homes along EDSA Quezon City.
Since then, UNTV became a 24/7 station (however, the network continues to sign-off the air every Monday mornings from 12:05 am to 3:55 am due to regular transmitter maintenance on terrestrial TV only) on free-to-air TV airing news, entertainment and religious programs. In 2007, Breakthrough and Milestones Production International under the leadership of Kuya Daniel Razon acquired the main operations of the network and in turn, relaunched as the "public service channel," another first in the history of Philippine Television.
UNTV began using DJI Phantom aerial drones for their live news reporting in 2013. In 2013, UNTV ceased using its old tower in Crestview Heights Subdivision, Brgy. San Roque, Antipolo, Rizal and began using its new digital-ready transmitter located at Emerald Hills, Sumulong Highway, Antipolo, Rizal to improve signal reception. The tower is shared by UNTV and Wish FM 107.5.
On June 26, 2014, UNTV held the groundbreaking ceremony for the construction of UNTV Broadcast Center, that will serve as its new headquarters. It is located along EDSA, in front of Ayala Land's TriNoma ma
|
https://en.wikipedia.org/wiki/Liquido
|
Liquido was a German rock band formed in Sinsheim, Germany in 1996 by four friends: Wolle Maier (drums, programming), Wolfgang Schrödl (vocals, guitar, keyboards, piano), Stefan Schulte-Holthaus (bass) and Tim Eiermann (vocals, guitar). The vast majority of their songs are sung in English. Their debut single “Narcotic”, recorded in 1997, was a hit in many European countries in 1998. This song was later remixed and became a German, Austrian and Dutch hit for YouNotUs in 2019.
Discography
Studio albums
Liquido (Virgin, 1999)
At the Rocks (Virgin, 2000)
Alarm! Alarm! (Virgin / EMI, 2002)
Float (Nuclear Blast, 2005)
Zoomcraft (Nuclear Blast, 2008)
Compilation albums
The Essential (Virgin, 2004)
Demo EP
Narcotic (Seven Music, 1997)
Singles
References
German rock music groups
Musical groups established in 1996
Musical groups disestablished in 2009
Nuclear Blast artists
Extensive Music artists
|
https://en.wikipedia.org/wiki/LDAP%20Data%20Interchange%20Format
|
The LDAP Data Interchange Format (LDIF) is a standard plain text data interchange format for representing Lightweight Directory Access Protocol (LDAP) directory content and update requests. LDIF conveys directory content as a set of records, one record for each object (or entry). It also represents update requests, such as Add, Modify, Delete, and Rename, as a set of records, one record for each update request.
LDIF was designed in the early 1990s by Tim Howes, Mark C. Smith, and Gordon Good while at the University of Michigan. LDIF was updated and extended in the late 1990s for use with Version 3 of LDAP. This later version of LDIF is called version 1 and is formally specified in RFC 2849, an IETF Standard Track RFC. RFC 2849 is authored by Gordon Good and was published in June 2000. It is currently a Proposed Standard.
A number of extensions to LDIF have been proposed over the years. One extension has been formally specified by the IETF and published. RFC 4525, authored by Kurt Zeilenga, extended LDIF to support the LDAP Modify-Increment extension. It is expected that additional extensions will be published by the IETF in the future.
Content record format
Each content record is represented as a group of attributes, with records separated from one another by blank lines. The individual attributes of a record are represented as single logical lines (represented as one or more multiple physical lines via a line-folding mechanism), comprising "name: value" pairs. Value data that do not fit within a portable subset of ASCII characters are marked with '::' after the attribute name and encoded into ASCII using base64 encoding. The content record format is a subset of the Internet Directory Information type.RFC 2425
Tools that employ LDIF
The OpenLDAP utilities include tools for exporting data from LDAP servers to LDIF content records (), importing data from LDIF content records to LDAP servers (), and applying LDIF change records to LDAP servers ().
LDIF is one of the formats for importing and exporting address book data that the address books in Netscape Communicator and in the Mozilla Application Suite support.
Microsoft Windows 2000 Server and Windows Server 2003 include an LDIF based command line tool named LDIFDE for importing and exporting information in Active Directory.
JXplorer is a cross platform open source java application that can browse and do basic editing of LDIF files.
LDIF fields
dn distinguished name
This refers to the name that uniquely identifies an entry in the directory.
dc domain component
This refers to each component of the domain. For example www.mydomain.com would be written as DC=www,DC=mydomain,DC=com
ou organizational unit
This refers to the organizational unit (or sometimes the user group) that the user is part of. If the user is part of more than one group, you may specify as such, e.g., OU= Lawyer,OU= Judge.
cn common name
This refers to the individual object (person's name; mee
|
https://en.wikipedia.org/wiki/Erasmus%20Student%20Network
|
The Erasmus Student Network (ESN) is a Europe-wide student organisation.
The organisation supports and develops student exchanges, both inside the Erasmus+ programme and outside of it. The local ESN sections offer help, guidance and information to both exchange students and students doing a full degree abroad – by informing them, but also providing them with different trips or events. National and international level support the local level by providing necessary tools, as well as communicating with National Erasmus+ Organisations or the European Commission in general.
The goal of the organisation is to support and develop student exchange on the local, national and international levels. It is composed of around 15,000 members in over 530 local sections in 42 countries in Higher Education Institutions, including universities, polytechnics, and university colleges.
History
In 1987, the European Community approved a plan to create a mobility scheme for higher education. Part of it was the Erasmus programme – an exchange programme for students to provide students with the opportunity to spend part of their studies abroad.
In 1989, the Erasmus Bureau invited 32 former Erasmus Students for an evaluation meeting in Ghent, Belgium. This meeting was the starting point for the Erasmus Student Network. The lack of peer-to-peer support was singled out as a major issue and the driving force behind the creation of the Erasmus Student Network, named for the Dutch Renaissance humanist Erasmus of Rotterdam.
By 1994, the ESN had 60 sections in 14 countries. In 2004, the ESN network consisted of 170 sections in and outside Europe, from Scandinavia, to the Caucasus, to Morocco. In 2005, ESN established its headquarters in Brussels and legally registered as a Belgian non-profit organisation.
As of October 2023, the Erasmus Student Network consists of 513 local associations ("sections") in 44 countries and has more than 15,000 volunteers across Europe.
The organisation supports students from Erasmus programmes and other bilateral agreements. It cooperates with national agencies in order to help international students – it does not, however, send people on exchanges itself.
Structure
ESN works on three levels – local, national and international. It is only active within the borders defined by the Council of Europe.
Local level
ESN on local level consists of "sections" that work with international students. They organise activities like introduction programmes, get-togethers and cultural events and represent the exchange students and their needs towards academic institutions and local authorities. Every year, representatives of the local sections meet at the Erasmus Generation Meeting (EGM).
National level
The national level represents the needs of international students towards governments and national authorities. Local sections in the same countries form a National Platform (NP) and, each year, they elect a National Board which represents the local sectio
|
https://en.wikipedia.org/wiki/James%20Shikwati
|
James Shikwati (born 1970) is a Kenyan libertarian economist and Director of the Inter Region Economic Network who promotes freedom of trade as the driving solution to poverty in Africa. He has made comments which imply that aid towards Africa does more harm than good to their people, based on the central arguments that it is mainly used either by politicians as a tool to manipulate people and influence votes, or as a mechanism for dumping subsidised foreign agricultural products onto local markets at below cost making it nearly impossible for African farmers to compete.
Education
A graduate from the University of Nairobi (B.ED Arts 1994), attended Musingu High School (1989) and taught Kiptewit High School (1994–2001) in Kericho Rift Valley province in Kenya. He is a "self taught" economist.
Philosophy
Shikwati is a writer and a commentator on public policy with a special interest in development, environment, trade and agriculture related issues. He has written widely on a variety of subjects in Kenyan and international newspapers, magazines, such as The Times, The Guardian, The Wall Street Journal, The Washington Post, The Sydney Morning Herald, The Business News, The Daily Nation, and The East African Standard.
Shikwati was also featured in a November 18, 2006 article in the New York Times:
Jeffrey D. Sachs, a Columbia University professor who is a leading aid advocate, calls Shikwati’s criticisms of foreign assistance “shockingly misguided” and “amazingly wrong.” “This happens to be a matter of life and death for millions of people, so getting it wrong has huge consequences,” Sachs said.
Shikwati has worked extensively with internationally acclaimed opinion leaders to promote ideas that improve productivity, and increase freedom to trade as a way to alleviate poverty. He facilitates several workshops every year throughout Africa geared towards promoting productivity and trade. He recently argued that development is the ability of individuals to understand the world and creatively respond to challenges that confront humanity in a manner that increases levels of human comfort on earth.
He is the founder and Executive Director of the Inter Region Economic Network [IREN], an independent and non-partisan think tank that promotes policies geared towards the creation of a free Africa. He is also the Country Director for Students In Free Enterprise [SIFE Kenya] and Chief Executive Officer (CEO) of an online business magazine The African Executive that is published weekly by IREN.
Awards and decorations
On 6 July 2007, Shikwati was named among top 100 most influential Kenyans in a study that was conducted by The Standard Group, one of the Kenya’s leading media houses, he was described as one person whose decisions and actions are not motivated by the publicity they attract but by passion for what they do. On March 11, 2008, The World Economic Forum named Shikwati among the 250 Young Global Leaders of 2008.
References
1970 births
Living people
|
https://en.wikipedia.org/wiki/Inter%20Region%20Economic%20Network
|
The Inter Region Economic Network (IREN) is a private Limited company based in Nairobi, Kenya, which advocates for free market economics for the development of Africa. Its founder and director is James Shikwati. IREN's key focus areas include targeted events, training, research, consultancy, communication and its online flagship magazine: The African Executive - published in English every Wednesday.
References
External links
Inter Region Economic Network
Think tanks based in Kenya
|
https://en.wikipedia.org/wiki/Mikael%20Fortelius
|
Mikael Fortelius (born 1 February 1954) is a professor of evolutionary palaeontology at the University of Helsinki and the coordinator of the Neogene of the Old World database of fossil mammals. His research involves the evolution of Eurasian land mammals and terrestrial environments during the Neogene, ecomorphology of ungulates, developmental biology, the function and evolution of mammalian teeth, and scaling problems (changes in size with growth or as species evolve). He is an expert on indricotheres. He has authored and co-authored a number of papers in peer-reviewed international journals as well as articles on popular science and other published material. He is married to Asta Irene Rosenström, and he has three children.
External links
1954 births
Living people
Finnish paleontologists
Academic staff of the University of Helsinki
|
https://en.wikipedia.org/wiki/TrustRank
|
TrustRank is an algorithm that conducts link analysis to separate useful webpages from spam and helps search engine rank pages in SERPs (Search Engine Results Pages). It is semi-automated process which means that it needs some human assistance in order to function properly. Search engines have many different algorithms and ranking factors that they use when measuring the quality of webpages. TrustRank is one of them.
Because manual review of the Internet is impractical and very expensive, TrustRank was introduced in order to help achieve this task much faster and cheaper. It was first introduced by researchers Zoltan Gyongyi and Hector Garcia-Molina of Stanford University and Jan Pedersen of Yahoo! in their paper "Combating Web Spam with TrustRank" in 2004. Today, this algorithm is a part of major web search engines like Yahoo! and Google.
One of the most important factors that help web search engine determine the quality of a web page when returning results are backlinks. Search engines take a number and quality of backlinks into consideration when assigning a place to a certain web page in SERPs. Many web spam pages are created only with the intention of misleading search engines. These pages, chiefly created for commercial reasons, use various techniques to achieve higher-than-deserved rankings in the search engines' result pages. While human experts can easily identify spam, search engines are still being improved daily in order to do it without help of humans.
One popular method for improving rankings is to increase the perceived importance of a document through complex linking schemes. Google's PageRank and other search ranking algorithms have been subjected to such manipulation.
TrustRank seeks to combat spam by filtering the web based upon reliability. The method calls for selecting a small set of seed pages to be evaluated by an expert. Once the reputable seed pages are manually identified, a crawl extending outward from the seed set seeks out similarly reliable and trustworthy pages. TrustRank's reliability diminishes with increased distance between documents and the seed set.
The logic works in the opposite way as well, which is called Anti-Trust Rank. The closer a site is to spam resources, the more likely it is to be spam as well.
The researchers who proposed the TrustRank methodology have continued to refine their work by evaluating related topics, such as measuring spam mass.
See also
PageRank
CheiRank
Adversarial information retrieval
Hilltop algorithm
HITS algorithm
Spamdexing
References
External links
Z. Gyöngyi, H. Garcia-Molina, J. Pedersen: Combating Web Spam with TrustRank
Link-based spam detection Yahoo! assigned patent application using TrustRank
Reputation management
Link analysis
|
https://en.wikipedia.org/wiki/Open%20Root%20Server%20Network
|
Open Root Server Network (ORSN) was a network of Domain Name System root nameservers for the Internet.
ORSN DNS root zone information was kept in synchronization with the "official" Domain Name System root nameservers coordinated by ICANN. The networks were 100% compatible, though ORSN was operated independently. The ORSN servers were primarily placed in Europe. ORSN is also used by public name servers, providing Domain Name System access freely for everyone, without any limitation until the project closed in May 2019.
ORSN was primarily started to reduce the over-dependence of Internet users on the United States and Department of Commerce/IANA/ICANN/VeriSign, limit the control over the Internet that this gives, while ensuring that domain names remain unambiguous. It also helps avoid the technical possibility of global "Internet shutdown" by one party. They also expect their network to make domain name resolutions faster for everyone.
Markus Grundmann, based in Germany, is the founder of ORSN, and author of ORSN distributed system management and monitoring software solution.
Paul Vixie, the main designer of BIND, the de facto standard software for DNS servers in UNIX-like operating systems, is a high-profile proponent of the ORSN. Paul Vixie is member of Security and Stability Advisory Committee of ICANN; he served on the board of trustees of the American Registry for Internet Numbers (ARIN) from 2005 to 2013, also as ARIN chairman in 2009 and 2010.
ORSN has two operating modes:
ICANN BASED (default) operating mode involves daily synchronization, except that removed TLDs are not removed from the ORSN root.
INDEPENDENT mode has no automatic synchronization and is activated "whenever the political situation of the world - in our opinion - makes this step necessary because the possibility of a modification and/or a downtime of the ICANN root zone exists or we do not want that our root zone will rebuild automatically."
Operating history
ORSN operated from February 2002 until the end of 2008.
ORSN operated again from June 2013 until May 2019.
Several Internet service providers in Europe used ORSN as a root for their name servers.
ORSN root nameservers
ORSN's root server system consisted of 13 root servers, a distributed system connected on a secure VPN, for synchronization and management. All of the 13 servers ran on FreeBSD and BIND. Monitoring and management daemon was developed by founder, Markus Grundmann.
table data from ORSN Root Zone Version: 2015022600
ORSN Root Server Systems Technical Information
ORSN public DNS servers
ORSN public DNS servers were operated by the community of ORSN, providing Domain Name System access freely for everyone, without any limitation. It did not serve additional TLDs but only the regular ICANN TLDs. ORSN public DNS servers were intended to respect privacy and should not have logged usage, although these servers were run independently and there was no technical means by which ORSN could enforce this.
|
https://en.wikipedia.org/wiki/New%20York%20Times%20Co.%20v.%20Tasini
|
New York Times Co. v. Tasini, 533 U.S. 483 (2001), is a leading decision by the United States Supreme Court on the issue of copyright in the contents of a newspaper database. It held that The New York Times, in licensing back issues of the newspaper for inclusion in electronic databases such as LexisNexis, could not license the works of freelance journalists contained in the newspapers.
The lawsuit brought by members of the UAW's National Writers Union against the New York Times Company, Newsday Inc., Time Inc., University Microfilms International, and LexisNexis. The freelance writers, including lead plaintiff Jonathan Tasini, charged copyright infringement due to the use and reuse in electronic media of articles initially licensed to be published in print form. In a 7–2 ruling delivered by Justice Ginsburg, the Court affirmed the copyright privileges of freelance writers whose works were originally published in periodicals and then provided by the publishers to electronic databases without explicit permission of, or compensation to, the writers. As a result of the decision, plaintiffs won a compensation pool of $18 million.
History
The case was initially heard in the district court of Judge Sonia Sotomayor, who held that the publishers were within their rights according to the Copyright Act of 1976. This decision was reversed on appeal, and the Supreme Court affirmed the appellate court's reversal.
Aftermath
The decision involved works generated by 27,000 authors, but it did not allocate any bargaining power to them. The New York Times Company responded to the decision by drafting an ultimatum for the authors. The authors could contact the Times and request that it continue to distribute their works online, but only on the conditions that the authors ask for no additional payment and that they release the Tasini decision's legal claim on the Times and the database licensees. Future freelance contracts with the New York Times included similar terms that allowed the Times to exploit the works in whatever ways the future may reveal.
See also
New York Times Co. v. Sullivan (1964)
New York Times Co. v. United States (1971)
List of United States Supreme Court cases, volume 533
References
Further reading
External links
N.Y. Times statement about the ruling
United States Supreme Court cases
United States Supreme Court cases of the Rehnquist Court
United States copyright case law
United States labor case law
2001 in United States case law
History of the United Auto Workers
The New York Times
|
https://en.wikipedia.org/wiki/SFR
|
SFR (; ) is a French telecommunications company. It is both the second oldest mobile network operator and the second largest telecommunications company in France, after Orange.
As of December 2015, SFR had 21.9 million customers in Metropolitan France for mobile services and it provided 6.35 million households with high-speed internet access.
SFR also offers services in the overseas departments of France, in the Caribbean islands of Martinique, Guadeloupe, and in Guyane through SFR Caraïbe, and in the Indian Ocean, in Mayotte and the Réunion islands through SRR (Société Réunionnaise du Radiotéléphone; also branded as SFR Réunion).
SFR Belux operated in Belgium as a cable operator and MVNO in some communes of Brussels Region, and in some areas of Luxembourg (as SFR Luxembourg). The division was sold to rival Telenet (owned by Liberty Global) in December 2016.
History
SFR was founded in 1987 in order for its then-parent company Compagnie Générale des Eaux (CGE) to start offering a 1G mobile phone service using the modified Nordic telecommunications standard NMT-F, to be operated in competition with the then-telephony incumbent France Télécom's network. SFR also became the second French mobile network operator (after France Télécom) to launch 2G GSM services, which it did on 15 November 1992.
In 1996, CGE spun off SFR and all its other telecommunications activities into a new holding company called SFR-Cegetel (later just ), which also became a competiting provider of fixed-line telecommunication services, as well as a major ISP and a shareholder of the French operations of America Online (AOL), as part of AOL's European operations which AOL of the United States ran as a joint venture with the German conglomerate Bertelsmann.
Vodafone had a 44% share in SFR until April 2011, when it sold its entire share back to SFR's founding parent company Vivendi. SFR is a major partner network of Vodafone in France.
Vivendi announced in March 2014 that it planned to sell its SFR division. On 14 March, it announced that it would enter exclusive negotiations with Altice/Numericable, to the exclusion of Bouygues and Iliad. Arnaud Montebourg, the French Minister for Industrial Renewal, triggered considerable concern when he stated that the Numericable/SFR deal was a certainty. Iliad lost 7.5% of its market value on that day.
SFR having 28.6 million subscribers versus 1.7 million for Numericable and much more notoriety, Patrick Drahi announced that SFR will replace Numericable. In late 2015, Numericable Outremer became SFR Caraïbe. On 15 February 2016, Numericable was rebranded as SFR in Belgium and Luxembourg, with the launch of new packages and the SVOD service Zive.
In February 2016, Orange, SFR and Free announced the purchase of their competitor Bouygues Telecom. However, negotiations for the purchase agreement fell through a few months later.
In December 2016, Altice sold SFR Belux to Telenet. SFR was merged in Belgium with Telenet on 31 March 2019,
|
https://en.wikipedia.org/wiki/SEN
|
SEN may refer to:
Technology
Small extension node
Software Engineering Notes, a publication by the Association for Computing Machinery
Sony Entertainment Network, a digital media delivery service
Other uses
Senegal (the ISO 3166-1 alpha-3 country code)
Sports Entertainment Network, radio network in Australia
1116 SEN, a sports radio station in Melbourne, Australia owned by Sports Entertainment Network
London Southend Airport (IATA airport code)
Special educational needs
State Enrolled Nurse
See also
Sen (disambiguation), for forms of the word which are not acronyms
de:SEN
fr:SEN
pt:Necessidades educativas especiais
|
https://en.wikipedia.org/wiki/The%20Mark%20of%20Conte
|
The Mark of Conte is a children's book written by American author Sonia Levitin.
It concerns a teenager who creates two identities in his high school computer in order to garner his required credits in a shorter time. Although the main plot line is fictional, the character Conte Mark (aka Mark Conte) is based on Sonia Levitin's son Daniel Levitin, and some incidents are based on his actual experiences as a student at Palos Verdes High School, in Los Angeles County, in the 1970s.
References
(2001). "USM de Grummond Collection - Sonia Levitin Papers". Retrieved Jul 8, 2005.
(1982). "California Young Readers Medal". Retrieved September 14, 2006
1976 American novels
American children's novels
Novels set in high schools and secondary schools
1976 children's books
Atheneum Books books
Works by Sonia Levitin
|
https://en.wikipedia.org/wiki/Deletion
|
Deletion or delete may refer to:
Computing
File deletion, a way of removing a file from a computer's file system
Code cleanup, a way of removing unnecessary variables, data structures, cookies, and temporary files in a programming language
Delete key, a key on modern computer keyboards that erases text
Delete character, DEL, the delete control code in ASCII and C0 and C1 control codes
delete (C++) operator, a built-in operator in the C++ programming language
Arts and entertainment
Deletion (music industry), a term for removing a record from a label's catalog
Delete (miniseries), a 2013 TV miniseries
Deleted (film), a 2022 Singaporean-Malaysian film
Music
"Delete" (Dara Bubamara song), 2012
"Delete" (DMA's song), 2014
"Delete" (Story Untold song), 2017
"Deletion", a song by Hans Zimmer from Dark Phoenix (soundtrack), 2019
"Delete", a song by Capsule from Caps Lock, 2013
"Delete", a song by Killing Joke from Pylon, 2015
"Delete", a song by Shinedown from Planet Zero, 2022
"Delete", a song by Younha from Gobaek Ha Gi Joheun Nal, 2007
"Deleted", a song by Tech N9ne and MacKenzie Nicole from The Storm, 2016
Other uses
Deletion (genetics), deletion of a gene or chromosome segment, symbolized in the literature by a Δ symbol
Elision, the deletion of a sound or sounds
Ellipsis (linguistics), grammatical deletion of a word
Deletion of articles on Wikipedia
See also
Erasure (disambiguation)
Erase (disambiguation)
|
https://en.wikipedia.org/wiki/Phoenix%20Five
|
Phoenix Five is an Australian science fiction television series which first screened on the ABC in 1970. It was later also screened on the Seven Network. It was part of a trilogy and followed on from the six part serial The Interpretaris in 1966 and seven part serial Vega 4 in 1968. However, it had 26 standalone episodes produced to make it viable as a syndicated series. Each of the series had different crews and casts but took place in the same future and used the same space organisation and miniatures, much as Star Trek did in the '80s and '90s, thus making it the first TV sci-fi franchise.
Plot
The series was set in the year 2500 AD and followed the adventures of the crew of the galactic patrol ship Phoenix Five, "the most sophisticated craft in the Earth Space Control Fleet." This handpicked team consisted of Captain Roke, a typical heroic Kirk-style commander with a solution to every problem; Ensign Adam Hargraves, his stalwart young second-in-command always ready to shoot first and skip the questions; compassionate young navigator Cadet Tina Kulbrick; and their clunky, glass-domed Computeroid robot Karl. Together they patrolled the outer galaxies defending the innocent and warding off the repeated plots and attacks of the evil balding, blue-skinned humanoid Zodian of Zebula 9 and the eccentric pointy-eared renegade scientist Platonus.
Zodian originally appeared in Vega 4, and he and his head-shaped twin computers Alpha and Zeta were in the first 13 episodes of Phoenix Five, then were replaced by Platonus and his Cockney-accented computer Tommy for the latter half. This was due to a production break caused by the untimely death of producer Peter Summerton. He was replaced by John Walters.
Production
Phoenix Five was produced in 1969 in Sydney by Artransa Park Television in association with the Australian Broadcasting Commission and Amalgamated Television Services. The series premiered on ABC television on Friday 24 April 1970 at 5:40pm with other states following in May 1970. It was also sold internationally and screened in the UK and other overseas markets in the 1970 & 1980s. It was repeated on the ABC in 1975 with the advent of Colour TV and last screened on ATN 7 and regional stations including WIN 4 Wollongong in the early 80's. All episodes exist complete in The National Sound and Film Archive but there has been no commercial release of the series, although odd eps of Interpretaris and Vega 4 and a dozen or so off air recordings of Phoenix Five have circulated among TV collectors since the 90's and found their way to YouTube at various times.
The series has often been belittled as a "Star Trek with gumtrees" but the original Interpretaris was made before Star Trek screened in Australia and it resembles more the children's TV space adventure series of the Fifties and Sixties like Rocky Jones, Space Ranger and Fireball XL5, which had been screened a number of times on Australian television. It has also been criticized for its low
|
https://en.wikipedia.org/wiki/Decomposition%20%28computer%20science%29
|
Decomposition in computer science, also known as factoring, is breaking a complex problem or system into parts that are easier to conceive, understand, program, and maintain.
Overview
There are different types of decomposition defined in computer sciences:
In structured programming, algorithmic decomposition breaks a process down into well-defined steps.
Structured analysis breaks down a software system from the system context level to system functions and data entities as described by Tom DeMarco.<ref>Tom DeMarco (1978). Structured Analysis and System Specification. New York, NY: Yourdon, 1978. , .</ref>
Object-oriented decomposition, on the other hand, breaks a large system down into progressively smaller classes or objects that are responsible for some part of the problem domain.
According to Booch, algorithmic decomposition is a necessary part of object-oriented analysis and design, but object-oriented systems start with and emphasize decomposition into objects.
More generally, functional decomposition in computer science is a technique for mastering the complexity of the function of a model. A functional model of a system is thereby replaced by a series of functional models of subsystems.
Decomposition topics
Decomposition paradigm
A decomposition paradigm in computer programming is a strategy for organizing a program as a number of parts, and it usually implies a specific way to organize a program text. Usually the aim of using a decomposition paradigm is to optimize some metric related to program complexity, for example the modularity of the program or its maintainability.
Most decomposition paradigms suggest breaking down a program into parts so as to minimize the static dependencies among those parts, and to maximize the cohesiveness of each part. Some popular decomposition paradigms are the procedural, modules, abstract data type and object oriented ones.
The concept of decomposition paradigm is entirely independent and different from that of model of computation, but the two are often confused, most often in the cases of the functional model of computation being confused with procedural decomposition, and of the actor model of computation being confused with object oriented decomposition.
Decomposition diagram
A decomposition diagram shows a complex, process, organization, data subject area, or other type of object broken down into lower level, more detailed components. For example, decomposition diagrams may represent organizational structure or functional decomposition into processes. Decomposition diagrams provide a logical hierarchical decomposition of a system.
See also
Code refactoring
Component-based software engineering
Dynamization
Duplicate code
Event partitioning
How to Solve It''
Integrated Enterprise Modeling
Personal information management
Readability
Subroutine
References
External links
Object Oriented Analysis and Design
On the Criteria To Be Used in Decomposing Systems into Modules
|
https://en.wikipedia.org/wiki/Formula%20One%202001%20%28video%20game%29
|
Formula One 2001 is a racing video game developed by Studio 33 for the PlayStation version and Studio Liverpool for the PlayStation 2 version and published by Sony Computer Entertainment Europe in PAL regions for both systems. The PlayStation 2 version was published in North America by Sony Computer Entertainment America under the 989 Sports brand. It is a sequel to the 2000 video game Formula One 2000 and was based on the 2001 Formula One World Championship. This game is the last game to be released in North America until Formula One Championship Edition.
In some editions, a DVD was given for free. The DVD offers a commentated review of the 2000 Formula One World Championship, race by race, with the option to toggle between viewing the main stream, an on-board car camera, view the pitlane or see on-screen data such as lap times and positions. These features were used in the former pay-per-view F1 Digital+'s interactive coverage.
Gameplay
The game's "arcade" mode followed a similar line to that of Formula One 2000, although incentives were now offered in the form of upgrades to the player's car.
A new mode — "Challenge" mode — was introduced. In Challenge mode, players were given a lap around Spa-Francorchamps in Jenson Button's Benetton B201. Players who achieved a fast lap time were given a verification code, and the opportunity to post their winning times on the Internet to compare their times to other people's if they have an account.
Development
Formula One 2001 was created with the help of Benetton, Jaguar, Jordan and Arrows. Many of the employees from former franchise owner Psygnosis aided in the development. At the peak of development, the game was worked upon by 25 people with a majority of them being programmers and artists.
The game's engine was based upon a Research and Development project that began two years before the release of the game. This was to develop the physics, collision and A.I. for the game. Sony had an extensive reference library for the tracks including aerial photographs, close-ups of the tracks and over 200 hours of race footage from F1 Digital+. The PlayStation 2 graphical capabilities allowed the team to include more detail such as trackside details which were previously omitted and unique cockpit camera angles.
Studio Liverpool managed to contact Formula One Administration who provided audio samples for all the cars. However, some of the audio samples provided were believed to be unsuitable. To rectify this, the developers spoke to Jordan and Prost and Sound Engineer Michael de Belle visited the garages to record the engine noises from the cars. The original PlayStation's central processing unit was used for sound processing.
Promotion
At the 2001 United States Grand Prix, Sony held a variety of sport promotions with Jenson Button and a multi-million advertising campaign. The advertising efforts in the United States included a national television campaign via network, cable and syndication sports programmi
|
https://en.wikipedia.org/wiki/Formula%20One%20Arcade
|
Formula One Arcade is a racing video game developed by Studio 33 and published by Sony Computer Entertainment exclusively for PlayStation.
Gameplay
Formula One Arcade is based on the 2001 Formula One World Championship, though the game was centered on hectic racing action and is considered unrealistic. Players compete in a faster paced race consisting of a few laps, collecting checkpoints and pickups such as a speed boost, large tires (which give the car more grip) and shields. Gameplay resembles that of Mario Kart, rather than that of traditional Formula One games.
References
External links
2002 video games
Europe-exclusive video games
Formula One video games
Multiplayer and single-player video games
PlayStation (console) games
PlayStation (console)-only games
Sony Interactive Entertainment games
Video games developed in the United Kingdom
Video games set in Australia
Video games set in Austria
Video games set in Malaysia
Video games set in São Paulo
Video games set in Barcelona
Video games set in Monaco
Video games set in Montreal
Sports video games set in France
Video games set in England
Sports video games set in Germany
Video games set in Hungary
Video games set in Belgium
Sports video games set in Italy
Video games set in Indianapolis
Sports video games set in Japan
Studio 33 games
|
https://en.wikipedia.org/wiki/Formula%20One%202002%20%28video%20game%29
|
Formula One 2002 is a racing video game developed by Studio Liverpool and published by Sony Computer Entertainment exclusively for PlayStation 2. It is a sequel to the 2001 video game Formula One 2001 and was based on the 2002 Formula One World Championship.
The first issues of this game came with a DVD of the 2001 Formula One World Championship that was not commercially released which featured multi-angles and footage from the defunct F1 Digital, a pay-per-view service which allowed the purchaser access to multiple camera shots, sessions and a choice to follow cars as the sessions progressed.
Gameplay
The game features all the drivers and tracks from the 2002 Formula One World Championship, but does not represent the replacement driver that featured in the real 2002 Formula One World Championship, therefore Anthony Davidson is not featured. Although the Arrows team collapsed after the 2002 German Grand Prix in the real 2002 Formula One World Championship, players and AI can still drive Arrows cars in later Grands Prix in the game.
This marked the first ever Formula One game to feature the Launch Control and Traction Control despite the system being introduced prior to the 2001 Spanish Grand Prix.
Alcohol related tobacco sponsors
All related tobacco sponsors are censored:
Ferrari's Marlboro is completely censored.
Jaguar's Beck's is replaced by "Best's".
Williams' Veltins is replaced by the normal colour of the car.
McLaren's West is replaced by "David" and "Kimi" (just as in real life).
BAR's Lucky Strike is blocked out and replaced by "Look Alike".
Jordan's Benson & Hedges is replaced by a bar code.
Renault's Mild Seven is completely censored.
Errors and mistakes
On the "Race Select" mode, the A1-Ring section wrongly mentioned the 2001 pole position driver was Juan Pablo Montoya (in the real life Michael Schumacher).
On the "Team Select" mode, the Sauber section pictured in wrong Red Bull Sauber Petronas logo instead of then-new logo.
Reception
The game received "average" reviews according to the review aggregation website Metacritic. In Japan, Famitsu gave it a score of 27 out of 40.
References
External links
2002 video games
Formula One video games
Multiplayer and single-player video games
PlayStation 2 games
PlayStation 2-only games
Psygnosis games
Sony Interactive Entertainment games
Video game sequels
Video games developed in the United Kingdom
Video games set in Australia
Video games set in Malaysia
Video games set in São Paulo
Video games set in Austria
Video games set in Barcelona
Video games set in Monaco
Video games set in Montreal
Sports video games set in France
Video games set in England
Sports video games set in Germany
Video games set in Hungary
Video games set in Belgium
Sports video games set in Italy
Video games set in Indianapolis
Sports video games set in Japan
|
https://en.wikipedia.org/wiki/Formula%20One%202003%20%28video%20game%29
|
Formula One 2003 is a racing video game developed by Studio Liverpool and published by Sony Computer Entertainment exclusively for PlayStation 2. It is a sequel to the 2002 video game Formula One 2002 and was based on the 2003 Formula One World Championship.
Gameplay
The game features all ten teams and twenty drivers competing in the 2003 Formula One World Championship (except for mid-season changes), as well as the sixteen circuits and Grands Prix that formed the championship calendar. The game also includes the new one-shot qualifying rules and points system introduced for the 2003 Formula One World Championship, as well as the alterations to the Hungaroring and Suzuka circuits.
There are eleven game modes available for single and multiplayer, including single-player arcade and simulation single race, time trial and championship modes, multiplayer for up to 4 players and a non-interactive spectator option. Online connectivity is not supported.
The game features all the drivers and tracks from the 2003 Formula One World Championship, but does not represent the replacement drivers that featured in the real 2003 Formula One World Championship, therefore Nicolas Kiesa, Zsolt Baumgartner, Marc Gené and Takuma Sato are not featured.
Development
Formula One 2003 was announced in a press release from Sony Computer Entertainment on in June 2003 with a July release date. The game was the first Formula One series to have an exclusive license from the Formula One Administration (FOA), which is responsible for the commercial rights and promotion of the Formula One world championship. The exclusive license granted Sony Computer Entertainment the sole rights to the Formula One series for four years.
Circuits
The game features 16 official Formula One circuits based on the 2003 Formula One World Championship.
Albert Park Circuit; Australian Grand Prix
Sepang International Circuit; Malaysian Grand Prix
Interlagos; Grande Prêmio do Brasil
Autodromo Enzo e Dino Ferrari; Gran Premio di San Marino
Circuit de Barcelona-Catalunya; Gran Premio de España
A1-Ring; Grosser Preis von Osterreich
Circuit de Monaco; Grand Prix de Monaco
Circuit Gilles Villeneuve; Grand Prix du Canada
Nürburgring Großer Pries-Strecke; Grand Prix of Europe
Circuit de Nevers Magny-Cours; Grand Prix de France
Silverstone Circuit; British Grand Prix
Hockenheimring; Großer Preis von Deutschland
Hungaroring; Magyar Nagydíj
Autodromo Nazionale di Monza; Gran Premio d'Italia
Indianapolis Motor Speedway Grand Prix Layout; United States Grand Prix
Suzuka International Racing Course; Japanese Grand Prix
Covers
Similar to the FIFA series, Formula One 2003 has different cover art depending on the region. David Coulthard's McLaren MP4-17D is used on the European/Global release. Fernando Alonso's Renault R23B was used on the Spanish release. Michael Schumacher's Ferrari F2003-GA is moved from the second car to the leading car for the Italian release. Heinz-Harald Frentzen's Sauber C22
|
https://en.wikipedia.org/wiki/Formula%20One%2004
|
Formula One 04 is a racing video game developed by Studio Liverpool and published by Sony Computer Entertainment exclusively for PlayStation 2. It is a sequel to the 2003 video game Formula One 2003 and was based on the 2004 Formula One World Championship.
Gameplay
The game features all ten teams and twenty drivers competing in the 2004 Formula One World Championship (except for mid-season changes), as well as the eighteen circuits and Grands Prix that formed the championship, including the new Bahrain International Circuit and Shanghai International Circuit.
It is the first Formula One game developed by Studio Liverpool to contain a 'Career Mode', which allowed players to work their way through the Formula One teams over the course of a fixed number of seasons (albeit a repeat version of the 2004 Formula One World Championship each time). Players would start out testing in a generic Formula One car, and if they did well enough in the test they would be offered a contract by a small team such as Minardi. Players would then work their way up the grid throughout their 'career' through a mixture of good tests and impressive race performances. This game also had Net Play available.
This is the only F1 game in the series to be changed in terms of gameplay after the original release. In the original version, there was a bug which during the timing of AI pitstops all the field crawled at pit lane speed, then they sped up once a few of the AI cars had made their stop, and it was very common to be following a car which suddenly came to a halt and the player would end up hitting their rear and ending their race. Studio Liverpool responded to the fans' concerns about this issue and fixed this bug upon the release of the Platinum version.
Formula One 04 was released in Europe (PAL) and Japan (NTSC). The game features all the drivers and tracks from the 2004 Formula One World Championship, but does not represent the replacement drivers that featured in the real 2004 Formula One World Championship, therefore Timo Glock, Marc Gené, Antônio Pizzonia, Jacques Villeneuve and Ricardo Zonta are not featured.
Development
Formula One 04 was announced in April 2004 by Sony Computer Entertainment, and was the second game in the exclusive deal between Sony Computer Entertainment and Formula One Administration, following Formula One 2003. The game was officially launched in London ahead of the 2004 British Grand Prix with model Emma B acting as the face of the game.
Alcohol and tobacco-related sponsors
All alcohol and tobacco sponsors are censored:
Ferrari's Marlboro is completely censored.
McLaren's West is replaced by "David", "Kimi", and "Team" (in career mode) (like in real life).
Renault's Mild Seven is replaced by the car numbers and the drivers’ full names (like in real life).
Jaguar's Beck's is replaced by "Best's".
BAR's Lucky Strike is replaced by "Look Left", "Look Right", and "Don’t Walk", with a barcode and Formula One cars.
Williams's Budweiser is repl
|
https://en.wikipedia.org/wiki/Formula%20One%2005
|
Formula One 05 is a racing video game developed by Studio Liverpool and published by Sony Computer Entertainment exclusively for PlayStation 2. It is a sequel to the 2004 video game Formula One 04 and was based on the 2005 Formula One World Championship.
Gameplay
It featured the 'Career Mode' concept from Formula One 04, which allows players to work their way through the Formula One teams over the course of five years (albeit a repeat version of the 2005 Formula One World Championship each time). This game also supports EyeToy: Cameo, allowing players to place their own face on a driver when creating their profile, but unlike F1 04, though they cannot choose their own helmet at the start, the player assumes a white unmarked helmet and only later unlocks other colours and designs.
Players start out testing for smaller teams such as Minardi, Jordan and Red Bull Racing. Like in F1 04, a generic car does exist, but it is only used in Time Attack mode. Players then work their way up the grid throughout their 'career' through a mixture of good tests and impressive race performances. As before, consistently poor performances will lead to dismissal from the player's current team. There are also occasional 'shoot-out' tests against the team's second driver (or third driver, depending on the player's current status within the team), in which both drivers complete a set of five laps each and whoever has the fastest overall time (one time based on the fastest first, second and third sectors added together) then takes the race seat. Players can now also view trophies they have received from winning races and championships after each is won in Career Mode for the first time.
As with F1 04, "classic" cars (like the Williams FW11) are unlocked once certain terms are fulfilled, such as winning a World Championship. Helmets for Career Mode are also unlocked, and there is also a hidden track (the Detroit street circuit which was used for Detroit Grand Prix) and the Paul Ricard circuit in France available for Time Attack Mode. Notably, since this game was developed before the change in the qualifying regulations midway through the actual 2005 Formula One World Championship, this game runs the original "aggregated times" format from the early part of the actual 2005 Formula One World Championship in every race in Race Weekend, Championship and Career Mode. This game also has Net Play available. A notable credit is the opening video features the song "Butterflies & Hurricanes" from English alternative rock band Muse.
The game features all the drivers and tracks from the 2005 Formula One World Championship, but does not represent the replacement drivers that featured in the real 2005 Formula One World Championship, therefore Vitantonio Liuzzi, Alexander Wurz, Ricardo Zonta, Anthony Davidson, Pedro de la Rosa, Robert Doornbos and Antônio Pizzonia are not featured.
Reception
The game received "generally favorable" reviews according to the review aggregation website
|
https://en.wikipedia.org/wiki/Software%20Bisque
|
Software Bisque, Inc. (formerly named Computer Assist Services) is a corporation based in Golden, Colorado that develops robotics telescope mounts and accessories and publishes software used in astronomy. It was founded in 1984 by current president and CEO, Stephen M. Bisque.
History
Bisque initially developed and marketed custom financial software and also sold a DOS-based astronomy program named TheSky. At that time, the company was based in Bisque's home in Golden, Colorado.
In 1990, Bisque hired his brothers Thomas, Daniel and Matthew. Together they ported TheSky for DOS to Windows 3.0. In 1992, TheSky for Windows was released. The product has been under continuous development since it was first released in the early 1980s; the current version is known as TheSkyX.
Products
Software Bisque has since developed and sold many astronomy-related products, including:
TheSky, TheSkyX Astronomy Software, Camera Add On, Dome Add On, and TPoint Add On
TheSky Pocket Edition for Windows Mobile devices
CCDSoft, a program for the acquisition and development of CCD images
TPoint for Windows, telescope analysis and pointing correction software
Orchestrate, a program for automating multiple astronomy devices, allowing fully automatic operation and data acquisition
Seeker, an OpenGL three-dimensional solar system simulator
AutomaDome, astronomical dome control software
PrecisionPEC, periodic error correction modeling software
Paramount ME, Paramount ME II, Paramount MX, Paramount MYT German equatorial telescope mounts, and the Paramount Taurus equatorial fork mounts (models 400, 500 and 600), all models include the Paramount Software Suite for integrated software control on Mac, Windows and Linux operating systems
BisqueTCS, a dual-axis DC servomotor telescope motion control system
Amateurs have discovered over 500 new objects (including comets, minor planets, supernovas, and cataclysmic variable stars) using these products.
References
External links
Software companies based in Colorado
Companies based in Golden, Colorado
Software companies of the United States
|
https://en.wikipedia.org/wiki/Actor%20model%20theory
|
In theoretical computer science, Actor model theory concerns theoretical issues for the Actor model.
Actors are the primitives that form the basis of the Actor model of concurrent digital computation. In response to a message that it receives, an Actor can make local decisions, create more Actors, send more messages, and designate how to respond to the next message received. Actor model theory incorporates theories of the events and structures of Actor computations, their proof theory, and denotational models.
Events and their orderings
From the definition of an Actor, it can be seen that numerous events take place: local decisions, creating Actors, sending messages, receiving messages, and designating how to respond to the next message received.
However, this article focuses on just those events that are the arrival of a message sent to an Actor.
This article reports on the results published in Hewitt [2006].
Law of Countability: There are at most countably many events.
Activation ordering
The activation ordering (-≈→) is a fundamental ordering that models one event activating another (there must be energy flow in the message passing from an event to an event which it activates).
Because of the transmission of energy, the activation ordering is relativistically invariant; that is, for all events e1.e2, if e1 -≈→ e2, then the time of e1 precedes the time of e2 in the relativistic frames of reference of all observers.
Law of Strict Causality for the Activation Ordering: For no event does e -≈→ e.
Law of Finite Predecession in the Activation Ordering: For all events e1 the set {e|e -≈→ e1} is finite.
Arrival orderings
The arrival ordering of an Actor x ( -x→ ) models the (total) ordering of events in which a message arrives at x. Arrival ordering is determined by arbitration in processing messages (often making use of a digital circuit called an arbiter). The arrival events of an Actor are on its world line. The arrival ordering means that the Actor model inherently has indeterminacy (see Indeterminacy in concurrent computation).
Because all of the events of the arrival ordering of an actor x happen on the world line of x, the arrival ordering of an actor is relativistically invariant. I.e., for all actors x and events e1.e2, if e1 -x→ e2, then the time of e1 precedes the time of e2 in the relativistic frames of reference of all observers.
Law of Finite Predecession in Arrival Orderings: For all events e1 and Actors x the set {e|e -x→ e1} is finite.
Combined ordering
The combined ordering (denoted by →) is defined to be the transitive closure of the activation ordering and the arrival orderings of all Actors.
The combined ordering is relativistically invariant because it is the transitive closure of relativistically invariant orderings. I.e., for all events e1.e2, if e1→e2. then the time of e1 precedes the time of e2 in the relativistic frames of reference of all observers.
Law of Strict Causality for the Combined Ordering: Fo
|
https://en.wikipedia.org/wiki/Actor%20model%20implementation
|
In computer science, Actor model implementation concerns implementation issues for the Actor model.
Cosmic Cube
The Caltech Cosmic Cube was developed by Chuck Seitz et al. at Caltech providing architectural support for Actor systems. A significant difference between the Cosmic Cube and
most other parallel processors is that this multiple instruction
multiple-data machine uses message passing
instead of shared variables for communication between
concurrent processes. This computational model is reflected
in the hardware structure and operating system,
and is also the explicit message passing communication seen by the programmer. According to Seitz [1985]:
It was a premise of the Cosmic Cube experiment that the internode communication should scale well to very large numbers of nodes. A direct network like the hypercube satisfies this requirement, with respect to both the aggregate bandwidth achieved across the many concurrent communication channels and the feasibility of the implementation. The hypercube is actually a distributed variant of an indirect logarithmic switching network like the Omega or banyan networks: the kind that might be used in shared-storage organizations. With the hypercube, however, communication paths traverse different numbers of channels and so exhibit different latencies. It is possible, therefore, to take advantage of communication locality in placing processes in nodes.
J–Machine
The J–Machine was developed by Bill Dally et al. at MIT providing architectural support suitable for Actors.
This included the following:
Asynchronous messaging
A uniform space of Actor addresses to which messages could be sent concurrently regardless of whether the recipient Actor was local or nonlocal
A form of Actor pipelining (see Actor model)
Concurrent Smalltalk (which can be modeled using Actors) was developed to program the J Machine.
Prototype Actor Programming Language
Hewitt [2006] presented a prototype Actor programming language in the sense that it directly expresses important aspects of the behavior of Actors.
Messages are expressed in XML using the notation
:<tag>[<element>1 ... <element>] for
“<”<tag>“>” <element>1 ... <element>n “<”/<tag>“>”
The semantics of the programming language are defined by defining each program construct as an Actor with its own behavior. Execution is modeled by having Eval messages passed among program constructs during execution.
Environment Actors
Each Eval message has the address of an Actor that acts as an environment with the bindings of program identifiers. Environment Actors are immutable, i.e., they do not change.
When Request[Bind[identifier value] customer] is received by an Actor Environment, a new environment Actor is created such that
when the new environment Actor receives
Request[Lookup[identifier’] customer’] then if identifier is the same as identifier’ send customer’ Returned[value], else send Environment
Request[Lookup[identifier’] customer’].
The above builds on an Actor Em
|
https://en.wikipedia.org/wiki/Larry%20Rosenstock
|
Larry Rosenstock was the C.E.O. of the San Diego-based High Tech High, a network of charter schools and a graduate school of education.
He is also the President of the HTH Graduate School of Education.
Education
He got his Bachelor of Arts in Psychology at Brandeis University in 1970. In 1985 got a Master's of Education in Education Administration at Cambridge College.
In 1986 he received a law degree from Boston University School of Law.
Career
During and after law school at Boston University, Rosenstock taught carpentry and woodworking classes to urban youth for a total of eleven years. He also worked as staff attorney for two years at the Harvard Center for Law and Education, and was a lecturer at the Harvard Graduate School of Education for five years. He was a principal of the Rindge School of Technical Arts, and of the Cambridge Rindge and Latin School. He created a program “CityWorks”, which won the Ford Foundation Innovations in State and Local Government Award in 1992.
Rosenstock was the director from 1996 to 1997 of the New Urban High School Project, an effort funded by the U.S. Department of Education to find and describe new models for urban high schools. Rosenstock and his team created three design principles that seemed to be common in the successful urban high schools that they found. These design principles are personalization, real-world connection, and common intellectual mission.
He moved to San Diego to become the president of the Price Charitable Fund from 1997 to 1999.
In 2000, Rosenstock became the C.E.O. and founding principal of High Tech High, first one school and now part of the High Tech High umbrella organization that currently runs sixteen schools in California.
Awards include being named an Ashoka Fellow in 2002 and a Harold W. McGraw, Jr. Prize in Education winner in 2010.
References
Education in San Diego
High Tech High charter schools
Living people
Year of birth missing (living people)
Ashoka USA Fellows
|
https://en.wikipedia.org/wiki/WSFJ-TV
|
WSFJ-TV (channel 51) is a television station licensed to London, Ohio, United States, broadcasting the digital multicast network Bounce TV to the Columbus area. Owned and operated by the Ion Media subsidiary of the E. W. Scripps Company, the station maintains studios on North Central Drive in Lewis Center, Ohio.
Even though WSFJ-TV is licensed as a full-power station, its broadcasting radius only covers the immediate Columbus area, as it shares spectrum with low-power, Class A Daystar station WCLL-CD, which transmits from a tower on Twin Rivers Drive near downtown Columbus. Therefore, WSFJ-TV relies on cable and satellite carriage to reach the entire market.
History
WSFJ-TV began operations on March 9, 1980. Originally licensed to Newark, east of Columbus, it was the first independent television station in Columbus, and the first new commercial station in the area since 1949. On paper, Columbus had grown large enough to support an independent station as far back as the late 1960s. However, the Columbus area is a very large market geographically, stretching across a large swath of central Ohio. The only available full-power allocations in the market were on UHF, and UHF stations do not carry well across large blocks of territory. By the late 1970s, cable television had gained enough penetration to make an independent station viable. Prior to the arrival of WSFJ, Columbus-area cable systems imported the signals of independents from nearby areas, such as WXIX-TV in Cincinnati, WUAB in Cleveland and WTTV in Indianapolis.
The new station ran only Christian programs, including The PTL Club, Jimmy Swaggart, The 700 Club, Another Life, and children's programming. In the fall of 1980, WSFJ began running secular programming such as Independent Network News and New Zoo Revue during the weekdays, along with Wild Kingdom and other hunting and wildlife shows on Saturdays. However, the schedule remained predominantly Christian, and its policy regarding secular programming was very conservative so as not to offend the sensibilities of its mostly fundamentalist and Pentecostal viewership. It was the only over-the-air source of non-network programming in central Ohio until WTTE (channel 28) signed on in 1984.
In February 1999, the station affiliated with Pax TV (later i: Independent Television, now Ion Television), running the network's programming from 11 a.m. to 7 p.m. and again from 10 p.m. to 1 a.m. WSFJ also began to be seen on a translator in Columbus, WCPX-LP (channel 48), which was owned by Pax's parent company, Paxson Communications (now Ion Media). Before this, Pax programming was seen overnights on WWHO, a WB affiliate then owned by the Paramount Stations Group. WSFJ was the largest Ion affiliate owned by a company other than Ion Media Networks. While WSFJ was affiliated with Pax, WCMH-TV (channel 4), the local NBC owned-and-operated station, reaired their NewsChannel 4 newscasts on channel 51, as part of an agreement with NBC and Pax.
WSFJ was so
|
https://en.wikipedia.org/wiki/FR2
|
FR2 may refer to:
Forschungsreaktor 2, the first entirely German-built nuclear research reactor
Fostex, Field Memory Recorder (FR-2)
France 2, a French public TV network
FR2 (Lazio regional railways), a rail network in the Rome area
FR-2, synthetic resin bonded paper, often used in electronics
FR2, a Japanese fashion brand owned by Ceno Company
|
https://en.wikipedia.org/wiki/Government%20Telephone%20Preference%20Scheme
|
The Government Telephone Preference Scheme (GTPS) was a British system for limiting outgoing calls from landlines if the network was overloaded during an emergency. Numbers registered under the GTPS were still be able to make outgoing calls if the service was limited. All telephones were still be able to receive calls. The scheme was decommissioned in 2017.
There were three categories of use – the most essential were called Preference Category I, limited to 2% of lines of a telephone exchange. According to a British government document, they were intended to be limited to "lines vital to the prosecution of war and to national survival". The second category – Preference Category II – were for lines needed for the community and these and Preference Category II were limited in total to 10% of the exchange. All other users were in Category III.
The scheme was established in the 1950s. The scheme ceased to accept new numbers from 2013 due to the replacement by service providers of the infrastructure over which the scheme operated. The scheme was decommissioned in 2017.
Phones on the scheme included armed forces headquarters, local authority emergency planning centres, emergency services such as police, fire and ambulance and public telephone boxes. Since 1992 the United Kingdom Warning and Monitoring Organisation and Royal Observer Corps operational lines have been deleted from the scheme.
A similar scheme limiting mobile telephone access is called MTPAS (formerly ACCOLC).
See also
AUTOVON
Civil Contingencies Secretariat
References
Emergency management in the United Kingdom
History of telecommunications in the United Kingdom
|
https://en.wikipedia.org/wiki/Actor%20model%20and%20process%20calculi
|
In computer science, the Actor model and process calculi are two closely related approaches to the modelling of concurrent digital computation. See Actor model and process calculi history.
There are many similarities between the two approaches, but also several differences (some philosophical, some technical):
There is only one Actor model (although it has numerous formal systems for design, analysis, verification, modeling, etc.); there are numerous process calculi, developed for reasoning about a variety of different kinds of concurrent systems at various levels of detail (including calculi that incorporate time, stochastic transitions, or constructs specific to application areas such as security analysis).
The Actor model was inspired by the laws of physics and depends on them for its fundamental axioms, i.e. physical laws (see Actor model theory); the process calculi were originally inspired by algebra .
Processes in the process calculi are anonymous, and communicate by sending messages either through named channels (synchronous or asynchronous), or via ambients (which can also be used to model channel-like communications ). In contrast, actors in the Actor model possess an identity, and communicate by sending messages to the mailing addresses of other actors (this style of communication can also be used to model channel-like communications—see below).
The publications on the Actor model and on process calculi have a fair number of cross-references, acknowledgments, and reciprocal citations (see Actor model and process calculi history).
How channels work
Indirect communication using channels (e.g. Gilles Kahn and David MacQueen [1977]) has been an important issue for communication in parallel and concurrent computation affecting both semantics and performance. Some process calculi differ from the Actor model in their use of channels as opposed to direct communication.
Synchronous channels
Synchronous channels have the property that a sender putting a message in the channel must wait for a receiver to get the message out of the channel before the sender can proceed.
Simple synchronous channels
A synchronous channel can be modeled by an Actor that receives put and get communications. The following is the behavior of an Actor for a simple synchronous channel:
Each put communication has a message and an address to which an acknowledgment is sent when the message is received by a get communication from the channel in FIFO order.
Each get communication has an address to which the received message is sent.
Synchronous channels in process calculi
However, simple synchronous channels do not suffice for process calculi such as Communicating Sequential Processes (CSP) [Hoare 1978 and 1985] because use of the guarded choice (after Dijkstra) command (called the alternative command in CSP). In a guarded choice command multiple offers (called guards) can be made concurrently on multiple channels to put and get messages; however at most one of
|
https://en.wikipedia.org/wiki/Backstage.bbc.co.uk
|
backstage.bbc.co.uk is the brand name (and URL) of the BBC's developer network which operated between May 2005 and December 2010.
Purpose
Launched partly as a response to the Graf Review of bbc.co.uk, the aims of backstage.bbc.co.uk are to encourage innovation and creativity in the UK, and to identify new talent. According to the BBC's response to the Graf report, the site aims to
History
backstage.bbc.co.uk was created by Tom Loosemore, Ben Metcalfe and James Boardwell. It was piloted internally within the BBC in the Spring of 2005, then launched on 11 May 2005. Its aim was to encourage innovative use of the content across bbc.co.uk, including the BBC News website, by third-party developers.
The website came out of beta as an official site on 23 July 2005 at the backstage.bbc.co.uk OpenTech event which was organised by NTK and the UK Unix Users Group. It is sometimes referred to as BBC Backstage, although the official title of the project is backstage.bbc.co.uk.
The BBC admit that in the past they had not always welcomed amateur innovators who attempted to reuse BBC content, but through the backstage site they aimed to foster a dialogue with such developers and the wider community. This was essential as the BBC launched a video player online and the same community voiced their concerns. A peaceful DRM protest in February 2007 took place in London and Manchester by Defective by Design, BBC Backstage kept the dialogue open in their public mailing list and later in the first of many podcasts
In July 2006, backstage.bbc.co.uk won the New Statesman New Media Innovation award.
In December 2010, the project was closed.
An ebook retrospective was created to mark the end.
Feeds
XML feeds are available on the backstage website for people to build with on a non-commercial basis. A complete list of the feeds available can be found on the site, but they include RSS from the BBC News Website, TV listings (in TV-Anytime format) and travel delay data. The BBC's RSS feeds, which are a main component of their backstage philosophy, output around 500 unique pieces of news each and every day from its network of over 5000 journalists.
Events
In June 2007, backstage.bbc.co.uk and Yahoo! hosted a weekend Hack Day in North London's Alexandra Palace for several hundred developers and designers followed by a performance by The Rumble Strips. The event was hit by lightning on the Saturday morning.
Also in 2007, backstage.co.uk hosted the TV Unfestival at the International Television Festival in Edinburgh.
backstage.bbc.co.uk is currently part of BBC Research & Development. The department headed up by Matthew Postgate. The senior producer is Ian Forrester and development producer role is open. Matthew Cashmore used to be developer producer at backstage but now works for Lonely Planet, and Rain Ashford who now works for another BBC project in Media Literacy.
In April 2008, backstage.bbc.co.uk held a new event (based on the Yahoo! concept - Hack Day) called Ov
|
https://en.wikipedia.org/wiki/Ninjam
|
NINJAM stands for Novel Intervallic Network Jamming Architecture for Music. The software and systems comprising NINJAM provide a non-realtime mechanism for exchanging audio data across the internet, with a synchronisation mechanism based on musical form. It provides a way for musicians to "jam" (improvise) together over the Internet; it pioneered the concept of "virtual-time" jamming. It was originally developed by Brennan Underwood, Justin Frankel, and Tom Pepper.
Principle
Collaboratively creating many forms of music naturally relies on players' ability to keep time with each other. Excessive latency between players causes natural time keeping to be thrown awry. Typical network engineering practice does not allow for sufficiently low-latency data exchange mechanism even within cities, and the speed of light makes it impossible over regional or global distances.
In order to approach latency-free collaboration, NINJAM extends the latency, by delaying all received audio until it can be synchronised with other players. The delay is based on the musical form. This synchronisation means that each player hears the others in a session and can play along with them. NINJAM defines the form in terms of the "interval" - the number of beats to be recorded before synchronising with other players. For example, with an interval of 16, four bars of music in time would be recorded from each player, then played back to all others.
Reception
The process was described in Wired as "glitch-free", and "designed for musicians who enjoy realtime collaboration." In MIT Technology Review, the software's users are described as "really loyal" due to its free and open source status.
Other music product vendors have added support for NINJAM; Expert Sleepers, a vendor of electronic music hardware and software, added plugin support for NINJAM in 2006.
Technical background
Each player in a NINJAM session feeds audio data from their client to a server via a TCP/IP connection to a specific port (commonly in the range 2049 upwards, depending on the host).
The "client" here is only the component that the player uses to connect to a NINJAM server, encode and transmit their audio stream, receive and decode remote players' streams and handle the chat (IRC-like) session. Each player will also need some way of feeding audio information to the NINJAM client - either by using the client as a plugin in a DAW or by using the standalone version with a direct audio input.
Each client's data is synchronised against a distributed clock. This clocking is then used to distribute the data out to all the other clients so that they can play all the remote streams in sync. The server does little apart from manage connections, chat and data streaming.
Overview of usage
Clients and client setup considerations
Common considerations
All clients feed data at 0 dB to the server, regardless of local monitoring levels. When setting up, the NINJAM client "local" level is set to 0 dB. "Local"
|
https://en.wikipedia.org/wiki/Turner%20South
|
Turner South was an American cable and satellite television network that was owned by the Turner Broadcasting System division of Time Warner. At its peak, Turner South reached approximately eight million subscribers across a six-state region comprising Alabama, Georgia, Mississippi, Tennessee, South Carolina, and portions of western North Carolina (roughly from Asheville to Charlotte).
History
The channel launched on October 1, 1999 as the first regional entertainment network developed especially for viewers in the southern United States. Turner South's programming consisted of a mix of movies, drama series, sitcoms, regional news updates, and unique original programming. It also carried telecasts of professional sporting events from the Atlanta Braves Major League Baseball, Atlanta Hawks NBA, and Atlanta Thrashers NHL franchises, all of which were owned by the Turner Broadcasting System at the network's launch.
Turner South's original programs could be broadly termed "southern lifestyle", including cooking and gardening shows. The sitcoms and dramas featured on the network (such as Major Dad and In the Heat of the Night) also tended to appeal to Southerners, or were set in the South. Other series included Liars & Legends and Off The Menu which was based out of the Commander's Palace restaurant in New Orleans. Beginning in 2002, the channel also aired a live simulcast of radio program The Rick and Bubba Show.
News Corporation lawsuit
News Corporation filed a lawsuit against Turner Broadcasting and its corporate parent Time Warner in a Georgia Superior Court on June 15, 1999, citing that the plans Turner had unveiled to carry sports events on Turner South violated a non-compete agreement that the two companies signed as part of News Corporation's $65 million purchase of SportSouth (now Fox Sports South) in 1996, which prohibited Turner from launching a regional sports network in the southeastern United States until 2008. The suit was settled out of court with undisclosed terms.
Sale to Fox
On February 23, 2006, Fox Cable Networks, a subsidiary of News Corporation, agreed to purchase Turner South, for a reported $375 million. On May 1, 2006, Fox took over operations of the cable network, and the bulk of the Turner South schedule, including Rick and Bubba and the movie blocks, was discontinued. During the brief transition period which followed, repeats of Turner South's lifestyle and how-to programming (including Blue Ribbon, Home Plate, Home Makers, and Junkin') were aired in two weekday blocks (from 8:00-11:00 a.m. and 3:00-5:00 p.m. ET). Much of the remaining programming was repurposed from various Fox Sports Networks properties, most notably Fox Sports South.
On October 13, 2006, the network was officially relaunched as a second iteration of SportSouth, and was eventually renamed Fox Sports Southeast in October 2015. After Fox's sale of that property in 2019, it is now Bally Sports Southeast, operated with Bally Sports South.
References
S
|
https://en.wikipedia.org/wiki/A%20Hunka%20Hunka%20Burns%20in%20Love
|
"A Hunka Hunka Burns in Love" is the fourth episode of the thirteenth season of the American animated television series The Simpsons. It first aired on the Fox network on December 2, 2001. In the episode, Mr. Burns falls in love with Gloria, a woman who is much younger than he is and who turns out to be Snake Jailbird's ex-girlfriend.
The episode was written by John Swartzwelder, directed by Lance Kramer and dedicated to the memory of George Harrison. The episode featured, along with George Takei as a waiter and Karl Wiedergott as a delivery boy, Julia Louis-Dreyfus, who appeared as Mr. Burns' love interest Gloria.
The episode received positive reviews from critics following the thirteenth season's release on DVD and Blu-ray. The episode's title is a reference to the line "a hunk, a hunk of burning love" in the Elvis Presley song Burning Love.
Plot
The Simpsons visit a Chinese restaurant, where Homer is hired to write Chinese fortune cookies after complaining that the current fortunes are unimaginative. One of his fortunes says "You will find true love on Flag Day". This cookie makes its way to Mr. Burns on, coincidentally, Flag Day. Eager for true love at last, Burns and a reluctant Smithers spend the evening womanising at a wealthy social gathering and a strip club. With mere minutes left in the day, Burns finds a cop ticketing his car, which he had parked in the middle of the road. After discovering the cop is a beautiful woman named Gloria (voiced by Julia Louis-Dreyfus), Burns asks her out on a date. Gloria warily accepts, much to Burns' delight and Smithers' chagrin.
After a pleasant first date at the carnival, Burns asks about another date but Gloria is about to turn him down when Homer runs by. Burns asks Homer to vouch for him to Gloria, so Homer regales her by listing Burns' many exploits. After Gloria agrees to a second date, Burns enlists Homer to be his "youthful advisor", accompanying the couple on their next date at the disco hall, and even carrying Burns and Gloria up the stairs when they go to have sex. In these cases, Burns overcomes his weakness and extreme age by means of a powerful aphrodisiac (made from an extract of the "pocket fox", a species which only existed for three weeks in the 16th century).
Eventually, during a date at the bowling alley, Burns decides to ask Gloria to marry him. She says yes. As Burns goes off to get some champagne to celebrate, Snake comes to rob the bowling alley, and is surprised to see Gloria, who turns out to be his ex-girlfriend. Despite Gloria's protests, Snake kidnaps her and Homer. When Burns finds Gloria's ring, dropped in the commotion, he assumes she ran off with Homer. Snake takes Gloria and Homer to his hideout. Though Gloria says she loves Burns, Snake vows he can change. The police arrive and confront Snake. Homer tries to escape but instead sets Snake's house on fire. Snake and Homer get out and Burns runs in to save Gloria, however he is soon overcome by the smoke and Gloria
|
https://en.wikipedia.org/wiki/Sweets%20and%20Sour%20Marge
|
"Sweets and Sour Marge" is the eighth episode of the thirteenth season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on January 20, 2002. In the episode, Homer gathers Springfield's citizens to build the world's biggest human pyramid. When it collapses and fails to set the world record, Springfield earns the top spot as the world's fattest town. Marge sues Garth Motherloving's sugar company for making the town's citizens obese. When Springfield bans sugar, Homer conspires with Garth to smuggle it to town.
"Sweets and Sour Marge" was written by Carolyn Omine and directed by Mark Kirkland. It was dedicated to the memory of Ron Taylor. Omine conceived the episode after hearing about smokers who sued tobacco companies. While its plot is loosely based on Erin Brockovich, the episode also features references to Willy Wonka & the Chocolate Factory, What's Eating Gilbert Grape and Butterfinger. It also features Ben Stiller as Garth Motherloving.
In its original broadcast, the episode was seen by approximately 7.5 million viewers, finishing in 34th place in the ratings the week it aired. Following its home video release, the episode received mixed reviews from critics.
Plot
At a library sale, Homer buys a book on world records published by Duff. After boring everyone with world record trivia, Homer gathers the whole town to build the world's tallest human pyramid. When Jimbo and Kearney move their hands just before the record is claimed, the pyramid collapses into a giant sphere that rolls through town, collecting Agnes Skinner, Hans Moleman and a suicidal man about to jump from a ledge onto the street. The entire town rolls to a truck-weighing station and the Duff record book officials declare Springfield the world's fattest town, ahead of Milwaukee (in real life Chicago was the fattest city at the time of production).
The townsfolk are happy to have broken a world record, but Marge worries the whole town is overweight. She learns that nearly everything they eat contains sugar. After complaining to Garth Motherloving (nee Hitler), head of the Motherloving Sweets and Sugar Company, Marge sues the sugar industry with the help of Gil and Professor Frink. Judge Snyder, after Motherloving's attempt to bribe him with a briefcase full of sweets, emotionally refutes Motherloving, sides with Marge and bans all sugar products in Springfield, angering Homer and most of the town.
The whole town goes cold turkey and suffers from intense sugar withdrawal. Homer joins a secret group — led by Motherloving — which illegally schemes to return sugar to Springfield. Homer embarks with Bart, Apu, Mr. Burns and a cartoon vampire named Count Fudge-ula (who had testified against Motherloving at the trial) to smuggle sugar from the island of San Glucos. Although Lisa is hesitant over Homer and Bart's plans to break the law, she reluctantly condones their plan after Marge serves steamed limes as a sugar-free d
|
https://en.wikipedia.org/wiki/Out%20There%20%282003%20TV%20series%29
|
Out There is a drama television series produced by Sesame Workshop and Noggin LLC for the Noggin channel. It aired as part of Noggin's nighttime programming block, The N. When the show started development, Sesame Workshop co-owned Noggin, and Out There was launched as a tween-oriented project for the network. The show was written, produced, and commissioned in New York, and it originated as an entirely American series with a storyline set in New York. During development, it became an American-Australian co-production (then titled Two Down Under), and filming took place mostly in Australia.
The show's plot mirrors its co-development between the United States and Australia. It follows the trials and tribulations of an American high school boy named Reilly (Douglas Smith), who moves to Australia from Connecticut as his father flees the authorities. He stays with his aunt and uncle, who are the owners of a nature reserve and veterinary clinic. Reilly befriends his co-worker Aggie (Jade Ewen), a local boy named Miller (Richard Wilson), and the girl next door, Fiona (Molly McCaffrey).
The series premiered on Noggin on May 23, 2003, as the inaugural show of a scheduling event called "Summer in The N." The first four episodes were shown as a two-hour series premiere, and the remainder of the first season aired on Fridays at 9 p.m. in June and July 2003. The show ran for two seasons and 26 episodes in total. It aired its final new episode on July 1, 2004, with reruns continuing throughout the year.
Production
The show's concept was developed by Sesame Workshop and Noggin, both headquartered in New York. The show's plot started out as a "purely North American concept set in New York," without any Australian elements. It began production when the Noggin channel was co-owned and jointly operated by Nickelodeon and Sesame Workshop.
When the show was pitched to potential broadcasters overseas, two buyers—the ABC in Australia and the BBC in Britain—wanted to see the story regionalized so that it would appeal to viewers in their respective regions. The crew "went back to the drawing board" and revised the concept, turning the main character Reilly from an average American into an American displaced in Australia. The character of Aggie was added to hold appeal to British audiences. Both the ABC and the BBC provided funding for the show.
The show was first announced under the working title Two Down Under, which refers to two outsiders moving "down under" to Australia. The show aired as part of The N, a nighttime block on the Noggin channel for tween and teen-oriented shows. The show was specifically aimed at 9- to 13-year-olds, and it was marketed as a "tween drama."
According to executive producer Claire Henderson, accurately representing the American and British characters was easy, while faithfully depicting Australia was more difficult. She said, "Now this actually naturally worked with Reilly being the American and Aggie coming over from Britain. But yo
|
https://en.wikipedia.org/wiki/Harvard%20Mark%20III
|
The Harvard Mark III, also known as ADEC (for Aiken Dahlgren Electronic Calculator) was an early computer that was partially electronic and partially electromechanical. It was built at Harvard University under the supervision of Howard Aiken for use at Naval Surface Warfare Center Dahlgren Division.
Technical overview
The Mark III processed numbers of 16 decimal digits (plus sign), each digit encoded with four bits, though using a form of encoding that is different to conventional binary-coded decimal today. Numbers were read and processed serially, meaning one decimal digit at a time, but the four bits for the digit were read in parallel. The instruction length, however, was 38 bits, read in parallel.
It used 5,000 vacuum tubes and 1,500 crystal diodes. It weighed . It used magnetic drum memory of 4,350 words. Its addition time was 4,400 microseconds and the multiplication time was 13,200 microseconds (times include memory access time). Aiken boasted that the Mark III was the fastest electronic computer in the world.
The Mark III used nine magnetic drums (one of the first computers to do so). One drum could contain 4,000 instructions and has an access time of 4,400 microseconds; thus it was a stored-program computer. The arithmetic unit could access two other drums – one contained 150 words of constants and the other contained 200 words of variables. Both of these drums also had an access time of 4,400 microseconds. This separation of data and instructions is now sometimes referred to as the Harvard architecture although that term was not coined until the 1970s (in the context of microcontrollers). There were six other drums that held a total of 4,000 words of data, but the arithmetic unit couldn't access these drums directly. Data had to be transferred between these drums and the drum the arithmetic unit could access via registers implemented by electromechanical relays. This was a bottleneck in the computer and made the access time to data on these drums long – 80,000 microseconds. This was partially compensated for by the fact that twenty words could be transferred on each access.
The Mark III was finished in September 1949 and delivered to the U.S. Naval Proving Ground at the U.S. Navy base at Dahlgren, Virginia in March 1950. Rebuilding the computer in its new location took the remainder of the year. It became operational in 1951, and was being operated 24 hours a day, 6 days a week by October.
See also
Harvard Mark I
Harvard Mark II
Harvard Mark IV
Howard Aiken
List of vacuum tube computers
References
Further reading
A History of Computing Technology, Michael R. Williams, 1997, IEEE Computer Society Press,
External links
BRL report, 1955 - see ADEC
1950s computers
Computer-related introductions in 1951
Electro-mechanical computers
One-of-a-kind computers
Vacuum tube computers
Harvard University
History of the United States Navy
|
https://en.wikipedia.org/wiki/CXFS
|
The CXFS file system (Clustered XFS) is a proprietary shared disk file system designed by Silicon Graphics (SGI) specifically to be used in a storage area network (SAN) environment.
A significant difference between CXFS and other shared disk file systems is that data and metadata are managed separately from each other. CXFS provides direct access to data via the SAN for all hosts which will act as clients. This means that a client is able to access file data via the fiber connection to the SAN, rather than over a local area network such as Ethernet (as is the case in most other distributed file systems, like NFS). File metadata however, is managed via a metadata broker. The metadata communication is performed via TCP/IP and Ethernet.
Another difference is that file locks are managed by the metadata broker, rather than the individual host clients. This results in the elimination of a number of problems which typically plague distributed file systems.
Though CXFS supports having a heterogeneous environment (including Solaris, Linux, Mac OS X, AIX and Windows), either SGI's IRIX Operating System or Linux is required to be installed on the host which acts as the metadata broker.
See also
List of file systems
Shared disk file system
External links
SGI info about CXFS
Distributed file systems supported by the Linux kernel
IRIX
Shared disk file systems
|
https://en.wikipedia.org/wiki/Winnipeg%20Public%20Library
|
The Winnipeg Public Library () is a public library system in Winnipeg, Manitoba. Branches provide programming for children, teens, and adults. The Library also contains an Outreach Department which works with the community, as well as people who cannot visit the library directly. Outreach also promotes the library to communities that are under represented in the library.
Visitors to the Winnipeg Public Library checked out over 4.8 million items in 2018, including e-Books. The library has both adult and children's books in over 30 languages. Select locations provide tutorial rooms for learners to use free of charge.
The library has DVD and Blu-ray collections, as well as Wi-Fi, at all twenty locations. The library provides access to over 17,000 eBooks and over 450,000 songs. There are over 300 computers available to be booked.
The library offers a Writer-in-Residence program to assist budding authors and has done so for over 20 years.
The staff at the library are members of the Canadian Union of Public Employees Local 500.
History
Original City of Winnipeg Public Library System
The Winnipeg Public Library began as a public service to city residents in 1905.
Carnegie Branch
Winnipeg's first public library was the Carnegie Library (380 William Ave.), opened in 1905. American philanthropist Andrew Carnegie had funded the construction of three public libraries in the city. All the city had to do was to choose suitable locations. The main branch would be located downtown. The Free Press asked their readers in May 1902 where they'd prefer to locate the Carnegie branch. The top responses were: Ellice Ave. at Smith St., former Trinity Hall (Portage and Garry), Central Park, Victoria Park, and Market site of City Hall Square. After the site on William Avenue had been chosen, the architect chosen to design the building was Henry Sandham Griffith but after his plans exceeded the permitted budget the project was given to Samuel Hooper. The Carnegie branch had been under construction in 1904 when it was described in a Free Press article as "most pretentious of our civic buildings…There are not many buildings with an all-[lime]stone exterior. Hitherto, such buildings have been considered too expensive for the city." The Library was officially opened on October 12, 1905, by Lady Evelyn, Earl Grey, daughter of the Governor General of Canada.
The branch was closed after the Centennial Library opened in the spring of1977. It subsequently re-opened as a library for new immigrants wanting to learn English. Later on, it was used to store and provide access to the city's archival records.
In 2013 while the roof was being repaired, a hole had let water seep inside the building from a heavy rainstorm, damaging a portion of the archive. As at May 2018, the city had not yet decided what to do with the now damaged building — repair it and move the archives back into the building or sell it to a developer. The worst-case scenario would have the building demolish
|
https://en.wikipedia.org/wiki/GMA%20Network
|
GMA Network (Global Media Arts or simply GMA) is a Philippine free-to-air television and radio network. It is the flagship property of publicly traded GMA Network, Inc. Its first broadcast on television was on October 29, 1961. GMA Network (formerly known as Republic Broadcasting System, GMA Radio-Television Arts and GMA Rainbow Satellite Network) is commonly referred to as the Kapuso Network in reference to the outline of the company's logo. It is headquartered in the GMA Network Center in Quezon City and its transmitter, Tower of Power, is located at Tandang Sora Avenue, Barangay Culiat also in Quezon City with regional stations and offices strategically located in over 9 major cities across the country.
The original meaning of the GMA acronym was Greater Manila Area, referring to the initial coverage area of the station. As the network expanded it changed into Global Media Arts. The flagship television station of GMA is DZBB-TV (GMA-7 Manila) which carries VHF Channel 7 (analog broadcast) with Channel 15 served as a permanent assigned digital frequency. The network operates across the Philippine archipelago through the GMA Regional TV department which has 7 originating stations and 46 relay stations nationwide. Its programming is also available outside the Philippines through the Philippine pay television channels GMA Pinoy TV, GMA Life TV and GMA News TV International which is available through satellite and cable TV systems worldwide. Since 2013, GMA has been testing digital terrestrial television broadcasts using the Japanese standard ISDB-T, in select areas in the Philippines.
History
1950s and 1960s
The origin of GMA Network can be traced back to Loreto F. de Hemedes Inc. through DZBB, which started airing its radio broadcast on March 1, 1950, and officially launched as a local radio station in Manila on June 14, 1950, and owned by Robert La Rue "Uncle Bob" Stewart, an American war correspondent. Venturing into television in the 1960s, Stewart started RBS TV Channel 7 (under the call letters DZBB-TV) on October 29, 1961, becoming the Philippines' fifth terrestrial television station. Originally, RBS's programming was composed of foreign programs from the United States and it later produced local programs to cater to Filipino audiences. It produced shows like Uncle Bob's Lucky Seven Club, a child-oriented show aired every Saturdays; Dance Time with Chito; and various news programs like News at Seven. In 1963, RBS launched its first provincial television station in Cebu, DYSS Channel 7 (now GMA Cebu). In the same year, from Loreto F. de Hemedes Inc, the firm was formally renamed to Republic Broadcasting System, Inc. (RBS).
1970s
On September 21, 1972, then President Ferdinand Marcos declared martial law by the virtue of Proclamation 1081. Marcos, ruling by decree, curtailed press freedom and other civil liberties; closed down the Congress and media establishments including RBS. In December 1972, RBS was given the green light by the gove
|
https://en.wikipedia.org/wiki/MakeIndex
|
MakeIndex is a computer program which provides a sorted index from unsorted raw data. MakeIndex can process raw data output by various programs, however, it is generally used with LaTeX and troff.
MakeIndex was written around the year 1986 by Pehong Chen in the C programming language and is free software. Six pages of documentation titled "MakeIndex: An Index Processor for LaTeX" by Leslie Lamport are available on the web and dated "17 February 1987."
See also
xindy
References
Wikibooks: LaTeX/Indexing
Pehong Chen and Michael A. Harrison: Index preparation and processing (distributed with MakeIndex)
Leslie Lamport: MakeIndex: an index processor for LaTeX
Frank Mittelbach et al., The LaTeX Companion, Addison-Wesley Professional, 2nd edition, 2004,
Free software programmed in C
Free TeX software
Troff
Index (publishing)
|
https://en.wikipedia.org/wiki/Subtext%20%28programming%20language%29
|
Subtext is a moderately visual programming language and environment, for writing application software. It is an experimental, research attempt to develop a new programming model, called Example Centric Programming, by treating copied blocks as first class prototypes, for program structure. It uses live text, similar to what occurs in spreadsheets as users update cells, for frequent feedback. It is intended to eventually be developed enough to become a practical language for daily use. It is planned to be open software; the license is not yet determined.
Subtext was created by Jonathan Edwards who submitted a paper on the language to OOPSLA. It was accepted as part of the 2005 conference.
Environment
Early video previews of the Subtext environment were released circa 2006, which demonstrated the semantics of Subtext programs, and the close integration with the Subtex environment and runtime.
Subtext programs are declared and manipulated (or mutated) by adding and linking elements of various types to a syntax tree, and entering in values or names as necessary, as opposed to typing out textual programs. Due to the design of the Subtext language and environment, there is no distinction between a program's representation and its execution. Like spreadsheets, Subtext programs are live executions within an environment and runtime, and programming is direct manipulation of these executions via a graphical environment. Unlike typical functional programming languages, Subtext has simple semantics and is easily applicable to reactive systems that require mutable state, I/O, and concurrency, under a model known as "Reactive Programming". Console input ("invocations") can be utilized via data flow within a Subtext program, allowing users to manipulate values interactively.
Coherence
A continuation and subset of the Subtext language using other principles, is Coherence, an experimental programming language and environment, which uses a new model of change-driven computation called "Coherent reaction", to coordinate the effects and side-effects of programs interactively as they are being developed. The language is specialized for interactive application software, and is being designed by the creator of Subtext, Jonathan Edwards, who reports upon its development by publishing white papers.
State changes trigger events called reactions, that in turn change other states. A coherent execution order is one in which each reaction executes before any others that are affected by its changes. A coherent order is discovered iteratively by detecting incoherencies as they occur and backtracking their effects. The fundamental building block of Coherence is the dynamically typed mutable tree. The fundamental abstraction mechanism is the virtual tree, whose value is lazily computed, and whose behavior is generated by coherent reactions.
References
Example Centric Programming Jonathan Edwards. In OOPSLA October ’04. Describing IDE improvements using advanced UI techniq
|
https://en.wikipedia.org/wiki/Klipper
|
Klipper is a clipboard manager for the KDE interface. It allows users of Unix-like operating systems running the KDE desktop environment to access a history of X Selections, any item of which can be reselected for pasting. It can also be used to perform an action automatically if certain text is selected (e.g. opening a URL in a browser).
References
External links
The Klipper Handbook
Clipboard (computing)
KDE software
KDE Software Compilation
|
https://en.wikipedia.org/wiki/TPJ
|
TPJ may refer to:
The PracTeX Journal, an online journal focussing on practical use of the TeX typesetting system
The Perl Journal, a former journal which focused on the Perl programming language.
Tapieté, an indigenous language of Argentina (ISO 639 code tpj).
Temporoparietal junction, a region of brain where the temporal and parietal lobes meet.
Texans for Public Justice, a non-profit group.
Tiruchirappalli Junction railway station (station code TPJ).
Tiruchirappalli Railway Division, a division of Southern Railway Zone of India (reporting mark) .
Triple Plate Junction PLC, a gold mining and exploration company involved in the reverse takeover of Namesco.
Tak and the Power of Juju, children's TV series and video game.
Tevita Pangai Jr, rugby league player for the Brisbane Broncos.
|
https://en.wikipedia.org/wiki/Heroes%20of%20Might%20and%20Magic%3A%20A%20Strategic%20Quest
|
Heroes of Might and Magic: A Strategic Quest is a turn-based strategy game developed and published by New World Computing in 1995 for DOS. A spin-off of New World Computing's Might and Magic series of role-playing video games, the success of Heroes of Might and Magic led to a number of sequels.
In 1996, NWC released an updated version of the game, ported to Windows 95. This new version included a map editor, random map generator, CD audio, and new scenarios. As a bonus, King's Bounty was also included on the CD.
Story
Heroes of Might and Magic tells the story of Lord Morglin Ironfist, who is forced to flee his homeland through a magical portal, because his cousin, Ragnar, had usurped the throne after his uncle, Ragnar's father, killed Ironfist's father, the legitimate owner of the throne.
He finds himself along with his few followers in a strange and uncharted land, called Enroth. The land is unruled but contested by Ironfist and three other warlords: the barbarian Lord Slayer, the sorceress Queen Lamanda, and the warlock Lord Alamar.
In the canonical storyline, Lord Ironfist defeats his three opponents and founds a new kingdom in Enroth. It is possible for the player to lead the other factions to victory, however this is not reflected in the following games of the Heroes of Might and Magic series.
Gameplay
Heroes of Might and Magic takes place in a medieval fantasy world filled with creatures frequently associated with myth and legend. These creatures compose the military forces (troops) with which the player attempts to conquer opponents. The player leads generals through the game world at the head of armies of troops. These generals, called "heroes," provide a means to explore, attack, defeat, and acquire, the four basic principles in the game. The ultimate goal of the game is usually to capture all enemy castles and defeat all enemy heroes. However, the game comes with many different play scenarios, and some of these scenarios have unique victory conditions, such as accumulating a certain amount of gold, or finding a particular artifact.
There are four different classes of heroes and castles, each with their own units and strengths/weaknesses. The two "might" classes, Knight and Barbarian, earn skill points in attack or defense more often than in spell power or knowledge. The two "magic" classes, Sorceress and Warlock, earn skill points in spell power or knowledge more often than in attack or defense. There is also a neutral, "wandering" class of troops, including Rogues, Nomads, Ghosts (the only one that cannot be hired) and Genies.
Development
Heroes of Might and Magic was first released near the end of September 1995.
Reception
In mid-November 1995, New World Computing reported that Heroes of Might and Magic had shipped 100,000 copies to retailers and that sell-through was strong. The company announced that the game was "set to top the 100,000 mark in unit sales". By October 1997, the combined sales of Heroes of Might and Magic
|
https://en.wikipedia.org/wiki/Mega%20Man%20Battle%20Network%205
|
and are 2004 role-playing video games developed and published by Capcom for the Game Boy Advance (GBA) handheld game console. Combined, they make up the fifth mainline installment in the Mega Man Battle Network series, and follows Lan Hikari and his NetNavi MegaMan.EXE, as they attempt to take down Nebula, who have kidnapped Lan's father and taken over the internet, with an anti-Nebula task force.
Development on the game started during the localization of Battle Network 4, and alongside the development 4.5: Real Operation. It was announced in CoroCoro Comics in August 2004, with Team ProtoMan releasing in December 2004 in Japan; Team Colonel released three months later in February 2005, while both versions were released simultaneously for Western territories in June 2005. Battle Network 5 retains the same gameplay as its predecessor, but with the addition of "Liberation Missions" where the player must liberate squares with limited time to defeat the boss. The game also includes crossover content with the Boktai series by Konami.
Mega Man Battle Network 5 received a generally tepid reception from critics, with many finding it too similar to previous entries, and criticizing the aging presentation; in mid-2005, both versions were combined and re-released for the Nintendo DS as , which has updated sound and additional content not found in the GBA versions. The GBA versions were re-released as part of the Wii U Virtual Console in 2015, and are included in the Mega Man Battle Network Legacy Collection for PlayStation 4, Nintendo Switch and PC (via Steam), released in 2023. It was followed up by Mega Man Battle Network 6 in 2005, which acted as the finale of the series.
Gameplay
The gameplay of Mega Man Battle Network 5 is largely similar to that of its predecessors. The player explores the real world through Lan and the Net through MegaMan.EXE. When Lan plugs his PET, a handheld computer, into a computer with an interface jack, he can upload MegaMan.EXE to the cyber network, allowing him to explore and fight viruses as random encounters.
When MegaMan.EXE encounters viruses, the screen shifts to a battle screen set on a six by three square grid. On the left half of the grid is MegaMan.EXE, and on the other half are his opponents. MegaMan.EXE has a relatively weak arm cannon, the Mega Buster, but his main weapon is Lan's library of battle chips, one-use-per-battle special attacks which grant various abilities, including simple attacks, attack enhancements, defensive effects, terrain transmogrification, or assistance from other NetNavis. Before battle, the player can construct a folder consisted of thirty battle chips, and each turn of a battle (measured by a timer bar at the top of the screen), the player is presented with a random selection of these chips. The player can send MegaMan.EXE up to five battle chips, after which the battle takes place in real time, with MegaMan.EXE, controlled by the player, attacking with his Mega Buster, dodging att
|
https://en.wikipedia.org/wiki/Recurrence%20quantification%20analysis
|
Recurrence quantification analysis (RQA) is a method of nonlinear data analysis (cf. chaos theory) for the investigation of dynamical systems. It quantifies the number and duration of recurrences of a dynamical system presented by its phase space trajectory.
Background
The recurrence quantification analysis (RQA) was developed in order to quantify differently appearing recurrence plots (RPs), based on the small-scale structures therein. Recurrence plots are tools which visualise the recurrence behaviour of the phase space trajectory of dynamical systems:
,
where is the Heaviside function and a predefined tolerance.
Recurrence plots mostly contain single dots and lines which are parallel to the mean diagonal (line of identity, LOI) or which are vertical/horizontal. Lines parallel to the LOI are referred to as diagonal lines and the vertical structures as vertical lines. Because an RP is usually symmetric, horizontal and vertical lines correspond to each other, and, hence, only vertical lines are considered. The lines correspond to a typical behaviour of the phase space trajectory: whereas the diagonal lines represent such segments of the phase space trajectory which run parallel for some time, the vertical lines represent segments which remain in the same phase space region for some time.
If only a time series is available, the phase space can be reconstructed by using a time delay embedding (see Takens' theorem):
where is the time series, the embedding dimension and the time delay.
The RQA quantifies the small-scale structures of recurrence plots, which present the number and duration of the recurrences of a dynamical system. The measures introduced for the RQA were developed heuristically between 1992 and 2002 (Zbilut & Webber 1992; Webber & Zbilut 1994; Marwan et al. 2002). They are actually measures of complexity. The main advantage of the recurrence quantification analysis is that it can provide useful information even for short and non-stationary data, where other methods fail.
RQA can be applied to almost every kind of data. It is widely used in physiology, but was also successfully applied on problems from engineering, chemistry, Earth sciences etc.
RQA measures
The simplest measure is the recurrence rate, which is the density of recurrence points in a recurrence plot:
The recurrence rate corresponds with the probability that a specific state will recur. It is almost equal with the definition of the correlation sum, where the LOI is excluded from the computation.
The next measure is the percentage of recurrence points which form diagonal lines in the recurrence plot of minimal length :
where is the frequency distribution of the lengths of the diagonal lines (i.e., it counts how many instances have length ). This measure is called determinism and is related with the predictability of the dynamical system, because white noise has a recurrence plot with almost only single dots and very few diagonal lines, whereas a determi
|
https://en.wikipedia.org/wiki/Key%20Sequenced%20Data%20Set
|
A key-sequenced data set (KSDS) is a type of data set used by IBM's VSAM computer data storage system. Each record in a KSDS data file is embedded with a unique key. A KSDS consists of two parts, the data component and a separate index file known as the index component which allows the system to physically locate the record in the data file by its key value. Together, the data and index components are called a cluster.
Records can be accessed randomly or in sequence and can be variable-length.
As a VSAM data set, the KSDS data and index components consist of control intervals which are further organized in control areas. As records are added at random to a KSDS, control intervals fill and need to be split into two new control intervals, each new control interval receiving roughly half of the records. Similarly, as the control intervals in a control area are used up, a control area will be split into two new control areas, each new control area receiving roughly half the control intervals.
While a basic KSDS only has one key (the primary key), alternate indices may be defined to permit the use of additional fields as secondary keys. An alternate index is itself a KSDS.
See also
Entry Sequenced Data Set
Linear Data Set
Relative Record Data Set
External links
Lascon.co.uk
Redbooks.ibm.com
References
Computer file systems
|
https://en.wikipedia.org/wiki/Code%20space
|
In computing, Code space may refer to:
In memory address space:
code space, where machine code is stored.
For a character encoding:
code space (or codespace), the range of code points.
|
https://en.wikipedia.org/wiki/Entry%20Sequenced%20Data%20Set
|
An entry-sequenced data set (ESDS) is a type of data set used by IBM's VSAM computer data storage system. Records are accessed based on their sequential order, that is, the order in which they were written to the file; which means that accessing a particular record involves searching all the records sequentially until it is located, or by using a relative physical address (Relative byte address, RBA), i.e. the number of bytes from the beginning of the file to start reading.
Keys may be used to access records in an ESDS by defining an alternate index.
See also
Key Sequenced Data Set
Linear Data Set
Relative Record Data Set
Random access
References
Computer file systems
|
https://en.wikipedia.org/wiki/Relative%20Record%20Data%20Set
|
A relative record data set (RRDS) is a type of data set organization used by IBM's VSAM computer data storage system. Records are accessed based on their ordinal position in the file (relative record number, RRN). For example, the desired record to be accessed might be the 42nd record in the file out of 999 total.
The concept of RRDS is similar to sequential access method, but it can access with data in random access and dynamic access.
Structure
An RRDS consists of data records in sequence, with the record number indicating the record's logical position in the data set. A program can access records randomly using this positional number or access records sequentially. But unlike a Key Sequenced Data Set, an RRDS has no keys, so the program cannot access records by key value.
See also
Key Sequenced Data Set
Entry Sequenced Data Set
Linear Data Set
References
https://web.archive.org/web/20051013071230/http://www.jaymoseley.com/hercules/vstutor/vstutor.htm
http://www.mvsforums.com/techfaqsvsam.html
https://web.archive.org/web/20070311021954/http://www.redbooks.ibm.com/redbooks/SG246105/wwhelp/wwhimpl/js/html/wwhelp.htm
Computer file systems
|
https://en.wikipedia.org/wiki/RRDS
|
RRDS may refer to:
Relative Record Data Set
Rough Rock Demonstration School, now Rough Rock Community School
|
https://en.wikipedia.org/wiki/Electric%20Sheep%20%28disambiguation%29
|
Electric Sheep may mean the following:
Electric Sheep, a distributed computing project for generating, downloading, and playing fractal movies while the screen saver is running
Electric Sheep Comix, an electronic comic book anthology Web page created by Berkeley-based artist Patrick Farley
Electric Sheep, album by The Phenomenauts
See also
Do Androids Dream of Electric Sheep?, a 1968 science fiction novel by Philip K. Dick, and basis for the 1982 film Blade Runner.
|
https://en.wikipedia.org/wiki/Throbber
|
A throbber, also known as a loading icon, is an animated graphical control element used to show that a computer program is performing an action in the background (such as downloading content, conducting intensive calculations or communicating with an external device). In contrast to a progress bar, a throbber does not indicate how much of the action has been completed.
Usually the throbber is found at the side of a program's toolbar or menu bar. Throbbers take various forms, but are commonly incorporated into the logo of the program. Throbbers are typically a still image (known as its resting frame), unless the program is performing an action, during which time the throbber is animated in a loop to convey to the user that the program is busy (and has not frozen). Once the action is complete, the throbber returns to its resting frame.
It is normally possible for the user to continue interacting with the program while the throbber animated; one such possibility may be to press a "stop" button to cancel the action. Clicking the throbber itself might perform another action, such as opening the program's website, or pausing or canceling the background action.
History
One of the early (if not the earliest) uses of a throbber occurred in the NCSA Mosaic web browser of the early 1990s, which featured an NCSA logo that animated while Mosaic downloaded a web page. As the user could still interact with the program, the pointer remained normal (and not a busy symbol, such as an hourglass); therefore, the throbber provided a visual indication that the program was performing an action. Clicking on the throbber would stop the page loading; later web browsers added a separate Stop button for this purpose.
Netscape, which soon overtook Mosaic as the market-leading web browser, also featured a throbber. In version 1.0 of Netscape, this took the form of a big blue "N" (Netscape's logo at the time). The animation depicted the "N" expanding and contracting - hence the name "throbber". When Netscape unveiled its new logo (a different "N" on top of a hill), they held a competition to find an animation for it. The winning design (featuring the new-look "N" in a meteor shower) became very well known and almost became an unofficial symbol of the World Wide Web. Later, Internet Explorer's blue "e" enjoyed similar status, though it only functioned as a throbber in early versions of the browser.
The IBM WebExplorer offered a webpage the opportunity to change the look and the animation of the throbber by using proprietary HTML code. The use of web frames, a feature introduced later, leads WebExplorer to confusion on modern pages due to the way this feature was implemented.
The Arena web browser has a command-line option to change the throbber with a local file.
Initially, throbbers tended to be quite large, but they reduced in size along with the size of toolbar buttons as graphical user interfaces developed. Their usefulness declined somewhat as most operating systems
|
https://en.wikipedia.org/wiki/List%20of%20venture%20capital%20firms
|
Below is a list of notable venture capital firms.
Assets under management
Shown below are the largest venture capital firms ranked by Assets Under Management.
Capital raised
Data is for capital raised between January 1, 2017, and June 30, 2022. Data is from Venture Capital Journal in 2022.
Deal flow
Shown below are the largest venture capital firms by deal flow at different growth stages in 2022.
Angel and seed
Early stage
Late stage
List
Americas
Accel
Addition
Advanced Technology Ventures
Almaz Capital
Andreessen Horowitz
ARCH Venture Partners
Atlas Venture
August Capital
Austin Ventures
Azure Capital Partners
Bain Capital Ventures
Battery Ventures
Benchmark Capital
Bessemer Venture Partners
Binary Capital
Blumberg Capital
CapitalG
Canaan Partners
Charles River Ventures
Clearstone Venture Partners
Columbus Nova
Contrary
Cottonwood Technology Fund
Crosslink Capital
CrunchFund
DAG Ventures
DCM Ventures
Draper Fisher Jurvetson
Founders Circle Capital
ff Venture Capital
First Round Capital
FirstMark Capital
Foundation Capital
Founders Fund
Gaingels
Galen Partners
GE Ventures
GGV Capital
Granite Ventures
Greycroft
Greylock Partners
Growthworks
GV
Harris & Harris Group
Highland Capital Partners
IDG Ventures
Index Ventures
Initialized Capital
In-Q-Tel
Insight Partners
Institutional Venture Partners
Intel Capital
Intellectual Ventures
Khosla Ventures
Kleiner Perkins
Lightbank
Lighter Capital
Lightspeed Venture Partners
Lux Capital
Matrix Partners
Maveron
Mayfield Fund
Menlo Ventures
Meritech Capital Partners
Morgenthaler Ventures
New Enterprise Associates
Norwest Venture Partners
Oak Investment Partners
Optimize Capital Markets
Polaris Partners
Qualcomm Ventures
Radius Ventures
Redpoint Ventures
Renewal2
Revolution LLC
Rho Ventures
Rothenberg Ventures
RRE Ventures
Scale Venture Partners
Sequoia Capital
Sevin Rosen Funds
Social Capital
Sofinnova Ventures
SoftTech VC
SOSV
Spark Capital
TCV
Tenaya Capital
Third Rock Ventures
Thrive Capital
Tiger Global Management
U.S. Venture Partners
Union Square Ventures
Venrock
Versant Ventures
Vivo Capital
Votorantim Novos Negócios
EMEA
Abingworth
Atomico Ventures
Balderton Capital
BGF
Cottonwood Technology Fund
DN Capital
Draper Esprit
EQT Ventures
Genesis Partners
German Startups Group
HealthCap
High-Tech Gründerfonds
Hydra Ventures
Impact X
Industrifonden
Infinity Group
IIDF
Iona Capital
Iris Capital
Israel Cleantech Ventures
Jerusalem Venture Partners
Mercia Fund Management
Newfund
Nova Founders Capital
Oxford Sciences Innovation
Pitango
Porton Group
Seedcamp
SyndicateRoom
Target Partners
TBG AG
Terra Venture Partners
The Craftory
Viola Ventures
Wellington Partners Venture Capital
YL Ventures
Asia
5Y Capital
Addor Capital
Antler
BAN
|
https://en.wikipedia.org/wiki/Incense%20trade%20route
|
The Incense Trade Route was an ancient network of major land and sea trading routes linking the Mediterranean world with eastern and southern sources of incense, spices and other luxury goods, stretching from Mediterranean ports across the Levant and Egypt through Northeastern Africa and Arabia to India and beyond. These routes collectively served as channels for the trading of goods such as Arabian frankincense and myrrh; Indian spices, precious stones, pearls, ebony, silk and fine textiles; and from the Horn of Africa, rare woods, feathers, animal skins, Somali frankincense, gold, and slaves. The incense land trade from South Arabia to the Mediterranean flourished between roughly the 3rd century BC and the 2nd century AD.
Early history
The Egyptians had traded in the Red Sea, importing spices, gold and exotic wood from the "Land of Punt" and from Arabia. Indian goods were brought in Arabian and Indian vessels to Aden. Rawlinson identifies the long-debated "ships of Tarshish," as a Tyrian fleet equipped at Ezion-Geber that made several trading voyages to the east bringing back gold, silver, ivory and precious stones. These goods were transshipped at the port of Ophir.
According to one historian:
Land routes
Among the most important trading points of the incense trade route from the Persian Gulf to the Mediterranean Sea was Gerrha in the Persian Gulf, reported by the historian Strabo to have been founded by Babylonian exiles as a Chaldean colony. Gerrha exercised influence over the incense trade routes across Arabia to the Mediterranean and controlled the aromatics trade to Babylon in the 1st century BC. Gerrha was one of the important entry ports for goods shipped from India.
Due to its prominent position in the incense trade, Yemen attracted settlers from the Fertile Crescent. The frankincense and myrrh trees were crucial to the economy of Yemen and were recognized as a source of wealth by its rulers. Recent exploration discovered an ancient trade route through eastern Yemen in the Mahra region.
Assyrian documents indicate that Tiglath-Pileser III advanced through Phoenicia to Gaza. Gaza was eventually sacked and the ruler of Gaza escaped to Egypt but later continued to act as a vassal administrator. The motive behind the attack was to gain control of the South Arabian incense trade which had prospered along the region.
I.E.S. Edwards connects the Syro-Ephraimite War to the desire of the Israelites and the Aramaeans to control the northern end of the Incense Route, which ran up from Southern Arabia and could be tapped by commanding Transjordan. Archaeological inscriptions also speak of booty retrieved from the land of the mu-u-na-a-a, possibly Meunites mentioned in the Old Testament. Some scholars identify this group as the Minaeans of South Arabia, who were involved with the incense trade and occupied the northern trading outposts of the Incense Route.
Aromatics from Dhofar and luxury goods from India brought wealth to the kingdoms of
|
https://en.wikipedia.org/wiki/Stankervision
|
Stankervision is a sketch-comedy program, created by Waco O'Guin and Roger Black, that aired on MTV2. It premiered July 8, 2005 as part of the channel's "Sic 'Em Friday" programming block. Stankervision is a repackaged version of "The DAMN! Show", a sketch comedy show that was created in Athens, Georgia in 1998. Yucko the Clown, a character developed and played by Black, is featured on the show.
Format
Among the regular sketches are Yucko the Clown approaching people on the street and insulting them with profanity and lewd gestures, mimes who start out acting like "normal" mimes, then turning to violent behavior (one such sketch, for example, has one mime making a withdrawal from an ATM, only to be held up and "shot" by a second mime, who in turn is accosted by two "police" mimes and beaten – all in the view of the public), and "Dear Stankervision", where questions are posed to the creators, Waco and Roger (one such "letter" asks how laxatives work, which is followed by actors in costume displaying the effects of taking pills to relieve constipation).
Stankervision also features some cartoons, but in Stankervision style. One regular such cartoon is about the adventures of "Inebriated the Koala", which was created by Waco O'Guin in 1993 and is introduced as "everyone's favorite eucalyptus-eating marsupial", to which the koala replies "Eucalyptus? You can lick THIS!" as he points to his crotch.
Cancellation
On October 7, 2005, Howard Stern announced on his radio show that Stankervision was not picked up for a second season by MTV. Cast member Yucko the Clown e-mailed Stern confirming this, stating that the show had the highest ratings for that block of time on MTV2 and was not sure why the show was not picked up for a second season.
On January 26, 2006, Yucko stated on Stern's Sirius channel (on the post-show wrap-up program) that the show had been cancelled not because of its content, but problems with sponsors.
Cast
Roger Black
Greg Epps
Waco O'Guin
Zac Pope
Rack 'em Willie
References
External links
Article on Ign.com
MTV2 original programming
2000s American sketch comedy television series
2005 American television series debuts
2005 American television series endings
Television series created by Waco O'Guin and Roger Black
|
https://en.wikipedia.org/wiki/Harvard%20Mark%20II
|
The Harvard Mark II, also known as the Aiken Relay Calculator, was an electromechanical computer built under the direction of Howard Aiken at Harvard University, completed in 1947. It was financed by the United States Navy and used for ballistic calculations at Naval Proving Ground Dahlgren. Howard Aiken and Grace Hopper worked together to build and program the Mark II.
Overview
The contract to build the Mark II was signed with Harvard in February 1945, after the successful demonstration of the Mark I in 1944. It was completed and debugged in 1947, and delivered to the US Navy Proving Ground at Dahlgren, Virginia in March 1948, becoming fully operational by the end of that year.
The Mark II was constructed with high-speed electromagnetic relays instead of the electro-mechanical counters used in the Mark I, making it much faster than its predecessor. It weighed and occupied over of floor space. Its addition time was 0.125 seconds (8 Hz) and the multiplication time was 0.750 seconds. This was a factor of 2.6 faster for addition and a factor of 8 faster for multiplication compared to the Mark I. It was the second machine (after the Bell Labs Relay Calculator) to have floating-point hardware. A unique feature of the Mark II is that it had built-in hardware for several functions such as the reciprocal, square root, logarithm, exponential, and some trigonometric functions. These took between five and twelve seconds to execute. Additionally, the Mark II was actually composed of two sub-computers that could either work in tandem or operate on separate functions, to cross-check results and debug malfunctions.
The Mark I and Mark II were not stored-program computers – they read instructions of the program one at a time from a tape and executed them. The Mark II had a peculiar programming method that was devised to ensure that the contents of a register were available when needed. The tape containing the program could encode only eight instructions, so what a particular instruction code meant depended on when it was executed. Each second was divided up into several periods, and a coded instruction could mean different things in different periods. An addition could be started in any of eight periods in the second, a multiplication could be started in any of four periods of the second, and a transfer of data could be started in any of twelve periods of the second. Although this system worked, it made the programming complicated, and it reduced the efficiency of the machine somewhat.
The Mark II is also known for being the computer with the first recorded instance of an actual bug (a moth) disrupting its operation. The insect was extracted from the machine's electronics and taped to the log book, with the note "first actual case of [a] bug being found", on September 9, 1947.
See also
Harvard Mark I
Harvard Mark III
Harvard Mark IV
Bug (engineering)#History
References
Further reading
External links
Photographs related to the Mark II from the Gr
|
https://en.wikipedia.org/wiki/Harvard%20Mark%20IV
|
The Harvard Mark IV was an electronic stored-program computer built by Harvard University under the supervision of Howard Aiken for the United States Air Force. The computer was finished being built in 1952. It stayed at Harvard, where the Air Force used it extensively.
The Mark IV was all electronic. The Mark IV used magnetic drum and had 200 registers of ferrite magnetic-core memory (one of the first computers to do so). It separated the storage of data and instructions in what is now sometimes referred to as the Harvard architecture although that term was not coined until the 1970s (in the context of microcontrollers).
See also
Harvard Mark I
Harvard Mark II
Harvard Mark III
List of vacuum-tube computers
Howard Aiken
Harvard (World War II advanced trainer aircraft)
References
Further reading
A History of Computing Technology, Michael R. Williams, 1997, IEEE Computer Society Press,
External links
Harvard Mark IV 64-bit Magnetic Shift Register at ComputerHistory.org
1950s computers
Computer-related introductions in 1952
Vacuum tube computers
One-of-a-kind computers
Harvard University
|
https://en.wikipedia.org/wiki/WCIX
|
WCIX (channel 49) is a television station licensed to Springfield, Illinois, United States, serving the Central Illinois region as an affiliate of MyNetworkTV. It is owned by Nexstar Media Group alongside Champaign-licensed CBS affiliate WCIA (channel 3). Both stations share studios on South Neil Street/US 45 in downtown Champaign and also operate a sales office and news bureau on West Edwards Street near the Illinois State Capitol in Springfield. WCIX's transmitter is located in Clear Lake Township.
Since WCIX's over-the-air signal cannot be seen in eastern parts of the market (including Champaign, Urbana, and Danville), it is simulcast in high definition on WCIA's second digital subchannel (UHF channel 34.2 or virtual channel 3.2) from a transmitter west of Seymour, Illinois. Nielsen Media Research treats WCIX and WCIA-DT2 as one station in local ratings books, using the identifier name WCIX+.
History
Before WCIA signed-on in 1953, it originally wanted to build its transmitter tower in White Heath, halfway between Champaign and Decatur. The tower would have been placed on some of the highest ground in Central Illinois. However, after construction began, then-ABC affiliate WTVP (channel 17, now WAND) filed an objection. Even though it was obvious that Champaign–Urbana and Springfield/Decatur would be considered a single market, WTVP owner Prairie Television claimed WCIA was trying to encroach on its territory. To avoid delays, that station moved its transmitter to its current location in Seymour. While the signal from the Seymour tower covered Decatur very well, it was barely viewable in Springfield until cable television arrived in the market in the early 1960s.
WCIA quickly established itself as the dominant station in the region despite its signal issues in the western half of the market. Eventually, then-owner Midwest Television decided to open a low-powered satellite relay of WCIA on UHF channel 49 to get better coverage in Springfield and the surrounding area. This relay launched in 1967 under the callsign W49AA. On February 4, 1985, Midwest Television upgraded channel 49 to a full-power station under new calls, WCFN. However, like its low-powered predecessor, WCFN was a straight simulcast of WCIA, even airing its commercials. WCFN's existence was only acknowledged in WCIA's legal station identifications.
In 2002, WCFN broke off from the simulcast to be the market's first full-time UPN affiliate. That network had previously been seen in off-hours on Pax outlet WPXU (channel 23, now WBUI) in Decatur. However, few viewers actually lost access to WCIA, given the extremely high penetration of cable and satellite in central Illinois.
The removal of CBS service from the station would be temporary with the launch of WCFN's digital transmitter, meaning that despite the conversion to UPN, WCFN's schedule could also air as a WCIA subchannel, with WCIA's main CBS channel able to be carried by WCFN. Accordingly, the main channel 49 schedule was a
|
https://en.wikipedia.org/wiki/Zero%20page%20%28CP/M%29
|
The Zero Page (or Base Page) is a data structure used in CP/M systems for programs to communicate with the operating system. In 8-bit CP/M versions it is located in the first 256 bytes of memory, hence its name.
The equivalent structure in DOS is the Program Segment Prefix (PSP), a 256-byte structure, which, however, is by default located at offset 0 in the program's load segment (rather than in segment 0) immediately preceding a loaded program.
In 8-bit CP/M, it has the following structure:
In CP/M-86, the structure is:
See also
Zero page (processor property)
Page boundary relocation
References
Further reading
- in particular:
CP/M technology
|
https://en.wikipedia.org/wiki/Futures%20and%20promises
|
In computer science, future, promise, delay, and deferred refer to constructs used for synchronizing program execution in some concurrent programming languages. They describe an object that acts as a proxy for a result that is initially unknown, usually because the computation of its value is not yet complete.
The term promise was proposed in 1976 by Daniel P. Friedman and David Wise,
and Peter Hibbard called it eventual.
A somewhat similar concept future was introduced in 1977 in a paper by Henry Baker and Carl Hewitt.
The terms future, promise, delay, and deferred are often used interchangeably, although some differences in usage between future and promise are treated below. Specifically, when usage is distinguished, a future is a read-only placeholder view of a variable, while a promise is a writable, single assignment container which sets the value of the future. Notably, a future may be defined without specifying which specific promise will set its value, and different possible promises may set the value of a given future, though this can be done only once for a given future. In other cases a future and a promise are created together and associated with each other: the future is the value, the promise is the function that sets the value – essentially the return value (future) of an asynchronous function (promise). Setting the value of a future is also called resolving, fulfilling, or binding it.
Applications
Futures and promises originated in functional programming and related paradigms (such as logic programming) to decouple a value (a future) from how it was computed (a promise), allowing the computation to be done more flexibly, notably by parallelizing it. Later, it found use in distributed computing, in reducing the latency from communication round trips. Later still, it gained more use by allowing writing asynchronous programs in direct style, rather than in continuation-passing style.
Implicit vs. explicit
Use of futures may be implicit (any use of the future automatically obtains its value, as if it were an ordinary reference) or explicit (the user must call a function to obtain the value, such as the get method of in Java). Obtaining the value of an explicit future can be called stinging or forcing. Explicit futures can be implemented as a library, whereas implicit futures are usually implemented as part of the language.
The original Baker and Hewitt paper described implicit futures, which are naturally supported in the actor model of computation and pure object-oriented programming languages like Smalltalk. The Friedman and Wise paper described only explicit futures, probably reflecting the difficulty of efficiently implementing implicit futures on stock hardware. The difficulty is that stock hardware does not deal with futures for primitive data types like integers. For example, an add instruction does not know how to deal with 3 + future factorial(100000). In pure actor or object languages this problem can be solved by sen
|
https://en.wikipedia.org/wiki/How%20to%20Design%20Programs
|
How to Design Programs (HtDP) is a textbook by Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, and Shriram Krishnamurthi on the systematic design of computer programs. MIT Press published the first edition in 2001, and the second edition in 2018, which is freely available online and in print. The book introduces the concept of a design recipe, a six-step process for creating programs from a problem statement. While the book was originally used along with the education project TeachScheme! (renamed ProgramByDesign), it has been adopted at many colleges and universities for teaching program design principles.
According to HtDP, the design process starts with a careful analysis of a problem statement with the goal of extracting a rigorous description of the kinds of data that the desired program consumes and produces. The structure of these data descriptions determines the organization of the program.
Then, the book carefully introduces data forms of progressively growing complexity. It starts with data of atomic forms and then progresses to compound forms, including data that can be arbitrarily large. For each kind of data definition, the book explains how to organize the program in principle, thus enabling a programmer who encounters a new form of data to still construct a program systematically.
Like Structure and Interpretation of Computer Programs (SICP), HtDP relies on a variant of the programming language Scheme. It includes its own programming integrated development environment (IDE), named DrRacket, which provides a series of programming languages. The first language supports only functions, atomic data, and simple structures. Each language adds expressive power to the prior one. Except for the largest teaching language, all languages for HtDP are functional programming languages.
Pedagogical basis
In the 2004 paper, The Structure and Interpretation of the Computer Science Curriculum, the same authors compared and contrasted the pedagogical focus of How to Design Programs (HtDP) with that of Structure and Interpretation of Computer Programs (SICP). In the 14-page paper, the authors distinguish the pedagogic focus of HtDP from that of SICP, and show how HtDP was designed as a textbook to address some problems that some students and teachers had with SICP.
The paper introduces the pedagogical landscape surrounding the publication of SICP. The paper starts with a history and critique of SICP, followed by a description of the goal of the computing curriculum. It then describes the principles of teaching behind HtDP; in particular, the difference between implicit vs. explicit teaching of design principles. It then continues on to describe the role of Scheme and the importance of an ideal programming environment, and concludes with an extensive evaluation of content and student/faculty reaction to experience with SICP vs. HtDP.
One of the major focuses of the paper is the emphasis on the difference in required domain knowledge betw
|
https://en.wikipedia.org/wiki/Henry%20Baker%20%28computer%20scientist%29
|
Henry Givens Baker Jr. is an American computer scientist who has made contributions in garbage collection, functional programming languages, and linear logic. He was one of the founders of Symbolics, a company that designed and manufactured a line of Lisp machines. In 2006 he was recognized as a Distinguished Scientist by the Association for Computing Machinery.
He is notable for his research in garbage collection, particularly Baker's real-time copying collector, and on the Actor model.
Baker received his B.Sc. (1969), S.M. (1973), E.E. (1973), and Ph.D. (1978) degrees at M.I.T.
The Chicken Scheme compiler was inspired by an innovative design of Baker's.
Bibliography
References
External links
Henry Baker's Archive of Research Papers at the Internet Archive
Programming language researchers
Living people
Year of birth missing (living people)
Massachusetts Institute of Technology alumni
American computer scientists
|
https://en.wikipedia.org/wiki/Microsoft%20Reader
|
Microsoft Reader is a discontinued Microsoft application for reading e-books, first released in August 2000, that used its own .LIT format. It was available for Windows computers and Pocket PC PDAs. The name was also used later for an unrelated application for reading PDF and XPS files, first released with Windows 8 - this app was discontinued in 2018.
E-book Reader
The e-book reader was available for download from Microsoft as a free application for computers running Windows and on PDAs running Pocket PC, where it has been built into the ROM since Windows CE 3.0. Microsoft Reader was compatible with Windows Mobile, but was not supported on newer Windows Phone 7 devices.
Microsoft Reader displays books in the .LIT (shortened from "literature") format, an extension of the Microsoft Compressed HTML Help format to include DRM. These e-books can be purchased and downloaded from online stores.
The notable features of Microsoft Reader are ClearType for increased readability on small screens, highlighting and doodling designed for quick note-taking, text notes, and searching. The PC version also has an optional plug-in for text-to-speech, enabling books to be read out loud.
Companies such as Barnes & Noble and Amazon.com partnered with Microsoft to provide books in the format when released in 2000.
In August 2011, Microsoft announced they were discontinuing both Microsoft Reader and the use of the .lit format for ebooks at the end of August 2012, and ending sales of the format on November 8, 2011.
Compatibility
Copy protection
Books accessible by Reader can be protected, or unprotected, only allowing access to protected books if the user has activated the software. This can be accomplished by registering using their Passport account. Only six Reader installations can be activated per account, after which, Microsoft requires the user to request further activations.
Creating .LIT files
Read in Microsoft Reader is an add-on, available from Microsoft, that can be used with Microsoft Word (versions 2000, 2002 and 2003) to create .LIT extension e-books. This software is not fully compatible with Office 2007.
Version history
Desktop
Pocket PC
Read in Microsoft Reader
Software Development Kit
Text to Speech
Third party
Notable third-party apps and tools to convert and read MS .LIT format on various devices include:
Calibre; an open source e-book library manager that runs on many environments; it can convert .LIT format files
Lexcycle Stanza (discontinued); a freeware program for reading eBooks; can read .LIT format, supports iOS.
Document viewer
In 2012, Microsoft released a Microsoft Reader Metro-style app with Windows 8 for reading documents in PDF, XPS and TIFF formats. Reader was included in Windows 8.1 and was a free download from the Windows Store for Windows 10. Support for Windows 10 Mobile ended in 2016 in favor of opening PDF documents within Microsoft Edge browser. Microsoft discontinued the application in February 2018, as PDF read
|
https://en.wikipedia.org/wiki/Spaghetti%20sort
|
Spaghetti sort is a linear-time, analog algorithm for sorting a sequence of items, introduced by A. K. Dewdney in his Scientific American column. This algorithm sorts a sequence of items requiring O(n) stack space in a stable manner. It requires a parallel processor.
Algorithm
For simplicity, assume we are sorting a list of natural numbers. The sorting method is illustrated using uncooked rods of spaghetti:
For each number x in the list, obtain a rod of length x. (One practical way of choosing the unit is to let the largest number m in the list correspond to one full rod of spaghetti. In this case, the full rod equals m spaghetti units. To get a rod of length x, break a rod in two so that one piece is of length x units; discard the other piece.)
Once you have all your spaghetti rods, take them loosely in your fist and lower them to the table, so that they all stand upright, resting on the table surface. Now, for each rod, lower your other hand from above until it meets with a rod—this one is clearly the longest. Remove this rod and insert it into the front of the (initially empty) output list (or equivalently, place it in the last unused slot of the output array). Repeat until all rods have been removed.
Analysis
Preparing the n rods of spaghetti takes linear time. Lowering the rods on the table takes constant time, O(1). This is possible because the hand, the spaghetti rods and the table work as a fully parallel computing device. There are then n rods to remove so, assuming each contact-and-removal operation takes constant time, the worst-case time complexity of the algorithm is O(n).
References
External links
A. K. Dewdney's homepage
Implementations of a model of physical sorting, Boole Centre for Research in Informatics
Classical/Quantum Computing, IFF-Institute
Sorting algorithms
Metaphors referring to spaghetti
|
https://en.wikipedia.org/wiki/Xbox%20Linux
|
Xbox Linux was a project that ported the Linux operating system to the Xbox video game console. Because the Xbox uses a digital signature system to prevent the public from running unsigned code, one must either use a modchip, or a softmod. Originally, modchips were the only option; however, it was later demonstrated that the TSOP chip on which the Xbox's BIOS is held may be reflashed. This way, one may flash on the "Cromwell" BIOS, which was developed legally by the Xbox Linux project. Catalyzed by a large cash prize for the first team to provide the possibility of booting Linux on an Xbox without the need of a hardware hack, numerous software-only hacks were also found. For example, a buffer overflow was found in the game 007: Agent Under Fire that allowed the booting of a Linux loader ("xbeboot") straight from a save game.
The Xbox is essentially a PC with a custom 733 MHz Intel Pentium III processor, a 10 GB hard drive (8 GB of which is accessible to the user), 64MB of RAM (although on all earlier boxes this is upgradable to 128MB), and 4 USB ports. (The controller ports are actually USB 1.1 ports with a modified connector.) These specifications are enough to run several readily available Linux distributions.
From the Xbox-Linux home page:
The Xbox is a legacy-free PC by Microsoft that consists of an Intel Celeron 733 MHz CPU, an nVidia GeForce 3MX, 64 MB of RAM, a 8/10 GB hard disk, a DVD drive and 10/100 Ethernet. As on every PC, you can run Linux on it.
An Xbox with Linux can be a full desktop computer with mouse and keyboard, a web/email box connected to TV, a server or router or a node in a cluster. You can either dual-boot or use Linux only; in the latter case, you can replace both IDE devices. And yes, you can connect the Xbox to a VGA monitor.
Uses
An Xbox with Linux installed can act as a full desktop computer with mouse and keyboard, a web/email box connected to a television, a server, router or a node in a cluster. One can either dual-boot or use Linux only; in the latter case, one can replace both IDE devices. One can also connect the Xbox to a VGA monitor. A converter is needed to use keyboards/mice in the controller ports; however this is not difficult, as the Xbox uses standard USB with a proprietary port.
Currently only a few distributions of Xbox Linux will run on the version 1.6 Xbox (the third newest version, including 1.6b). Xboxes with modchips and the Cromwell BIOS installed can run more distributions than those with only a softmod. This is mainly due to issues with the video chip used in version 1.6 Xboxes that was developed exclusively by Microsoft and which has no source code available at this time. This can cause significant overscan on all four sides of the screen when a different kernel than the original is loaded.
Softmod
One of the more popular ways of installing Xbox Linux is through a softmod, which does not require a modchip to use. The Xbox Linux softmod utilizes a save exploit found in the origi
|
https://en.wikipedia.org/wiki/Preemption%20%28computing%29
|
In computing, preemption is the act of temporarily interrupting an executing task, with the intention of resuming it at a later time. This interrupt is done by an external scheduler with no assistance or cooperation from the task. This preemptive scheduler usually runs in the most privileged protection ring, meaning that interruption and then resumption are considered highly secure actions. Such changes to the currently executing task of a processor are known as context switching.
User mode and kernel mode
In any given system design, some operations performed by the system may not be preemptable. This usually applies to kernel functions and service interrupts which, if not permitted to run to completion, would tend to produce race conditions resulting in deadlock. Barring the scheduler from preempting tasks while they are processing kernel functions simplifies the kernel design at the expense of system responsiveness. The distinction between user mode and kernel mode, which determines privilege level within the system, may also be used to distinguish whether a task is currently preemptable.
Most modern operating systems have preemptive kernels, which are designed to permit tasks to be preempted even when in kernel mode. Examples of such operating systems are Solaris 2.0/SunOS 5.0, Windows NT, Linux kernel (2.5.4 and newer), AIX and some BSD systems (NetBSD, since version 5).
Preemptive multitasking
The term preemptive multitasking is used to distinguish a multitasking operating system, which permits preemption of tasks, from a cooperative multitasking system wherein processes or tasks must be explicitly programmed to yield when they do not need system resources.
In simple terms: Preemptive multitasking involves the use of an interrupt mechanism which suspends the currently executing process and invokes a scheduler to determine which process should execute next. Therefore, all processes will get some amount of CPU time at any given time.
In preemptive multitasking, the operating system kernel can also initiate a context switch to satisfy the scheduling policy's priority constraint, thus preempting the active task. In general, preemption means "prior seizure of". When the high-priority task at that instance seizes the currently running task, it is known as preemptive scheduling.
The term "preemptive multitasking" is sometimes mistakenly used when the intended meaning is more specific, referring instead to the class of scheduling policies known as time-shared scheduling, or time-sharing.
Preemptive multitasking allows the computer system to more reliably guarantee each process a regular "slice" of operating time. It also allows the system to rapidly deal with important external events like incoming data, which might require the immediate attention of one or another process.
At any specific time, processes can be grouped into two categories: those that are waiting for input or output (called "I/O bound"), and those that are fully utilizin
|
https://en.wikipedia.org/wiki/Lemon%20of%20Troy
|
"Lemon of Troy" is the twenty-fourth and penultimate episode of the sixth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on May 14, 1995. In the episode, the children of Springfield try to retrieve their beloved lemon tree after it is stolen by the children of Shelbyville.
The episode was written by Brent Forrester and directed by Jim Reardon. For this episode, the animators designed a non-polluted version of Springfield. It features cultural references to the 1984 song "When Doves Cry", the 1981 film Mad Max 2, and the 1968 song "What a Wonderful World". The episode's title is a play on the name Helen of Troy from Greek mythology. The episode acquired a Nielsen rating of 8.1. The episode has garnered universal acclaim and is regarded as a classic episode of the show.
Plot
Marge lectures Bart on the importance of town pride after he writes his name in wet cement. Soon he realizes the joys of living in Springfield and is upset by anti-Springfield taunts coming from neighboring Shelbyville. Grampa explains this rivalry can be traced to the establishment of the two towns: Jebediah Springfield wanted a town which promoted chastity and abstinence, but Shelbyville Manhattan, founder of Shelbyville, was a proponent of cousin marriage.
The next day, Springfield's lemon tree is stolen by a gang of boys from Shelbyville. Bart leads Milhouse, Nelson, Martin, Todd and Database to Shelbyville to find the tree and return it to Springfield. Bart's posse locates the tree in an impound lot where the leader of the gang that stole the tree lives.
Using Ned Flanders' RV, Homer leads the boys' fathers to their sons in Shelbyville. The fathers and sons demand their tree be returned, but the owner of the impound lot taunts them and refuses to surrender it. Using a Trojan Horse strategy, Bart parks the RV outside a hospital, where it is impounded to the lot. When night falls, the Springfield men and boys emerge from the RV and tie the lemon tree to its top. The lot owner catches them but they manage to escape and return the tree to Springfield.
In the aftermath, the town elders of Springfield and Shelbyville provide their own endings to the tale. In Springfield, Grampa lauds the triumphant return of the tree by the "heroes of Springfield"; Bart and Milhouse celebrate with a glass of lemonade made from a few drops of lemon juice (and a large amount of sugar). In Shelbyville, an old man makes up a story about the tree being haunted to cover the embarrassment of losing to their rivals in Springfield. The Shelbyville kids drink turnip juice instead, much to their disgust.
Production
Brent Forrester wrote "Lemon of Troy", his second episode of The Simpsons. Jim Reardon directed it. Early on in the production stage, the writers decided that the leader of the Shelbyville children, Shelby, and his father should be modeled after Bart and Homer. Shelby's voice was provided by Tress MacNeille, and
|
https://en.wikipedia.org/wiki/List%20of%20Atari%207800%20games
|
This is a list of Atari 7800 games.
The Atari 7800 is an 8-bit home video game console developed by Atari Corporation and designed by General Computer Corporation, released in North America first on May 1986. It was the third programmable console developed under the Atari brand. The following list contains all of the games released for the 7800. Also listed are the unlicensed aftermarket (homebrew) and unreleased (cancelled) titles.
First test marketed by Atari, Inc. in southern California in June 1984 following an announcement at that year's SCES, the 7800 was designed to replace the unsuccessful Atari 5200 and re-establish Atari's market supremacy against Nintendo and Sega, being fully backward-compatible with the Atari 2600 and affordably priced at US$140. However, 7800 systems manufactured during original production run languished on warehouse shelves until its re-introduction in May 1986 at $79.95, after additional negotiations with GCC concluded and selling 100,000 consoles in North America by the end of 1986, less than its competitors (Nintendo Entertainment System and Master System). The platform was ultimately discontinued by Atari on January 1, 1992, and it is unknown how many 7800 units were sold in total during its lifetime.
Commercially released games
Listed here are all officially released Atari 7800 games.
{|class="wikitable sortable" id="softwarelist" width="auto"
! rowspan="2" | Title
! rowspan="2" | Developer(s)
! rowspan="2" | Publisher(s)
! rowspan="2" | Year
! rowspan="2" | Region(s) released
|-
|-
! id="0-9" style="text-align: left;"| 32 in 1
| Atari Corporation
| Atari Corporation
| 1988
| PAL
|-
! id="A" style="text-align: left;"| Ace of Aces
| Nova Game Design
| Atari Corporation
| 1988
| NA, PAL
|-
! style="text-align: left;"| Alien Brigade
| Ken Grant
| Atari Corporation
| 1990
| NA, PAL
|-
! style="text-align: left;"| Asteroids
| General Computer Corporation
| Atari Corporation
| 1986
| NA, PAL
|-
! id="B" style="text-align: left;"| Ballblazer
| General Computer Corporation
| Atari Corporation
| 1988
| NA, PAL
|-
! style="text-align: left;"| Barnyard Blaster
| James Zalewski
| Atari Corporation
| 1988
| NA, PAL
|-
! style="text-align: left;"| Basketbrawl
| BlueSky Software
| Atari Corporation
| 1990
| NA, PAL
|-
! id="C" style="text-align: left;"| Centipede
| General Computer Corporation
| Atari Corporation
| 1986
| NA, PAL
|-
! style="text-align: left;"| Choplifter
| Ibid, Inc.
| Atari Corporation
| 1987
| NA, PAL
|-
! style="text-align: left;"| Commando
| Sculptured Software
| Atari Corporation
| 1989
| NA, PAL
|-
! style="text-align: left;"| Crack'ed
| Robert Neve
| Atari Corporation
| 1988
| NA, PAL
|-
! style="text-align: left;"| Crossbow
| Exidy
| Atari Corporation
| 1987
| NA, PAL
|-
! id="D" style="text-align: left;"| Dark Chambers
| Sculptured Software
| Atari Corporation
| 1988
| NA, PAL
|-
! style="text-align: left;"| Desert Falcon
| General Computer Corporation
| Atari Corporation
| 1987
| NA, PAL
|
https://en.wikipedia.org/wiki/FM%20876%20Network
|
The Melbourne Low Power FM Services
Melbourne (like most Australian major cities) is home to many broadcasters forming a diverse network of services heard on the frequencies between 87.6 & 88 FM. This said, there is no such thing as the "Melbourne FM Narrowcast Network".
These services vary according to area, and include:
Melbourne CBD: Kiss FM 87.6
Frankston & Cranbourne: Surf FM 87.6, Kiss FM 88
Coburg/Flemington: Middle East Radio 87.6, Kiss FM 87.8
Epping: Kiss FM 87.8
Hoppers Crossing (Melbourne Far West): MAC-FM 87.6, Kiss FM 87.8
Doncaster/Bayswater, Victoria: Radio Jackie 87.6, Kiss FM 87.8
Geelong/Geelong Outer South-West : Tourist FM 87.6, Kiss FM 87.8
Licensing and Regulation
The services operating on the Low Power Open Narrowcasting system are permitted a maximum of 1 Watt transmitter power (1W pY), AND are limited to a signal strength which must not exceed 48 decibels above one microvolt per metre at 2 km from the nominated site of the transmitter. Additionally the services are required to transmit an omni-directional pattern. (ref: Australian Communications & Media Authority website).
The services are further restricted in that they are required to be "limited" in some way, most commonly limited audience appeal. This is achieved through provision of services in languages other than English, Horse Racing, Local Tourist Information services, or time limited services. The limitation provides these services to be acceptable under the requirements of the Narrowcasting class licence regime, as regulated by the Australian Communications & Media Authority.
Broadcasting Services Act (Commonwealth of Australia)
Open narrowcasting services are broadcasting services whose reception is limited in at least one of a number of ways specified in section 18 of the Broadcasting Services Act 1992:
by being targeted to special interest groups;
by being intended for limited locations (e.g. arenas or business premises);
by being provided during a limited period or to cover a special event;
because they provide programs of limited appeal;
or for some other reason.
The above information is sourced from the www.acma.gov.au website
Radio stations in Geelong
Radio stations in Melbourne
Radio stations in Victoria (state)
|
https://en.wikipedia.org/wiki/Conchita%20Campbell
|
Conchita Elizabeth Campbell (born October 25, 1995) is a Canadian actress. She is perhaps best known for playing Maia Rutledge on the USA Network series The 4400.
Biography
Campbell was born in Vancouver, British Columbia. She is trained in both ballet and jazz.
Career
Campbell's career started with acting in television commercials at a young age.
Campbell made two guest appearances on CTV's hit show, Cold Squad. She starred in Wilder Days with Peter Falk and Tim Daly in 2003.
She is known for her role as Maia Rutledge-Skouris on the USA channel miniseries and show, The 4400 (2004–2007). There she portrays a returned 'child abductee' who has been missing for decades. When 'returned', she has not aged and is imbued with the psychic ability to foretell the future.
In 2004, she starred in the small indie-film, Pursued, opposite Gil Bellows, Michael Clarke Duncan and Christian Slater. Though she filmed a small role in Bob the Butler, her scenes were deleted. Her feature film debut ultimately came with Scary Movie 4, which set a box office record for Easter weekend 2006.
Filmography
Film
Television
Awards and nominations
For her role of Maia Skouris on the television series The 4400, Campbell was nominated three times for a Young Artist Award: twice in the category of Best Performance in a TV Series (Comedy or Drama) in 2005 and 2007, as well as one nomination for Best Performance in a TV Series (Drama): Supporting Young Actress in 2006.
In 2008 for her guest role of Maggie Thompson on the series Supernatural, episode: "Playthings", she was nominated for a Young Artist Award in the category of Best Performance in a TV Movie, Miniseries or Special: Supporting Young Actress.
References
External links
1995 births
21st-century Canadian actresses
Actresses from Vancouver
Canadian child actresses
Canadian film actresses
Canadian television actresses
Living people
|
https://en.wikipedia.org/wiki/The%20Name%27s%20the%20Same
|
The Name's the Same is an American game show produced by Goodson-Todman for the ABC television network from December 5, 1951 to August 31, 1954, followed by a run from October 25, 1954 to October 7, 1955. The premise was for contestants to guess the names of persons whose actual name corresponded to a famous person, celebrity, a place, common object or action.
It was alternately sponsored by Swanson and Johnson Wax, for the majority of its run. It was also sponsored by the Bendix home appliance division of Avco early in its run, and Clorets and Chicken of the Sea tuna midway through its run. The show's second run sponsor, Ralston Purina, also sponsored Ethel and Albert, the program that replaced The Name's the Same on the ABC schedule.
Moderators
Robert Q. Lewis was the original host and moderator from December 5, 1951 to August 31, 1954. During three separate personal vacation breaks, in 1953 and 1954, Conrad Nagel, Brian Aherne, and Clifton Fadiman substituted for Lewis. After Lewis' final show, where he implied the show's future was in doubt, The Name's the Same went on hiatus, giving Lewis more time to devote to his daytime variety shows on CBS which Swanson decided to sponsor in place of this show. (Announcer Lee Vines continued with Lewis on CBS.)
The Name's the Same returned on October 25 with a new set, and Ralston Purina joined as the sponsor. During this 39-week run the moderators changed thrice: Dennis James hosted for 18 weeks, through April 4; Bob and Ray shared the moderators' duties for 10 weeks, from April 11 to June 21; Clifton Fadiman returned to the emcee's chair on June 28, hosting for 11 weeks through the final episode on October 7.
Panelists
The only panelist to remain for the show's entire run was New York-based actress and socialite Joan Alexander. The original two co-panelists with Alexander were comic Abe Burrows and composer Meredith Willson. Burrows left the show in November 1952, a victim of the Red Scare and comedian Jerry Lester took his seat, followed by comedian Carl Reiner on April 14, 1953. Willson stayed on until July 1953, and his place on the panel was taken by ABC sportscaster Bill Stern. On September 15, 1953, Reiner left and Alexander and Stern were joined by New York radio personality Gene Rayburn.
On February 9, 1954, the panel's makeup was adjusted and Bess Myerson, Miss America 1945, was added to the panel to replace Bill Stern and a fourth panelist was added to the game. That fourth panelist was originally Sherlock Holmes portrayer Basil Rathbone, but he left on April 6 and was replaced by Texaco Star Theater regular Arnold Stang. Stang then left on May 18 and was replaced by humorist Roger Price, who stayed on until the final episode.
In January 1955, Rayburn and Myerson left the panel and were replaced by The Jackie Gleason Show'''s Audrey Meadows and New York Herald Tribune columnist and future To Tell The Truth regular Hy Gardner. Gardner was replaced by actor Walter Slezak in March 1955, wh
|
https://en.wikipedia.org/wiki/Cybergirl
|
Cybergirl is an Australian-French children's television series that first screened on Network Ten in Australia. The 26-episode series was created by Jonathan M. Shiff, whose previous series include the BAFTA-award-winning Ocean Girl.
Plot
Cybergirl is a Blue superheroine Human Prototype 6000 living under the secret identity of ordinary teenage girl Ashley Campbell. In reality, she is a "Human Prototype 6000" from a distant planet.
Her powers include super-human strength, super-human speed, and the ability to interface directly with electronic devices and computers; she is also able to physically change her appearance between that of the blue-haired, ethereal-looking Cybergirl and the less conspicuous, mousy-haired Ashley, and can alter her clothing at will.
She was originally known as the Cyber Replicant Human Prototype 6000, the only one of her model to be built. Not only are her powers far and above that of earlier models, she has a much wider emotional scope than her predecessors. She ran away from her planet of origin in order to explore the beings she was modeled after, namely humans.
Two other Evil Red Replicants called Isaac and Xanda are sent after her and their sole mission is to destroy her. She lands on Earth in the fictional city of River City, Australia which is modeled on and filmed in Brisbane. She meets Jackson and Hugh Campbell, who take her in, and she adopts the name Cybergirl as her superheroine identity. Jackson calls her "Cy" and she later uses her powers to make herself look more human; this identity is called Ashley, in which she poses as Jackson's cousin and Hugh's niece. The only other person besides Hugh and Jackson to know her identity is Kat, her friend and neighbour.
She is pursued not only by Xanda and Isaac but also by a powerful software mogul named Rhyss. She is well loved by the populace of River City, however, and she enjoys the approval of Mayor Buxton, whose twin daughters Emerald and Sapphire are big fans of the superheroine. Ironically they snub her, as Ashley, at school.
Cast
Main
Ania Stepien as Ashley Campbell / Cybergirl
Craig Horner as Jackson Campbell
Mark Owen-Taylor as Hugh Campbell
Jennifer Congram as Xanda
Ric Anderson as Isaac
Septimus Caton as Rhyss
Winston Cooper as Giorgio
Peter Mochrie as Rick Fontaine
Jovita Shaw as Kat Fontaine
Recurring
Christine Amor as Mayor Burdette Buxton
David Vallon as Romirez
Michelle Atkinson as Anthea
Jessica Origliasso as Emerald Buxton
Lisa Origliasso as Sapphire Buxton
Tony Hawkins as McMurtrie
Guest
John Dommett as Mr. Southerly
Jason Klarwein as Sales Assistant
Daniel Amalm as Marco
Julie Eckersley as Julia
Damien Garvey as Paramedic
Remi Broadway as Zak Furnace
Episodes
Home media
Cybergirl was released on DVD on 4 December 2006 as CyberGirl: The Superhero for a New Generation – The Complete Series. The set includes all 26 episodes on 4 DVDs and is Region 0. The release includes making of/behind-the-scenes featurettes created from a period Electro
|
https://en.wikipedia.org/wiki/Jason%20Keng-Kwin%20Chan
|
Jason Keng-Kwin Chan (born December 1, 1971) is a Malaysian actor best known for his role as Cameron Watanabe, the Green Samurai Ranger, as well as his clone, Cyber Cam, in Power Rangers: Ninja Storm.
He is currently a multi-award-winning writer, director, composer and actor based in Singapore. He is co-founder of BananaMana Films, which is one of Singapore's premiere production companies for creating Asian dramas in English for global distribution.
Background & Training
Born in Kuala Lumpur, Malaysia, Chan is of Chinese descent and moved to Perth, Western Australia with his family when he was only 5 years old. He entered medical school at the University of Western Australia, but Chan continued to pursue the creative arts, studying ballet, contemporary dance, and jazz dance at the Western Australian Academy of Performing Arts. After graduating, he obtained his Fellowship in General Practice and worked as a General Practitioner for a few years before gaining a place in the renowned National Institute of Dramatic Art (NIDA) in Sydney (other graduates include: Mel Gibson, Cate Blanchett, Judy Davis, Baz Luhrmann and Hugo Weaving) where he obtained a Bachelor of Dramatic Arts in Acting. He is the co-founder of the Production Company "BananaMana Films" along with Christian Lee. Chan currently resides in Singapore.
Current Work
Since co-founding BananaMana Films, Jason has gone on to write, direct, edit and produce for various projects. The first series he co-wrote, directed, produced and acted in was a web series: "What Do Men Want?". However, prior to production the national broadcaster of Singapore asked to have it converted into a full-length TV series and it aired in 2014 as a 13 x half hour Romantic comedic TV drama. Jason and Christian won an outstanding directing in a drama series award at LA Webfest for this drama.
Their second drama "Perfect Girl" was created as a 10 x 5-8min web series. This series went on to win 7 international awards from 16 nominations. Jason was credited as writer and composer, and shared directing and editing credits.
Recently, Jason has co-written, directed and scored a TV pilot "Bang Bang Club" which has gone on to win a Platinum REMI award at the Worldfest Houston International Film Festival 2016. Jason was also nominated for Best Editing and Best Original Score for this project at the Indie Series Awards (LA) 2016.
Awards
Jason has been a recipient of numerous awards and nominations in various categories: writing, directing, acting, editing, composing.
Awards
Platinum Remi (Houston International Film Fest 2016)
Outstanding Writing (LA Webfest 2015)
Outstanding Directing (LA Webfest 2015)
Outstanding Editing (LA Webfest 2015)
Outstanding Drama Series (LA Webfest 2015)
Outstanding Drama (Toronto Webfest 2015)
Best International Series (Atlanta Webfest 2014)
Nominations
Best Editing (Indie Series Awards 2016)
Best Score (Indie Series Awards 2016)
Outstanding Lead Actor (LA Webfest 2015)
Outstandin
|
https://en.wikipedia.org/wiki/Lisa%27s%20Date%20with%20Density
|
"Lisa's Date with Density" is the seventh episode of the eighth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on December 15, 1996. It was written by Mike Scully and directed by Susie Dietter. The episode sees Lisa develop a crush on Nelson Muntz. When they start dating and Lisa is unable to reform him, she ends their relationship. In the subplot, Homer uses an autodialer in a telemarketing scheme that annoys all of Springfield's residents.
Plot
Superintendent Chalmers visits Principal Skinner at Springfield Elementary School to show off his newly purchased 1979 Honda Accord. Chalmers is distraught when he discovers the car's hood ornament is missing. Skinner orders a search of every student's locker which reveals that Nelson Muntz, the school bully, is the culprit. As punishment, Nelson is forced to return all stolen items found in his locker to their owners and perform janitorial work with Groundskeeper Willie.
Lisa is caught staring at Nelson during band practice and unwittingly causes a commotion among the band students. After she receives detention and is forced to write lines on the chalkboard, she realizes she has developed a crush on Nelson. She asks Milhouse to pass a love note to him in class, but Nelson thinks Milhouse wrote the love note and beats him. After Milhouse is taken to the hospital, Lisa confesses to Nelson that she wrote the note and soon she spends more time with him, inviting him to her house and even visiting Nelson's own.
At Marge Simpson's suggestion, Lisa vows to turn Nelson from a troublemaker into a sweet, well-behaved young man. She forcibly dresses him in sharp clothing and takes him to the Springfield Observatory. To distract Lisa, Nelson kisses her, but finds he has fallen for Lisa in the process. However, the influence of Nelson's friends Jimbo, Dolph and Kearney prevails when they convince him to vandalize Principal Skinner's house. After Skinner calls the police, the four boys flee. Nelson takes refuge at Lisa's house and insists he is innocent; Lisa believes him until he accidentally reveals he was involved in the boys' prank. Lisa realizes that she cannot reform Nelson and gently ends their relationship. On her way home she runs into Milhouse, who is delighted to hear that she is no longer seeing Nelson.
In the subplot, Chief Wiggum arrests a scam artist for telemarketing fraud. Homer witnesses the arrest and retrieves the discarded autodialer from a trash bin. He uses the machine for a telemarketing scheme to persuade everyone to send him money under the name "Happy Dude". His phone calls annoy the whole town and Chief Wiggum catches him. Instead of confiscating the autodialer and taking Homer into custody, he shoots it and asks Homer to bring it to his court hearing lest the charges be dismissed for lack of evidence. In the closing credits, the repaired autodialer plays Homer's new, court-ordered message asking residents to
|
https://en.wikipedia.org/wiki/Oh%20Brother%2C%20Where%20Art%20Thou%3F
|
"Oh Brother, Where Art Thou?" is the fifteenth episode of the second season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on February 21, 1991. In the episode, Grampa confesses that Homer has a half-brother named Herbert Powell, a car manufacturer. Herb permits Homer to design his company's new car, which is an overpriced monstrosity that bankrupts him.
The episode was written by Jeff Martin and directed by Wes Archer. American actor Danny DeVito provided the voice of Herb. The episode features cultural references to cars such as the Edsel, the Tucker Torpedo, the Ford Mustang, and the Lamborghini Cheetah.
Since airing, the episode has received mostly positive reviews from television critics. It acquired a Nielsen rating of 15.4, and was the highest-rated show on Fox the week it aired. Some fans were upset with the sad ending of the episode, so the producers decided to write a sequel, "Brother, Can You Spare Two Dimes?" with a positive ending.
Plot
Grampa suffers a mild heart attack while arguing with a cinema clerk. Realizing he may not have much time left, he confesses a long-hidden secret: Homer has a half-brother. Before Grampa married Homer's mother, he and a carnival prostitute had a son whom they left at the Shelbyville Orphanage. Determined to find his brother, Homer visits the orphanage and learns that his half-brother Herb Powell now lives in Detroit.
Herb owns Powell Motors, a Detroit automobile manufacturer. Herb is overjoyed to learn Homer is his half-brother and invites the Simpsons to stay at his mansion. Bart, Lisa, and Maggie are enthralled by Herb's wealthy lifestyle and outgoing personality, but Marge worries wealth will spoil her children. After Herb decides that Homer, an average American, is the perfect person to design his company's new car, he gives him free rein to design it. When Herb's design team ignores Homer's outlandish suggestions, Herb encourages Homer to take command of the project and incorporate his own ideas in the final design.
When the new car is unveiled with great fanfare, Herb is horrified to find it is unaffordable (costing $82,000) and looks ridiculous. Powell Motors is forced into bankruptcy. The bank forecloses on Herb's mansion and he loses everything he worked for. As Herb leaves Detroit on a bus, he angrily disowns Homer as a brother. Grampa arrives and scolds Homer for ruining Herb's life. While Homer drives the family home, Bart tells him his car is great. Homer is relieved to learn at least one person likes it.
Production
"Oh Brother, Where Art Thou?" was written by Jeff Martin and directed by Wes Archer. Both Homer's mother and Herb Powell make their first appearances on The Simpsons in the episode.
The episode was recorded on August 13, 1990. The voice of Herb was provided by guest star Danny DeVito, an American actor who was suggested for the role by Simpsons executive producer Sam Simon. Bart's voice actor, Nancy
|
https://en.wikipedia.org/wiki/Disk%20Utility
|
Disk Utility is a system utility for performing disk and disk volume-related tasks on the macOS operating system by Apple Inc.
Functions
The functions currently supported by Disk Utility include:
Creation, conversion, backup, compression, and encryption of logical volume images from a wide range of formats read by Disk Utility to .dmg or, for CD/DVD images, .cdr
Mounting, unmounting and ejecting disk volumes (including both hard disks, removable media, and disk volume images)
Enabling or disabling journaling
Verifying a disk's integrity, and repairing it if the disk is damaged (this will work for both Mac compatible format partitions and for FAT32 partitions with Microsoft Windows installed)
Erasing, formatting, partitioning, and cloning disks
Secure deletion of free space or disk using a "zero out" data, a 7-pass DOD 5220-22 M standard, or a 35-pass Gutmann algorithm
Adding or changing partition table between Apple Partition Map, GUID Partition Table, and master boot record (MBR)
Restoring volumes from Apple Software Restore (ASR) images
Checking the S.M.A.R.T. status of a hard disk
Disk Utility functions may also be accessed from the macOS command line with the diskutil and hdiutil commands. It is also possible to create and manage RAM disk images by using hdiutil and diskutil in terminal.
History
In the classic Mac OS, similar functionality to the verification features of Disk Utility could be found in the Disk First Aid application. Another application called Drive Setup was used for drive formatting and partitioning and the application Disk Copy was used for working with disk images.
Before Mac OS X Panther, the functionality of Disk Utility was spread across two applications: Disk Copy and Disk Utility. Disk Copy was used for creating and mounting disk image files whereas Disk Utility was used for formatting, partitioning, verifying, and repairing file structures. The ability to "zero" all data (multi-pass formatting) on a disk was not added until Mac OS X 10.2.3. Further changes introduced in Mac OS X Tiger, specifically version 10.4.3, allowed Disk Utility to be used to verify the file structure of the current boot drive. Mac OS X Leopard added the ability to create, resize, and delete disk partitions without erasing them, a feature known as live partitioning. In OS X El Capitan, Disk Utility has a different user interface and lost the abilities to repair permissions due to obsolescence, create and manage disks formatted as RAID, burn discs, and multi-pass format internal solid-state drives and encrypted external drives.
See also
Apple Software Restore
Logical Disk Manager
Palimpsest Disk Utility
GNU Parted
diskpart
fdisk
cfdisk
sfdisk
References
External links
Online man page for diskutil
Online man page for hdiutil
MacOS
Disk partitioning software
Hard disk software
Data erasure software
Backup software for macOS
MacOS archivers and compression-related utilities
|
https://en.wikipedia.org/wiki/DEC%20Multia
|
The Multia, later re-branded the Universal Desktop Box, was a line of desktop computers introduced by Digital Equipment Corporation on 7 November 1994. The line is notable in that units were offered with either an Alpha AXP or Intel Pentium processor as the CPU, and most hardware other than the backplane and CPU were interchangeable. Both the Alpha and Intel versions were intended to run Windows NT.
The Multia had a compact case that left little room for expansion cards and restricted air flow, which can cause premature hardware failure due to overheating if not properly cared for. Enthusiasts remedy this by placing the Multia vertically instead of horizontally, allowing the heated air to escape via vents at the top, although this still requires preventing the Multia from overheating due to other factors, e.g. environmental.
Hardware specifications
The Alpha Multias included either an Alpha 21066 or Alpha 21066A microprocessor running at 166 MHz or 233 MHz respectively, and came with 16 or 24 MB of RAM as standard (expandable to 128 MB officially, but in practice 256 MB). Because the 21066 was a budget version of the Alpha 21064 processor, it had a narrower (64-bit versus 128-bit) and slower bus and thus performance was roughly equivalent to a Pentium running at 100 MHz for integer operations, but superior in floating-point; furthermore, the standard RAM capacity was a severe restriction on the performance of these workstations. The Alpha-based Multias came with the TGA (DEC 21030) graphics adapter.
Standard peripherals on both Alpha and Intel models included a SCSI host adapter, DEC 21040 Ethernet controller, two PCMCIA slots, two RS-232 ports, a bi-directional parallel port, a 2.5 in or 3.5 in SCSI or ATA hard disk (340 MB to 1.6 GB), PS/2 keyboard and mouse ports, and a PCI slot (on models with 2.5-inch hard disks).
Models
Multia models comprised:
Alpha Multia (codenamed QuickSilver):
VX40: 166 MHz 21066, optional floppy disk drive and external SCSI
VX41: 166 MHz 21066 upgradable to 233 MHz 21066A
VX42: 233 MHz 21066A
Intel Multia (codenamed Minerva):
VX51: 100 MHz Pentium (P54)
In 1996, Digital began offering the Alpha Multia without Windows NT and renamed the line the "Universal Desktop Box" (nicknamed "UDB"). Prices were quite low, such that for the first time many enthusiasts and hobbyists could afford an Alpha AXP-based computer. The Multia or UDB can run Windows NT for Alpha through Windows NT 4.0 Service Pack 6 (although Windows 2000 was never officially released for the Alpha platform, Windows 2000 Beta was released and in fact runs on the Multia), and both Linux and NetBSD are available for the Multia. Additionally, both Digital UNIX and OpenVMS can be configured to run on the Multia (with certain limitations), although initially such operating systems were disabled from running on the budget Multia line.
The Alpha-based Multia came configured with the ARC firmware console for running Windows NT, although SRM w
|
https://en.wikipedia.org/wiki/Hurricane%20Neddy
|
"Hurricane Neddy" is the eighth episode of the eighth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on December 29, 1996. It was written by Steve Young, directed by Bob Anderson, and features a cameo by Jon Lovitz as Jay Sherman from The Critic. In the episode, a violent hurricane strikes Springfield and spares the Simpsons. But, by pure chance, the only house destroyed belongs to Ned Flanders. As a result, Ned begins to lose his faith in God and the townspeople around him, especially Homer leading to a nervous breakdown.
Plot
As Hurricane Barbara approaches Springfield, panicked citizens ransack the Kwik-E-Mart. After the storm, the Simpsons leave their basement to find their home unscathed. However, their next-door neighbor, Ned Flanders, emerges from a heap of rubble to find his house destroyed, forcing the Flanders family to take shelter in the church basement. Ned's house is uninsured, as he regards insurance as a form of gambling. Ned is further discouraged after learning that his business, The Leftorium, was looted after the storm. Distraught, Ned asks Rev. Lovejoy if God is punishing him like Job, despite his strict adherence to his faith.
The next day, Marge surprises the Flanders family with a new home, which the residents of Springfield have built, though shoddily. When Homer leans on the front door, the house immediately collapses. Finally, the lens in Ned's glasses breaks and his rage boils over after he is unable to calm himself down, furiously berating all the townspeople's flaws and failures after years of politeness, including Homer (who believes he has got off "pretty easy").
Worried he is losing his mind and feeling terrible for his intense outburst, Ned voluntarily commits himself to a mental hospital. He is visited by his childhood psychiatrist, Dr. Foster, who recalls Ned's childhood as an out-of-control brat raised by beatnik parents. Ned's treatment, the University of Minnesota Spankalogical Protocol, involved eight months of continuous spanking by Foster. The treatment worked too well and left Ned unable to express anger until the losses he suffered from the storm made him erupt in repressed violent rage.
Foster realizes that his earlier approach was flawed and enlists Homer to help Ned express his emotions. Foster thinks Homer is perfect for this treatment because of his and Ned's mutual dislike. After several scripted insults fail to rile Ned's anger, Homer disparages his apparent like of everything, to which Ned admits he hates two things: the post office and his parents. Foster declares Ned cured and releases him from the asylum.
Outside the hospital, Ned is greeted by the townsfolk of Springfield, including the rest of the Simpsons and his family. Ned promises to tell people when they offend him instead of stifling his anger, to Foster's approval, and cheerily adds he will run them down with his car if they anger him with Homer remarki
|
https://en.wikipedia.org/wiki/Grade%20School%20Confidential
|
"Grade School Confidential" is the nineteenth episode of the eighth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on April 6, 1997. It was written by Rachel Pulido and directed by Susie Dietter. The episode establishes the long-term relationship between Seymour Skinner and Edna Krabappel. Bart witnesses a romantic moment between Principal Skinner and Mrs. Krabappel and acts as a snitch for them. However, they later embarrass him and he exposes their romance to the public.
Plot
Martin Prince invites his classmates to his birthday party, but it ends badly after most of the partygoers get food poisoning and end up leaving by ambulance due to diseased oysters being served instead of cake. After the party, Bart, who fed his oysters to the Prince family cat, sees Principal Seymour Skinner and Edna Krabappel kissing in Martin's pink playhouse. After failing to provide Bart with a convincing cover story, Edna and Skinner, fearing that they will be fired if anyone discovers their romance, swear him to secrecy in exchange for putting Milhouse's name on his permanent record.
Edna and Skinner use Bart as their gofer. When Edna and Skinner accidentally run into Superintendent Chalmers whilst on a date at the cinema, Skinner fetches Bart, who had been sleeping, so that Edna and Skinner could claim that they were supervising a field trip. Bart is humiliated in front of his classmates after Skinner forces him to say "I love you, Edna Krabappel" aloud as if the message were his own. Fed up, Bart gathers the entire school in front of a janitor's closet and opens the door to reveal that Skinner and Edna are making out.
Word quickly spreads throughout Springfield, with the story the students tell growing more illicit and exaggerated. After hearing his son Ralph's risqué version involving the two "making babies", Chief Wiggum reports it to Chalmers, who gives Skinner an ultimatum: either he ends his relationship with Edna or they both will be fired. Skinner decides that love trumps his professional goals, so Chalmers fires them and demands they leave the building by day's end.
Feeling guilty for costing Edna and Skinner their jobs, Bart encourages them to stand up for themselves. With Bart's help, Skinner and Edna barricade themselves inside the school, contact the media and make their demands: they want their jobs back and the townspeople to stop interfering with their relationship. When several parents protest that their children saw them having sex in the janitor's closet, Skinner insists that is untrue because he is a 44-year-old virgin. The mob is left speechless at the revelation. Chalmers brusquely concedes that it must be true, because nobody in their right mind would lie about something so embarrassing. Realizing that they have overreacted, the residents leave peacefully.
Chalmers agrees to reinstate Skinner and Edna, but asks them to "keep the lewdness at a minimum" during sc
|
https://en.wikipedia.org/wiki/Rainbow%20Series
|
The Rainbow Series (sometimes known as the Rainbow Books) is a series of computer security standards and guidelines published by the United States government in the 1980s and 1990s. They were originally published by the U.S. Department of Defense Computer Security Center, and then by the National Computer Security Center.
Objective
These standards describe a process of evaluation for trusted systems. In some cases, U.S. government entities (as well as private firms) would require formal validation of computer technology using this process as part of their procurement criteria. Many of these standards have influenced, and have been superseded by, the Common Criteria.
The books have nicknames based on the color of its cover. For example, the Trusted Computer System Evaluation Criteria was referred to as "The Orange Book." In the book entitled Applied Cryptography, security expert Bruce Schneier states of NCSC-TG-021 that he "can't even begin to describe the color of [the] cover" and that some of the books in this series have "hideously colored covers." He then goes on to describe how to receive a copy of them, saying "Don't tell them I sent you."
Most significant Rainbow Series books
References
External links
Rainbow Series from Federation of American Scientists, with more explanation
Rainbow Series from Archive of Information Assurance
Computer security standards
|
https://en.wikipedia.org/wiki/Continuum%20Fingerboard
|
The Continuum Fingerboard or Haken Continuum is a music performance controller and synthesizer developed by Lippold Haken, a professor of Electrical and Computer Engineering at the University of Illinois, and sold by Haken Audio, located in Champaign, Illinois.
The Continuum Fingerboard was initially developed from 1983 to 1998 at the CERL Sound Group at the University of Illinois, to control sound-producing algorithms on the Platypus audio signal processor and the Kyma/Capybara workstation.
In 1999, the first Continuum Fingerboard was commercially sold. Until 2008, the Continuum Fingerboard provided IEEE-1394 (FireWire) connections to control a Kyma sound design workstation, as well as MIDI connections to control a MIDI synthesizer module. More recently, the Continuum Fingerboard generates audio directly in addition to providing MIDI connections for MIDI modules, software synthesizers, and Kyma (the IEEE-1394 connection that was present on earlier models has been removed). An external control voltage generator permits control of analog modular synthesizers.
Specifications
The Continuum features a touch-sensitive neoprene playing surface measuring approximately high by either long for a full-size instrument, or long for a half-size instrument. The surface allows a pitch range of 9350 cents (about 7.79 octaves) for the full-size instrument, and 4610 cents (about 3.84 octaves) for the half-size instrument. The instrument has a response time of 0.33 ms.
Sensors under the playing surface respond to finger position and pressure in three dimensions and provide pitch resolution of one-tenth cent along the length of the scale (the X dimension), allowing essentially continuous pitch control for portamento effects and notes that are not in the chromatic scale, and allowing for the application of vibrato or pitch bend to a note. A software "rounding" feature enables pitch to be quantized to the notes of a traditional equal-tempered scale, just scale or other scale to facilitate in-tune performance, with the amount and duration of the "rounding" controllable in real time.
The Continuum also provides two additional parameters for the sound: it is able to transmit the finger pressure on the board as a MIDI value, as well as the finger's vertical position on the key. These parameters are independently programmable; a standard configuration is where position on the X-Axis (lengthwise) on the instrument corresponds to pitch, position on the Y-Axis (widthwise) corresponds to a timbre shift, and position on the Z-Axis (vertically) corresponds to a change in amplitude. The Continuum is capable of polyphonic performance, with up to 16 simultaneous voices.
Each recent revision has brought more features and sound diversity to the internal synthesizer in the Continuum Fingerboard. As such, the instrument can now be considered both a controller and a stand-alone instrument.
Built-in synthesizer
As of 2008, the Continuum Fingerboard has a new modular digital sy
|
https://en.wikipedia.org/wiki/NASA%20Advanced%20Supercomputing%20Division
|
The NASA Advanced Supercomputing (NAS) Division is located at NASA Ames Research Center, Moffett Field in the heart of Silicon Valley in Mountain View, California. It has been the major supercomputing and modeling and simulation resource for NASA missions in aerodynamics, space exploration, studies in weather patterns and ocean currents, and space shuttle and aircraft design and development for almost forty years.
The facility currently houses the petascale Pleiades, Aitken, and Electra supercomputers, as well as the terascale Endeavour supercomputer. The systems are based on SGI and HPE architecture with Intel processors. The main building also houses disk and archival tape storage systems with a capacity of over an exabyte of data, the hyperwall visualization system, and one of the largest InfiniBand network fabrics in the world. The NAS Division is part of NASA's Exploration Technology Directorate and operates NASA's High-End Computing Capability (HECC) Project.
History
Founding
In the mid-1970s, a group of aerospace engineers at Ames Research Center began to look into transferring aerospace research and development from costly and time-consuming wind tunnel testing to simulation-based design and engineering using computational fluid dynamics (CFD) models on supercomputers more powerful than those commercially available at the time. This endeavor was later named the Numerical Aerodynamic Simulator (NAS) Project and the first computer was installed at the Central Computing Facility at Ames Research Center in 1984.
Groundbreaking on a state-of-the-art supercomputing facility took place on March 14, 1985 in order to construct a building where CFD experts, computer scientists, visualization specialists, and network and storage engineers could be under one roof in a collaborative environment. In 1986, NAS transitioned into a full-fledged NASA division and in 1987, NAS staff and equipment, including a second supercomputer, a Cray-2 named Navier, were relocated to the new facility, which was dedicated on March 9, 1987.
In 1995, NAS changed its name to the Numerical Aerospace Simulation Division, and in 2001 to the name it has today.
Industry Leading Innovations
NAS has been one of the leading innovators in the supercomputing world, developing many tools and processes that became widely used in commercial supercomputing. Some of these firsts include:
Installed Cray's first UNIX-based supercomputer
Implemented a client/server model linking the supercomputers and workstations together to distribute computation and visualization
Developed and implemented a high-speed wide area network (WAN) connecting supercomputing resources to remote users (AEROnet)
Co-developed NASA's first method for dynamic distribution of production loads across supercomputing resources in geographically distant locations (NASA Metacenter)
Implemented TCP/IP networking in a supercomputing environment
Developed a batch-queuing system for supercomputers (NQS)
Developed a
|
https://en.wikipedia.org/wiki/British%20Rail%20Class%20465
|
The British Rail Class 465 Networker is a class of 147 electric multiple units built by Metro-Cammell, British Rail Engineering Limited (BREL) and ABB Rail between 1991 and 1994. Originally operated by Network South East, these units are now run by Southeastern.
Background
The Network SouthEast sector of British Rail began the planning for the development of the Class 465 Networker in 1988, and invited a tender for 710 of the units to be built. The Class 465 was introduced in order to replace the 41-year-old Class 415 (4EPB) slam-door EMUs.
The first was delivered in December 1991 and the last in April 1995. The units entered passenger service from 1 December 1992 with a ceremony at Cannon Street station, by Transport Secretary John MacGregor. As part of the privatisation of British Rail, the 97 465/0s and 465/1s were sold to Eversholt Rail Group and the 50 Class 465/2s to Angel Trains.
All trains were originally supplied in Network SouthEast livery and branded "Kent Link Networker". They are mostly used on suburban routes out of London Victoria, Charing Cross, Blackfriars and Cannon Street to destinations in South London and Kent and the first 20 Class 465/0s were repainted into Connex South Eastern Yellow and Blue livery in 1998 the same livery as seen on the 16 Class 365s introduced in June 1997.
Some are scheduled to be replaced by Class 707s, with two hauled to Worksop for store by Harry Needle Railroad Company in June 2021.
Two manufacturers
Due to the size of the original order, British Rail approached two separate manufacturers to supply the new rolling stock. The first two sub-classes (designated 465/0 and 465/1) were built by BREL/ABB while the third sub-class (465/2) as well as the two-car (466) units were built by Metro-Cammell. Although built to the same specification and utilised interchangeably, there are subtle differences between the two fleets and they do not share common parts. The maximum speed of a Class 465 is and they are designed only for 750 V DC third rail operation. A Solid State Traction Converter package controls three-phase AC traction motors, which allows for rheostatic or regenerative dynamic braking. Primary braking system is electro-pneumatically actuated disc brakes, which is blended with the Dynamic brakes. Tachometers on every axle of the unit provide for Wheel Slip/Slide Protection.
Traction equipment replacement
Plans were drawn up in 2007 to improve reliability of the BREL and ABB units (Class 465/0 and 465/1) by the installation of new traction equipment. The new package was developed by Hitachi Rail. It was retrofitted across all 97 465/0 and 465/1s trains over the course of 2009/2010. Brush Traction, the supplier/manufacturer of the original traction equipment, worked as consultants to assist in retro-fitting the new equipment.
Refurbishment
In 2005, the first 34 465/2 units (465201-465234) were given an extensive refurbishment at Doncaster Works. This included new interior panelling, new floor
|
https://en.wikipedia.org/wiki/Adin%20Falkoff
|
Adin D. Falkoff (19 December 1921
– 13 August 2010) was an engineer and computer systems and programming systems designer who was mostly known for his work on the programming language APL and systems for IBM.
Career
Falkoff, born in New Jersey, received a Bachelor of Engineering (B.Ch.E.) from the City College of New York in 1941, and a Master's degree (M.A.) in Mathematics from Yale University in 1963.
He was a researcher and manager at IBM Research since 1955 for over forty years before retiring. He collaborated with Ken Iverson from 1960 to 1980 on the design, development, and use of the APL programming language and interactive environment.
Of special note is his landmark article, A Formal Description of System/360, describing the then new IBM System/360 computer system, formally, in APL programming notation.
Falkoff was a visiting member of the faculty of IBM's Systems Research Institute, and taught computer science at Yale University. He was one of the researchers who established and managed the IBM Philadelphia Scientific Center and received many awards for his work, especially with APL.
Representative publications
Adin D. Falkoff, "Algorithms for Parallel-Search Memories". Journal of the ACM 9:4:488-511 (1962)
Adin D. Falkoff, Kenneth E. Iverson, Edward H. Sussenguth Jr., "A Formal Description of System/360". IBM Systems Journal 3:3:198-262 (1964)
Falkoff, A.D., and K.E. Iverson, APL\360 User’s Manual, IBM Corporation, August 1968. full text in PDF
Falkoff, A.D., and K.E. Iverson, "The Design of APL", IBM Journal of Research and Development 17:4, July 1973. full text in PDF
Falkoff, A.D., and K.E. Iverson, "The Evolution of APL", ACM SIGPLAN Notices 13:8, August 1978. full text in PDF
Falkoff, A.D., and K.E. Iverson, A Source Book In APL, APL Press, 1981
Falkoff, A.D., "The IBM Family of APL Systems", IBM Systems Journal 30:4, December 1991. full text in PDF
Notes
IBM employees
APL implementers
City College of New York alumni
Yale University alumni
1921 births
Engineers from New Jersey
2010 deaths
People from Pleasantville, New York
|
https://en.wikipedia.org/wiki/Partial-redundancy%20elimination
|
In compiler theory, partial redundancy elimination (PRE) is a compiler optimization that eliminates expressions that are redundant on some but not necessarily all paths through a program. PRE is a form of common subexpression elimination.
An expression is called partially redundant if the value computed by the expression is already available on some but not all paths through a program to that expression. An expression is fully redundant if the value computed by the expression is available on all paths through the program to that expression. PRE can eliminate partially redundant expressions by inserting the partially redundant expression on the paths that do not already compute it, thereby making the partially redundant expression fully redundant.
For instance, in the following code:
if (some_condition) {
// some code that does not alter x
y = x + 4;
}
else {
// other code that does not alter x
}
z = x + 4;
the expression x+4 assigned to z is partially redundant because it is computed twice if some_condition is true. PRE would perform code motion on the expression to yield the following optimized code:
if (some_condition) {
// some code that does not alter x
t = x + 4;
y = t;
}
else {
// other code that does not alter x
t = x + 4;
}
z = t;
An interesting property of PRE is that it performs (a form of) common subexpression elimination and loop-invariant code motion at the same time. In addition, PRE can be extended to eliminate injured partial redundancies, thereby effectively performing strength reduction. This makes PRE one of the most important optimizations in optimizing compilers. Traditionally, PRE is applied to lexically equivalent expressions, but recently formulations of PRE based on static single assignment form have been published that apply the PRE algorithm to values instead of expressions, unifying PRE and global value numbering.
See also
Value numbering
Redundant code
Dead code elimination
References
Further reading
Muchnick, Steven S. Advanced Compiler Design and Implementation. Morgan Kaufmann. 1997.
Knoop, J., Ruthing, O., and Steffen, B. Lazy Code Motion. ACM SIGPLAN Notices Vol. 27, Num. 7, Jul. 1992, '92 Conference on PLDI.
Paleri, V. K., Srikant, Y. N., and Shankar, P. A Simple Algorithm for Partial Redundancy Elimination. SIGPLAN Notices, Vol. 33(12). pages 35–43 (1998).
Kennedy, R., Chan, S., Liu, S.M., Lo, R., Peng, T., and Chow, F. Partial Redundancy Elimination in SSA Form. ACM Transactions on Programming Languages Vol. 21, Num. 3, pp. 627–676, 1999.
VanDrunen, T., and Hosking, A.L. Value-Based Partial Redundancy Elimination, Lecture Notes in Computer Science Vol. 2985/2004, pp. 167 – 184, 2004.
Cai, Q. and Xue, J. Optimal and Efficient Speculation-Based Partial Redundancy Elimination". International Symposium on Code Generation and Optimization (CGO'03), 91-104, 2003.
Xue, J. and Knoop, J. A Fresh Look at PRE as a Maximum Flow Problem. International Conference on C
|
https://en.wikipedia.org/wiki/The%20Virtual%20Community
|
The Virtual Community is a 1993 book about virtual communities by Howard Rheingold, a member of the early network system The WELL. A second edition, with a new concluding chapter, was published in 2000 by MIT Press.
The book's discussion ranges from Rheingold's adventures on The WELL, computer-mediated communication and social groups and information science. Technologies cited include Usenet, MUDs (multi-user dungeons) and their derivatives MUSHes and MOOs, Internet Relay Chat (IRC), chat rooms, and electronic mailing lists. Rheingold also points out the potential benefits for personal psychological well-being, as well as for society at large, of belonging to a virtual community.
External links
The Virtual Community (Text of book on the author's site)
Sociology books
Books about the Internet
|
https://en.wikipedia.org/wiki/The%20Itchy%20%26%20Scratchy%20%26%20Poochie%20Show
|
"The Itchy & Scratchy & Poochie Show" is the fourteenth episode of the eighth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on February 9, 1997. In the episode, The Itchy & Scratchy Show attempts to regain lost viewers by introducing a new character named Poochie, voiced by Homer. The episode is largely self-referential and satirizes the world of television production, fans of The Simpsons, and the series itself. It was written by David X. Cohen and directed by Steven Dean Moore. Alex Rocco is a credited guest voice as Roger Meyers, Jr. for the third and final time (having previously provided the character's voice in "Itchy & Scratchy & Marge" and "The Day the Violence Died"); Phil Hartman also guest stars as Troy McClure. Poochie would become a minor recurring character and Comic Book Guy's catchphrase, "Worst episode ever", is introduced in this episode.
With this episode, the show's 167th episode, The Simpsons surpassed The Flintstones in the number of episodes produced for a prime-time animated series, which had 166 episodes.
Plot
Krusty the Clown threatens to stop broadcasting The Itchy & Scratchy Show because the cartoon causes his ratings to nosedive during that segment of his show. Cartoon producer Roger Meyers convenes a focus group to discover why The Itchy & Scratchy Show has lost its appeal. In the focus group, Lisa explains that the characters have lost their impact on audiences after being on the air for so long.
Meyers decides that the cartoon needs a new character: Poochie, a dog with an "attitude" who surfs, raps, and plays electric guitar. At Bart and Lisa's suggestion, Homer auditions for Poochie's voice and gets the part. To promote Poochie, he and voice actor June Bellamy (the voice of Itchy and Scratchy) make several publicity stops, where they encounter the show's hardcore fans. Homer invites his friends and relatives to watch the first Itchy & Scratchy & Poochie Show. However, the cartoon is full of asinine antics, with none of the show's trademark violence. Unimpressed by the manic Poochie character, Homer's friends say little as they leave.
Meyers decides to kill off Poochie, but Homer resolves to save him. In the next recording session, Homer goes off-script and implores the audience to give Poochie a chance. The show's production team appears moved by Homer's plea. However, when the episode airs, Meyers has dubbed over Homer's voice, Poochie gets clumsily removed from the short, and a handwritten intertitle explains, "Poochie died on the way back to his home planet." The studio audience cheers as Krusty displays an affidavit swearing Poochie will never return. Homer feels betrayed but attributes the affair to the fickle nature of show business. The network then runs classic Itchy & Scratchy; Bart and Lisa laugh before deciding to watch something else.
Production
"The Itchy & Scratchy & Poochie Show" was written by David X. Cohen and dire
|
https://en.wikipedia.org/wiki/PopCultured
|
PopCultured is a Canadian television talk show, which aired on The Comedy Network in 2005 and 2006. The program featured stand-up comedian Elvira Kurt and other cast members (Jean Paul, Laurie Elliott, David Reale, Ellen McKinney, Jamillah Ross and Levi MacDougall) poking fun at celebrities in the context of a mock newscast similar to The Daily Show with Jon Stewart, with one interview guest at the centre of each episode.
The show began airing in April 2005.
The show was widely panned by critics, and was canceled after one season, in early 2006, due to poor ratings.
References
External links
2005 Canadian television series debuts
2006 Canadian television series endings
CTV Comedy Channel original programming
2000s Canadian comedy television series
2000s Canadian television talk shows
|
https://en.wikipedia.org/wiki/TRADIC
|
The TRADIC (for TRAnsistor DIgital Computer or TRansistorized Airborne DIgital Computer) was the first transistorized computer in the USA, completed in 1954.
The computer was built by Jean Howard Felker of Bell Labs for the United States Air Force while L.C. Brown ("Charlie Brown") was a lead engineer on the project, which started in 1951. The project initially examined the feasibility of constructing a transistorized airborne digital computer. A second application was a transistorized digital computer to be used in a Navy track-while-scan shipboard radar system. Several models were completed: TRADIC Phase One computer, Flyable TRADIC, Leprechaun (using germanium alloy junction transistors in 1956) and XMH-3 TRADIC. TRADIC Phase One was developed to explore the feasibility, in the laboratory, of using transistors in a digital computer that could be used to solve aircraft bombing and navigation problems. Flyable TRADIC was used to establish the feasibility of using an airborne solid-state computer as the control element of a bombing and navigation system. Leprechaun was a second-generation laboratory research transistor digital computer designed to explore direct-coupled transistor logic (DCTL). The TRADIC Phase One computer was completed in January 1954.
The TRADIC Phase One computer has been claimed to be the world's first fully transistorized computer, ahead of the Mailüfterl in Austria or the Harwell CADET in the UK, which were each completed in 1955. In the UK, the Manchester University Transistor Computer demonstrated a working prototype in 1953 which incorporated transistors before TRADIC was operational, although that was not a fully transistorized computer because it used vacuum tubes to generate the clock signal. The 30 watts of power for the 1 MHz clock in the TRADIC was also supplied by a vacuum tube supply because no transistors were available that could supply that much power at that frequency. If the TRADIC can be called fully transistorized while incorporating vacuum tubes, then the Manchester University Transistor Computer should also be, in which case that is the first transistorized computer and not the TRADIC. If neither can be called fully transistorized, then the CADET was the first fully transistorized computer in February 1955.
Flyable TRADIC also incorporated a single high-power output vacuum-tube amplifier to supply clock power to the system. The designers originally devised a system clock using a crystal-controlled transistor oscillator driving a multitude of transistor amplifiers because each transistor was too low-powered, but since the phase shift of the amplifiers could not be controlled to the required tolerances this had to be abandoned. So by the same criterion of incorporating vacuum tubes the flyable TRADIC was either not a fully transistorized computer, or followed the Manchester University Transistor Computer in 1953. In contrast, the operating requirements for the Flyable TRADIC included performing across
|
https://en.wikipedia.org/wiki/Synchronous%20programming%20language
|
A synchronous programming language is a computer programming language optimized for programming reactive systems. Computer systems can be sorted in three main classes: (1) transformational systems that take some inputs, process them, deliver their outputs, and terminate their execution; a typical example is a compiler; (2) interactive systems that interact continuously with their environment, at their own speed; a typical example is the web; and (3) reactive systems that interact continuously with their environment, at a speed imposed by the environment; a typical example is the automatic flight control system of modern airplanes. Reactive systems must therefore react to stimuli from the environment within strict time bounds. For this reason they are often also called real-time systems, and are found often in embedded systems.
Synchronous programming (also synchronous reactive programming or SRP) is a computer programming paradigm supported by synchronous programming languages. The principle of SRP is to make the same abstraction for programming languages as the synchronous abstraction in digital circuits. Synchronous circuits are indeed designed at a high-level of abstraction where the timing characteristics of the electronic transistors are neglected. Each gate of the circuit (or, and, ...) is therefore assumed to compute its result instantaneously, each wire is assumed to transmit its signal instantaneously. A synchronous circuit is clocked and at each tick of its clock, it computes instantaneously its output values and the new values of its memory cells (latches) from its input values and the current values of its memory cells. In other words, the circuit behaves as if the electrons were flowing infinitely fast. The first synchronous programming languages were invented in France in the 1980s: Esterel, Lustre, and SIGNAL. Since then, many other synchronous languages have emerged.
The synchronous abstraction makes reasoning about time in a synchronous program a lot easier, thanks to the notion of logical ticks: a synchronous program reacts to its environment in a sequence of ticks, and computations within a tick are assumed to be instantaneous, i.e., as if the processor executing them were infinitely fast. The statement "a||b" is therefore abstracted as the package "ab" where "a" and "b" are simultaneous. To take a concrete example, the Esterel statement "every 60 second emit minute" specifies that the signal "minute" is exactly synchronous with the 60-th occurrence of the signal "second". At a more fundamental level, the synchronous abstraction eliminates the non-determinism resulting from the interleaving of concurrent behaviors. This allows deterministic semantics, therefore making synchronous programs amenable to formal analysis, verification and certified code generation, and usable as formal specification formalisms.
In contrast, in the asynchronous model of computation, on a sequential processor, the statement "a||b" can be either imp
|
https://en.wikipedia.org/wiki/Zig
|
Zig may refer to:
Ziz or Zig, a giant griffin-like bird in Jewish mythology
Zığ, Baku, Azerbaijan
Zig, Iran, a village in Razavi Khorasan Province, Iran
Zig (programming language), a general-purpose programming language designed for robustness, optimality, and maintainability
Zoster-immune globulin
Zig (album), 2023 studio album by Poppy
People
Glenn Danzig, American musician
One half of Australian comedy duo Zig and Zag (Australian performers)
Zig Ziglar, American self-help author and speaker
Pen name of Eliza Archard Conner
In fiction
The space ship from the video game Zero Wing
One half of the puppet comedy duo Zig and Zag (puppets)
One of the main characters from the French comic strip Zig et Puce
One of the main characters from the French animated series Zig & Sharko
Zigs (film), a 2001 gambling film directed by Mars Callahan
See also
Zigzag (disambiguation)
ja:ジグ#zig
|
https://en.wikipedia.org/wiki/Lempel%E2%80%93Ziv%E2%80%93Storer%E2%80%93Szymanski
|
Lempel–Ziv–Storer–Szymanski (LZSS) is a lossless data compression algorithm, a derivative of LZ77, that was created in 1982 by James A. Storer and Thomas Szymanski. LZSS was described in article "Data compression via textual substitution" published in Journal of the ACM (1982, pp. 928–951).
LZSS is a dictionary coding technique. It attempts to replace a string of symbols with a reference to a dictionary location of the same string.
The main difference between LZ77 and LZSS is that in LZ77 the dictionary reference could actually be longer than the string it was replacing. In LZSS, such references are omitted if the length is less than the "break even" point. Furthermore, LZSS uses one-bit flags to indicate whether the next chunk of data is a literal (byte) or a reference to an offset/length pair.
Example
Here is the beginning of Dr. Seuss's Green Eggs and Ham, with character numbers at the beginning of lines for convenience. Green Eggs and Ham is a good example to illustrate LZSS compression because the book itself only contains 50 unique words, despite having a word count of 170. Thus, words are repeated, however not in succession.
0: I am Sam
9:
10: Sam I am
19:
20: That Sam-I-am!
35: That Sam-I-am!
50: I do not like
64: that Sam-I-am!
79:
80: Do you like green eggs and ham?
112:
113: I do not like them, Sam-I-am.
143: I do not like green eggs and ham.
This text takes 177 bytes in uncompressed form. Assuming a break even point of 2 bytes (and thus 2 byte pointer/offset pairs), and one byte newlines, this text compressed with LZSS becomes 95 bytes long:
0: I am Sam
9:
10: (5,3) (0,4)
16:
17: That(4,4)-I-am!(19,15)
32: I do not like
46: t(21,14)
50: Do you(58,5) green eggs and ham?
79: (49,14) them,(24,9).(112,15)(92,18).
Note: this does not include the 12 bytes of flags indicating whether the next chunk of text is a pointer or a literal. Adding it, the text becomes 107 bytes long, which is still shorter than the original 177 bytes.
Implementations
Many popular archivers like PKZip, ARJ, RAR, ZOO, LHarc use LZSS rather than LZ77 as the primary compression algorithm; the encoding of literal characters and of length-distance pairs varies, with the most common option being Huffman coding. Most implementations stem from a public domain 1989 code by Haruhiko Okumura. Version 4 of the Allegro library can encode and decode an LZSS format, but the feature was cut from version 5. The Game Boy Advance BIOS can decode a slightly modified LZSS format. Apple's Mac OS X uses LZSS as one of the compression methods for kernel code.
See also
LZ77
Lempel–Ziv–Welch (LZW)
References
Lossless compression algorithms
|
https://en.wikipedia.org/wiki/Atruvera%20Aviation
|
CJSC "Atruvera Aviation" ( was a cargo airline based in Saint Petersburg, Russia. It was established in 1993 and operated domestic and international cargo charters.
Code data
ICAO Code: AUV
Callsign: Atruvera
Fleet
The Atruvera Aviation fleet consists of the following aircraft (at January 2005):
1 Ilyushin Il-76MD
2 Ilyushin Il-76TD
Defunct airlines of Russia
Airlines established in 1993
Airlines disestablished in 2006
Companies based in Saint Petersburg
|
https://en.wikipedia.org/wiki/Disney%27s%20One%20Too
|
Disney's One Too (later known as Disney's Animation Weekdays) was an American two-hour Sunday-to-Friday children's programming block that aired on UPN (and sometimes in syndication) from September 6, 1999 to August 31, 2003. A spin-off of the Disney's One Saturday Morning block on ABC (which is owned by The Walt Disney Company), it featured animated series from Disney Television Animation aimed at children between the ages of 6 and 11.
History
Beginning deal with UPN
In January 1998, UPN began discussions with The Walt Disney Company (owner of rival network ABC) to have the company program a daily two-hour children's block for the network, airing on weekdays (during the morning or afternoon hours) and Sunday mornings. Attempts to reach a time-lease agreement deal with Disney were called off one week after negotiations started due to a dispute between Disney and UPN over how the block would be branded and the amount of E/I programming that Disney would provide for the block; UPN then entered into discussions with then-corporate sister Nickelodeon (both networks were owned by Viacom) to produce a new block. That February, UPN entered into an agreement with Saban Entertainment (then a subsidiary of Fox Family Worldwide, which Disney later acquired in 2001) – which distributed two series recently aired on the UPN Kids block around that time, Sweet Valley High and Breaker High – to program the Sunday-to-Friday block.
In March 1998, UPN resumed discussions with Disney and the following month, The Walt Disney Company and UPN came to an agreement to provide Disney-produced programs on the network on weekdays (from 7:00am - 9:00am or 3:00pm – 5:00pm) and Sunday (from 9:00am – 11:00am). The block was originally announced under the working title "Whomptastic", though the name was changed before the launch of the block for greater brand identity (incidentally, "whomp" was used as a pejorative term in the Disney-produced animated series Recess, one of the series that would end up part of the new block, as a substitute for "sucks").
The new lineup was later renamed Disney's One Too in July 1999, formatted to serve as a competitor block to ABC's existing children's block Disney's One Saturday Morning. The block premiered on September 6, 1999, replacing UPN Kids, which ended its run the day before (on September 5) after four years. Compared to the format of One Saturday Morning, One Too varied in that, instead of incorporating hosted segments, short segment gags from the series featured in the block (such as Sabrina: The Animated Series, Doug and Recess, all of which – alongside a few other series – were originally aired on One Saturday Morning) were actually shown, often preceding the start of each program, and after commercial breaks. The block also featured an alternate opening sequence, using more futuristic buildings and a theme similar to that used on One Saturday Morning. Many series previously aired on One Too continued in reruns on two Disney-brand
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.