source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Sunday%20Night%20Sex%20Show | The Sunday Night Sex Show was a live call-in Canadian television show hosted by Sue Johanson, which ran from 1996 to 2005. It aired on the W Network and was one of their most popular programs. Every week, callers would line up on the phone to talk to Johanson, about various topics from how to spice up one's sex life, to advice on how to select the right sex toy, to how to deal with various relationship issues.
For many years, reruns of the television show ran on the Oxygen Network in the United States, but American viewers were frustrated that they couldn't call in during the live airing in Canada. Eventually, a US version of the show, titled Talk Sex with Sue Johanson, was created.
Reasons for the Canadian cancellation were never given by either Johanson or the W Network. The US show ended with the May 11, 2008, episode. Johanson was very emotional at the conclusion of the show and joined on stage by her supporting cast.
Johanson hosted a similar phone-in show with the same name on Toronto radio station Q107 from 1984 to 1998, which was syndicated across Canada in later years, as well as a television phone-in show, Sex with Sue, on Rogers Cable's community channel in Toronto from 1985 to 1995.
References
External links
1990s Canadian television talk shows
Canadian talk radio programs
Oxygen (TV channel) original programming
2000s Canadian television talk shows
Sex education television series
1996 Canadian television series debuts
2008 Canadian television series endings
W Network original programming
Syndicated Canadian radio programs
1980s Canadian radio programs
1990s Canadian radio programs |
https://en.wikipedia.org/wiki/Mathematical%20Tables%20Project | The Mathematical Tables Project was one of the largest and most sophisticated computing organizations that operated prior to the invention of the digital electronic computer. Begun in the United States in 1938 as a project of the Works Progress Administration (WPA), it employed 450 unemployed clerks to tabulate higher mathematical functions, such as exponential functions, logarithms, and trigonometric functions. These tables were eventually published in a 28-volume set by Columbia University Press.
History
The group was led by a group of mathematicians and physicists, most of whom had been unable to find professional work during the Great Depression. The mathematical leader was Gertrude Blanch, who had just finished her doctorate in mathematics at Cornell University. She had been unable to find a university position and was working at a photographic company before joining the project.
The administrative director was Arnold Lowan, who had a degree in physics from Columbia University and had spent a year at the Institute for Advanced Study in Princeton University before returning to New York without a job. Perhaps the most accomplished mathematician to be associated with the group was Cornelius Lanczos, who had once served as an assistant to Albert Einstein. He spent a year with the project and organized seminars on computation and applied mathematics at the project's office in Lower Manhattan.
In addition to computing tables of mathematical functions, the project did large computations for sciences, including the physicist Hans Bethe, and did calculations for a variety of war projects, including tables for the LORAN navigation system, tables for microwave radar, bombing tables, and shock wave propagation tables.
The Mathematical Tables Project survived the termination of the WPA in 1943 and continued to operate in New York until 1948. At that point, roughly 25 members of the group moved to Washington, D.C., to become the Computation Laboratory of the National Bureau of Standards, now the National Institute of Standards and Technology. Blanch moved to Los Angeles to lead the computing office of the Institute for Numerical Analysis at UCLA and Arnold Lowan joined the faculty of Yeshiva University in New York. The greatest legacy of the project is the Handbook of Mathematical Functions, which was published 16 years after the group disbanded. Edited by two veterans of the project, Milton Abramowitz and Irene Stegun, it became a widely circulated mathematical and scientific reference.
References
External links
Gertrude Blanch Papers
The Human Computer and the Birth of the Information Age
History of mathematics
Mathematical tables
Works Progress Administration |
https://en.wikipedia.org/wiki/Electronics%20cartridge | Electronics cartridge may refer to:
ROM cartridge, a removable enclosure containing read-only memory devices designed to be connected to a computer or games console
RAM pack, a RAM expansion cartridge
Data cartridge (tape), magnetic tape in a plastic enclosure
Tape cartridge, for use in tape drives
See also
Cartridge (disambiguation) |
https://en.wikipedia.org/wiki/MAPI | Messaging Application Programming Interface (MAPI) is an API for Microsoft Windows which allows programs to become email-aware. While MAPI is designed to be independent of the protocol, it is usually used to communicate with Microsoft Exchange Server.
Details
MAPI uses functions loosely based on the X.400 XAPIA standard. It includes facilities to access message transports, message stores, and directories.
While Simple MAPI (SMAPI) is a subset of 12 functions which enable developers to add basic messaging functionality, Extended MAPI (EMAPI) allows complete control over the messaging system on the client computer. This includes creation and management of messages, plus management of the client mailbox, and service providers.
Simple MAPI is included with Microsoft Windows as part of Outlook Express/Windows Mail while the full Extended MAPI is included with Microsoft Outlook and Exchange.
In addition to the Extended MAPI client interface, programming calls can be made indirectly through the Simple MAPI API client interface, through the Common Messaging Calls (CMC) API client interface, or by the object-based CDO Library interface. These three methods are easier to use and designed for less complex messaging-enabled and -aware applications. (Simple MAPI and CMC were removed from Exchange 2003.)
MAPI was originally designed by Microsoft. The company founded its MS Mail team in 1987, but it was not until it acquired Consumers Software in 1991 to obtain Network Courier that it had a messaging product. Reworked, it was sold as MS PC Mail (or Microsoft Mail for PC Networking). The basic API to MS PC Mail was later known as MAPI version 0 (or MAPI0), to differentiate it from "true" MAPI.
Service provider interface
The full Extended MAPI interface is required for interfacing messaging-based services to client applications such as Outlook. For example, several non-Microsoft e-mail server product vendors created "MAPI service providers" to allow their products to be accessed via Outlook. Notable examples include Axigen Mail Server, Kerio Connect, Scalix, Zimbra, HP OpenMail, IBM Lotus Notes, Zarafa/Kopano, and Bynari.
MAPI also had a service provider interface of sorts. Microsoft used this to interface MS Mail to an email system based on Xenix, for internal use.
Extended MAPI is the main e-mail data access method used by Outlook, to interface to Microsoft Exchange, via MAPI service providers shipped with Outlook.
MAPI/RPC protocol details
Microsoft has released full details of the MAPI/RPC protocol since August 2007.
"MAPI protocol" is a colloquial name for the MAPI/RPC. At times, Microsoft has also called it "Exchange RPC" and "Outlook-Exchange Transport Protocol".
Microsoft provides a sample MAPI/RPC-based application called MFCMAPI to assist developers. It is also widely used as a diagnostics tool by both developers and Microsoft Exchange administrators.
MAPI over HTTP
The original implementation was designed for use on a local networ |
https://en.wikipedia.org/wiki/JIS%20encoding | In computing, JIS encoding refers to several Japanese Industrial Standards for encoding the Japanese language. Strictly speaking, the term means either:
A set of standard coded character sets for Japanese, notably:
JIS X 0201, the Japanese version of ISO 646 (ASCII) containing the base 7-bit ASCII characters (with some modifications) and 64 half-width katakana characters.
JIS X 0208, the most common kanji character set containing 6,879 characters, including 6,355 kanji and 524 other characters (one 94 by 94 plane)
JIS X 0212, a supplement for JIS X 0208 which adds 5,801 kanji, totaling 12,156 kanji (a second 94 by 94 plane)
JIS X 0213, which extends JIS X 0208 (two planes)
JIS X 0202 (also known as ISO-2022-JP), a set of encoding mechanisms for sending JIS character data over transmission mediums that only support 7-bit data.
In practice, "JIS encoding" usually refers to JIS X 0208 character data encoded with JIS X 0202. For instance, the IANA uses the JIS_Encoding label to refer to JIS X 0202, and the ISO-2022-JP label to refer to the profile thereof defined by .
Other encoding mechanisms for JIS characters include the Shift JIS encoding and EUC-JP. Shift JIS adds the kanji, full-width hiragana and full-width katakana from JIS X 0208 to JIS X 0201 in a backward compatible way. Shift JIS is perhaps the most widely used encoding in Japan, as the compatibility with the single-byte JIS X 0201 character set made it possible for electronic equipment manufacturers (such as cash register manufacturers) to offer an upgrade from older cheaper equipment that was not capable of displaying kanji to newer equipment while retaining character-set compatibility.
EUC-JP is used on UNIX systems, where the JIS encodings are incompatible with POSIX standards.
A more recent alternative to JIS coded characters is Unicode (UCS coded characters), particularly in the UTF-8 encoding mechanism.
Encoding comparison
The following table compares the features of the three main encoding schemes for JIS X 0208.
See also
Japanese language and computers
References
Character sets
Standards of Japan |
https://en.wikipedia.org/wiki/Automatic%20Packet%20Reporting%20System | Automatic Packet Reporting System (APRS) is an amateur radio-based system for real time digital communications of information of immediate value in the local area. Data can include object Global Positioning System (GPS) coordinates, weather station telemetry, text messages, announcements, queries, and other telemetry. APRS data can be displayed on a map, which can show stations, objects, tracks of moving objects, weather stations, search and rescue data, and direction finding data.
APRS data is typically transmitted on a single shared frequency (depending on country) to be repeated locally by area relay stations (digipeaters) for widespread local consumption. In addition, all such data are typically ingested into the APRS Internet System (APRS-IS) via an Internet-connected receiver (IGate) and distributed globally for ubiquitous and immediate access. Data shared via radio or Internet are collected by all users and can be combined with external map data to build a shared live view.
APRS was developed from the late 1980s forward by Bob Bruninga, call sign WB4APR, a senior research engineer at the United States Naval Academy. He maintained the main APRS Web site until his death in 2022. The initialism "APRS" was derived from his call sign.
History
Bob Bruninga, a senior research engineer at the United States Naval Academy, implemented the earliest ancestor of APRS on an Apple II computer in 1982. This early version was used to map high frequency Navy position reports. The first use of APRS was in 1984, when Bruninga developed a more advanced version on a VIC-20 for reporting the position and status of horses in a endurance run.
During the next two years, Bruninga continued to develop the system, which he then called the Connectionless Emergency Traffic System (CETS). Following a series of Federal Emergency Management Agency (FEMA) exercises using CETS, the system was ported to the IBM Personal Computer. During the early 1990s, CETS (then known as the Automatic Position Reporting System) continued to evolve into its current form.
As GPS technology became more widely available, "Position" was replaced with "Packet" to better describe the more generic capabilities of the system and to emphasize its uses beyond mere position reporting.
Bruninga has also stated that APRS was not meant to be a vehicle position tracking system, and can be interpreted rather as “Automatic Presence Reporting System”.
Network overview
APRS (Automatic Packet Reporting System), is a digital communications protocol for exchanging information among a large number of stations covering a large (local) area, often referred to as "IP-ers". As a multi-user data network, it is quite different from conventional packet radio. Rather than using connected data streams where stations connect to each other and packets are acknowledged and retransmitted if lost, APRS operates entirely in an unconnected broadcast fashion, using unnumbered AX.25 frames.
APRS packets are transmitted |
https://en.wikipedia.org/wiki/Ted%20Allen | Edward Reese Allen (born May 20, 1965) is an American author and television personality. He was the food and wine connoisseur on the Bravo network's television program Queer Eye, and has been the host of the TV cooking competition series Chopped since its launch in 2009, as well as Chopped Junior, which began in mid-2015. On April 13, 2014, he became the host of another Food Network show, originally called America's Best Cook; a retooled version of that show, retitled All-Star Academy, debuted on March 1, 2015. In early 2015, he also hosted a four-part special, Best. Ever. which scoured America for its best burgers, pizza, breakfast, and barbecue. He is a longtime contributing writer to Esquire magazine and is the author of two cookbooks, and regularly appears on the Food Network show Beat Bobby Flay and other television cooking shows.
Early life and education
Allen graduated from Carmel High School in Carmel, Indiana in 1983 and was inducted into the school's Alumni Hall of Fame in 2011. He received a degree in psychology from Purdue University in 1987. Subsequently, he enrolled in Purdue's Krannert Graduate School of Management but left to accept a job as a copy editor at the Lafayette, Indiana, Journal & Courier.
He later returned to graduate school, earning an MA in journalism from the Science and Environmental Reporting Program at New York University. He then moved to Chicago, where he worked as a reporter for Lerner Newspapers, a chain of community weekly newspapers.
Career
Allen got his start in restaurant criticism there as one-quarter of a bi-weekly group-review team called "The Famished Four," along with Barry Rice, then the chain's entertainment editor (and now Allen's husband), who initiated the concept with Lerner food editor Leah A. Zeldes.
Allen then became a freelancer for Chicago magazine, eventually signing on as a senior editor and often writing about food, wine, and luminaries of the culinary world. He joined Esquire in 1997 as a contributing editor, where he wrote features, food pieces, and profiles and co-authored the magazine's popular "Things a Man Should Know" series. Allen wrote for Esquire for more than a decade and was nominated for a National Magazine Award for his 2007 story "This Man Survived Breast Cancer." He also has written for GQ, Bon Appétit, Food & Wine, and Epicurious.
Television
Allen gained great visibility in 2003 when he became a cast member of the television makeover series Queer Eye for the Straight Guy, serving as its food and wine specialist. He continued to make television appearances as a gourmet, including as a frequent guest judge on Food Network's Iron Chef America. Allen hosted a six-part documentary, Uncorked: Wine Made Simple, on PBS starting May 7, 2007. Beginning June 13, 2007, Allen appeared as a regular judge on seasons 3 and 4 of Bravo's reality television program Top Chef, following several guest judge appearances during the previous two seasons. In 2008, he left Bravo when Food N |
https://en.wikipedia.org/wiki/Jai%20Rodriguez | Jai Rodriguez is an American actor and musician best known as the culture guide on the Bravo network's Emmy-winning American reality television program Queer Eye for the Straight Guy. He also co-wrote a book with the other Queer Eye hosts. Rodriguez starred as Geoffrey in the sitcom Malibu Country from 2012 to 2013.
Personal life
Rodriguez is of Puerto Rican and Italian descent, He performed with gospel choirs from the age of eleven, and studied musical theater at the Boces Cultural Art Center in Syosset, New York (now called Long Island High School for the Arts). He also attended Smithtown Christian School and Smithtown High School (now Smithtown West), where he performed in various plays. He is openly gay.
Career
Acting
Rodriguez is a stage actor and singer best known for his roles in the Toronto cast of Broadway stage musical Rent, as Angel, and the Off-Broadway musical Zanna, Don't!, as Zanna. He has acted in several plays, including Spinning into Butter at the Lincoln Center. In 2005, he created and performed his stage show Jai Rodriguez: xPosed. xPosed told the story of Rodriguez's life and struggle to come out to his religious family as well as his career on stage and in Queer Eye. His Queer Eye co-stars Ted Allen and Carson Kressley appeared as themselves.
In November 1993, at age 14, Rodriguez appeared in one episode of the daytime drama All My Children. In August 2005, he made a two-day guest appearance on the daytime drama One Life to Live.
In November 2005, while Queer Eye was on filming hiatus, he joined the cast of The Producers on Broadway for three months, playing the role of Carmen Ghia. He played a different role, that of Sabu, in the 2005 Producers movie.
In August 2007, Rodriguez filmed a guest-starring role in drama series Nip/Tuck, playing the character of Chaz Darling. The episode (also titled "Chaz Darling") aired in November 2007.
In March 2010, Rodriguez appeared as a newscaster in the music video for "Telephone", with Lady Gaga and Beyoncé.
In February 2011, Rodriguez appeared in an episode of the ABC series Detroit 1-8-7 titled "Legacy; Drag City", playing a drag queen.
In March 2011, Rodriguez made an appearance in an episode of NBC's Harry's Law, titled "Send in the Clowns", as a transgender woman fired after an affair with a club owner was exposed.
In November 2011, Rodriguez appeared in an episode of How I Met Your Mother titled "The Rebound Girl", playing the husband of Barney Stinson's brother. He appeared again in March 2014 in the episode "Gary Blauman".
Rodriguez regularly guest performs in Cookin' with Gas , a long-running all improv show, at The Groundlings Theatre in Los Angeles.
In April 2012, he appeared in an episode of Bones as a murdering hairdresser.
On Malibu Country, Rodriguez was a regular cast member, playing record industry executive, Geoffrey.
In November 2014, Rodriguez appeared as Diego Diaz in Kingdom as a physical therapist.
From August 2014, Rodriguez appeared as "Ritchie Va |
https://en.wikipedia.org/wiki/Here%27s%20Humphrey | Here's Humphrey was an Australian children's television series produced by Banksia Productions for the Nine Network, which first aired on 24 May 1965 and last went to air in 2009.
It features an anthropomorphic brown bear character (a person in a costume) known as Humphrey B. Bear, and was produced in Adelaide, South Australia. In September 2013, community station, West TV, began airing repeats of Here's Humphrey in Perth. The character still exists, owned by Ozpix Entertainment as of 2020.
Here's Humphrey became one of the most successful programs for preschoolers in Australia, was sold internationally, and is one of the longest-running children's television programs in the world. The program received multiple Logie Television Awards.
Format
The series features anthropomorphic brown bear character known as Humphrey B. Bear, who is mute. Set in a magical forest, Humphrey is paired with a human presenter, who narrates their adventures. The series takes place in Humphrey's tree house, where he partakes in magical adventures.
One of the central ideas presented in the show is the importance of taking part and not always being successful at everything.
Cast
Presenters
Humphrey B. Bear
Several performers portrayed the role of Humphrey.
Edwin Duryea (1965)
Ross Hutchinson
John Maclean
Tom Fairlie
Tony Balzan (1985–2008)
Production
Here's Humphrey was originally aired exclusively in Adelaide on NWS-9, premiering on 24 May 1965, before airing nationally two years later. Filmed in Adelaide and produced by Banskia Productions, the character of Humphrey was initially known as "Bear Bear" until he was renamed as a result of a competition. The program was created as a result of Humphrey's previous popularity on the afternoon program The Channel Niners.Here's Humphrey was granted a P classification, deeming it specifically designed to meet the needs and interests of pre-schoolers and allowing it to be broadcast on the Nine Network with a 30-minute runtime commercial-free. Classification deals allowed the Nine Network to repeat each episode three times.
The Nine Network almost cancelled the series in 2000, which led to protests and comments from the Prime Minister. The network responded to popular public demand and allowed its continuation. The series was commissioned for 180 new episodes in May 2000. New episodes aired until 2003.
In February 2007, Nine commissioned a new series of Here's Humphrey, filming episodes for the first time since 2003. This followed negotiations with the network, after speculation they would not renew the series approaching the end of its contract. The episodes started airing in December 2007 and concluded in 2009 when Banksia Entertainment was wound up.
In September 2019, it was revealed OZPIX were planning to revive Here's Humphrey with a pitch to broadcasters at MIPCOM in France. The production company expressed interest in integrating live action characters with virtual technology. The production team for the proj |
https://en.wikipedia.org/wiki/Tokyo%20subway | Two operate in Tokyo: Tokyo Metro and the Toei Subway. Most of the network is located in the 23 special wards, with portions extending into Chiba and Saitama Prefectures. The subways are one part of Greater Tokyo's passenger rail network, with through service further connecting the subway to suburban railways in Western Tokyo and Kanagawa Prefecture.
Networks
There are two primary subway operators in Tokyo:
Tokyo Metro – Formerly a statutory corporation called the Teito Rapid Transit Authority (TRTA), it was converted into a kabushiki gaisha (joint-stock company) in 2004. It currently operates 180 stations on nine lines and of route.
Toei Subway – run by the Tokyo Metropolitan Bureau of Transportation, an agency of the Tokyo Metropolitan Government. It operates 106 stations on four lines and of route.
, the combined subway network of the Tokyo and Toei metros comprises 286 stations and 13 lines covering a total system length of . The Tokyo Metro and Toei networks together carry a combined average of over eight million passengers daily. Despite being ranked second overall in worldwide subway usage (after the Shanghai Metro) as of 2019, subways make up a relatively small fraction of heavy rail rapid transit in Tokyo alone—only 286 out of 938 railway stations, as of 2020. The Tokyo subway at 8.7 million daily passengers only represents 22% of Tokyo's 40 million daily rail passengers (see Transport in Greater Tokyo). Other urban commuter rail systems include Keikyu Corporation (formerly the Keihin Electric Express Railway), Keio Corporation, Keisei Electric Railway, Odakyu Electric Railway, Seibu Railway, Tobu Railway and Tokyu Corporation.
In addition, but not formally designated as subways:
The Tokyo Waterfront Area Rapid Transit (TWR) operates a single mostly-underground line with eight stations, and 200,200 daily passengers in 2010.
The Saitama Rapid Railway Line, which is essentially an extension of the Tokyo Metro Namboku Line, operates a single mostly-underground line with eight stations.
The Tōyō Rapid Railway Line, which is essentially an extension of the Tokyo Metro Tōzai Line, operates a single underground/elevated line with nine stations.
The Yamanote Line and Chūō Line (Rapid) are not subway lines, but a surface commuter loop line (Yamanote Line) and a cross-city line that operate with metro-like frequencies. They are owned by JR East, act as key transportation arteries in central Tokyo, and are often marked on Tokyo subway maps.
The Yokohama Subway and the Minatomirai Line also operate in the Greater Tokyo Area, but they are not directly connected to the Tokyo subway network. However, direct through services from the Tokyo Metro Fukutoshin Line regularly run into Yokohama's Minatomirai Line via the Tōkyū Tōyoko Line.
History
1915: Japan's first underground railway opened under Tokyo Station. It was only for the railway post office, not for passengers.
1927: opened Japan's first underground line of the subway Ginza Li |
https://en.wikipedia.org/wiki/Missing%20%28Canadian%20TV%20series%29 | Missing (originally titled 1-800-Missing) is a Canadian crime drama television series based on the 1-800-WHERE-R-YOU book series by Meg Cabot. The series aired on the A network and W Network in Canada, and on Lifetime in the United States from August 2003 to February 2006.
Synopsis
The series is centred on Jess Mastriani, played by Caterina Scorsone, a woman in her twenties who receives psychic abilities after being hit by lightning. She is employed by a special FBI Task Force because she has visions which, once interpreted, contain clues that will help her find missing people. The series initially starred Gloria Reuben as Brooke Haslett, Jess's skeptical partner. Other stars of the series during its first season included Justina Machado as Sunny Estrada, and Dean McDermott as Alan Coyle. Alberta Watson appeared in the pilot as Jess' mother, however; the part was later recast and Watson did not appear on the show again.
In the second season, significant changes, including casting, were made. The show was completely retooled. Jess's partner was changed to Nicole Scott, portrayed by Vivica A. Fox. Taking Sunny's place was Mark Consuelos, and Justin Louis assumed the role of the Assistant Director John Pollock. Jess's psychic powers remained important, but more focus was given to the other characters.
The series finale aired on February 5, 2006 alongside the show's partner Strong Medicine and, in April 2006, it was revealed that Missing had been cancelled after a successful three-year, fifty-six-episode run. Lifetime said the show had "run its course."
Cast
Gloria Reuben as FBI Agent Brooke Haslett (season 1)
Caterina Scorsone as FBI Agent Jess Mastriani
Dean McDermott as FBI Special Agent in Charge Alan Coyle (season 1)
Adam MacDonald as Douglas (main: season 1; guest: season 2)
Alberta Watson/Maria Ricossa as Toni Mastriani (guest: seasons 1–2)
Justina Machado as FBI Agent Sunny Estrada (season 1)
Vivica A. Fox as FBI Agent Nicole Scott (seasons 2–3)
Mark Consuelos as FBI Agent Antonio Cortez (seasons 2–3)
Justin Louis as Assistant Director John Pollock (seasons 2–3)
Episodes
Season 1 (2003–04)
Season 2 (2004–05)
Season 3 (2005–06)
Home media
The only DVD release to date has been the show's second season (titled as Missing: Season 2) as a four disc set from Lions Gate Home Entertainment on January 24, 2006.
Footnotes
References
External links
Missing at Mylifetime.com
Missing scripts by Lee Goldberg & William Rabkin
2003 Canadian television series debuts
2006 Canadian television series endings
2000s Canadian crime drama television series
A-Channel original programming
CTV 2 original programming
Lifetime (TV network) original programming
Television series about the Federal Bureau of Investigation
Missing Canadian
Television series by Bell Media
Television series by Lionsgate Television
Television series by Sony Pictures Television
Television shows about precognition
Television shows based on American novels
Television s |
https://en.wikipedia.org/wiki/Jazz%20%28disambiguation%29 | Jazz is a style of music and its subgenres.
Jazz may also refer to:
Computing
Jazz (computer), a development platform used by Microsoft
Jazz (mobile network operator), a mobile network operator in Pakistan
IBM Jazz, a team collaboration platform
Lotus Jazz, a spreadsheet program for Macintosh
Literature
Jazz (magazine) or Jazz & Pop, a 1962–1972 magazine
Jazz (manga), a Japanese comic book
Jazz (novel), a 1992 novel by Toni Morrison
Jazz (Henri Matisse), a book collecting pochoir prints based on cut-outs by Henri Matisse
Jazz (picture book), a 2006 children's book by Walter Dean Myers, illustrated by Christopher Myers
Jazz Magazine, a French magazine about jazz, founded 1954
Music
Jazz, Ltd., a Dixieland jazz band, nightclub, and record label in Chicago
Jazz (singer), member of Black Buddafly
Jazz (Ry Cooder album) (1978)
Jazz (John Handy album) (1962)
Jazz (Queen album) (1978)
Jazz (Wallace Roney album) (2007)
Jazz (Tenacious D EP) (2012)
Jazz (Casey Abrams album), (2019)
"Jazz (We've Got)", a song by A Tribe Called Quest from The Low End Theory
Sports
Jazz (wrestler) or Carlene Begnaud (born 1973), professional wrestler
Utah Jazz, NBA basketball team in Salt Lake City, Utah
FC Jazz, a Finnish association football team
Other uses
Jazz (airline), an airline in Canada
Jazz (apple)
Jazz (design), a design introduced on disposable cups in 1992
Jazz (Kanso series), a 1979 series of paintings by Nabil Kanso
Jazz (Italian EMU), Italian Electric multiple units (EMU) used for commuter regional trains
Jazz (perfume), a fragrance by Yves Saint Laurent
Jazz (soft drink), a soda product from Pepsi-Cola
Jazz (TV series), a 2001 documentary produced by Ken Burns for PBS
Jazz (Transformers), a robot superhero character
Jazz (word), etymology and usage
Honda Jazz or Honda Fit, a hatchback
Pro-Design Jazz, an Austrian paraglider design
People with the name
Jazz Carlin (born 1990), Welsh competitive swimmer
Jazz Cartier (born 1993), Canadian rapper
Jazz Chisholm Jr. (born 1998), Bahamian baseball player
Jazz Gillum (1904–1966), American blues harmonica player
Jazz Guignard (active 1930s), Haitian jazz musician
Jazz Hamilton (born 1965), Puerto Rican saxophonist
Jazz Janewattananond (born 1995), Thai professional golfer
Jazz Jennings (born 2000), American LGBTQ rights activist
Jazz Ocampo (born 1997), Filipina actress and model
Jazz Raycole (born 1988), American actress and dancer
Jazz Richards (born 1991), Welsh footballer
Jazz Summers (1944–2015), British music manager
Jazz Tevaga (born 1995), New Zealand rugby league player
Fictional
Jazz Curtis, a character from Home and Away
Jazz Fenton, an animated character from Nickelodeon's Danny Phantom
See also
Jahss, Boxer's fracture
Jazz dance
Larry "Jazz" Anthony (born 1977), American R&B singer |
https://en.wikipedia.org/wiki/Smart%20weapon | Smart weapon may refer to:
Smart munition, or precision-guided munition
Smart gun, a conceptual firearm that can detect its user
Smart bullet, a bullet that can turn, change speed, or send data
Smart bomb, also known as guided bomb, a bomb that can precisely target a location
Smart mine, a next-generation land mine that can self-destruct or self-deactivate at the end of a conflict |
https://en.wikipedia.org/wiki/People%20%26%20Planet | People & Planet is a network of student campaign groups in the UK. It is "the largest student campaigning organisation in the country campaigning to alleviate world poverty, defend human rights and protect the environment."
Organisation
People & Planet is Britain's largest student network campaigning on global poverty, human rights, and the environment. The network has over 2,000 active members at 50 universities and 79 schools and colleges across the UK.
People & Planet groups are autonomous and there is no formal membership system. The organisation is overseen by a Board of Trustees, the majority of whom are student members elected by the network. The support office, based in Oxford, provides training, outreach and resources to support groups and campaigns.
People & Planet is funded primarily by grants from trusts and foundations. People & Planet has a Fundraising and Activist Network allowing members to make regular monthly donations that provide invaluable unrestricted income to support the organisation's work.
History
The organisation was founded in 1969 as Third World First by a group of students at Oxford University, supported by NGOs including Oxfam. In 1997, the network voted to change the name to People & Planet.
Third World First was instrumental in setting up the magazine, The Internationalist which was later reincarnated as the now popular activist-magazine, The New Internationalist.
Campaigns
People & Planet's current campaign areas are climate action and the rights of migrants.
Migrants' rights
In 2015, People & Planet students democratically decided to introduce a migrants' rights campaign at annual summer camp Power Shift: Training for Change. Staff worked with students to develop the Undoing Borders campaign, launched in 2016.
Climate change
Currently, People & Planet are running a "Fossil Free Careers" campaign calling on UK universities careers' services to "end recruitment pipelines into the oil, gas and mining industries." As of June 2023, 4 universities had committed to Fossil Free Careers: Wrexham Glyndwr University, The University of Bedfordshire, University of the Arts London and Bishops Grosseteste University. 15 Students' Unions have also agreed to boycott oil and gas recruitment events.
In 2013, the People & Planet network launched a new campaign targeting the fossil fuel industry, and in particular the role of fossil fuels. Working in partnership with 350.org, the Fossil Free UK campaign aims to sever the links between the fossil fuel industry and UK universities. These links include investments and endowments, academic research, sponsorship and partnership arrangements.
In 2017, People & Planet introduced a new climate campaign targeting high-street banks over their financing of fossil fuels. Divest Barclays took particular aim at Barclays due to its status as the worst bank in Europe for providing finance to fossil fuel projects and companies. Students campaigned for universities and students' uni |
https://en.wikipedia.org/wiki/WSTR | WSTR may refer to:
WSTR (band), British pop punk band
WSTR (FM) ("Star 94"), a radio station (94.1 FM) licensed to Smyrna, Georgia, United States
WSTR-TV, MyNetworkTV's affiliate television station (channel 18, virtual 64) licensed to Cincinnati, Ohio, United States |
https://en.wikipedia.org/wiki/Yggdrasil%20Linux/GNU/X | Yggdrasil Linux/GNU/X, or LGX (pronounced igg-drah-sill), is an early Linux distribution developed by Yggdrasil Computing, Incorporated, a company founded by Adam J. Richter in Berkeley, California.
Yggdrasil was the first company to create a live CD Linux distribution. Yggdrasil Linux described itself as a "Plug-and-Play" Linux distribution, automatically configuring itself for the hardware.
Yggdrasil is the World Tree of Norse mythology. The name was chosen because Yggdrasil took disparate pieces of software and assembled them into a complete product. Yggdrasil's company motto was "Free Software For The Rest of Us".
Yggdrasil is compliant with the Unix Filesystem Hierarchy Standard.
History and releases
Yggdrasil announced their ‘bootable Linux/GNU/X-based UNIX(R) clone for PC compatibles’ on 25 November 1992 and made the first release on 8 December 1992.
This alpha release contained the 0.98.1 version of the Linux kernel, the v11r5 version of the X Window System supporting up to 1024x768 with 256 colours, various GNU utilities such as their C/C++ compiler, the GNU Debugger, bison, flex, and make, TeX, groff, Ghostscript, the elvis and Emacs editors, and various other software. Yggdrasil's alpha release required a 386 computer with 8 MB RAM and 100 MB hard disk. The alpha release was missing some of the source code of some of the packages, such as elvis.
A beta release was made on 18 February 1993. The beta's cost was US$60. LGX's beta release in 1993 contained the 0.99.5 version of the Linux kernel, along with other software from GNU and X. By 22 August 1993, the Yggdrasil company had sold over 3100 copies of the LGX beta distribution.
The production release version carried a pricetag of US$99. However, Yggdrasil was offered for free to any developer whose software was included with the CD distribution. According to an email from the company's founder the marginal cost of each subscription was $35.70.
Early Yggdrasil releases were also available from stores selling CD-ROM software.
A community effort in continuing the development of Yggdrasil was started in early 2022, with plans for alpha release in early 2022. This doesn't appear to have eventuated as of October 2023.
Yggdrasil Computing, Incorporated
Adam J. Richter started the Yggdrasil company together with Bill Selmeier. Richter spoke to Michael Tiemann about setting up a business, but was not interested in joining forces with Cygnus.
Richter was a member of League for Programming Freedom. Richter was using only a 200 MB hard disk when building the alpha release of LGX, which prevented him from practically being able to include the source code of some of the packages contained in the CDROM.
Yggdrasil Incorporated published some of the early Linux compilation books, such as The Linux Bible: The GNU Testament (), and contributed significantly to file system and X Window System functionality of Linux in the early days of their operation.
The company moved to San Jose, Califor |
https://en.wikipedia.org/wiki/Cirque%20Corporation | Cirque Corporation is an American company which developed and commercialized the first successful capacitive touchpad, now widely used in notebook computers. Cirque develops and sells a variety of touch input products, both in original equipment manufacturer and end-user retail form. Cirque was founded in 1991 by George E. Gerpheide, PhD, and James L. O'Callaghan, to commercialize the GlidePoint technology invented in the 1980s by Gerpheide.
History
For many years, Gerpheide and O'Callaghan traveled in an attempt to convince makers of notebook computer to agree to use GlidePoint. Gerpheide recalls "We would often drive to the COMDEX trade show in Las Vegas and stay in a seedy hotel. There wasn't money for a booth at the show, so we carried our GlidePoint prototypes around the convention center making demonstrations to whoever was willing to watch. The early prototypes had a suitcase full of electronic circuits. I knew they could be shrunk into an integrated circuit, but we didn't have money for that either. So we were seeking a large leap of faith for a manufacturer to agree to use the technology. It was even worse because at that time most notebook computers were running DOS, which did not need a pointing device!"
In April 1994, Cirque adapted GlidePoint into an integrated circuit and began selling a retail GlidePoint touchpad. The first notebook computer containing GlidePoint appeared soon thereafter. GlidePoint technology was licensed to Alps Electric Co., Ltd., and Alps launched touchpad products into the market.
In 2003, Cirque was acquired by Alps Electric as a wholly owned subsidiary. Cirque continues to function as an independent research and technology development facility.
Technology
GlidePoint
GlidePoint was the first touchpad technology to be adopted in notebook computers as a system pointing device, that is, performing the same function as a mouse. Before that, system pointing was performed mostly using a small trackball embedded in the notebook computer case, and other mechanical devices. After GlidePoint's commercial introduction in April 1994, its popularity in notebook computers steadily increased and Synaptics and Logitech also introduced capacitive touchpad technologies. , both Synaptics and GlidePoint touchpads are used widely, with approximately 90% of notebook computers using touchpads.
GlidePoint was not the first touch input technology. For example, it was pre-dated by resistive membrane input pads such as used in the Model 3155 Keyboard from Keytronic. Transparent resistive membrane technology is used in personal digital assistants such as the PalmPilot, point of sale terminals, video poker machines, and information kiosks and other touch screens. There are also prior capacitive touch input pads in the patent literature. One, "The UnMouse" was invented by James Logan and marketed by his company Microtouch Systems, Inc. as a retail plug-in mouse alternative product in the 1980s, but discontinued after a few |
https://en.wikipedia.org/wiki/Sixth%20generation%20of%20video%20game%20consoles | In the history of video games, the sixth generation era (in rare occasions called the 128-bit era; see "bits and system power" below) is the era of computer and video games, video game consoles, and handheld gaming devices available at the turn of the 21st century, starting on November 27, 1998. Platforms in the sixth generation include consoles from four companies: the Sega Dreamcast (DC), Sony PlayStation 2 (PS2), Nintendo GameCube (GC), and Microsoft Xbox. This era began on November 27, 1998, with the Japanese release of the Dreamcast, which was joined by the PlayStation 2 on March 4, 2000, the GameCube on September 14, 2001 and the Xbox on November 15, 2001, respectively. In March 31, 2001, the Dreamcast was among the first to be discontinued. Xbox in 2006, GameCube in 2007 and PlayStation 2 was the last, in January 2013. Meanwhile, the seventh generation of consoles started on November 22, 2005, with the launch of the Xbox 360.
The major innovation of this generation was of full utilization of the internet to allow a fully online gaming experience. While the prior generation had some systems with internet connectivity, such as the Apple Pippin, these had little market penetration and thus had limited success in the area. Services such as Microsoft's Xbox Live became industry standard in this, and future, generations. Other innovations of the Xbox was its being the first system with an internal ethernet port and the first to utilize an internal hard disk drive to store game data. This led to many improvements to the gaming experience, including the ability to store program data (rather than just save game data) that allowed for faster load times, as well as the ability to download games directly from the internet rather than to purchase physical media such as a disk or cartridge. Soon after its release other systems, like the Sony PlayStation 2, produced peripheral storage devices to allow similar capabilities, and by the next generation internal storage became industry standard.
Bit ratings (i.e. "64-bit" or "32-bit" for the previous generation) for most consoles largely fell by the wayside during this era, with the notable exceptions being promotions for the Dreamcast and PS2 that advertised "128-bit graphics" at the start of the generation. The number of "bits" cited in this way in console names refers to the CPU word size, and had been used by hardware marketing departments as a "show of power" for many years. However, there is little to be gained from increasing the word size much beyond 32 or 64 bits because, once this level is reached, performance depends on more varied factors, such as processor clock speed, bandwidth, and memory size.
The sixth generation of handhelds began with the release of the Bandai's WonderSwan, launched in Japan in 1999. Nintendo maintained its dominant share of the handheld market with the release in 2001 of the Game Boy Advance, which featured many upgrades and new features over the Game Boy. The Game B |
https://en.wikipedia.org/wiki/HIDS | HIDS may refer to:
Host-based intrusion detection system, in computing
Hyper-IgD syndrome, in medicine
See also
HID (disambiguation) |
https://en.wikipedia.org/wiki/Mark%20Spencer%20%28computer%20engineer%29 | Mark Spencer (born April 8, 1977) is an American computer engineer and is the original author of the GTK+-based instant messaging client Gaim (which has since been renamed to Pidgin), the L2TP daemon l2tpd and the Cheops Network User Interface.
Mark Spencer is also the creator of Asterisk, a Linux-based open-sourced PBX. He is the founder, chairman and CTO of Digium, an open-source telecommunications supplier most notable for its development and sponsorship of Asterisk. Spencer shifted from CEO to chairman and CTO in early 2007.
Early life
Spencer was born and raised in Auburn, Alabama. He attended Auburn University where both his parents were professors. In high school, he was mentored by another Auburn professor, Thaddeus Roppel, and Mark Smith, co-founder of Adtran.
Career
While attending Auburn University, Spencer co-oped at Adtran when he wrote l2tpd. He went on to start a Linux technical support business. Spencer did not have enough money to buy a PBX (private branch exchange) for his company so he decided to write Asterisk and later founded Digium.
As a pilot, Mark founded Avilution, LLC. to create Android apps including QuickWeather and AviationMaps. AviationMaps was later spun out to FlightPro, then DroidEFB. Adapting a similar strategy as Asterisk, he developed the eXtensible Flight System, XFS, a cross-platform avionics architecture. XFS has already been integrated in the Zenith CH750 STOL aircraft in the form of both a three-screen panel and the "Unpanel," a portrait-orientation (also landscape) screen to replace the entire traditional glass cockpit.
References
External links
Mark Spencer's previous homepage (copies at the Internet Archive)
Interview with Mark Spencer at OSDir.com
at CNet
Linux Link Tech Show interview (audio), 2005
Global open source enthusiasts interview Mark Spencer December 2009
News story regarding changing roles at Digium
1977 births
Living people
People from Huntsville, Alabama
Free software programmers
Auburn High School (Alabama) alumni
Auburn University alumni
Asterisk (PBX) |
https://en.wikipedia.org/wiki/Shuto%20Expressway | is a network of toll expressways in the Greater Tokyo Area of Japan. It is operated and maintained by the .
Most routes are grade-separated (elevated roads or tunnels) and central routes have many sharp curves and multi-lane merges that require caution to drive safely. The speed limit is 60 km/h on most routes, but 80 km/h on the Bayshore Route, and 50 km/h on the Inner Circular Route.
All trips on the expressway require a toll be paid. As of 2014, the cash toll for a standard-size car is ¥1300 regardless of distance traveled. Vehicles using the ETC toll-collection system pay a distance-based toll ranging from ¥300 to ¥1300 for ordinary vehicles (see toll price) – in some cases substantially less than the previous fixed-rate toll. Lower cash rates exist for certain radial routes (where there are only a few kilometers of expressway remaining) and ETC users have various time-of-day discounts. For large vehicles, the toll is doubled.
Routes
There are 24 routes currently in operation:
Circular (loop) routes
C1 Inner Circular Route
C2 Central Circular Route — loop incorporating the Yamate Tunnel.
Y Yaesu Route — via Tokyo Expressway
Bayshore route
B Bayshore Route (Higashi-Kanto-Expressway – ) Chidori-cho – Sachiura / Namiki ( – Yokohama–Yokosuka Expressway)
Radial routes
No. 1 Ueno Route Edobashi JCT – Iriya
No. 1 Haneda Route Hamazakibashi JCT – Haneda ( – Route K1)
No. 2 Meguro Route Ichinohashi JCT – Togoshi
No. 3 Shibuya Route Tanimachi JCT – Yoga ( – the Tomei Expressway)
No. 4 Shinjuku Route Miyakezaka JCT – Takaido ( – the Chuo Expressway)
No. 5 Ikebukuro Route Takebashi JCT – Bijogi JCT ( – Route S5)
No. 6 Mukojima Route Edobashi JCT – Horikiri JCT ( – Route C2)
No. 6 Misato Route Kosuge JCT – Misato JCT ( – Tokyo Gaikan Expressway)
No. 7 Komatsugawa Route Ryogoku JCT – Ichinoe ( – Keiyo Road)
No. 9 Fukagawa Route Hakozaki JCT – Tatsumi JCT ( – Bayshore Route)
No. 10 Harumi Route Ariake JCT – Harumi
No. 11 Daiba Route Shibaura JCT – Ariake JCT (Tokyo Rainbow Bridge)
S1 Kawaguchi Route (Route C2 – ) Kohoku JCT – Kawaguchi JCT ( – Tokyo Gaikan Expressway)
Kanagawa routes
K1 Yokohane Route (Route 1 – ) Haneda - Ishikawa-cho JCT ( – Route K3)
K2 Mitsuzawa Route Kinko JCT – Mitsuzawa ( – Yokohama Shindo Road and Daisan Keihin Road)
K3 Kariba Route Honmoku JCT – Kariba ( – Yokohama Shindo Road and Yokohama-Yokosuka Expressway)
K5 Daikoku Route (Route K1 – ) Namamugi JCT - Daikoku JCT ( – Bayshore Route)
K6 Kawasaki Route Tonomachi – Kawasaki-Ukishima JCT ( – Bayshore Route and Tokyo Bay Aqua Line)
K7 Yokohama North Route (Route K1 and Route K5 – ) Namamugi JCT - Yokohama Kōhoku JCT ( – Daisan Keihin Road and Route K7)
K7 Yokohama Northwest Route (Route K7 and Daisan Keihin Road – ) Yokohama Kōhoku JCT – Yokohama-Aoba JCT ( – Tōmei Expressway)
Saitama routes
S2 Saitama Shintoshin Route (Route S5) Yono – Saitama-Minuma
S5 Ōmiya Route (Route 5 – ) Bijogi JCT – Yono ( – Route S2)
History
The Metropolitan Expressway was first built between K |
https://en.wikipedia.org/wiki/Field%20%28computer%20science%29 | In computer science, data that has several parts, known as a record, can be divided into fields (data fields). Relational databases arrange data as sets of database records, so called rows. Each record consists of several fields; the fields of all records form the columns.
Examples of fields: name, gender, hair colour.
In object-oriented programming, a field (also called data member or member variable) is a particular piece of data encapsulated within a class or object. In the case of a regular field (also called instance variable), for each instance of the object there is an instance variable: for example, an Employee class has a Name field and there is one distinct name per employee. A static field (also called class variable) is one variable, which is shared by all instances. Fields are abstracted by properties, which allow them to be read and written as if they were fields, but these can be translated to getter and setter method calls.
Fixed length
Fields that contain a fixed number of bits are known as fixed length fields. A four byte field for example may contain a 31 bit binary integer plus a sign bit (32 bits in all). A 30 byte name field may contain a person's name typically padded with blanks at the end.
The disadvantage of using fixed length fields is that some part of the field may be wasted but space is still required for the maximum length case. Also, where fields are omitted, padding for the missing fields is still required to maintain fixed start positions within a record for instance.
Variable length
A variable length field is not always the same physical size.
Such fields are nearly always used for text fields that can be large, or fields that vary greatly
in length. For example, a bibliographical database like PubMed has many small fields such
as publication date and author name, but also has abstracts, which vary greatly in length.
Reserving a fixed-length field of some length would be inefficient because it would enforce a
maximum length on abstracts, and because space would be wasted in most records (particularly if many articles lacked abstracts entirely).
Database implementations commonly store varying-length fields in special ways, in order to
make all the records of a given type have a uniform small size. Doing so can help performance.
On the other hand, data in serialized forms such as stored in typical file systems,
transmitted across networks, and so on usually uses quite different performance strategies.
The choice depends on factors such as the total size of records, performance characteristics of the
storage medium, and the expected patterns of access.
Database implementations typically store variable length fields in ways such as
a sequence of characters or bytes, followed by an end-marker that is prohibited within the string itself. This makes it slower to access later fields in the same record because the later fields are not always at the same physical distance from the start of the record.
a pointer |
https://en.wikipedia.org/wiki/Tournament%20selection | Tournament selection is a method of selecting an individual from a population of individuals in a genetic algorithm. Tournament selection involves running several "tournaments" among a few individuals (or "chromosomes") chosen at random from the population. The winner of each tournament (the one with the best fitness) is selected for crossover. Selection pressure, a probabilistic measure of a chromosome's likelihood of participation in the tournament based on the participant selection pool size, is easily adjusted by changing the tournament size. The reason is that if the tournament size is larger, weak individuals have a smaller chance to be selected, because, if a weak individual is selected to be in a tournament, there is a higher probability that a stronger individual is also in that tournament.
The tournament selection method may be described in pseudo code:
choose k (the tournament size) individuals from the population at random
choose the best individual from the tournament with probability p
choose the second best individual with probability p*(1-p)
choose the third best individual with probability p*((1-p)^2)
and so on
Deterministic tournament selection selects the best individual (when p = 1) in any tournament. A 1-way tournament (k = 1) selection is equivalent to random selection. There are two variants of the selection: with and without replacement. The variant without replacement guarantees that when selecting N individuals from a population of N elements, each individual participates in exactly k tournaments. An algorithm is proposed in. Note that depending on the number of elements selected, selection without replacement does not guarantee that no individual is selected more than once. It just guarantees that each individual has an equal chance of participating in the same number of tournaments.
In comparison with the (stochastic) fitness proportionate selection method, tournament selection is often implemented in practice due to its lack of stochastic noise.
Tournament selection has several benefits over alternative selection methods for genetic algorithms (for example, fitness proportionate selection and reward-based selection): it is efficient to code, works on parallel architectures and allows the selection pressure to be easily adjusted. Tournament selection has also been shown to be independent of the scaling of the genetic algorithm fitness function (or 'objective function') in some classifier systems.
References
Genetic algorithms |
https://en.wikipedia.org/wiki/Postcode%20Address%20File | The Postcode Address File (PAF) is a database that contains all known "delivery points" and postcodes in the United Kingdom. The PAF is a collection of over 29 million Royal Mail postal addresses and 1.8 million postcodes. It is available in a variety of formats including FTP download and compact disc, and was previously available as digital audio tape. As owner of the PAF, Royal Mail is required by section 116 of the Postal Services Act 2000 to maintain the data and make it available on reasonable terms. A charge is made for lookup services or wholesale supply of PAF data. Charges are regulated by Ofcom. It includes small user residential, small user organisation and large user organisation details. There have been requests as part of the Open Data campaign for the PAF to be released by the government free of charge.
Usage
The "delivery points" held on the PAF are routing instructions used by Royal Mail staff to sort and deliver mail quickly and accurately. Elements of the address, including the post town and postcode, are occasionally subject to change, reflecting the operational structure of the postal delivery system. Each address is therefore not necessarily a geographically accurate description of where a property is located. Buildings which contain internal flats or businesses but have only one external front door will only have those internal elements recorded in PAF if the Royal Mail have direct access to them using a key or fob.
File structure
Royal Mail's Programmers Guide lists the following address elements of PAF and their respective maximum field lengths:
Some versions of the PAF also contain the 'Delivery Point Suffix (DPS)' used in CBC (Customer Bar Code). Alternatively the DPS can be found using Royal Mail's 'Postcode Information File (PIF)'.
Licensing
The PAF licence sets out what PAF can be used for. Licensing options include internal and external use and also more advanced options such as bureau services and broker groups.
An example of typical internal use is an employee of a licensed call centre who uses a PAF-based solution to look up and verify customer addresses. The PAF data is only being used within the licensed end-user and is not passed on to any other legal entity.
On the other hand, an example of external use would be a company which provides a PAF-based address look-up on their customer facing website for their own customers to use when they order goods or services.
Royal Mail provide licensing advice on their website.
Public sector licence
Public sector organisations can now use PAF under the public sector licence use terms. The current public sector licence was renewed in April 2023 and runs until 31 March 2028.
The 2023-2028 public sector licence covers England, Wales and Scotland, and was procured centrally by the Geospatial Commission so that usage is free at the point of use for delivery of vital public services by the UK government, devolved administrations, local authorities, emergency servi |
https://en.wikipedia.org/wiki/American%20Computer%20Science%20League | ACSL, or the American Computer Science League, is an international computer science competition among more than 300 schools. Originally founded in 1978 as the Rhode Island Computer Science League, it then became the New England Computer Science League. With countrywide and worldwide participants, it became the American Computer Science League. It has been in continuous existence since 1978.
Each yearly competition consists of four contests. All students at each school may compete but the team score is the sum of the best 3 or 5 top scores. Each contest consists of two parts: a written section (called "shorts") and a programming section. Written topics tested include "what does this program do?", digital electronics, Boolean algebra, computer numbering systems, recursive functions, data structures (primarily dealing with heaps, binary search trees, stacks, and queues), lisp programming, regular expressions and Finite State Automata, bit string flicking, graph theory, assembly programming and prefix/postfix/infix notation.
Divisions
There are five divisions in ACSL: Elementary, Classroom, Junior, Intermediate, and Senior. The Elementary Division is a non-programming competition for grades 3 - 6. It tests one topic per contest. The Classroom Division is a non-programming competition for all grades and consists of a 10 question test on 4 topics each contest. Junior Division is recommended for middle school students (no students above the ninth grade may compete in it). Intermediate and Senior Divisions are for secondary school students, Intermediate being easier and Senior being more difficult. At the All-Star Contest, the Junior teams consist of 5 members each while the Senior and Intermediate teams can consist of 3 or 5 members. Each team competes against other same-sized teams in its division.
Regular season
The Regular Season, in which individual students compete to get their school team qualified for the All-Star Contest, consists of four rounds. These rounds consist of a programming part and a written part. In the programming part, students have 72 hours to complete a program in any computer language to perform the given task. In the written part, students have a total of 30 minutes to answer 5 questions based on given topics. Students then receive a score of up to 10 points (5 for written and 5 for programming). For the Classroom Division, students receive 45 minutes to solve 10 written problems. For the Elementary Division, students have 30 minutes to solve 5 written problems. Prizes are awarded to top scoring teams and students based upon cumulative scores after the fourth contest.
Finals contest
The Finals Contest is held online on the Saturday of Memorial Day weekend each year. Top students are invited to participate in the contest. Students in the Junior, Intermediate, and Senior divisions start in the morning with a 3-hour block in which to solve 2 programming problems. All divisions have a one-hour quiz (20 multiple |
https://en.wikipedia.org/wiki/Zero-width%20non-joiner | The zero-width non-joiner (ZWNJ, ) is a non-printing character used in the computerization of writing systems that make use of ligatures. When placed between two characters that would otherwise be connected into a ligature, a ZWNJ causes them to be printed in their final and initial forms, respectively. This is also an effect of a space character, but a ZWNJ is used when it is desirable to keep the characters closer together or to connect a word with its morpheme.
The ZWNJ is encoded in Unicode as .
Use of ZWNJ and unit separator for correct typography
In certain languages, the ZWNJ is necessary for unambiguously specifying the correct typographic form of a character sequence.
The ASCII control code unit separator was formerly used.
The picture shows how the code looks when it is rendered correctly, and in every row the correct and incorrect pictures should be different. On a system which not configured to display the Unicode correctly, the correct display and the incorrect one may look the same, or either of them may be significantly different from the corresponding picture.
In this Biblical Hebrew example, the placement of the to the left of the is correct, which has a sign written as two vertical dots to denote short vowel. If a were placed to the left of , it would be erroneous. In Modern Hebrew, there is no reason to use the for spoken language, so it is rarely used in Modern Hebrew typesetting.
In German typography, ligatures may not cross the constituent boundaries within compounds. Thus, in the first German example, the prefix is separated from the rest of the word to prohibit the ligature fl. Similarly, in English, some argue ligatures should not cross morpheme boundaries. For example, in some words 'fly' and 'fish' are morphemes but in others they're not; therefore, by their reasoning, words like 'deafly' and 'selfish' (here shown with the non-joiner) should not have ligatures (respectively of fl and fi) while 'dayfly' and 'catfish' should have them.
Persian uses this character extensively for certain prefixes, suffixes and compound words. It is necessary for disambiguating compounds from non-compound words, which use a full space.
In the Jawi script of Malay, ZWNJ is used whenever more than one consonants are written at the end of any phrase (, Malay for 'science' or in Latin script, pronounced /ˈsa.ɪns/.) It is used to signify that there are no vowels (specifically 'a' or 'ə') in between the two consonant letters as would otherwise be pronounced either /ˈsa.ɪnas/ or /ˈsa.ɪnəs/. A space would separate the phrase into different words, where phrases such as would now mean 'to sign the Arabic letter sin' ( in Latin script.)
Use of ZWNJ to display alternative forms
In Indic scripts, insertion of a ZWNJ after a consonant either with a halant or before a dependent vowel prevents the characters from being joined properly:
In Devanagari, the characters and typically combine to form , but when a ZWNJ is inserted betwe |
https://en.wikipedia.org/wiki/Transparency%20%28graphic%29 | Transparency in computer graphics is possible in a number of file formats. The term "transparency" is used in various ways by different people, but at its simplest there is "full transparency" i.e. something that is completely invisible. Only part of a graphic should be fully transparent, or there would be nothing to see. More complex is "partial transparency" or "translucency" where the effect is achieved that a graphic is partially transparent in the same way as colored glass. Since ultimately a printed page or computer or television screen can only be one color at a point, partial transparency is always simulated at some level by mixing colors. There are many different ways to mix colors, so in some cases transparency is ambiguous.
In addition, transparency is often an "extra" for a graphics format, and some graphics programs will ignore the transparency.
Raster file formats that support transparency include GIF, PNG, BMP, TIFF, TGA and JPEG 2000, through either a transparent color or an alpha channel.
Most vector formats implicitly support transparency because they simply avoid putting any objects at a given point. This includes EPS and WMF. For vector graphics this may not strictly be seen as transparency, but it requires much of the same careful programming as transparency in raster formats.
More complex vector formats may allow transparency combinations between the elements within the graphic, as well as that above. This includes SVG and PDF.
A suitable raster graphics editor shows transparency by a special pattern, e.g. a checkerboard pattern.
Transparent pixels
One color entry in a single GIF or PNG image's palette can be defined as "transparent" rather than an actual color. This means that when the decoder encounters a pixel with this value, it is rendered in the background color of the part of the screen where the image is placed, also if this varies pixel-by-pixel as in the case of a background image.
Applications include:
an image that is not rectangular can be filled to the required rectangle using transparent surroundings; the image can even have holes (e.g. be ring-shaped)
in a run of text, a special symbol for which an image is used because it is not available in the character set, can be given a transparent background, resulting in a matching background.
The transparent color should be chosen carefully, to avoid items that just happen to be the same color vanishing.
Even this limited form of transparency has patchy implementation, though most popular web browsers are capable of displaying transparent GIF images. This support often does not extend to printing, especially to printing devices (such as PostScript) which do not include support for transparency in the device or driver. Outside the world of web browsers, support is fairly hit-or-miss for transparent GIF files.
Edge limitations of transparent pixels
The edges of characters and other images with transparent background should not have shades of gray: these |
https://en.wikipedia.org/wiki/Le%20Cordon%20Bleu | Le Cordon Bleu (; French for "The Blue Ribbon"; abbreviated LCB) is an international network of hospitality and culinary schools teaching French haute cuisine. Its educational focuses are hospitality management, culinary arts, and gastronomy. The institution consists of 35 institutes in 20 countries and has over 20,000 students of many nationalities.
History
The origin of the school name derives, indirectly, from the French Royal and Catholic Order of the Holy Spirit. This was a select group of the French Nobility that had been knighted. The first creation of Royal Knights at the French Court was performed in 1578. The French Order of the Holy Spirit was for many centuries the highest distinction of the French Kingdom. Each member was awarded the Cross of the Holy Spirit, which hung from a blue silk ribbon. According to one story, this group became known for its extravagant and luxurious banquets, known as "cordons bleus".
At the time of the French Revolution, the monarchy and the Order were abolished, but the name remained synonymous with excellent French cooking. By the nineteenth century the blue ribbon had become synonymous with excellence. The name was adopted by a French culinary magazine, La Cuisinière Cordon Bleu, founded by Marthe Distel in the late 19th century. The magazine began offering lessons by some of the best chefs in France.
The magazine developed into the original Le Cordon Bleu that Distel and Henri-Paul Pellaprat established in 1895 in Paris, France. In 1945, after the end of WWII, Madame Elisabeth Brassart purchased what remained of the struggling school from a Catholic orphanage which had inherited it after Distel died in the late 1930s. Brassart managed the school until 1984; at the age of 87 she retired and sold the school to André J. Cointreau, a direct descendant of the founding family of the Cointreau liqueur and Rémy Martin Cognac.
Other countries
In 1933, former student Dione Lucas helped to open a school under the Le Cordon Bleu name in London, England.
In the United States, 16 schools used to operate under the "Le Cordon Bleu North America" name through a licensing agreement with Career Education Corporation (CEC), a for-profit education company based in Chicago, Illinois. In 2009, the license was estimated to be worth $135 million. In 2014, Le Cordon Bleu North America generated $178.6 million in revenue and $70.6 million of operating losses. However, in light of the gainful employment rules implemented by the US Department of Education in 2015, CEC made the decision to sell the 16 campuses. When CEC failed to find a buyer it announced on 16 December 2015 that all 16 campuses in the United States would close by September 2017, giving enrolled students time to finish their programs.
The last new students were accepted in January 2016. In June 2016, the Securities and Exchange Commission requested documents and information regarding Career Education's fourth quarter 2014 classification of its Le Cordon Bleu |
https://en.wikipedia.org/wiki/Union%20type | In computer science, a union is a value that may have any of several representations or formats within the same position in memory; that consists of a variable that may hold such a data structure. Some programming languages support special data types, called union types, to describe such values and variables. In other words, a union type definition will specify which of a number of permitted primitive types may be stored in its instances, e.g., "float or long integer". In contrast with a record (or structure), which could be defined to contain both a float and an integer; in a union, there is only one value at any given time.
A union can be pictured as a chunk of memory that is used to store variables of different data types. Once a new value is assigned to a field, the existing data is overwritten with the new data. The memory area storing the value has no intrinsic type (other than just bytes or words of memory), but the value can be treated as one of several abstract data types, having the type of the value that was last written to the memory area.
In type theory, a union has a sum type; this corresponds to disjoint union in mathematics.
Depending on the language and type, a union value may be used in some operations, such as assignment and comparison for equality, without knowing its specific type. Other operations may require that knowledge, either by some external information, or by the use of a tagged union.
Untagged unions
Because of the limitations of their use, untagged unions are generally only provided in untyped languages or in a type-unsafe way (as in C). They have the advantage over simple tagged unions of not requiring space to store a data type tag.
The name "union" stems from the type's formal definition. If a type is considered as the set of all values that that type can take on, a union type is simply the mathematical union of its constituting types, since it can take on any value any of its fields can. Also, because a mathematical union discards duplicates, if more than one field of the union can take on a single common value, it is impossible to tell from the value alone which field was last written.
However, one useful programming function of unions is to map smaller data elements to larger ones for easier manipulation. A data structure consisting, for example, of 4 bytes and a 32-bit integer, can form a union with an unsigned 64-bit integer, and thus be more readily accessed for purposes of comparison etc.
Unions in various programming languages
ALGOL 68
ALGOL 68 has tagged unions, and uses a case clause to distinguish and extract the constituent type at runtime. A union containing another union is treated as the set of all its constituent possibilities, and if the context requires it a union is automatically coerced into the wider union. A union can explicitly contain no value, which can be distinguished at runtime. An example is:
mode node = union (real, int, string, void);
node n := "abc";
case n |
https://en.wikipedia.org/wiki/Record%20%28computer%20science%29 | In computer science, a record (also called a structure, struct, or compound data) is a basic data structure. Records in a database or spreadsheet are usually called "rows".
A record is a collection of fields, possibly of different data types, typically in a fixed number and sequence. The fields of a record may also be called members, particularly in object-oriented programming; fields may also be called elements, though this risks confusion with the elements of a collection.
For example, a date could be stored as a record containing a numeric year field, a month field represented as a string, and a numeric day-of-month field. A personnel record might contain a name, a salary, and a rank. A Circle record might contain a center and a radius—in this instance, the center itself might be represented as a point record containing x and y coordinates.
Records are distinguished from arrays by the fact that their number of fields is determined in the definition of the record, and by the fact the records are a heterogenous data type; not all of the fields must contain the same type of data.
A record type is a data type that describes such values and variables. Most modern computer languages allow the programmer to define new record types. The definition includes specifying the data type of each field and an identifier (name or label) by which it can be accessed. In type theory, product types (with no field names) are generally preferred due to their simplicity, but proper record types are studied in languages such as System F-sub. Since type-theoretical records may contain first-class function-typed fields in addition to data, they can express many features of object-oriented programming.
Records can exist in any storage medium, including main memory and mass storage devices such as magnetic tapes or hard disks. Records are a fundamental component of most data structures, especially linked data structures. Many computer files are organized as arrays of logical records, often grouped into larger physical records or blocks for efficiency.
The parameters of a function or procedure can often be viewed as the fields of a record variable; and the arguments passed to that function can be viewed as a record value that gets assigned to that variable at the time of the call. Also, in the call stack that is often used to implement procedure calls, each entry is an activation record or call frame, containing the procedure parameters and local variables, the return address, and other internal fields.
An object in object-oriented language is essentially a record that contains procedures specialized to handle that record; and object types are an elaboration of record types. Indeed, in most object-oriented languages, records are just special cases of objects, and are known as plain old data structures (PODSs), to contrast with objects that use OO features.
A record can be viewed as the computer analog of a mathematical tuple, although a tuple may or may not be |
https://en.wikipedia.org/wiki/Michael%20Witbrock | Michael John Witbrock is a computer scientist in the field of artificial intelligence. Witbrock is a native of New Zealand and is the former Vice President of Research at Cycorp, which is carrying out the Cyc project in an effort to produce a genuine Artificial Intelligence.
Background and affiliations
Witbrock was born in Christchurch, New Zealand, and has a Ph.D. in computer science from Carnegie Mellon University. Before joining Cycorp, he was a principal scientist at Terra Lycos, working on integrating statistical and knowledge-based approaches to understanding Web user behavior; he has also been associated with Just Systems Pittsburgh Research Center and the Informedia Digital Library at Carnegie Mellon.
Research topics
Witbrock's dissertation work was on speaker modeling; before going to Cycorp, he published in a broad range of areas, including:
Neural networks
Multimedia information retrieval
Genetic design
Computational linguistics
Speech recognition
Web-browser design
His work at Cycorp has focused on improving its knowledge formation efforts, particularly dialogue processing, and on improving accessibility to the Cyc project.
Selected publications
Witbrock, Michael, Baxter, David, Curtis, Jon, et al. "An Interactive Dialogue System for Knowledge Acquisition in Cyc," in Proceedings of the IJCAI-2003 Workshop on Mixed-Initiative Intelligent Systems, Acapulco, Aug 9, 2003.
O’Hara, Tom, Witbrock, Michael, Aldag, Bjorn, Bertolo, Stefano, Salay, Nancy, Curtis, Jon, and Panton, Kathy. "Inducing Criteria of Lexicalization of Parts of Speech using the Cyc KB," in Proceedings of IJCAI-03, Acapulco August 12–15, 2003.
Mittal, Vibhu O. and Witbrock, Michael J. "Language Modeling Experiments in Non-Extractive Summarization," Chapter 10 in Croft, W. Bruce and Lafferty, John, Language Modeling for Information Retrieval. Kluwer Academic Publishers, Dordrect, 2003.
Banko, Michele, Mittal, Vibhu O., and Witbrock, Michael J., "Headline Generation Based on Statistical Translation," in ACL-2000, Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics, Hong Kong, Oct 3-6, 2000.
Witbrock, Michael J., and Mittal, Vibhu O., "Ultra-Summarization: A Statistical Approach to Generating Highly Condensed Non-Extractive Summaries," in SIGIR’99, Proceedings of the 22nd International Conference on Research and Development in Information Retrieval, Berkeley, CA, Aug 15-19, 1999.
Hauptman, A., Witbrock, M., and Christel, M., "News-on-Demand: An Application of Informedia Technology," d-lib Magazine, The Magazine of the Digital Library Forum, September 1995.
Fischer, Michael, Meyer, Michael, and Witbrock, Michael. "User Extensibility in Amiga Mosaic." Proceedings of the Second International World Wide Web Conference (WWW) '94: Mosaic and the Web, October, 1994.
Witbrock, Michael and Zagha, Marco. "Back-Propagation Learning on the IBM GF11," Chapter in Przytula, K.W., and Prasanna Kumar, V.K. Parallel Digital Implement |
https://en.wikipedia.org/wiki/COMPASS | COMPASS, COMPrehensive ASSembler, is any of a family of macro assembly languages for Control Data Corporation's 3000 series, and for the 60-bit CDC 6000 series, 7600 and Cyber 70 and 170 series mainframe computers. While the architectures are very different, the macro and conditional assembly facilities are similar.
COMPASS for 60-bit machines
There are two flavors of COMPASS on the 60-bit machines:
COMPASS CP is the assembly language for the CP (Central Processor), the processor running user programs. See CDC 6600 CP architecture.
COMPASS PP is the assembly language for the PP (Peripheral Processor), only running operating system code. See CDC 6600 PP architecture.
COMPASS is a classical two-pass assembler with macro and conditional assembly features, and generates a full listing showing both the source assembly code and the generated machine code (in octal). CDC's operating systems were written almost entirely in COMPASS assembly language.
Central processor (CP or CPU) hardware maintains 24 operational registers, named A0 to A7, X0 to X7 and B0 to B7. Registers X0 to X7 are 60 bits long and are used to hold data, while registers B0 to B7 are 18 bits long and their major purpose is to hold either addresses or be used as indexing registers, except that B0 is always zero. As a programming convention, B1 (or B7) often contains positive 1.
A or address registers are also 18 bits long. Each A register pairs with the corresponding X register. Whenever an address is set into any of A1 to A5 registers, the data at that memory location (address) is loaded into the corresponding X register. Likewise, setting an address into one of A6 or A7 registers stores the data held in the corresponding X6 or X7 register to that memory location. However, A0 can be used to hold any address without affecting the contents of register X0.
CP instructions are written in a particularly user-friendly form: "SA1 A0+B1" denotes set address register A1 to the sum of address register A0 and index register B1. The hardware then initiates a memory load from the computed address into register X1.
Peripheral processor (PP or PPU) instructions are completely different from CPU instructions. Peripheral processor hardware is simpler; it has an 18-bit A (accumulator register, a 12-bit Program Address register, a 12-bit Q register (not programmer-visible), and a 22-bit R register (used to accomplish address relocation during central memory read and write instructions on Cyber 180 systems). No special job validation was required to assemble peripheral processor programs, but to be executed, such programs were required to installed into the operating system via special system editing commands.
Further reading
"Assembly Language Programming for the Control Data 6000 Series" by Ralph Grishman, Algorithmics Press, 1972.
References
External links
COMPASS for 24-bit systems CDC3100, 3200, 3300, and 3500
COMPASS for CDC3600 48-bit system
COMPASS for CDC6000 and 7000 60-bit syst |
https://en.wikipedia.org/wiki/Lingo%20%28programming%20language%29 | Lingo is a verbose object-oriented (OO) scripting language developed by John H. Thompson for use in Adobe Director (formerly Macromedia Director). Lingo is used to develop desktop application software, interactive kiosks, CD-ROMs and Adobe Shockwave content.
Lingo is the primary programming language on the Adobe Shockwave platform, which dominated the interactive multimedia product market during the 1990s. Various graphic adventure games were developed with Lingo during the 1990s, including The Journeyman Project, Total Distortion, Mia's Language Adventure, Mia's Science Adventure, and the Didi & Ditto series. Hundreds of free online video games were developed using Lingo, and published on websites such as Miniclip and Shockwave.com.
Lingo can be used to build user interfaces, to manipulate raster graphics, vector graphics and 3D computer graphics, and other data processing tasks. Lingo supports specialized syntax for image processing and 3D object manipulation. 3D meshes can also be created on the fly using Lingo.
History
Lingo was invented by John H. Thompson at MacroMind in 1989, and first released with Director 2.2. Jeff Tanner developed and tested Lingo for Director 2.2 and 3.0, created custom XObjects for various media device producers, language extension examples using XFactory including the XFactory application programming interface (API), and wrote the initial tutorials on how to use Lingo. Dave Shields tested and documented Object-based Lingo for Director 3.13 and 4.0. He ran build scripts to create weekly releases for testing, originated the Macromedia KnowledgeBase, created examples of how to write Lingo XTRA plug-ins in C++, and assembled the Golden Master disks of Macromedia Director that were shipped to the duplicator.
Lingo was quickly adopted by burgeoning multimedia community during the 1990s and the already popular Director product. Initially, about 90% of the users only used 10% of Lingo's features; primarily go to the frame by multimedia authors of tutorials and presentations. However, 10% of the users were game developers who took a wider interest in the other 90% of its abilities, including their own function extensions by creating their own XFactories/XObjects. The Journeyman Project is a prominent example of this.
Features
Lingo is embedded into Adobe Director, and can be added as scripts on objects or on the timeline. Lingo is an object-oriented programming (OOP) language, and supports Smalltalk-like verbose syntax, OO dot syntax, and inheritance.
Verbose syntax
When Lingo was created, a verbose syntax was designed to mimic spoken language, so it would be easy for new users. Users could write HyperTalk-like sentences such as:
if the visibility of sprite 5 then go to the frame
In go to statements, the "to" is optional, and unlike other programming languages, go statements reference frames in Director's Score, not specific code lines.
Lingo was also initially very robust by providing object generation through a no |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Sweden | This is a list of radio networks and stations in Sweden and elsewhere broadcasting exclusively or partly in the Swedish language.
Sveriges Radio
National networks
Sveriges Radio P1, talk and news
Sveriges Radio P2, classical music
Sveriges Radio P3, CHR music
Sveriges Radio P4, local news
Other channels
Private
Commercial radio
Networks
Rix FM (MTG)
Mix Megapol (SBS)
Lugna Favoriter (MTG)
NRJ (MTG)
The Voice (SBS)
Local distribution
Owned by MTG:
Bandit Rock 106-3 (Stockholm)
Bandit Rock 104-8 (Göteborg)
Star FM 101,9 (Stockholm)
Owned by SBS:
Rockklassiker (Stockholm)
Mix Megapol Borås (Borås)
Mix Megapol Göteborg (Göteborg)
Mix Megapol Malmö (Malmö)
Radio 107.5 (Stockholm)
Vinyl 107 (Stockholm)
Owned by others:
East FM (Norrköping)
Favorit 103.9 (Södertälje)
Radio Guld (Sundsvall)
Community radio
Non-commercial community radio license (närradio).
Stations broadcasting in Swedish outside Sweden
Public-service stations (Finland)
FSR Mixkanalen - see Yleisradio
FSR Plus - see Yleisradio
Radio Finland - see Yleisradio
Yle X3M - see Yleisradio
Yle Vega - see Yleisradio
Internet
Radioseven, dance music
External links
Teracom - Terrestrial Broadchttps://audiomack.com/vibeman_emix/song/this-lifer
Sweden
Radio stations in Sweden |
https://en.wikipedia.org/wiki/What%27s%20My%20Line%3F | What's My Line? is a panel game show that originally ran in the United States on the CBS Television Network from 1950 to 1967, starting in black and white and later in color, with subsequent U.S. revivals. The game uses celebrity panelists to question contestants in order to determine their occupation (i.e., their "line" of work). The majority of the contestants were from the general public. However, there was one weekly celebrity "mystery guest" for which the panelists were blindfolded. It is on the list of longest-running U.S. primetime network television game-shows. Originally moderated by John Charles Daly and most frequently with regular panelists Dorothy Kilgallen, Arlene Francis, and Bennett Cerf, What's My Line? won three Emmy Awards for "Best Quiz or Audience Participation Show" in 1952, 1953, and 1958 and the Golden Globe Awards for Best TV Show in 1962.
More than 700 episodes exist as kinescope recordings (filming a television screen in 16mm), which was the only way moving pictures and sound from spontaneous, unscripted television shows could be preserved on a long-term basis before the widespread use of videotape. Many early episodes were lost because of economic decisions made by CBS executives between 1950 and 1952. Every episode between July 1952 and September 1967 existed for a long time in the archive of producers Mark Goodson and Bill Todman, but some of these were lost in 1975.
After the Sunday night series' cancellation by CBS in 1967, it returned in a syndication package for local television stations that committed to airing it five days a week. This version originally was hosted by Wally Bruner and later by Larry Blyden. It was seen by viewers from 1968 to 1975. There have been a dozen international versions, radio versions, and a live stage version. Revivals in the U.S. were proposed several times, but all of them failed to go past the planning stages. New episodes have not been created for American television since December 12, 1974.
TV Guide ranked it #9 in its list of the 60 greatest game shows ever and Time Magazine ranked it as one of the 100 "All-Time" TV shows ever.
Original CBS series (1950–1967)
Produced by Mark Goodson and Bill Todman for CBS, the show was initially called Occupation Unknown before deciding on the name What's My Line? The original series, which was usually broadcast live, debuted on Thursday, February 2, 1950, at 8:00 p.m. ET. After airing alternate Wednesdays, then alternate Thursdays, finally on October 1, 1950, it had settled into its weekly Sunday 10:30 p.m. ET slot where it would remain until the end of its network run on September 3, 1967.
Starting in July 1959 and continuing for 8 straight years, until July 1967, the show would occasionally record episodes onto quadruplex videotape for playback at a future date. In July 1959, this was state-of-the-art technology. At that time, the immediate concern of Mark Goodson and Bill Todman was that John Daly, anchor of the ABC network's nightly |
https://en.wikipedia.org/wiki/Joshua%20Lederberg | Joshua Lederberg, ForMemRS (May 23, 1925 – February 2, 2008) was an American molecular biologist known for his work in microbial genetics, artificial intelligence, and the United States space program. He was 33 years old when he won the 1958 Nobel Prize in Physiology or Medicine for discovering that bacteria can mate and exchange genes (bacterial conjugation). He shared the prize with Edward Tatum and George Beadle, who won for their work with genetics.
In addition to his contributions to biology, Lederberg did extensive research in artificial intelligence. This included work in the NASA experimental programs seeking life on Mars and the chemistry expert system Dendral.
Early life and education
Lederberg was born in Montclair, New Jersey, to a Jewish family, son of Esther Goldenbaum Schulman Lederberg and Rabbi Zvi Hirsch Lederberg, in 1925, and moved to Washington Heights, Manhattan as an infant. He had two younger brothers. Lederberg graduated from Stuyvesant High School in New York City at the age of 15 in 1941. After graduation, he was allowed lab space as part of the American Institute Science Laboratory, a forerunner of the Westinghouse Science Talent Search. He enrolled in Columbia University in 1941, majoring in zoology. Under the mentorship of Francis J. Ryan, he conducted biochemical and genetic studies on the bread mold Neurospora crassa. Intending to receive his MD and fulfill his military service obligations, Lederberg worked as a hospital corpsman during 1943 in the clinical pathology laboratory at St. Albans Naval Hospital, where he examined sailors' blood and stool samples for malaria. He went on to receive his undergraduate degree in 1944.
Bacterial genetics
Joshua Lederberg began medical studies at Columbia's College of Physicians and Surgeons while continuing to perform experiments. Inspired by Oswald Avery's discovery of the importance of DNA, Lederberg began to investigate his hypothesis that, contrary to prevailing opinion, bacteria did not simply pass down exact copies of genetic information, making all cells in a lineage essentially clones. After making little progress at Columbia, Lederberg wrote to Edward Tatum, Ryan's post-doctoral mentor, proposing a collaboration. In 1946 and 1947, Lederberg took a leave of absence to study under the mentorship of Tatum at Yale University. Lederberg and Tatum showed that the bacterium Escherichia coli entered a sexual phase during which it could share genetic information through bacterial conjugation. With this discovery and some mapping of the E. coli chromosome, Lederberg was able to receive his Ph.D. from Yale University in 1947. Joshua married Esther Miriam Zimmer (herself a student of Edward Tatum) on December 13, 1946.
Instead of returning to Columbia to finish his medical degree, Lederberg chose to accept an offer of an assistant professorship in genetics at the University of Wisconsin–Madison. His wife Esther Lederberg went with him to Wisconsin. She received her doctorat |
https://en.wikipedia.org/wiki/Ayauta%20District%2C%20Kagawa | is a district located in Kagawa Prefecture, Japan.
As of the Takamatsu merger but using 2000 population data, the district has an estimated population of 41,598 and a density of 353 persons per km2. The total area is 117.74 km2.
Towns and villages
Ayagawa
Utazu
Mergers
On March 22, 2005, the towns of Ayauta and Hanzan merged into the expanded city of Marugame.
On January 10, 2006 the town of Kokubunji, along with the towns of Mure and Aji, both from Kita District, and the towns of Kagawa and Kōnan, both from Kagawa District merged into the expanded city of Takamatsu.
On March 21, 2006 the towns of Ayakami and Ryōnan merged to form the new town of Ayagawa.
References
:ja:綾歌郡 - Japanese Wikipedia article on Ayauta District
Districts in Kagawa Prefecture |
https://en.wikipedia.org/wiki/Query%20language | A query language, also known as data query language or database query language (DQL), is a computer language used to make queries in databases and information systems. In database systems, query languages rely on strict theory to retrieve information. A well known example is the Structured Query Language (SQL).
Types
Broadly, query languages can be classified according to whether they are database query languages or information retrieval query languages. The difference is that a database query language attempts to give factual answers to factual questions, while an information retrieval query language attempts to find documents containing information that is relevant to an area of inquiry. Other types of query languages include:
Full-text. The simplest query language is treating all terms as bag of words that are to be matched with the postings in the inverted index and where subsequently ranking models are applied to retrieve the most relevant documents. Only tokens are defined in the CFG. Web search engines often use this approach.
Boolean. A query language that also supports the use of the Boolean operators AND, OR, NOT.
Structured. A language that supports searching within (a combination of) fields when a document is structured and has been indexed using its document structure.
Natural language. A query language that supports natural language by parsing the natural language query to a form that can be best used to retrieve relevant documents, for example with Question answering systems or conversational search.
Examples
Attempto Controlled English is a query language that is also a controlled natural language.
AQL is a query language for the ArangoDB native multi-model database system.
.QL is a proprietary object-oriented query language for querying relational databases; successor of Datalog;
CodeQL is the analysis engine used by developers to automate security checks, and by security researchers to perform variant analysis on GitHub.
Contextual Query Language (CQL) a formal language for representing queries to information retrieval systems such as web indexes or bibliographic catalogues.
Cypher is a query language for the Neo4j graph database;
DMX is a query language for data mining models;
Datalog is a query language for deductive databases;
F-logic is a declarative object-oriented language for deductive databases and knowledge representation.
FQL enables you to use a SQL-style interface to query the data exposed by the Graph API. It provides advanced features not available in the Graph API.
Gellish English is a language that can be used for queries in Gellish English Databases, for dialogues (requests and responses) as well as for information modeling and knowledge modeling;
Gremlin is an Apache Software Foundation graph traversal language for OLTP and OLAP graph systems.
GraphQL is a data query language developed by Facebook as an alternate to REST and ad-hoc webservice architectures.
HTSQL is a query language that |
https://en.wikipedia.org/wiki/Seven%20Network | The Seven Network (commonly known as Channel Seven or simply Seven) is a major Australian commercial free-to-air television network. It is owned by Seven West Media Limited, and is one of five main free-to-air television networks in Australia. The network's headquarters are located in Sydney.
As of 2014, it is the second-largest network in the country in terms of population reach. The Seven Network shows various nonfiction shows—such as news broadcasts (Seven News) and sports programing—as well as fiction shows. In 2011, the network won all 40 out of 40 weeks of the ratings season for total viewers, being the first to achieve this since the introduction of the OzTAM ratings system in 2001.
As of 2022, the Seven Network is the highest-rated television network in Australia, ahead of the Nine Network, ABC TV, Network 10 and SBS.
Headquarters
Seven's administration headquarters are in Eveleigh, Sydney, completed in 2003. National news and current affairs programming are based between flagship station ATN-7 in Sydney and HSV-7 in Melbourne. In 2009, Seven moved its Sydney-based production operations from Epping to a purpose-built high-definition television production facility at the Australian Technology Park in Eveleigh.
History
Origins
The present Seven Network began as a group of independent stations in Sydney, Melbourne, Brisbane, Adelaide and Perth. HSV-7 Melbourne, licensed to The Herald and Weekly Times Ltd (owners of two local papers at the time, The Herald and The Sun), was launched on 4 November 1956, the first television station in the country to use the VHF7 frequency. ATN-7 Sydney, licensed to Amalgamated Television Services, a subsidiary of Fairfax, was launched on 2 December 1956, signing on as Sydney's third television station. The two stations did not immediately share resources, and instead formed content-sharing partnerships with their VHF9 counterparts by 1957: ATN-7 partnered with Melbourne's GTV-9, while HSV-7 paired up with Sydney's TCN-9. TVW-7 Perth, licensed to TVW Limited, a subsidiary of West Australian Newspapers, publisher of The West Australian, began broadcasting almost two years later, on 16 October 1959, as the city's first television station. BTQ-7 Brisbane followed on 1 November 1959, signing on as Brisbane's second television station. ADS-7 Adelaide was launched on 24 October 1959 as the final capital city VHF7 station. The station later swapped frequencies with SAS-10 on 27 December 1987 as ADS-10 and SAS-7.
HSV-7 began its relationship with the Victorian Football League (now the Australian Football League) in April 1957, when the station broadcast the first live Australian rules football match. Throughout this time, the stations operated independently of each other, with schedules made up of various simple, and relatively inexpensive, programs, such as Pick a Box and spinoffs of popular radio shows. In the early 1960s, coaxial cable links, formed initially between Sydney and Melbourne, allowed the sharing |
https://en.wikipedia.org/wiki/Quote | "Quote" is a clipped form of quotation or quotation mark.
Computing
String literals, computer programming languages' facility for embedding text in the source code
Quoting in Lisp, the Lisp programming language's notion of quoting
Quoted-printable, encoding method for data transmission
Usenet quoting, the conventions used by Usenet and e-mail users when quoting a portion of the original message in a response message.
Finance
Financial quote or sales quote, the commercial statement detailing a set of products and services to be purchased in a single transaction by one party from another for a defined price
Quote.com, a financial website
Quote notation, representation of certain rational numbers
Media
Quote... Unquote, panel game on BBC Radio 4.
Quote (magazine), a Dutch magazine
Quote, the protagonist of the 2004 platform game Cave Story
Musical quotation, the practice of directly quoting another work in a new composition
Speech and written text
Quotation, the repetition of someone else's statement, beliefs or thoughts
Quotation marks, punctuation marks used in text to indicate a quotation
See also
Mention (blogging), a means by which a blog post references or links to a user's profile
Posting style, quoting the original message when a message is replied to in e-mail, Internet forums, or Usenet
Quotation (disambiguation)
Quote, Missouri, a ghost town |
https://en.wikipedia.org/wiki/Presidential%20library%20system | In the United States, the presidential library system is a nationwide network of 15 libraries administered by the Office of Presidential Libraries, which is part of the National Archives and Records Administration (NARA). These are repositories for preserving and making available the papers, records, collections and other historical materials of every president of the United States from Herbert Hoover, the 31st president from 1929–1933 to Donald Trump, the 45th president from 2017–2021. In addition to the library services, museum exhibitions concerning the presidency are displayed.
Although recognized as having historical significance, before the mid-20th century presidential papers and effects were generally understood to be the private property of the president. Franklin D. Roosevelt (32nd president, 1933–1945) proposed to leave his papers to the public in a building donated by him on his Hyde Park, New York estate. Since then a series of laws established the public keeping of documents and the presidential library system. While not officially sanctioned and maintained by NARA, libraries have also been organized for several presidents who preceded Hoover and the official start of the Presidential Library Office.
The library sites are sometimes referred to as presidential centers. The Barack Obama Presidential Center (44th president, 2009–2017) is currently the most recent library to operate under a new model, whereby the Barack Obama Presidential Library is fully digitized, preserved, and administered by NARA with archival materials lent to the privately operated Presidential Center for display.
Overview
For every president since Herbert Hoover, presidential libraries have been established in each president's home state in which documents, artifacts, gifts of state and museum exhibits are maintained that relate to the former president's life and career both political and professional. Each library also provides an active series of public programs. When a president leaves office, the National Archives and Records Administration (NARA) establishes a presidential materials project to house and index the documents until a new presidential library is built and transferred to the federal government.
The first presidential library is the Franklin D. Roosevelt Presidential Library and Museum, dedicated on June 30, 1941. The George W. Bush Presidential Center became the thirteenth on May 1, 2013.
Presidential libraries outside NARA
The presidential library system is made up of thirteen presidential libraries operated fully, or partially, by NARA. Libraries and museums have been established for earlier presidents, but they are not part of the NARA presidential library system, and are operated by private foundations, historical societies, or state governments, including the James K. Polk, William McKinley, Rutherford B. Hayes, Calvin Coolidge, Abraham Lincoln and Woodrow Wilson libraries. For example, the Abraham Lincoln Presidential Library and Mu |
https://en.wikipedia.org/wiki/Friends%20of%20the%20People | Friends of the People is an American sketch comedy television series. It was slated to premiere on TruTV in summer 2014, but was pushed to October 28, 2014, as part of the network's shift in their programming direction. Many of the cast members (Jennifer Bartels, Jermaine Fowler, and Lil Rel Howery) were originally reported to be cast members of a planned revival of In Living Color which never materialized. The show's first season consisted of 10 episodes. This made it the network's first sketch comedy show. The series held a TV-14 rating, though select episodes were rated TV-MA — also a first for the truTV network.
Cast
Kevin Barnett
Jennifer Bartels
Jermaine Fowler
Lil Rel Howery
Keith Lucas
Kenny Lucas
Josh Rabinowitz
References
External links
2010s American sketch comedy television series
2014 American television series debuts
2015 American television series endings
English-language television shows
TruTV original programming
Television series by 3 Arts Entertainment |
https://en.wikipedia.org/wiki/Multi-booting | Multi-booting is the act of installing multiple operating systems on a single computer, and being able to choose which one to boot. The term dual-booting refers to the common configuration of specifically two operating systems. Multi-booting may require a custom boot loader.
Usage
Multi-booting allows more than one operating system to reside on one computer; for example, if a user has a primary operating system that they use most frequently and an alternate operating system that they use less frequently. Multi-booting allows a new operating system to configure all applications needed and migrate data before removing the old operating system, if desired. Another reason for multi-booting can be to investigate or test a new operating system without switching completely.
Multi-booting is also useful in situations where different software requires different operating systems. A multi-boot configuration allows a user to use all of their software on one computer. This is often accomplished by using a boot loader such as NTLDR, LILO, or GRUB which can boot more than one operating system.
Multi-booting is also used by software developers when multiple operating systems are required for development or testing purposes. Having these systems on one machine is a way to reduce hardware costs.
Multi-booting also allows a user to switch between private and work dedicated systems to maintain access integrity and separation between the two user environments, even if the same operating system is used for each of them.
A possible alternative to multi-booting is virtualization, where a hypervisor is used to host one or more virtual machines running guest operating systems.
Technical issues
Number of operating systems per volume (logical drive)
In an OS/2 dual-boot configuration, the C drive can contain both DOS and OS/2. The user issues the BOOT command from the DOS or OS/2 command line to do the necessary copy, move and rename operations and then reboot to the specified system on C:. Other systems provide similar mechanisms for alternate systems on the same logical drive.
Number of operating systems per storage device
In a multi-boot computer each of the multiple operating systems can reside on its own storage device, or some storage devices might contain more than one operating system in different partitions. The boot loader in or loaded by the MBR displays a menu of logical drives and loads the selected boot loader from the PBR of that drive.
An example of a computer with one operating system per storage device is a dual-booting computer that stores Windows on one disk drive and Linux on another disk drive. In this case a multi-booting boot loader is not strictly necessary because the user can choose to enter BIOS configuration immediately after power-up and make the desired drive first in the boot-order list. However, it is more convenient to have a multi-booting boot loader on one of the drives, set BIOS once to always start booting from (i.e. load the |
https://en.wikipedia.org/wiki/Filing%20system | Filing system may refer to:
Filing cabinet, a piece of office furniture
File system, a method of storing and organizing computer files and their data
Sorting, any process of arranging items systematically
Taxonomy (general), the science and practice of classification |
https://en.wikipedia.org/wiki/Named%20parameter | In computer programming, named parameters, named-parameter arguments, named arguments or keyword arguments refer to a computer language's support for function calls to clearly associate each argument with a given parameter parameter within the function call.
Overview
A function call using named parameters differs from a regular function call in that the arguments are passed by associating each one with a parameter name, instead of providing an ordered list of arguments.
For example, consider this Java or C# method call that doesn't use named parameters:
window.addNewControl("Title", 20, 50, 100, 50, true);
Using named parameters in Python, the call can be written as:
window.addNewControl(title="Title",
xPosition=20,
yPosition=50,
width=100,
height=50,
drawingNow=True)
Using named parameters in PHP, the call can be written as:
$window->addNewControl(title: "Title",
xPosition: 20,
yPosition: 50,
width: 100,
height: 50,
drawingNow: True);
The version with positional arguments is more implicit. The versions that name parameters are more explicit. Depending on circumstance, a programmer may find one or the other to be easier to read.
Use in programming languages
Named parameters are supported explicitly in many languages. A non-exhaustive selection of examples includes Ada, C# 4.0+, Ceylon, ColdFusion Markup Language (CFML), Common Lisp, Fortran, IDL, Kotlin, Mathematica, PL/SQL, PowerShell, Python, R, PHP, Ruby, Scala, Smalltalk, Swift and Visual Basic. Note that Objective-C does not have named parameters (even though parts of the method name may look like named parameters).
In C++, you can achieve named parameters by using designated initializers since C++20, like so:struct A{int a{}, int b{}};
void
foo(A bar)
{
std::cout << bar.a << bar.b;
}
foo({.a = 1, .b = 3});
Order of parameters
In languages that do not support named parameters, the order of arguments in a function call is necessarily fixed, since it is the only way that the language can identify which argument is intended to be used for which parameter.
With named parameters, it is usually possible to provide the arguments in any order, since the parameter name attached to each argument identifies its purpose. This reduces the connascence between parts of the program. A few languages support named parameters but still require the arguments to be provided in a specific order.
Optional parameters and positional parameters
Named parameters are often used in conjunction with optional parameters. Without named parameters, optional parameters can only appear at the end of the parameter list, since there is no other way to determine which values have been omitted. In languages that support named optional parameters, however, programs may supply any subset of the av |
https://en.wikipedia.org/wiki/Randomized%20algorithm | A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random bits as an auxiliary input to guide its behavior, in the hope of achieving good performance in the "average case" over all possible choices of random determined by the random bits; thus either the running time, or the output (or both) are random variables.
One has to distinguish between algorithms that use the random input so that they always terminate with the correct answer, but where the expected running time is finite (Las Vegas algorithms, for example Quicksort), and algorithms which have a chance of producing an incorrect result (Monte Carlo algorithms, for example the Monte Carlo algorithm for the MFAS problem) or fail to produce a result either by signaling a failure or failing to terminate. In some cases, probabilistic algorithms are the only practical means of solving a problem.
In common practice, randomized algorithms are approximated using a pseudorandom number generator in place of a true source of random bits; such an implementation may deviate from the expected theoretical behavior and mathematical guarantees which may depend on the existence of an ideal true random number generator.
Motivation
As a motivating example, consider the problem of finding an ‘a’ in an array of n elements.
Input: An array of n≥2 elements, in which half are ‘a’s and the other half are ‘b’s.
Output: Find an ‘a’ in the array.
We give two versions of the algorithm, one Las Vegas algorithm and one Monte Carlo algorithm.
Las Vegas algorithm:
findingA_LV(array A, n)
begin
repeat
Randomly select one element out of n elements.
until 'a' is found
end
This algorithm succeeds with probability 1. The number of iterations varies and can be arbitrarily large, but the expected number of iterations is
Since it is constant, the expected run time over many calls is . (See Big Theta notation)
Monte Carlo algorithm:
findingA_MC(array A, n, k)
begin
i := 0
repeat
Randomly select one element out of n elements.
i := i + 1
until i = k or 'a' is found
end
If an ‘a’ is found, the algorithm succeeds, else the algorithm fails. After k iterations, the probability of finding an ‘a’ is:
This algorithm does not guarantee success, but the run time is bounded. The number of iterations is always less than or equal to k. Taking k to be constant the run time (expected and absolute) is .
Randomized algorithms are particularly useful when faced with a malicious "adversary" or attacker who deliberately tries to feed a bad input to the algorithm (see worst-case complexity and competitive analysis (online algorithm)) such as in the Prisoner's dilemma. It is for this reason that randomness is ubiquitous in cryptography. In cryptographic applications, pseudo-random numbers cannot be used, since the adversary can predict them, making the algorithm effectively deterministic. Therefore, ei |
https://en.wikipedia.org/wiki/Nil | Nil often refers to the number zero.
Nil or NIL may also refer to:
Acronyms
NIL (programming language), an implementation of the Lisp programming language
Name, image and likeness, a set of rules for American college athletes to receive compensation
Nanoimprint lithography, a method of fabricating nanometer scale patterns
Nomina im Indogermanischen Lexikon ("Nominals in the Indo-European Lexicon"), an etymological dictionary
North Island line, a proposed extension railway of Hong Kong
Music
Nil (band), a Japanese rock band
The Nils, a Canadian punk rock band
N.I.L or Non-Intentional Lifeform, an Australian hard rock band (1995–98)
Albums
Nil (album), a 2006 album released by The Gazette
Nil Recurring, a 2007 EP released by Porcupine Tree
Songs
"Three Nil", a song by Iowa metal band SlipKnot
"Nil", a song by Canadian punk band Gob
"Nil-Nil-Draw", a Song by Gym Class Heroes
"Nil by Mouth", a song by English metal band Haken
People
Nil (given name), list of people with the given name
Nil (surname), list of people with the surname
Other
Nil (cigarette), a brand of cigarette
Nil: A Land Beyond Belief, a 2005 graphic novel
Nil in the Indian numbering system
Nil, Iran
Nil ideal, a mathematical concept in ring theory
Null pointer (sometimes written NULL, nil, or None), used in computer programming for an uninitialized, undefined, empty, or meaningless value
Nil River (Guatemala)
Jednostka Wojskowa Nil or NIL, a Polish commando unit, part of The Polish Special Forces (Wojska Specjalne)
See also
Names for the number 0 in English
Neel (disambiguation)
Null (disambiguation) |
https://en.wikipedia.org/wiki/Columbia%20Data%20Products | Columbia Data Products, Inc. (CDP) is a company which produced the first legally reverse-engineered IBM PC clones. It faltered in that market after only a few years, and later reinvented itself as a software development company.
History
1976–1986: As a hardware company
Columbia Data Products was founded by William Diaz in 1976 in Columbia, Maryland. In 1980, Columbia Data Products made some Z80-based computers, most notably their Commander 900 series, which had several models, some of which were multiprocessors and had graphics capabilities.
CDP introduced the MPC 1600 "Multi Personal Computer", designed by David Howse, in June 1982. It was an exact functional copy of the IBM Personal Computer model 5150 except for the BIOS which was Clean room designed. IBM had published the bus and BIOS specifications, wrongly assuming that this would not be enough to facilitate unlicensed copying of the design, but be enough to encourage the add-on market.
CDP advertisements stated that the MPC "can use software and hardware originally intended for the IBM Personal Computer". The "Multi" in its name hinted to the fact that it could also run the multi-user operating system MP/M-86. The MPC was the first IBM PC clone and was actually superior to the IBM original.
It came with 128 KB RAM standard, compared to the IBM's 64 KB maximum. The MPC had eight PC expansion slots, with one filled by its video card. Its floppy disk drive interface was built into the motherboard.
The IBM PC, in contrast, had only five expansion slots, with the video card and floppy disk controller taking two of them. The MPC also included two floppy disk drives, one parallel and two serial ports, which were all optional on the original IBM PC. The MPC was followed up with a portable PC, the 32 pound (15 kg) "luggable" Columbia VP in 1983.
In May 1983, Future Computing ranked Columbia and Compaq computers as "Best" in the category of "Operationally Compatible", its highest tier of PC compatibility. PC Magazine in June 1983 criticized the MPC's documentation, but reported that it had very good hardware and software compatibility with the IBM PC. BYTE in November 1984 approved of the portable MPC-VP's PC compatibility, reporting that it ran Microsoft Flight Simulator, WordStar, Lotus 1-2-3, dBASE II, and other popular applications without problems. It concluded that the computer was "one of the best overall bargains on the market today".
The success of the MPC and its successors built CDP revenue from US$9.4 million in 1982 to US$56 million in 1983, with an IPO at US$11 in January 1983.
In February 1984, IBM announced the introduction of their first portable PC, thus putting pressure on its competitors in this niche as well, which besides CDP already included Compaq as the market leader in this segment, as well as Kaypro, TeleVideo Corporation, and Eagle Computer.
Columbia also released upgraded desktop models in order to compete with the IBM PC XT. Their MPC 1600-4, briefly review |
https://en.wikipedia.org/wiki/Ramification%20problem | In philosophy and artificial intelligence (especially, knowledge based systems), the ramification problem is concerned with the indirect consequences of an action. It might also be posed as how to represent what happens implicitly due to an action or how to control the secondary and tertiary effects of an action. It is strongly connected to, and is opposite the qualification side of, the frame problem.
Limit theory helps in operational usage. For instance, in KBE derivation of a populated design (geometrical objects, etc., similar concerns apply in shape theory), equivalence assumptions allow convergence where potentially large, and perhaps even computationally indeterminate, solution sets are handled deftly. Yet, in a chain of computation, downstream events may very well find some types of results from earlier resolutions of ramification as problematic for their own algorithms.
See also
Non-monotonic logic
Ramification (mathematics)
External links
Nikos Papadakis "Actions with Duration and Constraints: the Ramification Problem in Temporal Databases" IEEE ICTAI'02
Deepak Kumar "Planning" Bryn Mawr College
Logic programming
Knowledge representation
Concepts in epistemology |
https://en.wikipedia.org/wiki/Highway%201%20%28Australia%29 | Australias Highway 1 is a network of highways that circumnavigate the country, joining all mainland capital cities except the national capital of Canberra. At a total length of approximately it is the longest national highway in the world, surpassing the Trans-Siberian Highway (over ) and the Trans-Canada Highway (). Over a million people traverse some part of the highway network every day.
History
Highway 1 was created as part of the National Route Numbering system, adopted in 1955. The route was compiled from an existing network of state and local roads and tracks. Highway 1 is the only route to reach across all Australian states, plus the Northern Territory. Many of the other national routes are tributaries of Highway 1.
Under the original Highway 1 scheme, certain major traffic routes that ran parallel to the main route were designated National Route Alternative 1. Most of these route designations have been replaced by either a state route designation, or an alpha-numeric route designation, depending on which state the section is in. An example of the Alternative 1 designation remaining is on the old Princes Highway route from Dandenong to South Melbourne in Victoria.
Route markers
The entirety of Highway 1 was originally marked with a National Route 1 shield (black number on a white shield). In 1974, the segments of the route that were declared part of the National Highway network were updated to use the National Highway shield (gold number on a green shield).
Since that time, all states and territories except for Western Australia have adopted (or are in the process of adopting) alphanumeric route numbers. As a consequence, much of Highway 1 is now marked with a M1, A1 or B1 route marker (depending on the route's quality and importance). A notable exception is in Tasmania, which was the first state to adopt alphanumeric route numbers but Highway 1 is still marked with a National Highway 1 shield.
In South Australia, sections of Highway 1 which were once part of the National Highway were marked as "National Highway A1" or "National Highway M1" but have since been replaced by the standard "A1" and "M1" shield markers
Track
Large sections of Highway 1 are shared with the Australian National Highway, though the two are not synonymous. Where they diverge, Highway 1 follows a coastal route, such as the Princes Highway from Sydney to Melbourne, whereas the National Highway follows an inland (and generally more direct) route between major cities, such as the Hume Highway and Freeway from Sydney to Melbourne.
From Sydney, it heads southwards to Melbourne and onwards toward Adelaide. This section mostly follows the Princes Highway, except sections where that highway has been bypassed by freeways. It leaves the Sydney central business district via the Eastern Distributor, and continues southward through the Sydney metropolitan area via Southern Cross Drive, General Holmes Drive, The Grand Parade, President Avenue, and the Princes Highway (NS |
https://en.wikipedia.org/wiki/Write-only%20language | In computer humor, a write-only language is a pejorative term for a programming language alleged to have syntax or semantics sufficiently dense and bizarre that any routine of significant size is too difficult to understand by other programmers and cannot be safely edited. Similarly, write-only code is source code so arcane, complex, or ill-structured that it cannot be reliably modified or even comprehended by anyone (with the possible exception of the author).
Languages that have been derided as write-only include APL, C/C++, Perl, Forth, Scala and Lisp, as well as Dynamic debugging technique (DDT), Text Editor and Corrector (TECO), Mathematica, IGOR Pro, Rust, sed, and the regular expression syntax used in various languages. Attributes that these languages have in common include a large set of operators and a syntax which encourages, or at least permits, the writing of very dense code. Some also have syntaxes which are very different from other languages, and some use different character sets such as APL.
The code below for example is Conway's Game of Life as written in APL2:
⍎'⎕',∊N⍴⊂S←'←⎕←(3=T)∨M∧2=T←⊃+/(V⌽¨⊂M),(V⊖¨⊂M),(V,⌽V)⌽¨(V,V←1 -1)⊖¨⊂M'
See also
Esoteric programming language
International Obfuscated C Code Contest
Obfuscation (software)
Spaghetti code
Turing tarpit
Write-only memory
References
Software engineering folklore
Programming language classification |
https://en.wikipedia.org/wiki/V%20%28operating%20system%29 | The V operating system (sometimes written V-System) is a discontinued microkernel distributed operating system that was developed by faculty and students in the Distributed Systems Group at Stanford University from 1981 to 1988, led by Professors David Cheriton and Keith A. Lantz. V was the successor to the Thoth operating system and Verex kernel that Cheriton had developed in the 1970s. Despite similar names and close development dates, it is unrelated to UNIX System V.
Features
The key concepts in V are multithreading and synchronous message passing. The original V terminology uses process for what is now commonly called a thread, and team for what is now commonly called a process consisting of multiple threads sharing an address space. Communication between threads in V uses synchronous message passing, with short, fixed-length messages that can include access rights for the receiver to read or write part of the sender's address space before replying. The same message-passing interface is used both between threads within one process, between threads of different processes within one machine, and between threads on different machines connected by a local Ethernet. A thread receiving a message is not required to reply to it before receiving other messages; this distinguished the model from Ada rendezvous.
One common pattern for using the messaging facility is for clients to send messages to a server requesting some form of service. From the client side, this looks much like a remote procedure call (RPC). The convenience of an automatic stub generator was lacking, but in contrast, the client can pass one parameter by reference, which is not possible with other RPC implementations. From the server side the model differs more from RPC, since by default all client requests are multiplexed onto one server thread. The server is free to explicitly fork threads to handle client requests in parallel, however; if this is done, the server-side model is much like RPC too.
V was never an end in itself for the Stanford group; rather, it was used as a vehicle for many different research projects in distributed operating systems and networking. Much like other operating system efforts of its day (such as Sprite), V was a complete system that was mostly self hosting. Many students ran V as the only operating system on their diskless SUN workstations or MicroVAX workstations. Compiles could be done either on V, or on VAX Unix machines that provided file service in a more stable environment than the ever-changing research system.
V did have some notable impacts. After the initial implementation on one computer, the Versatile Message Transaction Protocol (VMTP) was developed to extend the send-receive-reply system call semantics over a local area network.
The protocol included multicast support developed by Steve Deering as a graduate student in the group. The Internet Protocol layer to support this evolved into the IP multicast standard.
The V system was u |
https://en.wikipedia.org/wiki/Vince%20Carter | Vincent Lamar Carter Jr. (born January 26, 1977) is an American former professional basketball player who serves as a basketball analyst for YES Network and formerly ESPN. He primarily played the shooting guard and small forward positions, but occasionally played power forward later in his NBA career. He was an eight-time All-Star and a two-time All-NBA Team selection. He is the only player in NBA history to play as many as 22 seasons and in four different decades, from his debut in 1999 to his retirement in 2020. He was the scoring leader on the 2000 United States Men’s Olympic Basketball Team where the USA defeated France to win the nation’s twelfth Men’s Basketball Olympic gold medal. He entertained crowds with his leaping ability and slam dunks, earning him nicknames such as "Vinsanity", "Air Canada", and "Half Man, Half Amazing". He has been ranked as the greatest dunker of all time by numerous players, journalists, and by the National Basketball Association (NBA). In addition to his dunking prowess, he was a prolific three-point shooter, making the seventh most three-point field goals in league history.
A high school McDonald's All-American, Carter played college basketball for three years with the North Carolina Tar Heels and twice advanced to the Final Four of the NCAA Tournament. He was selected with the fifth overall pick in the 1998 NBA draft by the Golden State Warriors, who traded him to the Toronto Raptors. Carter emerged as a star in Toronto as he won the 1999 NBA Rookie of the Year Award and the Slam Dunk Contest at the 2000 NBA All-Star Weekend. He represented the United States in the 2000 Summer Olympics, where he won a gold medal. In December 2004, he was traded to the New Jersey Nets, where he continued his offensive success. He also played for the Orlando Magic, Phoenix Suns, Dallas Mavericks, Memphis Grizzlies, Sacramento Kings, and Atlanta Hawks. He received the Twyman–Stokes Teammate of the Year Award in 2016.Off the court, Carter established the Embassy of Hope Foundation, helping children and their families in Florida, New Jersey and Ontario. He was recognized in 2000 as Child Advocate of the Year by the Children's Home Society, and received the Florida Governor's Points of Light award in 2007 for his philanthropy in his home state.
Early life
Born in Daytona Beach, Florida, Carter is the son of Michelle and Vincent Carter Sr. His parents divorced when he was seven. His mother remarried at least twice.
Carter attended Mainland High School in Daytona Beach. He played football as a quarterback until a broken wrist in his freshman year forced him to switch to volleyball. In volleyball, he was named the Volusia County Player of the Year as a junior and averaged 24 kills per match; for comparison, none of his teammates averaged more than one. He was also offered a saxophone scholarship to attend Bethune–Cookman University in Daytona Beach.
He led Mainland's basketball team to its first Class 6A state title in 56 years, an |
https://en.wikipedia.org/wiki/Animutation | Animutation or fanimutation is a form of web-based computer animation, typically created in Adobe Flash and characterized by unpredictable montages of pop-culture images set to music, often in a language foreign to the intended viewers. It is not to be confused with manual collage animation (e.g., the work of Stan Vanderbeek and Terry Gilliam), which predates the Internet.
History
Animutation was popularized by Neil Cicierega. Cicierega claims to have been inspired by several sources, including bizarre Japanese commercials and Martin Holmström's "Hatten är din" Soramimi-style video made for the "Habbeetik" song by Azar Habib. The term animutation is a portmanteau of animation and mutation and was popularized in 2001 through Cicierega's flash animations such as Japanese Pokerap and Hyakugojyuuichi!!, which featured the credits music from older episodes of Pokémon. The popularity of Hyakugojyuuichi!! quickly made it an Internet phenomenon. Since that time, others have adopted a similar style and communities of similarly minded animators have sprung up around the web. These versions made by fans were christened "fanimutations".
Recurring themes
Audio
Animutations can be based on songs of foreign, independent, or mainstream origin. Japanese songs were used in many of the original animutations by Neil Cicierega, but newer animutations use songs in a wide variety of languages, including English, Dutch and gibberish.
The foreign language songs are often "misheard" into English by the creators and added as subtitles. The words are not translations but soramimis, English words that sound roughly the same as the original lyrics. For example, the animutation title "French erotic film" is a soramimi of the original Dutch lyrics "Weet je wat ik wil" in an Ome Henk song. The actual translation of the lyrics is "Do you know what I want?"
Recurring motifs
Though animutations are close in relation to the random nonsense of dadaism and can be entirely unpredictable, they sometimes exhibit recurring memes among them as a result of being influenced by each other and internet culture. Among the many recurring motifs found in animutations are:
The inclusion of Canadian comedian Colin Mochrie from Whose Line Is It Anyway? Regularly, a picture of Mochrie's head superimposed into a crudely drawn sun is also used. This inclusion is largely due to Neil Cicierega's fixation on the comedian.
The inclusion of Harry Potter in various forms, often edited in a bizarre fashion. Neil Cicierega, also a creator of the Potter Puppet Pals, is responsible from the outset explosion of Harry Potter's use in animutation, most notably starting in Hyakugojyuuichi.
Obscure pop-culture references, typically catchphrases or images.
Random cartoon characters, usually from children's television programs or anime, although obscure characters are also used.
Non-traditional interfaces
While many flash animations have a "replay button" at the end, animutations often use a silly graphi |
https://en.wikipedia.org/wiki/Text-based%20user%20interface | In computing, text-based user interfaces (TUI) (alternately terminal user interfaces, to reflect a dependence upon the properties of computer terminals and not just text), is a retronym describing a type of user interface (UI) common as an early form of human–computer interaction, before the advent of bitmapped displays and modern conventional graphical user interfaces (GUIs). Like modern GUIs, they can use the entire screen area and may accept mouse and other inputs. They may also use color and often structure the display using box-drawing characters such as ┌ and ╣. The modern context of use is usually a terminal emulator.
Types of text terminals
From text application's point of view, a text screen (and communications with it) can belong to one of three types (here ordered in order of decreasing accessibility):
A genuine text mode display, controlled by a video adapter or the central processor itself. This is a normal condition for a locally running application on various types of personal computers and mobile devices. If not deterred by the operating system, a smart program may exploit the full power of a hardware text mode.
A text mode emulator. Examples are xterm for X Window System and win32 console (in a window mode) for Microsoft Windows. This usually supports programs which expect a real text mode display, but may run considerably slower. Certain functions of an advanced text mode, such as an own font uploading, almost certainly become unavailable.
A remote text terminal. The communication capabilities usually become reduced to a serial line or its emulation, possibly with few ioctl()s as an out-of-band channel in such cases as Telnet and Secure Shell. This is the worst case, because software restrictions hinder the use of capabilities of a remote display device.
Under Linux and other Unix-like systems, a program easily accommodates to any of the three cases because the same interface (namely, standard streams) controls the display and keyboard. See below for comparison to Windows.
Many TUI programming libraries are available to help developers build TUI applications.
On ANSI-compatible terminals
American National Standards Institute (ANSI) standard ANSI X3.64 defines a standard set of escape sequences that can be used to drive terminals to create TUIs (see ANSI escape code). Escape sequences may be supported for all three cases mentioned in the above section, allowing arbitrary cursor movements and color changes.
However, not all terminals follow this standard, and many non-compatible but functionally equivalent sequences exist.
Under DOS and Microsoft Windows
On IBM Personal Computers and compatibles, the Basic Input Output System (BIOS) and DOS system calls provide a way to write text on the screen, and the ANSI.SYS driver could process standard ANSI escape sequences. However, programmers soon learned that writing data directly to the screen buffer was far faster and simpler to program, and less error-prone; see VGA-compa |
https://en.wikipedia.org/wiki/UUHash | UUHash is a hash algorithm employed by clients on the FastTrack network. It is employed for its ability to hash very large files in a very short period of time, even on older computers. However, this is achieved by only hashing a fraction of the file. This weakness makes it trivial to create a hash collision, allowing large sections to be completely altered without altering the checksum.
This method is used by Kazaa. The weakness of UUHash is exploited by anti-p2p agencies to corrupt downloads.
How it works
The UUHash is a 160-bit string that is usually Base64-encoded for presentation. It is a concatenation of an MD5 hash and a CRC32 sum of selected chunks of the file.
The first 307,200 bytes (300 Kibibyte, one "chunk size") of the file are MD5-hashed (less if file is shorter). The 32 bit little endian integer value smallhash is initialized to 0.
If the file is strictly larger than one chunk size, a series of chunks at file offsets of 2n MiB (n ≥ 0) and one chunk right at the end of the file are hashed using a CRC32 (polynomial 0xEDB88320 reversed, 0x04C11DB7 normal). The last chunk of the power-of-two series ends strictly more than one chunk size before the end of the file, i.e. there is always at least one unread byte between the last two chunks (if there are that many chunks). The end-of-file chunk may be shorter than one chunk size; it starts at or after one chunk size into the file. The CRC is initialized using smallhash and stored into smallhash.
So, for example:
offset 0 MiB, 300 KiB hashed with MD5
offset 1 MiB, 300 KiB hashed with CRC32
offset 2 MiB, 300 KiB hashed...
offset 4 MiB, 300 KiB hashed...
offset 8 MiB, 300 KiB hashed...
...
last 300 KiB of file hashed with CRC32
Finally, the bitwise complement of smallhash (still zero for files up to 300 KiB) is XORed together with the file size in bytes. The 160-bit UUHash is now the concatenation of the 128-bit MD5 hash and the final 32-bit smallhash value.
Test Vectors
Given are hashes (base64 and hex) for strings of various lengths containing only 0x00 or 0xFF bytes:
Notice that all strings that have a complete MD5 chunk have the same 128-bit prefix. For files that have the same number of chunks the CRC part differs only because of the included file length (all chunks are identical, or this weren't the case). For files up to 300 KiB, the file length can be extracted from the last four bytes of the hash; smallhash is ~0.
Sig2Dat
The name UUHash derives from the sig2dat utility which creates URIs referencing files on Kazaa. These URIs are of the form:
sig2dat://|File: surprise.mp3|Length:5845871Bytes|UUHash:=1LDYkHDl65OprVz37xN1VSo9b00=
Not considering the fact that this URI format is not RFC compliant, UUHash refers to the Base64-encoding of the hash and not the hash itself.
Notes
External links
Search algorithms |
https://en.wikipedia.org/wiki/Hard%20link | In computing, a hard link is a directory entry (in a directory-based file system) that associates a name with a file. Thus, each file must have at least one hard link. Creating additional hard links for a file makes the contents of that file accessible via additional paths (i.e., via different names or in different directories). This causes an alias effect: a process can open the file by any one of its paths and change its content. By contrast, a soft link or “shortcut” to a file is not a direct link to the data itself, but rather a reference to a hard link or another soft link.
Every directory is itself a special file, only it contains a list of file names. Hence, multiple hard links to directories are possible, which could create a circular directory structure, rather than a branching structure like a tree. For that reason, some file systems forbid the creation of hard links to directories.
POSIX-compliant operating systems, such as Linux, Android, macOS, and the Windows NT family, support multiple hard links to the same file, depending on the file system. For instance, NTFS and ReFS support hard links, while FAT does not.
Operation
Let two hard links, named "LINK A.TXT" and "LINK B.TXT", point to the same physical data. A text editor opens "LINK A.TXT", modifies it and saves it. When the editor (or any other app) opens "LINK B.TXT", it can see those changes made to "LINK A.TXT", since both file names point to the same data. So from a user's point of view this is one file with several filenames. Editing any filename modifies "all" files, however deleting "any" filename except the last one keeps the file around.
However, some editors, such as GNU Emacs, break the hard link concept. When opening a file for editing, e.g., "LINK B.TXT", emacs renames "LINK B.TXT" to "LINK B.TXT~", loads "LINK B.TXT~" into the editor, and saves the modified contents to a newly created "LINK B.TXT". Now, "LINK A.TXT" and "LINK B.TXT" no longer shares the same data. (This behavior can be changed using the emacs variable backup-by-copying.)
Any number of hard links to the physical data may be created. To access the data, a user only needs to specify the name of any existing link; the operating system will resolve the location of the actual data. Even if the user deletes one of the hard links, the data is still accessible through any other link that remains. Once the user deletes all of the links, if no process has the file open, the operating system frees the disk space that the file once occupied.
Reference counting
Most file systems that support hard links use reference counting. The system stores an integer value with each logical data section that represents the total number of hard links that have been created to point to the data. When a new link is created, this value is increased by one. When a link is removed, the value is decreased by one. When the counter becomes zero, the operating system frees the logical data section. (The OS may not to do so im |
https://en.wikipedia.org/wiki/Didaktik | The Didaktik was a series of 8-bit home computers based on the clones of Intel 8080 and Zilog Z80 processors produced by Didaktik in Skalica, in the former Czechoslovakia.
Initially the company produced PMD 85 compatible machines aimed at schools, then switching to the home market with ZX Spectrum clones.
Didaktik's glory diminished with the falling price of the 16-bit computers, such as the Atari and Amiga, around the middle of the 1990s until it was finally steam-rolled by the PC soon after. The production of Didaktik computers stopped in the year 1994.
Didaktik Alfa
Didaktik Alfa was produced in 1986, as a "more professional" clone of PMD 85. It featured 2.048 MHz Intel 8080 CPU, 48 KB RAM, 8 KB ROM with built-in BASIC, good keyboard (compared with PMD 85), monitor video output (but no TV output) with 288×256 resolution and four possible colours. Despite some changes in ROM, it was mostly compatible with PMD 85. Didaktik Alfa 1 was a clone of PMD 85-1, Didaktik Alfa 2 of PMD 85-2.
Didaktik Beta
Didaktik Beta was a slightly improved version of previous Didaktik Alfa, having almost identical hardware. Didaktik Alfa and Beta were mostly deployed in schools to replace older PMD 85 computers.
Didaktik Gama
Didaktik Gama was a ZX Spectrum clone with 80 KB RAM divided into two switched 32 KB memory banks and 16 KB of slower RAM containing graphical data for video output, while the size of ROM was 16 KB. A peripheral interface with a 8255 chip was added, providing centronics plotter and printer connections and a Kempston joystick port.
The case was similar to that of the ZX Spectrum+, a grey or black box in A5 size, with a flat plastic keyboard and connectors mounted on the rear side. The Gama uses a standard ULA chip made by Ferranti. All games developed for the ZX Spectrum 48K were generally compatible with this computer. An audio cassette was used as data storage and a TV served as a monitor. It is generally said the Gama was unreachable to buy and there were waiting lists several years long.
Didaktik Gama was produced in three variants: the first, Gama '87, fixed some bugs in the original ZX Spectrum ROM (thus breaking compatibility with some software) and introduced its own bugs effectively inhibiting the use of the second 32 KB memory bank from BASIC. Gama '88 fixed the original ZX Spectrum bugs in a more compatible way, and also fixed the memory switching bug. The final and the more compatible model was Gama '89.
The computer was expensive but available on the market and could be purchased in Czechoslovak currency outside specialized Tuzex stores, unlike other foreign home computers. Production of Didaktik Gama computers ceased in 1992.
Didaktik M
The Didaktik M introduced in 1990, was cheaper and simple in design than the Gama. The case was more modern, with an ergonomic-like shape and separate arrow keys (however, the keyboard was of poorer quality). Inside there was only 64 KB of total memory (16 KB ROM and 48 KB RAM) which wa |
https://en.wikipedia.org/wiki/List%20of%20bus%20routes%20in%20Melbourne | This is a list of bus routes that are part of the bus network, in Melbourne, Australia.
Kinetic Melbourne operate approximately 30% of the bus network, signing contracts in 2021 as part of the Melbourne Metropolitan Bus Franchise. The remaining 70% of the network is operated under 23 contracts with other bus operators, all of these contracts were entered into in mid-2018 and will expire in 2025 or 2028.
Route numbering scheme
The route number of buses in Melbourne can tell a little about the route's operator, area served and even its history.
Route numbering was a reflection of the designated zonal area used during the 1980s. Areas were referred to as "Neighbourhood Zones". However, as part of the "Grow or Go" policies, route numbers across the bus network were affected. There are no two-digit route numbers – these are used exclusively by trams.
150–199, 400–899: These routes are run by private companies. Most are found in the middle and outer suburbs, where they provide feeders to railway stations and provide local travel.
200–399: These routes were former government-run routes (Melbourne & Metropolitan Tramways Board and then MetBus). They are found mostly in inner suburbs such as Footscray/Sunshine, Elsternwick-Brighton, Clifton Hill and Port Melbourne. Routes in the Doncaster/Templestowe area also have these numbers due to a Tramways board takeover after the area's private operator collapsed. In the 1990s all MetBus routes were put out to private franchise. Until August 2013, these services were operated by Melbourne Bus Link and National Bus Company. All of these services were taken over by Transdev Melbourne, which were since taken over by Kinetic Melbourne
900 series: Historically these route numbers were used by Victorian Railways, who ran buses co-ordinated with trains on some routes. Routes with these numbers have either been abolished or incorporated into other routes. The 900 series is now used for the high frequency SmartBus services, which are mostly cross-town and orbital routes.
By route number
100-199
200–299
300–399
400–499
500–599
600–699
700–799
800–899
900–999
Airports
Former Routes
By bus company
See also
Buses in Melbourne
Transport in Melbourne
List of Victorian Bus Companies
References
External links
Public Transport Victoria (PTV) (official public transport website)
Bus routes, Melbourne
Melbourne |
https://en.wikipedia.org/wiki/CSNET | The Computer Science Network (CSNET) was a computer network that began operation in 1981 in the United States. Its purpose was to extend networking benefits, for computer science departments at academic and research institutions that could not be directly connected to ARPANET, due to funding or authorization limitations. It played a significant role in spreading awareness of, and access to, national networking and was a major milestone on the path to development of the global Internet. CSNET was funded by the National Science Foundation for an initial three-year period from 1981 to 1984.
History
Lawrence Landweber at the University of Wisconsin–Madison prepared the original CSNET proposal, on behalf of a consortium of universities (Georgia Tech, University of Minnesota, University of New Mexico, University of Oklahoma, Purdue University, University of California, Berkeley, University of Utah, University of Virginia, University of Washington, University of Wisconsin, and Yale University). The US National Science Foundation (NSF) requested a review from David J. Farber at the University of Delaware. Farber assigned the task to his graduate student Dave Crocker who was already active in the development of electronic mail. The project was deemed interesting but in need of significant refinement. The proposal eventually gained the support of Vinton Cerf and DARPA. In 1980, the NSF awarded $5 million to launch the network. It was an unusually large project for the NSF at the time.
A stipulation for the award of the contract was that the network needed to become self-sufficient by 1986.
The first management team consisted of Landweber (University of Wisconsin), Farber (University of Delaware), Peter J. Denning (Purdue University), Anthony C. Hearn (RAND Corporation), and Bill Kern from the NSF. Once CSNET was fully operational, the systems and ongoing network operations were transferred to a team led by Richard Edmiston at Bolt Beranek and Newman (BBN) of Cambridge, Massachusetts by 1984.
The Purdue team, consisting of Peter Denning, Douglas Comer, and Paul McNabb, was responsible for designing and building the kernel interfaces that would allow sites outside of the ARPANET infrastructure to connect via public X.25 networks, such as Telenet. The mechanism allowed systems with TCP/IP network stacks to use an X.25 network device, with IP datagrams being sent through dynamically allocated X.25 sessions. Purdue and other sites with ARPANET access would act as gateways into the ARPANET, allowing non-ARPANet sites to have email, telnet, ftp, and other forms of network access directly into the ARPANET.
By 1981, three sites were connected: University of Delaware, Princeton University, and Purdue University. By 1982, 24 sites were connected expanding to 84 sites by 1984, including one in Israel. Soon thereafter, connections were established to computer science departments in Australia, Canada, France, Germany, Korea, and Japan. CSNET eventually connected |
https://en.wikipedia.org/wiki/Prague%20Metro | The Prague Metro () is the rapid transit network of Prague, Czech Republic. Founded in 1974, the system consists of three lines (A, B and C) serving 61 stations (predominantly with island platforms), and is long. The system served 568 million passengers in 2021 (about 1.55 million daily).
Two types of rolling stock are used on the Metro: the 81-71M (a completely modernized variant of the original 81-717/714.1), and the Metro M1. All the lines are controlled automatically from the central dispatching, near I.P. Pavlova station. The Metro is operated by the Prague Public Transit Company (, DPP), and integrated in the Prague Integrated Transport (Pražská integrovaná doprava, PID) system.
Basic information
The Prague Metro has three lines, each represented by its own colour on the maps and signs: Line A (green, 17 stations, ), Line B (yellow, 24 stations, ) and Line C (red, 20 stations, ). There are 61 stations in total (three of which are transfer stations) connected by nearly 66 kilometres of mostly underground railways. Service operates from 4–5 am until midnight, with two- to three-minute intervals between trains during rush hours and four to ten minutes between trains at other times. Nearly 600 million passengers use the Prague Metro every year (about 1.6 million daily).
The system is run by the Prague Public Transit Company Co. Inc. (Czech: , DPP), which also manages the other means of public transport around the city, including the trams, buses, five ferries, the funicular to Petřín Hill, and the chairlift inside the Prague Zoo.
Since 1993, the system has been connected to commuter trains and buses, and also to "park-and-ride" parking lots. Together, they form an extensive public transportation network reaching further from the city, called Prague Integrated Transport (Czech: Pražská integrovaná doprava, PID). Whilst the large system is zonally priced, the Metro is entirely inside the central zone.
Many stations are quite large, with several entrances spaced relatively far apart. This can often lead to confusion for those unfamiliar with the system, especially at the central hubs such as Můstek or Muzeum. In general the stations are well signposted even for those unfamiliar with the Czech language. The Prague Metro is very safe.
System layout and stations
The Prague Metro system is laid out as a triangle, with all three lines meeting in the centre of the city at three interchange stations. Each interchange station has two halls, one hall for each line. The depth of the stations (and the connecting lines) varies considerably. The deepest station is Náměstí Míru, located under the ground. Parts of the tracks in the city centre were mostly bored using a tunnelling shield. Outer parts were dug by a cut-and-cover method, and these stations are only a few metres under the surface. Part of Line B runs in a glassed-in tunnel above the ground.
Most stations have a single island platform in the centre of the station hall (tunnel) serving bot |
https://en.wikipedia.org/wiki/IBM%208100 | The IBM 8100 Information System, announced Oct. 3, 1978, was at one time IBM’s principal distributed processing engine, providing local processing capability under two incompatible operating systems (DPPX and DPCX) and was a follow-on to the IBM 3790.
The 8100, when used with the Distributed Processing Programming Executive (DPPX), was intended to provide turnkey distributed processing capabilities in a centrally controlled and managed network.
It never saw much success—one anonymous source, according to PC Magazine, called it a "boat anchor"—and became moribund when host-based networks went out of fashion.
This, coupled with IBM's recognition that they had too many hardware and
software systems with similar processing power and function,
led to announcement in March 1986 that the 8100 line
would not be expanded and a new System/370 compatible processor line, ES/9370,
would be provided to replace it.
In March 1987, IBM announced that it intended to provide in 1989
a version of DPPX/SP that would run on the new ES/9370.
A formal announcement followed in March 1988
of DPPX/370, a version of DPPX that executed on the
ES/9370 family of processors.
DPPX/370 was made available to customers in December 1988.
DPCX (Distributed Processing Control eXecutive) was mainly to support a word processing system, Distributed Office Support Facility (DOSF).
Architecture
The 8100 was a 32-bit processor, but its instruction set
reveals its lineage as the culmination of a line of
so-called Universal Controller processors internally designated
UC0 (8-bit), UC.5 (16-bit) and UC1 (32-bit).
Each processor carried along the instruction set and architecture
of the smaller processors,
allowing programs written for a smaller processor to run on a larger one
without change.
The 8100 had another interesting distinction in being one of the first commercially available systems to have a network with characteristics of what we now call local area networks, in particular the mechanism of packet passing. It was called the "8100 Loop" or "R-Loop" and it supported various attached terminals (such as the 3104), printers (such as the free-standing 3268-1) and other devices. Topologically this arranged terminals in a ring, with redundant sets of wires which allowed for a break in the wire to be tolerated simply by "turning back" the data on each side of the break.
The 8100 also supported an "intelligent" terminal called the 8775 (which shared the same case as the 3279 colour display terminal for IBM's mainframes and, like the 3279 was designed at IBM's UK Development Lab at Hursley Park, England) which was the first to ship with the ability to download its functionality from the host computer to which it was attached.
Product range
8130 (various models) - Processor unit
8140 (various models) - Processor unit
8150 (various models) - Processor unit
8101 - External disk unit
8809 - External tape unit
What was notable about the machines was that they were designed to be "office-fr |
https://en.wikipedia.org/wiki/Gams%20%28disambiguation%29 | Gams may be:
Acronyms
General Algebraic Modeling System (GAMS), a mathematical optimization computer program
Guide to Available Mathematical Software (GAMS), a project of the National Institute of Standards and Technology
Graduate of Ayurvedic Medicine and Surgery (GAMS), a degree in Ayurvedic Medicine and Surgery nowadays called BAMS (Bachelor's degree in Ayurvedic Medicine and surgery)
Places
Gams, a municipality of Switzerland
Bad Gams, a municipality of Austria
Gams bei Hieflau, a municipality of Austria
Gams, German name for Kamnica, Maribor, a village northwest of Maribor, Slovenia
People
Helmut Gams, known by the author abbreviation "Gams"
Pius Bonifacius Gams, ecclesiastical historian
Music
"Gams", a song by the Cincinnati blues-rock group The Bronx Kill
Other
plural of Gam (nautical term), a social meeting between ships at sea |
https://en.wikipedia.org/wiki/Wonderfalls | Wonderfalls is an American comedy-drama television series created by Todd Holland and Bryan Fuller that was broadcast on the Fox television network in 2004.
The show centers on Jaye Tyler (Caroline Dhavernas), a recent Brown University graduate with a philosophy degree, who holds a dead-end job as a sales clerk at a Niagara Falls gift shop. Jaye is the reluctant participant in conversations with various animal figurines – a wax lion, brass monkey, stuffed bear, and mounted fish, among others – which direct her via oblique instructions to help people in need.
TV Guide included the series in their 2013 list of 60 shows that were "Cancelled Too Soon".
Cast and characters
Main characters
Jaye Tyler
Caroline Dhavernas as Jaye Tyler – A 24-year-old graduate of Brown University, at the start of the series Jaye is discontentedly working as a sales clerk at Wonderfalls Gift Emporium and living in a trailer. She avoids her loving – and overbearing – family, whose successes she seems determined not to emulate, spending most of her time at The Barrel, a local bar at which her best friend, Mahandra, is a cocktail waitress.
Despite her being extremely caustic and a deliberate underachiever, Jaye's life takes an odd turn when various muses, in the form of animal objects, begin talking to her and delivering cryptic instructions. At first uncooperative, Jaye eventually breaks down after they inflict on her various forms of passive coercion, such as keeping her awake all night by singing, and harassing her with their messages when she is around others, forcing her to accede in order to avoid appearing crazy.
Jaye's attempts to ignore or go against the messages often result in unexpected misfortunes, such as when Jaye's father is hit by a car. Jaye's guilt over the event leads to her following the muses' instructions throughout the rest of the episode, only to discover that her father's injury was, in fact, a blessing, as it led his doctors to discover a potentially life-threatening blood clot. As the series progresses, Jaye becomes more willing to follow the muses' instructions, although she fights them when they make her do things she doesn't like, such as driving Eric back into the arms of his wife.
Through the course of the series, Jaye undergoes a subtle, yet discernible personality shift, as the good deeds she unwillingly performs begin to affect the way she perceives the world around her.
Sharon Tyler
Katie Finneran as Sharon Tyler – The eldest of the Tyler siblings, Sharon is an immigration lawyer and the most ambitious member of the family. Sharon constantly finds herself having to help Jaye – particularly when she has legal trouble – even though there is a strong degree of animosity between the sisters at the start of the series. To Jaye, Sharon is everything she doesn't want to be: goal- and career-oriented, constantly seeking their parents' approval, extremely high-strung, and apparently with little enjoyment of her life. Meanwhile, Jaye's co |
https://en.wikipedia.org/wiki/MD5CRK | In cryptography, MD5CRK was a volunteer computing effort (similar to distributed.net) launched by Jean-Luc Cooke and his company, CertainKey Cryptosystems, to demonstrate that the MD5 message digest algorithm is insecure by finding a collision two messages that produce the same MD5 hash. The project went live on March 1, 2004. The project ended on August 24, 2004 after researchers independently demonstrated a technique for generating collisions in MD5 using analytical methods by Xiaoyun Wang, Feng, Xuejia Lai, and Yu. CertainKey awarded a 10,000 Canadian Dollar prize to Wang, Feng, Lai and Yu for their discovery.
A technique called Floyd's cycle-finding algorithm was used to try to find a collision for MD5. The algorithm can be described by analogy with a random walk. Using the principle that any function with a finite number of possible outputs placed in a feedback loop will cycle, one can use a relatively small amount of memory to store outputs with particular structures and use them as "markers" to better detect when a marker has been "passed" before. These markers are called distinguished points, the point where two inputs produce the same output is called a collision point. MD5CRK considered any point whose first 32 bits were zeroes to be a distinguished point.
Complexity
The expected time to find a collision is not equal to where is the number of bits in the digest output. It is in fact , where is the number of function outputs collected.
For this project, the probability of success after MD5 computations can be approximated by: .
The expected number of computations required to produce a collision in the 128-bit MD5 message digest function is thus:
To give some perspective to this, using Virginia Tech's System X with a maximum performance of 12.25 Teraflops, it would take approximately seconds or about 3 weeks. Or for commodity processors at 2 gigaflops it would take 6,000 machines approximately the same amount of time.
See also
List of volunteer computing projects
Brute force attack
References
Further reading
Cryptographic attacks
Volunteer computing projects |
https://en.wikipedia.org/wiki/2-satisfiability | In computer science, 2-satisfiability, 2-SAT or just 2SAT is a computational problem of assigning values to variables, each of which has two possible values, in order to satisfy a system of constraints on pairs of variables. It is a special case of the general Boolean satisfiability problem, which can involve constraints on more than two variables, and of constraint satisfaction problems, which can allow more than two choices for the value of each variable. But in contrast to those more general problems, which are NP-complete, 2-satisfiability can be solved in polynomial time.
Instances of the 2-satisfiability problem are typically expressed as Boolean formulas of a special type, called conjunctive normal form (2-CNF) or Krom formulas. Alternatively, they may be expressed as a special type of directed graph, the implication graph, which expresses the variables of an instance and their negations as vertices in a graph, and constraints on pairs of variables as directed edges. Both of these kinds of inputs may be solved in linear time, either by a method based on backtracking or by using the strongly connected components of the implication graph. Resolution, a method for combining pairs of constraints to make additional valid constraints, also leads to a polynomial time solution. The 2-satisfiability problems provide one of two major subclasses of the conjunctive normal form formulas that can be solved in polynomial time; the other of the two subclasses is Horn-satisfiability.
2-satisfiability may be applied to geometry and visualization problems in which a collection of objects each have two potential locations and the goal is to find a placement for each object that avoids overlaps with other objects. Other applications include clustering data to minimize the sum of the diameters of the clusters, classroom and sports scheduling, and recovering shapes from information about their cross-sections.
In computational complexity theory, 2-satisfiability provides an example of an NL-complete problem, one that can be solved non-deterministically using a logarithmic amount of storage and that is among the hardest of the problems solvable in this resource bound. The set of all solutions to a 2-satisfiability instance can be given the structure of a median graph, but counting these solutions is #P-complete and therefore not expected to have a polynomial-time solution. Random instances undergo a sharp phase transition from solvable to unsolvable instances as the ratio of constraints to variables increases past 1, a phenomenon conjectured but unproven for more complicated forms of the satisfiability problem. A computationally difficult variation of 2-satisfiability, finding a truth assignment that maximizes the number of satisfied constraints, has an approximation algorithm whose optimality depends on the unique games conjecture, and another difficult variation, finding a satisfying assignment minimizing the number of true variables, is an important test cas |
https://en.wikipedia.org/wiki/CBC%20Radio | CBC Radio is the English-language radio operations of the Canadian Broadcasting Corporation. The CBC operates a number of radio networks serving different audiences and programming niches, all of which (regardless of language) are outlined below.
English
CBC Radio operates three English language networks.
CBC Radio One - Primarily news and information, Radio One broadcasts to most communities across Canada. Until 1997, it was known as "CBC Radio".
CBC Music - Broadcasts an adult music format with a variety of genres, with the classical genre generally restricted to midday hours. From 2007 to 2018, it was known as "CBC Radio 2".
CBC Radio 3 - Broadcasts a youth-oriented indie rock format through the CBC's online radio platform. Some content from Radio 3 was also broadcast as weekend programming on Radio Two until March 2007.
The inconsistency of branding between the word "One" and the numerals "2" and "3" was a deliberate design choice on CBC's part and is not an error, though from 1997 to 2007, CBC Music was known as "CBC Radio Two".
From 1944 to 1962 the CBC's English service operated two radio networks, the main Trans-Canada Network and the Dominion Network. In 1962 the Dominion Network was disbanded and the Trans-Canada Network became known as CBC Radio and in 1997, CBC Radio One. In some cases CBC announcers will still say "CBC Radio" in reference to programs that air only on Radio One.
CBC Music originated in 1960 as the CBC FM network. It was rebranded as CBC Stereo in 1975, and then CBC Radio Two in 1997 before becoming CBC Music in 2018.
In August 2009, CBC Radio launched a mobile app, initially for iOS, featuring streams of the three services, and other web-exclusive stations. In February 2012, the CBC launched a new, similar streaming platform and app known as CBC Music. In October 2019, CBC Music was succeeded by CBC Listen, a new platform that encompasses CBC Radio and CBC Music content, as well as CBC-produced podcasts.
French
The CBC (better known in French as la Société Radio-Canada, or colloquially simply Radio-Canada) also operates three French language radio networks, two of which have a similar programming focus as the corporation's English-language radio networks.
Structurally, the French-language radio operations are managed as part of the CBC's overall French-language services division and therefore have limited ties to the English-language radio networks, which are structured similarly (i.e., there is no overall "CBC Radio" division responsible for both English and French radio).
Ici Radio-Canada Première - News and information.
Ici Musique - Music, arts and culture.
Ici Musique Classique - Classical music service broadcasting online and through HD Radio in Ottawa and Montreal.
CBC North
In the Northwest Territories, Yukon, Nunavut, and northern Quebec, CBC North airs a modified Radio One schedule to accommodate programming in Indigenous languages.
Podcasts
CBC Radio has 14 original podcasts. Two of the podcast |
https://en.wikipedia.org/wiki/STS-29 | STS-29 was the 28th NASA Space Shuttle mission, during which Space Shuttle Discovery inserted a Tracking and Data Relay Satellite (TDRS) into Earth orbit. It was the third shuttle mission following the Challenger disaster in 1986, and launched from Kennedy Space Center, Florida, on March 13, 1989. STS-29R was the eighth flight of Discovery and the 28th Space Shuttle mission overall; its planned predecessor, STS-28, was delayed until August 1989.
The mission was technically designated STS-29R as the original STS-29 designator belonged to STS-61-A, the 22nd Space Shuttle mission. Official documentation and paperwork for that mission contained the designator STS-29 when it was allocated to Space Shuttle Columbia and later as STS-30 when allocated to Challenger. As STS-51-L was designated STS-33, future flights with the STS-26 through STS-33 designators would require the R in their documentation to avoid conflicts in tracking data from one mission to another.
Crew
Crew seating arrangements
Mission summary
Discovery lifted off from Launch Complex 39B, Kennedy Space Center, at 9:57:00 a.m. EST on March 13, 1989. The launch was originally scheduled for February 18, 1989, but was postponed to allow for the replacement of faulty liquid oxygen turbopumps on the three main engines. The amended target date of March 11, 1989, was postponed by 1 day, because of the failure of a master event controller (MEC); #2 when it was powered up during prelaunch checkout, as well as an additional day to replace a faulty fuel preburner oxidizer valve (FPOV). On the rescheduled launch day of March 13, 1989, the launch was delayed for nearly two hours because of ground fog and high upper winds. A waiver was approved for the orbiter's wing loads.
The primary payload was TDRS-D, the third and final component of the Tracking and Data Relay Satellite System (TDRSS) constellation in geosynchronous orbit. The three on-orbit satellites were stationed over the equator at about above Earth; two of them were positioned 130° apart, while the third was located between them as an on-orbit spare.
On Flight Day 1, one of three cryogenic hydrogen tanks which supplied shuttle's electricity-generating fuel cells exhibited erratic pressure fluctuations. It was deactivated while engineers studied the problem, and the crew was told to conserve electrical power. The tank was reactivated on Flight Day 3, March 15, 1989, and operated successfully thereafter.
Discovery landed on March 18, 1989, after orbit 80, one orbit earlier than planned, in order to avoid possible excessive wind buildup expected at the landing site. The shuttle touched down on Runway 22 at Edwards Air Force Base, California, at 9:35|51 a.m. EST. The total mission duration was 4 days, 23 hours, 38 minutes, and 52 seconds.
Payload and experiments
The mission's primary payload was TDRS-D, which became TDRS-4 after deployment, and its attached Inertial Upper Stage (IUS). The satellite was deployed from the shuttle's payl |
https://en.wikipedia.org/wiki/Triad%20%28monitors%29 | In cathode-ray tube (CRT) terms, a triad is a group of 3 phosphor dots coloured red, green, and blue on the inside of the CRT display of a computer monitor or television set. By directing differing intensities of cathode rays onto the 3 phosphor dots, the triad will display a colour by combining the red, green and blue elements. However, triads are not pixels, and multiple triads will form one logical pixel of the displayed image.
In liquid-crystal displays (LCDs), colours are similarly composed of these 3 fundamental colours.
See also
Pixel
Subpixel rendering
Shadow mask
Aperture grille
Display technology
3 (number) |
https://en.wikipedia.org/wiki/English%20Opening | The English Opening is a chess opening that begins with the move:
1. c4
A flank opening, it is the fourth most popular and, according to various databases, one of the four most successful of White's twenty possible first moves. White begins the fight for the by staking a claim to the d5-square from the wing, in hypermodern style. Although many lines of the English have a distinct character, the opening is often used as a transpositional device in much the same way as 1.Nf3 – to avoid such highly regarded responses to 1.d4 as the Nimzo-Indian and Grünfeld Defences – and is considered reliable and flexible.
The English derives its name from the leading 19th century English master Howard Staunton, who played it during his 1843 match with Saint-Amant and at London 1851, the first international tournament. It did not inspire Staunton's contemporaries and caught on only in the twentieth century. It is now recognised as a opening that may be used to reach both classical and hypermodern positions. Mikhail Botvinnik, Tigran Petrosian, Anatoly Karpov, Garry Kasparov, Magnus Carlsen, and Ding Liren have employed it during their world championship matches. Bobby Fischer created a stir when he switched to it from his customary 1.e4 late in his career, employing it against Lev Polugaevsky and Oscar Panno at the Palma de Mallorca Interzonal in 1970, and in his world championship match against Boris Spassky.
Taxonomy
Opening theoreticians who write on the English Opening divide it into three broad categories, generally determined by Black's choice of defensive setup.
Symmetrical Defence: 1...c5
The Symmetrical Defence (classified A30–39 in ECO) is 1...c5, and is so named because both of the c-pawns are advanced two squares, maintaining symmetry. Note that Black can reach the Symmetrical Defence through many move orders by deferring ...c5, and often does. For example, 1.c4 Nf6 2.Nc3 (or 2.Nf3) c5.
Either player may make an early break in the centre with the d-pawn.
Similar to the Open Sicilian, an early d2–d4 for White can arise on the third move in the Symmetrical Defence with 2.Nf3, where Black has chosen one of 2...Nc6, 2...e6, 2...d6, or 2...g6.
After 3.d4, the game usually continues with 3...cxd4 4.Nxd4. The games can give a large variety of positional and tactical ideas, and can transpose into variants of the Open Sicilian involving the Maróczy Bind, such as the Accelerated Dragon, Taimanov, Kan, or Kalashnikov Variations, if White plays e4 in a later move. If Black manages to play d5 before White plays e4, then the game could transpose into variants of the Queen's Gambit Declined.
When Black plays 2...Nf6, these lines are often called the Anti-Benoni, since these positions are often reached after the transposition 1.d4 Nf6 2.c4 c5 3.Nf3, where White avoided the Benoni Defense that would arise after 3.d5. After 3...cxd4 4.Nxd4, Black could follow up with 4...e5 forcing White's knight to go to the queenside and avoiding the transpositions to the S |
https://en.wikipedia.org/wiki/Atlas%20Supervisor | The Atlas Supervisor was the program which managed the allocation of processing resources of Manchester University's Atlas Computer so that the machine was able to act on many tasks and user programs concurrently.
Its various functions included running the Atlas computer's virtual memory (Atlas Supervisor paper, section 3, Store Organisation) and is ‘considered by many to be the first recognisable modern operating system’. Brinch Hansen described it as "the most significant breakthrough in the history of operating systems."
References
Notes
Bibliography
External links
The Atlas Supervisor paper (T Kilburn, R B Payne, D J Howarth, 1962)
1962 software
Discontinued operating systems |
https://en.wikipedia.org/wiki/Westwood%20One%20%281976%E2%80%932011%29 | Westwood One was an American radio network that was based in New York City. At one time, it was managed by CBS Radio, and was later purchased by the private equity firm, The Gores Group. Due to purchases, mergers and other forms of consolidation in the 1980s and 1990s, at one time or another, it had ownership stakes in or syndication rights to some of the most famous brands in network radio, including CBS, NBC, Mutual, CNN, Fox, and Unistar. The company was one of the largest producers and distributors of radio programming in the United States. It broadcast entertainment, news, weather, sports, talk, and traffic programming to about 7,700 radio stations across the United States. The company was the top provider of local traffic reports in the U.S. through its subsidiaries, Metro Networks, Shadow Broadcast Services, SmartRoute Systems, and Sigalert.com. Westwood One also offers weather services; originally using Accuweather, Westwood switched to The Weather Channel in 2009.
Oaktree Capital Management, through its Triton Media Group division, merged with Westwood One in October 2011. Triton then folded Westwood One into its Dial Global subsidiary. The Westwood One name was initially retained for most sports programming. However, starting with the 2011–12 NFL playoffs, Westwood One's sports programming was branded as "Westwood One on the Dial Global Radio Network." After the NFL Playoffs concluded, the Westwood One name was removed altogether in favor of the Dial Global Sports Network, and the sports website was relocated to www.dialglobalsports.com.
On September 4, 2013, Dial Global announced that it was renaming itself Westwood One, citing greater brand recognition.
History
The company was founded by Norman J. Pattiz in 1976. At the time, he was a former advertising sales executive with KCOP-TV, a Los Angeles TV station. He was listening to a local radio station doing a Motown weekend and decided to syndicate The Sound of Motown to radio. The show was a success. He added several more shows during the 1970s, including Dr. Demento and Mary Turner's Off The Record. In 1981 Pattiz started recording live concerts for broadcast with a Chuck Berry performance that January. The company was a leader in live broadcasts and concert recordings for radio until May 2011. By 1982, he was distributing his radio shows via satellite through an arrangement with idb Communications in Culver City. Pattiz took Westwood One public in 1984 and with the money raised by the IPO, he purchased the Mutual Broadcasting System the following year and the NBC Radio Network in 1987. Other highlights in the late 1980s include the purchase of three radio stations, the trade paper Radio & Records, and the hiring of Casey Kasem from ABC.
Although Pattiz long remained a major shareholder and board chairman, control and management shifted to others in the early 1990s. In 1993, operations were shifted to radio station group owner Infinity Broadcasting, headed by Mel Karmazin, who al |
https://en.wikipedia.org/wiki/TV%20Tokyo | JOTX-DTV (channel 7), branded as , is a Japanese television station that serves as the flagship of the TX Network. It is owned and operated by itself a subsidiary of in turn a subsidiary of Nikkei, Inc. It is headquartered in the Sumitomo Fudosan Roppongi Grand Tower in Roppongi, Minato, Tokyo. TV Tokyo is one of the five private broadcasters based in Tokyo.
History
TV Tokyo was established by the Japan Science Foundation in 1951 and started broadcasting, as on April 12, 1964. It took its name from its VHF frequency channel 12. It almost went bankrupt in 1968; on 1 July that year, a limited liability company, Tokyo Channel 12 Production was established with the help of the Nikkei and Mainichi Broadcasting System.
In 1969, the Nikkei and MBS signed a memorandum of understanding which stipulates that Tokyo Channel 12 should share programs with Nihon Educational Television (NET, now TV Asahi). This forms a de facto alliance that lasts until 1975.
In October 1977 Tokyo Channel 12 Production was renamed ; and shortened the channel's name to , dropping "Science TV" from its name. At the same time, the station moved to Shiba Park. A month later, it became a general-purpose TV station along with NET. On April 1, 1978, Tokyo launched a new production company, Softx.
In 1981, it was again renamed, this time to Television Tokyo Channel 12, Ltd. d/b/a TV Tokyo; the current Japanese name of the company was also assumed in the same year.
In 1983, TV Tokyo formed the Mega TON Network (now TX Network) with TV Osaka, and Aichi Television Broadcasting. The company shifted its head offices from Shiba Park to Toranomon in December 1985. On October 4, 1999, Tokyo's production company Softx was renamed TV Tokyo MediaNet. In 2004, TV Tokyo MediaNet was shortened to MediaNet. On June 25, 2004, the company assumed its current English name TV Tokyo Corporation. After the digital transition, the channel began broadcasting on digital channel 7. On November 7, 2016, TV Tokyo moved its headquarters to the new building at Sumitomo Fudosan Roppongi Grand Tower from its old studios in Toranomon. The network initially used a Circle 7-style logo to broadcast animated programs. The station mascot is a cartoon banana with eyes, a nose, and a mouth which is bent into a 7, named Nanana ().
The network is part of the Japan Consortium, which covers the Olympic Games and the FIFA World Cup.
Broadcasting
Digital
Call sign: JOTX-DTV
Remote controller ID 7
Tokyo Skytree: Channel 23
Analog
Analog transmission ceased on 24 July 2011.
Call sign: JOTX-TV
Tokyo Tower: Channel 12
Programming
Related companies
TV Tokyo Holdings ()
BS TV Tokyo ()
TV Tokyo Production ()
TV Tokyo Music ()
PROTX ()
AT-X ()
FM Inter-Wave Inc. ()
IntaracTV ()
Nikkei CNBC ()
TV Tokyo America Inc.
MediaNet (formerly TV Tokyo MediaNet & Softx)
Shogakukan-Shueisha Productions Co., Ltd. (formerly Shogakukan Productions Co., Ltd.)
See also
Television in Japan
AT-X
Notes
References
External li |
https://en.wikipedia.org/wiki/List%20of%20United%20States%20radio%20networks | The following is a list of commercial radio broadcasters and radio networks in the United States.
Table of broadcasters and networks
Major English-language commercial broadcasters and networks
Other commercial radio broadcasters and networks
American Urban Radio Networks
Associated Press Radio Network
Bloomberg Radio
Business Talk Radio Network
Lifestyle Talk Radio Network
Cable Radio Network
Clear Media Network
Chinese Radio Network (Mandarin)
Compass Media Networks
Walt Disney Television
Radio Disney
Envision Networks
ESPN, Inc.
ESPN Radio
ESPN Deportes Radio
Genesis Communications Network
Gen Media Partners
HRN Media (Hispanic/ Multi-Cultural Radio Network)
Sun Broadcast Group
IMG Worldwide
IMG College (consisting of 76 individual radio networks)
ISP Sports
MRN Radio (Motor Racing Network)
MannGroup Radio Services
Music of Your Life (formerly distributed by Jones Radio Network)
Northern Broadcasting System
Performance Racing Network
Progressive Radio Network
Radio America
RadioLinx Broadcast Marketing
REACH Media
Rockcastle Media Networks
Salem Media Group
Salem Radio Network
Skyview Networks
ABC News Radio
CBS News Radio
Spanish Broadcasting System
Sports Byline USA
Sports Radio America
Superadio
Syndication Networks
Talk Media Network
Talk Radio Network
Tom Kent Radio Network
United Stations Radio Networks
Univision Radio (Spanish-language radio network, owned by Univision)
USA Radio Network
State commercial networks
Alabama Radio Network, a subsidiary of iHeartMedia.
Arizona News Radio, a subsidiary of Skyview Networks.
Arkansas Radio Network, a subsidiary of Cumulus Media
California Headline News, a subsidiary of Skyview Networks
Cowboy State News Network, a subsidiary of Montgomery Broadcasting L.L.C. (owner of KFBC in Cheyenne, WY)
Florida News Network, a subsidiary of iHeartMedia.
Georgia News Network, a subsidiary of iHeartMedia.
Illinois Radio Network, a subsidiary of the Franklin Center for Government and Public Integrity.
Network Indiana, a subsidiary of Emmis Communications.
Radio Iowa, a subsidiary of Learfield Communications.
Kansas Information Network, a subsidiary of Morris Communications.
Kansas Agriculture Network, a subsidiary of Morris Communications.
Kentucky News Network, a subsidiary of iHeartMedia.
Louisiana Radio Network.
Michigan Media Network.
Michigan Talk Network, a subsidiary of Townsquare Media.
Millennium News Network (serving New Jersey), a subsidiary of WKXW.
Minnesota News Network, a subsidiary of Learfield Communications.
Mississippi News Network, a subsidiary of TeleSouth Communications.
Missouri Net, a subsidiary of Learfield Communications.
Northern News Network of Montana, a subsidiary of Northern Broadcasting System.
Nebraska Radio Network, a subsidiary of Learfield Communications.
North Carolina News Network, a subsidiary of Curtis Media Group.
Dakota News Network of North and South Dakota, a subsidiary of Midwest Information Sys |
https://en.wikipedia.org/wiki/Program%20synthesis | In computer science, program synthesis is the task to construct a program that provably satisfies a given high-level formal specification. In contrast to program verification, the program is to be constructed rather than given; however, both fields make use of formal proof techniques, and both comprise approaches of different degrees of automatization. In contrast to automatic programming techniques, specifications in program synthesis are usually non-algorithmic statements in an appropriate logical calculus.
Origin
During the Summer Institute of Symbolic Logic at Cornell University in 1957, Alonzo Church defined the problem to synthesize a circuit from mathematical requirements. Even though the work only refers to circuits and not programs, the work is considered to be one of the earliest descriptions of program synthesis and some researchers refer to program synthesis as "Church's Problem". In the 1960s, a similar idea for an "automatic programmer" was explored by researchers in artificial intelligence.
Since then, various research communities considered the problem of program synthesis. Notable works include the 1969 automata-theoretic approach by Büchi and Landweber, and the works by Manna and Waldinger (c. 1980). The development of modern high-level programming languages can also be understood as a form of program synthesis.
21st century developments
The early 21st century has seen a surge of practical interest in the idea of program synthesis in the formal verification community and related fields. Armando Solar-Lezama showed that it is possible to encode program synthesis problems in Boolean logic and use algorithms for the Boolean satisfiability problem to automatically find programs. In 2013, a unified framework for program synthesis problems was proposed by researchers at UPenn, UC Berkeley, and MIT. Since 2014 there has been a yearly program synthesis competition comparing the different algorithms for program synthesis in a competitive event, the Syntax-Guided Synthesis Competition or SyGuS-Comp. Still, the available algorithms are only able to synthesize small programs.
The framework of Manna and Waldinger
The framework of Manna and Waldinger, published in 1980, starts from a user-given first-order specification formula. For that formula, a proof is constructed, thereby also synthesizing a functional program from unifying substitutions.
The framework is presented in a table layout, the columns containing:
A line number ("Nr") for reference purposes
Formulas that already have been established, including axioms and preconditions, ("Assertions")
Formulas still to be proven, including postconditions, ("Goals"),
Terms denoting a valid output value ("Program")
A justification for the current line ("Origin")
Initially, background knowledge, pre-conditions, and post-conditions are entered into the table. After that, appropriate proof rules are applied manually. The framework has been designed to enhance human readability of int |
https://en.wikipedia.org/wiki/The%20Order | The Order may refer to:
Comics
The Order (comics), the name of two fictional comic-book superhero teams in the Marvel Comics universe
Computer and video games
The Order: 1886, a video game
The Order, a fictional terrorist faction in the video game Freelancer (2003)
The Order (Deus Ex), a fictional pseudo-religious organization in the computer game Deus Ex: Invisible War (2003)
The Order, a fictional religious group in the video-game franchise Silent Hill (1999, first in series)
Film and television
The Order (2001 film), a 2001 film directed by Sheldon Lettich; written by and starring Jean-Claude Van Damme
The Order (2003 film) (also known as The Sin Eater), a 2003 film written and directed by Brian Helgeland; starring Heath Ledger
The Order (2016 short), a 2016 short film starring a part of the cast of Mighty Morphin Power Rangers
The Order (TV series), an American horror-drama web television series from Netflix
Organizations
Davis County Cooperative Society, as the Kingston clan calls itself, "The Order", a Mormon organization
Kappa Alpha Order, a fraternity also known as "the Order".
The Order (white supremacist group), a white-nationalist organization active in the United States between 1983 and 1984.
See also
Order (disambiguation) |
https://en.wikipedia.org/wiki/Identification%20key | In biology, an identification key, taxonomic key, or biological key is a printed or computer-aided device that aids the identification of biological entities, such as plants, animals, fossils, microorganisms, and pollen grains. Identification keys are also used in many other scientific and technical fields to identify various kinds of entities, such as diseases, soil types, minerals, or archaeological and anthropological artifacts.
Traditionally identification keys have most commonly taken the form of single-access keys. These work by offering a fixed sequence of identification steps, each with multiple alternatives, the choice of which determines the next step. If each step has only two alternatives, the key is said to be dichotomous, else it is polytomous. Modern multi-access or interactive keys allow the user to freely choose the identification steps and their order.
At each step, the user must answer a question about one or more features (characters) of the entity to be identified. For example, a step in a botanical key may ask about the color of flowers, or the disposition of the leaves along the stems. A key for insect identification may ask about the number of bristles on the rear leg.
Principles of good key design
Identification errors may have serious consequences in both pure and applied disciplines, including ecology, medical diagnosis, pest control, forensics, etc. Therefore, identification keys must be constructed with great care in order to minimize the incidence of such errors.
Whenever possible, the character used at each identification step should be diagnostic; that is, each alternative should be common to all members of a group of entities, and unique to that group. It should also be differential, meaning that the alternatives should separate the corresponding subgroups from each other. However, characters which are neither differential nor diagnostic may be included to increase comprehension (especially characters that are common to the group, but not unique).
Whenever possible, redundant characters should be used at each step. For example, if a group is to be split into two subgroups, one characterized by six black spots and the other by four brown stripes, the user should be queried about all three characters (number, shape, and color of the markings) — even though any single one of them would be sufficient in theory. This redundancy improves the reliability of identification, provides a consistency check against user errors, and allows the user to proceed even if some of the characters could not be observed. In this case, the characters should be ordered according to their reliability and convenience. Further error tolerance can be achieved by using reticulation.
The terminology used in the identification steps should be consistent in meaning and should be uniformly used. The use of alternative terms for the same concept to achieve more "lively prose" should be avoided. Positive statements should be used in |
https://en.wikipedia.org/wiki/Critical%20path | Critical path may refer to:
The longest series of sequential operations in a parallel computation; see analysis of parallel algorithms
Critical path method, an algorithm for scheduling a set of project activities
Critical path drag, a project management metric
Critical path network diagram, a network diagram highlighting the critical path
Critical Path (book), by Buckminster Fuller
The Critical Path: An Essay on the Social Context of Literary Criticism, a 1971 book by Northrop Frye
The Critical Path, a podcast by Horace Dediu
Critical Path (video game), an interactive movie computer game
Critical Path, Inc., a provider of messaging services
Critical Path Institute, an organization for improvement of the drug development process
Critical Path Project, a video archive
Critical Path Project, early source of HIV/AIDS information founded by Kiyoshi Kuromiya
See also
Critical graph, a graph where every vertex or edge is a critical element
Critical mass (disambiguation)
Critical point (disambiguation) |
https://en.wikipedia.org/wiki/Trans%E2%80%93Asian%20railway | The Trans-Asian Railway (TAR) is a project to create an integrated freight railway network across Europe and Asia. The project is of the United Nations Economic and Social Commission for Asia and the Pacific (UNESCAP).
The project was initiated in the 1950s, with the objective of providing a continuous rail link between Singapore and Istanbul, Turkey, with possible further connections to Europe and Africa. At the time shipping and air travel were not as well developed, and the project promised to significantly reduce shipping times and costs between Europe and Asia. Progress in developing the TAR was hindered by political and economic obstacles throughout the 1960s, 1970s and early 1980s. By the 1990s, the end of the Cold War and normalisation of relations between some countries improved the prospects for creating a rail network across the Asian continent.
The TAR was seen as a way to accommodate the huge increases in international trade between Eurasian nations and facilitate the increased movements of goods between countries. It was also seen as a way to improve the economies and accessibility of landlocked countries like Laos, Afghanistan, Mongolia, and the Central Asian republics.
Much of the railway network already exists as part of the Eurasian Land Bridge, although significant gaps remain. A big challenge is the differences in rail gauge across Eurasia. Four major rail gauges (which measures the distance between rails) are in use across the continent: most of Europe, as well as Turkey, Iran, China, and the Koreas use the gauge, known as Standard gauge; Russia and the former Soviet republics use a gauge; Finland uses a gauge, both known as Russian gauge; the railways in India, Pakistan, Bangladesh and Sri Lanka use the gauge, known as Indian gauge; and most of Southeast Asia has metre gauge. For the most part the TAR would not change national gauges; mechanized transfer facilities would be built to transload shipping containers from train to train at the breaks of gauge.
Routes
By 2001, four corridors had been studied:
The Northern Corridor will link Europe and Northeast Asia via Germany, Poland, Belarus, Russia, Kazakhstan, Mongolia, China, North Korea and South Korea, with breaks of gauge at the Polish-Belarusian border ( to ), the Kazakhstan-Chinese border and the Mongolian-Chinese border (both to ). The Trans-Siberian Railway covers much of this route and currently carries large amounts of freight from East Asia to Moscow and on to the rest of Europe. Due to political problems with North Korea, freight from South Korea must currently be shipped by sea to the port of Vladivostok to access the route.
The Southern Corridor, also called ITI-DKD-Y (Istanbul-Tehran-Islamabad-Delhi-Kolkata-Dhaka-Yangon), will go from Europe to Southeast Asia, connecting Turkey, Iran, Pakistan, India, Bangladesh, Myanmar, and Thailand, with links to China's Yunnan Province and, via the Southeast Asian corridor, to Malaysia and Singapore. |
https://en.wikipedia.org/wiki/Super%20Bowl%20XXXVIII%20halftime%20show%20controversy | The Super Bowl XXXVIII halftime show, which was broadcast live on February 1, 2004, from Houston, Texas, on the CBS television network, is notable for a moment in which Janet Jackson's right breast—adorned with a nipple shield—was exposed by Justin Timberlake to the viewing public. The incident, sometimes referred to as Nipplegate or Janetgate, led to an immediate crackdown and widespread discourse on perceived indecency in broadcasting.
The halftime show was produced by MTV and was focused on the network's Choose or Lose campaign (the year 2004 was a presidential election year in the United States). The exposure was broadcast to a total audience of 150 million viewers. Following the incident, the National Football League (NFL) excluded MTV, which had also produced the halftime show for Super Bowl XXXV, from future halftime shows. In addition, CBS parent company Viacom and its co-owned subsidiaries, MTV and Infinity Broadcasting, enforced a blacklist of Jackson's singles and music videos on many radio formats and music channels worldwide. The Federal Communications Commission (FCC) fined CBS for an indecency violation of $27,500 and increased it to $325,000. They eventually fined CBS a record $550,000 for the incident, but that fine was ultimately voided by the Third Circuit Court of Appeals in 2011, and a case to reinstate the fine was refused in 2012.
The incident was ridiculed both within the United States and abroad, with a number of commentators opining that it was a planned publicity stunt. Some American commentators, including Jackson herself, argued it was being used as a means to distract the public from the ongoing Iraq War. The increased regulation of broadcasting raised concerns regarding censorship and free speech in the United States. YouTube co-founder Jawed Karim credits the incident with leading to the creation of the video sharing website. The incident also made Janet Jackson the most-searched person and term of 2004 and 2005, and it broke the record for "most-searched event over one day". It also became the most-watched, recorded, and replayed television moment in TiVo history and "enticed an estimated 35,000 new [TiVo] subscribers to sign up". The term "wardrobe malfunction" was coined as a result of the incident, and eventually added to the Merriam-Webster's Collegiate Dictionary.
In April 2021, celebrity stylist Wayne Scot Lukas claimed that it was planned by Timberlake, who sought to upstage his ex-girlfriend Britney Spears' MTV Video Music Awards appearance at which she kissed Madonna. In 2015, Lukas had stated that he was not aware of what happened with Timberlake. In 2018, USA Today reported Lukas was seen purchasing a sunburst nipple shield from Byriah Dailey the weekend prior to the Super Bowl, telling Dailey "OK, watch the halftime show. There's going to be a surprise at the end."
Background and development
Janet Jackson was the original choice to perform at the halftime show for Super Bowl XXXVI, but the NFL ulti |
https://en.wikipedia.org/wiki/Reduce%20%28computer%20algebra%20system%29 | Reduce is a general-purpose computer algebra system geared towards applications in physics.
The development of the Reduce computer algebra system was started in the 1960s by Anthony C. Hearn. Since then, many scientists from all over the world have contributed to its development under his direction.
Reduce is written entirely in its own LISP dialect called Portable Standard Lisp, expressed in an ALGOL-like syntax called RLISP. The latter is used as a basis for Reduce's user-level language.
Implementations of Reduce are available on most variants of Unix, Linux, Microsoft Windows, or Apple Macintosh systems by using an underlying Portable Standard Lisp or Codemist Standard LISP implementation. The Julia package Reduce.jl uses Reduce as a backend and implements its semantics in Julia style.
Reduce was open sourced in December 2008 and is available for free under a modified BSD license on SourceForge. Previously it had cost $695.
See also
Comparison of computer algebra systems
ALTRAN
REDUCE Meets CAMAL - REDUCE Computer Algebra System - J. P. Fitch
References
External links
Reduce wiki on SourceForge.
Anthony C. Hearn, Reduce User's Manual Version 3.8, February 2004. In HTML format.
Anthony C. Hearn, "Reduce: The First Forty Years", invited paper presented at the A3L Conference in Honor of the 60th Birthday of Volker Weispfenning, April 2005.
Andrey Grozin, "TeXmacs-Reduce interface", April 2012.
Computer algebra system software for Linux
Computer algebra systems
Formerly proprietary software
Free computer algebra systems
Free software programmed in Lisp
Software using the BSD license |
https://en.wikipedia.org/wiki/CGC | CGC may stand for:
Companies
Computer generated character
Co-operative Grocer Chain Japan, known as CGC Japan
Cambridge Gliding Centre
Canada Games Centre
Canada Games Company
Canopy Growth Corporation, medical marijuana company in Smiths Falls, Ontario
Capital Group Companies, an investment management organization
Certified Guaranty Company, a grading service for the comic book collecting industry
CGCOC Group, a Chinese construction company
China Geo-Engineering Corporation
Science
Cerebellar granule cell
Constrained geometry complex, a kind of catalyst
Color-glass condensate, a type of matter theorized to exist in atomic nuclei traveling near the speed of light
DARPA's Cyber Grand Challenge, a competition among completely-automatic hacking systems
CGC, a codon for the amino acid arginine
Other
Chen Guangcheng, also known as the "Blind Lawyer", is a Chinese civil rights activist
Commonwealth Grants Commission
Consumer generated content, also known as Consumer generated media
Canine Good Citizen, certification
Conspicuous Gallantry Cross, a military decoration of the British Armed Forces
United States Coast Guard Cutter
Certified general contractor, a type of unlimited contractor in Florida as opposed to registered (limited)
Board-Certified Genetic Counselor
Camparini Gioielli Cup, a professional tennis tournament
CB Gran Canaria, professional basketball club based in Las Palmas, Spain |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Tennessee | The following is a list of FCC-licensed radio stations in the U.S. state of Tennessee, which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
Defunct
W4XA
WCLC
WEMG, Knoxville
WFWL
WHER, Memphis
WLYY
WMRO
WNTT
WOCV
WSM-FM (1941–1951)
WTNW
WUTS
WUTZ
WXOQ
See also
Tennessee media
List of newspapers in Tennessee
List of television stations in Tennessee
Media of cities in Tennessee: Chattanooga, Knoxville, Memphis, Murfreesboro, Nashville
References
Bibliography
(About WDIA)
External links
(Directory ceased in 2017)
Tennessee Association of Broadcasters
Images
Tennessee
Radio |
https://en.wikipedia.org/wiki/Visual%20programming%20language | In computing, a visual programming language (visual programming system, VPL, or, VPS) or block coding is a programming language that lets users create programs by manipulating program elements graphically rather than by specifying them textually. A VPL allows programming with visual expressions, spatial arrangements of text and graphic symbols, used either as elements of syntax or secondary notation. For example, many VPLs (known as diagrammatic programming) are based on the idea of "boxes and arrows", where boxes or other screen objects are treated as entities, connected by arrows, lines or arcs which represent relations.
Definition
VPLs may be further classified, according to the type and extent of visual expression used, into icon-based languages, form-based languages, and diagram languages. Visual programming environments provide graphical or iconic elements which can be manipulated by users in an interactive way according to some specific spatial grammar for program construction.
The general goal of VPLs is to make programming more accessible to novices and to support programmers at three different levels
Syntax: VPLs use icons/blocks, forms and diagrams trying to reduce or even eliminate the potential of syntactic errors helping with the arrangement of programming primitives to create well-formed programs.
Semantics: VPLs may provide some mechanisms to disclose the meaning of programming primitives. This could include help functions providing documentation functions built-in to programming languages.
Pragmatics: VPLs support the study of what programs mean in particular situations. This level of support allows users to put artifacts created with a VPL into a certain state in order to explore how the program will react to that state. Examples: In AgentSheets or AgentCubes users can set games or simulations into a particular state in order to see how program would react. With the Thymio programming language users can bring a robot into a certain state in order to see how it will react, i.e., which sensors will be activated.
Current developments try to integrate the visual programming approach with dataflow programming languages to either have immediate access to the program state, resulting in online debugging, or automatic program generation and documentation. Dataflow languages also allow automatic parallelization, which is likely to become one of the greatest programming challenges of the future.
The Visual Basic, Visual C#, Visual J# etc. languages of the Microsoft Visual Studio IDE are not visual programming languages: the representation of algorithms etc. is textual even though the IDE embellishes the editing and debugging activities with a rich user interface. A similar consideration applies to most other rapid application development environments which typically support a form designer and sometimes also have graphical tools to illustrate (but not define) control flow and data dependencies.
Parsers for visual programming la |
https://en.wikipedia.org/wiki/Enigma | Enigma may refer to:
Riddle, someone or something that is mysterious or puzzling
Biology
ENIGMA, a class of gene in the LIM domain
Computing and technology
Enigma (company), a New York–based data-technology startup
Enigma machine, a family of German electro-mechanical encryption machines
Enigma, the codename for Red Hat Linux 7.2
Enigma (DVB), the second generation of Enigma software
Film
Enigma (1982 film), a film starring Martin Sheen and Sam Neill
Enigma (2001 film), a film adapted from the Robert Harris novel
Enigma (2009 film), a short film by the Shumway Brothers
Literature
Enigma (novel), a 1995 novel by Robert Harris
Enigma (DC Comics), a DC Comics character
Enigma (Marvel Comics), a Marvel Comics character
Enigma (Vertigo), a title published by DC's imprint Vertigo
Enigma (manga), a 2010 manga published in Weekly Shōnen Jump
Enigma Cipher, a series from Boom! Studios
Enigma, a novel in The Trigon Disunity series by Michael P. Kube-McDowell
"Enigma" and "An Enigma", two poems by Edgar Allan Poe
The Riddler, DC comics character whose full name abbreviates to E. Nigma
Music
Enigma (German band), an electronic music project founded by Michael Cretu
Enigma (British band), a 1980s band
Enigma Records, an American rock and alternative record label in the 1980s
Enigma Variations, 14 variations composed by Edward Elgar
Albums
Enigma (Ill Niño album) (2008)
Enigma (Tak Matsumoto album) (2016)
Enigma (Keith Murray album) (1996)
Enigma (Aeon Zen album) (2013)
Songs
"Enigma (Give a Bit of Mmh to Me)", 1978, by Amanda Lear
"Enigma", 2007, by Amorphis from Silent Waters
"Enigma", 2002, by Trapt from Trapt
"Enigma", 2014, by Within the Ruins from Phenomena
"Enigma", 2020, by Lady Gaga from Chromatica
Places
Enigma, Georgia
Enigma, Tennessee
Enigma Peak, a mountain in Palmer Land, Antarctica
Television
Enigma (Derren Brown), a televised tour show
Enigma (Canadian TV series), a Biography Channel TV series
Enigma (Thai TV series), a television drama series
"Enigma" (NCIS), an episode of NCIS
"Enigma" (Stargate SG-1), an episode of Stargate SG-1
Enigma, a character from Nip/Tuck
Transport
Enigma (yacht), a private superyacht
Dynamic Sport Enigma, a Polish paraglider design
Enigma Motorsport, a British motor-racing team
Video games
Enigma (1998 video game)
Enigma (2007 video game)
Enigma: Rising Tide, a 2003 video game
Enigma, a character from Dota 2
"The Enigma", an episode of the video game Batman: The Enemy Within
Other uses
The Enigma (Doré), a 1871 painting by Gustave Doré
The Enigma (performer), American
Enigma (roller coaster), Pleasurewood Hills, Suffolk, England
Copenhagen Post & Tele Museum (Enigma - Museum for Post, Tele og Kommunikation), the national Danish postal museum
The Enigma, a monthly publication of the National Puzzlers' League
Enigma, mathematical puzzles published in New Scientist 1979–2013
The Enigma (diamond), the world's largest cut diamond
See also
Ænigma (disambiguation)
Enigmata (disambiguation)
Enigmatic (disam |
https://en.wikipedia.org/wiki/On-Line%20Encyclopedia%20of%20Integer%20Sequences | The On-Line Encyclopedia of Integer Sequences (OEIS) is an online database of integer sequences. It was created and maintained by Neil Sloane while researching at AT&T Labs. He transferred the intellectual property and hosting of the OEIS to the OEIS Foundation in 2009. Sloane is the chairman of the OEIS Foundation.
OEIS records information on integer sequences of interest to both professional and amateur mathematicians, and is widely cited. , it contains over 360,000 sequences, making it the largest database of its kind.
Each entry contains the leading terms of the sequence, keywords, mathematical motivations, literature links, and more, including the option to generate a graph or play a musical representation of the sequence. The database is searchable by keyword, by subsequence, or by any of 16 fields.
History
Neil Sloane started collecting integer sequences as a graduate student in 1964 to support his work in combinatorics. The database was at first stored on punched cards. He published selections from the database in book form twice:
A Handbook of Integer Sequences (1973, ), containing 2,372 sequences in lexicographic order and assigned numbers from 1 to 2372.
The Encyclopedia of Integer Sequences with Simon Plouffe (1995, ), containing 5,488 sequences and assigned M-numbers from M0000 to M5487. The Encyclopedia includes the references to the corresponding sequences (which may differ in their few initial terms) in A Handbook of Integer Sequences as N-numbers from N0001 to N2372 (instead of 1 to 2372.) The Encyclopedia includes the A-numbers that are used in the OEIS, whereas the Handbook did not.
These books were well received and, especially after the second publication, mathematicians supplied Sloane with a steady flow of new sequences. The collection became unmanageable in book form, and when the database had reached 16,000 entries Sloane decided to go online—first as an email service (August 1994), and soon after as a website (1996). As a spin-off from the database work, Sloane founded the Journal of Integer Sequences in 1998.
The database continues to grow at a rate of some 10,000 entries a year.
Sloane has personally managed 'his' sequences for almost 40 years, but starting in 2002, a board of associate editors and volunteers has helped maintain the database.
In 2004, Sloane celebrated the addition of the 100,000th sequence to the database, , which counts the marks on the Ishango bone. In 2006, the user interface was overhauled and more advanced search capabilities were added. In 2010 an OEIS wiki at OEIS.org was created to simplify the collaboration of the OEIS editors and contributors. The 200,000th sequence, , was added to the database in November 2011; it was initially entered as A200715, and moved to A200000 after a week of discussion on the SeqFan mailing list, following a proposal by OEIS Editor-in-Chief Charles Greathouse to choose a special sequence for A200000. A300000 was defined in February 2018, and by end of July 20 |
https://en.wikipedia.org/wiki/Caps | Caps are flat headgear.
Caps or CAPS may also refer to:
Science and technology
Computing
CESG Assisted Products Service, provided by the U.K. Government Communications Headquarters
Composite Application Platform Suite, by Java Caps, a Java framework
Computer Animation Production System, a film animation post-production system developed by Walt Disney Feature Animation and Pixar
Biology, medicine and psychology
Genetics
Calcyphosin, the CAPS gene and its protein
Cleaved amplified polymorphic sequence, markers used to detect a polymorphic sequence
Medical conditions
Auditory processing disorder (APD), formerly Central Auditory Processing Syndrome
Catastrophic antiphospholipid syndrome
Cryopyrin-associated periodic syndrome, a spectrum of autoinflammatory syndrome
Other uses in biology, medicine and psychology
CAPS (buffer), N-cyclohexyl-3-aminopropanesulfonic acid, in biochemistry, a buffering agent
Cognitive-affective personality system, a model within psychology of personality
Other uses in science and technology
Cassini Plasma Spectrometer, a direct sensing instrument that measures the energy and electrical charge of particles
Cirrus Airframe Parachute System, a whole-aircraft emergency parachute system developed by Ballistic Recovery Systems and Cirrus
Collective Awareness Platforms for Sustainability and Social Innovation, a program of the European Commission
Companies and organizations
Californians for Population Stabilization
Captive Animals Protection Society
Center for Advanced Public Safety at the University of Alabama
Center for Analysis and Prediction of Storms
Comic Art Professional Society
Policy Planning Staff (France), Centre d'Analyse, de Prévision et de Stratégie
Sport
Caps (gamer), Danish esports player
Cap (sport), a measure of a player's international appearances, especially in football
Washington Capitals, an American ice hockey team
Other uses
Caps (party), an 18th-century Swedish political faction
All caps, formatting text to only use capital/uppercase letters
Caps, Texas, Taylor County, Texas, U.S.
Chicago Alternative Policing Strategy, a government program in Illinois, U.S.
See also
Cap (disambiguation)
Capps (disambiguation)
St. John's IceCaps, an AHL team
Raleigh IceCaps, an ECHL team |
https://en.wikipedia.org/wiki/Compositional%20data | In statistics, compositional data are quantitative descriptions of the parts of some whole, conveying relative information. Mathematically, compositional data is represented by points on a simplex. Measurements involving probabilities, proportions, percentages, and ppm can all be thought of as compositional data.
Ternary plot
Compositional data in three variables can be plotted via ternary plots. The use of a barycentric plot on three variables graphically depicts the ratios of the three variables as positions in an equilateral triangle.
Simplicial sample space
In general, John Aitchison defined compositional data to be proportions of some whole in 1982. In particular, a compositional data point (or composition for short) can be represented by a real vector with positive components. The sample space of compositional data is a simplex:
The only information is given by the ratios between components, so the information of a composition is preserved under multiplication by any positive constant. Therefore, the sample space of compositional data can always be assumed to be a standard simplex, i.e. . In this context, normalization to the standard simplex is called closure and is denoted by :
where D is the number of parts (components) and denotes a row vector.
Aitchison geometry
The simplex can be given the structure of a real vector space in several different ways. The following vector space structure is called Aitchison geometry or the Aitchison simplex and has the following operations:
Perturbation
Powering
Inner product
Under these operations alone, it is sufficient to show that the Aitchison simplex forms a -dimensional Euclidean vector space.
Orthonormal bases
Since the Aitchison simplex forms a finite dimensional Hilbert space, it is possible to construct orthonormal bases in the simplex. Every composition can be decomposed as follows
where forms an orthonormal basis in the simplex. The values are the (orthonormal and Cartesian) coordinates of with respect to the given basis. They are called isometric log-ratio coordinates .
Linear transformations
There are three well-characterized isomorphisms that transform from the Aitchison simplex to real space. All of these transforms satisfy linearity and as given below
Additive logratio transform
The additive log ratio (alr) transform is an isomorphism where . This is given by
The choice of denominator component is arbitrary, and could be any specified component.
This transform is commonly used in chemistry with measurements such as pH. In addition, this is the transform most commonly used for multinomial logistic regression. The alr transform is not an isometry, meaning that distances on transformed values will not be equivalent to distances on the original compositions in the simplex.
Center logratio transform
The center log ratio (clr) transform is both an isomorphism and an isometry where
Where is the geometric mean of . The inverse of this fu |
https://en.wikipedia.org/wiki/Mac%20OS%20X%2010.1 | Mac OS X 10.1 (code named Puma) is the second major release of macOS, Apple's desktop and server operating system. It superseded Mac OS X 10.0 and preceded Mac OS X Jaguar. Mac OS X 10.1 was released on September 25, 2001, as a free update for Mac OS X 10.0 users.
The operating system was handed out for no charge by Apple employees after Steve Jobs' keynote speech at the Seybold publishing conference in San Francisco. It was subsequently distributed to Mac users on October 25, 2001, at Apple Stores and other retail stores that carried Apple products.
Mac OS X 10.1 was codenamed "Puma" because the internal team thought it was "one fast cat."
System requirements
Supported computers:
Power Mac G3
Power Mac G4
Power Mac G4 Cube
iMac G3
iMac G4, 2002 version only
eMac, 2002 version only
PowerBook G3, except for the original PowerBook G3
PowerBook G4
iBook
RAM:
128 megabytes (MB) (unofficially 64 MB minimum)
Hard Drive Space:
1.5 gigabytes (GB)
Features
Apple introduced many features that were missing from the previous version, as well as improving overall system performance.
This system release brought some major new features to the Mac OS X platform:
Performance enhancements — Mac OS X 10.1 introduced large performance increases throughout the system.
Easier CD and DVD burning — better support in Finder as well as in iTunes
DVD playback support — DVDs can be played in Apple DVD Player
More printer support (200 printers supported out of the box) — One of the main complaints of version 10.0 users was the lack of printer drivers, and Apple attempted to remedy the situation by including more drivers, although many critics complained that there were still not enough.
Faster 3D (OpenGL performs 20% faster) — The OpenGL drivers and handling were vastly improved in this version of Mac OS X, which created a large performance gap for 3D elements in the interface, and 3D applications.
Improved AppleScript — The scripting interface now allows scripting access to many more system components, such as the Printer Center, and Terminal, thus improving the customizability of the interface. As well, Apple introduced AppleScript Studio, which allows a user to create full AppleScript applications in a simple graphical interface.
Improved filehandling - The Finder was enhanced to optionally hide file extensions on a per-file basis. The Cocoa API was enhanced to allow developers to set traditional Mac type and creator information directly without relying on Carbon to do it.
ColorSync 4.0, the color management system and API.
Image Capture, for acquiring images from digital cameras and scanners.
Menu Extras, a set of items the user can add to the system menu, replacing the supplied Dock Extras from Mac OS X 10.0 Cheetah.
Apple switched to using Mac OS X as the default on all then-new Macs with the 10.1.2 release.
Applications found on Mac OS X 10.1 Puma
Address Book
AppleScript
Calculator
Chess
Clock
CPU Monitor
DVD Player
Image Capture
iMovie
Internet Connect
Inter |
https://en.wikipedia.org/wiki/Mac%20OS%20X%2010.0 | Mac OS X 10.0 (code named Cheetah) is the first major release of Mac OS X, Apple's desktop and server operating system. It was released on March 24, 2001, for a price of $129 after a public beta.
Mac OS X was Apple's successor to the classic Mac OS. It was derived from NeXTSTEP and FreeBSD, and featured a new user interface called Aqua, as well as improved stability and security due to its new Unix foundations. It introduced the Quartz graphics rendering engine for hardware-accelerated animations. Many technologies were ported from the classic Mac OS, including Sherlock and the QuickTime framework. The core components of Mac OS X were open sourced as Darwin.
Boxed releases of Mac OS X 10.0 also included a copy of Mac OS 9.1, which can be installed alongside Mac OS X 10.0, through the means of dual booting (which meant that reboots are required for switching between the two OSes). This was important for compatibility reasons; while many Mac OS 9 applications could be run under Mac OS X in the Classic environment, some, such as applications that directly accessed hardware, could only run under Mac OS 9.
Six months after its release, Mac OS X 10.0 was succeeded by Mac OS X 10.1, code named Puma.
Development
The development of Mac OS X 10.0 began in 1998, after Apple acquired NeXT Computer, which was founded by Steve Jobs after he left Apple in the mid-1980s.
The initial development of Mac OS X was led by Avie Tevanian, who had previously worked at NeXT and had played a key role in the development of NeXTSTEP. The development team faced significant challenges in merging the classic Mac OS with the new Unix-based architecture, as well as in creating a modern user interface that would be familiar to Mac users.
Mac OS X 10.0 was released to the public on March 24, 2001, after several months of beta testing. The release was met with mixed reviews, with some users praising the new features and stability, while others criticized the lack of compatibility with older Mac applications.
Some of the key features of Mac OS X 10.0 included the Aqua user interface, which introduced translucent menus, drop shadows, and other visual effects; the Dock, a new way of launching and switching between applications; and a new file system called HFS+. The operating system also included built-in support for networking protocols such as TCP/IP and PPP, as well as for USB and FireWire devices.
In the years following the release of Mac OS X 10.0, Apple continued to refine and improve the operating system, releasing updates and new versions that added new features and improved performance and compatibility. Mac OS X was renamed OS X in 2011, and to macOS in 2016; , the latest version is macOS Sonoma, which was released in September 2023.
New and updated features
The features of the release include the Dock which was a new way of organizing one's Mac OS X applications on a user interface, and a change from the classic method of Application launching in previous Mac OS s |
https://en.wikipedia.org/wiki/Jeff%20Grubb | Jeff Grubb (born August 27, 1957) is an author of novels, short stories, and comics, as well as a computer and role-playing game designer in the fantasy genre. Grubb worked on the Dragonlance campaign setting under Tracy Hickman, and the Forgotten Realms setting with Ed Greenwood. His written works include The Finder's Stone Trilogy, the Spelljammer and Jakandor campaign settings, and contributions to Dragonlance and the computer game Guild Wars Nightfall (2006).
Personal life
Grubb was born in Pittsburgh, Pennsylvania. He met Kate Novak in high school, and married her in 1983. His first year of employment involved work with air pollution control devices.
Beginnings in role-playing games
Grubb became a wargaming enthusiast during his high school years. He started to play Avalon Hill wargames including PanzerBlitz and Blitzkrieg, and the SPI game, Frigate.
As a freshman, he attended the campus war-gaming club and was introduced to the role-playing game, Dungeons & Dragons. Grubb said,
"I walked up to a group of players to ask what they were doing. One turned to me, handed me three six-siders, and said, 'Roll these. We need a cleric.' It was all downhill from there."
Within the year, Grubb attended Gen Con, a table-top gaming convention, for the first time. He also ran his own campaign set in Toril, his own game universe.
Career
TSR
Grubb's overseeing of the design of the "AD&D Open" at Gen Con in 1982, led to his employment as a game designer at TSR. He was a design consultant on Gary Gygax's 1983 work, Monster Manual II for the Advanced Dungeons & Dragons role-playing game. Tracy Hickman got Harold Johnson, then Grubb, Carl Smith and Larry Elmore in on the idea of Dragonlance before Margaret Weis and Douglas Niles joined them. In 1984, Grubb was the principal architect of the Marvel Super Heroes game system.
Grubb was a consultant on the first edition of Unearthed Arcana, and authored the first edition of the Manual of the Planes. Grubb contacted Ed Greenwood, author of numerous articles in Dragon about his home campaign setting, and soon Greenwood began sending Grubb packages full of maps of his world and background information for the setting; this collaboration resulted in the publication of the Forgotten Realms campaign setting beginning with the Forgotten Realms Campaign Setting (1987). He is the designer of the Spelljammer campaign setting, and the Al-Qadim setting. Grubb felt that Al-Qadim was well received because the designers were able to hide the potential of the setting from the executives at TSR.
In the late 1980s, Grubb wrote four fill-in issues of the DC Comics licensed Advanced Dungeons & Dragons comic book, and wrote 25 issues of DC Comic's Forgotten Realms series. Grubb started the Buck Rogers line for TSR with a board game published in 1988. Grubb continued to work on role-playing games with TSR for many years, long enough to be regarded affectionately as an "old timer" by Scott Haring. In 1994, he left TSR to pursue fre |
https://en.wikipedia.org/wiki/Apple%20Store | The Apple Store is a chain of retail stores owned and operated by Apple Inc. The stores sell various Apple products, including Mac personal computers, iPhone smartphones, iPad tablet computers, Apple Watch smartwatches, Apple TV digital media players, software, and both Apple-branded and selected third-party accessories.
The first Apple Stores were originally opened as two locations in May 2001 by then-CEO Steve Jobs, after years of attempting but failing store-within-a-store concepts. Seeing a need for improved retail presentation of the company's products, he began an effort in 1997 to revamp the retail program to get an improved relationship with consumers and hired Ron Johnson in 2000. Jobs relaunched Apple's online store in 1997 and opened the first two physical stores in 2001. The media initially speculated that Apple would fail, but its stores were highly successful, bypassing the sales numbers of competing nearby stores and within three years reached US$1 billion in annual sales, becoming the fastest retailer in history to do so. Apple has expanded the number of retail locations and its geographical coverage over the years, with 527 stores across 26 countries and regions worldwide, opening its latest store in Wenzhou, China on November 4, 2023. Strong product sales have placed Apple among the top-tier retail stores, with sales over $16 billion globally in 2011.
In May 2016, Angela Ahrendts, Apple's then-Senior Vice President of retail, unveiled a significantly redesigned Apple Store in Union Square, San Francisco, featuring large glass doors for the entry, open spaces, and rebranded rooms. In addition to purchasing products, consumers can get advice and help from "Creative Pros" – individuals with specialized knowledge of creative arts; get product support in a tree-lined Genius Grove; and attend sessions, conferences, and community events, with Ahrendts commenting that the goal is to make Apple Stores into "town squares", a place where people naturally meet up and spend time. The new design will be applied to all Apple Stores worldwide, a process that has seen stores temporarily relocate or close.
Many Apple Stores are located inside shopping malls, but Apple has built several stand-alone flagship stores in high-profile locations. It has been granted design patents and received architectural awards for its stores' designs and construction, specifically for its use of glass staircases and cubes. The success of Apple Stores has had significant influence over other consumer electronics retailers, who have lost traffic, control and profits due to perceived higher quality of service and products at Apple Stores. Apple's notable brand loyalty among consumers causes long lines of hundreds of people at new Apple Store openings or product releases. Due to the popularity of the brand, Apple receives many job applications, many of which come from young workers. Apple Store employees receive above-average pay, are offered money toward education a |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Washington%20%28state%29 | The following is a list of FCC-licensed radio stations in the U.S. state of Washington, which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
Defunct
KAPY-LP
KBNO-FM
KBVU
KCFL-LP
KCKO
KEYG
KFC
KFKB
KFWY
KGRU-LP
KIKN
KISN
KKZU
KLFF
KMRE-LP
KOWA-LP
KREN
KSVY
KYAO-LP
KZLF-LP
References
External links
Radio-Locator: Seattle, WA
Washington
Radio stations |
https://en.wikipedia.org/wiki/PDI | PDI may refer to:
Organisations
Investigations Police of Chile (), the state police force of Chile
Party for Justice and Integration (), an Albanian political party
Pacific Data Images, former American computer animation production company
Philippine Daily Inquirer, a broadsheet newspaper in the Philippines and the Philippines' newspaper of record
Plumbing & Drainage Institute, an American plumbing products manufacturers certification organization
Ideal Democratic Party, political party in Rwanda
Partai Demokrasi Indonesia (Indonesian Democratic Party) (1973–2004), a defunct political party
Polo Democrático Independiente (Independent Democratic Pole), a Colombian leftwing social democratic political party
Chemistry and biochemistry
Pyridinediimine, organic compounds used as ligands
Perylenediimide, a member of the rylene dyes
Protein dispersibility index, a means of comparing the solubility of a protein in water
Protein disulfide isomerase, an enzyme which catalyzes the formation and breakage of disulfide bonds in proteins
Polydispersity index, a deprecated term for the molecular weight distribution of polymers
Computing
Pentaho Data Integration, Pentaho Data Integration (PDI, also called Kettle) is the component of Pentaho responsible for the Extract, Transform and Load (ETL) processes.
Personal Data Interchange, an information sharing standard developed by the Versit Consortium
Portable Database Image (.pdi), a file format to store structured databases for reporting and analysis in a highly compressed way
Program and Debug Interface, an Atmel proprietary interface for external programming and on-chip debugging of computing devices.
Projected Digital image, a digital image used for projection, often in the context of a photographic competition
Other
Postal Development Indicator, a ranking developed by the Universal Postal Union
Peripheral drift illusion, a motion illusion generated by the presentation of a sawtooth luminance grating in the visual periphery
Pilot direction indicator, an aircraft instrument that guides a bomber pilot during a bomb run
Power Distance Index, a statistic in anthropology and social studies that is used to describe the degree of acceptance of unequal power distribution in a society or group
Powered Descent Initiation, the maneuver of the Apollo Lunar Module as it descended from lunar orbit to landing
Pre-delivery inspection, the examination of a car, home, or other traded goods before handover to the new owner. |
https://en.wikipedia.org/wiki/Computer%20poker%20player | A computer poker player is a computer program designed to play the game of poker (generally the Texas hold 'em version), against human opponents or other computer opponents. It is commonly referred to as pokerbot or just simply bot. As of 2019, computers can beat any human player in poker.
On the Internet
These bots or computer programs are used often in online poker situations as either legitimate opponents for humans players or a form of cheating. As of 2020, all use of Real-Time Assistance (RTA) or automated bots is considered cheating by all online poker sites, although the level of enforcement from site operators varies considerably.
Player bots
Use of player bots or computer assistance while playing online poker is prohibited by most, if not all, online sites. Actions taken for breaches are a permanent ban and confiscation of winnings. One kind of bot can interface with the poker client (in other words, play by itself as an auto player) without the help of its human operator. Real-Time Assistance (RTA) is another method of using computer programs. RTA is when a human player uses program called an “solver” such as PioSOLVER or PokerSnowie, running on a different computer, to make their decisions.
The issue of unfair advantage is twofold. For one, bots can play for many hours at a time without human weaknesses such as fatigue and can endure the natural variances of the game without being influenced by human emotion (or "tilt"). Secondly, since 2019, the computer program Pluribus (poker bot) is successful enough at reading bluffs, calculating odds, and adjusting to strategy that it consistently beats professional poker players at 6-player no-limit Hold’em.
House enforcement
While the terms and conditions of poker sites generally forbid the use of bots, the level of enforcement depends on the site operator. Some will seek out and ban bot users through the utilization of a variety of software tools. The poker client can be programmed to try to detect bots although this is controversial in its own right as it might be seen as tantamount to embedding spyware in the client software. Another method is to use CAPTCHAs at random intervals during play to catch automated bots, although isn’t effective against Real-Time Assistance.
House bots
“House bots” can pose a conflict of interest. By the strictest definition, a house bot is an automated player operated by the online poker room itself. These type of bots would be the equivalent of brick and mortar shills.
Both brick and mortar casino shills and online house bots are not supposed to have access to any information that is not also available to any other player in the hand. The problem is that in an online setting the house has no way to prove their bots are not receiving sensitive information from the card server. This is further exacerbated by the ease with which clandestine information sharing can be accomplished in a digital environment. It is essentially impossible even for the h |
https://en.wikipedia.org/wiki/Sabreman | The Sabreman series of games was released by Ultimate Play the Game for the ZX Spectrum in the 1980s. Some of the instalments were also released on other popular home microcomputers, namely the Amstrad CPC, BBC Micro, Commodore 64, and MSX. The series stars Sabreman, who is depicted wearing khakis and a pith helmet.
Games
The story of Sabreman's adventures is not developed within the games themselves, but each game would come with an explanation of the story so far on the cassette inlay cards.
Sabre Wulf (1984), in which Sabreman must escape a large jungle maze by collecting four pieces of an amulet, while avoiding the titular wulf. Finding all four would grant access to:
Underwurlde (1984), in which Sabreman must find three weapons to defeat three guardians in an extensive system of caverns. This done, three exits are available, each leading to one of the following three games.
Knight Lore (1984), in which Sabreman arrives at Knight Lore Castle to seek a cure for his newfound lycanthropy. Collecting a number of items for the resident wizard Melkhior achieves both the cure and progress to:
Pentagram (1986), in which Sabreman, as a newly qualified wizard himself, embarks on a quest to find the Pentagram, a powerful magic artifact. Once this is achieved Sabreman is directed to the final game in the series:
Mire Mare (cancelled), which was never released and about which little is known.
Sabreman's appearance in Knight Lore inspired the character Sabrewulf in the Killer Instinct series, while Sabreman himself made a cameo in Banjo-Tooie, both by Ultimate's successor company Rare. No other games in the series were released until Sabre Wulf on the Game Boy Advance in 2004, which builds on the story from the original Sabre Wulf, the object being to collect amulet pieces to defeat the Wulf once again. An Xbox 360 title, Sabreman Stampede, was in development as a rework of Rare's cancelled title Donkey Kong Racing, but was also cancelled during development due to a lack of focus and Rare's unfamiliarity with the hardware. In 2015, Sabre Wulf, Underwurlde, and Knight Lore were re-released as part of the Rare Replay compilation for Xbox One.
References
External links
Microsoft franchises
Video game franchises
Video game franchises introduced in 1984 |
https://en.wikipedia.org/wiki/Audio%20game | An audio game is an electronic game played on a device such as a personal computer. It is similar to a video game save that there is audible and tactile feedback but not visual.
Audio games originally started out as 'blind accessible'-games and were developed mostly by amateurs and blind programmers.
But more and more people are showing interest in audio games, ranging from sound artists, game accessibility researchers, mobile game developers and mainstream video gamers. Most audio games run on a personal computer platform, although there are a few audio games for handhelds and video game consoles. Audio games feature the same variety of genres as video games, such as adventure games, racing games, etc.
Audio game history
The term "electronic game" is commonly understood as a synonym for the narrower concept of the "video game." This is understandable as both electronic games and video games have developed in parallel and the game market has always had a strong bias toward the visual. The first electronic game, in fact, is often cited to be Cathode-Ray Tube Amusement Device (1947) a decidedly visual game. Despite the difficulties in creating a visual component to early electronic games imposed by crude graphics, small view-screens, and power consumption, video games remained the primary focus of the early electronic game market.
Arcade and one-off handheld audio gamesthe early years
Atari released the first audio game, Touch Me, in 1974. Housed in an arcade cabinet, Touch Me featured a series of lights which would flash with an accompanying tone. The player would reproduce the sequence by pressing a corresponding sequence of buttons and then the game would add another light/sound to the end of the growing sequence to continually test the player's eidetic memory in a Pelmanism-style format. Although the game featured both a visual and an auditory component, the disconnect between the two enabled both the seeing and the visually impaired to equally enjoy the game.
Based on the popularity of Touch Me, in 1978 Milton Bradley Company released a handheld audio game entitled Simon at Studio 54 in New York City. Whereas Touch Me had been in competition with other visual-centric video games and consequently remained only a minor success, the allure of a personal electronic game allowed Simon to capture a much greater share of the market. Simon became an immediate success eventually becoming a pop culture symbol of the 1980s.
In the decades following the release of Simon, numerous clones and variations were produced including Merlin among others. Beginning in 1996, Milton Bradley and a number of other producers released the handheld Bop It which featured a similar concept of a growing series of commands designed to test eidetic memory. Other related games soon followed including Bop It Extreme (1998), Bop It-Extreme 2 (2002–2003), Zing-It, Top-It, and Loopz (2010)
TTS software and the PCthe second wave
Before graphical operating systems like W |
https://en.wikipedia.org/wiki/Starvation%20%28computer%20science%29 | In computer science, resource starvation is a problem encountered in concurrent computing where a process is perpetually denied necessary resources to process its work. Starvation may be caused by errors in a scheduling or mutual exclusion algorithm, but can also be caused by resource leaks, and can be intentionally caused via a denial-of-service attack such as a fork bomb.
When starvation is impossible in a concurrent algorithm, the algorithm is called starvation-free, lockout-freed or said to have finite bypass. This property is an instance of liveness, and is one of the two requirements for any mutual exclusion algorithm; the other being correctness. The name "finite bypass" means that any process (concurrent part) of the algorithm is bypassed at most a finite number times before being allowed access to the shared resource.
Scheduling
Starvation is usually caused by an overly simplistic scheduling algorithm. For example, if a (poorly designed) multi-tasking system always switches between the first two tasks while a third never gets to run, then the third task is being starved of CPU time. The scheduling algorithm, which is part of the kernel, is supposed to allocate resources equitably; that is, the algorithm should allocate resources so that no process perpetually lacks necessary resources.
Many operating system schedulers employ the concept of process priority. A high priority process A will run before a low priority process B. If the high priority process (process A) blocks and never yields, the low priority process (B) will (in some systems) never be scheduled—it will experience starvation. If there is an even higher priority process X, which is dependent on a result from process B, then process X might never finish, even though it is the most important process in the system. This condition is called a priority inversion. Modern scheduling algorithms normally contain code to guarantee that all processes will receive a minimum amount of each important resource (most often CPU time) in order to prevent any process from being subjected to starvation.
In computer networks, especially wireless networks, scheduling algorithms may suffer from scheduling starvation. An example is maximum throughput scheduling.
Starvation is normally caused by deadlock in that it causes a process to freeze. Two or more processes become deadlocked when each of them is doing nothing while waiting for a resource occupied by another program in the same set. On the other hand, a process is in starvation when it is waiting for a resource that is continuously given to other processes. Starvation-freedom is a stronger guarantee than the absence of deadlock: a mutual exclusion algorithm that must choose to allow one of two processes into a critical section and picks one arbitrarily is deadlock-free, but not starvation-free.
A possible solution to starvation is to use a scheduling algorithm with priority queue that also uses the aging technique. Aging is a technique o |
https://en.wikipedia.org/wiki/Unix%20wars | The Unix wars were struggles between vendors to set a standard for the Unix operating system in the late 1980s and early 1990s.
Origins
Although AT&T Corporation created Unix, by the 1980s, the University of California, Berkeley Computer Systems Research Group was the leading non-commercial Unix developer. In the mid-1980s, the three common versions of Unix were AT&T's System III, the basis of Microsoft's Xenix and the IBM-endorsed PC/IX, among others; AT&T's System V, which it sought to establish as the new Unix standard; and the Berkeley Software Distribution (BSD). All were derived from AT&T's Research Unix but had diverged considerably. Further, each vendor's version of Unix was different to some degree.
For example, at a mid-1980s Usenix conference, many AT&T staff had buttons that read "System V: Consider it Standard" and a number of major vendors were promoting products based on System V. On the other hand, System V did not yet have TCP/IP networking built-in, while BSD 4.2 did; vendors of engineering workstations were nearly all using BSD, and posters reading "4.2 > V" were available.
Several vendors formed the X/Open standards group in 1984 to promote compatible open systems, and they chose to base their system on Unix. X/Open caught AT&T's attention. To increase the uniformity of Unix, AT&T and leading BSD Unix vendor Sun Microsystems started work in 1987 on a unified system. (The feasibility of this had been demonstrated a few years earlier by the US Army Ballistic Research Laboratory's System V environment for BSD Unix.) This was released in 1988 as System V Release 4 (SVR4) which still lives to this day through its derivative OpenIndiana.
While this decision was applauded by customers and the trade press, certain other Unix licensees feared Sun would be unduly advantaged. They formed the Open Software Foundation (OSF) in 1988. The same year, AT&T and another group of licensees responded by forming Unix International (UI). Technical issues soon took a back seat to vicious and public commercial competition between the two "open" versions of Unix, with X/Open holding the middle ground.
A 1990 study of various Unix versions' reliability found that in each version, between a quarter and a third of operating system utilities could be made to crash by fuzzing; the researchers attributed this, in part, to the "race for features, power, and performance" resulting from BSD–System V rivalry, which left developers little time to worry about reliability.
Standardization
The 1988 POSIX standard initially concentrated on system C library functions beyond what was included in the forthcoming C standard; later it expanded to specify other aspects of the system environment. POSIX specified a "lowest common denominator" that could be met by both System V and BSD-based variants, as well as some non-Unix systems, with a reasonable amount of effort.
In March 1993, the major participants in UI and OSF formed the Common Open Software Environment (COS |
https://en.wikipedia.org/wiki/GNU/Linux%20naming%20controversy | Within the free software and the open-source software communities there is controversy over whether to refer to computer operating systems that use a combination of GNU software and the Linux kernel as "GNU/Linux" or "Linux" systems.
Proponents of the term Linux argue that it is far more commonly used by the public and media and that it serves as a generic term for systems that combine that kernel with software from multiple other sources, while proponents of the term GNU/Linux note that GNU alone would be just as good a name for GNU variants which combine the GNU operating system software with software from other sources.
The term GNU/Linux is promoted by the Free Software Foundation (FSF) and its founder Richard Stallman. Their reasoning is that the GNU project was the main contributor for not only many of the operating system components used in the subsequent development of modern "Linux" systems, but also the associated free software philosophy. Several distributions of operating systems containing the Linux kernel use the name that the FSF prefers, such as Debian, Trisquel and Parabola GNU/Linux-libre. Others claim that GNU/Linux is a useful name to make a distinction between those and Linux distributions such as Android and Alpine Linux.
History
In 1983, Richard Stallman, founder of the Free Software Foundation, set forth plans of a complete Unix-like operating system, called GNU, composed entirely of free software. In September of that year, Stallman published a manifesto in Dr. Dobb's Journal detailing his new project publicly, outlining his vision of free software. Software development work began in January 1984. By 1991, the GNU mid-level portions of the operating system were almost complete, and the upper level could be supplied by the X Window System, but the lower level (kernel, device drivers, system-level utilities and daemons) was still mostly lacking.
The kernel officially developed by GNU was called GNU Hurd. The Hurd followed an ambitious microkernel design, which proved unexpectedly difficult to implement early on. However, in 1991, Linus Torvalds independently released the first version of the Linux kernel. Early Linux developers ported GNU code, including the GNU C Compiler, to run on Linux, while the free software community adopted the use of the Linux kernel as the missing kernel for the GNU operating system. This work filled the remaining gaps in providing a completely free operating system.
Over the next few years, several suggestions arose for naming operating systems using the Linux kernel and GNU components. In 1992, the Yggdrasil Linux distribution adopted the name "Linux/GNU/X". In Usenet and mailing-list discussions, one can find usages of "GNU/Linux" as early as 1992, and of "GNU+Linux" as early as 1993. The Debian project, which was at one time sponsored by the Free Software Foundation, switched to calling its product "Debian GNU/Linux" in early 1994.
This change followed a request by Richard Stallman (who |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.