source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/2005%20in%20rail%20transport |
Events
January events
January 1 – The Korean National Railroad in South Korea is split into the Korea Railroad Corporation, branded as Korail, which will operate trains, and Korea Rail Network Authority (KR), which maintains the tracks.
January 5 – The metre-gauge Brünig railway line of the Swiss Federal Railways and the Luzern–Stans–Engelberg railway line merge to form the Zentralbahn.
January 12 – General Motors announces that it has agreed to sell Electro-Motive Diesel to a consortium led by Greenbriar Equity Group and Berkshire Partners.
January 29 – Singapore's third LRT Line, Punggol LRT Line, is opened.
February events
February 25 – Bombardier is awarded a contract to build 361 passenger cars for a new Chinese rail line to Lhasa, Tibet; due to the destination's altitude the cars will include special UV-filtering glass and a unique oxygen enriching system.
February 26 – AVE Class 102 trains enter regular operation on the Madrid-Zaragoza-Lleida line.
March events
March 2 – Citing disputes in paid leave policies, around 200 BNSF dispatchers walk off the job for nearly three hours, causing traffic delays over the entire system from Chicago to the Pacific coast.
March 14 – Canadian Pacific purchases 35 new Green Goat hybrid locomotives, becoming the first railroad to order this type of locomotive.
April events
April 1
– All former BC Rail systems and operations are fully integrated into those of the purchasing railroad, Canadian National.
– Kansas City Southern Railway completes its controlling interest purchase of TFM; Vicente Corta is named interim CEO of TFM.
April 7 – Railways Act 2005 (UK) provides for abolition of Strategic Rail Authority.
April 13 – The transport ministry of Bulgaria issues the first freight transport license to a private company, Bulgarian Railroad Company, to operate on the nation's rail network.
April 28 – Swiss engineers blast through the last section of rock on the first bore of the Lötschberg Base Tunnel project under the Alps. See also Swiss finish drilling world's longest overland tunnel
May events
May 3 – The Iranian president Mohammad Khatami leads the ceremony inaugurating passenger rail service between Mashhad and Bafq, Iran.
May 26 – Genesee & Wyoming (G&W) announce that they have agreed to purchase the railroad operations of Rail Management Corporation (RMC). G&W will pay US$243 million in cash and assume $1.7 million in company debt to gain control of 14 short line railroads from RMC across the southeastern United States, as of June 1, 2005. G&W already controls 24 other railroads in North America, South America and Australia.
June events
June 1 – Joseph H. Boardman, former Commissioner of New York State Department of Transportation, begins his duties as Administrator for the United States Federal Railroad Administration (a division of the United States Department of Transportation).
June 2 – Railroad workers across France go on strike to demand better wages |
https://en.wikipedia.org/wiki/ICL%20Distributed%20Array%20Processor | The Distributed Array Processor (DAP) produced by
International Computers Limited (ICL) was the world's first commercial
massively parallel computer. The original paper study was
complete in 1972 and building of the prototype began in 1974.
The first machine was delivered to
Queen Mary College in 1979.
Development
The initial 'Pilot DAP' was designed and implemented by Dr Stewart
F Reddaway with the aid of David J Hunt and Peter M Flanders at the
ICL Stevenage Labs. Their manager and a major contributor was John K Iliffe who had designed the Basic Language Machine—he is well known nowadays for Iliffe vectors.
The ICL DAP had 64×64 single bit processing elements (PEs) with 4096 bits of storage per PE. It was attached to an ICL mainframe and its memory was mapped into the mainframe's memory. Programs for the DAP were written in DAP FORTRAN which was FORTRAN extended with 64×64 matrix and 64 element vector primitives. DAP Fortran compiled to an assembly language called APAL (Array Processor Assembly Language). The DAP had a single instruction, multiple data (SIMD) architecture. Each operation could be performed under the control of a mask which controlled which elements were affected. Array programs were executed as subroutines of normal mainframe FORTRAN programs and IO was handled by the mainframe.
Operationally, there was an overhead to transfer computational data into and out of the array, and problems which did not fit the 64×64 matrix imposed additional complexity to handle the boundaries (65×65 was perhaps the worst case!)—but for problems which suited the architecture, it could outperform the current Cray pipeline architectures by two orders of magnitude. The ICL 2980 was not a popular machine and this held back the use of the DAP as an attached processor was restricted initially to this one range.
The design as described in Reddaway's 1973 paper is pretty much that which was implemented in the first commercial version except the facility to supply address bits from the processing elements was removed. This change greatly simplified hardware error detection. A notable extra facility was carry propagation to simplify vector mode addition.
After ICL
The DAP [IP] was sold off to a venture capital-funded start-up company Active Memory Technology
(AMT) which was then taken over by Cambridge Parallel Processors (CPP).
It was enhanced and made smaller and faster as the Gamma series.
An 8-bit processor with some local 8-bit wide memory was added to the
processor and fast IO capabilities were implemented. It could be programmed in either C++ or Fortran-Plus. These were more flexible than DAP FORTRAN, in particular they automatically took care of choosing a mapping from user specified matrix and vector bounds to the underlying hardware.
Sample DAPs are in storage at the Computer History Museum.
CPP ceased trading in 2004.
Mini-DAP and Mil-DAP
A smaller 32x32 version was created between 1984 and 1987. The commercial version was called the Min |
https://en.wikipedia.org/wiki/License-free%20software | License-free software is computer software that is not explicitly in the public domain, but the authors appear to intend free use, modification, distribution and distribution of the modified software, similar to the freedoms defined for free software. Since the author of the software has not made the terms of the license explicit, the software is technically copyrighted according to the Berne convention and as such is proprietary.
Examples
Examples of license-free software formerly included programs written by Daniel J. Bernstein, such as qmail, djbdns, daemontools, and ucspi-tcp. Bernstein held the copyright and distributed these works without license until 2007. From December 28, 2007, onwards, he started placing his software in the public domain with an explicit waiver statement.
Additionally, small scripts are frequently released without specifying a license. For example, the website Userscripts.org hosts more than 52,000 Greasemonkey user scripts, the majority of which have no specified license. Similarly, GitHub reported in 2015 that 85% of the projects it hosts are unlicensed.
Rights for users
On his Software users' rights web page, Bernstein explains his belief that under the terms of copyright law itself software users are always allowed to modify software for their personal use, regardless of license agreements. He says '"If you think you need a license from the copyright holder, you've been bamboozled by Microsoft. As long as you're not distributing the software, you have nothing to worry about."He also says that software users are allowed to back up, compile, and run the software that they possess.
He further says that "since it's not copyright infringement for you to apply a patch, it's also not copyright infringement for someone to give you a patch," noting the case of Galoob v. Nintendo'' as precedent. Thus modified versions of license-free software can legally be distributed in source code form in whatever way that the original can, by distributing a patch alongside it.
Reception and discussion
Advocates of license-free software, such as Bernstein, argue that software licenses are harmful because they restrict the freedom to use software, and copyright law provides enough freedom without the need for licenses. Though having some restrictions, these licenses allow certain actions that are disallowed by copyright laws in some jurisdictions. If a license tries to restrict an action allowed by a copyright system, by Bernstein's argument those restrictions can be ignored. In fact, Bernstein's "non-license" of verbatim retransmission of source code is very similar in nature.
Similar positions on licenses are voiced by Free culture activist Nina Paley in 2010.
In 2013 Luis Villa argued similarly negative about the license usage of "open source", when the small number projects licensed on GitHub were noticed, identifying a "Post Open Source movement against the (license) permission culture".
See also
Anti-copyright noti |
https://en.wikipedia.org/wiki/OpenSecrets | OpenSecrets is a nonprofit organization based in Washington, D.C., that tracks data on campaign finance and lobbying. It was created from the 2021 merger of the Center for Responsive Politics (CRP) and the National Institute on Money in Politics (NIMP), both of which were organizations that tracked data on campaign finance in the United States and advocated for stricter regulation and disclosure of political donations.
The organization is funded by donations; since 2020, the largest donors have been: the Carnegie Corporation of New York, Democracy Fund, the Gaia Fund, Google, the Hewlett Foundation, the Kaphan Foundation, Mertz Gilmore Foundation, the Omidyar Network, Open Society Foundations, the Popplestone Foundation, and the Rockefeller Brothers Fund.
In 2021, the organization reported $6.5 million in revenue and $3.5 million in salaries and fundraising expenses. It had $5.2 million in net assets as of December 31, 2021.
History
Center for Responsive Politics
The Center for Responsive Politics was founded in 1983 by retired U.S. Senators Frank Church of Idaho, of the Democratic Party, and Hugh Scott of Pennsylvania, of the Republican Party. In the 1980s, Church and Scott launched a "money-in-politics" project, whose outcome consisted of large, printed books. Their first book, Spending in Congressional Elections: A Never-Ending Spiral, published in 1988, analyzed spending patterns in congressional elections from 1974 through 1986, including 1986 soft money contributions in five states. The first data was published by CRP in 1990 and the website OpenSecrets.org was launched in 1996, making the data more readily available.
National Institute on Money in Politics
The National Institute on Money in Politics traces its roots to the "Money in Western Politics" project launched in 1991 and funded by the MacArthur Foundation. Prior to 1991, data was not digitized and therefore was not easily available. In 1999, three regional teams merged to form NIMP, based in Helena, Montana. The organization published the Follow The Money website, where it compiled political funding information from government disclosure agencies.
The organization did not receive any government funding and relied on philanthropic efforts; among its donations received was $2.3 million in funding from Open Society Foundations.
Activities
According to its tax filings, "Opensecrets is the leading research organization tracking monies and its effects on state and federal elections and public policy. The organization's non partisan work is aimed at creating a more educated voter, an involved citizenry and a more responsive and accountable government."
OpenSecrets publishes a revolving door database which documents the individuals who have worked in both the public sector and lobbying firms, creating conflicts of interest.
In 2015, The News & Observer published an op-ed by Robert Maguire, the political nonprofits investigator at CRP, that was critical of Carolina Rising, a 501(c) |
https://en.wikipedia.org/wiki/CBS%20Sports | CBS Sports is the sports broadcasting division of American television network CBS. Its headquarters are in the CBS Building on W 52nd Street in Midtown Manhattan, New York City, with programs produced out of Studios 43 and 44 of the CBS Broadcast Center on W 57th Street.
CBS' premier sports properties include the WNBA, NFL, Southeastern Conference (SEC) football, BIG 10 Football, NCAA Division I college basketball (including telecasts of the NCAA men's basketball tournament), PGA Tour golf, the Masters Tournament, the PGA Championship, and the UEFA Champions League.
CBS Sports was honored at the 59th Annual Technology & Engineering Emmy Awards for Outstanding Achievement in Advanced Media Technology for Synchronous Enhancement of Original Television Content for Interactive Use for its program March Madness on Demand.
Programs throughout the years
Current programs
PGA Tour on CBS (1956–present)
The Masters (1956–present) (co-production with ESPN since 2008)
PGA Championship (1991–present) (co-production with ESPN since 2020)
CBS Sports Spectacular (1960–present)
NCAA on CBS
College football (1950–1966, 1968–present)
Sun Bowl (1968–present)
SEC on CBS (First pick of SEC games, 1996–2023)
SEC Championship Game (2001-2023)
Army–Navy Game (1962–1963, 1982, 1984–1990, 1996–present)
Mountain West on CBS (2020–present)
Big Ten on CBS (1982–1986, 2023–present) (co-production with Fox Sports and NBC Sports)
Big Ten Football Championship Game (2024, 2028)
College Basketball on CBS (1981–present)
NCAA tournament (1982–present, national championship every other year since 2016) (co-production with Warner Bros. Discovery Sports and National Collegiate Athletic Association)
Semifinals and Finals of Big Ten men's basketball tournament (1998–present)
Finals of Big Ten women's basketball tournament (2024–present)
NFL on CBS (1956–1993, 1998–present)
The NFL Today (1961–1993, 1998–present)
Super Bowl: I (shared with NBC), II, IV, VI, VIII, X, XII, XIV, XVI, XVIII, XXI, XXIV, XXVI, XXXV, XXXVIII, XLI, XLIV, XLVII, 50, LIII, LV, LVIII, LXII, and LXVI
NFL on Nickelodeon (2021–present) (co-production with Nickelodeon and CBS Sports)
Showtime Championship Boxing (1986–present) (co-production with Showtime Networks)
Inside the NFL (2008–2023) (co-production with Showtime Networks)
PBR on CBS (2012–present)
Big3 (2019–present)
Tennis on CBS
World TeamTennis (2019–present)
Davis Cup (2020–present) (USA matches only for qualifiers)
Soccer on CBS Sports
NWSL (2020–present)
UEFA Champions League (2020–present)
UEFA Champions League final (2021–present)
UEFA Europa League (2020–present)
UEFA Europa Conference League (2021–present)
UEFA Super Cup (2020–present)
Serie A (2021–present)
Women's Super League (2022–present)
WNBA (2020–present)
Formula E (2021–present)
Combate Global (2021–present)
Former programs
Major League Baseball on CBS (1947–1950, 1955–1965, 1990–1993)
World Series: (Games 3 and 4), –, –
NBA on CBS (1973–1990)
|
https://en.wikipedia.org/wiki/The%20NFL%20Today | The NFL Today is an American football television program on CBS that serves as the pre-game show for the network's National Football League (NFL) game telecasts under the NFL on CBS brand. The program features commentary on the latest news around the NFL from its hosts and studio analysts, as well as predictions for the day's games and interviews with players and coaches. Originally debuting as Pro Football Kickoff on September 17, 1961, the program airs before all NFL games broadcast by CBS (usually on Sundays at 12:00 p.m. Eastern Time Zone), and generally runs for one hour (except for Thanksgiving and during the postseason when it is generally 30 minutes). The program's commentators also provide commentary during game updates, the halftime reports, and the postgame show on the NFL on CBS broadcasts.
Since 2017, longtime sportscaster James Brown has served as the host; with former Pittsburgh Steelers head coach Bill Cowher; former New York Giants quarterback Phil Simms; former Seattle Seahawks, Minnesota Vikings, and Detroit Lions wide receiver Nate Burleson; and former Cincinnati Bengals, New York Jets, and Arizona Cardinals quarterback Boomer Esiason serving as analysts.
The NFL Today broadcasts from Studio 43 at the CBS Broadcast Center in New York City; however, the program will occasionally broadcast from the game site for the AFC Championship Game and the Super Bowl. The pregame telecast of the Super Bowl is branded as The Super Bowl Today.
From 2014 to 2017, CBS partnered with the NFL Network to air selected Thursday Night Football games; the NFL GameDay crew has appeared in segments on The NFL Today for both Thursdays and Sundays (and Saturdays when applicable).
Broadcast history
Dawn of the pregame format (1961–1974)
The program began on September 17, , when CBS debuted the first remote 15-minute pre-game show, the first of its kind on network sports television. Originally titled Pro Football Kickoff, hosted by Johnny Lujack, the program originated from NFL stadiums around the country with a comprehensive look at the day's games. This show was succeeded in and by NFL Kickoff, with Kyle Rote serving as its host.
On September 13, , Frank Gifford began hosting the renamed NFL Report, which was subsequently retitled The NFL Today later that season. This version of The NFL Today was a 15-minute, regional sports program that presented interviews with NFL players and coaches, and news and features about the league. In , The NFL Today expanded to a 30-minute format preceding game coverage.
On September 20, , The NFL Today signed industry-pioneering women: Marjorie Margolies (later elected to Congress from Pennsylvania in 1992) produced and reported features, and actress Carole Howey, who also reported for the program.
In , Jack Whitaker and Pat Summerall took over hosting duties on the program from Gifford, who left CBS to call play-by-play on ABC's Monday Night Football. In , The NFL Today began originating from CBS' New York City s |
https://en.wikipedia.org/wiki/15th%20Daytime%20Emmy%20Awards | The 15th Daytime Emmy Awards were held on Wednesday, June 29, 1988, to
commemorate excellence in daytime programming from March 6, 1987-March 5, 1988 and aired on CBS. The ceremony was held at the Waldorf-Astoria Hotel in New York City. Airing from 3-5 p.m., it preempted Guiding Light.
Winners in each category are in bold.
Outstanding Daytime Drama Series
All My Children
As the World Turns
General Hospital
Santa Barbara
The Young and the Restless
Outstanding Actor in a Daytime Drama Series
Larry Bryggman (John Dixon, As the World Turns)
David Canary (Adam Chandler&Stuart Chandler, All My Children)
Robert Gentry (Ross Chandler, All My Children)
A Martinez (Cruz Castillo, Santa Barbara)
Stephen Nichols (Steve Johnson, Days of Our Lives)
Outstanding Actress in a Daytime Drama Series
Helen Gallagher (Maeve Ryan, Ryan's Hope)
Elizabeth Hubbard (Lucinda Walsh, As the World Turns)
Susan Lucci (Erica Kane, All My Children)
Erika Slezak (Victoria Lord, One Life to Live)
Marcy Walker (Eden Capwell, Santa Barbara)
Outstanding Supporting Actor in a Daytime Drama Series
Bernard Barrow (Johnny Ryan, Ryan's Hope)
Nicolas Coster (Lionel Lockridge, Santa Barbara)
Justin Deas (Keith Timmons, Santa Barbara)
Mark LaMura (Mark Dalton, All My Children)
David Lewis (Edward Quartermaine, General Hospital)
Outstanding Supporting Actress in a Daytime Drama Series
Lisa Brown (Iva Snyder, As the World Turns)
Eileen Fulton (Lisa McColl, As the World Turns)
Maeve Kinkead (Vanessa Chamberlain, Guiding Light)
Robin Mattson (Gina Blake, Santa Barbara)
Arleen Sorkin (Calliope Jones, Days of Our Lives)
Ellen Wheeler (Cindy Parker, All My Children)
Outstanding Young Man in a Daytime Drama Series
Scott DeFreitas (Andy Dixon, As the World Turns)
Andrew Kavovit (Paul Ryan, As the World Turns)
Ross Kettle (Jeffrey Conrad, Santa Barbara)
Robert Duncan McNeill (Charlie Brent, All My Children)
Billy Warlock (Frankie Brady, Days of Our Lives)
Outstanding Ingenue in a Daytime Drama Series
Tichina Arnold (Zena Brown, Ryan's Hope)
Andrea Evans (Tina Lord, One Life to Live)
Lauren Holly (Julie Chandler, All My Children)
Julianne Moore (Frannie Hughes and Sabrina Hughes, As the World Turns)
Robin Wright (Kelly Capwell, Santa Barbara)
Outstanding Daytime Drama Series Writing
The Judge
Superior Court
Santa Barbara
All My Children: Agnes Nixon, Lorraine Broderick, Clarice Blackburn; Susan Kirshenbaum; Kathleen Klein; Karen Lewis; Victor Miller; Megan McTavish; Elizabeth Page; Peggy Sloane; Gillian Spencer; Elizabeth Wallace; Wisner Washam; Mary K. Wells; Jack WoodOutstanding Daytime Drama Series Directing
As the World Turns: Paul Lammers; Jill Mitwell; Bob Schwarz; Maria Wagner; Joel Aronowitz; Michael Kerner
The Young and the Restless: Rudy Vejar; Frank Pacelli; Heather H. Hill; Randy Robbins; Betty Rothenberg Days of our Lives: Joseph Behar; Susan Orlikoff Simon; Herb Stein; Stephen Wyman; Becky Greenlaw; Gay Linvill; Sheryl Harmon
One Life to Live: Larry Auerbach; Peter Miner; G |
https://en.wikipedia.org/wiki/Sandbox%20%28computer%20security%29 | In computer security, a sandbox is a security mechanism for separating running programs, usually in an effort to mitigate system failures and/or software vulnerabilities from spreading. The isolation metaphor is taken from the idea of children who do not play well together, so each is given their own sandbox to play in alone. It is often used to execute untested or untrusted programs or code, possibly from unverified or untrusted third parties, suppliers, users or websites, without risking harm to the host machine or operating system. A sandbox typically provides a tightly controlled set of resources for guest programs to run in, such as storage and memory scratch space. Network access, the ability to inspect the host system, or read from input devices are usually disallowed or heavily restricted.
In the sense of providing a highly controlled environment, sandboxes may be seen as a specific example of virtualization. Sandboxing is frequently used to test unverified programs that may contain a virus or other malicious code without allowing the software to harm the host device.
Implementations
A sandbox is implemented by executing the software in a restricted operating system environment, thus controlling the resources (e.g. file descriptors, memory, file system space, etc.) that a process may use.
Examples of sandbox implementations include the following:
Linux application sandboxing, built on Seccomp, cgroups and Linux namespaces. Notably used by Systemd, Google Chrome, Firefox, Firejail.
Android was the first mainstream operating system to implement full application sandboxing, built by assigning each application its own Linux user ID.
Apple App Sandbox is required for apps distributed through Apple's Mac App Store and iOS/iPadOS App Store, and recommended for other signed apps.
Windows Vista and later editions include a "low" mode process running, known as "User Account Control" (UAC), which only allows writing in a specific directory and registry keys. Windows 10 Pro, from version 1903, provides a feature known as Windows Sandbox.
Google Sandboxed API.
Virtual machines emulate a complete host computer, on which a conventional operating system may boot and run as on actual hardware. The guest operating system runs sandboxed in the sense that it does not function natively on the host and can only access host resources through the emulator.
A jail: network-access restrictions, and a restricted file system namespace. Jails are most commonly used in virtual hosting.
Rule-based execution gives users full control over what processes are started, spawned (by other applications), or allowed to inject code into other applications and have access to the net, by having the system assign access levels for users or programs according to a set of determined rules. It also can control file/registry security (what programs can read and write to the file system/registry). In such an environment, viruses and Trojans have fewer opportunities for in |
https://en.wikipedia.org/wiki/A%20Charlie%20Brown%20Thanksgiving | A Charlie Brown Thanksgiving is the tenth prime-time animated television special based upon the popular comic strip Peanuts, by Charles M. Schulz. It was originally aired on the CBS network on November 20, 1973, and won an Emmy Award the following year. It was the third holiday special after A Charlie Brown Christmas in 1965 and It's the Great Pumpkin, Charlie Brown in 1966.
Plot
In a cold open cameo, Lucy entices Charlie Brown to kick her football, calling it a Thanksgiving tradition; she pulls the ball away as usual, stating that some traditions fade away.
The Browns are preparing to go to their grandmother's for Thanksgiving dinner when Charlie Brown gets a phone call from Peppermint Patty, who is alone for Thanksgiving and wants to come over for (an as yet nonexistent) dinner at the Browns' house, soon thereafter inviting Marcie and Franklin. Linus suggests to a perplexed Charlie Brown that he could have two Thanksgiving dinners; the first Thanksgiving feast can be for himself, Peppermint Patty and the others, while the second one can be at his grandparents' house for his family. Linus recruits Snoopy and Woodstock to help; Snoopy sets up a ping pong table and chairs. Charlie Brown, Snoopy, Woodstock and Linus then prepare a feast of toast, pan-fried popcorn, pretzel sticks, and jelly beans.
The guests arrive and make their way to the backyard for the Thanksgiving feast. Linus leads the group in prayer that details the First Thanksgiving in 1621, and then Snoopy serves up the feast. Peppermint Patty, outraged by the abnormal meal, complains to Charlie Brown, who dejectedly leaves the table. Marcie then asks her whether Charlie Brown invited her or if she just invited herself. Coming to her senses, Peppermint Patty asks Marcie to apologize to Charlie Brown on her behalf (unintentionally paralleling The Courtship of Miles Standish); Marcie reluctantly agrees, but Peppermint Patty soon follows and apologizes to him herself. Following this, Charlie Brown is reminded that he and Sally are due at their grandmother's house for dinner, so he calls her and explains his situation. When he mentions his friends are there, his grandmother invites them all to Thanksgiving dinner, much to the group's elation. As they all pile into the car to go to the Brown family's grandparents's house, they sing "Over the River and Through the Wood". Charlie Brown replies that there is only one problem with them singing that song: "My grandmother lives in a condominium."
Snoopy and Woodstock go to the doghouse and cook up their own traditional Thanksgiving meal. They then break the wishbone, which Woodstock wins. Over the end credits, the two enjoy some pumpkin pie.
Broadcast history
The special first aired on CBS on November 20, 1973, and continued to air every year on that network (skipping 1982, 1983, and 1988) until November 23, 1989.
The Disney Channel and Nickelodeon returned the special for re-airing in the 1990s (in the latter channel's case, under the "You' |
https://en.wikipedia.org/wiki/Life%20as%20We%20Know%20It%20%28TV%20series%29 | Life as We Know It is an American teen drama television series which aired on the ABC network during the 2004–2005 season. It was created by Gabe Sachs and Jeff Judah. The series was loosely based on the novel Doing It by British writer Melvin Burgess.
Premise
Set at the fictional Woodrow Wilson High School in Seattle, Washington, Life as We Know It focuses on three teenage best friends–Dino Whitman, Ben Connor, and Jonathan Fields. Dino is a star ice hockey player whose parents' marriage falls apart when his mother has an affair with his hockey coach. Dino has an uneasy relationship with his girlfriend, Jackie Bradford, a soccer player. Jackie's best friend is Sue Miller, an academic star. Ben becomes interested in Sue, who is unaware he was involved in an affair with a teacher, Monica Young. Jonathan, a clumsy jokester, is teased by Dino for his attraction to the overweight Deborah Tynan.
As part of the show's narrative structure, characters broke the fourth wall by stepping out of the scene — of which the action proceeds behind them in slow motion — and directly addressing the camera.
Characters
Regular
Sean Faris as Dino Whitman, lead character and star hockey player
Jon Foster as Ben Connor, one of Dino's best friends who has a rocky relationship with Sue after his affair with Monica Young
Chris Lowell as Jonathan Fields, Dino's other best friend who goes out with Jackie's friend Deborah
Missy Peregrym as Jackie Bradford, Dino's on-and-off girlfriend and the best friend of Sue and Deborah
Jessica Lucas as Sue Miller, as Ben's on-and-off girlfriend who is best friends with Jackie and Deborah
Kelly Osbourne as Deborah Tynan, Jonathan's witty British friend turned girlfriend and friend of Jackie and Sue
Lisa Darr as Annie Whitman, Dino's mother who has an affair with Dino's hockey coach
D. B. Sweeney as Michael Whitman, Dino's father who leaves his wife after her infidelity with Dino's hockey coach
Marguerite Moreau as Monica Young, a teacher who has an affair with Ben, one of her students. Sue eventually found out and told her father, who convinced Monica to transfer or she would go to jail
Recurring
Evan Smith as Max Whitman, Dino's younger brother
Sarah Strange as Mia Tynan, Deborah's mother
Martin Cummins as Coach Dave Scott, Dino's coach who has an affair with Dino's mother Annie
Jessica Harmon as Zoe
Guest stars
Michaela Mann as Emma
Samantha McLeod as Marissa Becker
Nick Lashaway as Christopher "Topher" Flynn
Joshua Close as Matt Gleeson
Craig Ferguson as Oliver Davies, Deborah Tynan's dad
James McDaniel as William Miller
Megan Gallagher as Leslie Miller
Becky Ann Baker as Amanda Connor
Dylan Baker as Roland Connor
Richard Sali as Stuart Fields
Brenda James as Mary Fields
Tseng Chang as Science Teacher Mr. Chang
Sean Whalen as Mr. Parnell
Jeffrey Nordling as Mike
Julie Patzwald as Crystal
Meghan Ory as Greta
Amanda Crew as Polly Brewer
Crystal Lowe as Julie
Josh Meyers as Sam Connor
Peter Dinklage |
https://en.wikipedia.org/wiki/Ditto%20%28drive%29 | The Ditto drive series was a proprietary magnetic tape data storage system released by Iomega during the 1990s. It was marketed as a backup device for personal computers.
They were released in several capacities ranging from the original Ditto 250 drive (250MB compressed capacity per cartridge) to the DittoMAX drive, a compatible format with compressed capacities up to 10GB per cartridge. This was accomplished by increasing the physical size of the cartridge (making it longer). Some versions of the drive were also able to read Travan-type tapes.
Technical aspects
Ditto internal drives were connected through the floppy drive channel and used MFM encoding to store data (the same method as on older floppy drives). An ISA accelerator card called the Ditto Dash, providing higher speed than a stock floppy controller, was also available.
Ditto external drives were connected to the parallel port and offered a print-through port which allowed a printer to operate while daisy-chained to the Ditto drive. This is a feature also commonly found on an Iomega ZIP drive. Usage of the parallel port allowed for transfer speeds (in EPP mode) of a maximum 1 MB/s.
Discontinuation
In 1999, Iomega sold the Ditto brand and technology to Tecmar and exited the tape drive business.
The Ditto series has been discontinued. The need for higher capacities has made the Ditto series obsolete. The slow bandwidth of the Ditto also limited its usefulness compared to the Iomega REV or the older (and discontinued) Iomega Jaz.
Models
Tape 250 - Released in 1992. Compatible with Irwin's EZTape
Compatibility between tapes and drives
Notes:
R - read capable
W - write capable
F - format capable
The capacity figures used in the product names above are double the actual (native) capacity. Iomega and other manufacturers assume 2:1 data compression.
Ditto Max requires version 3.2 Pro of the Iomega backup software to support the Ditto Max 10GB tape cartridge.
Above data gathered from.
See also
Tape drive
References
External links
Tape Standards and Compatibility for the Ditto drive
Computer storage tape media
Iomega storage devices |
https://en.wikipedia.org/wiki/Edgard%20Potier | Dominique Edgard Antoine Potier (2 November 1903 – 11 January 1944) was a Belgian airforce officer during World War II who organised an MI9 escape and evasion network, known as Mission Martin in Belgium and the Possum Line in France. Captured and tortured by the Germans, Potier committed suicide.
World War II service
In May 1940, Potier was Capitaine-Commandant in the Belgian airforce. With the outbreak of World War II, Potier travelled across France, Spain and Portugal and arrived in England in March 1942. At age 39, he was rejected by the RAF as too old for active flying duties. He then joined MI9 and in July 1943 was parachuted into southeast Belgium (Province of Luxembourg) near Suxy, accompanied by a Canadian radio operator Conrad Lafleur. At this time, many allied aircrew, on bombing raids to Germany, were being shot down over the Belgian Ardennes. Potier's mission, known as Mission Martin in Belgium and the Possum Line in France, was to organise the recovery of these airmen and shelter, feed and provide them with false identity documents, before moving them to safe houses in and around Reims in Northern France. Unlike the Ardennes, this area was suitable for evacuation by air, using Lysander aircraft.
Between August and December 1943, three successful operations took place repatriating eleven airmen and one SOE agent. The organisation also provided for and escorted airmen to the Brittany coast, in November 1943, for rescue by sea; an operation organised by the Jade-Fitzroy network. Possum operated safehouses in Paris, allowing evaders to be passed on to the Comète organisation. The two organisations in many ways supplemented each other's activities. There are no records, but it is estimated some 60–70 airmen had passed through or were being sheltered by Possum.
After returning to England for a period, Potier was parachuted back into France on 20 December. On 28 December, Lafleur was transmitting messages to London, when he was surprised by the Germans. He escaped, but it was the start of a sequence of events that eventually led to the arrest of Potier. Initially he was taken to Fresnes prison in Paris, then returned to Reims, where after being subjected to considerable torture, he committed suicide on 11 January 1944. As more arrests followed, the organisation around Reims effectively collapsed. Of the 70 network members arrested in the French sector of Possum, some 60 were deported. Less than half returned.
Reburial
Potier's remains were exhumed from Reims and, on 18 September 1950, he was reburied with full military honours in the Pelouse d'Honneur Aérienne, Cimetière Communal de B-1140 Bruxelles-Evère.
External links
Le réseau d'évasion Possum
The Possum Escape Line
Conscript-heroes.com
1903 births
1944 deaths
Belgian military personnel of World War II
People from Seraing
Belgian Air Component officers
1944 suicides |
https://en.wikipedia.org/wiki/Young%20Americans%20%28TV%20series%29 | Young Americans is an American drama television series created by Steven Antin. The show debuted on July 12, 2000, on The WB network as a summer replacement for, and spin-off from another Columbia TriStar Television production, Dawson's Creek. The series was originally ordered for the 1999–2000 United States television season with a planned fall debut, but was delayed due to unresolved matters between Columbia TriStar and The WB.
The main character, Will Krudski, was introduced late in season three of Dawson's Creek as a childhood friend of the group who has kept in contact with Pacey Witter. The show explores themes of forbidden love, morality, social classes and gender roles.
Plot summary
Young Americans is set in the town of New Rawley at a prestigious boarding school, Rawley Academy. Will Krudski, a working class New Englander, earns a scholarship to his hometown's posh boarding school, starting with the summer session, as a means of escaping his abusive father. In a moment of carelessness he confesses to his roommate Scout Calhoun that he cheated on the entrance exam. Their professor, Finn, overhears Will and Scout discussing what to do. Before making a final decision about expelling him, Finn has Will write an essay on who he is.
Throughout the series, Will faces moral dilemmas as he struggles to find his place at school while not alienating his friends in town. There is also the forbidden love between Scout and Bella Banks, Will’s childhood friend who may or may not share the same father with Scout. Jacqueline Pratt, in an attempt to see if her mother notices her, enrolls at Rawley Academy posing as a male student with the name Jake. Things get complicated when she develops feelings for Hamilton Fleming, the dean's son. Hamilton begins to wonder if he is gay as he realizes he has feelings for Jake. The story lines do not converge until the final two episodes of the show as Bella seeks the truth about her biological father.
Cast and characters
Main characters
Rodney Scott as William "Will" Krudski, a poor but brilliant young man who cheated on the entrance exam to ensure his admission and has a complicated relationship to his father
Mark Famiglietti as Scout Calhoun, Will's roommate at Rawley Academy. Scout meets, and dates, Will's old friend Bella until her stepfather explains his reasons why he disapproves.
Katherine Moennig as Jacqueline "Jake" Pratt, a teenage girl who disguises herself as a boy to get the attention of her absent mother
Ian Somerhalder as Hamilton Fleming, a student at the school and the son of the dean. Hamilton finds himself confused by his attraction to Jake.
Kate Bosworth as Bella Banks, Will's childhood friend – a pretty townie torn between Scout and fellow New Rawleyian, Sean
Ed Quinn as Finn, coach of the rowing team and also a teacher
Notable guest appearances
Matt Czuchry as Sean McGrail, Will's long-time best friend and baseball teammate as well as a childhood friend of Bella's. He eventually b |
https://en.wikipedia.org/wiki/ModPlug | ModPlug is the name for the series of computer software for creating and playing module files, originally developed by Olivier Lapicque.
ModPlug Player, a module player developed in conjunction with the original ModPlug Tracker project and the original ModPlug browser plugin
ModPlug Tracker, now known as OpenMPT
LibModplug (decoding engine) public domain software for the open source multimedia framework GStreamer
Software that uses GStreamer |
https://en.wikipedia.org/wiki/Transport%20in%20Bucharest | Bucharest has the largest transport network in Romania, and one of the largest in Europe. The Bucharest transport network is made up of a metro network and a surface transport network. Although there are multiple connection points, the two systems operate independently of each other, are run by different organisations (the metro is run by Metrorex and the surface transport network by Societatea de Transport București. The two companies used separate ticketing systems until 2021, when a new smartcard was introduced alongside the old tickets, which allows travel on both the STB and the Underground.
Bucharest Metro
Bucharest has a fairly extensive metro system consisting of five lines (M1, M2, M3, M4, and M5) run by Metrorex. In total, the network is long and has 64 stations, with average distance between stops. It is one of the fastest ways to get around the city.
Surface transport
Surface transport in Bucharest is run by Societatea de Transport București (STB) and consists of an extensive network of buses, trolleybuses, trams and light rail. The STB network is one of the densest in Europe, and the fourth largest on the continent, carrying about 1.7 million passengers daily on 85 bus lines, 23 tram lines, 2 light rail lines and 15 trolleybus lines. At times, however, it suffers from severe overcrowding.
STB is a reasonably efficient and a very frequently-used way of getting around Bucharest. As with the Metro, the system is undergoing a period of renewal. Some new features are the upgrade of tram/trolleybus infrastructure and the replacement of old rolling stock.
Buses
With a total route length of , the STB bus network is the densest of all the transport types in Bucharest. There are 85 bus lines (plus 25 night routes) operating mostly in the municipality of Bucharest, as well as 27 bus lines serving commuters from surrounding towns and villages in Ilfov County. In mid-2005, the lines that linked the city to the peripheral area were licensed out to independent transportation providers, but in early 2006, they were returned to STB control due to a wide range customer complaints about the private operators. Sometime in 2010, all the STB lines of the peripheral network were removed, leading to an increase in minivans owned by private transport companies, and so far only a few of these lines have been put back.
Fleet
STB's bus fleet is made up of 1,143 vehicles (2018), which are all wheelchair-accessible (low floor) and around 55% are air-conditioned. The fleet utilisation rate during workdays stood at 78.1% in 2018.
Between 2005 and 2009, the fleet underwent its most substantial renewal since 1989, and is now among the most modern in Europe. In December 2005, STB signed a contract for 500 Mercedes Citaro low-floor, wheelchair-accessible buses. The buses were delivered between June 2006 and April 2007. In January 2008, the first of a further series of 500 Citaro low-floor buses were put into service.
The fleet makeup, as of 2019, is as follo |
https://en.wikipedia.org/wiki/OBP | OBP may stand for:
Office of Border Patrol, part of US border control
Object-based programming
Odorant-binding protein, olfaction; proteins
Old Bold Pilots Association
One Bad Pig, a Christian punk band from Austin, Texas
On-base percentage, a baseball statistic
One Bennett Park, a skyscraper under construction in Chicago's Streeterville neighborhood
One Bayfront Plaza, a proposed skyscraper in Downtown Miami
OpenBoot, also known as "Open Firmware", the low-level firmware in Sun Microsystems, Inc. machines
Orange-bellied parrot, a critically endangered bird species from Australia
Osaka Business Park, a business district in Osaka, Japan |
https://en.wikipedia.org/wiki/Procedural | Procedural may refer to:
Procedural generation, a term used in computer graphics applications
Procedural knowledge, the knowledge exercised in the performance of some task
Procedural law, a legal concept
Procedural memory, a cognitive science concept
Procedural programming, a computer programming concept
Procedural (genre), a type of literature, film, or television program involving a sequence of technical detail. For example:
Police procedural, a subgenre of detective fiction
Procedural drama, a genre of television programming
Procedural democracy, a democracy focussing on (electoral) procedures
See also
Procedure (disambiguation) |
https://en.wikipedia.org/wiki/Extreme%20Dodgeball | Extreme Dodgeball is an American game show based on the game of dodgeball that aired between 2004 and 2005 on the Game Show Network. The series ran for three seasons, each of which featured six to eight teams of five to seven players. The first series followed gimmick teams, such as sumo wrestlers and jockeys, which changed over time into the third series with franchise-like teams representing cities. All three series are presented by Bil Dwyer and Zach Selwyn.
The series was created by Rich Cronin and produced by Mindless Entertainment and made to accompany the Rawson Marshall Thurber movie Dodgeball: A True Underdog Story.
Standard rules
The game is a variation of dodgeball, in which players from each team attempt to hit players from the other team with a ball in order to eliminate them from the round without leaving their half of the court.
In the first two seasons, two teams of five compete in a match of three rounds in a best-of-three format. This was altered significantly for season three, see "Other Rule Changes and Amendments" below. A round ends when one of the two teams loses all five of its members. The first round is standard and is played with two dodgeballs. In the second round, often called the "Big Ball Round," a third ball which is twice the diameter of the other two is added into play. This ball is often used to deflect attacks. In the third round, "Dead Man Walking," the Big Ball is removed and in its place is an orange headband that is placed on one member of each team who is designated the "Dead Man Walking." In the first and second seasons, if the Dead Man Walking is eliminated, the team he represents loses the game and consequently the match.
Elimination
In each of the three seasons, there were multiple ways for an athlete to be eliminated and sent to the sideline. Some variations in these regulations exist in the three seasons, but for the most part these rules remain the same. The following are ways in which a member of a team can be eliminated:
Getting hit with a ball
Throwing a ball which an opponent catches (in this case, a person previously eliminated can come back in, but the number of people in the playing arena cannot exceed 5)
Dropping a ball being used to deflect a ball thrown by an opposing player
Crossing over the center line or (in seasons one and two) stepping outside the boundary
There are also two ways of returning to the game after being eliminated. The first, as previously mentioned, is if a player catches a ball. At this point, one of their teammates can come back onto the court, until five members are on the court. The second way is called a regeneration. In the first season, if all but one member of the team were eliminated, the last player had the opportunity to hit a target aptly named the "regeneration target" and, if this was accomplished before he was eliminated, all of his teammates returned to the court. In season two, the last player on the court only had to stay alive for 20 seconds, |
https://en.wikipedia.org/wiki/Top%20Trumps | Top Trumps is a card game first published in 1978. Each card contains a list of numerical data, and the aim of the game is to compare these values to try to trump and win an opponent's card. A wide variety of different packs of Top Trumps has been published.
Gameplay
A pack of cards is based on a theme, such as cars, aircraft, books, boats, dinosaurs, or characters from a popular film or television series. Each card in the pack shows a list of numerical data about the item. For example, in a pack based on cars, each card shows a different model of car, and the stats and data may include its engine size, its weight, its length, and its top speed. If the theme is about a TV series or film, the cards include characters and the data varying from things like strength and bravery to fashion and looks, depending on the criteria.
All the cards are dealt among the players. There must be at least two players, and at least one card for each player. The starting player (normally the player to the dealer's left) selects a category from their topmost card and reads out its value. Each other player then reads out the value of the same category from their cards. The best (usually the largest, but in the case of a sports car's weight or a sprinter's 100m time, for instance, lower is considered better) value wins the "trick", and the winner takes all the cards of the trick and places them at the bottom of their pile. The winner then looks at their new topmost card, and chooses the category for the next round.
In the event of a draw the cards are placed in the center and a new category is chosen from the next card by the same person as in the previous round. The winner of that round obtains all of the cards in the center as well as the top card from each player.
Players are eliminated when they lose their last card, and the winner is the player who obtains the whole pack. Some variants of the rules allow 'three card pick', whereby a player who has only 3 cards remaining is allowed to choose any of their three cards to play with. Typically, this lengthens the game considerably.
History
German company Altenburg-Stralsunder launched their own brand of trumps known as Ace Trumps in 1976/77. The Dubreq Top Trumps was a card game popular with adults and children in the United Kingdom in the 1970s and 1980s, especially among boys, for whom it was a popular playground pastime. The topics tended to reflect this, and included military hardware, modes of transport and racing cars. The packs tended to be priced so that children could collect new packs by saving pocket money for a few weeks.
The original Top Trumps was launched in 1978, with eleven different packs selling at 50p each, published by a company named Dubreq. Dubreq was also known for the Stylophone. Dubreq was taken over by Waddingtons in 1982, and they continued manufacturing packs until the early 1990s. The packs from this period are now collectable.
Winning Moves UK and Winning Moves Germany
Modern r |
https://en.wikipedia.org/wiki/Paul%20Phillips%20%28poker%20player%29 | Paul Phillips (born August 9, 1972 in San Francisco, California) is an American software developer, entrepreneur and poker player.
Programming
Phillips wrote the Boa web server while attending the University of California, San Diego, but no longer maintains it. In 1994, one of his colleagues at college discovered he had an interest in blackjack and subsequently introduced him to poker.
In 1996, he became Chief Technical Officer for Go2Net. This success is the basis of his nickname Dot-com.
Phillips subsequently started working on the Scala compiler and standard library. He is co-founder of Lightbend (then known as Typesafe), a company specializing in the production and support of an open-source platform for software development based on Scala and Akka. He left Lightbend in 2013 over differences in the architecture of the language, collections library and compiler.
Poker
Phillips is known as a controversial figure in the poker world. He was banned from competing in the World Series of Poker (WSOP) in the early 2000s due to comments he made about the way in which the Horseshoe split entry money between players and casino employees. Despite being reinstated as a competitor in late 2001, he only played one event in 2002 (placing 2nd to John Juanda in the $1,500 triple draw lowball Ace to Five event).
Despite choosing not to play in the WSOP, Phillips finished 2nd in the 2003 Tournament Poker Money List.
In 2004 he made three WSOP final tables (one in Omaha hi-lo split and two in no limit hold'em.)
He spoke out against the inclusion of Phil Hellmuth Jr, Doyle "Texas Dolly" Brunson and Johnny "Oriental Express" Chan in the 2005 World Series of Poker Tournament of Champions, and subsequently became the subject of message board flame wars.
Phillips has played in both of the first two National Heads-Up Poker Championships, losing in second round play both years.
As of 2012, his total live tournament winnings exceed $2,300,000. However, Phillips has no tournament cashes since 2009.
In an April 27, 2009, article in The New Yorker on neuroenhancement, Phillips was quoted at length discussing his use of prescription drugs such as Adderall and Provigil to improve his focus and concentration during tournament play.
Personal life
Phillips is married with two daughters, and has not played as many poker tournaments since 2005 to spend more time with his family.
Phillips is also active among internet bulletin boards and played tournament Scrabble regularly until 2007.
Phillips was popular on the platform LiveJournal in the early 2000s, where he opined on programming, poker, and lifestyle controversies.
References
External links
PokerLizard.com Interview
World Poker Tour Profile
1972 births
Living people
American bloggers
American poker players
American Scrabble players
University of California, San Diego alumni
World Poker Tour winners
Sportspeople from Bend, Oregon
People from San Francisco
American software engineers
Engineers from California |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Nebraska | The following is a list of FCC-licensed radio stations in the U.S. state of Nebraska which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
Defunct
KFKX
KIMB
References
Nebraska
Radio stations |
https://en.wikipedia.org/wiki/Conrail%20Shared%20Assets%20Operations | Conrail Shared Assets Operations (CSAO) is the commonly used name for modern-day Conrail (reporting mark CRCX), an American railroad company. It operates three networks, the North Jersey, South Jersey/Philadelphia, and Detroit Shared Assets Areas, where it serves as a contract local carrier and switching company for its owners, CSX Transportation and the Norfolk Southern Railway. When most of the former Conrail's track was split between these two railroads, the three shared assets areas (a total of about 1,200 miles of track) were kept separate to avoid giving one railroad an advantage in those areas. The company operates using its own employees and infrastructure but owns no equipment outside MOW equipment.
North Jersey Shared Assets Area
The North Jersey Shared Assets Area stretches from the North Bergen Yard in North Bergen, New Jersey south into Jersey City and Newark, and beyond to Manville (Port Reading Junction) and Trenton, much of which is operated over Amtrak's Northeast Corridor and New Jersey Transit lines through trackage rights. Primary connections are to CSX's River Subdivision north to Albany, New York at North Bergen, NS's Southern Tier Line northwest to Buffalo, New York at Croxton Yard in Jersey City, NS's Lehigh Line west to Allentown, Pennsylvania and CSX's Trenton Subdivision southwest to Philadelphia at Manville, and the Conrail South Jersey/Philadelphia Shared Assets Area at Trenton. Oak Island Yard in Newark is the principal yard for the region with smaller ones at Bayonne, Greenville (Jersey City), Linden, Manville, Metuchen, Newark, Old Bridge, and Port Reading in Woodbridge.
Center Street Branch, Kearny Meadows, "P&HL", Centre Street Bridge (demolished)
Passaic and Harsimus Line "P&HL", formerly Northeast Corridor at Waverly Yard In Newark, New Jersey, now Oak Island Yard to Jersey City
Northern Running Track "NRTB", from 'CP Hack' and interchange with Passaic and Harsimus Line with connections to Marion Junction, New Jersey, Croxton Yard, interchange with New York Susquehanna & Western at 'CP West Croxton' and ending at 'CP-1' of CSX North Bergen Yard
National Docks Branch "NATB", Northern Running Track at Bergen Junction, New Jersey to Upper Bay Bridge to Oak Island Yard
Garden State Secondary formerly Chemical Coast Line "COAS", Oak Island Yard to North Jersey Coast Line at Perth Amboy
Lehigh Line "LEHL", National Docks Branch, Bayonne to CSX Trenton Subdivision and NS Lehigh Line at Manville
Perth Amboy Running Track, comes off Garden State Secondary to service industries in Perth Amboy, New Jersey.
Amboy Secondary "AMBS", from William to Midway Amtrak. Connects to NJ Transit North Jersey Coast Line via the Essay and Church Running Tracks in South Amboy, New Jersey.
Sayreville Running Track, Gillespie Running Track and Phoenix Branch
Southern Secondary "SOUS", trackage rights over NJ Transit's North Jersey Coast Line from South Amboy to Red Bank, New Jersey, to an interchange with the Delaware and Raritan River R |
https://en.wikipedia.org/wiki/SASL%20%28programming%20language%29 | SASL (from St Andrews Static Language, alternatively St Andrews Standard Language) is a purely functional programming language developed by David Turner at the University of St Andrews in 1972, based on the applicative subset of ISWIM. In 1976 Turner redesigned and reimplemented it as a non-strict (lazy) language. In this form it was the foundation of Turner's later languages KRC and Miranda, but SASL appears to be untyped whereas Miranda has polymorphic types.
Burroughs Corporation used SASL to write a compiler and operating system.
Notes
References
External links
The SASL Language Manual
Academic programming languages
Functional languages
History of computing in the United Kingdom
Programming languages created in 1972 |
https://en.wikipedia.org/wiki/Standard%20Architecture%20for%20Universal%20Comment%20Extensions | Standard Architecture for Universal Comment Extensions or SAUCE, as it is most commonly known, is an open metadata protocol for tagging and describing ASCII text files and other files, most of which generally center on or date back to the era of BBSing. SAUCE is very similar in nature to the MP3 ID3 tag format created in 1996 in that it carries metadata such as the title, author (artist), organization (group), as well as specific hierarchical datatype information depending on what type of file it is describing.
The SAUCE protocol was invented and developed by the Belgian programmer known by the pseudonym Tasmaniac of ACiD, who later went on to create the XBin image format, in 1994, two years before ID3 was established. The first utility created to add SAUCE descriptions to files was named SPOON.
References
Metadata |
https://en.wikipedia.org/wiki/Southern%20California%20freeways | The Southern California freeways are a vast network of interconnected freeways in the megaregion of Southern California, serving a population of 23 million people. The Master Plan of Metropolitan Los Angeles Freeways was adopted by the Regional Planning Commission in 1947 and construction began in the early 1950s. The plan hit opposition and funding limitations in the 1970s, and by 2004, only some 61% of the original planned network had been completed.
The region is well known for its freeways, and they are considered a cultural touchstone.
History
Origins
Southern California's romance with the automobile owes in large part to resentment of the Southern Pacific Railroad's tight control over the region's commerce in the late 19th and early 20th centuries. During his successful campaign for governor in 1910, anti-Southern Pacific candidate Hiram Johnson traveled the state by car, which was no small feat at that time. In the minds of Southlanders, this associated the automobile with clean, progressive government, in stark contrast to the railroads' control over the corrupt governments of the Midwest and Northeast. While the Southern Pacific-owned Pacific Electric Railway's famous Red Car streetcar lines were the axis of urbanization in Los Angeles during its period of spectacular growth in the 1910s and 1920s, they were unprofitable and increasingly unattractive compared to automobiles. As cars became cheaper and began to fill the region's roads in the 1920s, Pacific Electric lost ridership. Traffic congestion soon threatened to choke off the region's development altogether. At the same time, a number of influential urban planners were advocating the construction of a network of what one widely read book dubbed "Magic Motorways", as the backbone of suburban development. These "greenbelt" advocates called for decentralized, automobile-oriented development as a means of remedying both urban overcrowding and declining rates of home ownership.
Traffic congestion was of such great concern by the late 1930s in the Los Angeles metropolitan area that the influential Automobile Club of Southern California engineered an elaborate plan to create an elevated freeway-type "Motorway System," a key aspect of which was the dismantling of the streetcar lines, to be replaced with buses that could run on both local streets and on the new express roads. In the late 1930s, when the freeway system was originally planned locally by Los Angeles city planners, they had intended for light rail tracks to have been installed in the center margin of each freeway (which would presumably have carried Pacific Electric Railway red cars), but this plan was never fully implemented.
Planning and construction
During World War II, transportation bottlenecks on Southern California roads and railways convinced many that if Southern California was to accommodate a large population, it needed a completely new transportation system. The city of Los Angeles favored an upgraded rail tra |
https://en.wikipedia.org/wiki/Ajinomoto | is a Japanese multinational food and biotechnology corporation which produces seasonings, interlayer insulating materials for semiconductor packages for use in personal computers, cooking oils, frozen foods, beverages, sweeteners, amino acids, and pharmaceuticals. is the trade name for the company's original monosodium glutamate (MSG) product, the first of its kind, since 1909. The corporation's head office is located in Chūō, Tokyo. Ajinomoto operates in 36 countries worldwide and employs an estimated 34,198 people. Its yearly revenue in 2022 is around ¥1.36 trillion JPY or $10 billion USD.
History
1907–1944: Origins and expansion
Ajinomoto Co., Inc. was created in 1908 as a subsidiary of Suzuki Pharmaceutical Co., Ltd., which was founded in May 1907 by Saburosuke Suzuki II and Kikunae Ikeda. Ajinomoto was created to let Ikeda, a professor at Tokyo Imperial University, sell monosodium glutamate (MSG) seasoning made from wheat that he invented and patented. He created the seasoning after discovering that MSG was the source of a flavor that he called umami. In April 1909, Ajinomoto presented Ikeda's seasoning under the brand name "AJI-NO-MOTO" at a new product exhibition event in Tokyo, and began selling the product the next month. Ajinomoto primarily marketed the seasoning to housewives by using their trademark, a housewife in an apron, in newspaper advertisements, on signboards, and on-ground stamps.
Output gradually increased from 4.7 tons in 1910 to 23.3 tons in 1913, with sales reaching 400,000 yen. In 1914 Ajinomoto built a new factory in Kawasaki to expand its production of flavoring. Japan's improved economy after World War I resulted in output hitting 84.6 tons and sales reaching 1,563,000 yen in 1918. Despite rising sales, Ajinomoto experienced a deficit during its first ten years due to altering its methods of production and lowering its prices to get its product into ordinary households, among other reasons. Because of rising Japanese exports after World War I, Ajinomoto opened offices in New York and Shanghai in 1917 and 1918, respectively. In 1918 Ajinomoto exported 20.5 tons of its seasoning, accounting for a quarter of its total sales. The company opened new offices in Singapore and Hong Kong in 1927 and in Taiwan in 1929 to distribute its product throughout Southeast Asia. Between 1920 and 1929, revenue from the seasoning's sales rose from 2,799 thousand yen to 10,543 thousand yen, largely due to increased exports of the product to foreign markets.
To lower the cost of mass production, the seasoning's wheat was replaced with soybeans, as the price of the latter at the time was lower than the former's. In the United States, the seasoning, labeled by the FDA as a "Vegetable Protein Derivative", sold poorly on the consumer market, but Ajinomoto expanded their operations in the United States in 1931 due to mass orders of the seasoning by H.J. Heinz, Co. and Campbell Soup Co. Between 1931 and 1937, seasoning production increased |
https://en.wikipedia.org/wiki/NWS%20%28TV%20station%29 | NWS is an Australian television station based in Adelaide, Australia. It is owned-and-operated by the Nine Network. The station callsign, NWS, is an initialism of The NeWs South Australia.
History
Origins
NWS-9 was the first television broadcaster in Adelaide, beginning on 5 September 1959 from their Tynte Street studios. It was owned by Rupert Murdoch's News Limited (a subsidiary of his holding company News Corporation) through Southern Television Corporation Ltd who also owned city newspaper The News. Popular programs produced in its early days included the live variety shows Adelaide Tonight and Hey Hey It's Saturday (on-location specials), science show The Curiosity Show, The Country and Western Hour, and children's shows Channel Niners, Here's Humphrey and Pick Your Face. NWS also broadcast SANFL game matches from 1989 to 1992, earlier it had produced the first ever colour broadcast of that league's Grand Final in 1973.
In early 1980, NBN Limited became NWS's owner for A$19 million. In 1981, Hadjoin Pty. Ltd., a subsidiary of Parry's Esplanade Limited (later Parry Corporation), purchased 19.88% of NBN Limited for $6.7 million.
Following this, Parry then attempted to buy the Wansey family's stake in NBN, but was blocked by the Supreme Court of New South Wales, after which Parry revealed that he wanted to take over NBN (and thus NWS). Parry and the Lamb family then formed a deal – NBN would transfer NWS to the Lambs in exchange for their share of NBN which went to the Parrys. This ended NBN Limited's ownership of NWS.
Recent history
The Lamb family sold NWS to Southern Cross Broadcasting for $96 million in 1999, leading to redundancies among almost half of the station's staff.
On 30 May 2007, Southern Cross announced its sale of NWS-9 to WIN Corporation for $105 million. WIN took control on 1 July 2007.
It was reported on 3 June 2013 that Nine Entertainment Co. would immediately purchase Nine Adelaide (NWS) from WIN Corporation as part of a deal to secure international cricket television rights. Nine officially gained control of NWS on 1 July 2013. This move saw Nine Adelaide join Brisbane, Sydney and Melbourne as Nine Network owned-and-operated metropolitan stations leaving only Perth which was purchased only months later in September.
Managing Director of Nine Adelaide, Sean O'Brien, announced in late 2014 that within two years, the station would move from their Tynte Street location of over fifty years to new studios in the CBD.
The final broadcast from the Tynte Street studios was on 18 September 2015, followed a day later by the first transmission from the new street-level studios on Pirie Street.
Programming
Current in-house productions
Nine News (Adelaide edition)
Hello SA (2022 - Present)
Building Ideas (Adelaide edition)
Previous in-house productions
Adelaide Tonight
The Curiosity Show
The Country and Western Hour
Channel Niners
Here's Humphrey
Pick Your Face
Postcards
Out of the Blue
Garden Gurus SA
Buildin |
https://en.wikipedia.org/wiki/Jason%20Rohrer | Jason Rohrer (born November 14, 1977) is an American computer programmer, writer, musician, and game designer. He publishes most of his software into the public domain (public-domain software) and charges for versions of his games distributed on commercial platforms like the iPhone appstore or Steam. He is a graduate of Cornell University. From 2004 until 2011 he practiced simple living, stating in 2009 that his family of four had an annual budget of less than $14,500. They have since relocated from Las Cruces, New Mexico to Davis, California. In 2005 Jason Rohrer worked on a local currency, called North Country Notes (NCN), for Potsdam, New York. In 2016 Rohrer became the first videogame artist to have a solo retrospective in an art museum. His exhibition, The Game Worlds of Jason Rohrer, was on view at The Davis Museum at Wellesley College until June 2016.
Games
Rohrer has placed most of his creative work, like video games' source code and assets, into the public domain as he is a supporter of a copyright-less free distribution economy. Many of his project are hosted on SourceForge.
Transcend – Rohrer's first game, released in 2005. Transcend is "an abstract 2D shooting game that doubles as a multimedia sculpture."
Cultivation – Rohrer's second game, released in 2007, is "a social simulation about a community of gardeners."
Passage – Rohrer's third game, which was released in 2007 and garnered much attention from the mainstream and independent gaming communities. The game lasts exactly five minutes, and focuses on life, mortality and the costs and benefits of marriage. It was featured in Kokoromi's curated GAMMA 256 event. In 2012 Passage became part of the permanent collection at the Museum of Modern Art.
Gravitation – Rohrer's fourth game, released in 2008. That same year, it won the Jury award at IndieCade.
Between – Rohrer's fifth game, released in 2008. It is hosted by Esquire Magazine as an adjunct to Rohrer's profile in the December 2008 issue and was the recipient of the 2009 Independent Games Festival's Innovation Award.
Primrose – Rohrer's sixth game, designed for the iPhone (although released for home computers as well). It was released on February 19, 2009. It is a departure from the art-game theme, and is a simple puzzle game.
Sleep is Death – Adventure-game-making software, released April 16, 2010. Sleep is Death games require the creator to be present to respond to the player's actions in near real-time. It has received favorable reviews from a number of mainstream game review sites.
Game Design Sketchbook – In 2008 Rohrer created a number of games for The Escapist. These would usually be unpolished prototype games that explore a single theme, with an accompanying article by Rohrer describing the creative process of making games.
Inside a Star-filled Sky – An "infinite, recursive tactical shooter" released in February 2011, favorably reviewed. Selected for presentation at the 2011 Tokyo Game Show's Sense of Wonder Night. The ga |
https://en.wikipedia.org/wiki/Brazilian%20Highway%20System | The Brazilian Highway System (Portuguese: Sistema Nacional de Rodovias) is a network of trunk roads administered by the Ministry of Transport of Brazil. It is constructed, managed and maintained by the National Department of Transport Infrastructure (DNIT), federal agency linked to the Ministry of Infrastructure, and the public works departments of state governments.
The National Travel System (Portuguese: Sistema Nacional de Viação – SNV) comprises the road infrastructure and the operational structure of the different means of transporting people and goods. As for jurisdiction, the national road system is composed of the Federal Road Traffic System (Portuguese: Sistema Federal de Viação – SFV) and the road systems of the States, the Federal District and the Municipalities.
The Investment Partnership Program (PPI) is a major effort to expand and upgrade the network of highways aside with the Federal Highway Concessions Program (PROCROFE). The Ministry of Infrastructure often uses a public–private partnership model for highway maintenance, and toll-collection. Currently, the longest National Highway in Brazil is BR-116 with .
Characteristics
, the system consists of of roads, of which approximately are paved (12.4%), and about are divided highways, only in the State of São Paulo. Currently it is possible to travel from Rio Grande, in the extreme south of the country, to Brasília () or Casimiro de Abreu, in the state of Rio de Janeiro (), only on divided highways. The total of paved roads increased from 35,496 km (22,056 mi) in 1967 to 215,000 km (133,595 mi) in 2018, with an expansion of 0.5% between 2009 and 2019. In 2009, Brazil had of paved road and of unpaved road per inhabitant.
In 2019, the Federal Highway System had , of which approximately were paved (86.3%), and was under federal concession (PROCROFE). The most important federal highways in the country are BR-101 and BR-116.
Although Brazil has the largest duplicated road network in Latin America, it's considered insufficient for the country's needs: in 2021, it was calculated that the ideal amount of duplicated roads would be something around from to . The main road axes also have problems because they often have inadequate geometry and constructive characteristics that don't allow quality long-distance flow (non-interference from local traffic and high speed).
The Brazilian Federal Government has never implemented a National Highway Plan at the same level as developed countries such as the USA, Japan or European countries, which specifically aimed at inter-regional travel, and which should preferably be served by highways. The Brazilian State, despite some planning efforts, has been guided by a reactive action to the increase in demand (only duplicating some roads with old and inadequate layout) and not by a purposeful vision, directing occupation and economic density in the territory. Another problem is the lack of directing the Union Budget towards infrastructure wo |
https://en.wikipedia.org/wiki/Volume%20%28disambiguation%29 | Volume is the quantity of space an object occupies in a 3D space.
Volume may also refer to:
Physics
Volume (thermodynamics)
Computing
Volume (computing), a storage area with a single filesystem, typically resident on a single partition of a hard disk
Volume (video game), a 2015 video game by Mike Bithell
Volumetric datasets (3D discretely sampled data, typically a 3D scalar field), which can be visualized with:
Volume rendering
Volume mesh
Isosurface
The Volume, the soundstage in the StageCraft on-set virtual production visual effects technology
Publishing
Volume (bibliography), a physical book; the term is typically used to identify a single book that is part of a larger collection, but may also refer to a codex
Volume (magazine), a 1990s UK music magazine
Volume Magazine, quarterly architecture magazine
Volume! The French Journal of Popular Music Studies, an academic journal
Music
Volume may refer to a sound level assessment, such as:
Amplitude
Loudness
Dynamics (music)
The Volumes, a 1960s American musical group
Volumes, an American progressive metalcore band
Other uses
Volume (finance), the number of shares or contracts traded in a security or an entire market during a given period of time
Volume (film), a 2012 short film directed by Mahalia Belo
See also
"Twenty volumes", a non-scientific description of the concentration of a solution of hydrogen peroxide
Volume form, used in mathematics
Volume One (disambiguation)
Volume Two (disambiguation) |
https://en.wikipedia.org/wiki/Feature%20%28machine%20learning%29 | In machine learning and pattern recognition, a feature is an individual measurable property or characteristic of a phenomenon. Choosing informative, discriminating and independent features is a crucial element of effective algorithms in pattern recognition, classification and regression. Features are usually numeric, but structural features such as strings and graphs are used in syntactic pattern recognition. The concept of "feature" is related to that of explanatory variable used in statistical techniques such as linear regression.
Feature types
In feature engineering, two types of features are commonly used: numerical and categorical.
Numerical features are continuous values that can be measured on a scale. Examples of numerical features include age, height, weight, and income. Numerical features can be used in machine learning algorithms directly.
Categorical features are discrete values that can be grouped into categories. Examples of categorical features include gender, color, and zip code. Categorical features typically need to be converted to numerical features before they can be used in machine learning algorithms. This can be done using a variety of techniques, such as one-hot encoding, label encoding, and ordinal encoding.
The type of feature that is used in feature engineering depends on the specific machine learning algorithm that is being used. Some machine learning algorithms, such as decision trees, can handle both numerical and categorical features. Other machine learning algorithms, such as linear regression, can only handle numerical features.
Classification
A numeric feature can be conveniently described by a feature vector. One way to achieve binary classification is using a linear predictor function (related to the perceptron) with a feature vector as input. The method consists of calculating the scalar product between the feature vector and a vector of weights, qualifying those observations whose result exceeds a threshold.
Algorithms for classification from a feature vector include nearest neighbor classification, neural networks, and statistical techniques such as Bayesian approaches.
Examples
In character recognition, features may include histograms counting the number of black pixels along horizontal and vertical directions, number of internal holes, stroke detection and many others.
In speech recognition, features for recognizing phonemes can include noise ratios, length of sounds, relative power, filter matches and many others.
In spam detection algorithms, features may include the presence or absence of certain email headers,
the email structure, the language, the frequency of specific terms, the grammatical correctness of the text.
In computer vision, there are a large number of possible features, such as edges and objects.
Feature vectors
In pattern recognition and machine learning, a feature vector is an n-dimensional vector of numerical features that represent some object. Many algorithms in machi |
https://en.wikipedia.org/wiki/CHN | CHN may stand for:
China's country code
People's Republic of China's ISO 3166-1 alpha-3 and IOC country code
Republic of China's IOC country code 1932–1956, now TPE
Canadian Health Network
Cheshunt railway station, Hertfordshire, National Rail station code
CHN analyzer, measuring carbon, hydrogen, and nitrogen
City Hindus Network, London, UK
Anglican religious orders
Community of the Holy Name, an Anglican religious order for women in England, Lesotho and South Africa
Community of the Holy Name (Australia), an Anglican religious order for women in Australia, unrelated to the English order
Jeonju Airport, South Korea, IATA airport code
Chemical formula of hydrogen cyanide and hydrogen isocyanide
Climate Heritage Network |
https://en.wikipedia.org/wiki/Macintosh%20IIvx | The Macintosh IIvx is a personal computer designed, manufactured and sold by Apple Computer from October 1992 to October 1993. It is the last of the Macintosh II family of Macintosh computers. The IIvx was introduced at the same time as the Macintosh IIvi, with both models using the same metal case design as the earlier Performa 600 and Performa 600CD. Like the Performa 600CD, the IIvx could be equipped with an internal double-speed CD-ROM drive.
The IIvx was described in a MacWorld magazine review as having "the best price-to-performance ratio of any computer Apple has ever built." The list price for a machine with an hard drive, main memory, and of video memory was US$2,949. Adding the CD-ROM and upgrading to of main memory and video memory increased the price to US$3,219, which Macworld deemed to be "the best CD-ROM drive bargain ever offered".
Overview
The Mac IIvx began its life in development as a proof-of-concept to see how an internal CD-ROM drive could be added to a Mac. But after Apple CEO John Sculley gave a speech at MacWorld Tokyo promising a Mac with a CD-ROM drive, the IIvx was rushed into production. Several shortcuts were taken in its design; most notably, its 32 MHz Motorola 68030 processor was crippled by a 16 MHz bus, making it slightly slower than the popular but aging Macintosh IIci. Its serial port was limited to 57.6 kbit/s, which could cause problems with serial connections and MIDI hardware. The Macintosh IIvi (a slower version of the IIvx with a 16 MHz processor) was introduced at the same time in some markets (though not the United States) but discontinued four months later. Representing the high end of the original Performa lineup, the Performa 600 was also based on the same architecture. The IIvx was one of the only Macintosh II models with a 32K L2 cache, following the IIfx's onboard 32K cache and the IIci's optional 32K cache card; neither the IIvi nor the Performa 600 supported an L2 cache, despite their similarities to the IIvx.
Hardware
The IIvx was sold with hard drives ranging in capacity from 40 to , three NuBus slots, and a Processor Direct Slot.
The Macintosh IIvx uses the same case as the Performa 600, Centris 650, Quadra 650 (the speed-bumped refresh of the Centris 650), and Power Macintosh 7100. The IIvx can be upgraded to Centris/Quadra 650 by swapping the logic board.
While the IIvx shares the model designation of other Macintosh II computers, Apple originally intended the IIvx to be the first computer in the Macintosh Centris line. According to Apple, their lawyers were unable to complete the trademark check on the "Centris" name in time for the release of this computer so it ended up being sold the IIvx. Machines bearing the Centris name were introduced a few months later. Notably the Macintosh Centris 650 was released four months after the IIvx for $250 less, immediately rendering the IIvx obsolete, since the 650 was powered by the 68040 CPU. The IIvx's base price was slashed by more than |
https://en.wikipedia.org/wiki/Macintosh%20IIvi | The Macintosh IIvi (also sold as the Macintosh Performa 600) is a personal computer designed, manufactured, and sold by Apple Computer from September 1992 to February 1993. The IIvi was introduced alongside the Macintosh IIvx, using a slower Motorola 68030 processor (16 MHz vs. 32 MHz) and no floating point unit. The Performa 600 models, meanwhile, are the IIvi with the IIvx's 32 MHz CPU. The IIvi was, on some benchmarks, faster than the IIvx. It is the only model in the Macintosh II family to be branded as a Performa.
This model was discontinued four months after its introduction, when the Centris 650 was introduced at a similar price point.
Models
All models include three NuBus slots and a Processor Direct Slot (PDS).
The Performa 600 models were formally introduced on September 14; shipments were delayed until October to coincide with the introduction of the IIvi and IIvx.
Introduced September 14, 1992:
Macintosh Performa 600: 32 MHz 68030, 4 or 5 MB RAM, 512 KB VRAM, 160 MB HDD. Shipped with the Apple Extended Keyboard II and a microphone.
Macintosh Performa 600CD: 5 MB RAM, 1MB VRAM, 160 MB HDD, 2× AppleCD CD-ROM. Shipped with the Apple Extended Keyboard II and a microphone.
Introduced October 19, 1992:
Macintosh IIvi: 16 MHz 68030. Sold in South America, Europe, and Japan, but not the United States. Could be configured with 40, 80, 160 or 400 MB HDD.
Timelines
References
External links
Mac IIvi at lowendmac.com.
vi
IIvi
IIvi
IIvi
Computer-related introductions in 1992
Products and services discontinued in 1993 |
https://en.wikipedia.org/wiki/FTA | FTA may refer to:
Arts and media
The Faery Tale Adventure, a computer game
Festival TransAmériques, an annual dance and theater festival in Montreal, Quebec, Canada
Free The Army tour, the F.T.A. Tour or F.T.A. Show, an American anti-Vietnam War road show for G.I.s, who knew it stood for "Fuck The Army"
F.T.A., a 1972 documentary about the road show
Free-to-air, free satellite/TV channels
FTA receiver, for receiving Free-to-Air Broadcasts
Business and commerce
Aruban Workers' Federation (Papiamento: )
Food, Tobacco, Agricultural, and Allied Workers, an American trade union
Free trade area
free trade agreement
List of bilateral free trade agreements
List of multilateral free trade agreements
Freight Transport Association, a British trade association
Mathematics
Functional-theoretic algebra
Fundamental theorem of algebra
Fundamental theorem of arithmetic
Transportation and vehicles
Futuna Airport, in Vanuatu
Frontier Flying Service, an American airline
Federal Transit Administration, part of the United States Department of Transportation
FTA, a Brazilian research rocket made by Fogtrein
Other uses
Face-threatening act, damaging someone's self esteem
Failure to appear, non-appearance when summoned to a court etc.
Fault tree analysis, system analysis methodology
FTA paper (Fast Technology for Analysis (of nucleic acids)) is chemically treated to allow for the rapid isolation of pure DNA in room temperature stable condition, suitable for archival
FTA-ABS, A diagnostic test for syphilis
Future-oriented technology analysis, a collective term from futures studies
See also
FTV (disambiguation)
FT (disambiguation) |
https://en.wikipedia.org/wiki/Language%20identification%20in%20the%20limit | Language identification in the limit is a formal model for inductive inference of formal languages, mainly by computers (see machine learning and induction of regular languages). It was introduced by E. Mark Gold in a technical report and a journal article with the same title.
In this model, a teacher provides to a learner some presentation (i.e. a sequence of strings) of some formal language. The learning is seen as an infinite process. Each time the learner reads an element of the presentation, it should provide a representation (e.g. a formal grammar) for the language.
Gold defines that a learner can identify in the limit a class of languages if, given any presentation of any language in the class, the learner will produce only a finite number of wrong representations, and then stick with the correct representation. However, the learner need not be able to announce its correctness; and the teacher might present a counterexample to any representation arbitrarily long after.
Gold defined two types of presentations:
Text (positive information): an enumeration of all strings the language consists of.
Complete presentation (positive and negative information): an enumeration of all possible strings, each with a label indicating if the string belongs to the language or not.
Learnability
This model is an early attempt to formally capture the notion of learnability.
Gold's journal article introduces for contrast the stronger models
Finite identification (where the learner has to announce correctness after a finite number of steps), and
Fixed-time identification (where correctness has to be reached after an apriori-specified number of steps).
A weaker formal model of learnability is the Probably approximately correct learning (PAC) model, introduced by Leslie Valiant in 1984.
Examples
It is instructive to look at concrete examples (in the tables) of learning sessions the definition of identification in the limit speaks about.
A fictitious session to learn a regular language L over the alphabet {a,b} from text presentation:In each step, the teacher gives a string belonging to L, and the learner answers a guess for L, encoded as a regular expression. In step 3, the learner's guess is not consistent with the strings seen so far; in step 4, the teacher gives a string repeatedly. After step 6, the learner sticks to the regular expression (ab+ba)*. If this happens to be a description of the language L the teacher has in mind, it is said that the learner has learned that language.If a computer program for the learner's role would exist that was able to successfully learn each regular language, that class of languages would be identifiable in the limit. Gold has shown that this is not the case.
A particular learning algorithm always guessing L to be just the union of all strings seen so far:If L is a finite language, the learner will eventually guess it correctly, however, without being able to tell when. Although the guess didn't change during st |
https://en.wikipedia.org/wiki/Wend | Wend may refer to:
Wends, an ethnic group
WEnd, the marker for the end of a while loop in some computer languages
WEND, a modern rock radio station in Charlotte, North Carolina, United States
Given name
Wend von Wietersheim (1900–1975), German general
Surname
Chris Wend (born 1987), German sprint canoeist
Rainer Wend (born 1954), German politician
See also
Wend Valley
Wendy
Ethnonymic surnames |
https://en.wikipedia.org/wiki/JetDirect | HP Jetdirect is the name of a technology sold by Hewlett-Packard that allows computer printers to be directly attached to a local area network. The "Jetdirect" designation covers a range of models from the external 1 and 3 port parallel print servers known as the 300x and 500x, to the internal EIO print servers for use with HP printers. The Jetdirect series also includes wireless print server (Bluetooth, 802.11b and g) models, as well as gigabit Ethernet and IPv6-compliant internal cards.
History
HP Jetdirect was first introduced in March 1991 (code named QuickSilver) with the LaserJet IIIsi network printer (code named Eli). Jetdirect is based on HP's MIO (Modular Input/Output) interface, which was designed from the ground up with the IIIsi to create a mainstream full function high performance networked printer. The initial MIO interface card had Ethernet and Token Ring physical layer variants and used various networking protocols over an AUI/BNC connection. Initially, a printer needed a separate card for each protocol, such as TCP/IP, IPX/SPX, AppleTalk, or DLC/LLC. The following year, the team applied the technology to the legacy accessory slot on the LaserJetIIs and IIIs XIO (Extended Input/Output). MIO type Jetdirect cards were also used for network connectivity on some HP/Agilent laboratory equipment, such as the 6890A and 6890 Plus series of gas chromatographs. These included unusual network connection types such as HPs I-Net, which was used as an interconnect between various pieces of hardware that controlled the 58xx and 68xx series gas chromatographs. Not until 1994 would MIO interface cards be released that could support more than one protocol per card.
The next development releases added connection interfaces. In 1992, a card with both 8P8C modular telephone and BNC connectors for Ethernet was released, and in 1993, the first external Jetdirects were introduced with a parallel interface. This enabled Jetdirect cards to connect to almost any printer, making that printer network-capable. In 1995, the Ex plus 3 was released, with 3 parallel ports on one network interface, allowing 3 printers to share 1 network address.
1997 saw the new numbering format for both internal and external Jetdirect servers. Internals began the 6xx series with the release of the 600n, multiprotocol card that supported TCP/IP, IPX/SPX, DLC/LLC, and AppleTalk over a Token Ring network; along with the 1760x series external print server - also multiprotocol. An Ethernet version of the 600n was released in 1998. In 1999, the Jetdirect autoswitch was introduced.
1998 also saw the release of 170x, the first value-line print server aimed at smaller companies that did not necessarily need full networking - only TCP/IP or IPX/SPX support. This was followed in 2000 by the Jetdirect 70x home print server.
Protocols
More advanced versions of JetDirect supported a number of network printing protocols. However, the protocol that ended up being associated with it, the |
https://en.wikipedia.org/wiki/Mobile%20BASIC | Mobile BASIC is a proprietary dialect of the BASIC programming language that can be used to program Java-enabled mobile phones. This is possible because the interpreter is a MIDlet.
References
External links
Mobile Phone Programming Home to the Mobile BASIC Java midlet.
MBTEAM.RU MobileBASIC IDE (Online/Offline)
Java device platform
Mobile software
BASIC interpreters |
https://en.wikipedia.org/wiki/Unibus | The Unibus was the earliest of several computer bus and backplane designs used with PDP-11 and early VAX systems manufactured by the Digital Equipment Corporation (DEC) of Maynard, Massachusetts. The Unibus was developed around 1969 by Gordon Bell and student Harold McFarland while at Carnegie Mellon University.
The name refers to the unified nature of the bus; Unibus was used both as a system bus allowing the central processing unit to communicate with main memory, as well as a peripheral bus, allowing peripherals to send and receive data. Unifying these formerly separate busses allowed external devices to easily perform direct memory access (DMA) and made the construction of device drivers easier as control and data exchange was all handled through memory-mapped I/O.
Unibus was physically large, which led to the introduction of Q-bus, which multiplexed some signals to reduce pin count. Higher performance PDP systems used Fastbus, essentially two Unibusses in one. The system was later supplanted by Massbus, a dedicated I/O bus introduced on the VAX and late-model PDP-11s.
Technical specifications
The Unibus consists of 72 signals, usually connected via two 36-way edge connectors on each printed circuit board. When not counting the power and ground lines, it is usually referred to as a 56-line bus. It can exist within a backplane or on a cable. Up to 20 nodes (devices) can be connected to a single Unibus segment; additional segments can be connected via a bus repeater.
The bus is completely asynchronous, allowing a mixture of fast and slow devices. It allows the overlapping of arbitration (selection of the next bus master) while the current bus master is still performing data transfers. The 18 address lines allow the addressing of a maximum of . Typically, the top is reserved for the registers of the memory-mapped I/O devices used in the PDP-11 architecture.
The design deliberately minimizes the amount of redundant logic required in the system. For example, a system always contains more slave devices than master devices so most of the complex logic required to implement asynchronous data transfers is forced into the relatively few master devices. For interrupts, only the interrupt-fielding processor needs to contain the complex timing logic. The result is that most I/O controllers can be implemented with simple logic, and most of the critical logic is implemented as a custom MSI IC.
Pinout
Type 1 lines are a normal multi-sender wired-OR bus with pull-up resistors at each end of the bus, typically on a terminator card.
Type 2 lines are selectively propagated by each card to the next slot – if the card wants to keep the request grant it will assert the SACK line and not propagate the request to the next slot. If a slot is empty, it is necessary to install a "grant continuity card" in the slot to propagate the four type 2 signals to the next card.
Type 3 signals are generated by the power supply and have only a single sender. They warn th |
https://en.wikipedia.org/wiki/Q-Bus | The Q-bus, also known as the LSI-11 Bus, is one of several bus technologies used with PDP and MicroVAX computer systems previously manufactured by the Digital Equipment Corporation of Maynard, Massachusetts.
The Q-bus is a less expensive version of Unibus using multiplexing so that address and data signals share the same wires. This allows both a physically smaller and less-expensive implementation of essentially the same functionality.
Over time, the physical address range of the Q-bus was expanded from 16 to 18 and then 22 bits. Block transfer modes were also added to the Q-bus.
Main features of the Q-bus
Like the Unibus before it, the Q-bus uses:
Memory-mapped I/O
Byte addressing
A strict master-slave relationship between devices on the bus
Asynchronous signaling
Memory-mapped I/O means that data cycles between any two devices, whether CPU, memory, or I/O devices, use the same protocols. On the Unibus, a range of physical addresses are dedicated for I/O devices. The Q-bus simplifies this design by providing a specific signal (originally called BBS7, Bus Bank Select 7 but later generalized to be called BBSIO, Bus Bank Select I/O) that selects the range of addresses used by the I/O devices.
Byte addressing means that the physical address passed on the Unibus is interpreted as the address of a byte-sized quantity of data. Because the bus actually contains a data path that is two bytes wide, address bit [0] is subject to special interpretation and data on the bus has to travel in the correct byte lanes.
A strict Master-Slave relationship means that at any point in time, only one device can be the Master of the Q-bus. This master device can initiate data transactions which can then be responded to by a maximum of one selected slave device. (This had no effect on whether a given bus cycle is reading or writing data; the bus master can command either type of transaction.) At the end of the bus cycle, a bus arbitration protocol then selects the next device to be given mastery of the bus.
Asynchronous signaling means that the bus has no fixed cycle time; the duration of any particular data transfer cycle on the bus is determined solely by the master and slave devices participating in the current data cycle. These devices use handshake signals to control the timing of the data cycle. Timeout logic within the master device limits the maximum allowed length of any given bus cycle.
Depending on its generation, the Q-bus contains 16, 18, or 22 BDAL (Bus Data/Address Line) lines. 16, 18, or 22 BDAL lines are used for the physical address portion of each bus cycle. Eight or 16 DBAL lines are then re-used for the data portion(s) of each bus cycle. Newer generations of the bus allow block mode transfer where a single bus address can be followed by more than one data cycle (with the transfers taking place at consecutive bus addresses). Because the address portion of each bus cycle can not transfer data, the use of block mode means fewer address cycl |
https://en.wikipedia.org/wiki/Open%20Source%20Vulnerability%20Database | The Open Sourced Vulnerability Database (OSVDB) was an independent and open-sourced vulnerability database. The goal of the project was to provide accurate, detailed, current, and unbiased technical information on security vulnerabilities. The project promoted greater and more open collaboration between companies and individuals. The database's motto was "Everything is Vulnerable".
The core of OSVDB was a relational database which tied various information about security vulnerabilities into a common, cross-referenced open security data source. As of December 2013, the database cataloged over 100,000 vulnerabilities. While the database was maintained by a 501(c)(3) non-profit public organization and volunteers, the data was prohibited for commercial use without a license. Despite that, many large commercial companies used the data in violation of the license without contributing employee volunteer time or financial compensation.
History
The project was started in August 2002 at the Blackhat and DEF CON Conferences by several industry notables (including H. D. Moore, rain.forest.puppy, and others). Under mostly-new management, the database officially launched to the public on March 31, 2004. The original implementation was written in PHP by Forrest Rae (FBR). Later, the entire site was re-written in Ruby on Rails by David Shettler.
The Open Security Foundation (OSF) was created to ensure the project's continuing support. Jake Kouns (Zel), Chris Sullo, Kelly Todd (AKA Lyger), David Shettler (AKA D2D), and Brian Martin (AKA Jericho) were project leaders for the OSVDB project, and held leadership roles in the OSF at various times.
On 5 April 2016, the database was shut down, while the blog was initially continued by Brian Martin. The reason for the shut down was the ongoing commercial but uncompensated use by security companies.
As of January 2012, vulnerability entry was performed by full-time employees of Risk Based Security, who provided the personnel to do the work in order to give back to the community. Every new entry included a full title, disclosure timeline, description, solution (if known), classification metadata, references, products, and researcher who discovered the vulnerability (creditee).
Process
Originally, vulnerability disclosures posted in various security lists and web sites were entered into the database as a new entry in the New Data Mangler (NDM) queue. The new entry contained only a title and links to the disclosure. At that stage the page for the new entry didn't contain any detailed description of the vulnerability or any associated metadata. As time permitted, new entries were analyzed and refined, by adding a description of the vulnerability as well as a solution if available. This general activity was called "data mangling" and someone who performed this task a "mangler". Mangling was done by core or casual volunteers. Details submitted by volunteers were reviewed by the core volunteers, called "moderators", furthe |
https://en.wikipedia.org/wiki/Multiflow | Multiflow Computer, Inc., founded in April, 1984 near New Haven, Connecticut, USA, was a manufacturer and seller of minisupercomputer hardware and software embodying the VLIW design style. Multiflow, incorporated in Delaware, ended operations in March, 1990, after selling about 125 VLIW minisupercomputers in the United States, Europe, and Japan.
While Multiflow's commercial success was small and short-lived, its technical success and the dissemination of its technology and people had a great effect on the future of computer science and the computer industry. Multiflow's computers were arguably the most novel ever to be broadly sold, programmed, and used like conventional computers. (Other novel computers either required novel programming, or represented more incremental steps beyond existing computers.)
Along with Cydrome, an attached-VLIW minisupercomputer company that had less commercial success, Multiflow demonstrated that the VLIW design style was practical, a conclusion surprising to many. While still controversial, VLIW has since been a force in high-performance embedded systems, and has been finding slow acceptance in general-purpose computing.
Early history
Technology roots
The VLIW (for Very Long Instruction Word) design style was first proposed by Joseph A. (Josh) Fisher, a Yale University computer science professor, during the period 1979-1981. VLIW was motivated by a compiler scheduling technique, called trace scheduling, that Fisher had developed as a graduate student at the Courant Institute of Mathematical Sciences of New York University in 1978. Trace scheduling, unlike any prior compiler technique, exposed significant quantities of instruction-level parallelism (ILP) in ordinary computer programs, without laborious hand coding. This implied the practicality of processors for which the compiler could be relied upon to find and specify ILP.
VLIW was put forward by Fisher as a way to build general-purpose instruction-level parallel processors exploiting ILP to a degree that would have been impractical using what would later be called superscalar control hardware. Instead, the compiler could, in advance, arrange the ILP to be carried out nearly in lock-step by the hardware, commanded by long instructions or a similar mechanism. While there had previously been processors that achieved significant amounts of ILP, they had all relied upon code laboriously hand-parallelized by the user, or upon library routines, and thus were not general-purpose computers and did not fit the VLIW paradigm.
The practicality of trace scheduling was demonstrated by a compiler built at Yale by Fisher and three of his graduate students, John Ruttenberg, Alexandru Nicolau, and especially John Ellis, whose doctoral dissertation on the compiler won the ACM Doctoral Dissertation Award in 1985. Encouraged by their compiling progress, Fisher's group started an architecture and hardware design effort called the ELI (Enormously Long Instructions) Project.
Busi |
https://en.wikipedia.org/wiki/Jumping%20Flash%21 | is a platform video game developed by Exact and Ultra and published by Sony Computer Entertainment for the PlayStation. It was released on 28 April 1995 in Japan, 29 September 1995 in PAL territories and 2 November 1995 in North America. It was re-released through the PlayStation Network store on PlayStation 3 and PlayStation Portable in 2007, in 2012 on PlayStation Vita and again in 2022 on PlayStation 4 and PlayStation 5.
Presented in a first-person perspective, the game follows a robotic rabbit named "Robbit" as he searches for missing jet pods scattered by the game's astrophysicist antagonist character Baron Aloha. Robbit must explore each section of Crater Planet to retrieve all of the jet pods, stop Aloha and save the world from being destroyed. The game was designed as a technology demonstrator for the PlayStation console and was revealed in early 1994 under the provisional title of "Spring Man". Jumping Flash! utilizes much of the game engine used in Geograph Seal, an earlier game by Exact for the Sharp X68000 home computer.
Jumping Flash! has been described as an ancestor of, as well as an early showcase for, 3D graphics in console gaming. It was generally well received by critics, who praised its graphics and unique 3D platforming gameplay, but it was eventually overshadowed by later 3D platformers of the fifth console generation. Jumping Flash! spawned two sequels: Jumping Flash! 2 and Robbit Mon Dieu. It received positive reviews at the time of release, and made an appearance in Next Generations "Top 100 Games of All Time" just one year after. The game was described as the third-most underrated video game of all time by Matt Casamassina of IGN in 2007. It holds the Guinness World Record as the "first platform video game in true 3D".
Gameplay
Jumping Flash! is presented in a first-person perspective. The player assumes the role of Robbit, a robotic rabbit, and can freely move Robbit in three-dimensional space and can rotate the camera in any direction. The top part of the screen shows the remaining time, the player's score, and a character named Kumagoro—Robbit's sidekick artificial intelligence who offers the player warnings and hints. The top left corner of the screen shows the collected power-ups; the top right corner contains the radar showing the locations of objects including enemies, power-ups, jet pods and enemy projectiles. The bottom shows a health meter on the sides and the number of remaining lives in the centre. The player starts the game with three lives; a new life is granted once one million points are earned.
The core of the gameplay is focused on the player's ability to make Robbit jump. Robbit can jump up to three times in mid-air, which allows him to reach extreme heights. Unlike other platform games that continue to face horizontally when the player jumps, in Jumping Flash! the camera tilts downwards when a double-jump or triple-jump is performed to allow the player to see Robbit's shadow and easily plan a la |
https://en.wikipedia.org/wiki/Two-port%20network | In electronics, a two-port network (a kind of four-terminal network or quadripole) is an electrical network (i.e. a circuit) or device with two pairs of terminals to connect to external circuits. Two terminals constitute a port if the currents applied to them satisfy the essential requirement known as the port condition: the current entering one terminal must equal the current emerging from the other terminal on the same port. The ports constitute interfaces where the network connects to other networks, the points where signals are applied or outputs are taken. In a two-port network, often port 1 is considered the input port and port 2 is considered the output port.
It is commonly used in mathematical circuit analysis.
Application
The two-port network model is used in mathematical circuit analysis techniques to isolate portions of larger circuits. A two-port network is regarded as a "black box" with its properties specified by a matrix of numbers. This allows the response of the network to signals applied to the ports to be calculated easily, without solving for all the internal voltages and currents in the network. It also allows similar circuits or devices to be compared easily. For example, transistors are often regarded as two-ports, characterized by their -parameters (see below) which are listed by the manufacturer. Any linear circuit with four terminals can be regarded as a two-port network provided that it does not contain an independent source and satisfies the port conditions.
Examples of circuits analyzed as two-ports are filters, matching networks, transmission lines, transformers, and small-signal models for transistors (such as the hybrid-pi model). The analysis of passive two-port networks is an outgrowth of reciprocity theorems first derived by Lorentz.
In two-port mathematical models, the network is described by a 2 by 2 square matrix of complex numbers. The common models that are used are referred to as -parameters, -parameters, -parameters, -parameters, and -parameters, each described individually below. These are all limited to linear networks since an underlying assumption of their derivation is that any given circuit condition is a linear superposition of various short-circuit and open circuit conditions. They are usually expressed in matrix notation, and they establish relations between the variables
, voltage across port 1
, current into port 1
, voltage across port 2
, current into port 2
which are shown in figure 1. The difference between the various models lies in which of these variables are regarded as the independent variables. These current and voltage variables are most useful at low-to-moderate frequencies. At high frequencies (e.g., microwave frequencies), the use of power and energy variables is more appropriate, and the two-port current–voltage approach is replaced by an approach based upon scattering parameters.
General properties
There are certain properties of two-ports that frequently occ |
https://en.wikipedia.org/wiki/Wipeout%20Fusion | Wipeout Fusion (stylised as wipEout fusion) is a futuristic racing video game developed by Studio Liverpool and published by Sony Computer Entertainment for the PlayStation 2. It is the fifth instalment in the Wipeout series and was released in February 2002 in Europe, and in June for North America. It was the first Wipeout game to be published on the PlayStation 2. The game takes place in 2160 and revolves around players competing in the F9000 anti-gravity racing league.
Wipeout Fusion received positive reviews upon release, with particular praise being directed at its techno soundtrack, but its graphics and track design received mixed responses from critics.
Gameplay
Wipeout Fusion is a racing game which is set in 2160 and revolves around players competing in the F9000 anti-gravity racing league. Players control anti-gravity ships owned by large racing corporations (collectively referred to as "teams"). Overall, the game contains 45 race tracks, 32 ship models, and 26 weapons. There are eight teams in Wipeout Fusion, each having a lead pilot and second pilot – players can choose which pilot and team they want to use before a race. Each ship has its characteristics; depending on the team selected, a ship will vary in terms of speed, acceleration, manoeuvrability, and shield strength.
The game has four race modes. Arcade mode involves a standard single race, in which the player must race against opponents and finish first to earn a gold medal; securing second or third place will reward the player with a silver or bronze medal, respectively. The AG League contains ten tournaments; each tournament has four races with sixteen competitors. Money is awarded at the end of each tournament as a result of time, damage, and skill bonuses. Players can use money to upgrade the appearance or performance of their ships. The other two race modes are "Zone" mode, which revolves around survival as the player's ship automatically accelerates to extreme speeds; and time trial mode, where the player may record their best lap times.
In addition, the game features a variety of weapons which can be utilised to destroy other opponents or for self-defence. Offensive weapons include rockets, plasma bolts, missiles, and grenades, whilst defensive weapons range from deployable mines to energy shields. Every ship is also equipped with a standard energy shield which will protect the player from damage caused by collisions or weapon fire. If a shield runs out, the ship will explode and the player in question will be eliminated from the race.
Development and release
The game was developed by Studio Liverpool (formerly known as Psygnosis prior to 2001). After the success of Wipeout 2097, the studio wanted to aim their next game at an "older, savvier crowd". Shortly after the release of Wipeout Fusion, chief designer Colin Berry said in a retrospective interview that he became disillusioned with the way the Wipeout franchise was trying to emulate games such as Nintendo's |
https://en.wikipedia.org/wiki/Wipeout%20Pure | Wipeout Pure (stylised as wipE′out pu″rE) is a futuristic racing video game developed by Studio Liverpool and published by Sony Computer Entertainment for the PlayStation Portable. It was released in 2005 on 24 March for North America, on 7 April in Japan and on September 1 in Europe. In North America and Europe, it was a launch title for the platform.
It is the sixth installment of the Wipeout series. The game takes place in the year 2197, exactly 100 years after Wipeout 2097, and revolves around players competing in the FX300 anti-gravity racing league. Developed by Studio Liverpool, production of Wipeout Pure started in August 2003 and lasted until early 2005. Throughout development, the team created entirely new user interfaces and other algorithms which sped up the development process in time for the PlayStation Portable's North American launch.
The game received positive reviews from critics upon release. Reviewers unanimously praised the graphics, track designs and general aesthetics, but some noticed occasional frame rate fluctuations.
Gameplay
Wipeout Pure is a racing game which is set in the year 2197, exactly 100 years after the events of Wipeout 2097, and revolves around players competing in the FX300 anti-gravity racing league. Players control anti-gravity ships which are owned by racing corporations (effectively referred to as 'teams' in-game). There are a total of eight teams featured in the game, with one ship available for each. Every ship has different characteristics, for example each ship has variations in handling, thrust, maximum speed and shield strength. Each craft is equipped with an energy shield which absorbs damage sustained during a race; energy is lost whenever the player's ship collides or is hit by weapon fire. If the shield runs out, the player's ship will explode and is consequently eliminated from the race. However, the player may replenish energy by absorbing weapon pick-ups.
In addition to shielding, each ship has air brakes which can be utilised for navigating through difficult corners at high speed. The game also features several weapons which can be used against opponents, although some weapons have defensive purposes. For example, an autopilot will give control of the player's ship over to the computer for a short period of time, and shields can be used to protect the player's ship from all damage, albeit temporarily. Offensive weapons include rockets, missiles, plasma bolts and mines. Game modes include a single race, tournament, time trial and an exclusive "Zone" mode, which revolves around survival as the player's ship increasingly accelerates to extreme speeds. The game also features an online multiplayer mode in addition to downloadable content, which features new ships, tracks and music.
Downloadable content
Wipeout Pure was the first PSP title to support downloadable content including extra vehicles, tracks, and artwork free of charge via the Internet. Packs of downloadable content were made a |
https://en.wikipedia.org/wiki/Augmented%20assignment | Augmented assignment (or compound assignment) is the name given to certain
assignment operators in certain programming languages (especially those derived from C). An augmented assignment is generally used to replace a statement where an operator takes a variable as one of its arguments and then assigns the result back to the same variable. A simple example is x += 1 which is expanded to x = x + 1. Similar constructions are often available for various binary operators.
In general, in languages offering this feature, most operators that can take a variable as one of their arguments and return a result of the same type have an augmented assignment equivalent that assigns the result back to the variable in place, including arithmetic operators, bitshift operators, and bitwise operators.
Discussion
For example, the following statement or some variation of it can be found in many programs:
x = x + 1
This means "find the number stored in the variable , add 1 to it, and store the result of the addition in the variable ." As simple as this seems, it may have an inefficiency, in that the location of variable has to be looked up twice if the compiler does not recognize that two parts of the expression are identical: might be a reference to some array element or other complexity. In comparison, here is the augmented assignment version:
x += 1
With this version, there is no excuse for a compiler failing to generate code that looks up the location of variable just once, and modifies it in place, if of course the machine code supports such a sequence. For instance, if x is a simple variable, the machine code sequence might be something like
Load x
Add 1
Store x
and the same code would be generated for both forms. But if there is a special op code, it might be
MDM x,1
meaning "Modify Memory" by adding 1 to x, and an optimizing compiler would generate the same code for both forms. Some machine codes offer INC and DEC operations (to add or subtract one), others might allow constants other than one.
More generally, the form is
x ?= expression
where the stands for some operator (not always ), and there may be no special op codes to help. There is still the possibility that if is a complicated entity the compiler will be encouraged to avoid duplication in accessing , and of course, if is a lengthy name, there will be less typing required. This last was the basis of the similar feature in the ALGOL compilers offered via the Burroughs B6700 systems, using the tilde symbol to stand for the variable being assigned to, so that
LongName:=x + sqrt(LongName)*7;
would become
LongName:=x + sqrt(~)*7;
and so forth. This is more general than just x:=~ + 1; Producing optimum code would remain the province of the compiler.
Semantics
In expression-oriented programming languages such as C, assignment and augmented assignment are expressions, which have a value. This allows their use in complex expressions. However, this can produce sequences of sym |
https://en.wikipedia.org/wiki/Earth%202140 | Earth 2140 is a 2D real-time strategy computer game created in 1997 by Polish-based Reality Pump Studios and published by TopWare Interactive (later acquired by Zuxxez Entertainment). It has two sequels, Earth 2150 and Earth 2160.
Plot
Earth 2140 takes place in the year 2140. Previous wars have left much of the Earth a nuclear wasteland, forcing most of the world's population into underground cities. Tensions rise between the Earth's two major factions, the Eurasian Dynasty (ED) and the United Civilized States (UCS), as both sides vie for the world's steadily dwindling resources. A UCS raid on an ED base is enough to ignite the rivalry into full-scale war as the ED fails in its bid to control Mexico and the UCS counterattacks Scandinavia, Great Britain, France, and the Iberian Peninsula.
Factions
The United Civilized States (UCS) controls all of North and South America, Western Europe and North Africa. His nation is populated mostly by hedonists. As much work as possible is done by robots. Automated butlers are the standard in UCS households, even politics and war are left up to the machines. As such, UCS citizens are often portrayed by their detractors as decadent "pigs". A glitch in the upgrade of the UCS war processor GOLAN caused the giant robot to miscalculate the military strength of the Eurasian Dynasty, thus compelling it launch an attack on the ED. After losing several battles in Mexico, GOLAN quickly adapted to the ED threat and began to retake lost ED territory and win battles in Europe. The UCS is generally more technologically advanced than its adversary, employing robot infantry and automated bipedal combat vehicles (more commonly known as mechas).
The Eurasian Dynasty (ED) controls Eastern Europe and Asia. The antithesis of the UCS, the ED is run by an autocratic monarchy under the Khan Dynasty that often makes life harsh, short, and without luxury for its citizens. As the less technologically advanced of the two factions, the ED utilizes cyborgs, traditional vehicles such as tanks, and armed helicopters in its arsenal. Because of its technological disadvantage, the ED finds itself more often on the defensive throughout the Earth 2140 storyline.
Gameplay
Earth 2140 basically requires the player to complete various objectives, mostly destroying all opposing units and structures (or capturing them). Failure of missions happens when all the player's units are wiped out or a vital objective is not met. Structures are built by deploying mobile vehicles on suitable terrain. Mines used to fund the player with money for purchasing can only be built where ore is available. Materials used to gain funds at 1000 credits a piece are carried from a mine (or material on ground) by a BANTHA truck or Heavy Lifter and placed at the Refinery and converted into credits. Mines eventually finish when all ore is extracted.
Units and vehicles can be recruited from their respective factories. Each faction has four types of units, with an exception to |
https://en.wikipedia.org/wiki/NWChem | NWChem is an ab initio computational chemistry software package which includes quantum chemical and molecular dynamics functionality.
It was designed to run on high-performance parallel supercomputers as well as conventional workstation clusters. It aims to be scalable both in its ability to treat large problems efficiently, and in its usage of available parallel computing resources. NWChem has been developed by the Molecular Sciences Software group of the Theory, Modeling & Simulation program of the Environmental Molecular Sciences Laboratory (EMSL) at the Pacific Northwest National Laboratory (PNNL). The early implementation was funded by the EMSL Construction Project.
NWChem is currently being redesigned and reimplemented for exascale computing platforms (NWChemEx ).
Capabilities
Molecular mechanics
Molecular dynamics
Hartree–Fock (self-consistent field method)
Density functional theory
Time-dependent density functional theory
Post-Hartree–Fock methods, including MP2 in the resolution of identity approximation (RI-MP2), multiconfigurational self-consistent-field (MCSCF) theory, selected configuration interaction (CI), Møller–Plesset perturbation theory (MP2, MP3, MP4), configuration interaction (CISD, CISDT, CISDTQ), and coupled cluster theory (CCSD, CCSDT, CCSDTQ, EOMCCSD, EOMCCSDT, EOMCCSDTQ). The Tensor Contraction Engine, or TCE, provides most of the functionality for the correlated methods, and can be used to develop additional many-body methods using a Python interface. A full list of approximate coupled-cluster methods is available on the website.
QM/MM
ONIOM
References
External links
NWChem Github repository
Graphical shells
ECCE (official GUI for NWChem), supports input generation, remote submission, analysis, extensive visualization
Ascalaph Designer, a free and open source software package for model construction
Chemcraft, a proprietary software for visualization and analysis of results
Computational chemistry software
Free chemistry software
Chemistry software for Linux |
https://en.wikipedia.org/wiki/Software%20quality | In the context of software engineering, software quality refers to two related but distinct notions:
Software's functional quality reflects how well it complies with or conforms to a given design, based on functional requirements or specifications. That attribute can also be described as the fitness for purpose of a piece of software or how it compares to competitors in the marketplace as a worthwhile product. It is the degree to which the correct software was produced.
Software structural quality refers to how it meets non-functional requirements that support the delivery of the functional requirements, such as robustness or maintainability. It has a lot more to do with the degree to which the software works as needed.
Many aspects of structural quality can be evaluated only statically through the analysis of the software inner structure, its source code (see Software metrics), at the unit level, and at the system level (sometimes referred to as end-to-end testing), which is in effect how its architecture adheres to sound principles of software architecture outlined in a paper on the topic by Object Management Group (OMG).
However some structural qualities, such as usability, can be assessed only dynamically (users or others acting on their behalf interact with the software or, at least, some prototype or partial implementation; even the interaction with a mock version made in cardboard represents a dynamic test because such version can be considered a prototype). Other aspects, such as reliability, might involve not only the software but also the underlying hardware, therefore, it can be assessed both statically and dynamically (stress test).
Functional quality is typically assessed dynamically but it is also possible to use static tests (such as software reviews).
Historically, the structure, classification and terminology of attributes and metrics applicable to software quality management have been derived or extracted from the ISO 9126 and the subsequent ISO/IEC 25000 standard. Based on these models (see Models), the Consortium for IT Software Quality (CISQ) has defined five major desirable structural characteristics needed for a piece of software to provide business value: Reliability, Efficiency, Security, Maintainability and (adequate) Size.
Software quality measurement quantifies to what extent a software program or system rates along each of these five dimensions. An aggregated measure of software quality can be computed through a qualitative or a quantitative scoring scheme or a mix of both and then a weighting system reflecting the priorities. This view of software quality being positioned on a linear continuum is supplemented by the analysis of "critical programming errors" that under specific circumstances can lead to catastrophic outages or performance degradations that make a given system unsuitable for use regardless of rating based on aggregated measurements. Such programming errors found at the system level represent up |
https://en.wikipedia.org/wiki/Operator-precedence%20parser | In computer science, an operator precedence parser is a bottom-up parser that interprets an operator-precedence grammar. For example, most calculators use operator precedence parsers to convert from the human-readable infix notation relying on order of operations to a format that is optimized for evaluation such as Reverse Polish notation (RPN).
Edsger Dijkstra's shunting yard algorithm is commonly used to implement operator precedence parsers.
Relationship to other parsers
An operator-precedence parser is a simple shift-reduce parser that is capable of parsing a subset of LR(1) grammars. More precisely, the operator-precedence parser can parse all LR(1) grammars where two consecutive nonterminals and epsilon never appear in the right-hand side of any rule.
Operator-precedence parsers are not used often in practice; however they do have some properties that make them useful within a larger design. First, they are simple enough to write by hand, which is not generally the case with more sophisticated right shift-reduce parsers. Second, they can be written to consult an operator table at run time, which makes them suitable for languages that can add to or change their operators while parsing. (An example is Haskell, which allows user-defined infix operators with custom associativity and precedence; consequentially, an operator-precedence parser must be run on the program after parsing of all referenced modules.)
Raku sandwiches an operator-precedence parser between two recursive descent parsers in order to achieve a balance of speed and dynamism. GCC's C and C++ parsers, which are hand-coded recursive descent parsers, are both sped up by an operator-precedence parser that can quickly examine arithmetic expressions. Operator precedence parsers are also embedded within compiler-compiler-generated parsers to noticeably speed up the recursive descent approach to expression parsing.
Precedence climbing method
The precedence climbing method is a compact, efficient, and flexible algorithm for parsing expressions that was first described by Martin Richards and Colin Whitby-Strevens.
An infix-notation expression grammar in EBNF format will usually look like this:
expression ::= equality-expression
equality-expression ::= additive-expression ( ( '==' | '!=' ) additive-expression ) *
additive-expression ::= multiplicative-expression ( ( '+' | '-' ) multiplicative-expression ) *
multiplicative-expression ::= primary ( ( '*' | '/' ) primary ) *
primary ::= '(' expression ')' | NUMBER | VARIABLE | '-' primary
With many levels of precedence, implementing this grammar with a predictive recursive-descent parser can become inefficient. Parsing a number, for example, can require five function calls: one for each non-terminal in the grammar until reaching primary.
An operator-precedence parser can do the same more efficiently. The idea is that we can left associate the arithmetic operations as long as we find operators with the same precedence, but |
https://en.wikipedia.org/wiki/Fraudcast%20News | "Fraudcast News" is the twenty-second and final episode of the fifteenth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on May 23, 2004. Episode writer Don Payne, won the Writers Guild of America's Paul Selvin Award, which honors works that focus on First Amendment issues, for his work on the episode.
Plot
Springfield holds a ceremony dedicating their newest national park, Geezer Rock, a rock formation which resembles the face of an old man in profile. As Lisa Simpson prepares to read a poem there at the behest of Mayor Quimby, Homer notices that there is a small tree growing in the eye of the rock. Fearing that it will destroy Geezer Rock over time, he rushes over and pulls it out. This causes Geezer Rock to fall apart, and everyone runs for their lives — except for Mr. Burns, who winds up in a landslide. Smithers is fearful he has lost Mr. Burns.
Lisa is saddened that no one ever heard her poem, and she publishes it on Marge's suggestion. Meanwhile, it turns out that Burns survived the horrible landslide through slithering his way out and subsisting on centipedes, insects and mole milk. However, Springfield's local news instead reports on the destruction of Geezer Rock and then labels Burns as being a hateful man nobody liked.
Lisa distributes the very first issue of her newspaper, The Red Dress Press, which is well received. She enlists the help of Bart, Milhouse Van Houten, Martin Prince, Nelson Muntz, and Ralph Wiggum among others, to publish her newspaper's second issue. Meanwhile, to improve his image after the landslide, Burns acquires all media outlets in Springfield except Lisa's newspaper. He even makes an episode of The Itchy & Scratchy Show promoting nuclear power. Later, Burns tries to bait Lisa with ponies in an attempt to acquire her newspaper, but she will not give up. Lisa is saddened when all the other employees of the newspaper leave her, but is relieved when Bart decides to stay and help Lisa publish more issues.
Burns gets back at Lisa by cutting off the Simpsons' power, so Lisa is forced to write her next issue through an old mimeograph that Principal Skinner used in Vietnam. Burns finally wins the war by interrogating Homer with a truth serum so he can damage Lisa's reputation; the following day's Springfield Shopper boasts the headline, "LISA’S A TOTAL WACKO, IMPLIES FATHER", and goes further by humiliating Milhouse's crush upon her. Lisa writes her final "I Give Up" edition and shuts down the Red Dress Press. Homer responds by creating his own newspaper, The Homer Times, with which he defends Lisa and her journalistic integrity, while many of the townspeople, inspired by Homer, also create their own newspapers to voice their individual opinions. Burns realizes that, while he succeeded in defeating Lisa and her journal, he cannot possibly buy out everyone nor stop people criticizing him. As a result, he is forced to acknowledge that no one be |
https://en.wikipedia.org/wiki/Web%20services%20protocol%20stack | A web service protocol stack is a protocol stack (a stack of computer networking protocols) that is used to define, locate, implement, and make Web services interact with each other. A web service protocol stack typically stacks four protocols:
(Service) Transport Protocol: responsible for transporting messages between network applications and includes protocols such as HTTP, SMTP, FTP, as well as the more recent Blocks Extensible Exchange Protocol (BEEP).
(XML) Messaging Protocol: responsible for encoding messages in a common XML format so that they can be understood at either end of a network connection. Currently, this area includes such protocols as XML-RPC, WS-Addressing, and SOAP.
(Service) Description Protocol: used for describing the public interface to a specific Web service. The WSDL interface format is typically used for this purpose.
(Service) Discovery Protocol: centralizes services into a common registry so that network Web services can publish their location and description, and makes it easy to discover what services are available on the network. Universal Description Discovery and Integration (UDDI) was intended for this purpose, but it has not been widely adopted.
The protocol stack can also include a range of higher-level protocols such as Business Process Execution Language (WS-BPEL) or WS-Security for security extensions.
External links
Alex Nghiem (2003) The Basic Web Services Stack
Ethan Cerami (2002) Top Ten FAQs for Web Services
innoQ (2007) Web Services Standards as of Q1 2007
Lawrence Wilkes (updated Feb 2005) The Web Services Protocol Stack
Pavel Kulchenko (2002) Web Services Acronyms, Demystified
Web services |
https://en.wikipedia.org/wiki/Beach%20City | Beach City may refer to:
Places
Beach City, Ohio
Beach City, Texas
A nickname for Berbera
Beach City, Delmarva, a fictional town in the Cartoon Network show Steven Universe
Geography
A coastal settlement with accessible beaches |
https://en.wikipedia.org/wiki/Vadstena%20bracteate | The Vadstena bracteate (Rundata Ög 178) is a gold C-bracteate found in the earth at Vadstena, Sweden, in 1774. Along with the bracteate was a gold ring and a piece of gold sheet: all were nearly melted down by a goldsmith who was stopped by a local clergyman. The bracteate was stolen in 1938 from the Swedish Museum of National Antiquities and has not yet been found.
The bracteate is believed to have been made about AD 500. In the middle of the bracteate is a four-legged animal with a man's head above it, and in front of this a bird separated from the other images by a line. This image is commonly associated with the Norse god Odin in bracteate iconography. The bracteate is most famous for containing a full listing of the Elder Futhark runic alphabet. The runes in the futhark are divided by dots into three groups of eight runes which are commonly called an ætt. The entire inscription reads:
tuwatuwa; fuþarkgw; hnijïpzs; tbemlŋo[d]
The last rune (d) is hidden below the necklace holder piece that has been molded on top of the bracteate, but archaeologists know what it is because a duplicate bracteate was found in Motala (image) which read:
(t)uwatuwa; fuþarkgw; hnijïpzs; tbemlŋod.
The first part of the inscription is not yet understood but is assumed to be associated with magic, however this is a common stock-explanation for runic text that has not yet been interpreted.
The Motala bracteate was struck with the same die and was found at a nearby town in the same province, Östergötland, in 1906.
See also
Kylver Stone
Runic magic
Sjælland bracteate 2
References
Elder Futhark inscriptions
Bracteates
Individual items of jewellery
Proto-Norse language
6th-century artifacts
Stolen works of art |
https://en.wikipedia.org/wiki/Dragon%20Breed | is a horizontally scrolling shooter video game produced by Irem and released in arcades in 1989. It runs on M72 and M81 hardware. Activision released home computer conversions in 1990.
Gameplay
The player controls King Kayus, who rides a large dragon named Bahamoot. Bahamoot is immune to enemy attacks, capable of blocking most projectiles and damaging enemies on contact; Kayus, however, is not, but is armed with a forward-firing crossbow.
Bahamoot's body is flexible and responds to Kayus' movement, enabling Kayus to use Bahamoot as a mobile shield or as a whip-like weapon. The player can also circle the tail around a group of enemies to kill them. The tail of the yellow or blue dragon can be coiled around the player to offer almost complete invulnerability for a limited time.
Bahamoot can also spit fireballs. By holding the fire button down, the dragon will build up fire in its mouth; the longer the button is held down, the more powerful the fireball will be. There are four levels of fireball power; at its strongest, the fireball resembles a dragon's head.
The game also contains some platforming elements - the human is able to dismount on horizontal platforms.
Power-ups comes in the form of orbs acquired by shooting small green dragons that appear intermittently throughout stages, or they can be collected from the ground on foot. There are four different types of orbs, each of will change Bahamoot to a different color and grant him a new attack power. The red orb enables the dragon to breathe a flame. Gold enables Bahamoot's body to fire crescents in all directions. Silver enables the dragon to produce up to four miniature dragons, which home in on enemies. Blue enables Bahamoot to fire downward bolts of electricity from its underside. The player can further enhance Bahamoot's powers by picking up the same type of orb up to three times.
Plot
The following is transcribed from the game's promotional brochure.
Reception
In Japan, Game Machine listed Dragon Breed on their August 15, 1989 issue as being the fourth most-successful table arcade unit of the month.
References
External links
Dragon Breed at System 16
Dragon Breed at Dragon City Apk
Dragon Breed at
Dragon Breed at Atari Mania
1989 video games
Amiga games
Arcade video games
Amstrad CPC games
Atari ST games
Commodore 64 games
ZX Spectrum games
Horizontally scrolling shooters
Irem games
Video games about dragons
Video games developed in Japan |
https://en.wikipedia.org/wiki/CMT%20%28Canadian%20TV%20channel%29 | CMT is a Canadian English language discretionary specialty channel owned as a joint venture between Corus Entertainment (which owns a controlling 90% interest) and Paramount Networks Americas (which owns the remaining 10%), owners of the flagship CMT channel in the United States.
As with its U.S. counterpart, CMT previously devoted a large amount of its programming to country music, with such programming as music videos and concert specials. Over time, the channel shifted its focus towards family-oriented general entertainment such as sitcoms, to the point where music programming was eventually axed in August 2017.
It is one of two Paramount-branded channels that are owned by Corus; the companies also partner on Nickelodeon (which is wholly owned by Corus).
History
Prior to the launch of CMT Canada, the U.S.-based country television network, Country Music Television, had been available in Canada since 1984, one year after the channel's launch in the United States.
In June 1994, the Canadian Radio-television and Telecommunications Commission (CRTC) licensed a series of new Canadian specialty television channels; among the ones whose licence was granted was The Country Network, whose programming provisions required it to primarily feature country music videos (a minimum of 90%). The licence was granted to a partnership between Maclean-Hunter (which owned 60% majority control) and Rawlco Communications (which owned the remaining 40%).
At this time, the CRTC had a policy that if a Canadian specialty service was licensed and that service's format was competitive with a foreign service's format that was licensed to operate in Canada, the foreign service could be dropped from the list of channels eligible for cable carriage in Canada. Due to Country Music Television's competitive format, the CRTC terminated CMT's eligibility rights in Canada as a foreign service on June 6, 1994. Television distributors such as cable and satellite television operators could continue distributing Country Music Television until The Country Network began operations.
In March 1994, one year before the channel's launch, Maclean-Hunter had been purchased by Rogers Communications.
On January 1, 1995, the channel launched as New Country Network (NCN). On that date, Canadian pay television service providers were not allowed to offer Country Music Television. In retaliation for being barred from Canada, the U.S. service launched a complaint under the North American Free Trade Agreement and ceased carriage of videos by Canadian artists without major U.S. record deals.
After months of negotiations, the matter was settled when it was announced that CBS Cable, then owners of CMT, would purchase a minority stake in the service. NCN was relaunched as CMT on October 31, 1996. The majority interest was acquired by Shaw Communications at the same time; it was later included in the spinoff of the broadcasting assets then owned by Shaw as Corus Entertainment in 1999. The controversy |
https://en.wikipedia.org/wiki/Scientific%20Data%20Systems | Scientific Data Systems (SDS), was an American computer company founded in September 1961 by Max Palevsky, Arthur Rock and Robert Beck, veterans of Packard Bell Corporation and Bendix, along with eleven other computer scientists. SDS was an early adopter of integrated circuits in computer design and the first to employ silicon transistors. The company concentrated on larger scientific workload focused machines and sold many machines to NASA during the Space Race. Most machines were both fast and relatively low priced. The company was sold to Xerox in 1969, but dwindling sales due to the oil crisis of 1973–74 caused Xerox to close the division in 1975 at a loss of hundreds of millions of dollars. During the Xerox years the company was officially Xerox Data Systems (XDS), whose machines were the Xerox 500 series.
History
Early machines
Throughout the majority of the 1960s the US computer market was dominated by "Snow White", IBM, and the "Seven Dwarves", Burroughs,
UNIVAC, NCR, Control Data Corporation, Honeywell, General Electric, and RCA. SDS entered this well developed market and was able to introduce a time sharing computer at just the right time. Much of their success was due to the use of silicon-based transistors in their earliest designs, the 24-bit SDS 910 and SDS 920 which included a hardware (integer) multiplier. These are arguably the first commercial systems based on silicon, rather than germanium, which offered much better reliability for no real additional cost.
Additionally, the SDS machines shipped with a selection of software, notably a FORTRAN compiler, developed by Digitek, that made use of the systems' Programmed OPeratorS (POPS), and could compile, in 4K 24-bit words, programs in a single pass without the need for magnetic tape secondary storage. For scientific users writing small programs, this was a real boon and dramatically improved development turnaround time.
The 910 and 920 were joined by the SDS 9300, announced in June 1963. Among other changes, the 9300 included a floating point processor for higher performance. The performance increase was dramatic; the 910/920 needed 16 microseconds to add two 24-bit integers, the 9300 only 1.75, almost 10 times as fast. The 9300 also increased maximum memory from 16 kWords to 32 kWords. Although its instruction format resembled that of the earlier machines, it was not compatible with them.
In December 1963 SDS announced the SDS 930, a major re-build of the 9xx line using integrated circuits (ICs) in the central processor. It was comparable to the 9300 in basic operations, but was generally slower overall due to the lack of the 9300's memory interlace capability and hardware floating point unit (although a hardware floating point "correlation and filtering unit" was available as an expensive option). The 930 cost less than half that of the original 9300, at about $105,000 (). Cut-down versions of the 920 also followed, including the 12-bit SDS 92, and the IC-based 925.
Proje |
https://en.wikipedia.org/wiki/CKLU-FM | CKLU-FM is a Canadian radio station, which broadcasts at FM 96.7 in Sudbury, Ontario. It is the campus radio station of the city's Laurentian University, and airs programming in both English and French, along with special interest programming for other language communities in the area.
History
The station launched in 1984 as a closed circuit station, available only in certain locations on campus. In 1986, the station was added to cable FM service in Sudbury, using the unofficial callsign CFLR. The station operated at cable 106.7 FM.
In 1996, the station applied to the CRTC for an FM license. The application was granted, and the station began broadcasting over the airwaves at 96.7 MHz in 1997. The station was not able to retain the CFLR callsign, due to the existence of another CFLR broadcasting in La Romaine, Quebec.
Its studios underwent a significant equipment upgrade in 2008. The station added Internet streaming to its website in September 2008.
Initially located in a portable classroom, the station later moved to studios in Laurentian University's Parker Building. In March 2016, it was announced that the CKLU studios would be relocating to the McEwen School of Architecture campus in downtown Sudbury. In September 2016, CKLU 96.7 FM moved to its new location on Elgin Street, inside the McEwen School of Architecture.
Programming
In addition to locally produced programming, the station also airs several syndicated public radio programs, including the Putumayo World Music Hour, Deconstructing Dinner, CIUT-FM's environmental news series The Green Majority, Radio Goethe and Democracy Now!.
Local programming has included Lunch with the Trinnie, which profiles the city's local multicultural communities, City Spins, which features interviews and music by local musicians, All My Friends Radio, and Minotaur Hour, hosted by musician Nathan Lawr. A short-run science series, Sudbury Knows No Bounds, aired in 2008 in conjunction with Science North. Some students from the city's Cambrian College, which does not have its own radio station, also volunteer for CKLU.
Other shows have included Above the Waste, a student based show plays all different types of metal. Miller Time is another student based show that has been running for three years (since 2007), on Monday and Thursday mornings at 7 am and showcases a unique political satire, comedy, and opinion from host Jason Miller. Rhythms of Clublife is a show which features DJ's of House and Trance mixing live over the air, hosted by DJ Phluke Nine on Saturday evenings at 10 PM, giving many listeners and club goers a pumped up attitude while on their way to local venues. Arts at Nine, cohosted by John McHenry of the Sudbury Theatre Centre, is a weekly magazine and interview show that profiles local people in the arts community.
The station also produced The Brent Holland Show, a nationally syndicated interview series.
Since 2018, CKLU-FM had been broadcasting the Sudbury Wolves hockey play-by-play ga |
https://en.wikipedia.org/wiki/Cirrus%20%28interbank%20network%29 | Mastercard Cirrus is a worldwide interbank network that provides cash to Mastercard cardholders. As a subsidiary of Mastercard Inc., it connects all Mastercard credit, debit and prepaid cards, as well as ATM cards issued by various banks worldwide bearing the Mastercard / Maestro logo.
Founded in 1982, prior to its acquisition by Mastercard in 1987, Cirrus System, LLC was owned by Bank of Montreal, BayBanks Inc., First Interstate Bancorp, Mellon Bank, NBD Bancorp Inc. and Norwest Corp.
By default, Mastercard, Maestro cards are linked to the Cirrus network, but very often all three logotypes will be shown. Canadian, American and Saudi Arabian ATMs use this network alongside their local networks and many banks have adopted Cirrus as their international interbank network alongside either a local network, the rival Plus ATM network owned by Visa, or both. In countries such as India and Bangladesh, the Cirrus network also serves as a local interbank network as well as an international network.
Logos
The first logo, advertised from 1982 until 1992, was then changed to match those representing the other subsidiaries of Mastercard, which acquired Cirrus in 1987. The only exception is the colour pattern change. This can also be noticed through the re-branding in 2016, since all the logos of Mastercard, Maestro and Cirrus have been equally modified.
References
Further reading
External links
Mastercard Profile
Mastercard ATM Locator
Financial services companies established in 1982
1987 mergers and acquisitions
Interbank networks
Mastercard |
https://en.wikipedia.org/wiki/Plus%20%28interbank%20network%29 | Visa Plus is a worldwide interbank network that provides cash to Visa cardholders. As a subsidiary of Visa Inc., it connects all Visa credit, debit and prepaid cards, as well as ATM cards issued by various banks worldwide bearing the Visa / Electron logo.
Plus System, Inc. started out as a consortium formed by 34 major U.S. banks to build a national network of automated teller machines (ATM). It initially was composed of 2,000 ATMs linking 1,000 banks and their customers in 47 states.
As the booming ATM industry outgrew regional networks and began to go nationwide in the mid-1980s, credit-card giant Visa sought entry in the lucrative ATM network business and acquired a third of Plus System in 1987. Currently, there are over one million Plus-linked ATMs in 170 countries worldwide.
By default, Visa / Electron cards are linked to the Plus network, but very often all three logotypes will be shown.
Plus is widely used as a local interbank network most common in the United States where networks such as STAR, NYCE and Pulse also compete. It is also used in Canada, though it is significantly smaller than Interac there, and in places such as India and Indonesia where there are many interbank networks. The main competitor of Plus System is the Cirrus network, which is owned by Mastercard, Visa's longtime rival.
References
External links
Visa ATM locator
The Premier ATM Network: 1982-1992
Financial services companies established in 1982
Interbank networks
Visa Inc. |
https://en.wikipedia.org/wiki/NYCE | The New York Currency Exchange (NYCE) is an interbank network connecting the ATMs of various financial institutions in the United States and Canada. NYCE also serves as an EFTPOS network for NYCE-linked ATM cards.
NYCE is based in Secaucus, New Jersey. Rivals of the network include STAR and Discover Card's Pulse. It is owned by Fidelity National Information Services.
Origins
"NYCE" originally started as a local ATM network of banks located in the New York metro area. It was one of the first networks of its kind, originating shortly after the invention of the ATM (automatic teller machine). Membership was open to all banks, credit unions and savings banks, and as use of ATM's grew the network spread beyond its original New York Metro area; by the early 1990s, NYCE was the largest regional ATM network in the US.
The public brand name, "NYCE", is an acronym for "New York Cash Exchange"; the original corporate name was the New York Switch Corporation.
The banks which founded and originally owned the network were: National Westminster Bank USA, Chase Manhattan, Manufacturers Hanover, Chemical Bank, Barclays Bank, Marine Midland Bank and the Bank of New York; in later years both BayBank and Fleet Bank from Boston became owners as well. The original Chairman of the Board was Edward Coakley of National Westminster Bank; some of the other members of the Board of Directors were Donald L. Boudreau and Ron Braco of Chase Manhattan, Gary Roboff and Michael Hegarty of Chemical Bank, Stu Segal and Roger Goldman of National Westminster, Robert Muth of Marine Midland, Bob Shay and Lindsey Lawrence of BayBank, and Dennis Lynch of Fleet.
Current status
At present, NYCE is the primary network of 301,500 ATMs with a customer base of 89 million users. NYCE is no longer owned by New York and Boston banks; it was wholly owned by Metavante Corporation, formerly a subsidiary of M&I Bank and based in the Milwaukee suburb of Brown Deer, Wisconsin. On October 1, 2009, Metavante officially became a subsidiary of Fidelity National Information Services.
See also
ATM usage fees
External links
NYCE ATM network
FIS (company)
Interbank networks |
https://en.wikipedia.org/wiki/Edward%20G.%20Coffman%20Jr. | Edward Grady "Ed" Coffman Jr. is a computer scientist. He began his career as a systems programmer at the System Development Corporation (SDC) during the period 1958–65. His PhD in engineering at UCLA in 1966 was followed by a series of positions at Princeton University (1966–69), The Pennsylvania State University (1970–76), Columbia University (1976–77), and the University of California, Santa Barbara (1977–79). In 1979, he joined the Mathematics Center at Bell Laboratories where he stayed until his retirement as a Distinguished Member of Technical Staff 20 years later. After a one-year stint at the New Jersey Institute of Technology, he returned to Columbia University in 2000 with appointments in Computer Science, Electrical Engineering, and Industrial Engineering and Operations Research. He retired from teaching in 2008 and is now a Professor Emeritus still engaged in research and professional activities.
Research
Coffman is best known for his seminal research together with his international collaborations, measured in part by some 150 co-authors in his collection of publications. His work can be found in over 180 articles in technical journals devoted to original research contributions. He published 4 graduate-level text books, and papers in the proceedings of some 250 conferences and workshops, most of these being preliminary versions of journal articles. In his research, Coffman has been a generalist following many parallel paths in engineering and applied mathematics. The directions he has taken have drawn on the tools of combinatorial optimization and the theory of algorithms, along with those of applied probability and stochastic processes. The processes studied include those in the theories of scheduling, bin packing, sequential selection, graphs, and dynamic allocation, along with those in queueing, polling, reservation, moving-server, networking, and distributed local-rule systems (e.g. cellular automata). His contributions have been divided between mathematical foundations and the design and analysis of approximation algorithms providing the basis for engineering solutions to NP-hard problems. Computer and network engineering applications have been broad in scope; a partial list includes research addressing problems in the scheduling and storage allocation functions of computer operating systems, storage architectures, data structures, computer timing problems such as deadlocks and synchronization, Internet congestion, peer-to-peer file sharing networks, stream merging, self-assembly processes of molecular computing, minimalist algorithms in sensor networks, optical burst switching, and dynamic spectrum management in cognitive networks. The list expands greatly when including the myriad applications in industrial engineering and operations research of Coffman's research in scheduling and bin-packing theory in one and two dimensions. As of 11 November 2015, his works have been cited 13,597 times, and he has an h-index of 55.
Co |
https://en.wikipedia.org/wiki/QIO | QIO (Queue I/O) is a term used in several computer operating systems designed by the former Digital Equipment Corporation (DEC) of Maynard, Massachusetts.
I/O operations on these systems are initiated by issuing a QIO call to the kernel. There are two types of QIO - Queue I/O and Queue I/O with Wait.
For QIO without wait, the call returns immediately. If the request is successfully enqueued, the actual operation occurs asynchronously. On completion, status is returned in the QIO status doubleword. The QIO request may also specify that completion set an event flag or issue an Asynchronous System Trap (AST).
The call may also be issued as QIOW (Queue I/O and Wait for completion), allowing synchronous I/O. In this case, the wait-for-event-flag operation is combined so the call does not return until the I/O operation completes or fails.
The following operating systems implement QIO(W):
RSX-15
RSX-11 (including all of the variants)
RSTS/E (synchronous only, emulated by the RSX runtime system)
OpenVMS
QIO arguments in VMS
Under VMS, the arguments to the QIO call are:
The event flag to set when the operation completes. It isn't possible to not specify an event flag; flag 0 is valid. It is perfectly permissible to have multiple simultaneous operations that set the same event flag on completion. It is then up to the application to sort out any confusion this might cause, or just ignore that event flag.
The channel, a small integer previously associated with the device. At this level, all operations on disk files and directories (filename parsing, directory lookup, file opening/closing) are done by appropriate QIO requests.
The function code to be performed. 6 bits are assigned to the basic code (such as read, write), with a further 10 bits for "modifiers" whose meaning depend on the basic code.
The optional I/O status block (IOSB), which is cleared by the QIO call, and filled in on completion of the I/O operation. The first two bytes hold the completion status (success, end of file reached, timeout, I/O error, etc.), while the next two bytes normally return the number of bytes read or written in the operation. The meaning, if any, of the last four bytes is operation-dependent.
The optional AST routine to invoke when the operation completes.
An additional parameter (whose meaning is up to the caller) to be passed to the AST routine.
A partially standardized list of up to six parameters known as P1 through P6. The first two parameters typically specify the I/O buffer starting address (P1), and the I/O byte count (P2). The remaining parameters vary with the operation, and the particular device. For example, for a computer terminal, P3 might be the time to allow for the read to complete whereas, for a disk drive, it might be the starting block number of the transfer.
QIO completion
There are three different ways to sense when the queued I/O operation has completed:
When the event flag becomes set.
When the first two bytes of the I |
https://en.wikipedia.org/wiki/GeoServer | In computing, GeoServer is an open-source server written in Java that allows users to share, process and edit geospatial data. Designed for interoperability, it publishes data from any major spatial data source using open standards. GeoServer has evolved to become an easy method of connecting existing information to virtual globes such as Google Earth and NASA World Wind as well as to web-based maps such as OpenLayers, Leaflet, Google Maps and Bing Maps. GeoServer functions as the reference implementation of the Open Geospatial Consortium Web Feature Service standard, and also implements the Web Map Service, Web Coverage Service and Web Processing Service specifications.
Goals
GeoServer aims to operate as a node within a free and open Spatial Data Infrastructure. Just as the Apache HTTP Server has offered a free and open web server to publish HTML, GeoServer aims to do the same for geospatial data.
Features
GeoServer reads a variety of data formats, including:
PostGIS
Oracle Spatial
ArcSDE
IBM Db2
MySQL
MongoDB
Apache Solr
Shapefiles
GeoTIFF
GTOPO30
ECW, MrSID
JPEG2000
Through standard protocols it produces KML, GML, Shapefile, GeoRSS, PDF, GeoJSON, JPEG, GIF, SVG, PNG and more. In addition, one can edit data via the WFS transactional profile (WFS-T). GeoServer includes an integrated OpenLayers client for previewing data layers.
GeoServer additionally supports efficient publishing of geospatial data to Google Earth through the use of network links, using KML. Advanced features for Google Earth output include templates for customized pop-ups, time and height visualizations, and "super-overlays".
GeoServer relies on GeoTools, a GIS library.
Usage
MassGIS (Massachusetts state GIS)
MACRIS Maps (Massachusetts Historical Commission)
TriMet (Transit agency for Portland, Oregon)
Ordnance Survey (National Mapping Agency of the UK)
Institut Géographique National (National Mapping Agency of France)
GBIF (Global Biodiversity Information Facility)
World Bank
Global Earthquake Model
GMOS (Global Mercury Observation System)
FAO (Food and Agriculture Organization of the United Nations)
New York City Department of Information Technology and Telecommunications
TeamSurv
ITU (International Telecommunication Union)
Architecture
GeoServer uses the Spring Framework, providing a request dispatch architecture for modules implementing OGC services. The web administration application uses wicket, allowing extensions to contribute additional configuration screens. The application provides a REST API implemented using the spring-mvc-framework.
GeoServer is a web application, supporting any common servlet container (a standalone distribution is available with the Jetty (web server) as an embedded server). GeoWebCache, a Java-based caching component similar to TileCache, is bundled with GeoServer, but available separately. Similarly, GeoServer packages GeoTools as a Java library, but it is also available separately.
GeoServer is a |
https://en.wikipedia.org/wiki/Asynchronous%20System%20Trap | Asynchronous System Trap (AST) refers to a mechanism used in several computer operating systems designed by the former Digital Equipment Corporation (DEC) of Maynard, Massachusetts.
Mechanism
Various events within these systems can be optionally signalled back to the user processes via the AST mechanism. These ASTs act like subroutine calls but they are delivered asynchronously, that is, without any regard to the context of the main thread. Because of this, care must be taken:
to ensure that any code that is shared between the main thread and the AST must be designed to be reentrant, and
any data that is shared must be safe against corruption if modified at any time by the AST. Otherwise, the data must be guarded by blocking ASTs during critical sections.
ASTs are most commonly encountered as a result of issuing QIO calls to the kernel. Completion of the I/O can be signalled by the issuance of an AST to the calling process/task. Certain runtime errors could also be signalled using the AST mechanism. Within OpenVMS, Special Kernel-Mode ASTs are used as the standard mechanism for getting relatively convenient access to a process context (including getting the process paged into physical memory as may be needed). These types of ASTs are executed at the highest possible per-process priority the next time the scheduler makes that process current, and are used among other things for retrieving process-level information (in response to a $GETJPI "getjob/process information" system call) and for performing process deletion.
The following operating systems implement ASTs:
RSX-11 (including all of the variants)
RSTS/E
OpenVMS
ASTs are roughly analogous to Unix signals. The important differences are:
There are no "signal codes" assigned to ASTs: instead of assigning a handler to a signal code and raising that code, the AST is specified directly by its address. This allows any number of ASTs to be pending at once (subject to process quotas).
ASTs never abort any system call in progress. In fact, it is possible for a process to put itself into a "hibernate" state (with the $HIBER system call), or to wait for an event flag by calling e.g. $WAITFR, whereupon it does nothing but wait for ASTs to be delivered. When an AST is delivered (triggered by an IO completion, timer, or other event), the process is temporarily taken out of the wait to execute the AST. After the AST procedure completes, the call that put the process into hibernation or the event flag wait is made again; in essence, the reason for the wait is re-evaluated. The only way to get out of this loop (apart from process deletion) is to execute a $WAKE or $SETEF system call to satisfy the wait. This can be done by the process itself by invoking $WAKE or $SETEF within the AST, or (if a global event flag is used) $SETEF within another process.
VAX/VMS V4 and later implemented an interesting optimization to the problem of synchronizing between AST-level and non-AST-level code. A system serv |
https://en.wikipedia.org/wiki/Jeri%20Ellsworth | Jeri Janet Ellsworth (born August 14, 1974) is an American entrepreneur, computer chip designer and inventor. She gained fame in 2004 for creating a complete Commodore 64 emulator system on a chip housed within a joystick, called Commodore 30-in-1 Direct to TV. It runs 30 video games from the 1980s, and at peak, sold over 70,000 units in a single day via the QVC shopping channel.
Ellsworth was hired by Valve Corporation to develop augmented reality hardware, but was terminated in 2013. She co-founded CastAR to continue the work—with permission—but the company shut down on June 26, 2017 without completing development. She started another company, Tilt Five, to create AR hardware based on the same principles.
Ellsworth has publicly talked about various homebrew projects, such as how to manufacture semiconductor chips at home.
Early life
Ellsworth was born in Georgia and grew up in the towns of Dallas, Oregon and Yamhill, Oregon. Her mother died when she was one. Ellsworth was raised by her father, Jim, a car mechanic and Mobil service station owner.
When she was eight years old, she disassembled her toys to learn how they worked. In response her father stopped buying toys, put an empty box at his work saying "bring your broken electronic gizmos", and every few weeks, gave them to her. She started making simple modifications to them. She persuaded her father to let her use a Commodore 64 computer which had been purchased for her brother. She taught herself to program by reading the manual. She earned spending money working for her father, pumping gas, cleaning wrenches, replacing oil filters, and other "mechanical things".
In high school, she drove dirt track racing cars with her father and began designing new models in his workshop, eventually selling custom race cars. She dropped out of high school to continue the business.
Computer stores
In 1995, at the age of 21, Ellsworth tired of race track social atmosphere, so she and a friend started a business assembling and selling computers based around the Intel 486 microprocessor. When she and her partner had a disagreement, Ellsworth opened a separate business in competition. This became a chain of four stores, "Computers Made Easy", selling consumer electronics services and equipment in the Willamette Valley towns of Canby, Monmouth, & Albany, Oregon.
When profit margins shrank, she sold the chain in 2000 and moved to Walla Walla, Washington to attend Walla Walla College, studying circuit design. She left after a year because of a "cultural mismatch". Ellsworth said that questioning professors' answers was frowned upon.
Hardware design
In 2000, Ellsworth unveiled a prototype video expansion for the C64 at a Commodore Exposition. Ellsworth then began designing digital circuits that mimicked the behavior of the Commodore 64. In 2002, she designed the chip used in the C-One as an enhanced Commodore 64 which could also emulate other home computers of the early 1980s, including the VIC-20 |
https://en.wikipedia.org/wiki/Suffix%20array | In computer science, a suffix array is a sorted array of all suffixes of a string. It is a data structure used in, among others, full-text indices, data-compression algorithms, and the field of bibliometrics.
Suffix arrays were introduced by as a simple, space efficient alternative to suffix trees. They had independently been discovered by Gaston Gonnet in 1987 under the name PAT array .
gave the first in-place time suffix array construction algorithm that is optimal both in time and space, where in-place means that the algorithm only needs additional space beyond the input string and the output suffix array.
Enhanced suffix arrays (ESAs) are suffix arrays with additional tables that reproduce the full functionality of suffix trees preserving the same time and memory complexity.
The suffix array for a subset of all suffixes of a string is called sparse suffix array. Multiple probabilistic algorithms have been developed to minimize the additional memory usage including an optimal time and memory algorithm.
Definition
Let be an -string and let denote the substring of ranging from to inclusive.
The suffix array of is now defined to be an array of integers providing the starting positions of suffixes of in lexicographical order. This means, an entry contains the starting position of the -th smallest suffix in and thus for all : .
Each suffix of shows up in exactly once. Suffixes are simple strings. These strings are sorted (as in a paper dictionary), before their starting positions (integer indices) are saved in .
Example
Consider the text =banana$ to be indexed:
The text ends with the special sentinel letter $ that is unique and lexicographically smaller than any other character. The text has the following suffixes:
These suffixes can be sorted in ascending order:
The suffix array contains the starting positions of these sorted suffixes:
The suffix array with the suffixes written out vertically underneath for clarity:
So for example, contains the value 4, and therefore refers to the suffix starting at position 4 within , which is the suffix ana$.
Correspondence to suffix trees
Suffix arrays are closely related to suffix trees:
Suffix arrays can be constructed by performing a depth-first traversal of a suffix tree. The suffix array corresponds to the leaf-labels given in the order in which these are visited during the traversal, if edges are visited in the lexicographical order of their first character.
A suffix tree can be constructed in linear time by using a combination of suffix array and LCP array. For a description of the algorithm, see the corresponding section in the LCP array article.
It has been shown that every suffix tree algorithm can be systematically replaced with an algorithm that uses a suffix array enhanced with additional information (such as the LCP array) and solves the same problem in the same time complexity.
Advantages of suffix arrays over suffix trees include improved space requirement |
https://en.wikipedia.org/wiki/Sett | A sett or set is a badger's den. It usually consists of a network of tunnels and numerous entrances. The largest setts are spacious enough to accommodate 15 or more animals with up to of tunnels and as many as 40 openings. Such elaborate setts with extensive tunneling take many years for badgers to complete. One sett in Southern England spreads over an estimated area in excess of 2,000 square metres – precise measurement has not been attempted. Another sett, in north-eastern Germany, has been shown to have been in use for over ten thousand years. Setts are typically excavated in soil that is well drained and easy to dig, such as sand, and situated on sloping ground where there is some cover.
Sett tunnels are usually between beneath the ground, and they incorporate larger chambers used for sleeping or rearing young. These chambers are lined with dry bedding material such as grass, straw, dead leaves or bracken. Tunnels are wider than they are high, typically around wide by high, which matches a badger's wide and stocky build.
The material excavated by the badgers forms large heaps on the slope below the sett. Among this material may be found old bedding material, stones with characteristic heavy scratch-marks, and sometimes even the bones of long-dead badgers cleared out by later generations. Most setts have several active entrances, several more that are used rarely, and some that have fallen into disuse.
Setts are not always excavated entirely in soil. Sometimes they are under the shelter of a shed, or in a pile of timber or rocks. Badgers also excavate them under man-made structures like building foundations, concrete sidewalks, and paved roadways. This can lead to subsidence, and other damage to such structures.
Badger colonies often use several setts: a large main sett in the center of a colony's territory and occupied by most of a colony's members, and one or more smaller outlier setts. Outlier setts may have only two or three entrances and may be used by a small number of colony members when nearby food sources are in season or in autumn when the main sett is crowded with the year's young.
Badgers typically retreat to their setts at daybreak and come out at dusk. In cold regions, setts are dug below the level at which the ground freezes, and all members of the clan sleep in the same chamber, possibly to share body heat.
Sometimes setts or parts of setts that are not being used by badgers are occupied by rabbits or foxes.
Legal protections
In the United Kingdom, badger setts are protected from disturbance or destruction under the Protection of Badgers Act 1992.
References
External links
Badgers
Shelters built or used by animals |
https://en.wikipedia.org/wiki/Crash%20Bandicoot%202%3A%20Cortex%20Strikes%20Back | Crash Bandicoot 2: Cortex Strikes Back is a 1997 platform video game developed by Naughty Dog and published by Sony Computer Entertainment for the PlayStation. It is a sequel to Crash Bandicoot (1996), and is part of the Crash Bandicoot series.
Taking place on a fictional group of islands near Australia, Crash Bandicoot 2 follows the adventures of the anthropomorphic bandicoot named Crash. Crash is abducted by series villain Doctor Neo Cortex, who tricks him into thinking he wants to save the world. Crash is thrust into several parts of N. Sanity Island in order to gather crystals that will allow Cortex to contain the power of an upcoming planetary alignment and keep the planet from being destroyed. Crash's sister Coco and Cortex's former assistant Doctor Nitrus Brio try to warn him about Cortex, with the latter urging Crash to gather gems instead of crystals.
Cortex Strikes Back received positive reviews from critics and is widely considered to be superior to its predecessor. Much of the praise went to the game's graphics, controls and music, while criticisms focused on the trial-and-error gameplay, lack of level variety, easy boss levels and lack of innovation as a platform game. The game went on to become one of the best-selling PlayStation video games of all time and replaced its predecessor as the highest-selling Western title in Japan at the time, selling more than 800,000 copies in the country by April 1998. A remastered version was included in the Crash Bandicoot N. Sane Trilogy collection, released on the PlayStation 4 in June 2017, and ported to other platforms in June 2018.
Gameplay
Cortex Strikes Back is a platform game in which the player character is the titular Crash Bandicoot. The goal of the game is to gather 25 crystals for Crash's nemesis Doctor Neo Cortex. The crystals are scattered between 25 different levels, accessible via "Warp Rooms", which are hub areas of the game. A level is cleared by collecting its respective crystal and reaching the end of its path, which returns Crash to the Warp Room. Each Warp Room contains five levels. When all five levels are cleared, the player must defeat a boss character before gaining access to the next Warp Room. The player is given a certain amount of lives, which are lost when Crash is attacked by an enemy, or falls into water or a pit. If the player runs out of lives, the game is over. However, it can be continued by selecting "Yes" at the "Continue?" screen.
Crash has the ability to jump into the air and land on an enemy character, spin in a tornado-like fashion to knock enemies off-screen, slide across the ground, and perform a body slam to break certain objects. Crash can jump higher than he normally can if he jumps immediately following a slide. All of these techniques can be used as offensive measures against most enemies, who serve to deter Crash's progress. Enemies with deadly topsides cannot be jumped on, while enemies that attack from the front or have side spikes must be |
https://en.wikipedia.org/wiki/Crash%20Bandicoot%3A%20Warped | Crash Bandicoot: Warped, known in Europe as Crash Bandicoot 3: Warped, is a 1998 platform game developed by Naughty Dog and published by Sony Computer Entertainment for the PlayStation. It is the third game in the Crash Bandicoot video game series following Crash Bandicoot 2: Cortex Strikes Back.
The game's story takes place immediately after the events of the second game. When the ruins of Doctor Neo Cortex's space station crash-land on Earth, they unleash an evil entity known as Uka Uka, Aku Aku's evil twin brother, who joins with Cortex and the time-obsessed Doctor Nefarious Tropy as they plan to gather powerful crystals that lay scattered across time, and use their energy to enslave the Earth. The game follows the main characters Crash and Coco Bandicoot as they travel through time and prevent the villains from gathering the crystals by collecting them themselves.
Crash Bandicoot: Warped was lauded by critics, who noted a high quality in many areas, including gameplay, graphics and audio, and the game has been considered one of the best video games of all time. It went on to sell nearly 6 million units, making it one of the best-selling video games for the PlayStation. In Japan, the game surpassed the sales of its two predecessors and became the first non-Japanese PlayStation title to sell over 1 million copies in the country. A remastered version was included in the Crash Bandicoot N. Sane Trilogy collection for the PlayStation 4 in June 2017, and ported to other platforms in June 2018.
Gameplay
Warped is a platform game in which the player controls Crash and Coco Bandicoot, who must travel through time and gather 25 crystals scattered across time before Doctor Neo Cortex and Uka Uka do so. Much of the game takes place in the Time-Twisting Machine, which acts as the hub area of the game. The Time-Twisting Machine is split up into five chambers; only the first chamber is initially available. Each chamber has five buttons that open portals to different levels. The goal in each level is to find and obtain the crystal hidden in the area. In some levels, the crystal will be located at the end of a level or must be earned by completing a specific challenge. Some levels contain a "Bonus Platform" that leads to a special bonus area, where the player must navigate through a separate area and collect everything in sight. As no lives are lost in the bonus areas, the bonus areas can be played through as often as the player desires until the bonus area can be cleared. After completing all five levels in a chamber, a sixth button that opens a portal to a boss level will appear. By defeating the boss, the next chamber will become available for play. When all 25 Crystals are found and all five boss characters are defeated, the game is won.
Crash and Coco start the game with five lives. A life is lost when they are struck by an enemy attack or suffer any other type of damage. More lives can be earned by collecting 100 "Wumpa Fruits" or breaking open a s |
https://en.wikipedia.org/wiki/Nickelodeon%20Movies | Nickelodeon Movies is an American production company, animation studio, and the film production arm of American children's network Nickelodeon and the family film distribution label of Paramount Pictures, launched on February 25, 1995.
The division has earned numerous accolades including 2 Academy Awards, a Golden Globe Award, over 13 Saturn Awards nominations, and 4 in-house honors via the Nickelodeon Kids' Choice Awards. Since its launch, over 40 feature films have been produced for theatrical release and starting in 2021, the studio has been producing films for Paramount+ and Netflix.
History
Nickelodeon/20th Century Fox deal (1993–95)
In 1993, Nickelodeon agreed to a two-year contract with 20th Century Fox to make feature films. The joint venture would mostly produce new material, though a Nickelodeon executive did not rule out the possibility of making films based on The Ren & Stimpy Show, Rugrats and Doug. None of the movies were produced due to the 1994 acquisition of Paramount Pictures by Nickelodeon's parent company, Viacom, and they would distribute the movies instead. With the creative differences with John Kricfalusi, the creator of Ren & Stimpy and an inability to market that property in a family-friendly manner instead of a "cynical and gross humor" scuttled the film. However, Paramount and Viacom would go forward and start development on The Rugrats Movie a year after the acquisition.
The Nickelodeon version of the Doug film was not made due to the acquisition of the show's production studio, Jumbo Pictures, by The Walt Disney Company in 1996. With this, the show moved to Disney's ABC network and new seasons aired as a part of its programming block Disney's One Saturday Morning as Disney's Doug. In 1999, Walt Disney Pictures released a film finale to the series, Doug's 1st Movie.
Nickelodeon Movies (1995–98)
Nickelodeon Movies was then founded on February 25, 1995. On July 10, 1996, the studio released its first film, Harriet the Spy, a spy-comedy film based on the 1964 novel of the same name.
On July 25, 1997, the studio then released its second film, Good Burger, a comedy film, starring Kenan Thompson, Kel Mitchell, Abe Vigoda, Dan Schneider, Shar Jackson, Josh Server, Lori Beth Denberg, Jan Schweiterman, Linda Cardellini and Sinbad. It was based on the Good Burger sketch on Nickelodeon's popular sketch comedy series All That.
On November 20, 1998, the studio released The Rugrats Movie, which is Nickelodeon Movies' first animated film and the first Nicktoon to be shown in theaters. It received mixed critical reception, but despite this, the movie became a box office success, earning $100,494,675 in the domestic box office and $140,894,675 worldwide. It also became the first non-Disney animated film to gross over $100 million domestically. The success of the film led to two sequels.
2000s
On February 11, 2000, the studio released Snow Day, a comedy film starring Chevy Chase, Chris Elliott, Zena Grey, Josh Peck, Mark Webber |
https://en.wikipedia.org/wiki/MTV%20Entertainment%20Studios | MTV Entertainment Studios is the film and television production arm of MTV Entertainment Group, a subsidiary of the Paramount Media Networks division of Paramount Global. Founded in 1991 as MTV Productions, it is a consolidation of the former MTV Films group established in 1996 and the MTV Production Development/MTV Studios group of 2003–2021, it has produced original television shows like Beavis and Butt-Head, Æon Flux, Jackass, My Super Sweet 16, Daria, Celebrity Deathmatch, Clone High and The Real World and films such as Election, Joe's Apartment and Napoleon Dynamite. Its films are released by fellow Paramount Global division Paramount Pictures. The MTV Films unit was part of Paramount Players until 2020.
History
MTV Productions started in 1991 and went into expansion two years later, with Doug Herzog serving as president of the unit. Its expansion was to produce shows for theatrical release, broadcast TV and cable, syndication and the international marketplace. MTV then signed a two-picture deal with Geffen Pictures to start making motion pictures afterwards.
Only one movie came out of the deal due to the 1994 acquisition of Paramount Pictures by MTV's parent company Viacom. Joe's Apartment, based on a short aired on MTV, came out on July 26, 1996, and grossed $4.6 million on a $13 million budget, making it a box office bomb. Shortly afterwards, MTV Productions tried for an entertainment strip Real Time, to be distributed by Viacom Enterprises, which was owned by MTV's parent Viacom, and scheduled on air for the 1994–95 season, but never materialized.
Shortly after Viacom bought out Paramount Pictures. Paramount began to distribute material from MTV and Nickelodeon. Shortly after The Arsenio Hall Show was cancelled, Paramount began distributing and producing MTV's The Jon Stewart Show for the syndication market.
In 1994, the Paramount Television Group and MTV Productions signed a deal to develop projects commissioned by MTV, and gave Paramount the right of first refusal on projects developed by MTV. By 1995, David Gale was named head of MTV Films.
MTV developed its first feature film in collaboration with Paramount Pictures, Beavis and Butt-Head Do America, based on the MTV cartoon Beavis and Butt-Head. The film grossed $63.1 million on a $12 million budget.
For the 1997–98 television season, MTV Productions dabbled in network television production, in conjunction with Paramount Network Television, sibling of Viacom, to produce the NBC comedy Jenny, the UPN (then-sister of MTV) comedy Hitz, and the WB drama Three. None of these lasted more than one season.
On August 21, 1998, MTV Films has released another film, Dead Man on Campus, which starred Tom Everett Scott and Mark-Paul Gosselaar. It got negative reviews, and was a box office bomb, grossing $15.1 million on a $14 million budget.
MTV Films' next feature project, 200 Cigarettes, released on February 26, 1999, was a box office bomb, grossing $6.8 million on a $6 million budget.
|
https://en.wikipedia.org/wiki/Crash%20Bash | Crash Bash is a 2000 party video game developed by Eurocom Entertainment Software in association with Cerny Games and published by Sony Computer Entertainment for the PlayStation. It is the fifth title in the Crash Bandicoot series and the first in the party genre. The game includes a collection of 28 mini-games playable within three modes of gameplay, as well as eight playable characters from the Crash Bandicoot series.
Crash Bash is the first game in the series not to be developed by Naughty Dog, as well as the last Crash Bandicoot game to be exclusively released on a Sony console, with subsequent installments being released on a wider variety of platforms. The game received mixed reviews from critics, who widely noted its similarity to Mario Party, but regarded it as an enjoyable multiplayer experience despite a perceived lack of depth and originality. The mini-games were determined to be varied but repetitive, and the graphics were appreciated for replicating the look and feel of previous Crash Bandicoot titles.
Gameplay
Crash Bash is a party video game featuring eight playable characters with differing powers and skills: Crash, Coco, Tiny, Dingodile, Cortex, Brio, Koala Kong, and newcomer Rilla Roo. The gameplay consists of 28 different mini-games divided into seven categories with multiple variations each. The categories consist of: "Ballistix", in which players pilot hovercraft to deflect steel balls away from their goal; "Polar Push", in which players riding polar bear cubs must knock opponents off of an icy arena; "Pogo Pandemonium", in which players navigate a grid on pogo sticks to paint squares with their color; "Crate Crush", in which players throw or kick stone crates at their opponents to deplete their health and eliminate them from play; "Tank Wars", a tank battle involving mines and missiles; "Crash Dash", a multi-lap race on a circular track; and "Medieval Mayhem", a variety of challenges played within a circular arena. Crash Bash includes multiplayer compatibility for up to four human players with the use of the PlayStation Multitap.
Crash Bash features three distinct modes of play: "Adventure", "Battle" and "Tournament". In the Adventure mode, one or two human players must win all 28 mini-games and retrieve trophies, gems and crystals by accomplishing certain challenges presented for each mini-game. The mini-games are accessed from a series of "Warp Room" hub areas, with the first Warp Room consisting of four mini-games. A trophy is won by achieving victory in three rounds of any given mini-game. After obtaining a trophy, the player(s) can return to the mini-game and receive a gem or crystal by winning one round under special conditions. When a minimum number of trophies, gems and crystals have been won, the Warp Room's "Boss Arena" becomes accessible, in which the player(s) must defeat a boss character by depleting his health. Winning a Warp Room's Boss Arena will grant entry to the next Warp Room. When three of the game' |
https://en.wikipedia.org/wiki/Crash%20Team%20Racing | Crash Team Racing (stylized as CTR: Crash Team Racing) is a 1999 kart racing video game developed by Naughty Dog and published by Sony Computer Entertainment for the PlayStation. It is the fourth installment in the Crash Bandicoot series. The game's story focuses on the efforts of Crash Bandicoot, Doctor Neo Cortex, and other ragtag team of characters in the Crash Bandicoot series, who must race against the egomaniacal Nitros Oxide to save the Earth from destruction. In the game, players can take control of one of fifteen Crash Bandicoot series characters, though only eight are available at first. During the races, offensive and speed boosting power-ups can be used to gain an advantage.
Crash Team Racing was released on October 19, 1999, in North America, and on October 20, 1999 in Europe. It was praised by critics for its gameplay and graphics, though the audio was met with mixed opinions. A successor, Crash Nitro Kart, was released in 2003 for the Game Boy Advance, GameCube, PlayStation 2, Xbox and N-Gage. A remaster of the game, titled Crash Team Racing Nitro-Fueled, was announced at The Game Awards 2018 and was released on PlayStation 4, Xbox One and Nintendo Switch on June 21, 2019.
Gameplay
Crash Team Racing is a kart racing game in which the player controls characters from the Crash Bandicoot universe, most of whom compete in karts. While racing, the player can accelerate, steer, reverse, brake, hop or use weapons and power-ups with the game controller's analog stick and buttons. Two distinct forms of crates are scattered throughout the tracks and arenas of Crash Team Racing. Crates with question marks on them hold power-ups and weapons, which can be obtained by driving through and breaking apart said crates. When the player collects a weapon or power-up, it will appear in a box at the top of the screen. The player can activate the weapon or power-up to wreak havoc on the other racers or supplement the player's own performance. "Fruit Crates" carry "Wumpa Fruit" that increase the speed of the player's kart and strengthen the player's weapons and power-ups if ten of them are obtained.
A crucial maneuver in Crash Team Racing is the power slide; the player executes the slide by holding down one of the shoulder buttons to perform a hop, and steering before the kart lands. While sliding, the "Turbo Boost Meter" on the lower-right corner of the screen fills up and goes from green to red. At the same time, the exhaust gas from the player's kart turns black. To get a speed boost, the player quickly presses the opposite shoulder button while the Turbo Boost Meter is red. The player can execute three speed boosts in a row during a power slide, with the third speed boost being more powerful than the previous two. If the player waits too long into the power slide for a boost, the kart back-fires and the chance for a speed boost is lost; power sliding for too long causes a spin-out. Aside from power slides, speed boosts can be obtained by gathering |
https://en.wikipedia.org/wiki/Financial%20Post | The Financial Post is a financial news website, and business section of the National Post, both publications of the Postmedia Network. It started as an English Canadian business newspaper, which published from 1907 to 1998. In 1998, the publication was folded into the new National Post. The name Financial Post also lives on in the Posts monthly business magazine, Financial Post Business.
The Financial Post started publication in 1907 by John Bayne Maclean. It was a weekly publication, and one of the core assets of Maclean's media business, which eventually became Maclean-Hunter.
The paper was purchased by Sun Media in 1987, and expanded into a daily tabloid on February 1, 1988, and added newspaper home delivery in 1990, with a reformatted Financial Post Magazine following shortly after. In 1998, Sun Media sold the Financial Post to Hollinger, whose CEO Conrad Black had been seeking a way to establish a national newspaper. Sun Media acquired the Kitchener-Waterloo Record, the Guelph Mercury, the Hamilton Spectator and the Cambridge Reporter from Hollinger in exchange, but has since sold all four papers.
The Hollinger transaction was finalized in July 1998. Originally slated to launch on October 5, 1998, the National Posts launch was delayed until October 27 by the financial complications of the Financial Post purchase.
The Financial Post retains a loyal audience of English business readers in Canada, offering coverage similar to the Report on Business by The Globe and Mail. Though there has been frequent speculation that the Financial Post would be merged into the business sections of the regional newspapers owned by the National Posts parent, Postmedia News, much of the Posts editorial content is now syndicated to other Postmedia newspapers through the Postmedia News Service. The Financial Post publishes several popular editorial features throughout the year, including the annual competition Financial Post's Ten Best Companies to Work For.
Editors of the paper included Floyd Chalmers, John Godfrey and Diane Francis, who was the paper's last editor prior to the launch of the National Post.
References
External links
1907 establishments in Ontario
1998 disestablishments in Ontario
Business newspapers published in Canada
National newspapers published in Canada
National Post
Newspapers published in Toronto
Publications disestablished in 1998
Newspapers established in 1907
Weekly newspapers published in Ontario |
https://en.wikipedia.org/wiki/Recommendation | Recommendation may refer to:
European Union recommendation, in international law
Letter of recommendation, in employment or academia
W3C recommendation, in Internet contexts
A computer-generated recommendation created by a recommender system |
https://en.wikipedia.org/wiki/Duga%20radar | Duga (, ) was an over-the-horizon radar (OTH) system used in the Soviet Union as part of its early-warning radar network for missile defense. It operated from July 1976 to December 1989. Two operational duga radars were deployed, with one near Chernobyl and Chernihiv in the Ukrainian SSR (present-day Ukraine), and the other in eastern Siberia (present-day Russia).
The duga system was extremely powerful, reaching over 10MW, and broadcast in the shortwave radio bands. It was given the nickname Russian Woodpecker by shortwave listeners for its emissions randomly appearing and sounding like sharp, repetitive tapping noises at a frequency of 10Hz. The random frequency hops often disrupted legitimate broadcasts, amateur radio operations, oceanic commercial aviation communications, and utility transmissions, resulting in thousands of complaints by many countries worldwide. The signal became such a nuisance that some communications receivers began including "Woodpecker Blankers" in their circuit designs.
The unclaimed signal was a source of speculation, giving rise to theories such as Soviet brainwashing and weather modification experiments. However, because of its distinctive transmission pattern, many experts and amateur radio hobbyists realized it was an over-the-horizon radar system. NATO military intelligence had already given it the reporting name STEEL WORK or STEEL YARD, based on the massive size of the antenna, which spanned in length and in height. This massive structure formed a phased array and was necessary in order to provide high gain at HF as well as facilitating beam-steering, though it is unconfirmed whether the latter was actually used in normal operation. While the amateur radio community was well aware of the system, the OTH theory was not publicly confirmed until after the dissolution of the Soviet Union.
History
Genesis
The Soviets had been working on early-warning radar for their anti-ballistic missile systems through the 1960s, but most of these had been line-of-sight systems that were useful for rapid analysis and interception only. None of these systems had the capability to provide early warning of a launch, within seconds or minutes of a launch, which would give the defences time to study the attack and plan a response. At the time, the Soviet early warning satellite network was not well developed. An over-the-horizon radar sited in the USSR would help solve this problem, and work on such a system for this associated role started in the late 1960s.
The first experimental system, Duga, was built outside Mykolaiv in Ukraine, successfully detecting rocket launches from Baikonur Cosmodrome at . This was followed by the prototype Duga, built on the same site, which was able to track launches from the far east and submarines in the Pacific Ocean as the missiles flew towards Novaya Zemlya. Both of these radar systems were aimed east and were fairly low power, but with the concept proven, work began on an operational system. T |
https://en.wikipedia.org/wiki/CNCF | CNCF may refer to:
Christina Noble Children's Foundation
Cloud Native Computing Foundation, a Linux Foundation project
Concarril, Mexican rail car manufacturer |
https://en.wikipedia.org/wiki/King%20City | King City may refer to:
Places
King City, Ontario, Canada, an unincorporated village in the township of King
King City GO Station, a station in the GO Transit network located in the community
King City Secondary School, one of three high schools in the community
King City, California, USA, a city in Monterey County
King City High School, a high school in the city
King City Township, McPherson County, Kansas, a civil township
King City, Missouri, USA, a city in Gentry County
King City, Oregon, USA, a city in Washington County
Arts, entertainment, and media
Music
King City (band), a band included on 2007's Unlimited Sunshine Tour
"King City" (song), the debut single of the band Swim Deep
"King City", a song from Andre Nickatina 2005 album The Gift
"King City", 2016 song by Majid Jordan on the album Majid Jordan
Other arts, entertainment, and media
King City (comic), a comic by Brandon Graham
King City, a fictional location in the Eight Worlds novels
Others
King City (naval vessel), British naval collier sunk in the Indian Ocean by the German auxiliary cruiser Atlantis in August 1940
See also
Kings City, an Israeli theme park
King's City, a historical nickname for a number of cities, including Alghero, Drohobych, and Rokycany
Queen City (disambiguation) |
https://en.wikipedia.org/wiki/Internet%20Download%20Manager | Internet Download Manager (IDM) is a shareware download manager software application owned by American company Tonec, Inc. It is only available for the Microsoft Windows operating system.
IDM is a tool that manages and schedules downloads. It can use full bandwidth, and contains recovery and resume capabilities to continue downloading files that were interrupted due to a loss of network connection or other unexpected failures.
IDM supports a wide range of proxy servers such as firewall, FTP, and HTTP protocols, cookies, MP3 audio and MPEG video processing. It is compatible with Google Chrome, Mozilla Firefox, Microsoft Edge, Opera and other popular browsers to manage downloads from the internet.
Features
Divide downloads into multiple streams for faster downloading
Batch downloads
Import/Export download jobs
Update download addresses automatically/manually
Multiple queues
Recent downloads list for easy access to directories
Video downloads from streaming video sites
Dynamic segmentation throughout the downloading process
Protocols: HTTP, FTP, HTTPS, MMS and Microsoft ISA
Authentication protocols: Basic, NTLM, and Kerberos allowing for storage and auto-authentication of user names and passwords
Support for the following web browsers: Google Chrome, Microsoft Edge, Apple Safari, Firefox, Opera and many others
Reception
In CNET, IDM received a user rating of 4 out of 5 stars, based on 1,909 votes.
Softpedia gave IDM a rating of 5/5 stars, complementing on its convenience, effectiveness & diversity of options. An extended review has been done by Softpedia in March 2014; giving the software 4/5 stars, but criticized IDM for not having released a major version since 2010. An updated review gave IDM a rating of 5/5 stars again.
References
External links
Download managers
Windows-only shareware
C++ software |
https://en.wikipedia.org/wiki/Statistics%20relating%20to%20enlargement%20of%20the%20European%20Union | This is a sequence of tables giving statistical data for past and future enlargements of the European Union. All data refer to the populations, land areas, and gross domestic products (GDP) of the respective countries at the time of their accession to the European Union, illustrating historically accurate changes to the Union. The GDP figures are at purchasing power parity, in United States dollar at 1990 prices.
Past enlargements
Foundation
1973 enlargement
1981 enlargement
1986 enlargement
1990 enlargement
1995 enlargement
2004 enlargement
2007 enlargement
2013 enlargement
UK withdrawal
Candidate countries
EU27
Albania
Montenegro
Moldova
North Macedonia
Serbia
Turkey
Ukraine
All Candidates
Note: All data sourced from individual country entries on Wikipedia. Populations usually 2021 estimates; historical/future estimates not used. Figures are approximate due to fluctuations in population and economies.
See also
Demographics of the European Union
Footnotes
1. Algeria was part of France until 1962.2. German reunification in 1990 led to the inclusion of the territory of the former German Democratic Republic. This enlargement is not explicitly mentioned. Data for Germany in all tables is from current statistics.3. Greenland left the EC in 1985.4. Officially the whole of Cyprus lies within the European Union. "In light of Protocol 10 of the Accession Treaty 2003 Cyprus as a whole entered the EU, whereas the acquis is suspended in the northern part of the island ("areas not under effective control of the Government of the Republic of Cyprus"). This means inter alia that these areas are outside the customs and fiscal territory of the EU. The suspension has territorial effect, but does not concern the personal rights of Turkish Cypriots as EU citizens, as they are considered as citizens of the Member State Republic of Cyprus".
References
Citations
Enlargement of the European Union |
https://en.wikipedia.org/wiki/Alfred%20Grenander | Alfred Frederik Elias Grenander (26 June 1863 – 14 March 1931) was a Swedish architect, who became one of the most prominent engineers during the first building period of the Berlin U-Bahn network in the early twentieth century.
Biography
Grenander was born at Skövde in Västra Götaland County, Sweden. He was raised in Stockholm and began studying at the Swedish Royal Institute of Technology in 1881. He changed to the Royal Technical College of Charlottenburg in 1885. After his final degree in 1890 he became a site engineer at the construction of the new Reichstag building under the direction of Paul Wallot and continued his career in the architectural office of Alfred Messel.
In 1896 Grenander set up his own business and worked as a designer of the Hochbahngesellschaft, an affiliate of Siemens & Halske established in 1897 to build the first U-Bahn elevated railway of Berlin, opened in 1902. Up to 1931, he constructed about 70 U-Bahn stations, many of which have landmark status today. While the first stations were designed in an Art Nouveau (Jugendstil) or Neoclassical style, he later preferred a Modern architecture.
Alfred Grenander died in Berlin; he was buried in Skanör med Falsterbo, Sweden. In 2009, the public area in front of Krumme Lanke station in Berlin-Zehlendorf was named in his honour.
Berlin U-Bahn Stations designed by Grenander
1902: Ernst-Reuter-Platz (Knie)
1906: Deutsche Oper (Bismarckstraße), Wilhelmplatz – demolished
1907: Potsdamer Platz (Leipziger Platz)
1908: Sophie-Charlotte-Platz, Kaiserdamm, Theodor-Heuss-Platz (Reichskanzlerplatz); Mohrenstraße, (Kaiserhof), Stadtmitte (Friedrichstraße), Hausvogteiplatz, Spittelmarkt
1912: Wittenbergplatz – entrance hall
1913: Märkisches Museum (Inselbrücke), Klosterstraße, Alexanderplatz – U2; Rosa-Luxemburg-Platz (Schönhauser Tor), Senefelderplatz, Eberswalder Straße (Danziger Straße), Schönhauser Allee (Nordring); Uhlandstraße
1922: Neu-Westend
1924: Mehringdamm (Belle-Alliance-Straße), Gneisenaustraße, Südstern (Hasenheide)
1926: Hermannplatz – U7, Rathaus Neukölln, Karl-Marx-Straße; Platz der Luftbrücke (Kreuzberg)
1927: Boddinstraße, Hermannplatz – U6, Schönleinstraße; Paradestrasse (Flughafen)
1928: Kottbusser Tor (reconstruction), Heinrich-Heine-Straße (Neanderstraße)
1929: Leinestraße; Onkel Toms Hütte, Krumme Lanke; Tempelhof; Olympia-Stadion (Stadion) – reconstruction, Ruhleben
1930: Jannowitzbrücke, Alexanderplatz – U8, U5, Weinmeisterstraße, Rosenthaler Platz, Gesundbrunnen; Schillingstraße, Strausberger Platz, Weberwiese (Memeler Straße), Frankfurter Tor (Petersburger Straße), Samariterstraße, Frankfurter Allee, Magdalenenstraße, Lichtenberg, Friedrichsfelde
References
1863 births
1931 deaths
People from Skövde Municipality
KTH Royal Institute of Technology alumni
Technical University of Berlin alumni
Swedish expatriates in Germany
19th-century German architects
Swedish architects
20th-century German architects |
https://en.wikipedia.org/wiki/Bootstrap%20aggregating | Bootstrap aggregating, also called bagging (from bootstrap aggregating), is a machine learning ensemble meta-algorithm designed to improve the stability and accuracy of machine learning algorithms used in statistical classification and regression. It also reduces variance and helps to avoid overfitting. Although it is usually applied to decision tree methods, it can be used with any type of method. Bagging is a special case of the model averaging approach.
Description of the technique
Given a standard training set of size n, bagging generates m new training sets , each of size n′, by sampling from D uniformly and with replacement. By sampling with replacement, some observations may be repeated in each . If n′=n, then for large n the set is expected to have the fraction (1 - 1/e) (≈63.2%) of the unique examples of D, the rest being duplicates. This kind of sample is known as a bootstrap sample. Sampling with replacement ensures each bootstrap is independent from its peers, as it does not depend on previous chosen samples when sampling. Then, m models are fitted using the above m bootstrap samples and combined by averaging the output (for regression) or voting (for classification).
Bagging leads to "improvements for unstable procedures", which include, for example, artificial neural networks, classification and regression trees, and subset selection in linear regression. Bagging was shown to improve preimage learning. On the other hand, it can mildly degrade the performance of stable methods such as K-nearest neighbors.
Process of the algorithm
Key Terms
There are three types of datasets in bootstrap aggregating. These are the original, bootstrap, and out-of-bag datasets. Each section below will explain how each dataset is made except for the original dataset. The original dataset is whatever information is given.
Creating the bootstrap dataset
The bootstrap dataset is made by randomly picking objects from the original dataset. Also, it must be the same size as the original dataset. However, the difference is that the bootstrap dataset can have duplicate objects. Here is simple example to demonstrate how it works along with the illustration below:
Suppose the original dataset is a group of 12 people. These guys are Emily, Jessie, George, Constantine, Lexi, Theodore, John, James, Rachel, Anthony, Ellie, and Jamal.
By randomly picking a group of names, let us say our bootstrap dataset had James, Ellie, Constantine, Lexi, John, Constantine, Theodore, Constantine, Anthony, Lexi, Constantine, and Theodore. In this case, the bootstrap sample contained four duplicates for Constantine, and two duplicates for Lexi, and Theodore.
Creating the out-of-bag dataset
The out-of-bag dataset represents the remaining people who were not in the bootstrap dataset. It can be calculated by taking the difference between the original and the bootstrap datasets. In this case, the remaining samples who were not selected are Emily, Jessie, George, Rachel, and |
https://en.wikipedia.org/wiki/Global%20Sunday | Global Sunday was a Canadian news magazine television program which aired Sunday evenings on the Global Television Network. The program was launched in September 2001, with Charles Adler as host. Run separately from the rest of Global's news division, the program often reflected the political views of Global's founder, Israel Asper and the Asper family, and was designed to showcase a Western Canadian perspective on Canadian political affairs.
The program ran a mix of features reporting and interviews, effectively acting as a cross between a newsmagazine and an American-style Sunday talk show, and aired reportage and panel discussions featuring journalists from both Global News and the network's co-owned CanWest News Service network of newspapers.
The program's launch also spurred both of Global's major rival networks, CTV and CBC, to relaunch Sunday public affairs shows. CTV, which had not produced such a program since the cancellation of Mike Duffy's Sunday Edition in 1999, relaunched its earlier show Question Period, while CBC launched CBC News: Sunday.
Hosts and features
As a right-wing voice in Canadian television, the show developed a loyal audience, and was broadcast weekly from studios in Calgary, the cultural hotbed of Canadian conservatism. Adler was simultaneously host of a weekday radio talk show on CJOB in Winnipeg, and commuted to Calgary on weekends to host Global Sunday.
On February 24, 2002, the show staged and broadcast the candidate debates in the inaugural leadership convention of the then-new Canadian Alliance political party, with Adler as moderator.
Adler, who described his hosting style on the program as "a mix of Larry King, Ted Koppel and Vince McMahon", also recorded a weekly series of news commentaries for the network's weekday Global National newscasts concurrently with his stint as host of the program. However, not wishing to continue his schedule of weekly flights to Calgary, Adler resigned after a year. The program was then hosted for the next number of months by a rotating roster of guest hosts, both Global News personalities and outside figures.
In early 2003, Global named a permanent host in Danielle Smith, who at the time was an editorial writer for the Calgary Herald. In 2004, the program introduced "The Final Round", a weekly debate segment featuring Stephen LeDrew and Ezra Levant.
Cancellation
With the launch of Global National's weekend edition in February 2005, the program lost its coveted early-evening timeslot. Ratings and resources both dwindled, and the decision was made in August 2005 to cancel Global Sunday. The network replaced it with Global Currents, which aired documentary reports, and merged some other features, including "The Final Round", into the Sunday edition of Global National.
In 2011, Global resumed airing a weekly national public affairs show with The West Block.
References
2000s Canadian television news shows
2001 Canadian television series debuts
2005 Canadian television seri |
https://en.wikipedia.org/wiki/P%20system | For the computer p-System, see UCSD p-System.
A P system is a computational model in the field of computer science that performs calculations using a biologically inspired process. They are based upon the structure of biological cells, abstracting from the way in which chemicals interact and cross cell membranes. The concept was first introduced in a 1998 report by the computer scientist Gheorghe Păun, whose last name is the origin of the letter P in 'P Systems'. Variations on the P system model led to the formation of a branch of research known as 'membrane computing.'
Although inspired by biology, the primary research interest in P systems is concerned with their use as a computational model, rather than for biological modeling, although this is also being investigated.
Informal description
A P system is defined as a series of membranes containing chemicals (in finite quantities), catalysts and rules which determine possible ways in which chemicals may react with one another to form products. Rules may also cause chemicals to pass through membranes or even cause membranes to dissolve.
Just as in a biological cell, where a chemical reaction may only take place upon the chance event that the required chemical molecules collide and interact (possibly also with a catalyst), the rules in a P system are applied at random. This causes the computation to proceed in a non-deterministic manner, often resulting in multiple solutions being encountered if the computation is repeated.
A P system continues until it reaches a state where no further reactions are possible. At this point the result of the computation is all those chemicals that have been passed outside of the outermost membrane, or otherwise those passed into a designated 'result' membrane.
Components of a P system
Although many varieties of P system exist, most share the same basic components. Each element has a specific role to play, and each has a founding in the biological cell architecture upon which P systems are based.
The environment
The environment is the surroundings of the P system. In the initial state of a P system it contains only the container-membrane, and while the environment can never hold rules, it may have objects passed into it during the computation. The objects found within the environment at the end of the computation constitute all or part of its “result.”
Membranes
Membranes are the main “structures” within a P system. A membrane is a discrete unit which can contain a set of objects (symbols/catalysts), a set of rules, and a set of other membranes contained within. The outermost membrane, held within the environment, is often referred to as the 'container membrane' or 'skin membrane'. As implied to by their namesake, membranes are permeable and symbols resulting from a rule may cross them. A membrane (but not the container membrane) may also “dissolve”, in which case its content, except for rules (which are lost), migrate into the membrane in which it was conta |
https://en.wikipedia.org/wiki/Edward%20Tsang | Edward Tsang is a Computer Science professor at the University of Essex. He holds a first degree in Business Administration (major in Finance) from the Chinese University of Hong Kong (1977), and an MSc and PhD in Computer Science from the University of Essex (1983 and 1987). Prior to his PhD studies, he served for five
years in various positions in the commercial sector in Hong Kong.
Edward Tsang is the Director (and co-founder) of Centre for Computational Finance and Economic Agents (CCFEA) at University of Essex.
CCFEA is an interdisciplinary
research centre, which applies artificial intelligence methods to problems in finance and economics.
Edward Tsang is the author of Foundations of Constraint Satisfaction, the first book to define the scope of the field. He is also the co-author of Vehicle Scheduling in Port Automation (with Hassan Rashidi) and Evolutionary Applications for Financial Prediction: Classification Methods to Gather Patterns Using Genetic Programming (with Alma Garcia Almanza).
Edward Tsang founded the Computation Finance and Economics Technical Committee in IEEE’s Computational Intelligence Society in 2004, and chaired it until the end of 2005.
Edward Tsang specializes in business application of artificial intelligence. His research interests include artificial intelligence applications, computational finance, constraint satisfaction, evolutionary computation, and heuristic search.
He has given consultation to GEC Marconi, British Telecom, the Commonwealth Secretariat and other organizations.
External links
Edward Tsang home page
Tsang, E.P.K., Foundations of Constraint Satisfaction, Academic Press, 1993,
Rashidi, H. and Tsang, E.P.K., Vehicle Scheduling in Port Automation, VDM Verlag, 2010,
Garcia Almanza, A. and Tsang, E.P.K., Evolutionary Applications for Financial Prediction: Classification Methods to Gather Patterns Using Genetic Programming, VDM Verlag, 2011,
Centre for Computational Finance and Economics (CCFEA) at University of Essex
Computational Intelligence Centre (CIC) at University of Essex
IEEE Computational Finance and Economics TC (CFETC)
Year of birth missing (living people)
Living people
British computer scientists
Academics of the University of Essex
Alumni of the Chinese University of Hong Kong
Alumni of the University of Essex
British people of Chinese descent |
https://en.wikipedia.org/wiki/ICTV | ICTV may stand for:
Television programs
ICTv (Italy), an Italian Web video program focused on technology
ICTV (TV), a content distribution network for delivering the web-media experience through television
ICTV (UK), a television service company covering the south of England
ICTV (Ukraine), a television network of Ukraine
Indigenous Community Television (see List of Australian television channels)
Ithaca College Television, the official television production organization of Ithaca College in Ithaca, New York, United States
Other
International Committee on Taxonomy of Viruses, an organisation that governs the taxonomy of viruses |
https://en.wikipedia.org/wiki/Imputation | Imputation can refer to:
Imputation (law), the concept that ignorance of the law does not excuse
Imputation (statistics), substitution of some value for missing data
Imputation (genetics), estimation of unmeasured genotypes
Theory of imputation, the theory that factor prices are determined by output prices
Imputation (game theory), a distribution that benefits each player who cooperates in a game
Imputed righteousness, a concept in Christian theology
Double imputation, a concept in Christian theology
Imputation of sin, a theory for the transmission of original sin from Adam to his progeny
See also
Geo-imputation, a method in geographical information systems
Dividend imputation, a method of attributing a company's income tax to its shareholders |
https://en.wikipedia.org/wiki/Imputation%20%28statistics%29 | In statistics, imputation is the process of replacing missing data with substituted values. When substituting for a data point, it is known as "unit imputation"; when substituting for a component of a data point, it is known as "item imputation". There are three main problems that missing data causes: missing data can introduce a substantial amount of bias, make the handling and analysis of the data more arduous, and create reductions in efficiency. Because missing data can create problems for analyzing data, imputation is seen as a way to avoid pitfalls involved with listwise deletion of cases that have missing values. That is to say, when one or more values are missing for a case, most statistical packages default to discarding any case that has a missing value, which may introduce bias or affect the representativeness of the results. Imputation preserves all cases by replacing missing data with an estimated value based on other available information. Once all missing values have been imputed, the data set can then be analysed using standard techniques for complete data. There have been many theories embraced by scientists to account for missing data but the majority of them introduce bias. A few of the well known attempts to deal with missing data include: hot deck and cold deck imputation; listwise and pairwise deletion; mean imputation; non-negative matrix factorization; regression imputation; last observation carried forward; stochastic imputation; and multiple imputation.
Listwise (complete case) deletion
By far, the most common means of dealing with missing data is listwise deletion (also known as complete case), which is when all cases with a missing value are deleted. If the data are missing completely at random, then listwise deletion does not add any bias, but it does decrease the power of the analysis by decreasing the effective sample size. For example, if 1000 cases are collected but 80 have missing values, the effective sample size after listwise deletion is 920. If the cases are not missing completely at random, then listwise deletion will introduce bias because the sub-sample of cases represented by the missing data are not representative of the original sample (and if the original sample was itself a representative sample of a population, the complete cases are not representative of that population either). While listwise deletion is unbiased when the missing data is missing completely at random, this is rarely the case in actuality.
Pairwise deletion (or "available case analysis") involves deleting a case when it is missing a variable required for a particular analysis, but including that case in analyses for which all required variables are present. When pairwise deletion is used, the total N for analysis will not be consistent across parameter estimations. Because of the incomplete N values at some points in time, while still maintaining complete case comparison for other parameters, pairwise deletion can introduce impo |
https://en.wikipedia.org/wiki/Finite%20thickness | In formal language theory, in particular in algorithmic learning theory, a class C of languages has finite thickness if every string is contained in at most finitely many languages in C. This condition was introduced by Dana Angluin as a sufficient condition for C being identifiable in the limit.
The related notion of M-finite thickness
Given a language L and an indexed class C = { L1, L2, L3, ... } of languages, a member language Lj ∈ C is called a minimal concept of L within C if L ⊆ Lj, but not L ⊊ Li ⊆ Lj for any Li ∈ C.
The class C is said to satisfy the MEF-condition if every finite subset D of a member language Li ∈ C has a minimal concept Lj ⊆ Li. Symmetrically, C is said to satisfy the MFF-condition if every nonempty finite set D has at most finitely many minimal concepts in C. Finally, C is said to have M-finite thickness if it satisfies both the MEF- and the MFF-condition.
Finite thickness implies M-finite thickness. However, there are classes that are of M-finite thickness but not of finite thickness (for example, any class of languages C = { L1, L2, L3, ... } such that L1 ⊆ L2 ⊆ L3 ⊆ ...).
References
Formal languages |
https://en.wikipedia.org/wiki/Live365 | LIVE365 is an Internet radio network which enables users to create their own online radio stations and listen to thousands of human curated stations. Online radio stations on the Live365 network were created and managed by music and talk enthusiasts, including both hobbyists and professional broadcasters. Live365 also has many well established AM and FM stations that use Live365 broadcasting platform to simulcast their terrestrial radio streams. The Live365 network also features radio stations from artists such as Johnny Cash, David Byrne, Pat Metheny, Jethro Tull, and Frank Zappa. Live365 was created in 1999, and remains one of the longest running internet radio websites for listeners and broadcasters.
This internet radio provides service in the United States, Canada, and the United Kingdom, with licenses from those countries' performance rights societies.
History
Nanocosm Inc. (the parent company of Live365) was a technology startup founded by two roommates from the Princeton class of 1981, Alex Sanford and Steve Follmer, whose initial product was NanoHome, a 3D "Virtual Home" website featuring 3D homepages on the World Wide Web.
Live365 had its beginnings in a hosted community radio project developed by Nanocosm employee Andy Volk in his free time using Shoutcast technology, and later modified by employee Brian Lomeland. In 1998, Andy Volk shared the idea with Nanocosm CTO Peter Rothman, and they developed the concept for a new large-scale hosted community radio service dubbed Live365. After launch in July 1999, Live365 quickly eclipsed NanoHome, and the company soon shifted to solely focus on Live365 and online audio streaming services.
At launch, broadcasting and listening on Live365 was free of charge. Stations had a maximum listener cap of 365 simultaneous listeners and 365 megabytes of storage for music and audio. In September 2001, Live365 began charging for use of its broadcasting services to remain financially viable in the wake of rising music royalty costs. More expensive plans allowed stations to have more simultaneous listeners and a greater amount of music file storage space. Members who joined before September 2001 could continue broadcasting with their original package for free. This model would later be replaced with one in which all members pay, but those who joined before September 2001 received a discount. In March 2003, Live365 launched their commercial-free membership called VIP.
Closure and reopening
The Webcaster Settlement Act of 2009 expired in January 2016, ending a 10-year period in which smaller online radio stations, Live365 among them, paid lower music licensing fees compared to larger broadcasters. After this time, smaller radio stations were required to pay the same fees as the largest broadcasters. Also, on January 31, 2016, webcasters, who are governed by rules adopted by the Copyright Royalty Board, were required to begin paying SoundExchange an annual, nonrefundable minimum fee of $500 for each channel |
https://en.wikipedia.org/wiki/Virtual%20Pascal | Virtual Pascal is a free 32-bit Pascal compiler, IDE, and debugger for OS/2 and Microsoft Windows, with some limited Linux support. Virtual Pascal was developed by Vitaly Miryanov and later maintained by Allan Mertner.
Features
The compiler is compatible with Turbo Pascal, Borland Delphi, and Free Pascal, although language- and RTL-compatibility is limited for features introduced after Delphi v2 and FPC 1.0.x.
VP was primarily useful for the following purposes:
Easily port existing 16-bit Turbo Pascal programs to 32 bits
Port existing 16-bit OWL programs to 32-bit Windows (in theory)
Write console (text-mode) programs for several platforms
Pascal development using the 32-bit Windows API (the classic development, no COM)
Learn object-oriented programming
Significant features of Virtual Pascal include:
Text-mode IDE
Debugger is integrated directly into the IDE and is reminiscent of Turbo Debugger
Fast compilation
Tool-chain written mostly in Intel assembly
History
Microsoft Windows, OS/2
The compiler was quite popular in the BBS scene, probably because of its OS/2 port and being one of the few affordable multi-target compilers. Also Turbo Pascal had been popular in the BBS scene too, but its successor, Delphi was suddenly for Windows only. Virtual Pascal provided a migration path for existing codebases.
There has been pressure from some users for Virtual Pascal to be made into open-source software. This has not been done, provided the following reasoning:
The compiler source is mostly written in Intel assembly which is hard to change and maintain.
Part of the run-time library is proprietary to Borland (The FreePascal run-time library was ported to VirtualPascal by Noah Silva, however newer versions of the FreePascal RTL use features of the FreePascal compiler which are not supported by VirtualPascal, and so can not be ported).
The patch/diff tool to work around the above (provide changes to proprietary without distributing parts of the original) was proprietary and (Windows) 16 bit only.
Documentation and help are maintained with expensive (and sometimes no longer available) proprietary tools
There is nobody who fully understands the code. Allan said that some of the deeper areas were no-touch for him (original code by Vitaly)
Although it had a wide user base in the late 1990s, VP has not evolved significantly since 2001, and after a few maintenance-only releases, the owner declared that development had ceased in 2005.
On 4 Apr 2005, Virtual Pascal was announced 'dead' on the official site. The last released version (2.1 Build 279) was announced on 13 May 2004.
Linux
An initial version was released on 4 July 1999, with the last known version released on 26 September 1999. This version was maintained by Jörg Pleumann. Run-Time Library to 32 bit DPMI.
See also
Free Pascal
References
External links
fPrint (UK) Ltd page: OS/2, Windows 95/98/NT
Jörg Pleumann page: Virtual Pascal for Linux
Community set up by the author of |
https://en.wikipedia.org/wiki/RDI%20Video%20Systems | RDI Video Systems (Rick Dyer Industries) was a video game company founded by Rick Dyer originally as Advanced Microcomputer Systems, and was well known for its Laserdisc video games, beginning with the immensely popular Dragon's Lair. The company went bankrupt shortly after releasing the Halcyon gaming console.
Games
Zzyzzyxx (1982)
Dragon's Lair (1983)
Space Ace (1984)
Thayer's Quest (1984) (Released first for the Halcyon, and later in arcades)
Raiders vs. Chargers (1985) (Released first for the Halcyon, and later in arcades as NFL Football)
Orpheus, not released
The Spirits of Whittier Mansion, not released
The Shadow of the Stars, not released
Voyage to the New World, not released
Dallas vs. Washington, not released
Video game development companies
Video game companies established in 1982
Video game companies disestablished in 1985
Defunct video game companies of the United States |
https://en.wikipedia.org/wiki/Demand%20paging | In computer operating systems, demand paging (as opposed to anticipatory paging) is a method of virtual memory management. In a system that uses demand paging, the operating system copies a disk page into physical memory only if an attempt is made to access it and that page is not already in memory (i.e., if a page fault occurs). It follows that a process begins execution with none of its pages in physical memory, and many page faults will occur until most of a process's working set of pages are located in physical memory. This is an example of a lazy loading technique.
Basic concept
Demand paging follows that pages should only be brought into memory if the executing process demands them. This is often referred to as lazy loading as only those pages demanded by the process are swapped from secondary storage to main memory. Contrast this to pure swapping, where all memory for a process is swapped from secondary storage to main memory during the process startup.
Commonly, to achieve this process a memory management unit is used. The memory management unit maps logical memory to physical memory. Entries in the memory management unit include a bit that indicates whether a page is valid or invalid. A valid page is one that currently resides in main memory. An invalid page is one that currently resides in secondary memory. When a process tries to access a page, the following steps are generally followed:
Attempt to access page.
If page is valid (in memory) then continue processing instruction as normal.
If page is invalid then a page-fault trap occurs.
Check if the memory reference is a valid reference to a location on secondary memory. If not, the process is terminated (illegal memory access). Otherwise, we have to page in the required page.
Schedule disk operation to read the desired page into main memory.
Restart the instruction that was interrupted by the operating system trap.
Advantages
Demand paging, as opposed to loading all pages immediately:
Only loads pages that are demanded by the executing process.
As there is more space in main memory, more processes can be loaded, reducing the context switching time, which utilizes large amounts of resources.
Less loading latency occurs at program startup, as less information is accessed from secondary storage and less information is brought into main memory.
As main memory is expensive compared to secondary memory, this technique helps significantly reduce the bill of material (BOM) cost in smart phones for example. Symbian OS had this feature.
Disadvantages
Individual programs face extra latency when they access a page for the first time.
Low-cost, low-power embedded systems may not have a memory management unit that supports page replacement.
Memory management with page replacement algorithms becomes slightly more complex.
Possible security risks, including vulnerability to timing attacks; see (specifically the virtual memory attack in section 2).
Thrashing which may oc |
https://en.wikipedia.org/wiki/List%20of%20programs%20broadcast%20by%20Nine%20Network | The following list of programs are currently broadcast by the Nine Network / 9HD, 9Go!, 9Gem, 9Life and 9Rush as well as their regional affiliates, including WIN, NBN and Imparja as well as catch-up service 9Now. Some affiliate stations have alternate schedules and may air programs at different times.
Currently broadcast on Nine Network
Domestic
News and current affairs
Local bulletins
Nine News – local bulletins produced in Syd/Melb/Bris/Adel/Per/Dar/GC, Nightly 6pm to 7pm (1956–present)
Nine Live / Nine's Afternoon News – local bulletin produced in Syd/Melb/Bris/Adel/Per, 4pm to 5pm weekdays (2004–2009, 2009–present)
NBN News – local bulletin produced in Newcastle, Nightly 6pm to 7pm (1972–present)
National programs produced by TCN9 Sydney
60 Minutes – weekly current affairs program, Sunday evenings (1979–present)
A Current Affair – daily current affairs program, Mon to Sat weeknights 7pm (1971–1978, 1988–present)
Nine News: Early Edition – weekdays 5am (1990s–present)
Nine's Morning News – weekdays 11.30am (1981–present) (local edition also produced in Bris)
Today – weekdays 5.30am to 9am (1982–present)
Today Extra – weekdays 9am to 11:30am, Saturdays 10am-12pm (2012–present)
Under Investigation with Liz Hayes (2021–present)
Weekend Today – weekends 7am to 10am (2009–present)
Nine News Late – Sundays 9:30pm (2020–present)
National programs produced by GTV9 Melbourne
Nine News: First At Five (Nine's Afternoon News weekend bulletin) – weekends 5pm (2011–present)
National programs produced by STW9 Perth
Nine News Late – Weeknights after 10:30pm (Except Fridays) (2020–present)
Variety / Entertainment
The Hundred with Andy Lee (2021–present)
Reality
Big Miracles (2023)
The Block (2003–2004, 2010–present)
Dream Listing: Byron Bay (2022)
Lego Masters (2019–present)
Christmas specials (2021–)
Love Island Australia (2018–2019, 2021–present)
My Mum, Your Dad (2022–present)
Parental Guidance (2021–present)
Married at First Sight (2015–present)
The Summit (2023–present)
Travel Guides (2017–present)
Observational / documentaries
Bondi Vet: Coast to Coast (2019–present)
Desert Vet (2019–present)
Australian Crime Stories (2010–2011 on CI, 2019–present on Nine)
Emergency (2020–present)
For the Love of Pets (2023–present)
Mega Zoo (2021–present)
Million Dollar Murders (2022)
Missing Persons Investigation (2022)
Paramedics (2018–present)
RBT (2010–present)
RPA (1995–2012, 2023–)
Taronga: Who's Who in the Zoo (2020–present)
Game shows
Millionaire Hot Seat (2009–present)
Lifestyle
Adelady (South Australia) (2015–present)
Country Home Rescue (2022)
Country House Hunters Australia (2020–present)
Cybershack (2008–present)
Delish (2017–present on 9Life) Guru Productions
The Garden Gurus (2002–present) Guru Productions
Getaway (1992–present)
Good Food Kitchen (2021–present)
Luxury Homes Revealed (2016–present on 9Life)
Postcards (1995–present)
Ready Set Reno (2016–present on 9Life)
The Road to Miss Univers |
https://en.wikipedia.org/wiki/Orange%20Line%20%28Montreal%20Metro%29 | The Orange Line (), also known as Line 2 (), is the longest and first-planned of the four subway lines of the Montreal Metro in Montreal, Quebec, Canada. It formed part of the initial network, and was extended from 1980 to 1986. On April 28, 2007, three new stations in Laval opened making it the second line to leave Montreal Island.
The Orange Line measures in length and counts 31 stations. It is the longest subway line in Montreal and the second-longest in Canada after the Line 1 Yonge–University of the Toronto subway. Like the rest of the Metro network, it is entirely underground. The line runs in a U-shape (also similar to Line 1 Yonge-University) from Côte-Vertu in western Montreal to Montmorency in Laval, northwest of Montreal.
History
On November 3, 1961, Montreal City Council approved an initial Metro network in length. Line 2 (Orange Line) was to run from north of the downtown, from Crémazie station through various residential neighbourhoods to the business district at Place-d'Armes station.
Work on the Orange Line began on May 23, 1962 on Berri Street just south of Jarry Street. In November 1962, the city of Montreal learned that it had been awarded the 1967 International and Universal Exposition (commonly known as Expo 67). To better meet the anticipated demand for transit during Expo 67, it was decided on August 6, 1963 to add the Sauvé and Henri-Bourassa stations in the north, and the Square-Victoria-OACI and Bonaventure stations in the south.
On October 14, 1966, the section between Henri-Bourassa and Place-d'Armes opened, forming part of the original Metro network. Completion of smaller sections were delayed by several months. On February 6, 1967, the segment from Place-d'Armes to Square-Victoria-OACI opened, followed on February 13, 1967, by Bonaventure.
Prior to the inauguration of the initial network, extensions were proposed in all directions, including the West Island. In its 1967 Urban Plan, entitled "Horizon 2000", the city of Montreal planned to build a network of almost by the end of the twentieth century. On February 12, 1971, the council of the Montreal Urban Community authorized the borrowing of C$430 million to extend the Metro. This amount increased to C$665 million in 1973, and to C$1.6 billion in 1975. This expansion plan included the costs of extending the Orange Line westward, a distance of , adding 16 new stations, as well as the construction of a new garage. The terminus station, Salaberry, would have been an intermodal station with Bois-Franc commuter rail station.
From the beginning, the plan was to expand the Metro to the northwest, but massive cost overruns on the expansion of the Green Line in preparation for the 1976 Summer Olympics, led to several years of delays, including a moratorium on underground expansions in 1976. To cut costs, three planned stations (Poirier, Bois-Franc, De Salaberry) and a maintenance workshop at the end of the track were eliminated.
In 1979, the Minister of Transport, |
https://en.wikipedia.org/wiki/Function%20prototype | In computer programming, a function prototype or function interface is a declaration of a function that specifies the function’s name and type signature (arity, data types of parameters, and return type), but omits the function body. While a function definition specifies how the function does what it does (the "implementation"), a function prototype merely specifies its interface, i.e. what data types go in and come out of it. The term "function prototype" is particularly used in the context of the programming languages C and C++ where placing forward declarations of functions in header files allows for splitting a program into translation units, i.e. into parts that a compiler can separately translate into object files, to be combined by a linker into an executable or a library. The function declaration precedes the function definition, giving details of name, return type, and storage class along with other relevant attributes.
Function prototypes can be used when either:
Defining an ExternalType
Creating an Interface part
In a prototype, parameter names are optional (and in C/C++ have function prototype scope, meaning their scope ends at the end of the prototype), however, the type is necessary along with all modifiers (e.g. if it is a pointer or a reference to parameter) except alone.
In object-oriented programming, interfaces and abstract methods serve much the same purpose.
Example
Consider the following function prototype:
void Sum( int a, int b );
OR
void Sum( int, int );
OR
auto Sum( int, int ) -> void; // C++ only
Function prototypes include the function signature, the name of the function, return type and access specifier. In this case the name of the function is "Sum". The function signature defines the number of parameters and their types. The return type is "void". This means that the function is not going to return any value. Note that the parameter names in the first example are optional.
Uses
In early versions of C, if a function was not previously declared and its name occurred in an expression followed by a left parenthesis, it was implicitly declared as a function that returns an int and nothing was assumed about its arguments. In this case the compiler would not be able to perform compile-time validity checking of the number and type(s) of arguments.
The C99 standard requires the use of prototypes.
char MyFunction ( int a ); /* Function prototype */
#include <stdio.h>
#include <limits.h>
int main( void )
{
putchar( MyFunction( -1 ) ); /* Correctly formatted call */
putchar( MyFunction( 1.5 ) ); /* Compiler generates a warning because of type mismatch */
putchar( MyFunction("IncorrectArgType") ); /* Compiler will generate a warning */
putchar( MyFunction() ); /* Compiler will generate an Error too few arguments */
int one=1;
putchar( MyFunction( INT_MAX + one ) ); /* Although adding 1 to the maximum integer
/* is an error it cannot be d |
https://en.wikipedia.org/wiki/Railways%20in%20Adelaide | The rail network in Adelaide, South Australia, consists of four lines (six including two short spurs) and 89 stations, totalling . It is operated by Keolis Downer under contract from the Government of South Australia, and is part of the citywide Adelaide Metro public transport system.
All lines around Adelaide were originally broad gauge. The main interstate lines out of Adelaide towards Melbourne, Sydney, Perth and Darwin have been progressively converted to , but the suburban system and a few freight-only branch lines to the north remain broad gauge.
Operators
Rail services around Adelaide are provided by a mixture of private and government-owned organisations.
The Department for Infrastructure & Transport (DIT) owns the suburban passenger rail network, comprising six lines originating from Adelaide railway station on North Terrace in the CBD. Since January 2021, operation of the network has been contracted to Keolis Downer.
The Australian Rail Track Corporation (ARTC), an agency of the Federal Government, owns standard gauge interstate lines heading north and south, together with the dual gauge freight-only branch from Dry Creek to Port Adelaide and Pelican Point. The ARTC lines bypass the city to the west and do not enter the CBD. The ARTC network extends from Adelaide towards Melbourne, Sydney, Perth and Darwin and is used by substantial interstate freight traffic.
Freight trains are operated by a number of private operators, which have access agreements with rail network owners such as the ARTC. The largest of these is Pacific National, which handles the majority of interstate traffic and has the largest locomotive fleet. Other logistics companies also operate freight trains to and from interstate destinations and within South Australia.
One Rail Australia owns the remaining broad-gauge lines beyond the Adelaide suburban network. These are a handful of lines used mainly to move bulk grain and stone from the Barossa Valley and mid-north region of the state to the Port Adelaide area.
Journey Beyond is a private company operating long-distance interstate passenger trains on the ARTC's standard gauge lines, and run from the Adelaide Parklands Terminal, just west of the CBD. Journey Beyond's trains are the Indian Pacific to Sydney and Perth, The Ghan to Alice Springs and Darwin, The Overland to Melbourne and the seasonal Great Southern to Brisbane. There have been no intrastate regional passenger services in South Australia since 1990.
There are presently two heritage railways in South Australia run by volunteers, but none of these are in the Adelaide area. SteamRanger is based at Mount Barker and runs services through to Victor Harbor. The Pichi Richi Railway is considerably more distant from Adelaide, based at Quorn, and runs services through to Port Augusta.
History
Early days
In 1856, the first steam train ran between Adelaide and Port Adelaide, stopping at Bowden, Woodville and Alberton. Soon after, a line was built from the Ga |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.