source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Advanced%20chess | Advanced chess is a form of chess in which each human player uses a computer chess program to explore the possible results of candidate moves. Despite this computer assistance, it is the human player who controls and decides the game.
Also called cyborg chess or centaur chess, advanced chess was introduced for the first time by grandmaster Garry Kasparov, with the aim of bringing together human and computer skills to achieve the following results:
increasing the level of play to heights never before seen in chess;
producing blunder-free games with the qualities and the beauty of both perfect tactical play and highly meaningful strategic plans;
offering the public an overview of the mental processes of strong human chess players and powerful chess computers, and the combination of their forces.
A variant or superset of advanced chess is freestyle chess, in which teams are also allowed and, within the established time limits, every possible form of consultation. Freestyle chess was introduced by Ingo Althoefer and Timo Klaustermeyer with a Blitz tournament in August 2004.
History
The concept was already common in the 1970s: "An interesting possibility which arises from the 'brute force' capabilities of contemporary chess programs is the introduction of a new brand of 'consultation chess' where the partnership is between man and machine." The concept of computer-assisted chess tournaments originated in science fiction, notably in The Peace War written by Vernor Vinge in 1984.
The former world champion grandmaster Garry Kasparov, who retired from competitive chess in 2005, has a long history in playing "Man vs. Machine" events. Among the most important are his matches against IBM's computer Deep Blue, which Kasparov defeated in February 1996, scoring 4–2 in a 6-game match, and lost to, –, in a May 1997 rematch. This 1997 match was famous, as it was the first time in the history of chess in which a world champion had been defeated by a computer. After this spectacular match, and many other matches against computers, Garry Kasparov had the idea to invent a new form of chess in which humans and computers co-operate, instead of contending with each other. Kasparov named this form of chess "advanced chess".
The first advanced chess event was held in June 1998 in León, Spain. It was played between Garry Kasparov, who was using Fritz 5, and Veselin Topalov, who was using ChessBase 7.0. The analytical engines used, such as Fritz, HIARCS and Junior, were integrated into these two programs, and could have been called at a click of the mouse. It was a 6-game match, and it was arranged in advance that the players would consult the built-in million games databases only for the 3rd and 4th game, and would only use analytical engines without consulting the databases for the remaining games. The time available to each player during the games was 60 minutes. The match ended in a 3–3 tie. After the match, Kasparov said:
Even in the following years advanced-c |
https://en.wikipedia.org/wiki/Multiplayer%20BattleTech%3A%20Solaris | Multiplayer BattleTech: Solaris is a version of the multiplayer BattleTech computer game which was available on AOL, and on Kesmai's (later named GameStorm) game service between 1996 and 2001. At its height on the AOL server, thousands of players competed simultaneously in arenas of two to eight participants, battling in team games or free-for-alls. After AOL initiated its hourly pay-for-play system, the majority of players moved to the GameStorm service, which operated for a number of years until its purchase by Electronic Arts.
During its run, the game's player-driven community grouped themselves into armies representing the various Successor States, or independent stables, or mercenary units. Though the in-game software did not support official groups, the player-driven units became close-knit communities, even after the games cancellation in 2001.
The game was a follow-up to Multiplayer BattleTech: EGA; it was in turn succeeded by Multiplayer BattleTech 3025.
Reception
In 1997, Next Generation named Multiplayer BattleTech: Solaris as number two on their "Top 10 Online Game Picks", reasoning that "Kesmai's newest first-person BattleTech game may not have the glitz of MechWarrior 2, but it can stand on the same level - it is a more subtle, almost truer-to-life game ..." In 2000, Computer Games Strategy Plus named the Multiplayer Battletech series collectively one of the "10 Best Sci-Fi Simulations". The magazine's Steve Bauman called it "the definitive online BattleTech experience."
See also
MechWarrior
References
External links
The MultiPlayer BattleTech Archive
1996 video games
BattleTech games
Multiplayer online games
Windows games
Video games based on miniatures games
Video games developed in the United States
Kesmai games |
https://en.wikipedia.org/wiki/Robot%20Chicken | Robot Chicken is an American adult stop motion-animated sketch comedy television series created by Seth Green and Matthew Senreich for Cartoon Network's nighttime programming block Adult Swim. The writers, most prominently Green, also provide many of the voices. Senreich, Douglas Goldstein, and Tom Root were formerly writers for the popular action figure hobbyist magazine ToyFare. Robot Chicken has won two Annie Awards and six Emmy Awards.
Production history
Robot Chicken was conceptually preceded by "Twisted ToyFare Theatre", a humorous photo comic strip appearing in ToyFare: The Toy Magazine. Matthew Senreich, an editor for ToyFare, got in touch with actor Seth Green when the former learned that the latter had made action figures of castmates from Buffy the Vampire Slayer and asked to photograph them. Months later, Green asked Senreich to collaborate on an animated short for Late Night with Conan O'Brien, featuring toy versions of himself and O'Brien. This led to the 12-episode stop-motion series Sweet J Presents on the Sony website Screenblast.com in 2001. Conan O'Brien is voiced by Family Guy creator Seth MacFarlane in the first episode ("Conan's Big Fun").
Continuing the concept of the web series, the show creators pitched Robot Chicken as a television series, the name being inspired by a dish on the menu at a West Hollywood Chinese restaurant, Kung Pao Bistro, where Green and Senreich had dined. (Other ideas for the series' name included Junk in the Trunk, The Deep End, and Toyz in the Attic; some of these would be reworked into episode titles for the first season.) Some television networks and sketch shows rejected the series, including Comedy Central, MADtv, Saturday Night Live, and even Cartoon Network. However, someone at that network passed the pitch along to its nighttime programming block, Adult Swim, around the same time that Seth MacFarlane (various voices, 2005–2022) told Green and Senreich to pitch the show to the channel. On February 20, 2005, the series premiered on Adult Swim.
The show was created, written, and produced by Green and Senreich and produced by ShadowMachine Films (Seasons 1–5) and Stoopid Buddy Stoodios in association with Stoop!d Monkey, Williams Street, Sony Pictures Digital (Seasons 1–5) and Sony Pictures Television (Seasons 6–10). The show mocks popular culture, referencing toys, movies, television, games, popular fads, and more obscure references like anime cartoons and older television programs, much in the same vein as comedy sketch shows like Saturday Night Live. It employs stop-motion animation of toys, action figures, claymation, and various other objects, such as tongue depressors, The Game of Life pegs, and popsicle sticks. The show's creators were inspired by works such as Monty Python's Flying Circus, Pee-wee's Playhouse and The Kentucky Fried Movie.
One particular motif involves the idea of fantastical characters being placed in a more realistic world or situation (such as Stretch Armstrong re |
https://en.wikipedia.org/wiki/NFL%20on%20CBS | The NFL on CBS is the branding used for broadcasts of National Football League (NFL) games that are produced by CBS Sports, the sports division of the CBS television network in the United States. The network has aired NFL game telecasts since 1956 (with the exception of a break from 1994 to 1997). From 2014 to 2017, CBS also broadcast Thursday Night Football games during the first half of the NFL season, through a production partnership with NFL Network.
History
CBS' coverage began on September 30, 1956 (the first regular season broadcast was a game between the visiting Washington Redskins against the Pittsburgh Steelers), before the 1970 AFL–NFL merger. Prior to 1968, CBS had an assigned crew for each NFL team. As a result, CBS became the first network to broadcast some NFL regular season games to selected television markets across the country. From 1970 until the end of the 1993 season, when Fox won the broadcast television contract to that particular conference, CBS aired NFL games from the National Football Conference. Since 1975, game coverage has been preceded by pre-game show The NFL Today, which features game previews, extensive analysis and interviews.
1950s
In August 1956, the DuMont Television Network, the NFL's primary television partner, ended network operations after years of decline. DuMont had already sold the rights to the NFL Championship to NBC in 1955, and when DuMont ended its regular season coverage, CBS acquired the rights.
CBS's first attempts to broadcast the NFL on television were notable for there being no broadcasting contract with the league as a whole. Instead, CBS had to strike deals with individual teams to broadcast games into the teams' own markets, many of which CBS had purchased from the moribund DuMont Television Network. Every club but Cleveland joined forces with CBS. Meanwhile, in order to show regional games to regional audiences, CBS set out to divide its network into nine regional networks: New York, Philadelphia, Baltimore, Pittsburgh, Washington, Green Bay, Chicago and on the Pacific Coast (Los Angeles and San Francisco).
Often the games would be broadcast with "split audio" – that is, a game between two franchises would have the same picture in both teams' "networks" (the visiting team's home city and affiliates of the home team's "network" beyond a 75-mile radius of the home team's television market). Each team's "network" had different announcers (usually those working in their home markets).
The 1957 Pro Bowl was offered to NBC, then CBS. Both declined to carry the game. ABC was then offered to televise and accepted, but could not gain enough clearance of affiliates in time to make it a profitable venture. Thus they also dropped out and the game was not televised.
By 1959, CBS had at least 11 teams under contract. The Cleveland Browns were still the lone exception.
1960s
1960 saw the addition of a new team to the NFL in the form of the Dallas Cowboys. At this point, out of the 13 NFL teams, |
https://en.wikipedia.org/wiki/Graeme%20Devine | Graeme Devine is a computer game designer and programmer who co-founded Trilobyte, created bestselling games The 7th Guest and The 11th Hour, and helped design id Software's Quake III Arena. He was Chairman of the International Game Developers Association (IGDA) from 2002–2003. One of Graeme's trademarks is his Scooby-Doo wardrobe. He has said of his work that "I've not stuck to any one genre, platform or IP throughout my career, and I hope people eventually work out that's just fine."
Biography
Devine was born in 1966 in Glasgow, Scotland and began his career working on the TRS-80 at age 14 in the late 1970s. He joined Atari, Inc. at age 16 to port their classic game Pole Position to the Commodore 64, Apple, and ZX Spectrum. He also worked for Lucasfilm's Games Division, Activision UK, and Virgin Interactive.
Devine founded Trilobyte in December 1990 with Rob Landeros. Together, they designed the original concept of the 1992 puzzle game The 7th Guest. Graeme was the lead programmer on the game and on its sequel The 11th Hour. The 7th Guest sold 2 million copies, and is credited (along with the game Myst) with encouraging the use of CD-ROM drives for games.
id Software
After the demise of Trilobyte in the late 1990s, Devine joined id Software in 1999 to work as a designer on Quake III Arena and Quake III Team Arena. At id he gained recognition in the Mac gaming community for supporting development on the platform. He also worked on the Game Boy Advance versions of Commander Keen (2001), Wolfenstein 3D, and Doom II, and was a programmer on Doom 3 until he moved to Ensemble in August 2003. Matthew J. Costello, who worked with Devine on The 7th Guest, would also help plot Doom 3 and, like 7th Guest, later novelize it. Devine then took the Lead Designer position for Halo Wars, an RTS for the Xbox 360. In February 2008 Devine was named one of the Top 100 Developers in the video game industry.
Apple
In 2009, Devine was hired by Apple Inc. He was in charge of making sure that Apple's iOS devices play games well. In December 2010, he left Apple to focus on developing games on iOS devices.
GRL Games
Devine founded GRL Games in Santa Cruz, California in 2010, focused on making games for the iPhone and iPad. According to the company's website, the GRL either stands for "Giant Robot Lizard" or "Graeme Roque Lori." GRL Games' first application, Full Deck Solitaire was released in 2011 along with Clandestiny, Full Deck Word Games, Full Deck Poker Solitaire and Solitaire Minute. GRL Games' announced Dance City on 10 March 2012.
Magic Leap
Magic Leap is a virtual retinal display system using light fields. The company started in 2010. In 2014, it had raised more than $540 million (~$ in ) of venture funding from Google, Qualcomm, Andreessen Horowitz, and Kleiner Perkins, among other investors. Devine was the Chief Creative Officer & Senior VP Games, Apps, and Creative Experiences until his departure in 2020.
References
External links
GRL Games I |
https://en.wikipedia.org/wiki/F.%20Thomson%20Leighton | Frank Thomson "Tom" Leighton (born 1956) is the CEO of Akamai Technologies, the company he co-founded with the late Daniel Lewin in 1998. As one of the world's preeminent authorities on algorithms for network applications and cybersecurity, Dr. Leighton discovered a solution to free up web congestion using applied mathematics and distributed computing.
He is on leave as a professor of applied mathematics and a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL) at the Massachusetts Institute of Technology (MIT). He received his B.S.E. in Electrical Engineering from Princeton University in 1978, and his Ph.D. in Mathematics from MIT in 1981. His brother David T. Leighton is a full professor at the University of Notre Dame, specializing in transport phenomena. Their father was a U.S. Navy colleague and friend of Admiral Hyman G. Rickover, the father of naval nuclear propulsion and a founder of the Research Science Institute (RSI).
Dr. Leighton has served on numerous government, industry, and academic advisory panels, including the Presidential Informational Technology Advisory Committee (PITAC) and chaired its subcommittee on cybersecurity. He serves on the board of trustees of the Society for Science & the Public (SSP) and of the Center for Excellence in Education (CEE), and he has participated in the Distinguished Lecture Series at CEE's flagship program for high school students, the Research Science Institute (RSI).
Awards and honors
The Institute of Electrical and Electronics Engineers (IEEE) awarded Leighton the John von Neumann Medal in 2023 for “fundamental contributions to algorithm design and their application to content delivery networks.”
In 2018, Leighton won the Marconi Prize from the Marconi Society for "his fundamental contributions to the technology and establishment of content delivery networks".
He was elected as an ACM Fellow in 2018 for "his leadership in the establishment of content delivery networks, and his contributions to algorithm design".
In 2017, Leighton and Lewin were inducted into the National Inventors Hall of Fame, for Content Delivery Network methods.
He is a Fellow of the American Academy of Arts and Sciences
In 2012, Leighton became a fellow of the American Mathematical Society.
In 2009, Leighton became a Fellow of the Society for Industrial and Applied Mathematics.
In 2008, Leighton was appointed as a member of the United States National Academy of Sciences.
In 2004, Leighton was elected a member of the National Academy of Engineering for contributions to the design of networks and circuits and for technology for Web content delivery.
In 2001, Leighton received the IEEE Computer Society Charles Babbage Award.
In 1981, Leighton was named the first winner of the Machtey Award.
Personal life
He is married to the MIT professor Bonnie Berger, and they have two children.
Books
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (Morgan Kaufma |
https://en.wikipedia.org/wiki/Dweezil%20%26%20Lisa | Dweezil & Lisa was a 2004 Food Network television series presented by rock musicians and erstwhile couple Dweezil Zappa and Lisa Loeb. The duo traveled around America, sampling local music and cuisine.
The show originated from pie cooking demos that Loeb was incorporating into some of her concerts in support of her 2002 album, Cake and Pie. The pair approached Food Network to highlight these activities on a segment of one of its existing shows, but the network instead offered them an entire television series.
In the opening episode (January 16, 2004), they visited Atlanta, Georgia; the couple visited places like Gladys Knight & Ron Winans' Chicken & Waffles, a soul food restaurant, and the Varsity, America's largest drive-in restaurant. New York Post reviewer Adam Buckman described the show as "a heaping helping of cutie-pie", and "[s]omewhere between spicy and bland". Barbara Hooks of The Age commented that the show "draws a long bow, cutting awkwardly from Dweezil playing charity golf in Chicago to Lisa on a crawl of the windy city."
References
Food Network original programming
2000s American reality television series
2004 American television series debuts
2004 American television series endings
Food travelogue television series
Lisa Loeb |
https://en.wikipedia.org/wiki/National%20Crime%20Information%20Center | The National Crime Information Center (NCIC) is the United States' central database for tracking crime-related information. The NCIC has been an information sharing tool since 1967. It is maintained by the Criminal Justice Information Services Division (CJIS) of the Federal Bureau of Investigation (FBI) and is interlinked with federal, tribal, state, and local agencies and offices.
History
The NCIC database was created in 1967 under FBI director J. Edgar Hoover. The purpose of the system was to create a centralized information system to facilitate information flow between the numerous law enforcement branches. The original infrastructure cost is estimated to have been over $180 million. In the mid-1990s, the program went through an upgrade from the legacy system to the current NCIC 2000 system. A 1993 GAO estimate concluded that in addition to the costs of the upgrades, the FBI would need to spend an additional $2 billion to update its computer system to allow all users workstation access.
Records
The NCIC makes available a variety of records to be used for law enforcement and security purposes. The NCIC database includes 21 files: 14 person files and seven property files.
Person files:
Missing Person File: Records on people—including children—who have been reported missing to law enforcement and there is a reasonable concern for their safety.
Foreign Fugitive File: Records on people wanted by another country for a crime that would be a felony if it were committed in the United States.
Identity Theft File: Records containing descriptive and other information that law enforcement personnel can use to determine if an individual is a victim of identity theft or if the individual might be using a false identity.
Immigration Violator File: Records on criminal aliens whom immigration authorities have deported and aliens with outstanding administrative warrants of removal.
Protection Order File: Records on people against whom protection orders have been issued.
Supervised Release File: Records on people on probation, parole, or supervised release or released on their own recognizance or during pre-trial sentencing.
Unidentified Person File: Records on unidentified deceased people, living persons who are unable to verify their identities, unidentified victims of catastrophes, and recovered body parts. The file cross-references unidentified bodies against records in the Missing Persons File.
U.S. Secret Service Protective File: Records containing names and other information on people who are believed to pose a threat to the U.S. president and/or others afforded protection by the U.S. Secret Service.
Gang File: Records on violent gang groups and their members.
Known or Appropriately Suspected Terrorist File: Records on known or appropriately suspected terrorists in accordance with HSPD-6.
Wanted Person File: Records on criminals (including juveniles who may have been tried as adults) for whom a federal warrant or a felony or misdemeanor warr |
https://en.wikipedia.org/wiki/328%20Gudrun | Gudrun (minor planet designation: 328 Gudrun) is a main-belt asteroid.
It was discovered by Max Wolf on March 18, 1892, in Heidelberg.
Analysis of the light curve generated from photometric data collected in March 2012 provide a rotation period estimate of with a brightness variation of in B magnitude.
References
External links
000328
Discoveries by Max Wolf
Named minor planets
000328
18920318 |
https://en.wikipedia.org/wiki/Air%20Nippon%20Network | , or A-net, was an airline based on the grounds of Tokyo International Airport in Ōta, Tokyo, Japan.
It operated feeder services for parent Air Nippon, itself a subsidiary of All Nippon Airways (ANA). Its main base was New Chitose Airport. On October 1, 2010, Air Nippon Network, Air Next and Air Central were merged and rebranded as ANA Wings.
History
The airline was established in May 2001 to operate Air Nippon's local feeder routes from Tokyo and Sapporo. It started operations on 1 July 2002 using three Bombardier Dash 8 aircraft. In December 2003 4 more Dash 8s joined to replace Boeing 737 aircraft operated from Osaka by Air Nippon.
In April 2004 Air Nippon Network was headquartered in Higashi-ku, Sapporo, Hokkaido.
Air Nippon Network had 400 employees (at March 2007).
Destinations
Domestic destinations included:
Hokkaidō
Hakodate (Hakodate Airport)
Kushiro (Kushiro Airport)
Memanbetsu (Memanbetsu Airport)
Nakashibetsu (Nakashibetsu Airport)
Sapporo (New Chitose Airport)
Wakkanai (Wakkanai Airport)
Kantō
Tokyo (Haneda Airport)
Miyakejima (Miyakejima Airport)
Ōshima (Oshima Airport)
Kansai
Hyōgo Prefecture
Osaka International Airport is partly in Hyōgo Prefecture and partly in Osaka Prefecture
Osaka Prefecture
Osaka
Osaka International Airport (Itami) is partly in Hyōgo Prefecture and partly in Osaka Prefecture
Kansai International Airport
Tōhoku
Akita Prefecture
Ōdate-Noshiro (Odate-Noshiro Airport)
Chūbu
Niigata Prefecture
Niigata (Niigata Airport)
Chūgoku
Shimane Prefecture
Iwami/Hagi, Yamaguchi Prefecture (Iwami Airport)
Shikoku
Ehime Prefecture
Matsuyama (Matsuyama Airport)
Kōchi Prefecture
Kōchi (Kōchi Ryōma Airport)
Kyūshū
Fukuoka Prefecture
Fukuoka (Fukuoka Airport)
Saga Prefecture
Saga (Saga Airport)
Okinawa
Naha Airport
International destinations included
Fleet
The Air Nippon Network fleet consisted of the following aircraft (as of June 2008):
5 Bombardier Dash 8 Q300
14 Bombardier Dash 8 Q400
References
External links
Air Nippon Network
Defunct airlines of Japan
All Nippon Airways
Airlines established in 2001
Airlines disestablished in 2010
Airline companies based in Tokyo
Japanese companies established in 2001
Japanese companies disestablished in 2010 |
https://en.wikipedia.org/wiki/Codd | Codd is a surname. Notable people with the surname include:
Bernard Codd (died 2013), English motorcycle racer
Edgar F. Codd (1923–2003), British computer scientist
Frederick Codd (1832–), English Gothic revival architect
Hiram Codd (1838–1887), English engineer who invented and patented the Codd Bottle
Leslie Codd (1908–1999), South African botanist
Mike Codd (1939–), former senior Australian public servant
Ruth Codd, Irish actress and former TikToker
Fictional characters
Tom Codd, a character in the 1937 British comedy movie Beauty and the Barge
See also
Cod (disambiguation)
Codd-neck bottle
Codd's 12 rules |
https://en.wikipedia.org/wiki/QPS | QPS may refer to:
Computing
Quark Publishing System, a collaborative workflow management system
Queries per second, a measure of high-load servers' performance
Organisations
Queensland Police Service, Australia
Quaker Peace and Service, former name of Quaker Peace and Social Witness, a UK Quakers organisation committee
Quincy Public Schools, Massachusetts, US
Technology
Quality Performance System |
https://en.wikipedia.org/wiki/Kino%20%28software%29 | Kino is a discontinued free software GTK+-based video editing software application for Linux and other Unix-like operating systems. The development of Kino was started at the end of 2000 by Dan Dennedy and Arne Schirmacher. The project's aim was: "Easy and reliable DV editing for the Linux desktop with export to many usable formats." The program supported many basic and detailed audio/video editing and assembling tasks.
Kino has been included in several Linux distributions, including Debian, Puppy Linux and Ubuntu. BSD ports are also available.
Development towards major feature implementations in Kino was slowed due to the lead developer, Dan Dennedy's inclination towards the development of Media Lovin' Toolkit. Dennedy indicated when he released Kino 1 that he was returning to work on the MLT Framework to support Kdenlive (another Linux non-linear digital video editor), "since its latest version shows much promise".
As of August 5, 2013, the official website for Kino indicated that the project is "dead" and that users should try alternative software.
Features
Kino can import raw DV-AVI and DV files, as well as capture footage from digital camcorders using the raw1394 and dv1394 libraries. It can also import (as well as export) multiple still frames as JPEG, PNG, TIFF, PPM, and others image file types. Kino has the ability to export to camcorders using the ieee1394 or video1394 libraries. Kino can also export audio as WAV, Ogg Vorbis, MP3 using LAME, or MP2. Using FFmpeg, Kino can export audio/video as MPEG-1, MPEG-2, and MPEG-4 and is integrated with DVD Video authoring utilities.
Some features included in version 1.3.4 include: capture from FireWire cameras, fast and frame-accurate navigation/scrubbing, vi keybindings, storyboard view with drag-n-drop, trimmer with 3 point insert editing, fine-grain thumbnail viewer, support for jog shuttle USB devices, drag-n-drop from file manage, Undo/Redo up to 99X.
Kino provides a range of audio and video effects and transitions. Audio effects include silence, fade in/out, gain envelope, dub (from file), mix (from file), and crossfading support. Video effects include black/white, sepia tone, multiple color balance and masking tools, reverse (i.e. inverse or negative), mirror, kaleidescope, swap (flip), fade to/from black, blur (triangle), soft focus, titler and pixelate. Transitions include fade to/from color dissolve, push wipe, barn door wipe, color differences, and extensible wipes with numerous common SMPTE wipes (box, bar, diagonal, barn door, clock, matrix, four box, iris, and checkerboard).
Release history
Reception
In reviewing Kino 1.3.4 in January 2012 Terry Hancock of Free Software Magazine found that the application was only suitable for simple or very limited video editing tasks. He praised its simplicity and ease-of-learning even for users new to video editing, but criticized its lack of multi-track capabilities and described the process of adding background music or synchronizing ne |
https://en.wikipedia.org/wiki/Bump%20%27n%27%20Jump | Bump 'n' Jump is an overhead-view vehicular combat game developed by Data East and originally released in Japan as . Distributed in North America by Bally Midway, the arcade version was available as both a dedicated board and as part of Data East's DECO Cassette System. The goal is to drive to the end of a course while knocking enemy vehicles into the sides of the track and jumping over large obstacles such as bodies of water.
The arcade game was a commercial success in Japan and North America. The game was ported to the Atari 2600, Intellivision, ColecoVision, Nintendo Entertainment System, and Sharp X1. The Famicom version of Burnin' Rubber was published as in Japan in 1986.
Gameplay
The enemy vehicles are cars and trucks. Cars can be bumped into obstacles or jumped upon and destroyed, while trucks cannot be bumped; they can only be jumped upon to destroy them, and will sometimes drop obstacles that will destroy the player or one extra life. At the end of each level players receive bonus points for the number of enemy vehicles crashed. Going from one level to another is characterized by a change of seasons. Players get points for bumping other cars and causing the other cars to crash. If the player completes a level without destroying another car by bumping it or jumping on it, the player receives a 50,000-point bonus.
When a large obstacle which needs to jumped over, such as a body of water, is approaching, then the game displays a flashing exclamation point as a warning.
Ports
Mattel Electronics licensed Bump 'n' Jump from Data East and in 1983 released an Intellivision version and then a version for the Atari 2600. They also produced a version for ColecoVision distributed by Coleco in 1984.
Data East released a port of Burnin' Rubber as Buggy Popper for the Famicom in Japan in 1986. It was released for the Nintendo Entertainment System in North America by Vic Tokai in March 1987 as Bump 'n' Jump. Adding a level of complexity, the NES version of the game also requires that players pick up cans of gasoline that are interspersed throughout each course, as their car uses up fuel steadily throughout the game if the car goes too fast.
Reception
In Japan, Burnin' Rubber was the ninth highest-grossing arcade game of 1982. In the United States, Bump 'n' Jump was among the thirteen highest-grossing arcade games of 1983.
Legacy
In 1996, Next Generation listed it as number 65 on their "Top 100 Games of All Time", lauding the innovative jumping and bumping mechanics, the variety of cars, and the strong sensation of speed and tension.
The arcade version was made available on the PlayStation Portable in North America by G1M2 with its original title. The game also appears on the Data East Arcade Classics compilation with its original name.
Two clones were released for the Commodore 64. Burnin' Rubber in 1983 uses the chorale parts of Johann Sebastian Bach's Herz und Mund und Tat und Leben cantata for the soundtrack. Bumping Buggies was produced |
https://en.wikipedia.org/wiki/European%20VLBI%20Network | The European VLBI Network (EVN) is a network of radio telescopes located primarily in Europe and Asia, with additional antennas in South Africa and Puerto Rico, which performs very high angular resolution observations of cosmic radio sources using very-long-baseline interferometry (VLBI). The EVN is the most sensitive VLBI array in the world, and the only one capable of real-time observations. The Joint Institute for VLBI ERIC (JIVE) acts as the central organisation in the EVN, providing both scientific user support and a correlator facility. Very Long Baseline Interferometry (VLBI) achieves ultra-high angular resolution and is a multi-disciplinary technique used in astronomy, geodesy and astrometry.
The EVN operates an open-sky policy, allowing anyone to propose an observation using the network
EVN Telescopes
The EVN network comprises 22 telescope facilities:
Additionally the EVN often links with the UK-based 7-element Jodrell Bank MERLIN interferometer. It can also be connected to the US Very Long Baseline Array (VLBA), achieving a global VLBI, obtaining sub-milliarcsecond resolution at frequencies higher than 5 GHz.
e-EVN
Since 2004, the EVN has started to be linked together using international fibre optic networks, through a technique known as e-VLBI. The EXPReS project was designed to connect telescopes at Gigabit per second links via their National Research Networks and the Pan-European research network GÉANT2, and make the first astronomical experiments using this new technique. This allows researchers to take advantage of the e-EVN's Targets of Opportunity for conducting follow-on observations of transient events such as X-ray binary flares, supernova explosions and gamma-ray bursts.
EXPReS's objectives are to connect up to 16 of the world's most sensitive radio telescopes on six continents to the central data processor of the European VLBI Network at the Joint Institute for VLBI ERIC (JIVE). Specific activities involve securing "last-mile connections" and upgrading existing connections to the telescopes, updating the correlator to process up to 16 data streams at 1 Gbit/s each in real time and research possibilities for distributed computing to replace the centralized data processor.
History
The EVN was formed in 1980 by a consortium of five of the major radio astronomy institutes in Europe (the European Consortium for VLBI). Since 1980, the EVN and the Consortium has grown to include many institutes with numerous radio telescopes in several western European countries as well as associated institutes with telescopes in Russia, Ukraine, China and South Africa. Proposals for an additional telescope in Spain are under consideration.
Observations using the EVN have contributed to scientific research on Fast Radio Bursts (FRBs), gravitational lensing, and supermassive black holes.
See also
Northern Extended Millimeter Array
References
External links
The European VLBI Network on the internet
Joint Institute for VLBI ERIC on th |
https://en.wikipedia.org/wiki/Undercurrents | Undercurrents may refer to:
Undercurrents (magazine), a UK magazine of radical and alternative technology
Undercurrents (news), a UK alternative video news network
Undercurrents (TV series), a Canadian television newsmagazine
Undercurrents, a novel by Ridley Pearson |
https://en.wikipedia.org/wiki/Microsoft%20GIF%20Animator | Microsoft GIF Animator is a historical computer software program for Microsoft Windows to create simple animated GIF files based on the GIF89a file format. It was freely downloadable from the Microsoft Download Center but is now only available through MSDN and on third party download sites. It was also bundled with Microsoft Image Composer and Microsoft FrontPage.
Animations can be looped, spun, and faded in and out; users can set the size and transparency of images. Automatic and custom palette creation are supported.
See also
Microsoft Paint
References
Further reading
External links
How to animate GIFs with Microsoft GIF Animator
Raster graphics editors
GIF Animator |
https://en.wikipedia.org/wiki/Zone%20Routing%20Protocol | Zone Routing Protocol, or ZRP is a hybrid wireless networking routing protocol that uses both proactive and reactive routing protocols when sending information over the network. ZRP was designed to speed up delivery and reduce processing overhead by selecting the most efficient type of protocol to use throughout the route.
How ZRP works
If a packet's destination is in the same zone as the origin, the proactive protocol using an already stored routing table is used to deliver the packet immediately.
If the route extends outside the packet's originating zone, a reactive protocol takes over to check each successive zone in the route to see whether the destination is inside that zone. This reduces the processing overhead for those routes. Once a zone is confirmed as containing the destination node, the proactive protocol, or stored route-listing table, is used to deliver the packet.
In this way packets with destinations within the same zone as the originating zone are delivered immediately using a stored routing table. Packets delivered to nodes outside the sending zone avoid the overhead of checking routing tables along the way by using the reactive protocol to check whether each zone encountered contains the destination node.
Thus ZRP reduces the control overhead for longer routes that would be necessary if using proactive routing protocols throughout the entire route, while eliminating the delays for routing within a zone that would be caused by the route-discovery processes of reactive routing protocols.
Details
What is called the Intra-zone Routing Protocol (IARP), or a proactive routing protocol, is used inside routing zones. What is called the Inter-zone Routing Protocol (IERP), or a reactive routing protocol, is used between routing zones. IARP uses a routing table. Since this table is already stored, this is considered a proactive protocol. IERP uses a reactive protocol.
Any route to a destination that is within the same local zone is quickly established from the source's proactively cached routing table by IARP. Therefore, if the source and destination of a packet are in the same zone, the packet can be delivered immediately.
Most existing proactive routing algorithms can be used as the IARP for ZRP.
In ZRP a zone is defined around each node, called the node's k-neighborhood, which consists of all nodes within k hops of the node. Border nodes are nodes which are exactly k hops away from a source node.
For routes beyond the local zone, route discovery happens reactively. The source node sends a route request to the border nodes of its zone, containing its own address, the destination address and a unique sequence number. Each border node checks its local zone for the destination. If the destination is not a member of this local zone, the border node adds its own address to the route request packet and forwards the packet to its own border nodes. If the destination is a member of the local zone, it sends a route reply on the reve |
https://en.wikipedia.org/wiki/ZRP | ZRP may refer to:
Zimbabwe Republic Police
Zone Routing Protocol in networking
Zatlers' Reform Party, Latvia |
https://en.wikipedia.org/wiki/Alnus%20cordata | Alnus cordata, the Italian alder, is a tree or shrub species belonging to the family Betulaceae, and native to the southern Apennine Mountains (Campania, Basilicata and Calabria, mainly on western mountain sides) and the north-eastern mountains of Corsica. It has been introduced in Sicily, Sardinia, and more recently in Central-Northern Italy, other European countries (France, Belgium, Spain, Portugal, United Kingdom) and extra-European countries (Chile, New Zealand), where it has become naturalised.
Description
It is a medium-sized tree growing up to tall (exceptionally to ), with a trunk up to in diameter. The leaves are deciduous but with a very long season in leaf, from April to December in the Northern Hemisphere; they are alternate, cordate (heart-shaped), rich glossy green, long, with a finely serrated margin.
The slender cylindrical male catkins are pendulous, reddish and up to long; pollination is in early spring, before the leaves emerge. The female catkins are ovoid, when mature in autumn long and broad, dark green to brown, hard, woody, and superficially similar to some conifer cones. The small winged seeds disperse through the winter, leaving the old woody, blackish 'cones' on the tree for up to a year after.
It has three natural growing shapes. 1) Along rivers with room to grow and plenty of water one base will often give rise to four to six stems, which fan out at some ten degrees from vertical. 2) In open meadows near rivers, marshy ground and flooding can cause trees to angle or tilt over, whereupon over a matter of seasons they grow natural bends to return the upper trunk to vertical. It is not uncommon to find cordatas with S shapes arising from two tilting events. 3) In groves of multiple trees they grow thinner and straighter, such that a grove of a 100 trees can be an excellent renewable source of straight timber good for woodwork.
Cultivation
Like other alders, it is able to improve soil fertility through symbiotic nitrogen fixation with the bacteria Actinomyces alni (Frankia alni). It thrives on much drier soils than most other alders, and grows rapidly even under very unfavourable circumstances, which renders it extremely valuable for landscape planting on difficult sites such as mining spoil heaps and heavily compacted urban sites. It is commonly grown as a windbreak which helps with soil protection.
Alnus cordata has gained The Royal Horticultural Society's Award of Garden Merit.
Bonsai
The Italian Alder makes a medium to large bonsai, a quick grower it responds well to pruning with branches ramifying well and leaf size reducing quite rapidly.
Other uses
The tree also produces valuable reddish-orange wood. It breaks down when exposed to alternating dry and damp air, but is highly durable when kept wet or dry. As demonstrated in the construction of Venice, when immersed in water it lasts for centuries. Also when used within condensation-free, temperature and humidity controlled buildings it has a reputat |
https://en.wikipedia.org/wiki/FanFiction.Net | FanFiction.Net (often abbreviated as FF.net or FFN) is an automated fan fiction archive site. It was first launched in 1998 by Los Angeles computer programmer Xing Li, and currently has over 12 million registered users.
The site is split into main categories: Anime/Manga, Books, Cartoons, Games, Comics, Movies, Plays/Musicals, TV shows, Crossover, and Miscellaneous. Users who complete the free registration process can submit their fan fiction, maintain a user profile, review other stories, apply for a beta reader position, contact each other via private messages, and maintain a list of favorite stories and authors. There are centralized communities and forums. In lieu of signing up with a new account, the website allows users to use their Google, Facebook, or Twitter accounts. The site also owns a Twitter account called FictionPress where users of the website are updated on changes and improvements made.
Creation
In 1998, Xing Li, a software designer, created FanFiction.Net.[citation needed] The site was created as a repository for fan-created stories that revolved around characters from popular literature, television, comics, or real-world celebrities. Unlike other fan fiction sites, FanFiction.Net allowed stories about any characters rather than revolving around a specific set of characters. Registration was open to all people who claimed to be over 18, and by 2002 over 118,000 people were registered. (The age limit has since been moved down to 13.) At that time, one-third of the registrants self-identified as 18 or younger, and 80% were female.[citation needed]
Site content
, FanFiction.Net has had a total of just over 14 million stories published. The stories published to the site can be about new and old existing works. By 2001, almost 100,000 stories were posted on the website. Steven Savage, a programmer who operated a column on FanFiction.Net, described it as "the adult version of when kids play at being TV characters" and that the content posted on the website serves as examples for "when people really care about something".[citation needed]
Story publishing
FanFiction.Net has nine categories for the various fandoms/sub-categories on the site: Anime/Manga, Books, Cartoons, Comics, Games, Miscellaneous, Movies, Plays/Musicals, and TV shows. Stories on the site can be published as either "Fanfiction" with only one assigned sub-category, or as a "Crossover" with only two sub-categories. Excluding crossovers, the top fandoms on the site are Harry Potter, Naruto, and Twilight.
Writers may upload their stories to the site and must assign them a sub-category, language, and content rating. FanFiction.Net uses the content rating system from FictionRatings.com. This system contains the ratings of K, K+, T, M and MA. The MA rating and explicit violent and/or sexual themes are forbidden. The ratings are no longer done on the MPAA system, due to cease-and-desist demands from the Motion Picture Association of America in 2005. A list of explanat |
https://en.wikipedia.org/wiki/Planning%20Domain%20Definition%20Language | The Planning Domain Definition Language (PDDL) is an attempt to standardize Artificial Intelligence (AI) planning languages. It was first developed by Drew McDermott and his colleagues in 1998 (inspired by STRIPS and ADL among others) mainly to make the 1998/2000 International Planning Competition (IPC) possible, and then evolved with each competition. The standardization provided by PDDL has the benefit of making research more reusable and easily comparable, though at the cost of some expressive power, compared to domain-specific systems.
De facto official versions of PDDL
PDDL1.2
This was the official language of the 1st and 2nd IPC in 1998 and 2000 respectively.
It separated the model of the planning problem in two major parts: (1) domain description and (2) the related problem description. Such a division of the model allows for an intuitive separation of those elements, which are (1) present in every specific problem of the problem-domain (these elements are contained in the domain-description), and those elements, which (2) determine the specific planning-problem (these elements are contained in the problem-description). Thus several problem-descriptions may be connected to the same domain-description (just as several instances may exist of a class in OOP (Object Oriented Programming) or in OWL (Web Ontology Language) for example). Thus a domain and a connecting problem description forms the PDDL-model of a planning-problem, and eventually this is the input of a planner (usually domain-independent AI planner) software, which aims to solve the given planning-problem via some appropriate planning algorithm. The output of the planner is not specified by PDDL, but it is usually a totally or partially ordered plan (a sequence of actions, some of which may be executed even in parallel sometimes). Now lets take a look at the contents of a PDDL1.2 domain and problem description in general...(1) The domain description consisted of a domain-name definition, definition of requirements (to declare those model-elements to the planner which the PDDL-model is actually using), definition of object-type hierarchy (just like a class-hierarchy in OOP), definition of constant objects (which are present in every problem in the domain), definition of predicates (templates for logical facts), and also the definition of possible actions (operator-schemas with parameters, which should be grounded/instantiated during execution). Actions had parameters (variables that may be instantiated with objects), preconditions and effects. The effects of actions could be also conditional (when-effects).(2) The problem description consisted of a problem-name definition, the definition of the related domain-name, the definition of all the possible objects (atoms in the logical universe), initial conditions (the initial state of the planning environment, a conjunction of true/false facts), and the definition of goal-states (a logical expression over facts that should be true/fa |
https://en.wikipedia.org/wiki/Cape%20Feare | "Cape Feare" is the second episode of the fifth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on October 7, 1993. The episode features guest star Kelsey Grammer in his third major appearance as Sideshow Bob, who attempts to kill Bart Simpson again after getting out of jail, spoofing the 1962 film Cape Fear and its 1991 remake. Both films are based on John D. MacDonald's 1957 novel The Executioners and allude to other horror films such as Psycho.
The episode was written by Jon Vitti and was the final episode directed by Rich Moore. The idea was pitched by Wallace Wolodarsky, who wanted to parody Cape Fear. Originally produced as the last episode for the fourth season, it was held over to the fifth and was, therefore, the last episode produced by the show's original writers, most of whom subsequently left. The production crew found it difficult to stretch "Cape Feare" to the standard duration of half an hour (minus commercials), and consequently padded several scenes. In one such sequence, Sideshow Bob continually steps on rakes, the handles of which then hit him in the face; this scene has been cited as one of the show's most memorable moments. "Cape Feare" is also considered one of the darkest episodes of The Simpsons. The score received an Emmy Award nomination.
Plot
Sideshow Bob sends anonymous threatening letters in the mail to Bart from prison, wanting revenge on Bart for imprisoning him twice. He is paroled because the parole board no longer considers him a threat to society. After encountering Sideshow Bob at the local movie theater and realizing he sent the letters, the Simpsons join the Witness Protection Program and relocate to Terror Lake, changing their surname to "Thompson" and living aboard a houseboat. As they drive cross-country to their new home, they are unaware Sideshow Bob is strapped to the underside of the car. While suspended there, Sideshow Bob is hit with speed bumps, has hot coffee poured on him, and is driven through a large cactus patch. After arriving in Terror Lake, Sideshow Bob unstraps himself from the car and steps on rakes several times, injuring himself. He is then trampled by a parade that includes several large elephants.
During the night, Sideshow Bob reaches the houseboat and unmoors it from the dock. He ties up Homer, Marge, Lisa, Maggie and Santa's Little Helper so they cannot stop him. Sideshow Bob enters Bart's room and almost kills Bart as he flees out of the window. Sideshow Bob catches up to Bart and corners him at the edge of the boat, offering him a last request. Having noticed a sign saying Springfield is fifteen miles away, Bart quickly has an idea: to stall for time, he compliments Sideshow Bob on his beautiful voice and asks him to sing the entire score of H.M.S. Pinafore. Sideshow Bob delivers a performance that includes several props, costumes, and backdrops.
As the musical concludes, Sideshow Bob puts the blade |
https://en.wikipedia.org/wiki/Digital%20permanence | Digital permanence addresses the history and development of digital storage techniques, specifically quantifying the expected lifetime of data stored on various digital media and the factors which influence the permanence of digital data. It is often a mix of ensuring the data itself can be retained on a particular form of media and that the technology remains viable. Where possible, as well as describing expected lifetimes, factors affecting data retention will be detailed, including potential technology issues.
Since the inception of automatic computers, a key difference between them and other calculating machines has been their ability to store information. Over the years, various hardware devices have been designed to store ever larger quantities of data. With the development of the Internet the quantity of information available appears to continue to grow at an ever-increasing rate often characterised as an information explosion. As information is increasingly being stored on electronic media as opposed to traditional media such as hand-written documents, printed books, and photographic images, humanity's social and cultural legacy to future generations will depend increasingly on the permanence of these new media.
However, not all of this information is worth saving; sometimes its value can be short-lived. Other data, such as legal contracts, literature, scientific studies, are expected to last for centuries. This article describes how reliable different types of storage media are at storing data over time and factors affecting this reliability.
Librarians and archivists responsible for large repositories of information take a deeper view of electronic archives.
Given that individuals' personal data has been growing at a rapid rate in the 21st century, these archiving issues affecting professional repositories will soon be manifest in small organisations and even the home.
Types of storage
Solid-state memory devices
Digital computers, in particular, make use of two forms of memory known as RAM or ROM and although the most common form today is RAM, designed to retain data while the computer is powered on, this was not always the case. Nor is active memory the only form used; passive memory devices are now in common use in digital cameras.
Magnetic, or ferrite core, data retention is dependent on the magnetic properties of iron and its compounds.
PROM, or programmable read-only memory, stores data in a fixed form during the manufacturing process, with data retention dependent on the life expectancy of the device itself.
EPROM, or erasable programmable read-only memory, is similar to PROM but can be cleared by exposure to ultraviolet light.
EEPROM, or electrically erasable programmable read-only memory, is the format used by flash memory devices and can be erased and rewritten electronically.
Magnetic media
Magnetic tapes consist of narrow bands of a magnetic medium bonded in paper or plastic. The magnetic medium passes across a |
https://en.wikipedia.org/wiki/Life%20on%20the%20Fast%20Lane | "Life on the Fast Lane", also known as "Jacques to Be Wild" in the UK, is the ninth episode of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on March 18, 1990. It was written by John Swartzwelder and directed by David Silverman. Albert Brooks (in his second of ten appearances) guest starred as Jacques, a French bowling instructor, with him being credited as "A. Brooks".
The episode deals with how Homer's thoughtlessness precipitates Marge's infatuation with her bowling instructor Jacques, leading to a marriage crisis between her and Homer. In the original plan for the episode, Brooks (who improvised much of his dialogue) was to voice a Swedish tennis coach called Björn, with the episode to be titled "Björn to Be Wild".
The episode features a parody of the film An Officer and a Gentleman and won the Primetime Emmy Award for Outstanding Animated Program (for Programming Less Than One Hour) in 1990.
The character of Jacques would return in the season 34 episode "Pin Gal".
Plot
After forgetting Marge's 34th birthday, Homer rushes to the Springfield Mall, where he buys a bowling ball for himself and disguises it as her gift. Patty and Selma treat Marge to a birthday dinner at the Singing Sirloin, where Bart gives her French perfume and Lisa presents a macaroni-and-glue portrait of her mother as the Mona Lisa. Marge is pleased with both gifts because her children made her feel loved and special on her birthday. As Homer presents the bowling ball to her, it bursts through its box and squashes her birthday cake. Marge calls Homer out for offending her with a gift for himself, pointing out that she has never gone bowling in her life and that the ball is inscribed with his name.
Determined to learn how to bowl to spite Homer, Marge visits Barney's Bowl-A-Rama. While there, she meets a French bowling instructor named Jacques who offers to give her lessons. After several lessons, Jacques and Marge agree to meet for brunch.
Their brunch goes well until they see Helen Lovejoy, the gossipy preacher's wife, who seems delighted to find Marge with a man other than her husband. After deflecting Helen's prying by feigning a discussion of bowling theory, Jacques asks Marge to meet him the next day at his apartment, causing her to faint. While unconscious, she sees herself dancing with Jacques in his luxurious, bowling-themed apartment. When Marge regains consciousness after her romantic fantasy, she accepts Jacques's invitation.
Meanwhile, Homer finds the personalized bowling glove Jacques gave Marge and realizes he may lose her to another man. Soon Bart realizes Lisa's suspicion that their parents are drifting apart is true. Bart advises Homer to keep quiet about Marge's suspected affair to avoid making things worse.
Marge leaves for her rendezvous with Jacques but remembers her lifetime commitment to Homer during the drive. She comes to a fork in the road: one way leads to the Springfield N |
https://en.wikipedia.org/wiki/Proud%20as%20a%20Peacock | "Proud as a Peacock" was the advertising campaign used by the NBC television and radio networks from 1979 to 1981. The campaign was used to promote NBC's programming and to introduce the "Proud N", a logo that would be used until 1986.
The campaign
By 1979, NBC was deeply mired in third place in the Nielsen ratings. Fred Silverman, who joined the network a year earlier, could not bring the same ratings success he had as programming whiz at ABC and CBS, resulting in a string of programs (such as Supertrain) that were derided by critics and/or tuned out by viewers.
In an attempt to present a positive image in the face of this failure, Silverman and NBC developed an ad campaign called "Proud as a Peacock". The campaign featured a revised version of the famous NBC Peacock logo, billed as the "Proud N", along with a catchy high-energy jingle (written for NBC by Joey Levine (then known for singing Life Is a Rock (But the Radio Rolled Me) in 1974 and in the 1960s, sang lead vocals on bubblegum pop sound music from Crushing Enterprises) that promotes a network ready to shed its losing reputation and project an image of excitement in its programming. Future R&B singing legend Luther Vandross was among the artists who performed on the jingle.
The 1979–1980 season's "Proud" campaign promos were produced in New York City for NBC's radio and television networks, and customized versions were produced for the network's affiliates. The campaign was introduced on May 14, 1979, to promote the network's Fall lineup, and was used again in the 1980–1981 season with a revised jingle - "We're Proud!"
Despite the network's effort at "puttin' on a whole new face", NBC's difficulties continued unabated. Successes such as Little House on the Prairie and Diff'rent Strokes and the miniseries Shogun were countered by a flood of failed new programming (such as Pink Lady), which led to near-daily schedule changes. NBC continued to lag in last place behind CBS and ABC, producing only three Nielsen Top 20 shows in both the 1979-1980 and 1980–1981 seasons.
NBC was also forced to cancel plans to cover the 1980 Summer Olympics in the wake of the United States' boycott of the Moscow Games, resulting in many millions of dollars lost in rights fees, facility/equipment investments, and potential ad revenue.
The continued failures led to ridicule of the "Proud" campaign from both within the network and without (see below). Silverman would leave NBC in the summer of 1981; that fall the network adopted a slightly new campaign ("Our Pride Is Showing") with little difference in ratings. (By the mid-1980s, NBC's fortunes finally began to turn around, due to changes made by Silverman's replacement, Brandon Tartikoff, and his boss, former producer Grant Tinker; they were responsible for such now-legendary programs as The Cosby Show, Family Ties, Miami Vice, The Golden Girls, and Cheers, among many others.)
The "Loud" parody
The moves (and failures) of NBC under Fred Silverman's manageme |
https://en.wikipedia.org/wiki/AOHell | AOHell was a Windows application that was used to simplify 'cracking' (computer hacking) using AOL. The program contained a very early use of the term phishing. It was created by a teenager under the pseudonym Da Chronic, whose expressed motivation was anger that child abuse took place on AOL without being curtailed by AOL administrators.
History
AOHell was the first of what would become thousands of programs designed for hackers created for use with AOL.
In 1994, seventeen year old hacker Koceilah Rekouche, from Pittsburgh, PA, known online as "Da Chronic", used Visual Basic to create a toolkit that provided: a new DLL for the AOL client, a credit card number generator, email bomber, IM bomber, Punter, and a basic set of instructions. It was billed as, "An all-in-one nice convenient way to break federal fraud law, violate interstate trade regulations, and rack up a couple of good ol' telecommunications infractions in one fell swoop". When the program was loaded, it would play a short clip from Dr. Dre's 1993 song "Nuthin but a G Thang".
Most notably, the program included a function for stealing the passwords of America Online users and, according to its creator, contains the first recorded mention of the term "phishing". AOHell provided a number of other utilities which ran on top of the America Online client software. Though most of these utilities simply manipulated the AOL interface, some were powerful enough to let almost any curious party anonymously cause havoc on AOL. The first version of the program was released in 1994 by hackers known as The Rizzer, and The Squirrel.
Features
A fake account generator which would generate a new, fully functional AOL account for the user that lasted for about a month. This generator worked by exploiting the algorithm used by credit card companies known as the Luhn algorithm to dynamically generate apparently legitimate credit card numbers. The account would not be disabled until AOL first billed it (and discovered that the credit card was invalid). The generator could also generate fake addresses and phone numbers, resembling on their surface legitimate personal information. One example of a fake account generator was a Macintosh One-click based piece of software called Fake Maker written by a user known as McDawgg within the AOL Macwarez community. This software ran in parallel with the AOL program to create fake accounts based upon generated legitimate credit card account numbers. This software ultimately released 3 versions and helped to create thousands of fake accounts before AOL weakened its ability through more expedient account verification.
Phishing tools. The program included a "fisher" tool in 1995 that enabled hackers to steal passwords and credit card information through automated social engineering. The program would barrage random AOL users with instant messages like:
A punter (IM-bomber), which would send malicious Instant Message(s) to another user that would sign them off |
https://en.wikipedia.org/wiki/CNN%20T%C3%BCrk | Cable News Network Türk (known as CNN Türk) is a Turkish pay television news channel, launched on 11 October 1999 as the localised variant of American channel CNN. It broadcasts exclusively for Turkey and it is owned by Demirören Group. Its headquarters are in Istanbul.
CNN Türk Radio
CNN Türk Radio, went on the air on November 22, 2001. Last minute developments, in-depth analyses, economic agenda, evaluations by experts, important names of the business world and economic staff, sports news from Turkey and the world can be listened to at any time, and programs of special interest can also be followed via radio.
CNN TÜRK Radio is the audio broadcasting company of CNN TÜRK, which was established as a joint venture between Demirören Holding and Time Warner. As of September 21, 2020, the radio frequency in Istanbul has been changed to 92.6.
Controversies
CNN Türk was one of the Turkish news channels which were criticised for not covering the Gezi Park protests. On June 2, 2013, at 1:00am, CNN Türk was broadcasting a documentary on penguins while CNN International was showing live coverage of the protests in Turkey.
"[On the afternoon of Friday, May 31, 2013] CNN Turk was broadcasting a food show, featuring the “flavors of Niğde.” Other major Turkish news channels were showing a dance contest and a roundtable on study-abroad programs. It was a classic case of the revolution not being televised. The whole country seemed to be experiencing a cognitive disconnect, with Twitter saying one thing, the government saying another, and the television off on another planet."
In 2014, it showed a documentary on bees as Turkish Kurds undertook major protests about Ankara's refusal to support Kurdish fighters battling Islamic State in Kobanê.
On 15 July 2016, CNN Turk was forced to shut down by soldiers during the 2016 Turkish coup attempt.
In February 2020, the Republican People's Party (CHP), announced a boycott of CNN Türk. Tuncay Özkan from the CHP alleged that the TV channel acts like a publicity agency for the government of the Justice and Development Party (AKP). No politicians from the CHP would take part in any debate of CNN Türk and the CHP also advised not to watch CNN Türk at all.
Notable anchors
Ahmet Hakan Coşkun
References
External links
Official website
CNN Türk at LyngSat Address
https://twitter.com/cnnturk
Turk
24-hour television news channels in Turkey
Television stations in Turkey
Turkish-language television stations
Television channels and stations established in 1999
Turner Broadcasting System Turkey
Warner Bros. Discovery EMEA
Doğan Media Group
Mass media in Istanbul
1999 establishments in Turkey |
https://en.wikipedia.org/wiki/Accent%20kernel | Accent is an operating system kernel, most notable for being the predecessor to the Mach kernel. Originally developed at Carnegie Mellon University (CMU), Accent was influenced by the Aleph kernel developed at the University of Rochester. Accent improves upon the older kernel, fixing several problems and re-targeting hardware support for networks of workstation machines (specifically, the Three Rivers PERQ) instead of minicomputers. Accent was part of the SPICE Project at CMU which ran from 1981 to 1985. Development of Accent led directly to the introduction of Mach, used in NeXTSTEP, GNU Hurd, and modern Apple operating systems including Mac OS and iOS.
The original Aleph project used data copying to allow programs to communicate. Applications could open ports, which would allow them to receive data sent to them by other programs. The idea was to write a number of servers that would control resources on the machine, passing data along until it reached an end user. In this respect it was similar in concept to Unix, although the implementation was much different, using messages instead of memory. This turned out to have a number of problems, notably that copying memory on their Data General Eclipse was very expensive.
In 1979 one of the Aleph engineers, Richard Rashid, left for CMU and started work on a new version of Aleph that avoided its problems. In particular, Accent targeted workstation machines featuring a MMU, using the MMU to "copy" large blocks of memory via mapping, making the memory appear to be in two different places. Only data that was changed by one program or another would have to be physically copied, using the copy-on-write algorithm.
To understand the difference, consider two interacting programs, one feeding a file to another. Under Aleph the data from the provider would have to be copied 2kB at a time (due to features of the Eclipse) into the user process. Under Accent the data simply "appeared" in the user process for the cost of a few instructions sent to the MMU. Only if the user process changed the data would anything need to be copied, and even then, only the portions of the data that actually changed.
Another problem in Aleph was that its ports were identified by unique ID's that were assigned sequentially. It was simple for a program to "guess" them, thereby gaining access to resources on the computer that it had not been granted. This made the Aleph system rather insecure.
To address this, Accent made the port ID's internal to the kernel only. Instances of a program opening ports were handed back different IDs, stored in a mapping in the kernel. Whenever a message was sent to the kernel for delivery, it would first check that the program had access to the port in question by comparing with the mapping table for that program. Guessing port numbers no longer worked, the program's port IDs gave no clue of the "real" IDs in the kernel, and any attempt to talk on one not explicitly handed out by the kernel was an er |
https://en.wikipedia.org/wiki/Documentation%20generator | A documentation generator is a programming tool that generates software documentation intended for programmers (API documentation) or end users (end-user guide), or both, from a set of source code files, and in some cases, binary files. Some generators, such as Javadoc, can use special comments to drive the generation. Doxygen is an example of a generator that can use all of these methods.
Types of generation
Document generation can be divided in several types:
Batch generation (generic technique)
Text block correspondence (documents created based on pre-defined text blocks)
Forms (forms for websites)
Documentation synthesis:
Documentation can be inferred from code
Documentation can be inferred from execution traces
Some integrated development environments provide interactive access to documentation, code metadata, etc.
References
See also
Comparison of documentation generators
Template processor
Static code analysis
Literate programming
Integrated development environment |
https://en.wikipedia.org/wiki/OurTunes | ourTunes is a cross-platform Java-based file sharing client which allows users to connect to iTunes and share MP3 and AAC music files over a local area subnetwork. ourTunes v1.3.3 has been downloaded over 3,000,000 times.
The current version of ourTunes, v1.7g, works with all versions of iTunes up to at least iTunes 7 on Mac OS X and iTunes 11.02 on Microsoft Windows operating systems.
History
ourTunes was developed by David Blackman, a Stanford University student. It originally started as 'One2OhMyGod', a Swing-based client designed for iTunes's version 4.1 authorization, which was made obsolete by Apple's release of version 4.5. After Australian student David Hammerton cracked the new encryption and authentication system used by iTunes , One2OhMyGod was forked into a program called 'AppleRecords'. ourTunes was developed further from AppleRecords, including the conceptual design of programs such as MyTunes, designed by Trinity College (Connecticut) student Bill Zeller, although these programs lacked ourTunes's searchability features.
When iTunes 7 was released, Apple changed the authentication scheme again which caused the older version of ourTunes to fail. In response, a grass roots effort to "Save ourTunes" was founded to develop a version of ourTunes compatible with iTunes 7. So far, a working version has been posted to the website, although the project is not identified as complete.
Features
Unlike the iTunes music sharing feature, which allows a maximum of five users every 24 hours to connect and listen to the music of another user who has enabled sharing on a given subnetwork, ourTunes allows users to download music files to their own computer and provides the functionality to search through the songs from all connected hosts. ourTunes cannot download music purchased from the iTunes Music Store. Unlike peer-to-peer programs like Kazaa and Napster, ourTunes cannot search for or download music from users who do not share a subnetwork. ourTunes does not offer its users the opportunity to share files. ourTunes offers the ability to both download and stream music off the available shares. Because the program does not operate over the public Internet, users do not attract scrutiny or legal responses from the RIAA, which has asked colleges and universities to crack down on the programs in response.
See also
Peer-to-peer
iTunes
References
Borland, John. August 19, 2004. "Hackers revive iTunes music sharing." CNET News.
Ka Leo O Hawaii. June 27, 2006. "Recording industry targets LAN file sharing on college campuses."(Link broken as of 3/16/2008)
Hearing before the Subcommittee on Courts, The Internet, and Intellectual Property of the Committee on the Judiciary. September 22, 2005. REDUCING PEER-TO-PEER (P2P) PIRACY ON UNIVERSITY CAMPUSES: A PROGRESS UPDATE. United States House of Representatives. No. 109-156.
MacMichael, John. 2006. "Wireless home music broadcasting-modifying the NSLU2 to unleash your music!" Linux Journal. 141: 5.
Not |
https://en.wikipedia.org/wiki/Pugs%20%28compiler%29 | Pugs is a compiler and interpreter for the Raku programming language, started on February 1, 2005, by Audrey Tang. (At the time, Raku was known as Perl 6.)
Pugs development is now placed on hiatus, with most Raku implementation efforts now taking place on Rakudo.
Overview
The Pugs project aimed to bootstrap Perl 6 by implementing the full Perl 6 specification, as detailed in the Synopses. It is written in Haskell, specifically targeting the Glasgow Haskell Compiler.
Pugs includes two main executables:
Pugs is the interpreter with an interactive shell.
Pugscc can compile Perl 6 programs into Haskell code, Perl 5, JavaScript, or Parrot virtual machine's PIR assembly.
Pugs is free software, distributable under the terms of either the GNU General Public License or the Artistic License. These are the same terms as Perl.
Version numbering
The major/minor version numbers of Pugs converges to 2π (being reminiscent of TeX and METAFONT, which use a similar scheme); each significant digit in the minor version represents a successfully completed milestone. The third digit is incremented for each release. The current milestones are:
6.0: Initial release.
6.2: Basic IO and control flow elements; mutable variables; assignment.
6.28: Classes and traits.
6.283: Rules and Grammars.
6.2831: Type system and linking.
6.28318: Macros.
6.283185: Port Pugs to Perl 6, if needed.
Perl 5 compatibility
As of version 6.2.6, Pugs also has the ability to embed Perl 5 and use CPAN modules installed on the system. The example below demonstrates the use of the popular Perl DBI module to manage a database:
#!/usr/bin/pugs
use v6;
use perl5:DBI;
my $dbh = DBI.connect('dbi:SQLite:dbname=test.db');
$dbh.do("CREATE TABLE Test (Project, Pumpking)");
my $sth = $dbh.prepare("INSERT INTO Test VALUES (?, ?)");
$sth.execute(<PGE Patrick>);
$sth.execute(<Pugs Audrey>);
$sth.execute(<Parrot Leo>);
my $res = $dbh.selectall_hashref('SELECT * FROM Test', 'Pumpking');
# Just another Pugs hacker
say "Just another $res<Audrey><Project> hacker";
Development model
Several factors have been suggested as reasons for Pugs's progress:
Haskell's static typing can make it easier for program bugs to be detected at compile time. Haskell code is also often thought to be concise. The Parsec library , a monadic combinatorial parser written entirely in Haskell, simplifies parsing. Because Haskell is a purely functional language, making the functional code interact with the real world (inputs/outputs and time-driven environment) requires thought. To achieve this, Pugs makes extensive use of monads.
Pugs's use of test-driven methodology (a tenet of Extreme Programming). This methodology dictates that every module should have test code, even before the modules are implemented. Advocates of this methodology argue that it improves software quality. However, the project often silenced failed regression tests before releases, removing much of the benefit of test-driven development.
Tang's liberal |
https://en.wikipedia.org/wiki/Computational%20cybernetics | Computational cybernetics is the integration of cybernetics and computational intelligence techniques. Though the term Cybernetics entered the technical lexicon in the 1940s and 1950s, it was first used informally as a popular noun in the 1960s, when it became associated with computers, robotics, Artificial Intelligence and Science fiction.
The initial promise of cybernetics was that it would revolutionise the mathematical biologies (a blanket term that includes some kinds of AI) by its use of closed loop semantics rather than open loop mathematics to describe and control living systems and biological process behaviours. It is fair to say that this idealistic program goal remains generally unrealised.
While ‘philosophical’ treatments of cybernetics are common, especially in the biosciences, computational cybernetics has failed to gain traction in mainstream engineering and graduate education. This makes its specific achievements all the more remarkable. Feldman and Dyer (independently) discovered the true mechanism of somatic motor governance. This theory, called ‘equilibrium point theory’ by Feldman [1], and ‘neocybernetics’ by Dyer [2] debunks the concept of efference copy completely.
While Cybernetics is primarily concerned with the study of control systems, computational cybernetics focuses on their automatic (complex, autonomic, flexible, adaptive) operation. Furthermore, computational cybernetics covers not only mechanical, but biological (living), social and economical systems. To achieve this goal, it uses research from the fields of communication theory, signal processing, information technology, control theory, the theory of adaptive systems, the theory of complex systems (game theory, and operational research).
IEEE, a professional organization for the advancement of technology, has organized two international conferences focusing on computational cybernetics in 2008 and 2013.
See also
Cybercognition
Computational Heuristic Intelligence
References
Cybernetics
Artificial neural networks |
https://en.wikipedia.org/wiki/A2%20%28operating%20system%29 | A2 (formerly named Active Object System (AOS), and then Bluebottle) is a modular, object-oriented operating system with unconventional features including automatic garbage-collected memory management, and a zooming user interface. It was developed originally at ETH Zurich in 2002. It is free and open-source software under a BSD-like license.
History
A2 is the next generation of Native Oberon, the x86 PC version of Niklaus Wirth's operating system Oberon. It is small, fast, supports multiprocessing computers, and provides soft real-time computing operation. It is entirely written in an upward-compatible dialect of the programming language Oberon named Active Oberon. Both languages are members of the Pascal family, along with Modula-2.
A2's design allows developing efficient systems based on active objects which run directly on hardware, with no mediating interpreter or virtual machine. Active objects represent a combination of the traditional object-oriented programming (OOP) model of an object, combined with a thread that executes in the context of that object. In the Active Oberon implementation, an active object may include activity of its own, and of its ancestor objects.
Other differences between A2 and more mainstream operating systems is a very minimalist design, completely implemented in a type-safe language, with automatic memory management, combined with a powerful and flexible set of primitives (at the level of programming language and runtime system) for synchronising access to the internal properties of objects in competing execution contexts.
Above the kernel layer, A2 provides a flexible set of modules providing unified abstractions for devices and services, such as file systems, user interfaces, computer network connections, media codecs, etc.
User interface
Bluebottle replaced the older Oberon OS's unique text-based user interface (TUI) with a zooming user interface (ZUI), which is significantly more like a conventional graphical user interface (GUI). Like Oberon, though, its user interface supports a point and click interface metaphor to execute commands directly from text, similar to clicking hyperlinks in a web browser.
See also
Active Oberon
Oberon (operating system)
Oberon (programming language)
Oberon-2 programming language
Minimalism (computing)
References
External links
A2 Operating System & Active Oberon community in Telegram
An application in industrial control at Radiar
A2 user guide and applications description
A short movie showing a programming technique and the Bluebottle OS
Archived , ETH Zürich
Archived Oberon Language Genealogy
Archived Oberon Community Platform - Wiki & Forum
Free software operating systems |
https://en.wikipedia.org/wiki/Grant%20Thornton%20LLP | Grant Thornton LLP is the American member firm of Grant Thornton International, the seventh largest accounting network in the world by combined fee income. Grant Thornton LLP is the sixth largest U.S. accounting and advisory organization. The firm operates 59 offices across the US with approximately 8,500 employees, 550 partners, and produces annual revenue in excess of US$1.9 billion.
History
Early history
In 1924, Alexander Richardson Grant, a 26 year old senior accountant with Ernst & Ernst (later Ernst & Young) decided to leave the firm and start his own business with William O’Brien. Alexander Grant & Co. was built in Chicago and it provided services as a middle market firm. The firm was growing rapidly and nationally under the guidance of several new leaders during the next three decades.
In 1961, the company established its national office in Chicago and earned net revenue of more than $5 million. During this time, a competitive firm that was also committed to providing services to middle market established in Europe, and this firm later became known as Binder Dijker Otte & Co. (BDO).
During the mid-1960s, the firm decided to expand its business internationally. In 1969, Alexander Grant & Co. merged with companies from Australia, Canada and the United Kingdom to form an organization called Alexander Grant Tansley Witt.
By 1980, Alexander Grant & Co. had joined with 49 international accounting firms, including a UK firm named Thornton Baker, and formed a professional global network, Grant Thornton International.
In 1985, Alexander Grant & Co. merged with Fox & Co. and became the ninth largest accounting firm in the United States, just behind the nation's "Big Eight" firms. At that time, the company had 80 offices and more than 3,000 employees.
In 1986, Alexander Grant & Co. changed its name to Grant Thornton, resulted from its affiliation with the United Kingdom firm Thornton Baker, which also changed its name to Grant Thornton.
Recent history
In 2002, Grant Thornton acquired 7 offices, 43 partners and 396 employees from ex-Arthur Andersen.
In June 2014, Grant Thornton announced J. Michael McGuire as the firm's chief executive officer.
In August 2019, Brad Preber assumed CEO duties of the firm.
As of 2019, Grant Thornton was the sixth largest accounting firm in the United States and had 59 offices with more than 550 partners and 7,000 employees. Its revenue for fiscal year 2018 was $1.7 billion.
In March 2020, Grant Thornton LLP teamed up with GroupSense to offer digital crime mitigation technology.
Operations
Headquartered in Chicago, Grant Thornton LLP has three service lines: audit, tax, and advisory services. Specific advisory services and areas of expertise include: Sarbanes-Oxley compliance, mergers and acquisitions advice, tax, and business valuations. Target industries include construction, distribution, energy, financial services, food and beverage, healthcare, hospitality and restaurants, life sciences, manufactu |
https://en.wikipedia.org/wiki/RISKS%20Digest | The RISKS Digest or Forum On Risks to the Public in Computers and Related Systems is an online periodical published since 1985 by the Committee on Computers and Public Policy of the Association for Computing Machinery. The editor is Peter G. Neumann.
It is a moderated forum concerned with the security and safety of computers, software, and technological systems. Security, and risk, here are taken broadly; RISKS is concerned not merely with so-called security holes in software, but with unintended consequences and hazards stemming from the design (or lack thereof) of automated systems. Other recurring subjects include cryptography and the effects of technically ill-considered public policies. RISKS also publishes announcements and Calls for Papers from various technical conferences, and technical book reviews (usually by Rob Slade, though occasionally by others).
Although RISKS is a forum of a computer science association, most contributions are readable and informative to anyone with an interest in the subject. It is heavily read by system administrators, and computer security managers, as well as computer scientists and engineers.
The RISKS Digest is published on a frequent but irregular schedule through the moderated Usenet newsgroup comp.risks, which exists solely to carry the Digest.
Summaries of the forum appear as columns edited by Neumann in the ACM SIGSOFT Software Engineering Notes (SEN) and the Communications of the ACM (CACM).
References
External links
RISKS Digest web archive
RISKS Digest (Usenet newsgroup comp.risks)
Google groups interface to comp.risks
Risk
Safety engineering
Computer security procedures
Magazines established in 1985
Association for Computing Machinery magazines
Professional and trade magazines
SRI International
Engineering magazines
Irregularly published magazines published in the United States
1985 establishments in the United States |
https://en.wikipedia.org/wiki/Border%20Roads%20Organisation | The Border Roads Organisation (BRO) is a statutory body under the ownership of the Ministry of Defence of the Government of India. BRO develops and maintains road networks in India's border areas and friendly neighboring countries. This includes infrastructure operations in 19 states and three union territories (including Andaman and Nicobar Islands) and neighboring countries such as Afghanistan, Bhutan, Myanmar, Tajikistan and Sri Lanka. By 2022, BRO had constructed over of roads, over 450 permanent bridges with a total length of over length and 19 airfields in strategic locations. BRO is also tasked with maintaining this infrastructure including operations such as snow clearance.
Officers from the Border Roads Engineering Service (BRES) and personnel from the General Reserve Engineer Force (GREF) form the parent cadre of the BRO. It is also staffed by officers and troops drawn from the Indian Army's Corps of Engineers on extra regimental employment (on deputation). The Indian Army Pioneer Corps are attached to BRO task forces. BRO is also included in the Order of Battle of the Armed Forces, ensuring their support at any time. The organisations motto is Shramena Sarvam Sadhyam (everything is achievable through hardwork).
BRO is instrumental in significantly upgrading and building new India-China Border Roads (ICBRs). With regard to ICBRs Vaishali S Hiwase is the first woman officer for BRO road projects along the border with China. BRO set a Guinness World Record in November 2021 for the "highest altitude road" at Umling La. BRO has been instrumental in constructing some of the great Engineering Marvels like Atal Tunnel, Atal setu, Col Chewang Rinchen Setu to name a few.
History
The BRO was formed on 7 May 1960 to secure India's borders and develop infrastructure in remote areas of the north and north-east states of the country. In order to ensure coordination and expeditious execution of projects, the Government of India set up the Border Roads Development Board (BRDB) with the prime minister as chairman of the board and with the defence minister as deputy chairman.
Today, the BRDB exercises the financial and other powers of a Department of Government of India and is chaired by the Minister of State for Defence. Among others, Chief(s) of Army and Air Staff, Engineer-in-chief, Director General Border Roads (DGBR), FA(DS) are members of the BRDB. The secretary of the board exercises the powers of Joint Secretary to the Government of India. The executive head of the BRO is the Director General Border Roads (DGBR), who holds the rank of lieutenant general. In a bid to boost border connectivity, BRO has been entirely brought under the Ministry of Defence in 2015. Earlier it received funds from the Ministry of Surface Transport under the Ministry of Road Transport and Highways.
Organisation
The BRO consists of Border Roads Wing under the Ministry of Defense and the General Reserve Engineer Force (GREF). Officers are selected through the IES E |
https://en.wikipedia.org/wiki/Interval%20tree | In computer science, an interval tree is a tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is often used for windowing queries, for instance, to find all roads on a computerized map inside a rectangular viewport, or to find all visible elements inside a three-dimensional scene. A similar data structure is the segment tree.
The trivial solution is to visit each interval and test whether it intersects the given point or interval, which requires time, where is the number of intervals in the collection. Since a query may return all intervals, for example if the query is a large interval intersecting all intervals in the collection, this is asymptotically optimal; however, we can do better by considering output-sensitive algorithms, where the runtime is expressed in terms of , the number of intervals produced by the query. Interval trees have a query time of and an initial creation time of , while limiting memory consumption to . After creation, interval trees may be dynamic, allowing efficient insertion and deletion of an interval in time. If the endpoints of intervals are within a small integer range (e.g., in the range ), faster and in fact optimal data structures exist with preprocessing time and query time for reporting intervals containing a given query point (see for a very simple one).
Naive approach
In a simple case, the intervals do not overlap and they can be inserted into a simple binary search tree and queried in time. However, with arbitrarily overlapping intervals, there is no way to compare two intervals for insertion into the tree since orderings sorted by the beginning points or the ending points may be different. A naive approach might be to build two parallel trees, one ordered by the beginning point, and one ordered by the ending point of each interval. This allows discarding half of each tree in time, but the results must be merged, requiring time. This gives us queries in , which is no better than brute-force.
Interval trees solve this problem. This article describes two alternative designs for an interval tree, dubbed the centered interval tree and the augmented tree.
Centered interval tree
Queries require time, with being the total number of intervals and being the number of reported results. Construction requires time, and storage requires space.
Construction
Given a set of intervals on the number line, we want to construct a data structure so that we can efficiently retrieve all intervals overlapping another interval or point.
We start by taking the entire range of all the intervals and dividing it in half at (in practice, should be picked to keep the tree relatively balanced). This gives three sets of intervals, those completely to the left of which we'll call , those completely to the right of which we'll call , and those overlapping which we'll call .
The intervals in and are |
https://en.wikipedia.org/wiki/Big%20Three%20%28American%20television%29 | In the United States, there are three major traditional commercial broadcast television networks — NBC (the National Broadcasting Company), CBS (formerly known as the Columbia Broadcasting System), and ABC (the American Broadcasting Company) — that due to their longevity and ratings success are informally referred to as the "Big Three". They dominated American television until the 1990s (especially during the network era of the late 1950s to mid-1980s) and are still considered major U.S. broadcast companies to this day.
Backgrounds
The National Broadcasting Company and Columbia Broadcasting System were both founded as radio networks in the 1920s, with NBC eventually encompassing two national radio networks, the prestige Red Network and the lower-profile Blue Network. They gradually began experimental television stations in the 1930s, with commercial broadcasts being allowed by the Federal Communications Commission on July 1, 1941. In 1943, the U.S. government determined that NBC's two-network setup was anticompetitive and forced it to spin off one of the networks; NBC chose to sell the Blue Network operations, which became the American Broadcasting Company.
All three networks began regular, commercial television broadcasts in the 1940s. NBC and CBS began commercial operations in 1941, followed by ABC in 1948. A smaller fourth network, the DuMont Television Network, launched in 1944. The three networks originally controlled only a few local television stations, but they quickly affiliated with other stations to cover almost the entire U.S. by the late 1950s. Several of these stations affiliated with all three major networks and DuMont, or some combination of the four, in markets where only one or two television stations operated in the early years of commercial television; this resulted in several network shows, often those with lower national viewership, receiving scattershot market clearances, since in addition to maintaining limited broadcast schedules early on, affiliates that shoehorned programming from many networks had to also make room for locally produced content. As other stations signed on in larger cities, ABC, NBC, and CBS were eventually able to carry at least a sizable portion of their programming on one station.
Of the four original networks, only DuMont did not have a corresponding radio network. Ironically, the fourth major radio network of the era, the Mutual Broadcasting System, had briefly discovered the idea of launching a television network, with consideration being made to have film studio Metro-Goldwyn-Mayer supply programming talent. In fact, Bamberger Broadcasting's WOR-TV and WOIC (both stations affiliated with Mutual, the latter with a Washington, D.C. video outlet) maintained letterhead with "Mutual Television" decorating their identifications. Beyond this, there is no confirmation, however, that a cooperative video service was ever seriously considered, although Mutual's component stations launched television ou |
https://en.wikipedia.org/wiki/Greynet | Within the context of corporate and organizational networks, a greynet (or Grayware) is an elusive networked computer application that is downloaded and installed on end user systems without express permission from network administrators and often without awareness or cognition that it is deeply embedded in the organization’s network fabric. These applications may be of some marginal use to the user, but inevitably consume system and network resources. In addition, greynet applications often open the door for end use systems to become compromised by additional applications, security risks and malware.
Examples
Public instant messaging (AOL Instant Messenger, Windows Live Messenger, Yahoo! Messenger)
Web conferencing (webcam, VoIP telephony)
Peer-to-peer (P2P) file sharing clients
Distributed computing such as SETI@home
Adware "utilities"
Commercial spyware
Keystroke logging
The dynamics of greynet growth
As computer workstations have become connected to the Internet, a variety of programs have proliferated that offer the ability to extend communications, gather and deliver information, and to serve the needs of marketing concerns. Among the first to emerge were instant messaging clients such as ICQ, AOL Instant Messenger and MSN Messenger. Developments in technology have added video capability through webcam units, all of which have worked together to take advantage of available bandwidth in single, small network, and corporate environments.
The growth of greynets takes advantage of software and hardware developments. Informal networks are now appearing that provide a variety of streaming media and content that is supplied or modified by end users. An emerging category is "podcasting", in which users generate content for widespread download on portable MP3 players.
Problems with greynet programs
The problem with greynet programs is fourfold. First, greynet programs create network security risks by causing broad vectors for malware dissemination. Second, they create privacy issues for the network by opening large holes for information leakage. Third, greynet programs create compliance issues for a computer network by creating an invisible parallel communications network. Fourth, they create issues on local machines through the consumption of local system resources and possible operating system or program stability concerns. All of these things increase network and IT administration time and costs.
Added to this in the corporate work environment is the loss of meaningful production time due to non-work related distractions through these greynet applications. Individual network environment policies may vary from non-existent to a full lockdown of end user system privileges. See the "Risks and Liabilities" section of instant messaging for a more detailed overview of threats, risks, and solutions to those problems for the most prevalent of the greynet programs, public IM.
Dealing with the security aspects of greynets has le |
https://en.wikipedia.org/wiki/1973%20in%20rail%20transport |
Events
January events
January 27 – MBTA purchases several rail lines in New England from Penn Central to form the basis of the new commuter system's network.
February events
February 26 – Chessie System is incorporated to become the parent corporation of a combined B&O/C&O/WM railroad system.
March events
March 30 – Toronto's Yonge Subway is extended to York Mills station.
May events
May 21 – Passenger traffic begins on the Bay Area Rapid Transit (BART) Concord line, through the Berkeley Hills Tunnel between Oakland and Orinda, California beneath the Berkeley Hills.
June events
June 3 – The Norwegian State Railways open Lieråsen Tunnel on the Drammen Line between Asker and Lier ().
June 22 – The EMD SDP40F diesel locomotive enters revenue service with Amtrak.
August events
August 17 – The last DB Class E 40 leaves the gates of the Krupp factory in Essen.
September events
September 28 – Amtrak's Turboliners make their first run on the Chicago–St Louis corridor.
November events
November 5 – Bay Area Rapid Transit Peninsula service starts between Downtown San Francisco and Daly City.
November 7 – Frontier Series Canadian ten-dollar note introduced depicting the Canadian passenger train hauled by an EMD F40PH diesel-electric locomotive.
December events
December 19 – The Ealing rail crash occurred when an express train from London Paddington to Oxford derails at speed between Ealing Broadway and West Ealing. Ten passengers are killed and 94 injured
Unknown date events
The isolated coal hauler, the Black Mesa and Lake Powell Railroad, opens in Northern Arizona, the world's first line to use 50,000 V overhead line power.
Transcameroon Railway extended to N'Gaoundéré.
John W. Barriger III becomes president of the Boston and Maine Railroad.
Accidents
References |
https://en.wikipedia.org/wiki/Motion%20estimation | In computer vision and image processing, motion estimation is the process of determining motion vectors that describe the transformation from one 2D image to another; usually from adjacent frames in a video sequence. It is an ill-posed problem as the motion happens in three dimensions (3D) but the images are a projection of the 3D scene onto a 2D plane. The motion vectors may relate to the whole image (global motion estimation) or specific parts, such as rectangular blocks, arbitrary shaped patches or even per pixel. The motion vectors may be represented by a translational model or many other models that can approximate the motion of a real video camera, such as rotation and translation in all three dimensions and zoom.
Related terms
More often than not, the term motion estimation and the term optical flow are used interchangeably. It is also related in concept to image registration and stereo correspondence. In fact all of these terms refer to the process of finding corresponding points between two images or video frames. The points that correspond to each other in two views (images or frames) of a real scene or object are "usually" the same point in that scene or on that object. Before we do motion estimation, we must define our measurement of correspondence, i.e., the matching metric, which is a measurement of how similar two image points are. There is no right or wrong here; the choice of matching metric is usually related to what the final estimated motion is used for as well as the optimisation strategy in the estimation process.
Each motion vector is used to represent a macroblock in a picture based on the position of this macroblock (or a similar one) in another picture, called the reference picture.
The H.264/MPEG-4 AVC standard defines motion vector as:
motion vector: a two-dimensional vector used for inter prediction that provides an offset from the coordinates in the decoded picture to the coordinates in a reference picture.
Algorithms
The methods for finding motion vectors can be categorised into pixel based methods ("direct") and feature based methods ("indirect"). A famous debate resulted in two papers from the opposing factions being produced to try to establish a conclusion.
Direct methods
Block-matching algorithm
Phase correlation and frequency domain methods
Pixel recursive algorithms
Optical flow
Indirect methods
Indirect methods use features, such as corner detection, and match corresponding features between frames, usually with a statistical function applied over a local or global area. The purpose of the statistical function is to remove matches that do not correspond to the actual motion.
Statistical functions that have been successfully used include RANSAC.
Additional note on the categorization
It can be argued that almost all methods require some kind of definition of the matching criteria. The difference is only whether you summarise over a local image region first and then compare the summarisation (such a |
https://en.wikipedia.org/wiki/Mediabase | Mediabase is a music industry service that monitors radio station airplay in 180 US and Canadian markets. Mediabase publishes music charts and data based on the most played songs on terrestrial and satellite radio, and provides in-depth analytical tools for radio and record industry professionals. Mediabase charts and airplay data are used on many popular radio countdown shows and televised music awards programs. Music charts are published in both domestic and international trade publications and newspapers worldwide. Mediabase is a division of iHeartMedia.
History
Mediabase was founded in 1985 by Nancy and Rich Deitemeyer (a.k.a. Rich Meyer). Originally known as Mediascan, the company changed its name to Mediabase in 1987. Mediabase became the industry's first mass-airplay monitoring company in late 1987. After its inception, Mediabase was purchased by a private equity group based in Detroit, Michigan, then acquired by California-based Premiere Radio Networks, Jacor Communications, Clear Channel Communications, and ultimately, Bain Capital.
In January 1988, Mediabase began publishing a trade magazine known as Monday Morning Replay, featuring monitored airplay in the top 35 US radio markets. Mediabase then expanded its coverage to 180 US and Canadian markets. In 1992, Mediabase transitioned to delivery by data disk. In 1997, Mediabase moved its product to the Internet. Over the years, Mediabase has supplied data to numerous trade business-to-business (B-to-B) publications including Radio & Records, Network Magazine Group, Gavin, Hits, and Friday Morning Quarterback. Mediabase charts appear every Friday (originally every Tuesday until during the 3rd quarter of 2015) in USA Today's LIFE section. Mediabase serves as the official music chart provider for USA Today, the American Music Awards, and numerous syndicated programs, such as American Top 40 with Ryan Seacrest.
Charts and data
Mediabase produces song charts and airplay analyses of radio airplay in more than two dozen radio formats based on the monitoring of more than 1,800 radio stations in the US and Canada. Mediabase also monitors HD formats, video channels, and satellite radio.
Published charts are used on popular business-to-business (B-to-B) and consumer websites including AllAccess, Friday Morning Quarterback, Country Aircheck, and Hits Daily Double.
Music and entertainment industry executives gain access to in-depth charts and analyses through B-to-B exclusive access.
Mediabase owns and operates Rate the Music, a service that allows consumers to rate music on a scale from 1 to 5 and whether or not they are tired of hearing the song on the radio for the radio and record industries.
As of November 2022, Billboard started using Mediabase to make calculations for the Radio Songs chart, which is one of the components that is used to determine chart positions in the Hot 100 charts in the United States and Canada.
Use in radio programming
Countdown
Mediabase charts are the sou |
https://en.wikipedia.org/wiki/SGI%20Origin%20350 | The SGI Origin 350 is a mid-range server computer developed and manufactured by SGI introduced in 2003. Their discontinuation in December 2006 brought to a close almost two decades of MIPS and IRIX computing.
Hardware
The Origin 350 is based on the NUMAflex architecture, where a system is constructed from a varying number of modules connected together using the NUMAlink3 interconnect via cables. A system can consist of 2 to 32 processors, 1 to 64 GB of memory and 4 to 62 PCI-X slots. For systems with more than 8 processors, a 2U NUMAlink module is required for routing. Modules for disk storage and further PCI slots were also available. Multiple modules are coordinated at power up by an L2 controller which communicated to the modules via USB ports. The L2 controller was an external PowerPC computer running Linux with console, USB, modem and Ethernet ports.
Compute module
The 2U compute module contained the processors, memory and four PCI-X slots on two buses. Each compute module features an IP53 node board, which contains two or four MIPS R16000 microprocessors clocked at 600 or 700 MHz with 4 MB of ECC L2 cache, eight DIMM slots for 1 to 8 GB of ECC memory, a Bedrock ASIC serving as the crossbar for enabling communication between the processors, memory and PCI-X slots.
Two variants of the compute module exist, the base compute module and the system expansion compute modules. The difference between these two models is that the inclusion of a SCSI disk drive and an IO9 input/output card is mandatory in the base compute module, but optional in the system expansion compute module. The IO9 input/output card connects to a PCI-X slot and provides SCSI interfaces for two internal disks, an external SCSI port, audio I/O and a 10/100/1000BASE-T Ethernet connection.
References
SGI Origin 350 Server System User's Guide, 007-4566-001, June 16, 2003, Silicon Graphics
External links
SGI: SGI Origin 350
nekochan wiki: SGI Origin 350
Origin 350 |
https://en.wikipedia.org/wiki/GIS%20%28disambiguation%29 | GIS (Geographic information system) is a computer-based system to analyse and present spatial data.
GIS or Gis may also refer to:
Business
General Mills, an American food manufacturer, NYSE symbol
Global Investors Summit, Indore, India
Green investment scheme
Grey Island Systems International, a Canadian company
Gunawan Iron and Steel, Indonesia
Government
Georgian Intelligence Service
General Intelligence Directorate (Egypt)
General Intelligence Service (Sudan)
Ghana Immigration Service
, Italian Carabinieri unit
Government Information Services, Hong Kong
Guaranteed Income Supplement, to Canadian pension
Integrated Security Unit (French: ), in Canada
Special Intervention Group (French: ), of Algeria
Language
Giš, a cuneiform sign
GIŠ (wood Sumerogram), a cuneiform determinative prefix for wooden items
North Giziga language
Places
Gis, Iran
Greenland ice sheet
Schools
Garden International School, in Kuala Lumpur, Malaysia
German International School Doha, in Qatar
Gippsland Independent Schools, in Victoria, Australia
Goshen Intermediate School, in New York, US
Grace International School, in Chiang Mai, Thailand
Granada Islamic School, in Santa Clara, California, US
Greenoak International School, in Port Harcourt, Rivers State, Nigeria
Global Indian School, in Ajman, United Arab Emirates
Science and technology
Gas imaging spectrometer, on Japan's Advanced Satellite for Cosmology and Astrophysics
Gas-insulated switchgear
Generalized iterative scaling
Global information system
Other uses
Cemetery GIS, Giza Plateau, Egypt
G♯ (musical note), German notation Gis
Gadigal Information Service, which runs Koori Radio in Sydney, Australia
Gateshead International Stadium, in Tyne and Wear, England
Gisborne Airport, in New Zealand
Gis Gelati, an Italian cycling team
Partenope Napoli Basket, an Italian basketball team sponsored as Gis Napoli 1977–1978
Guide International Service, of the UK Girl Guides Association
See also
GI (disambiguation)
Jizz (disambiguation) |
https://en.wikipedia.org/wiki/Ahmed%20Omar%20Abu%20Ali | Ahmed Omar Abu Ali () is an American who was convicted of providing material support to the al-Qaeda terrorist network and conspiracy to assassinate United States President George W. Bush. His case has been the subject of criticism due to the federal government admitting evidence from alleged torture during Ali's extraordinary rendition.
Background
Born in Houston, Texas, in March 1981 and raised in Falls Church, Virginia, Abu Ali was valedictorian of his class at the Islamic Saudi Academy high school in nearby Alexandria. Abu Ali entered the University of Maryland in the fall of 1999 as an electrical engineering major, prayed at the Dar al-Hijrah mosque near Falls Church, but withdrew in the middle of the 2000 spring semester to study Islamic theology at the Islamic University of Medina in Medina, Saudi Arabia.
Arrest and detention in Saudi Arabia
In June 2003, Abu Ali was arrested by Saudi authorities while taking exams at the Islamic University of Medina. He was held for approximately 20 months by the Saudi government without charges or access to an attorney, and given the paucity of information coming out of Saudi Arabia about the case, many human rights organizations speculated that Abu Ali's situation was actually a case of extraordinary rendition and that he might be subject to torture. In addition, comments allegedly made by Gordon Kromberg, a federal prosecutor in the Eastern District of Virginia, heightened the concerns that Abu Ali had faced torture during his detention and interrogation in Saudi Arabia. In 2003, Kromberg was asked by a defense lawyer whether Abu Ali would be brought to the United States to face charges. Kromberg responded: "He's no good for us here. He has no fingernails left, according to an affidavit filed in court by the lawyer, Salim Ali.
In response to the detention by the Saudi government, Abu Ali's family, represented by Morton Sklar and the World Organization for Human Rights, filed a civil action against the U.S. government in the United States District Court for the District of Columbia. In the suit, they asked the court to issue a writ of habeas corpus to force the United States government to take action to get Abu Ali returned to the US. The government challenged the case, claiming that the court did not have jurisdiction either to interfere with US foreign policy (an executive function), or to force the Saudi government to release Abu Ali. Judge John D. Bates issued an order requiring partial discovery to determine if the court did, in fact, have jurisdiction.
US criminal trial
The District Court in DC never got a chance to rule on the issue of jurisdiction. In February 2005, Abu Ali was transferred to US custody pursuant to a criminal indictment, returned by a grand jury in the Eastern District of Virginia on February 3, 2005. The indictment charged Abu Ali with two counts of providing material support to terrorists, two counts of providing material support to a terrorist organization (Al-Qaeda), on |
https://en.wikipedia.org/wiki/X.121 | X.121 is the ITU-T address format of the X.25 protocol suite used as part of call setup to establish a switched virtual circuit between Public Data Networks (PDNs), connecting two network user addresses (NUAs). It consists of a maximum of fourteen binary-coded decimal digits and is sent over the Packet Layer Protocol (PLP) after the packet type identifier (PTI).
The address is made up of the international data number (IDN), which consists of two fields: the 4 digit data network identification code (DNIC) and the (up to) 10 digit national terminal number (NTN).
The DNIC has three digits to identify the country (one to identify a zone and two to identify the country within the zone) and one to identify the PDN (allowing only ten in each country). The NTN identifies the exact network device (DTE, data terminal equipment) in the packet-switched network (PSN) and is often provided as an NUA. There are no rules to the structure of the NTN.
IPv4 addresses can be mapped to X.121 as described in RFC 1236. The 14.0.0.0/8 block used to be reserved for X.121 use but was returned to IANA in 2008 to stave off IPv4 address exhaustion.
References
See also
Videotex
Network layer protocols
ITU-T recommendations
ITU-T X Series Recommendations
X.25 |
https://en.wikipedia.org/wiki/Connection-Oriented%20Network%20Service | Connection-Oriented Network Service (CONS) is one of the two Open Systems Interconnection (OSI) network layer protocols, the other being Connectionless-mode Network Service (CLNS). It is basically X.25, with a few adjustments.
Protocols providing CONS
Some protocols that provide the CONS service:
X.25, as specified in ITU-T Recommendation X.223 is a Public Data Network protocol that provides the Connection Oriented Network Service as described in ITU-T Recommendation X.213.
Signalling Connection Control Part (SCCP), as specified in ITU-T Recommendation Q.711 is a Signaling System 7 protocol that provides the Connection Oriented Network Service as described in ITU-T Recommendation X.213.
Service Specific Connection Oriented Protocol (SSCOP), as specified in ITU-T Recommendation Q.2110 is an Asynchronous Transfer Mode protocol that provides the Connection Oriented Network Service as described in ITU-T Recommendation X.213.
OSI protocols
Network layer protocols |
https://en.wikipedia.org/wiki/Lisa%27s%20First%20Word | "Lisa's First Word" is the tenth episode of the fourth season of the American animated television series The Simpsons. It was first broadcast on the Fox network in the United States on December 3, 1992. In the episode, as the Simpson family gathers around Maggie and tries to encourage her to say her first word, Marge reminisces and tells the story of Lisa's first word. Elizabeth Taylor appeared for the voicing of Maggie's first word.
The episode was directed by Mark Kirkland and written by Jeff Martin. After its initial airing on Fox, the episode was later released as part of a 1999 video collection: The Simpsons: Greatest Hits, and released again on the 2003 DVD edition of the same collection. The episode features cultural references to two chains of fast food restaurants, Wendy's and McDonald's, a reference to the 1981 arcade video game Ms. Pac-Man, and to Olympic gymnast Shun Fujimoto's performance in the 1976 Summer Olympics in spite of a serious injury.
"Lisa's First Word" received positive reception from television critics, and acquired a Nielsen rating of 16.6.
Plot
The Simpsons are trying unsuccessfully to get Maggie to speak, inspiring Marge to share the story of Lisa's first word. The story flashes back to 1983 when Homer, Marge and Bart, aged two, lived in an apartment on the Lower East Side of Springfield. Marge became pregnant again, and she and Homer realized that they would probably need a bigger place. After viewing several unsuitable properties, they bought a house on Evergreen Terrace with a $15,000 down payment from the sale of Grampa's house. In 1984, the Simpsons move there and meet their neighbors, Ned Flanders and his family.
Meanwhile, Krusty the Clown began a promotion for the 1984 Summer Olympic Games with his Krusty Burger chain. The promotion is a "scratch-and-win" game where customers could win free Krusty Burgers if America won a gold medal, but the game cards were rigged to feature events that athletes from Communist countries were most likely to win. But then, Krusty received word of the Soviet boycott of the Olympics, which caused him to lose $44 million from all the burgers he had to give away.
Bart was forced to give up his crib for the new baby. Realizing Bart was fond of clowns, Homer built him a clown-themed bed, but because of his poor carpentering skills he made it look like an evil clown, which terrifies Bart. Soon, Lisa was born, and Bart took an immediate dislike to her when she received more attention than him. After several failed attempts to retaliate against her, he decided to run away. Then Lisa said her first word, "Bart". He was thrilled, and Marge explained that Lisa adored him. Bart and Lisa hugged each other and bonded over how funny it was that they both called Homer by his name, rather than "Daddy" as he wished.
In the present day, as Bart and Lisa argue Homer puts Maggie to bed telling her that when kids learn to talk they quickly learn to talk back, and he is happy for her to never sa |
https://en.wikipedia.org/wiki/Magic%20Link | The Magic Link was a Personal Intelligent Communicator marketed by Sony from 1994, based on General Magic's Magic Cap operating system. The Magic Link PIC-1000 was brought to market by Jerry Fiala Sr at Sony. The "Link" part of the name refers to the device's ability to send and receive data over a modem.
A competing product to the Magic Link was the Motorola Envoy. In 1995, the Magic Link won the PC World World Class Award. Magic Link PIC-2000 was released in 1996.
Applications
Messages
Address Book
Clock and Calendar
Notebook
Spreadsheet
Datebook
Phone
Fax machine (Kobes Japan model only)
Pocket Quicken
Sony AV Remote Commander
Calculator
AT&T PersonaLink Services
America Online mail client
Documentary film
The device features prominently in the documentary film General Magic about the epic rise and fall of General Magic.
References
Personal digital assistants
Sony hardware |
https://en.wikipedia.org/wiki/Iverson%20Award | The Iverson Award, more formally the Kenneth E. Iverson Award for Outstanding Contribution to APL, is presented by the Special Interest Group on APL (SIGAPL) of the Association for Computing Machinery (ACM). It is presented to a person who has made significant contributions to the APL programming language or to the APL community. These contributions may be Technical (i.e. new developments in the APL language itself) or Service (assistance or support to SIGAPL or the APL community generally). The award consists of a plaque and a certificate, and is accompanied by a cash prize and a lifetime membership in SIGAPL.
The award is named in honor of Kenneth E. Iverson, the creator of APL.
Recipients of the award by year:
2016 Morten Kromberg and Gitte Christensen
2007 IBM APL2 Products and Services Team
2001 Jon McGrew
2000 Lynne Shaw
1999 William Rutiser
1998 Roy Sykes, Jr.
1997 John C. McPherson
1996 Roger Hui
1995 Peter Donnelly and John Scholes
1994 Donald B. McIntyre (geologist)
1993 James A. Brown
1991 Phil Abrams
1990 Ray Polivka
1989 Philip Van Cleave
1988 Al Rose (Allen J. Rose)
1987 Eugene McDonnell
1986 Raymond Tisserand, Clark Wiedmann, and Alex Morrow
1985 Dan Dyer and Ian Sharp
1984 Garth Foster
1983 Adin Falkoff
See also
List of computer-related awards
References
Computer-related awards
APL programming language family |
https://en.wikipedia.org/wiki/Descent%20direction | In optimization, a descent direction is a vector that points towards a local minimum of an objective function .
Computing by an iterative method, such as line search defines a descent direction at the th iterate to be any such that , where denotes the inner product. The motivation for such an approach is that small steps along guarantee that is reduced, by Taylor's theorem.
Using this definition, the negative of a non-zero gradient is always a
descent direction, as .
Numerous methods exist to compute descent directions, all with differing merits, such as gradient descent or the conjugate gradient method.
More generally, if is a positive definite matrix, then
is a descent direction at . This generality is used in preconditioned gradient descent methods.
See also
Directional derivative
References
Mathematical optimization |
https://en.wikipedia.org/wiki/Callander%20and%20Oban%20Railway | The Callander and Oban Railway company was established with the intention of linking the sea port of Oban to the railway network. This involved a long line from Callander through wild and thinly populated terrain, and shortage of money meant that the line was opened in stages from 1866 to 1880.
The line improved the economy of Oban, especially for the fishing trade and for tourism, but the winter traffic was limited. The company built a branch to Ballachulish, which included the construction of Connel Bridge, a remarkable bridge at Connel over Loch Etive. The branch opened in 1903, but although it opened up remote areas it was never commercially successful. It closed in 1966.
The main line was crossed by the West Highland Line at Crianlarich, where a connecting spur was constructed by the West Highland Line in 1897. The C&OR section between Callander and Crianlarich was closed in September 1965. However, the section between Crianlarich and Oban is still in use today, with trains using the connecting spur at Crianlarich.
History
Origins
The Scottish Central Railway and the Caledonian Railway were, with many others, incorporated by Act of Parliament on 1 July 1845. At this stage the two companies were collaborating, with the intention of connecting Perth with Carlisle, and beyond to the emerging English railway network; the Scottish Central had immediate plans with allied companies to reach Aberdeen, and there was early on talk of reaching into the north-west Highland area.
In 1846 the Dunblane, Doune and Callander Railway was proposed for a ten-mile (16 km) line along the valley of the River Teith. This was a false start, but a second attempt was authorised on 21 July 1856. The line opened on 1 July 1858.
Callander was the western extremity of lowland terrain: beyond lay wild highland hills. Promoters now considered whether Callander would make a good starting location for a line penetrating the Highlands, and reaching the western sea at Oban away, with relatively few settlements in between. They decided in November 1864 that the line should be built, and they called it the Callander and Oban Railway.
From Oban back to Crianlarich the route was clear; from there to the River Clyde they left the route open; they had calculated they needed £600,000 to build their line, and there was no possibility of local people investing that kind of money. The only way forward was to persuade another, established line to put some money in: the route would be determined by that fact. The Scottish Central was prepared to put up £200,000, and this was confirmed by agreement of 17 December 1864; the route from Crianlarich would accordingly go east to Callander and Dunblane. A Parliamentary Bill was submitted in the 1865 session and the railway was authorised on 8 July 1865. The authorised capital was £600,000 with loans of £200,000.
The Dunblane, Doune and Callander railway was absorbed by the Scottish Central Railway on 31 July 1865, and the Scottish Centr |
https://en.wikipedia.org/wiki/Business%20object | A business object is an entity within a multi-tiered software application that works in conjunction with the data access and business logic layers to transport data.
Business objects separate state from behaviour because they are communicated across the tiers in a multi-tiered system, while the real work of the application is done in the business tier and does not move across the tiers.
Function
Whereas a program may implement classes, which typically end in objects managing or executing behaviours, a business object usually does nothing itself but holds a set of instance variables or properties, also known as attributes, and associations with other business objects, weaving a map of objects representing the business relationships.
A domain model where business objects do not have behaviour is called an anemic domain model.
Examples
For example, a "Manager" would be a business object where its attributes can be "Name", "Second name", "Age", "Area", "Country" and it could hold a 1-n association with its employees (a collection of "Employee" instances).
Another example would be a concept like "Process" having "Identifier", "Name", "Start date", "End date" and "Kind" attributes and holding an association with the "Employee" (the responsible) that started it.
See also
Active record pattern, design pattern that stores object data in memory in relational databases, with functions to insert, update, and delete records
Business intelligence, a field within information technology that provides decision support and business-critical information based on data
Data access object, design pattern that provides an interface to a type of database or other persistent mechanism, and offers data operations to application calls without exposing database details
Data transfer object, design pattern where an object carries aggregated data between processes to reduce the number of calls
References
Rockford Lhotka, Visual Basic 6.0 Business Objects,
Rockford Lhotka, Expert C# Business Objects,
Rockford Lhotka, Expert One-on-One Visual Basic .NET Business Objects,
External links
A definition of domain model by Martin Fowler
Anemic Domain Model by Martin Fowler
Programming constructs |
https://en.wikipedia.org/wiki/United%20States%20Senate%20Foreign%20Relations%20Subcommittee%20on%20East%20Asia%2C%20The%20Pacific%2C%20and%20International%20Cybersecurity%20Policy | The Senate Foreign Relations Subcommittee on East Asia, The Pacific, and International Cybersecurity Policy is one of seven subcommittees of the Senate Foreign Relations Committee.
Jurisdiction
The subcommittee deals with all matters concerning U.S. relations with the countries of East Asia and the Pacific as well as regional intergovernmental organizations like the Association of South East Asian Nations and the Asia-Pacific Economic Cooperation forum. This subcommittee’s regional responsibilities include all matters within the geographic region, including matters relating to: (1) terrorism and non-proliferation; (2) crime and illicit narcotics; (3) U.S. foreign assistance programs; and (4) the promotion of U.S. trade and exports.
In addition, this subcommittee has global responsibility for international cybersecurity and space policy.
Members, 118th Congress
Members, 117th Congress
See also
U.S. House Financial Services Subcommittee on Asia, the Pacific, and the Global Environment
External links
Senate Committee on Foreign Relations
Senate Foreign Relations Committee subcommittees and jurisdictions
Foreign Relations Senate East Asian and Pacific Affairs |
https://en.wikipedia.org/wiki/International%20Karate | International Karate is a fighting game developed and published by System 3 for the ZX Spectrum in 1985 and ported to various home computers over the following years. In the United States it was published by Epyx in 1986 as World Karate Championship.
It was the first European-developed game to become a major hit in the United States, where it sold over 1.5 million copies. However, it drew controversy for its similarities to Karate Champ (1984), which led to Data East filing a lawsuit against Epyx. International Karate +, a successor which expanded the gameplay, was released in 1987.
Gameplay
The core game is a two-dimensional, one-on-one, versus fighting game. Players take on the roles of martial artists competing in a kumite tournament. Rather than wearing down an opponent's health, the goal is instead to score single solid hits. After each hit, combat stops and both combatants are returned to their starting positions. Depending on how well players hit their opponent, they score either a half-point or a full point. Matches can be quite brief, as only two full points are required to win, and a point can be quickly scored just seconds after a round begins.
In single-player mode, successive opponents increase in difficulty from novice white belts to master black belts. Play continues as long as the player continues to win matches. Between fights, bonus mini-games focusing on rhythm and timing appear, including one in which the player must break a number of stacked boards using the fighter's head. As in newer games in the genre, starting specifically with Street Fighter, the fights take place against a variety of backdrops (eight in total) representing different locations in the world: the Mount Fuji (Tokyo, Japan), the Sydney Harbour (Sydney, Australia), the Statue of Liberty (New York, USA), the Forbidden City (Beijing, China), the Christ the Redeemer (Rio de Janeiro, Brazil), the Palace of Westminster (London, England), the Parthenon (Athens, Greece), and the Great Pyramid of Giza (Cairo, Egypt).
The title utilizes the standard one-button joystick, allowing players to execute a variety of karate techniques. Unlike modern 2D fighting games, players do not turn around if the opponent is behind them and must instead execute one of three "turn-around" maneuvers to change direction.
Ports
Archer Maclean, initially only employed by System 3 to create graphics routines when the original programmer and artist walked out, developed the Commodore 64 version from scratch as he had no interest in porting the original ZX Spectrum version. Another port exists for the MSX platform. A version for the Atari ST home computer was created by Andromeda Software and released in 1986. This version featured the most advanced graphics of all versions as the 16 bit hardware supported more colors and larger sprites. The port to IBM PC compatibles, published the same year, uses 4-color CGA graphics.
Lawsuit
After the release of World Karate Championship in the US i |
https://en.wikipedia.org/wiki/FIPS%20140 | The 140 series of Federal Information Processing Standards (FIPS) are U.S. government computer security standards that specify requirements for cryptographic modules.
, FIPS 140-2 and FIPS 140-3 are both accepted as current and active. FIPS 140-3 was approved on March 22, 2019 as the successor to FIPS 140-2 and became effective on September 22, 2019. FIPS 140-3 testing began on September 22, 2020, and a small number of validation certificates have been issued. FIPS 140-2 testing is still available until September 21, 2021 (later changed for applications already in progress to April 1, 2022), creating an overlapping transition period of one year. FIPS 140-2 test reports that remain in the CMVP queue will still be granted validations after that date, but all FIPS 140-2 validations will be moved to the Historical List on September 21, 2026 regardless of their actual final validation date.
Purpose of FIPS 140
The National Institute of Standards and Technology (NIST) issues the 140 Publication Series to coordinate the requirements and standards for cryptographic modules which include both hardware and software components for use by departments and agencies of the United States federal government. FIPS 140 does not purport to provide sufficient conditions to guarantee that a module conforming to its requirements is secure, still less that a system built using such modules is secure. The requirements cover not only the cryptographic modules themselves but also their documentation and (at the highest security level) some aspects of the comments contained in the source code.
User agencies desiring to implement cryptographic modules should confirm that the module they are using is covered by an existing validation certificate. FIPS 140-1 and FIPS 140-2 validation certificates specify the exact module name, hardware, software, firmware, and/or applet version numbers. For Levels 2 and higher, the operating platform upon which the validation is applicable is also listed. Vendors do not always maintain their baseline validations.
The Cryptographic Module Validation Program (CMVP) is operated jointly by the United States Government's National Institute of Standards and Technology (NIST) Computer Security Division and the Communications Security Establishment (CSE) of the Government of Canada. The use of validated cryptographic modules is required by the United States Government for all unclassified uses of cryptography. The Government of Canada also recommends the use of FIPS 140 validated cryptographic modules in unclassified applications of its departments.
Security levels
FIPS 140-2 defines four levels of security, simply named "Level 1" to "Level 4". It does not specify in detail what level of security is required by any particular application.
FIPS 140-2 Level 1 the lowest, imposes very limited requirements; loosely, all components must be "production-grade" and various egregious kinds of insecurity must be absent.
FIPS 140-2 Level 2 adds requi |
https://en.wikipedia.org/wiki/Reversible%20computing | Reversible computing is any model of computation where the computational process, to some extent, is time-reversible. In a model of computation that uses deterministic transitions from one state of the abstract machine to another, a necessary condition for reversibility is that the relation of the mapping from states to their successors must be one-to-one. Reversible computing is a form of unconventional computing.
Due to the unitarity of quantum mechanics, quantum circuits are reversible, as long as they do not "collapse" the quantum states on which they operate.
Reversibility
There are two major, closely related types of reversibility that are of particular interest for this purpose: physical reversibility and logical reversibility.
A process is said to be physically reversible if it results in no increase in physical entropy; it is isentropic. There is a style of circuit design ideally exhibiting this property that is referred to as charge recovery logic, adiabatic circuits, or adiabatic computing (see Adiabatic process). Although in practice no nonstationary physical process can be exactly physically reversible or isentropic, there is no known limit to the closeness with which we can approach perfect reversibility, in systems that are sufficiently well isolated from interactions with unknown external environments, when the laws of physics describing the system's evolution are precisely known.
A motivation for the study of technologies aimed at implementing reversible computing is that they offer what is predicted to be the only potential way to improve the computational energy efficiency (i.e., useful operations performed per unit energy dissipated) of computers beyond the fundamental von Neumann–Landauer limit of energy dissipated per irreversible bit operation. Although the Landauer limit was millions of times below the energy consumption of computers in the 2000s and thousands of times less in the 2010s, proponents of reversible computing argue that this can be attributed largely to architectural overheads which effectively magnify the impact of Landauer's limit in practical circuit designs, so that it may prove difficult for practical technology to progress very far beyond current levels of energy efficiency if reversible computing principles are not used.
Relation to thermodynamics
As was first argued by Rolf Landauer while working at IBM, in order for a computational process to be physically reversible, it must also be logically reversible. Landauer's principle is the rigorously valid observation that the oblivious erasure of n bits of known information must always incur a cost of in thermodynamic entropy. A discrete, deterministic computational process is said to be logically reversible if the transition function that maps old computational states to new ones is a one-to-one function; i.e. the output logical states uniquely determine the input logical states of the computational operation.
For computational processes that are n |
https://en.wikipedia.org/wiki/Bart%20Selman | Bart Selman is a Dutch-American professor of computer science at Cornell University. He has previously worked at AT&T Bell Laboratories. He is also co-founder and principal investigator of the Center for Human-Compatible Artificial Intelligence (CHAI) at the University of California, Berkeley, led by Berkeley artificial intelligence (AI) expert Stuart J. Russell, and co-chair of the Computing Community Consortium's 20-year roadmap for AI research.
Education and career
Selman attended the Technical University of Delft, from where he received a master's degree in physics, graduating in 1983. He received his master's and PhD in computer science from the University of Toronto in 1985 and 1991 respectively.
Research
Selman's research focuses on the increasing and changing role of machines and computing in society. His studies at Center for Human-Compatible AI (CHAI) focus on the potential risks and negative impacts of advanced AI. An expert in AI Safety, he studies how computing has shifted from ethics-neutral software to predictive algorithms and advocates integrating ethics and AI.
He has authored over 90 publications, which have appeared in journals including Nature, Science, and Proceedings of the National Academy of Sciences. He has presented at several conferences in the fields of artificial intelligence and computer science.
His research concepts include tractable inference, knowledge representation, stochastic search methods, theory approximation, knowledge compilation, planning, default reasoning, satisfiability solvers like WalkSAT, and connections between computer science and statistical physics, namely phase transition phenomena.
Honors and awards
Selman has received five Best Paper Awards for his work, including the Cornell Stephen Miles Excellence in Teaching Award, the Cornell Outstanding Educator Award, a National Science Foundation Career Award, and an Alfred P. Sloan Research Fellowship. He is a Fellow of the American Association for Artificial Intelligence, the American Association for the Advancement of Science, and the Association for Computing Machinery. He sits on the advisory board for the DARPA Grand Challenge Cornell Team.
Partial list of Selman's papers
Statistical Regimes Across Considerateness Regions, Carla P. Gomes, Cesar Fernandez, Bart Selman, and Christian Bessiere. Proc. 10th Intl. Conf. on Principles and Practice of Constraint Programming (CP-04), Toronto, Ont., 2004. Distinguished Paper Award.
Towards Efficient Sampling: Exploiting Random Walk Strategies, Wei Wei, Jordan Erenrich, and Bart Selman. Proc. AAAI-04. San Jose, CA, 2004.
Tracking evolving communities in large linked networks, John Hopcroft, Brian Kulis, Omar Khan, and Bart Selman. Proc. Natl. Acad. of Sci. (PNAS), Feb., 2004.
Natural communities in large linked networks, John Hopcroft, Brian Kulis, Omar Khan, and Bart Selman. Proc. KDD, August 2003.
Backdoor To Typical Case Complexity, Ryan Williams, Carla Gomes, and Bart Selman. Proc. IJC |
https://en.wikipedia.org/wiki/XHTML%20Friends%20Network | XHTML Friends Network (XFN) is an HTML microformat developed by Global Multimedia Protocols Group that provides a simple way to represent human relationships using links. XFN enables web authors to indicate relationships to the people in their blogrolls by adding one or more keywords as the rel attribute to their links. XFN was the first microformat, introduced in December 2003.
Example
A friend of Jimmy Example could indicate that relationship by publishing a link on their site like this:
<a href="http://jimmy.example.com/" rel="friend">Jimmy Example</a>
Multiple values may be used, so if that friend has met Jimmy:
<a href="http://jimmy.example.com/" rel="friend met">Jimmy Example</a>
See also
FOAF
hCard
References
External links
XFN at the Global Multimedia Protocols Group
Microformats
Social networking services
XML-based standards
Semantic HTML |
https://en.wikipedia.org/wiki/Francisco%20Fonseca | José Francisco "Kikin" Fonseca Guzmán (born 2 October 1979) is a Mexican former professional footballer who played as a striker. He currently works as a football analyst for Televisa Deportes Network.
Club career
Born in León, Guanajuato, Fonseca made his first division debut with La Piedad in the 2001 Invierno season. After two seasons with Piedad, in which he played mostly as a substitute, Fonseca moved to UNAM Pumas, where he emerged as a star. After impressive showing in the 2003 Apertura and Clausura, he cemented his place in the Pumas starting lineup in the 2004 Clausura, during which he helped lead UNAM to a championship. After helping Pumas to a second title in the 2004 Apertura season, he was transferred to Cruz Azul, having registered 25 goals in 81 appearances for Pumas. At the beginning of 2005, Fonseca moved to Cruz Azul in one of the biggest transfers in Mexican league history. In Cruz Azul, he also was an important player playing 60 and registering 2 goals, help Cruz Azul reach the quarterfinals.
Benfica
On 27 July 2006, Fonseca signed a four-year contract with Portuguese club S.L. Benfica. Playing in only eight league games and scoring one goal (he also played in three cup games scoring two goals). His first goal at S.L. Benfica was on 21 December 2006 when he headed in a pass from Nuno Gomes against Belenenses.
Kikin scored another two goals in a match of the 4th round of the Taça de Portugal between Oliveira do Bairro SC and Benfica that ended 5–0.
After a half season with Benfica, he was transferred to Mexico's UANL Tigres for the start of the Clausura 2007.
International career
Fonseca was an emerging force at forward for the senior national team. On 2 April 2006, coach Ricardo Lavolpe selected him in the 23 man Mexican squad for the 2006 World Cup, in Germany. He scored his first goal in the 2006 FIFA World Cup against Portugal and won the Man Of The Match Award given by FIFA in the defeat of Mexico versus Portugal. After being selected by Hugo Sánchez for the 2007 Gold Cup, Fonseca was dropped from the squad for the 2007 Copa America due to his low performances and being shown the yellow card two consecutive games for un-called for fouls and complaints against refs. Despite an injury to star striker Jared Borgetti, Fonseca declined invitation to the 2007 Copa America. Even though he was Hugo's first choice, he took Luis Angel Landin instead. On 7 August 2008, Fonseca was called up to join Ericksson's second list of players, after an almost 1 and a half year drought of not playing with the national team. He earned a total of 43 caps, scoring 21 goals.
Career statistics
International
International goals
Honours
La Piedad
Liga de Ascenso: Verano 2001
UNAM
Mexican Primera División: Clausura 2004, Apertura 2004
Campeón de Campeones: 2004
Trofeo Santiago Bernabeu: 2004
Tigres UANL
North American SuperLiga: 2009
Individual
Mexican Primera División Forward of the Tournament: Clausura 2006
References
External links
|
https://en.wikipedia.org/wiki/Comparison%20of%20DOS%20operating%20systems | This article details versions of MS-DOS, IBM PC DOS, and at least partially compatible disk operating systems. It does not include the many other operating systems called "DOS" which are unrelated to IBM PC compatibles.
Historical and licensing information
Originally MS-DOS was designed to be an operating system that could run on any computer with a 8086-family microprocessor. It competed with other operating systems written for such computers, such as CP/M-86 and UCSD Pascal. Each computer would have its own distinct hardware and its own version of MS-DOS, a situation similar to the one that existed for CP/M, with MS-DOS emulating the same solution as CP/M to adapt for different hardware platforms. So there were many different original equipment manufacturer (OEM) versions of MS-DOS for different hardware. But the greater speed attainable by direct control of hardware was of particular importance, especially when running computer games. So very soon an IBM-compatible architecture became the goal, and before long all 8086-family computers closely emulated IBM hardware, and only a single version of MS-DOS for a fixed hardware platform was all that was needed for the market. This specific version of MS-DOS is the version that is discussed here, as all other versions of MS-DOS died out with their respective systems. One version of such a generic MS-DOS (Z-DOS) is mentioned here, but there were dozens more. All these were for personal computers that used an 8086-family microprocessor, but which were not fully IBM PC compatible.
Technical specifications
See also
Timeline of DOS operating systems
OS/2
List of operating systems
Comparison of Linux distributions
Comparison of operating systems
References
External links
Detailed timeline of DOS variants
DR-DOS version dates
Comparison of DOS
DOS |
https://en.wikipedia.org/wiki/John%20Eckert | John Eckert may refer to:
J. Presper Eckert (1919–1995), American electrical engineer and computer pioneer
John Eckert (musician) (born 1939), American jazz trumpeter
See also
John Ecker (disambiguation) |
https://en.wikipedia.org/wiki/Krusty%20Gets%20Busted | "Krusty Gets Busted" is the twelfth and penultimate episode of the first season of the American animated television series The Simpsons. It originally aired on the Fox Network in the United States on April 29, 1990. The episode was written by Jay Kogen and Wallace Wolodarsky, and directed by Brad Bird. In the episode, Krusty the Clown is convicted of armed robbery of the Kwik-E-Mart and imprisoned. Convinced that Krusty has been framed, Bart and Lisa investigate the crime and learn that Krusty's sidekick, Sideshow Bob, is the culprit.
This episode marks the first full-fledged appearance of Kent Brockman, and Kelsey Grammer makes his first guest appearance on the show as the voice of Sideshow Bob.
Plot
Patty and Selma visit the Simpson family to show them slides of their last trip to Yucatán. Homer is asked by Marge to stop by the Kwik-E-Mart on the way home from work to buy some ice cream, where he sees a figure resembling Krusty the Clown committing a robbery. Soon, Krusty is arrested, and after Homer identifies him at a police lineup and in the courtroom, Krusty is found guilty and imprisoned, upsetting Bart. Naturally, the public is shocked and outraged by Krusty's seeming criminal turn, throwing Springfield into chaos. Apu begins marketing a 'clown repelling' machine gun, whilst Reverend Lovejoy arranges a bonfire where the town's residents destroy Krusty's merchandise. As a result of Krusty's absence, his sidekick Sideshow Bob becomes the new host of his show, now called The Side-Show Bob Cavalcade of Whimsy and retooled to focus on education and classic literature while retaining The Itchy & Scratchy Show. Refusing to accept that his idol could have committed the crime, Bart enlists Lisa's help to prove Krusty's innocence.
At the crime scene, Bart and Lisa recall the robber read a magazine and used a microwave oven, which Krusty could not have done as he is illiterate and has an artificial pacemaker which requires him to avoid microwave radiation. When Bart and Lisa visit Sideshow Bob to learn whether Krusty had any enemies, he gives them tickets to his show. During the live broadcast, Bart is invited on stage with Bob, who dismisses Bart's points about the microwave and magazine.
When Bob says he has "big shoes to fill", Bart remembers when Homer stepped on the robber's foot during his robbery, making him react in pain. Despite wearing large clown shoes, Krusty has small feet and would not have felt Homer stepping on them. Bart deduces that Sideshow Bob is the culprit, since he had the most to gain from Krusty's downfall, and proves this to the audience by hitting one of Bob's feet with a mallet, revealing their size as Bob reacts in pain. While watching the show, the police realize they failed to notice this piece of evidence and head to the studio to arrest Bob, who admits he framed Krusty because he hated being on the receiving end of the clown's humiliating gags. Krusty is exonerated, and regains the trust of the townspeople, inclu |
https://en.wikipedia.org/wiki/John%20Bromyard | John Bromyard (d. c. 1352) was an influential English Dominican friar and prolific compiler of preaching aids.
Life
Little is known of his personal life. Two dates can be cited: in 1326, he was granted a licence to hear confessions in the diocese of Hereford, and in 1352, that licence was granted to another Dominican, presumably after Bromyard's death. There is evidence in his works that he had served in the diocese of Llandaff in South Wales, and he shows familiarity with customs and circumstances in France and Italy. But because the Dominicans were an international order with lively internal communication, this cannot be taken as proof that he had travelled abroad. He was evidently trained in canon law, perhaps at Oxford.
He spent most of his career at the newly founded Dominican priory at Hereford. The Dominicans had been fighting for a foothold here for eighty years against the resistance of the Dean and Chapter, before they were finally established under the patronage of Edward II in 1322. Bromyard must therefore have been among the first friars to join the fledgeling priory. In an age when manuscript books were prohibitively expensive, it is likely that he embarked on the task of compiling preaching aids as a means of providing the priory with a library to support its preaching mission. The sheer volume of his work suggests that it may well have been produced by a collaborative process involving the other friars at the Hereford priory, with Bromyard acting as editor in chief.
Working methods
Bromyard was a pioneer or early adopter of new techniques in the organization of information. Each of his surviving works is provided with an alphabetical index. He employs standardized divisions of his texts, and uses them for systematic cross-references.
As aids to preaching, his works included all manner of preachable material according to the homiletic practice of the time: exempla, authorities from the church fathers and bible as well as from classical authors, natural lore, proverbs and verses (some in French or English), etc. He uses "scientific knowledge" (natura ratione) to explain natural phenomenon such as "rain" taking away the mysticism of "acts of God". These explanations are apparently drawn from Greek and Arab ancient texts. (Bromyard: Summa Praedicantium, De Natura Ratione). He was particularly fond of Canon law, devoting the Tractatus iuris to expounding Christian doctrine and morality almost exclusively by means of citations from legal texts. He engages in occasional political commentary on problems in English society, and even criticises abuses in his own Dominican order.
Influence
Bromyard was one of the most influential preachers of the 14th century in England. His Summa Predicantium was cited by many writers of the succeeding generations and used by many more. It was first printed about 1484 in Basel and went through several editions, the last in 1627 in Antwerp. The Tractatus iuris was also printed twice and survives in |
https://en.wikipedia.org/wiki/Ohr%20Somayach | Ohr Somayach may refer to:
Ohr Somayach (book), commentary by Rabbi Meir Simcha of Dvinsk
Ohr Somayach, common reference to Rabbi Meir Simcha of Dvinsk
Ohr Somayach, Jerusalem, a network of yeshivas based in Israel
Ohr Somayach, Monsey, a yeshiva in the United States
Ohr Somayach, South Africa, South African affiliate of Ohr Somayach, Jerusalem
See also
Ohr (disambiguation) |
https://en.wikipedia.org/wiki/Message%20submission%20agent | A message submission agent (MSA), or mail submission agent, is a computer program or software agent that receives electronic mail messages from a mail user agent (MUA) and cooperates with a mail transfer agent (MTA) for delivery of the mail. It uses ESMTP, a variant of the Simple Mail Transfer Protocol (SMTP), as specified in RFC 6409.
Many MTAs perform the function of an MSA as well, but there are also programs that are specially designed as MSAs without full MTA functionality. Historically, in Internet mail, both MTA and MSA functions use port number 25, but the official port for MSAs is 587. The MTA accepts a user's incoming mail, while the MSA accepts a user's outgoing mail.
Benefits
Separation of the MTA and MSA functions produces several benefits.
One benefit is that an MSA, since it is interacting directly with the author's MUA, can correct minor errors in a message format (such as a missing Date, Message-ID, To fields, or an address with a missing domain name) and/or immediately report an error to the author so that it can be corrected before it is sent to any of the recipients. An MTA accepting a message from another site cannot reliably make those kinds of corrections, and any error reports generated by such an MTA will reach the author (if at all) only after the message has already been sent.
One more benefit is that with a dedicated port number, 587, it is always possible for users to connect to their domain to submit new mail. To combat spam (including spam being sent unwittingly by a victim of a botnet) many ISPs and institutional networks restrict the ability to connect to remote MTAs on port 25. The accessibility of an MSA on port 587 enables nomadic users (for example, those working on a laptop) to continue to send mail via their preferred submission servers even from within others' networks. Using a specific submission server is a requirement when sender policies or signing practices are enforced.
Another benefit is that separating the MTA and MSA functions makes it easier for an MTA to deny relaying, that is to refuse any mail that is not addressed to a recipient at a domain that is served locally. This is a strategy used by ISPs to prevent the sending of spam from virus-infected client computers. By contrast, an MSA must generally accept mail for any recipient on the Internet, though it only accepts such mail from authors who are authorized to use that MSA and who have established their identity to the MSA via authentication. In times when both mail submission and acceptance of incoming mail were usually accomplished using the same protocol and the same server, the ability to send mail to arbitrary destinations without authentication allowed spammers to use MTAs as a means of distributing spam (since a single message transaction can request that an MTA relay a message to a large number of recipients), and also made it more difficult to trace a message to its origin.
Moreover, MSAs and MTAs can have different policies for |
https://en.wikipedia.org/wiki/RSTP | RSTP :
Rstp, the abbreviation for the orchid genus Restrepia
Rapid Spanning Tree Protocol, a computer network protocol |
https://en.wikipedia.org/wiki/Ork%20%28video%20game%29 | Ork is a video game made for the Amiga and Atari ST personal computers. It was developed by WJS Design and published by Psygnosis in 1991.
Ork is a platform game with 5 levels. It takes place on an alien planet called Cisskei, where the main character, an alien called Ku-Kabul, must find his way through each level. The levels are filled with tasks such as solving the puzzles or fighting enemies.
Ku-Kabul is equipped with a machine gun and a jetpack with limited ammunition and fuel, necessitating careful use of tools until the game allows the player to restock their items.
Keeping with Psygnosis's tradition of including references to earlier games, the third level of Ork includes a moment where Lemmings spawn, walk a few dozen metres, then jump off a cliff.
The theme music is composed by Tim Bartlett. The cover artwork for Ork consists of the image Behemoth's World, which was painted by Richard Clifton-Dey, and was previously used as the cover for Blue Öyster Cult's 1980 album Cultösaurus Erectus.
References
External links
Ork at Amiga Hall of Light
Ork at Atari Mania
1991 video games
Amiga games
Atari ST games
Platform games
Psygnosis games
Video games set on fictional planets
Science fiction video games
Single-player video games
Video games developed in the United Kingdom |
https://en.wikipedia.org/wiki/Leafcutter%20John | Leafcutter John is the recording name of John Burton, a UK-based musician and artist. He makes frequent use of Max/MSP in his compositions. Much of Burton's style is based in computer music and use of samples of everyday sounds. However, he also has roots as a folk musician, and this influence is apparent in his more recent work.
Career
After graduating in Fine Art Painting at Norwich School of Art (1996–1998), Burton moved to London and after a year pursuing a career as a performance artist, began to concentrate on his musical work. He soon secured interest from Mike Paradinas, owner of independent electronics label Planet Mu. Paradinas encouraged Burton to develop his electro-acoustic folk hybrid and his first full-length release, Concourse EEP, was released in early 2000. His album, The Housebound Spirit, was a response to being mugged outside his London studio. The album deals with themes of increasing alienation and agoraphobia.
His fourth album The Forest and the Sea was nominated for Best Album at the Qwartz Electronic Music Awards 2007 and was described by comedian James Acaster as "a criminally overlooked record".
In 2019, Burton released his seventh album Yes! Come Parade With Us on James Holden’s label Border Community, featuring modular synth and field recordings from the Norfolk Coast Path.
Burton was a full-time member of the contemporary British jazz pioneers and Mercury Music Prize nominees Polar Bear, founded by drummer Seb Rochford.
He has performed with Imogen Heap, Shabaka Hutchings, Serafina Steer, Laura Jurd and Talvin Singh, supported Matmos and Otomo Yoshihide, and been in Beck's band at the Barbican, London. In 2007, he performed at Jarvis Cocker’s Meltdown Festival. He played alongside jazz pianist Michael Wollny at the opening night of the Bauhaus 100 festival in January 2019. In autumn/winter 2019, he supported The Comet Is Coming on their UK tour.
Leafcutter John is also an accomplished producer and remixer, having worked on projects for: DJ /rupture, Ed Dowie, Melt Yourself Down, Mu-ziq/Speedy J, Electric Company, Badly Drawn Boy, Capitol K, Bas Jan and others.
He lives in Sheffield, South Yorkshire.
Projects
Leafcutter John has engaged in several projects, both commissioned and DIY. Examples include installing microphones under a creaky wooden floor to record and manipulate the sounds in a software program, growing and constructing piezoelectric crystal microphones, touring the Grand Union Canal, building a laser "microphone" and creating a massive morse code chorus for BBC Radio 3.
He has also worked on theatre, dance and poetry projects, including commissions from the Handspring Puppet Company, and choreographers Wayne McGregor and Shobana Jeyasingh.
Burton is a prodigious instrument builder and uses a self-built light-controlled musical interface at his shows. He won the Qwartz Electronic Music Award for Innovation in 2015. In 2017, he was a recipient of an artists award from the Paul Hamlyn Foundation. |
https://en.wikipedia.org/wiki/IIC | IIC may refer to
Itahari International College, IT and Business college in Morang, Nepal.
Apple IIc, a personal computer introduced by Apple Computer in April 1984
Institute of Informatics and Communication, University of Delhi South Campus
I²C, Inter-Integrated Circuit, a serial computer bus
Impact insulation class, a method of determining how effective a floor structure is to footfall noise
Independent Inquiry Committee, a UN committee commissioned with investigating alleged corruption and fraud in the Oil-for-Food Programme
India International Centre, New Delhi, India
Industrial Internet Consortium, founded in 2014 to further development, adoption and widespread use of interconnected machines, intelligent analytics and people at work.
Instituto de Ingeniería del Conocimiento The Knowledge Engineering Institute (CII) is a Spanish research, development and innovation center located on the campus of Universidad Autonoma de Madrid (UAM)
International Institute for Conservation, the global membership organisation for conservation professionals
International Review of Intellectual Property and Competition Law, a publication in intellectual property law
Israeli Intelligence Community
Istituto Italiano di Cultura, an Italian Cultural Institute of the Italian Ministry of Foreign Affairs
See also
2C (disambiguation), including a list of topics named II-C, etc. |
https://en.wikipedia.org/wiki/Savepoint | A savepoint is a way of implementing subtransactions (also known as nested transactions) within a relational database management system by indicating a point within a transaction that can be "rolled back to" without affecting any work done in the transaction before the savepoint was created. Multiple savepoints can exist within a single transaction. Savepoints are useful for implementing complex error recovery in database applications. If an error occurs in the midst of a multiple-statement transaction, the application may be able to recover from the error (by rolling back to a savepoint) without needing to abort the entire transaction.
A savepoint can be declared by issuing a SAVEPOINT name statement. All changes made after a savepoint has been declared can be undone by issuing a ROLLBACK TO SAVEPOINT name command. Issuing RELEASE SAVEPOINT name will cause the named savepoint to be discarded, but will not otherwise affect anything. Issuing the commands ROLLBACK or COMMIT will also discard any savepoints created since the start of the main transaction.
Savepoints are defined in the SQL standard and are supported by all established SQL relational databases, including PostgreSQL, Oracle Database, Microsoft SQL Server, MySQL, IBM Db2, SQLite (since 3.6.8), Firebird, H2 Database Engine, and Informix (since version 11.50xC3).
Data management
Transaction processing |
https://en.wikipedia.org/wiki/TV1%20%28Malaysian%20TV%20network%29 | RTM TV1 (stylised as tv1) is a Malaysian free-to-air television channel owned and operated by Radio Televisyen Malaysia, a broadcasting department of the Malaysian Government. Launched on 28 December 1963, TV1 is the first and oldest TV station in Malaysia. The channel features mostly news, talk shows and documentaries and some in-house, local and international kids, drama and sports programming.
History
Setup
Speaking at his return from the Commonwealth Broadcasting Conference in New Delhi on 13 February 1960, Mr. A. T. Read said that television would soon come to Malaya, and that the existing network of microwave transmitters, with adequate modifications, would be used for television transmission. A 1963 target was set on 8 January 1962.
On 8 May 1962, Mohamad Sopiee announced that the first television station would be built in Kuala Lumpur, covering the states of Selangor and Negeri Sembilan. Initial projections aimed at the installation of 20,000 television sets, compared to 9,000 in Thailand and 4,000 in the Philippines. The radio and TV licences were going to be merged, as well as an allotment for a TV test survey and the arrival of two members of the Colombo Plan by the end of the year.
Early in 1963, television experts from Canada assisted in the building of the national television service, aiming to build the Kuala Lumpur station within a year. The plan was budgeted at $10 million. Programmes were scheduled to start in December a one-channel service (Singapore had two channels under Malaysian rule) covering a radius of 15 miles from the capital. The service was planned to cover all of Malaya by June 1964, with a plan for two channels like Singapore.
The British-owned Pye company had been given the contract to provide equipment to the then-upcoming television service in October 1963, namely a television transmitter and a film unit.
Single channel years
The prime minister of the time Tunku Abdul Rahman announced on 27 November 1963 that Televisyen Malaysia would start broadcasting on 28 December 1963. The station wasn't yet equiped with an outside broadcasting van, which was due to arrive in March 1964. Studio facilities were limited, and video recording facilities were due to start after the station would be on the air. Initially it broadcast from channel 10 in Kuala Lumpur before moving to channel 5 on 16 May 1964. The new transmitter was easily susceptible to ghosting.
The pilot service opened on the appointed date with Tunku delivering a speech in a 30-minute ceremony. A staff union was formed on 25 March 1964.
Broadcasts were extended to Ipoh and Malacca in April 1964 followed by Penang and Johor by July. For Johor, a sub-station at Bukit Treh, Muar was being built from April, costing $80,000. The plan was shelved within more than one month. In late April, work started for another relay station at Gunong Banang in Batu Pahat.
The pilot service upgraded to a regular service on 6 July 1964. At the start of the pilot service the |
https://en.wikipedia.org/wiki/Radio%20France | Radio France is the French national public radio broadcaster.
Stations
Radio France offers seven national networks:
France Inter — Radio France's "generalist" station, featuring entertaining and informative talk mixed with a wide variety of music, plus hourly news bulletins with extended news coverage in the morning, midday, and early-evening peaks
France Info — 24-hour news
France Culture — cultural programming covering the arts, history, science, philosophy, etc. together with in-depth news coverage at peak times
France Musique — classical music and jazz
France Bleu — a network of 44 regional stations, mixing popular music with locally based talk and information, including:
France Bleu 107.1 — for the Paris-Île-de-France region
France Bleu Béarn — Pyrénées-Atlantiques
France Bleu Nord — Nord and Pas de Calais
FIP — specialising in a wide range of music – classical, hip hop, jazz, chanson, rock, blues, world music – and minimal speech
Mouv' — urban music, aimed at a young audience
Mission
Radio France's two principal missions are:
To create and expand the programming on all of their stations; and
To assure the development and the management of the following four orchestras and choirs:
l'Orchestre National de France (National Orchestra of France)
l'Orchestre Philharmonique de Radio France (Radio France Philharmonic Orchestra)
Le Chœur de Radio France (Choir of Radio France)
La Maîtrise de Radio France (Choir School of Radio France with a choir of children and teenagers)
History
1897: A year after Marconi's experiments, Eugène Ducretet begins his trials of radio broadcasting from a mast on the third level of the Eiffel Tower
1921: The weather forecast and the stock market prices are read from a studio in the Eiffel Tower.
6 November 1922 (eight days before the BBC): Radiola, the first French private radio transmitter, begins regular broadcasts. It changes its name to Radio Paris in 1924. It is followed by Radio Toulouse and Radio Lyon, and in 1932/1933 by Radio Luxembourg. Before World War II, 14 commercial and 12 public sector radios operate in France.
1940–44: In both the German Occupied zone and under the Vichy regime in the south, radio is taken over by the State.
1942–43: With the agreement of Vichy, Radio Monte Carlo and its financial holding company la SOFIRAD are born.
1944: At the Liberation of France, the state broadcasting monopoly is retained for practical and ideological reasons. Public service radio broadcasting is ensured by the RDF, soon to be called the RTF, then the ORTF in 1964.
1955: The commercial station Europe No. 1 begins broadcasting from across the border in the Saarland region of Germany, freed from French occupation in that year.
1965: Under the management of Roland Dhordain, the four French radio stations are reorganised: France I and II are merged to "RTF Inter", later renamed "France Inter"; France III is renamed "RTF Promotion", and later "France Culture"; France IV is renamed "RTF Haute Fidelité" |
https://en.wikipedia.org/wiki/SpyBouncer | SpyBouncer is a rogue security software application developed by SRC Technologies for the Microsoft Windows operating system.
SpyBouncer has been listed by Spyware Warrior as a "rogue anti-spyware" program for its use of aggressive advertising and deliberate false positives. It is described by Symantec, the makers of Norton Antivirus, as "a program that may give exaggerated reports of threats on the compromised computer. It will then prompt the user to purchase a registered version of the software in order to remove the reported threats."
References
Adware |
https://en.wikipedia.org/wiki/RSA%20problem | In cryptography, the RSA problem summarizes the task of performing an RSA private-key operation given only the public key. The RSA algorithm raises a message to an exponent, modulo a composite number N whose factors are not known. Thus, the task can be neatly described as finding the eth roots of an arbitrary number, modulo N. For large RSA key sizes (in excess of 1024 bits), no efficient method for solving this problem is known; if an efficient method is ever developed, it would threaten the current or eventual security of RSA-based cryptosystems—both for public-key encryption and digital signatures.
More specifically, the RSA problem is to efficiently compute P given an RSA public key (N, e) and a ciphertext C ≡ P e (mod N). The structure of the RSA public key requires that N be a large semiprime (i.e., a product of two large prime numbers), that 2 < e < N, that e be coprime to φ(N), and that 0 ≤ C < N. C is chosen randomly within that range; to specify the problem with complete precision, one must also specify how N and e are generated, which will depend on the precise means of RSA random keypair generation in use.
The most efficient method known to solve the RSA problem is by first factoring the modulus N, a task believed to be impractical if N is sufficiently large (see integer factorization). The RSA key setup routine already turns the public exponent e, with this prime factorization, into the private exponent d, and so exactly the same algorithm allows anyone who factors N to obtain the private key. Any C can then be decrypted with the private key.
Just as there are no proofs that integer factorization is computationally difficult, there are also no proofs that the RSA problem is similarly difficult. By the above method, the RSA problem is at least as easy as factoring, but it might well be easier. Indeed, there is strong evidence pointing to this conclusion: that a method to break the RSA method cannot be converted necessarily into a method for factoring large semiprimes. This is perhaps easiest to see by the sheer overkill of the factoring approach: the RSA problem asks us to decrypt one arbitrary ciphertext, whereas the factoring method reveals the private key: thus decrypting all arbitrary ciphertexts, and it also allows one to perform arbitrary RSA private-key encryptions. Along these same lines, finding the decryption exponent d indeed is computationally equivalent to factoring N, even though the RSA problem does not ask for d.
In addition to the RSA problem, RSA also has a particular mathematical structure that can potentially be exploited without solving the RSA problem directly. To achieve the full strength of the RSA problem, an RSA-based cryptosystem must also use a padding scheme like OAEP, to protect against such structural problems in RSA.
See also
Strong RSA assumption
RSA Factoring Challenge
Rabin cryptosystem, whose equivalency to factoring is known
References
Further reading
Breaking RSA may be as difficult as |
https://en.wikipedia.org/wiki/Van%20Wijngaarden%20grammar | In computer science, a Van Wijngaarden grammar (also vW-grammar or W-grammar) is a formalism for defining formal languages. The name derives from the formalism invented by Adriaan van Wijngaarden
for the purpose of defining the ALGOL 68 programming language.
The resulting specification remains its most notable application.
Van Wijngaarden grammars address the problem that context-free grammars cannot express agreement or reference, where two different parts of the sentence must agree with each other in some way. For example, the sentence "The birds was eating" is not Standard English because it fails to agree on number. A context-free grammar would parse "The birds was eating" and "The birds were eating" and "The bird was eating" in the same way. However, context-free grammars have the benefit of simplicity whereas van Wijngaarden grammars are considered highly complex.
Two levels
W-grammars are two-level grammars: they are defined by a pair of grammars, that operate on different levels:
the hypergrammar is an attribute grammar, i.e. a set of context-free grammar rules in which the nonterminals may have attributes; and
the metagrammar is a context-free grammar defining possible values for these attributes.
The set of strings generated by a W-grammar is defined by a two-stage process:
within each hyperrule, for each attribute that occurs in it, pick a value for it generated by the metagrammar; the result is a normal context-free grammar rule; do this in every possible way;
use the resulting (possibly infinite) context-free grammar to generate strings in the normal way.
The consistent substitution used in the first step is the same as substitution in predicate logic, and actually supports logic programming; it corresponds to unification in Prolog, as noted by Alain Colmerauer.
W-grammars are Turing complete;
hence, all decision problems regarding the languages they generate, such as
whether a W-grammar generates a given string
whether a W-grammar generates no strings at all
are undecidable.
Curtailed variants, known as affix grammars, were developed, and applied in compiler construction and to the description of natural languages.
Definite logic programs, that is, logic programs that make no use of negation, can be viewed as a subclass of W-grammars.
Motivation and history
In the 1950s, attempts started to apply computers to the recognition, interpretation and translation of natural languages, such as English and Russian. This requires a machine-readable description of the phrase structure of sentences, that can be used to parse and interpret them, and to generate them. Context-free grammars, a concept from structural linguistics, were adopted for this purpose; their rules can express how sentences are recursively built out of parts of speech, such as noun phrases and verb phrases, and ultimately, words, such as nouns, verbs, and pronouns.
This work influenced the design and implementation of programming languages, most notably, o |
https://en.wikipedia.org/wiki/PL/pgSQL | PL/pgSQL (Procedural Language/PostgreSQL) is a procedural programming language supported by the PostgreSQL ORDBMS. It closely resembles Oracle's PL/SQL language. Implemented by Jan Wieck, PL/pgSQL first appeared with PostgreSQL 6.4, released on October 30, 1998. Version 9 also implements some ISO SQL/PSM features, like overloading of SQL-invoked functions and procedures.
PL/pgSQL, as a fully featured programming language, allows much more procedural control than SQL, including the ability to use loops and other control structures. SQL statements and triggers can call functions created in the PL/pgSQL language.
The design of PL/pgSQL aimed to allow PostgreSQL users to perform more complex operations and computations than SQL, while providing ease of use. The language is able to be defined as trusted by the server.
PL/pgSQL is one of the programming languages included in the standard PostgreSQL distribution, the others being PL/Tcl, PL/Perl and PL/Python. In addition, many others are available from third parties, including PL/Java, PL/pgPSM, PL/php, PL/R, PL/Ruby,
PL/sh,
PL/Lua and PL/v8. PostgreSQL uses Bison as its parser,
making it easy to port many open-source languages, as well as to reuse code.
Comparing with PSM
The SQL/PSM language is specified by an ISO standard, but is also inspired by Oracle's PL/SQL and PL/pgPL/SQL, so there are few differences. The PL/pgPSM contributed module implements the standard. The main features of PSM that differ from PL/pgSQL:
Exception handlers are subroutines (continue handlers);
Warnings can be handled like an exception;
Declaration of variables should be based on SQL query result.
All three languages (Oracle PL/SQL, PostgreSQL PL/pgSQL and ISO SQL/PSM) are originally descended from the Ada programming language.
Example
CREATE FUNCTION sales_tax(subtotal real) RETURNS real AS $$
BEGIN
RETURN subtotal * 0.06;
END;
$$ LANGUAGE plpgsql;
Inline documentation external support
Formal pseudo-language for documentation can be embedded in SQL and PL/pgSQL scripts. This documentation is then processed by a documentation generator—an external tool which extracts data and generates hypertext. Since PL/SQL: supports some of these tools, PL/pgSQL is expected to provide full or partial support as well.
Other documentation tools: Doxygen, DBScribe, HyperSQL, Universal Report.
References
External links
Official PL/pgSQL documentation
PL/pgSQL (en), tutorial and examples
SQL
PostgreSQL
Data-centric programming languages |
https://en.wikipedia.org/wiki/Some%20Enchanted%20Evening%20%28The%20Simpsons%29 | "Some Enchanted Evening" is the thirteenth and final episode of the first season of the American animated television series The Simpsons. It was originally broadcast on the Fox network in the United States on May 13, 1990. Written by Matt Groening and Sam Simon and directed by David Silverman and Kent Butterworth, "Some Enchanted Evening" was the first episode produced for season one and was intended to air as the series premiere in fall 1989, but aired as the season one finale due to animation problems. The Christmas special "Simpsons Roasting on an Open Fire" premiered in its place on December 17, 1989. It is the last episode to feature the original opening sequence starting from "Bart the Genius". In the episode, Homer and Marge go on a night out while leaving the children under the care of a diabolical babysitter named Ms. Lucille "Botz" Botzcowski.
Penny Marshall provided the voice of Ms. Botz. The episode features cultural references to such films as The Night of the Hunter and Psycho as well as a musical reference to A Star Is Born.
Since its initial broadcast, the episode has received mixed reviews. It acquired a Nielsen rating of 15.4 and was the highest-rated show on the Fox network the week it aired.
Plot
Marge is depressed that Homer takes her for granted, and phones Dr. Marvin Monroe's call-in therapy radio slot. Listening to the call at work, Homer feels bad when Marge reveals his name on the radio. After work, he visits Moe's Tavern, where Moe advises him to give Marge a rose and a box of chocolates. Marge's mood softens and Homer invites her to go dancing, dine at a fancy restaurant, and spend the night at a motel.
Marge and Homer hire Ms. Botz through a babysitting service to watch the kids. Botz puts Maggie to bed while Bart and Lisa watch The Happy Little Elves. While watching America's Most Armed and Dangerous on television, Bart and Lisa scream in horror when they realize that Botz is a wanted burglar, dubbed the 'Babysitter Bandit'. Realizing her cover is blown, they flee but fail to escape or call for help. Botz ties up the kids and packs the family's possessions into her suitcases. Maggie wakes up, goes downstairs and finds Bart and Lisa; they try to get her attention, but she focuses on the happy little elves. As the video ends, Maggie attempts to watch it again, and Lisa tells her she can if she unties her and Bart. While Ms. Botz is still cleaning up, she sees that Maggie is out of her crib. Bart lures Ms. Botz into Bart's room, and knocks Ms. Botz out with a baseball bat.
Realizing Botz cut the telephone line, the kids go to a local phone booth and call the producers of America's Most Armed and Dangerous. When Marge and Homer are unable to reach Ms. Botz by phone, they return home early to find her bound and gagged. Unaware she is a wanted criminal, Homer and Marge free her and pay her handsomely. She flees just as the kids arrive with the police and news reporters. Homer, thinking this is one of their naughty tri |
https://en.wikipedia.org/wiki/Amalgamated%20Broadcasting%20System | The Amalgamated Broadcasting System (ABS) was an ambitious, although unsuccessful, attempt to establish a national "third radio network" in the United States. Its primary promoters were the company's president, American comedian Ed Wynn, and its vice-president, Hungarian-born violinist Ota Gygi. The network's inaugural broadcast on September 25, 1933, was carried by a small group of stations located in the Northeast. Despite plans to eventually expand nationwide, the network never grew beyond its original group of affiliates, and ceased operations at midnight November 1, 1933, just five weeks after its debut. Its failure resulted in a major financial loss, plus significant emotional distress, for Wynn.
Formation
In the early 1930s, network radio in the United States was dominated by two major companies: the National Broadcasting Company (NBC), formed in 1926, which operated two national networks, known as the NBC-Red and the NBC-Blue, plus the Columbia Broadcasting System (CBS), established in 1927. These two companies had subsequently signed affiliation agreements with almost all of the country's major radio stations, leaving limited program options for a few hundred remaining medium and small stations. This imbalance led to ongoing efforts to create a "third radio network", to help the left-out stations compete with the NBC and CBS programs.
The idea to form ABS originated with Ota Gygi, who then enlisted Wynn, who, as the "Fire Chief" on the original Fire Chief Program on NBC, was one of the country's best-known performers. Despite his professional and financial success, Wynn was concerned about his future and the power the established networks had over the programming policies of their local affiliate stations. It was his hope that ABS would provide a programming alternative, and would also insure a more stable financial future for himself and his family, explaining that "acting is such an uncertain profession, and I want to establish a business for my actor son, Keenan, which will be sane and secure and bring in plenty of profits".
Formation of the Amalgamated Broadcasting System, Inc. was announced in October 1932, although at the time it was described as being a production company. Ed Wynn was the president and "famed producer" Arthur Hopkins was director of productions, with Ota Gygi and T. W. Richardson described as assistants. Irving Berlin and Daniel Frohman were rumored to be planning to join the effort, and the new company, which it was reported "has Radio Row atwitter", was said to have already signed $1,000,000 of business contracts.
Plans for ABS gained support in January 1933 from George W. Trendle, president of the recently founded Michigan Regional Network, who stated his stations would join Amalgamated once it expanded westward. Efforts were made to attract major investors, and there were rumors that additional funding would be coming from "Detroit millionaires", but the network would actually be primarily financed by Ed |
https://en.wikipedia.org/wiki/Joshua%20Schachter | Joshua Schachter (; born January 1, 1974) is an American entrepreneur and the creator of Delicious, creator of GeoURL, and co-creator of Memepool. He holds a B.S. in electrical and computer engineering at Carnegie Mellon University in Pittsburgh.
Schachter released his first version of Delicious (then called del.icio.us) in September 2003. The service coined the term social bookmarking and featured tagging, a system he developed for organizing links suggested to Memepool and publishing some of them on his personal linkblog, Muxway. On March 29, 2005, Schachter announced he would work full-time on Delicious. On December 9, 2005, Yahoo! acquired Delicious for an undisclosed sum. According to Business 2.0, the acquisition was close to $30 million, with Schachter's share being worth approximately $15 million.
Prior to working full-time on Delicious, Schachter was an analyst in Morgan Stanley's Equity Trading Lab. He created GeoURL in 2002 and ran it until 2004. In 2006, he was named to the MIT Technology Review TR35 as one of the top 35 innovators in the world under the age of 35. In June 2008 Schachter announced his decision to leave Yahoo!. TechCrunch reported that the recent news coming out of Yahoo! about mass resignations of senior staff pressed his decision to leave. He worked for Google from January 2009 to June 2010.
References
External links
Interview with Joshua about del.icio.us
Businessweek article on tagging
1974 births
Living people
People from Long Island
Carnegie Mellon University College of Engineering alumni
20th-century American Jews
People in information technology
21st-century American Jews |
https://en.wikipedia.org/wiki/Milan%20Metro | The Milan Metro () is the rapid transit system serving Milan, Italy, operated by Azienda Trasporti Milanesi. The network consists of 5 lines, identified by different numbers and colours, with a total network length of , and a total of 113 stations, mostly underground.
It has a daily ridership of about 1.4 million on weekdays.
The Milan Metro is the largest system in Italy for length, number of stations and ridership; and the seventh longest in the European Union.
The first line, Line 1, opened in 1964; Line 2 opened 5 years later in 1969, Line 3 in 1990, Line 5 in 2013, and Line 4 in 2022.
There are also several extensions planned and under construction.
History
The first projects for a subway line in Milan were drawn up in 1914 and 1925, following the examples of underground transport networks in other European cities such as London and Paris. Planning proceeded in 1938 for the construction of a system of 7 lines, but this too halted after the start of World War II and due to lack of funds.
On 3 July 1952, the city administration voted for a project of a metro system and on 6 October 1955, a new company, Metropolitana Milanese, was created to manage the construction of the new infrastructure. The project was funded with ₤ 500 million from the municipality and the rest from a loan. The construction site of the first line was opened in viale Monte Rosa on 4 May 1957. Stations on the new line were designed by Franco Albini and Franca Helg architecture studio, while Bob Noorda designed the signage. For this project both Albini-Helg and Noorda won the Compasso D'Oro prize.
The first section from Lotto to Sesto Marelli (21 stations) was opened on 1 November 1964 after 7 years of construction works. Two trains adorned with Italian flags left at 10.41 a.m. and arrived at the Sesto Marelli terminus at 11.15 a.m., greeted by the notes of the national anthem and the triumphal march of Giuseppe Verdi's opera "Aida". The track was long, and the mean distance between the stations was . In the same year, in April, works on the second line started.
Passengers on the network grew constantly through the first years of service, passing from 37,092,315 in 1965 to 61,937,192 in 1969.
The green line from Caiazzo to Cascina Gobba (7 stations) opened five years later. During the 1960s and 1970s the network of 2 lines was completed, and both lines had 2 different spurs. In 1978, the lines were already and long respectively, with 28 and 22 stations.
The first section of the third line (yellow), with 5 stations, was opened on 3 May 1990 after almost 9 years of construction works. The line opened just before the World Cup. The other 9 stations on Line 3 opened to the southeast in 1991, and northwest to Maciachini Station in 2004.
In March 2005, the Line 2 Abbiategrasso station (south branch from Famagosta) and the Line 1 Rho Fiera station opened. The intermediate station of Pero opened in December 2005. A north extension of Line 3 to Comasina (4 stations) and |
https://en.wikipedia.org/wiki/Bart%20Gets%20an%20%22F%22 | "Bart Gets an 'F" is the first episode of the second season of the American animated television series The Simpsons. It aired originally on the Fox network in the United States on October 11, 1990. In this episode, Bart Simpson fails four consecutive history exams, and the district psychiatrist recommends he repeat the fourth grade.
Written by David M. Stern and directed by David Silverman, "Bart Gets an 'F marks the first appearance of Mayor Quimby as well as a new opening sequence. It was the third episode produced for the second season. It was chosen to be the season premiere because it prominently features Bart, who enjoyed popularity during the early 1990s.
Due to the success of the first season of The Simpsons, Fox decided to switch the show's time slot to Thursday at 8:00 p.m. ET where it aired opposite NBC's The Cosby Show, the number one show at the time. Throughout the summer, several news outlets published stories about the supposed "Bill vs. Bart" rivalry and heavily hyped the first episode of the second season. Some critics predicted "Bart gets an 'F would do considerably worse in the ratings than The Cosby Show. However, the episode's final Nielsen rating was 18.4, and a 29% share of the audience placed it second in its time slot behind The Cosby Show with an 18.5 rating and 29% share. The episode finished eighth in the weekly ratings, but was watched by an estimated 33.6 million viewers, making it the week's number one show, in terms of actual viewers. It became the highest rated and most watched program in the history of the Fox network and remained so until 1995. It remains the highest rated episode in the history of The Simpsons.
"Bart Gets an 'F received positive reviews from television critics. Entertainment Weekly ranked it 31st on its 1999 list of "The 100 Greatest Moments in Television".
Plot
At Springfield Elementary School, Bart presents a book report on Treasure Island, but it soon becomes obvious that he has not actually read the book as he tries to remember who the pirate in the book was as he tries to think if it was either Blackbeard, Captain Nemo, Captain Hook, or Long John Silver. When Bart incorrectly guesses Bluebeard, Mrs. Krabappel tells him to sit down and that she'd like to see him after class.
While writing “I will not fake my way through life” on the wall 100 times, Bart is warned by Mrs. Krabappel that there will be an upcoming exam on Colonial America. At school the next day, Bart feigns illness to avoid taking another test. After grilling Milhouse for the test answers, he scores even worse than he did when Mrs. Krabappel gives Bart a different set of test questions.
Homer and Marge meet with the school psychiatrist, Dr. J. Loren Pryor who recommends that Bart repeat the fourth grade. Marge and Homer support this idea, but Bart vows to improve his grades to avoid it.
In desperation, Bart asks Martin to tutor and help him get passing grades, promising to improve Martin's popularity in return. When |
https://en.wikipedia.org/wiki/Seventh%20Edition | Seventh Edition may refer to:
7th Edition (Magic: The Gathering), playing cards
Version 7 Unix, operating system |
https://en.wikipedia.org/wiki/UNIX/32V | UNIX/32V is an early version of the Unix operating system from Bell Laboratories, released in June 1979. 32V was a direct port of the Seventh Edition Unix to the DEC VAX architecture.
Overview
Before 32V, Unix had primarily run on DEC PDP-11 computers. The Bell Labs group that developed the operating system was dissatisfied with DEC, so its members refused DEC's offer to buy a VAX when the machine was announced in 1977. They had already begun a Unix port to the Interdata 8/32 instead. DEC then approached a different Bell Labs group in Holmdel, New Jersey, which accepted the offer and started work on what was to become 32V.
Performed by Tom London and John F. Reiser, porting Unix was made possible due to work done between the Sixth and Seventh Editions of the operating system to decouple it from its "native" PDP-11 environment. The 32V team first ported the C compiler (Johnson's pcc), adapting an assembler and loader written for the Interdata 8/32 version of Unix to the VAX. They then ported the April 15, 1978 version of Unix, finding in the process that "[t]he (Bourne) shell [...] required by far the largest conversion effort of any supposedly portable program, for the simple reason that it is not portable."
UNIX/32V was released without virtual memory paging, retaining only the swapping architecture of Seventh Edition. A virtual memory system was added at Berkeley by Bill Joy and Özalp Babaoğlu in order to support Franz Lisp; this was released to other Unix licensees as the Third Berkeley Software Distribution (3BSD) in 1979. Thanks to the popularity of the two systems' successors, 4BSD and UNIX System V, UNIX/32V is an antecedent of nearly all modern Unix systems.
See also
Ancient UNIX
References
Further reading
Marshall Kirk McKusick and George V. Neville-Neil, The Design and Implementation of the FreeBSD Operating System (Boston: Addison-Wesley, 2004), , pp. 4–6.
External links
The Unix Heritage Society, (TUHS) a website dedicated to the preservation and maintenance of historical UNIX systems
Complete distribution of 32V with source code
Source code of the 32V kernel
Installation instructions and download for SimH
A MS Windows program that installs the SIMH emulator and a UNIX/32V image.
Information about running UNIX/32V in SIMH
Bell Labs Unices
Discontinued operating systems
1979 software |
https://en.wikipedia.org/wiki/Simpson%20and%20Delilah | "Simpson and Delilah" is the second episode of the second season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on October 18, 1990. In the episode, Homer uses the Springfield Nuclear Power Plant's medical insurance plan to buy Dimoxinil (a parody of Minoxidil), a miracle hair growth formula. When Homer's bald head sprouts a full mane of hair, he is promoted at work and hires a secretary named Karl. The episode was written by Jon Vitti and directed by Rich Moore, and guest starred Harvey Fierstein as Karl.
Plot
Homer uses Springfield Nuclear Power Plant's medical insurance plan to pay for a hair restoring drug worth $1,000. After applying the drug, he wakes up the next day with a full head of hair. Mr. Burns scans the security monitors to find someone to promote to the "token" position of junior executive. Mistaking Homer for a young, unspoiled go-getter, Mr. Burns promotes him.
When Homer has trouble finding a secretary who is not a seductive young woman, a man named Karl persuades Homer to hire him. Karl soon proves indispensable to Homer. When he forgets his own wedding anniversary, Karl hires a singing telegram service to serenade Marge with "You Are So Beautiful".
At an executive board meeting, Homer comes up with a way to increase worker productivity. After this, workplace safety improves and accidents decrease, which Smithers observes is because of Homer being the cause of prior accidents. Homer spends his paycheck on home improvements and plans to give the kids what they always wanted, and when Marge is concerned he should save for a rainy day, Homer dismisses it that the good times are here to stay.
After Homer receives the key to the executive washroom, Smithers is angry that he is now in Burns's good graces while Smithers's loyal service is forgotten. Smithers attempts to get Homer fired for committing insurance fraud, but Karl takes the blame and is fired instead. Homer is nervous about giving a speech at the plant, and discovers Bart has lost the contents of the miracle hair drug.
The next day, Homer loses all his hair, as he had to keep putting the drug on his head. Before the meeting, Karl appears with a prepared speech for Homer and reassures him that all his accomplishments were due to his will and effort, not the hair. Homer gives his speech, but the audience refuses to take him seriously because he has no hair and walks out on him. Burns gives Homer his old job back, sympathizing with him having male pattern baldness like Burns does.
At home that night, Marge insists that Homer's old "dead end" job as a safety inspector has always provided for the family and the kids will get over having less than their friends. When Homer is worried about his baldness making him ugly to Marge, she sings to him "You Are So Beautiful".
Production
Homer's hair product Dimoxinil is a spoof on a similar product, Minoxidil, which fascinated the writers. The production staf |
https://en.wikipedia.org/wiki/Constantin%20Sotiropoulos | Constantin Sotiropoulos is the co-creator (with François Lionet) of AMOS BASIC, a popular video game and multimedia programming language for the Amiga computer, and STOS BASIC on the Atari ST.
He has also been creator of copy protection software for some French companies.
References
French computer programmers
Living people
Year of birth missing (living people)
Place of birth missing (living people) |
https://en.wikipedia.org/wiki/K240 | K240 is a real-time strategy video game published by Gremlin Graphics and released for the Amiga home computer in 1994. It is a sequel to the 1991 game Utopia: The Creation of a Nation.
Plot
Based in a sector of deep space called K240 in the year 2380, the game involves building space colonies on a cluster of asteroids and mining them for valuable ore, while fighting against several different races of hostile aliens with similar motives.
Reception
The game achieved a review score of 91% in CU Amiga.
Legacy
K240 was succeeded by Fragile Allegiance, which is a PC remake of the game with improved graphics and user interface. Many of the buildings, ships, missiles, and game concepts are the same. However, the Human Empire is dissolved in a coup, and united with several alien races in a multiracial Federation. There are also gameplay differences resulting from ships being given limited range as well as espionage.
References
External links
K240 at Lemon Amiga
K240 at Amiga Hall of Light
K240 fan page
1994 video games
Amiga games
Amiga-only games
Real-time strategy video games
Science fiction video games
Video games with isometric graphics
Gremlin Interactive games
Fiction about asteroid mining
Video games scored by Patrick Phelan
Video games set in the 24th century
Video games developed in the United Kingdom |
https://en.wikipedia.org/wiki/WindowBlinds | WindowBlinds is a computer program that allows users to skin the Windows graphical user interface. It has been developed by Stardock since 1998, and is the most popular component of their flagship software suite, Object Desktop. It is also available separately, and as an ActiveX/COM component called DirectSkin. Introduced in its sixth version, it supports alpha blending effects similar to the compositing of Windows Vista, but on Windows XP.
WindowBlinds has been downloaded over 10 million times WindowBlinds 7.0 at PCWorld.pl and was voted "Best Vertical Market Program or Utility" in the 2006 Shareware Industry Awards Foundation People's Choice Awards. As of November 2009 there were 4448 WindowBlinds skins available at WinCustomize, with an average of nine being added per week; another popular repository is deviantART.
Skin formats
WindowBlinds skins come in two formats: "Basic" (or "UIS1+") and "Advanced" (or "UIS2").
Basic (UIS1+)
Despite its name, the "Basic" skin format can be used to create fully featured skins, and it is still used today. The main limitation is that skin borders may only be "standard" sizes (four pixels wide for most of the side borders). This restriction was significantly relaxed when skin metrics—adjustments to using the standard Windows methods—were introduced, allowing changes to (among other things) the standard height of the titlebar. It is also only possible to put buttons on the titlebar, and scripting and titlebar background animation are not supported.
The advantages of UIS1+ are performance (Stardock has claimed that a UIS1+ version of the Windows XP "Luna" visual style is twice as fast as the original in repaint and resizing) and compatibility. Most msstyles can be converted to a UIS1+ skin.
Advanced (UIS2)
The Advanced skin format is provided for when a skin design cannot fit into the above restrictions. Typically these skins may have wider borders in some places, or none at all. They may also feature titlebar background animation, or the use of scripting features.
This format offers maximum flexibility at the cost of slightly reduced performance (as compared to UIS1+), and potentially more chance of incompatibility with applications. Some UIS2 skins include a UIS1+ subskin; if problems occur, this subskin may be substituted as a "per-app" skin.
History
WindowBlinds started in 1998 when lead developer Neil Banfield teamed up with Stardock. Stardock was looking for a developer to create a window skinning application, and Banfield had already created an application that he called "Window Blinds" in 1997. Previous attempts by Stardock had included "Object Look", a minimal skinning application, and "WindowFX", an application written in Delphi. That name would later be reused for WindowFX, also created by Banfield. For a short time there was also a scaled-back version of the original Window Blinds called "WBLiteFX", a name which was still present in WindowBlinds registry settings as of May 2006.
WindowBlinds |
https://en.wikipedia.org/wiki/Ching%20Hai | Ching Hai (born Trịnh Đăng Huệ; 12 May 1950), referred to by followers as Supreme Master or Suma Ching Hai, is a Vietnamese-born British spiritual leader of the Guanyin Famen transnational cybersect, which she founded in the 1980s. Based out of Taiwan, she is estimated to have 2 million followers worldwide.
Ching also founded the Loving Hut vegan restaurant chain and vegan Celestial Shop fashion company under her company, the Supreme Master Ching Hai International Association.
Life and career
Ching Hai was born to a Vietnamese mother and an ethnic Chinese father, on 12 May 1950 in a small village in the Quảng Ngãi Province in Vietnam. According to her official biography, Ching was born to a well-off naturopathic family in Âu Lạc, Hanoi, Vietnam. She states that she was raised as a Roman Catholic but learned the basics of Buddhism from her grandmother.
At the age of 18, she moved to England to study, and later to France and then Germany, where she worked for the Red Cross. In 1969, she began a relationship with a German scientist. They married, but divorced after two years, as Ching had wanted to focus on spiritualism. She thereafter moved to India to study religion.
Ching states that she practised surat shabd yoga and attended different ashrams in India, before receiving a spiritural breakthrough from a Himalayan master named Khuda Ji, who showed her the Quan Yin method. Her unwillingness to reveal more about her master has been described as "unusual among Oriental religious teachers". Some academics, including Christopher Partridge and David C. Lane, argue that Ching was initiated by Thakar Singh, a Ruhani Satsang Sant Mat master, but denied her association either to remain eligible for Buddhist ordination or to avoid controversy as a result of Singh's sexuality.
In 1979, she met a Buddhist monk in Germany, whom she followed for three years, despite his monastery denying entry to women. At one point, Ching attempted to buy a copy of the Bhagavad Gita from a bookshop near the Ganges. Despite the shopkeepers' assertions that they did not have a copy, an extensive search revealed one in a sealed box. This led to rumours of her having a third eye circulating by 1982. In 1983, she met a Vietnamese Buddhist monk in Taiwan named Jing-Xing, who ordained her in 1984 as "Thanh Hai", meaning "pure ocean".
According to Ting Jen-Chieh, assistant research fellow at the Academia Sinica, by the early 1990s, Ching was at odds with the Buddhist establishment in Taiwan. Ching would later sever all connections to Buddhist organisations, abandoning Buddhist dress codes and setting out to create her own independent group.
Some of her meditation centres in America have tax-exempt status as religious organisations. She also presides over an organisation which owns restaurants and sells her jewellery and clothes.
In 2003, park rangers discovered a man-made island and boardwalk that had been illegally constructed in Biscayne National Park in Florida, near Ching |
https://en.wikipedia.org/wiki/KYW-TV | KYW-TV (channel 3) is a television station in Philadelphia, Pennsylvania, United States, serving as the market's CBS outlet. It is owned and operated by the network's CBS News and Stations division alongside independent station WPSG (channel 57). Both stations share studios on Hamilton Street north of Center City, Philadelphia, while KYW-TV's transmitter is located in the city's Roxborough section.
KYW-TV, along with sister station KDKA-TV in Pittsburgh, are the only CBS-affiliated stations east of the Mississippi River with "K" call signs.
History
As W3XE (1932–1941)
The channel 3 facility in Philadelphia is Pennsylvania's oldest television station. It began in 1932 as W3XE, an experimental station owned by Philadelphia's Philco Corporation, at the time and for some decades to come one of the world's largest manufacturers of radio and television sets. Philco engineers created much of the station's equipment, including cameras. When the station began operations as W3XE, it was based within Philco's production plant, at C and East Tioga streets in North Philadelphia, complete with a small studio and transmitter. In 1941, it began sharing programs with W2XBS (later WNBT and now WNBC) in New York City, becoming NBC's second television affiliate, and creating a link between the station and the network that would last for 54 years.
As WPTZ (1941–1955)
On July 1, 1941, W3XE received a commercial license—the third in the United States, the first outside of New York City, and the first not owned and operated by a network—as WPTZ. The station signed on for the first time on September 1, becoming the first licensed television station in Pennsylvania. Philco then moved WPTZ's studios to the penthouse suite of the Architect's Building, at 17th and Sansom streets in downtown Philadelphia, while retaining master control facilities at the Philco plant. The station originally broadcast from a tower in the Philadelphia suburb of Wyndmoor. It significantly cut back operations after the U.S. entered World War II, but returned to a full schedule in 1945. Channel 3 relocated its entire operation to the Wyndmoor transmitter facility during World War II, when the station aired little programming. It then became one of three stations (along with WNBT and Schenectady, New York's WRGB, now a fellow CBS affiliate) that premiered NBC's regular television service in 1946, although all three stations did share occasional programs just before and during the war. When full broadcasting was resumed, the station reactivated its studio in the Architect's Building, remaining there until 1947. WPTZ then moved into unused space at 1619 Walnut Street in Center City, where KYW radio was housed. What is now KYW-TV has been based in Center City ever since.
The Westinghouse Electric Corporation, owner of Philadelphia's longtime NBC Radio affiliate KYW, purchased WPTZ in 1953 for a then-record price of $8.5 million. The WPTZ call letters are now used for the NBC affiliate in Plattsbu |
https://en.wikipedia.org/wiki/WCAU | WCAU (channel 10) is a television station in Philadelphia, Pennsylvania, United States, serving as the market's NBC outlet. It is owned and operated by the network's NBC Owned Television Stations division alongside Mount Laurel, New Jersey–licensed Telemundo outlet WWSI (channel 62); it is also sister to regional sports network NBC Sports Philadelphia.
WCAU and WWSI share studios in the Comcast Technology Center on Arch Street in Center City, with some operations remaining at their former main studio at the corner of City Avenue and Monument Road in Bala Cynwyd. Through a channel sharing agreement, the two stations transmit using WCAU's spectrum from a tower in the Roxborough section of Philadelphia.
History
As a CBS station (1946–1995)
In 1946, the Philadelphia Evening Bulletin secured a construction permit for channel 10, naming its proposed station WPEN-TV after the newspaper's WPEN radio stations (950 AM, now WKDN, and 98.1 FM, later WCAU-FM and now WOGL). The picture changed dramatically in 1947, when The Philadelphia Record folded. The Bulletin inherited the Records "goodwill", along with the rights to buy the radio station WCAU (1210 AM, now WPHT) and the original WCAU-FM (102.9 FM, now WMGK) from their longtime owners, brothers Isaac and Leon Levy. The Bulletin sold the less-powerful WPEN and WCAU-FM, with the latter being renamed WPEN-FM (it is now WMGK). The Bulletin kept its FM station, renaming it WCAU-FM to match its new AM sister. The newspaper also kept its construction permit for channel 10, renaming it WCAU-TV.
WCAU-TV went on the air March 1, 1948, as Philadelphia's third television station with an initial test pattern on Channel 10. It carried its first CBS network show on a "sneak preview" basis on March 3, but the official opening of the station was not until May 23, 1948. It secured an affiliation with CBS through the influence of the Levy brothers, who continued to work for the newspaper as consultants. WCAU radio had been one of CBS' original 16 affiliates when the network launched in 1927. A year later, the Levy brothers persuaded their brother-in-law, William S. Paley, to buy the struggling network. The Levy brothers were shareholders and directors at CBS for many years. Due to this long relationship, channel 10 signed on as CBS's third television affiliate.
In the late 1950s, the Federal Communications Commission (FCC) collapsed northern Delaware, southern New Jersey and the Lehigh Valley into the Philadelphia market. The Bulletin realized that channel 10's original tower, atop the PSFS Building in Center City, was not nearly strong enough to serve this larger viewing area. In 1957, WCAU-TV moved to a new tower in Roxborough, which added most of Delaware, the Jersey Shore and the Lehigh Valley to its city-grade coverage.
Also in 1957, the Bulletin formed a limited partnership with the Megargee family, owner of CBS affiliate WGBI-TV (channel 22) in Scranton. As part of the deal, channel 22's call letters were ch |
https://en.wikipedia.org/wiki/WPVI-TV | WPVI-TV (channel 6), branded on-air as 6 ABC, is a television station in Philadelphia, Pennsylvania, United States, serving as the market's ABC outlet. Owned and operated by the network's ABC Owned Television Stations division, the station maintains studios on City Avenue in the Wynnefield Heights section of Philadelphia, and a transmitter in the city's Roxborough neighborhood.
History
WFIL-TV
The station first signed on the air on September 13, 1947, as WFIL-TV. It is Philadelphia's second-oldest television station, signing on six years after WPTZ (now KYW-TV). The first program broadcast on channel 6 was a live remote of an exhibition game of the Philadelphia Eagles against the Chicago Bears from Franklin Field. This was followed by an inaugural program that evening.
WFIL-TV was originally owned by Walter Annenberg's Triangle Publications, publishers of The Philadelphia Inquirer and owners of WFIL radio (560 AM, and 102.1 FM). The WFIL stations were the flagship of the communications empire of Triangle Publications, which owned two Philadelphia newspapers (the morning Inquirer and, later, the evening Daily News), periodicals including TV Guide, Seventeen and the Daily Racing Form, and a broadcasting group that would grow to ten radio and six television stations. WFIL radio had been an ABC radio affiliate dating back to the network's existence as the NBC Blue Network. However, WFIL-TV started out carrying programming from the DuMont Television Network, as ABC had not yet ventured into broadcast television. When the ABC television network debuted on April 19, 1948, WFIL-TV became its first affiliate. Channel 6 joined ABC before the network's first owned-and-operated station, WJZ-TV in New York City (now WABC-TV), signed on in August that year. However, it retained a secondary affiliation with DuMont until that network shut down in 1956.
The WFIL radio stations originally broadcast from the Widener Building in downtown Philadelphia. With the anticipated arrival of WFIL-TV, Triangle secured a new facility for the stations, located at Market and 46th streets, which opened in 1947. In 1963, Triangle built one of the most advanced broadcast centers in the nation on City (or City Line) Avenue in the Wynnefield Heights community, in a circular building across from rival WCAU-TV (channel 10). The station still broadcasts from the facility today, even as a new digital media building was constructed that now houses production of the station's newscasts and other local programs, while the original studio was turned over to public broadcaster WHYY-FM-TV.
Channel 6 was the first station to sign on from the Roxborough neighborhood. It started transmitting from a tower, but in 1957, it moved to a new tower, which it co-owned with NBC-owned WRCV-TV (channel 3, now CBS owned-and-operated station KYW-TV). The new tower added much of Delaware and the Lehigh Valley to the station's city-grade coverage. WFIL-TV was also one of the first TV stations in Philadel |
https://en.wikipedia.org/wiki/WTXF-TV | WTXF-TV (channel 29) is a television station in Philadelphia, Pennsylvania, United States, serving as the market's Fox network outlet. Owned and operated by the Fox Television Stations division, the station maintains studios on Market Street in Center City and a transmitter on the Roxborough tower farm.
Channel 29 is the longest continuously operated Philadelphia UHF station, since May 16, 1965, as WIBF-TV from studios in the suburb of Jenkintown. WIBF-TV was owned by the Fox family alongside WIBF-FM 103.9. It was the first of three new commercial UHF outlets that year, broadcasting as an independent station focusing on community and sports programming. Taft Broadcasting purchased channel 29 in 1969 and renamed it WTAF-TV. Under Taft, the station slowly emerged as the leading independent station in the Philadelphia market with popular sports coverage, movies, and syndicated programs. The station was the broadcast outlet for the Philadelphia Flyers hockey team between 1971 and 1985 and for the Philadelphia Phillies baseball team from 1983 to 1992. The latter deal came after Taft Broadcasting purchased 47 percent of the team. In early 1986, WTAF-TV began producing a 10 p.m. local newscast.
Ownership of channel 29 shifted to TVX Broadcast Group in 1987 as part of its purchase of Taft's five large-market independent stations; the call sign was changed to WTXF-TV the next year. The deal left TVX highly leveraged and ultimately led to the station's sale in two parts between 1989 and 1991 to Paramount Pictures. Paramount nearly lost the station's Fox affiliation when Fox tried to buy another Philadelphia station in 1993. That purchase fell through, and Fox ultimately purchased WTXF-TV itself in a deal approved in 1995. Fox expanded the news department, first with a morning show—Good Day Philadelphia—and later with additional early evening and other newscasts.
History
In November 1952, the first construction permit for channel 29 in Philadelphia was received by WIP radio, then owned by Gimbels department store, as part of a wave of ultra high frequency (UHF) station applications and assignments following a four-year-long freeze on permit awards. WIP returned the permit in May 1954, finding that building and operating the proposed station would be economically infeasible.
WIBF-TV: Early years
In August 1962, William Fox, whose family owned WIBF-FM (103.9) in Jenkintown as well as real estate interests there, received a construction permit from the Federal Communications Commission (FCC) to build a new television station on channel 29. The new station would focus on local and regional programming, including news, local sports, and educational shows; it was the second commercial UHF station approved for the Philadelphia area after channel 17 (originally WPCA-TV). The construction permit initially specified Jenkintown as the city of license, but this was changed to Philadelphia in 1963.
In 1965, plans for channel 29 became more definite as the station a |
https://en.wikipedia.org/wiki/NetWare%20File%20System | In computing, a NetWare File System (NWFS) is a file system based on a heavily modified version of FAT. It was used in the Novell NetWare operating system. It is the default and only file system for all volumes in versions 2.x through 4.x, and the default and only file system for the SYS volume continuing through version 5.x. Novell developed two varieties of NWFS:
16-bit NWFS 286, used in NetWare 2.x
32-bit NWFS 386, used in NetWare 3.x through NetWare 6.x.
Novell Storage Services (NSS, released in 1998), superseded the NWFS format.
The NWFS on-disk format was never publicly documented by Novell. The published specifications for 32-bit NWFS are:
Maximum file size: 4 GB
Maximum volume size: 1 TB
Maximum files per volume: 2 million when using a single name space.
Maximum files per server: 16 million
Maximum directory entries: 16 million
Maximum volumes per server: 64
Maximum volumes per partition: 8
Maximum open files per server: 100,000
Maximum directory tree depth: 100 levels
Characters used: ASCII double-byte
Maximum extended attributes: 512
Maximum data streams: 10
Support for different name spaces: Microsoft Windows Long names (a.k.a. OS/2 namespace), Unix, Apple Macintosh
Support for restoring deleted files (salvage)
Support for journaling (Novell Transaction Tracking System a.k.a. TTS)
Support for block suballocation, starting in NetWare 4.x
For larger files the file system utilized a performance feature named Turbo FAT.
Transparent file compression was also supported, although this had a significant impact on the performance of file serving.
Every name space requires its own separate directory entry for each file. While the maximum number of directory entries is 16,000,000, two resident name spaces would reduce the usable maximum number of directory entries to 8,000,000, and three to 5,333,333.
16-bit NWFS could handle volumes of up to 256 MB. However, its only name-space support was a dedicated API to handle Macintosh clients.
See also
List of file systems
Comparison of file systems
Transaction-Safe FAT File System
External links
Using the Transaction Tracking System
Compression file systems
Disk file systems
Network file systems
Novell NetWare |
https://en.wikipedia.org/wiki/Wang%20Xiaoyun | Wang Xiaoyun (; born 1966) is a Chinese cryptographer, mathematician, and computer scientist. She is a professor in the Department of Mathematics and System Science of Shandong University and an academician of the Chinese Academy of Sciences.
Early life and education
Wang was born in Zhucheng, Shandong Province. She gained bachelor (1987), master (1990) and doctorate (1993) degrees at Shandong University, and subsequently lectured in the mathematics department from 1993. Her doctoral advisor was Pan Chengdong. Wang was appointed assistant professor in 1995, and full professor in 2001. She became the Chen Ning Yang Professor of the Center for Advanced Study, Tsinghua University in 2005.
Career and research
At the rump session of CRYPTO 2004, she and co-authors demonstrated collision attacks against MD5, SHA-0 and other related hash functions (a collision occurs when two distinct messages result in the same hash function output). They received a standing ovation for their work.
In February 2005, it was reported that Wang and co-authors Yiqun Lisa Yin and Hongbo Yu had found a method to find collisions in the SHA-1 hash function, which is used in many of today's mainstream security products. Their attack is estimated to require less than 269 operations, far fewer than the 280 operations previously thought needed to find a collision in . Their work was published at the CRYPTO '05 conference. In August 2005, an improved attack on SHA-1, discovered by Wang, Andrew Yao and Frances Yao, was announced at the CRYPTO conference rump session. The time complexity of the new attack is claimed to be 263.
Awards and honors
In 2019, she was named a Fellow of the International Association for Cryptologic Research (IACR) for "For essential contributions to the cryptanalysis and design of hash functions, and for service to the IACR." In 2019, she became the first female winner of China's Future Science Prize for her pioneering contribution in cryptography.
References
External links
Xiaoyun Wang
1966 births
Living people
Chinese cryptographers
Chinese women computer scientists
Chinese women mathematicians
Educators from Shandong
Mathematicians from Shandong
Members of the Chinese Academy of Sciences
Modern cryptographers
People from Zhucheng
Shandong University alumni
Academic staff of Shandong University
Academic staff of Tsinghua University
Women cryptographers |
https://en.wikipedia.org/wiki/Declarative | Declarative may refer to:
Declarative learning, acquiring information that one can speak about
Declarative memory, one of two types of long term human memory
Declarative programming, a computer programming paradigm
Declarative sentence, a type of sentence that makes a statement
Declarative mood, a grammatical verb form used in declarative sentences
See also
Declaration (disambiguation) |
https://en.wikipedia.org/wiki/C.mmp | The C.mmp was an early multiple instruction, multiple data (MIMD) multiprocessor system developed at Carnegie Mellon University (CMU) by William Wulf (1971). The notation C.mmp came from the PMS notation of Gordon Bell and Allen Newell, where a central processing unit (CPU) was designated as C, a variant was noted by the dot notation, and mmp stood for Multi-Mini-Processor. , the machine is on display at CMU, in Wean Hall, on the ninth floor.
Structure
Sixteen Digital Equipment Corporation PDP-11 minicomputers were used as the processing elements, named Compute Modules (CMs) in the system. Each CM had a local memory of 8K and a local set of peripheral devices. One of the challenges was that a device was only available through its unique connected processor, so the input/output (I/O) system (designed by Roy Levien) hid the connectivity of the devices and routed the requests to the hosting processor. If a processor went down, the devices connected to its Unibus became unavailable, which became a problem in overall system reliability. Processor 0 (the boot processor) had the disk drives attached.
Each of the Compute Modules shared these communication pathways:
An Interprocessor bus – used to distribute system-wide clock, interrupt, and process control messaging among the CMs
A 16x16 crossbar switch – used to connect the 16 CMs on one side and 16 banks of shared memory on the other. If all 16 processors were accessing different banks of memory, the memory accesses would all be concurrent. If two or more processors were trying to access the same bank of memory, one of them would be granted access on one cycle and the remainder would be negotiated on subsequent memory cycles.
Since the PDP-11 had a logical address space of 16-bits, another address translation unit was added to expand the address space to 25 bits for the shared memory space. The Unibus architecture provided 18 bits of physical address, and the two high-order bits were used to select one of four relocation registers which selected a bank of memory. Properly managing these registers was one of the challenges of programming the operating system (OS) kernel.
The original C.mmp design used magnetic-core memory, but during its lifetime, higher performance dynamic random-access memory (RAM) became available and the system was upgraded.
The original processors were PDP-11/20 processors, but in the final system, only five of these were used; the remaining 11 were PDP-11/40 processors, which were modified by having extra writeable microcode space. All modifications to these machines were designed and built at CMU.
Most of the 11/20 modifications were custom changes to the wire-wrapped backplane, but because the PDP-11/40 was implemented in microcode, a separate proc-mod board was designed that intercepted certain instructions and implemented the protected operating system requirements. For example, it was necessary, for operating system integrity, that the stack pointer register never be |
https://en.wikipedia.org/wiki/Bilkent | Bilkent is a district in Ankara, Turkey, with the postal code 06800 where Bilkent University is located.
Besides Bilkent University, a technological improvement and tech start-up center called CYBERPARK is also located inside the district. CYBERPARK hosts more than 250 developing tech companies.
Three housing sites situated in green fields and woods provide its residents with natural settings, social facilities, sports areas and children's playgrounds. These are among Ankara's most prestigious addresses and 3,500 residential and commercial units serve a variety of demands and needs.
Districts of cities in Turkey
Çankaya District |
https://en.wikipedia.org/wiki/Abraham%20Rees | Abraham Rees (1743 – 9 June 1825) was a Welsh nonconformist minister, and compiler of Rees's Cyclopædia (in 45 volumes).
Life
He was the second son of Esther, daughter of Abraham Penry, and her husband Lewis Rees, and was born in Llanbrynmair, Montgomeryshire. Lewis Rees (1710-1800) was independent minister at Llanbrynmair (1734–1759) and Mynyddbach, Glamorganshire (1759–1800). Rees was educated for the ministry at Coward's academy in Wellclose Square, near London, under David Jennings, entering in 1759. In 1762 he was appointed assistant tutor in mathematics and natural philosophy; on the move of the academy to Hoxton after Jennings's death in 1762 he became resident tutor, a position which he held till 1785, his colleagues being Andrew Kippis and Samuel Morton Savage; subsequently he was tutor in Hebrew and mathematics in the New College at Hackney (1786–96).
His first ministerial engagement was in the independent congregation at Clapham, where he preached once a fortnight, as assistant to Philip Furneaux. In 1768 he became assistant to Henry Read (1686–1774) in the presbyterian congregation at St Thomas's, Southwark, and succeeded him as pastor in 1774. He moved to the pastorate of the Old Jewry congregation in 1783, and retained this charge till his death, being both morning and afternoon preacher (unusual then, among London presbyterians); he shared also (from 1773) a Sunday-evening lecture at Salters' Hall, and was one of the Tuesday-morning lecturers at Salters' Hall till 1795. A new meeting-house, of octagon form, was erected for him in Jewin Street and opened 10 December 1809. He was elected trustee of Dr Daniel Williams's foundations in 1774, and secretary of the presbyterian board in 1778, and held both offices till his death. On 31 January 1775 he received the degree of DD from the University of Edinburgh. He made a triennial visit to Wales as examiner of Carmarthen Academy. In 1806 he was appointed distributor of the English regium donum. He was elected a Foreign Honorary Member of the American Academy of Arts and Sciences in 1813.
When he presented the address of the body of ministers of the 'three denominations' (Presbyterians, Independents and Baptists) in 1820 on the accession of George IV, it was noted that, as a student, he had attended the similar deputation to George III sixty years before. According to Alexander Gordon (Unitarian) in the Dictionary of National Biography, his theology was of a mediating and transitional character; his doctrines had an evangelical flavour, though essentially of an Arian type, and inclining to those of Richard Price, and he held the tenet of a universal restoration. He was the last of the London dissenting ministers who officiated in a wig.
He died at his residence in Artillery Place, Finsbury, on 9 June 1825, and was buried on 18 June in Bunhill Fields, the pall being borne by six ministers of the 'three denominations.' A funeral oration was delivered by Thomas Rees, and the funeral sermo |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.