source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/NewsNation | NewsNation is an American subscription television network owned by the Nexstar Media Group, and is the company's only wholly-owned, national cable-originated television channel. The channel runs a straight-news format for 24 hours on weekdays and eight hours on weekends, as well as entertainment programming (consisting of comedy and drama series, and theatrical feature films) taking up almost the entire weekend schedule. Known for most of its history as Superstation WGN before becoming WGN America in 2008, it relaunched on March 1, 2021, as a cable news network named after its flagship news program. The channel's relaunch came as part of a planned expansion of its news programming.
In September 2018, the channel, then WGN America, was received by approximately 80 million households that subscribed to a pay television service throughout the United States (or 62.7% of households with at least one television set).
History
As a superstation
WGN America was originally established on November 9, 1978, when United Video Inc. began redistributing the signal of WGN-TV (channel 9) in Chicago to cable and satellite subscribers throughout the United States. This expanded the prominent independent station into America's second satellite-distributed national "superstation", after Atlanta-based WTBS became TBS.
As the national feed of WGN-TV, the channel broadcasts a variety of programming seen on the Chicago signal, including sports (mainly Chicago Cubs and White Sox baseball, as well as Chicago Bulls basketball games); locally originated news, children's, religious and public affairs programs; movies; and syndicated series. The WGN local and national feeds originally maintained nearly identical program schedules, aside from some sporting events that were restricted to the Chicago-area signal under league policy restrictions. In the years following the January 1990 re-imposition of federal syndication exclusivity regulations, programming between the two feeds increasingly deviated as the WGN national feed incorporated alternative syndicated programming to replace shows on the WGN-TV schedule that were subjected to market exclusivity claims by individual television stations, and some local programs that the national feed chose not to clear; particularly from the late 2000s onward, as the WGN Chicago signal began expanding its local news programming and added lifestyle programs to its schedule.
On December 13, 2014, WGN America was converted by Tribune into a conventional basic cable network, at which time it started to be offered on cable providers within the Chicago market alongside its existing local carriage on satellite providers DirecTV and Dish Network. Simulcasts of WGN-TV's Chicago-originated local newscasts, news specials and public affairs programs, special events and sports telecasts – with the exception of a one-hour simulcast of WGN-TV's morning news program that was carried early weekday mornings during the transitional period – immediately |
https://en.wikipedia.org/wiki/Snowflake%20schema | In computing, a snowflake schema is a logical arrangement of tables in a multidimensional database such that the entity relationship diagram resembles a snowflake shape. The snowflake schema is represented by centralized fact tables which are connected to multiple dimensions. "Snowflaking" is a method of normalizing the dimension tables in a star schema. When it is completely normalized along all the dimension tables, the resultant structure resembles a snowflake with the fact table in the middle. The principle behind snowflaking is normalization of the dimension tables by removing low cardinality attributes and forming separate tables.
The snowflake schema is similar to the star schema. However, in the snowflake schema, dimensions are normalized into multiple related tables, whereas the star schema's dimensions are denormalized with each dimension represented by a single table. A complex snowflake shape emerges when the dimensions of a snowflake schema are elaborate, having multiple levels of relationships, and the child tables have multiple parent tables ("forks in the road").
Common uses
Star and snowflake schemas are most commonly found in dimensional data warehouses and data marts where speed of data retrieval is more important than the efficiency of data manipulations. As such, the tables in these schemas are not normalized much, and are frequently designed at a level of normalization short of third normal form.
Data normalization and storage
Normalization splits up data to avoid redundancy (duplication) by moving commonly repeating groups of data into new tables. Normalization therefore tends to increase the number of tables that need to be joined in order to perform a given query, but reduces the space required to hold the data and the number of places where it needs to be updated if the data changes.
From a space storage point of view, dimensional tables are typically small compared to fact tables. This often negates the potential storage-space benefits of the star schema as compared to the snowflake schema. Example: One million sales transactions in 300 shops in 220 countries would result in 1,000,300 records in a star schema (1,000,000 records in the fact table and 300 records in the dimensional table where each country would be listed explicitly for each shop in that country). A more normalized snowflake schema with country keys referring to a country table would consist of the same 1,000,000 record fact table, a 300 record shop table with references to a country table with 220 records. In this case, the star schema, although further denormalized, would only reduce the number or records by a (negligible) ~0.02% (=[1,000,000+300] instead of [1,000,000+300+220])
Some database developers compromise by creating an underlying snowflake schema with views built on top of it that perform many of the necessary joins to simulate a star schema. This provides the storage benefits achieved through the normalization of dimensions with the e |
https://en.wikipedia.org/wiki/Good%20Neighbor%20Pharmacy | Good Neighbor Pharmacy is an American retailers' cooperative network of independently owned and operated pharmacies. It has a business affiliation with AmerisourceBergen, which sponsors the network and owns the name "Good Neighbor Pharmacy". Good Neighbor Pharmacy received the highest overall score in pharmacy customer satisfaction in the J.D. Power and Associates 2010 and 2011 National Pharmacy Studies. Good Neighbor Pharmacy has also ranked #1 for two years running in Newsweek's “America's Best Customer Service” for the brick and mortar pharmacies and drugstores category.
References
External links
MyGNP.com
Pharmacies of the United States
Retailers' cooperatives in the United States |
https://en.wikipedia.org/wiki/Family%20Pharmacy | Family Pharmacy is a network of 2,100 independently owned and operated pharmacies. AmerisourceBergen owns the servicemark Family Pharmacy. AmerisourceBergen also supplies Good Neighbor Pharmacy, a similar but distinct network. It can be considered a retailers' cooperative.
External links
Family Pharmacy
Pharmacies of the United States
Retailers' cooperatives in the United States |
https://en.wikipedia.org/wiki/Cosmic%20Osmo%20and%20the%20Worlds%20Beyond%20the%20Mackerel | Cosmic Osmo and the Worlds Beyond the Mackerel is a graphic adventure computer game for the Macintosh computer line (Plus, SE, SE/30, II Series, Classic, LC) created by Cyan, Inc. It was published in 1989 and won the 1990 Mac User's Editors' Choice Award for the "Best Recreational Program" category.
Spelunx, Cyan's next title, was made with a similar style of gameplay. In 2007, a new Cosmic Osmo game titled Cosmic Osmo's: Hex Isle was released, based loosely on the original's setting but with a more traditional platform game style of gameplay.
Game mechanics
The game features a point-and-click interface. The player clicks on various elements in a scene to trigger events. To move between scenes and rooms, the player clicks on doors or near the edge of the screen.
The game begins when the player enters an animated spaceship hovering in front of the title screen. While inside the ship, he can trigger various events.
The spaceship gives the player the ability to visit various planets. Aside from using the ship to move between planets, a complex network of shortcuts exists between planets and scenes. The game, being presented in first-person view, enables shifts from the macroscopic to the microscopic level. Most of the shortcuts are found at the microscopic level: through a water drain or a mouse-hole, for example.
Development
Cosmic Osmo was created by brothers Rand and Robyn Miller, who went on to form the company Cyan and develop the best-selling adventure game Myst.
It was created, and runs, using HyperCard. Animated portions were made using MacroMind VideoWorks, a linear animation program that later became Macromedia Director. An XCMD plug-in enabled VideoWorks animated sprites to be displayed with an alpha mask on top or behind HyperCard's graphic layer.
It was first published as simply Cosmic Osmo and required a hard drive for installation. A later enhanced CD-ROM version added more worlds, sounds, and music, and was titled Cosmic Osmo and the Worlds Beyond the Mackerel. Both versions were originally published by Activision, but through a breach of contract the rights reverted back to Cyan.
Mark H. DeForest (software engineer and later CTO at Cyan) in December 1995 indicated a colorized version was in development, noting, "...[it] is taking a fair amount of work, but is looking like it will be well worth it."
A port of the game was reportedly developed for the SNES-CD, a video game console add-on that was never released. Consequently, the game was not released either.
In May 2007, a company called HyperActive Software announced that they had been contracted by Cyan to create a Windows version of the game, to be released via GameTap, which was released on June 19, 2008.
On August 4, 2010 the game became available for purchase through Steam as part of a bundle that also includes the other Cyan Worlds titles The Manhole: Masterpiece Edition, Myst: Masterpiece Edition, realMyst, Riven: The Sequel to Myst, URU: Complete Chronicles, and |
https://en.wikipedia.org/wiki/RTT | RTT may refer to:
Computing
Real-time text, text transmitted as it is generated
Render to Texture, in computer graphics
Round-trip time, in telecommunications
Organisations
Realtime Trains, a UK train tracking website and app
Recapture Tactics Team, in US Marine Corps
Régie des Télegraphes et Téléphones, former name of the Belgium telecom company Proximus Group
Radio and Television of Montenegro (RTCG), formerly Radio-Televizija Titograd (RTT)
Other uses
Race to the Top, in US education
Real-time tactics, genre of strategy games
Rett syndrome, a neurological disorder
River Trade Terminal, a Hong Kong container terminal
Télévision Tunisienne 1, formerly called RTT
See also
1xRTT, a mobile communications protocol |
https://en.wikipedia.org/wiki/IQ%20151 | The IQ 151 was a personal computer produced by ZPA Nový Bor in the former Czechoslovakia.
It had a Tesla MHB8080A (copy of Intel 8080) CPU running at 2 MHz, 32 KB RAM (later on 64 KB), 4 KB ROM, with semigraphic text mode video output and the BASIC programming language.
The mainboard contained only CPU, supporting ICs and memory. Everything else was added by expansion modules, with five available slots.
Like mentioned above, elementary expansion modules are Basic 6, a BASIC language interpreter and Video 32,a video generator, producing 32 columns and 32 rows of text and semigraphic characters.
Advanced expansion modules include Video 64, allowing 64 x 32 character text display; Grafik, adding true 512 x 256 monochromatic graphics and Basic G, with additional graphical functions to BASIC; Pascal, and editor and compiler of the PASCAL programming language; Assembler, a low level programming language; AD/DA, a ADC / DAC converter interface; MS 151 and MINIGRAPH, a drivers for Czechoslovak plotters XY4130 and Aritma 0507; STAPPER, a driver for a punched tape unit; SESTYK, adding a serial port for networking and DISC 2, a controller for a 8" floppy drive using on an unlicensed CP/M clone. Due to an EPROM address conflict, DISC 2 couldn't be used with the Basic G or Pascal modules.
It IQ 151 was primarily used in Czech schools, while in Slovakia the PMD 85 series was used instead. This computer was produced locally due to a lack of foreign currency with which to buy systems from the West.
This computer had a persistent tendency to overheat under even a light workload and thus the common joke about it was "it's an excellent coffee mug heater." It also had a poor membrane in its keyboard, in comparison with slightly more advanced PMD 85.
After the fall of Communism in 1989, production of the IQ 151 was stopped, since it was not competitive in terms of price, quality or features compared to more modern computers.
References
External links
Information about IQ 151 at old-computers.com
East-European Home-Computer: IQ 151
Computer-related introductions in 1985
Home computers
Z80-based home computers
Science and technology in Czechoslovakia |
https://en.wikipedia.org/wiki/Kringvarp%20F%C3%B8roya | (; KVF) is the national public broadcasting company of the Faroe Islands. It was founded on 1 January 2005 after a merger of the national radio and television networks and .
History
Útvarp Føroya
("Radio of the Faroe Islands"; ÚF) was founded in 1957, under the station's first director Axel Tórgarð. Niels Juel Arge took over the position in 1960 and remained until 1990. Prior to the establishment of , the Faroese people could only listen to foreign radio stations. These included the National Norwegian Radio Station, often referred to as ("the Norwegian", "the man from Norway"), and the BBC World Service. These stations were mainly used for daily weather forecasts.
Sjónvarp Føroya
("Television of the Faroe Islands"; SvF) was founded in 1984. It was the only public TV station in the country, and broadcast some content in Faroese.
The history of SvF goes back to the 1960s. In 1969, the Faroese parliament decided to create an organisation for developing TV facilities on the islands under public law. A 1978 law set into motion the establishment of the network, which was founded as in 1981. A furniture store in the capital Tórshavn was converted into a TV studio in 1983. On 1 April 1984 the first Faroese programme was launched; however, private local TV associations had been transmitting for six years. The regular operation of SVF started on 1 September of that same year.
In spring 1985, the former freelancers of Faroese TV were engaged as staff by the Faroese government. Since 1990, other nearby buildings have been bought in order to enhance the network's premises.
In December 2002, the Faroe Islands became the first country in the world to completely disconnect of its analogue television signals, which had used the PAL standard, in favour of the digital DVB-T standard.
By law, SvF had a goal of broadcasting one-third of its programmes in Faroese. Other programmes were mostly taken from Danmarks Radio (DR) and were subtitled, with Danish audio. In 2003, 27 percent of the SvF's programmes were in Faroese. Apart from children's programmes, SVF's own production consisted mainly of news and topical magazine items.
Kringvarp Føroya
In 2005, the SvF and ÚF were merged into the current company, which is funded by a combination of television licence fees, commercials, and a bingo (called , or "the Joker"). The television section of the shows only one channel, with some programming coming from DR and TV 2 (Denmark). It also produces its own content, including Faroese news, which is called ("Day and Week"); children's TV; and some cultural and sports broadcasting. Additional stations are available from , the only local pay-TV provider, which is a digital terrestrial service. Satellite TV from foreign providers is also popular.
See also
Media of the Faroe Islands
References
External links
Kringvarp Føroya Homepage (with Faroese TV programmes for download)
Radio in Denmark
Television in the Faroe Islands
Television stations in Denmark
Pu |
https://en.wikipedia.org/wiki/Oslo%20Metro | The Oslo Metro ( or or simply ) is the rapid transit system of Oslo, Norway, operated by Sporveien T-banen on contract from the transit authority Ruter. The network consists of five lines that all run through the city centre, with a total length of , serving 101 stations of which 17 are underground or indoors. In addition to serving 14 out of the 15 boroughs of Oslo, two lines run to Kolsås and Østerås, in the neighboring municipality of Bærum. In 2016, the system had an annual ridership of 118 million.
The first rapid transit line, the Holmenkollen Line, opened in 1898, with the branch Røa Line opening in 1912. It became the first Nordic underground rapid transit system in 1928, when the underground line to Nationaltheatret was opened. After 1993 trains ran under the city between the eastern and western networks in the Common Tunnel, followed by the 2006 opening of the Ring Line. All the trains are operated with MX3000 stock. These replaced the older T1000 stock between 2006 and 2010.
History
Suburban lines in the west
Rail transport in Oslo started in 1854, with the opening of Hoved Line to Eidsvoll, through Groruddalen. In 1872, Drammen Line, going through Oslo West, and in 1879, Østfold Line going through Nordstrand opened, offering a limited rail service to those parts of the city. By 1875, Kristiania Sporveisselskab (KSS) opened the first horsecar trams. In 1894 electric trams were in service by Kristiania Elektriske Sporvei (KES).
The first suburban tram line was the Holmenkollen Line that was opened by Holmenkolbanen in 1898; like all the later suburban tram line these were electric trams with a grade-separated right-of-way and proper stations instead of tram stops, making it the first rapid transit in Oslo. Unlike the other suburban tram lines that were built later, the Holmenkollen Line was not extended into the city as a streetcar—instead passengers had to change at Majorstuen to the streetcars, though the system did not take into use wider suburban stock () until 1909. A branch line was opened in 1912, to Smestad, and in 1916 the Holmenkollen Line was extended to Tryvann, with the last part from Frognerseteren single track and used for freight, and removed in 1939.
In 1912, the construction of the first underground railway in the Nordic Countries started, when A/S Holmenkolbanen started construction of an extension of their line from Majorstuen to Nationaltheatret; the line was opened in 1928 (and was then only the second underground railway to be opened in the Nordic countries after Boulevardtunnlen in Copenhagen which opened in July 1918 ), with one intermediate station at Valkyrie Plass, giving the two suburban lines access to the central business district of Oslo.
The success of the suburban lines tempted KES to extend their streetcar service west from Skøyen as a suburban line; the Lilleaker Line opened to Lilleaker in 1919, to Avløs in 1924 and to Kolsås in 1930. A new section from Jar to Sørbyhaugen opened in 1942, conn |
https://en.wikipedia.org/wiki/QEMU | QEMU (Quick Emulator) is a free and open-source emulator. It emulates a computer's processor through dynamic binary translation and provides a set of different hardware and device models for the machine, enabling it to run a variety of guest operating systems. It can interoperate with Kernel-based Virtual Machine (KVM) to run virtual machines at near-native speed. QEMU can also do emulation for user-level processes, allowing applications compiled for one architecture to run on another.
Licensing
QEMU was written by Fabrice Bellard and is free software, mainly licensed under the GNU General Public License (GPL for short). Various parts are released under the BSD license, GNU Lesser General Public License (LGPL) or other GPL-compatible licenses.
Operating modes
QEMU has multiple operating modes:
User-mode emulation In this mode QEMU runs single Linux or Darwin/macOS programs that were compiled for a different instruction set. System calls are thunked for endianness and for 32/64 bit mismatches. Fast cross-compilation and cross-debugging are the main targets for user-mode emulation.
System emulation In this mode QEMU emulates a full computer system, including peripherals. It can be used to provide virtual hosting of several virtual computers on a single computer. QEMU can boot many guest operating systems, including Linux, Solaris, Microsoft Windows, DOS, and BSD; it supports emulating several instruction sets, including x86, MIPS, 32-bit ARMv7, ARMv8, PowerPC, RISC-V, SPARC, ETRAX CRIS and MicroBlaze.
Hypervisor Support In this mode QEMU either acts as either a Virtual Machine Manager (VMM) or as a device emulation back-end for virtual machines running under a hypervisor. The most common is the Linux's KVM but the project supports a number of hypervisors including Xen, Apple's HVF, Window's WHPX and NetBSD's nvmm.
Features
QEMU can save and restore the state of the virtual machine with all programs running. Guest operating systems do not need patching in order to run inside QEMU.
QEMU supports the emulation of various architectures, including x86, MIPS64 (up to Release 6), SPARC (sun4m and sun4u), ARM (Integrator/CP and Versatile/PB), SuperH, PowerPC (PReP and Power Macintosh), ETRAX CRIS, MicroBlaze, and RISC-V.
The virtual machine can interface with many types of physical host hardware, including the user's hard disks, CD-ROM drives, network cards, audio interfaces, and USB devices. USB devices can be completely emulated, or the host's USB devices can be used, although this requires administrator privileges and does not work with some devices.
Virtual disk images can be stored in a special format (qcow or qcow2) that only takes up as much disk space as the guest OS actually uses. This way, an emulated 120 GB disk may occupy only a few hundred megabytes on the host. The QCOW2 format also allows the creation of overlay images that record the difference from another (unmodified) base image file. This provides the possibility for reverting the |
https://en.wikipedia.org/wiki/Dragonstomper | Dragonstomper is a video game developed by Stephen Landrum for the Atari Video Computer System (later renamed Atari 2600) and released by Starpath. The game follows the adventures of a dragon hunter who is given a quest by the king to defeat a dragon and reclaim a magical amulet that was stolen. The player makes their way over the countryside, vanquishing various adversaries and gaining gold and experience. After achieving enough strength, the player can enter a shop in an oppressed village where equipment can be purchased, soldiers hired, and special scrolls obtained to defeat the dragon in its lair.
Stating that he wanted to make a "real fantasy role-playing game", Landrum began developing the game under the title of Excalibur. The game required use of the Starpath Supercharger, which connected to the Atari 2600 in order for it to read a cassette tape. The device also increased the RAM capabilities of the Atari 2600 exponentially, allowing for more complex games or graphics for the system. Upon the game's release, it received praise from gaming publications such as Electronic Games and Computer and Video Games with critics commenting on the game's depth and comparing its quality to home computer games of the period; Games listed it among the best games of 1983. Retrospective reviews included Chris Cavanaugh writing for the online database AllGame calling the game "woefully overlooked", and Ed Lin of Forbes praising the game for its graphics, use of music, and multiple ways to solve problems.
Plot and gameplay
Dragonstomper is set in a sword and sorcery–themed world. It takes place in a kingdom where a king once ruled peacefully. After a druid magician enchanted a powerful amulet which he believed would subdue a dragon, they entered the dragon's cave and accidentally left the amulet to fall into the hands of the dragon, increasing its power. The creature used its newfound powers against the kingdom, causing crops to die and creating savage creatures across the land. With the king's knights vanquished by the dragon's warriors, the Dragonstomper was the only person left to restore the kingdom. The Dragonstomper travels through the countryside and a township to prepare themselves to battle the dragon. The ending features different ways, chosen by the player, to deal with the dragon.
John Harris of Game Developer described the game as a role-playing game; like most games in the genre in the early 1980s, it adhered closely to the template established by Dungeons & Dragons. Michael J. Tresca wrote in his book on the history of role-playing games that it was the only true role-playing game on the Atari 2600. The game is set in three different in-game areas: The Enchanted Countryside, The Oppressed Village, and The Dragon's Cave. In the countryside, the objective is to gain power and magic needed to enter the village, with the Dragonstomper battling enemies in the field to be able to have enough gold to pass the guard at the bridge. The use of each i |
https://en.wikipedia.org/wiki/Visibility%20graph%20analysis | In architecture, visibility graph analysis (VGA) is a method of analysing the inter-visibility connections within buildings or urban networks. Visibility graph analysis was developed from the architectural theory of space syntax by Turner et al. (2001), and is applied through the construction of a visibility graph within the open space of a plan.
Visibility graph analysis uses various measures from the theory of small-world networks and centrality in network theory in order to assess perceptual qualities of space and the possible usage of it.
Visibility graph analysis was firstly implemented in Turner's Depthmap software and is now widely used by both academics and practitioners through the open source and multi-platform depthmapX developed by Tasos Varoudis.
Another opensource and multi-platform software that implements visibility graphs is topologicpy developed by Wassim Jabi.
See also
Fuzzy architectural spatial analysis
Isovist
Spatial network analysis software
Viewshed analysis
References
Architectural theory
Geometric graph theory |
https://en.wikipedia.org/wiki/Battle%20City | is a multi-directional shooter video game for the Family Computer produced and published in 1985 by Namco. It is a successor to Namco's 1980 Tank Battalion, and would be succeeded itself by the 1991 Tank Force.
An arcade version for the Nintendo VS. System would follow, and the game would eventually end up with the Virtual Console release for the Wii and Wii U. There was also a related Game Boy game of the same name dating back to 1991, which was developed and published by Nova Games.
Although the Famicom version was never officially released outside Japan, it was one of the most common inclusions in unofficial famiclone multicarts.
Gameplay
The player controls a tank and shoot projectiles to destroy enemy tanks around the playfield. The enemy tanks enter from the top of the screen and attempt to destroy the player's base (represented on the screen as a phoenix symbol), as well as the player's tank itself. A level is completed when the player destroys 20 enemy tanks, but the game ends if the player's base is destroyed or the player loses all available lives. Note that the player can destroy the base as well, so the player can still lose even after all enemy tanks are destroyed.
Battle City contains 35 different stages that are 13 units wide by 13 units high. Each map contains different types of terrain and obstacles. Examples include brick walls that can be destroyed by having either the player's tank or an enemy tank shoot at them, steel walls that can be destroyed by the player if they have collected three stars, bushes that hide tanks under them, ice fields that make it difficult to control the tank and patches of water which cannot be crossed by tanks. The game becomes more challenging in later levels, as enemy tanks may act as decoys to lure players away from their base so that another tank can destroy it. In addition, flashing red tanks releases a random power-up when destroyed. There are several types of power-ups, such as a clock that stops all enemies, a protective shield, and a bomb that eliminates all on-screen enemies. The enemy tanks come in four different sizes, with the largest one requiring four shots to destroy.
Features
The original Famicom version of Battle City provides a co-op multiplayer mode and a built-in level editor, one of the earliest video games to do so. Due to its simplicity, Battle City hosts an extensive ROM hacking scene.
Reception
Notes
References
External links
1985 video games
Cooperative video games
Game Boy games
FM-7 games
Namco games
Nintendo Entertainment System games
Nintendo Vs. Series games
Sharp MZ games
Sharp X1 games
Shoot 'em ups
Video games developed in Japan
Virtual Console games for Nintendo 3DS
Virtual Console games for Wii U
Multiplayer and single-player video games
Head-to-head arcade video games
Tank simulation video games |
https://en.wikipedia.org/wiki/Spambot | A spambot is a computer program designed to assist in the sending of spam. Spambots usually create accounts and send spam messages with them. Web hosts and website operators have responded by banning spammers, leading to an ongoing struggle between them and spammers in which spammers find new ways to evade the bans and anti-spam programs, and hosts counteract these methods.
Email
Email spambots harvest email addresses from material found on the Internet in order to build mailing lists for sending unsolicited email, also known as spam. Such spambots are web crawlers that can gather email addresses from websites, newsgroups, special-interest group (SIG) postings, and chat-room conversations. Because email addresses have a distinctive format, such spambots are easy to code.
A number of programs and approaches have been devised to foil spambots. One such technique is address munging, in which an email address is deliberately modified so that a human reader (and/or human-controlled web browser) can interpret it but spambots cannot. This has led to the evolution of more sophisticated spambots that are able to recover email addresses from character strings that appear to be munged, or instead can render the text into a web browser and then scrape it for email addresses. Alternative transparent techniques include displaying all or part of the email address on a web page as an image, a text logo shrunken to normal size using inline CSS, or as text with the order of characters jumbled, placed into readable order at display time using CSS.
Forums
Forum spambots browse the internet, looking for guestbooks, wikis, blogs, forums, and other types of web forms that they can then use to submit bogus content. These often use OCR technology to bypass CAPTCHAs. Some spam messages are targeted towards readers and can involve techniques of target marketing or even phishing, making it hard to tell real posts from the bot generated ones. Other spam messages are not meant to be read by humans, but are instead posted to increase the number of links to a particular website, to boost its search engine ranking.
One way to prevent spambots from creating automated posts is to require the poster to confirm their intention to post via email. Since most spambot scripts use a fake email address when posting, any email confirmation request is unlikely to be successfully routed to them. Some spambots will pass this step by providing a valid email address and use it for validation, mostly via webmail services. Using methods such as security questions are also proven to be effective in curbing posts generated by spambots, as they are usually unable to answer it upon registering, also on various forums, consistent uploading of spam will also gain the person the title 'spambot'.
Twitter
A Twitterbot is a program used to produce automated posts on the Twitter microblogging service, or to automatically follow Twitter users. Twitterbots come in various forms. For example, many serv |
https://en.wikipedia.org/wiki/Swizzling | Swizzling may refer to:
Pointer swizzling – a computer science term.
Swizzling (computer graphics) – a computer graphics term.
Method swizzling
Texture swizzling – in computer graphics, a way to store texture maps while respecting locality of reference. |
https://en.wikipedia.org/wiki/Swizzle | Swizzle or swizzling may refer to:
Human movement
Swizzle (acro dance), a type of movement for two people in acro dance
Swizzle (figure skating), a type of movement in figure skating
Computer science
Swizzling (computer graphics), a method of rearranging the elements of a vector
Pointer swizzling, the manipulation of object references
Other uses
Swizzle stick, a device used for stirring drinks
Rum Swizzle, a type of cocktail |
https://en.wikipedia.org/wiki/Pointer%20swizzling | In computer science, pointer swizzling is the conversion of references based on name or position into direct pointer references (memory addresses). It is typically performed during deserialization or loading of a relocatable object from a disk file, such as an executable file or pointer-based data structure.
The reverse operation, replacing memory pointers with position-independent symbols or positions, is sometimes referred to as unswizzling, and is performed during serialization (saving).
Example
It is easy to create a linked list data structure using elements like this:
struct node {
int data;
struct node *next;
};
But saving the list to a file and then reloading it will (on most operating systems) break every link and render the list useless because the nodes will almost never be loaded into the same memory locations. One way to usefully save and retrieve the list is to assign a unique id number to each node and then unswizzle the pointers by turning them into a field indicating the id number of the next node:
struct node_saved {
int data;
int id_number;
int id_number_of_next_node;
};
Records like these can be saved to a file in any order and reloaded without breaking the list. Other options include saving the file offset of the next node or a number indicating its position in the sequence of saved records, or simply saving the nodes in-order to the file.
After loading such a list, finding a node based on its number is cumbersome and inefficient (serial search). Traversing the list was very fast with the original "next" pointers. To convert the list back to its original form, or swizzle the pointers, requires finding the address of each node and turning the id_number_of_next_node fields back into direct pointers to the right node.
Methods of unswizzling
There are a potentially unlimited number of forms into which a pointer can be unswizzled, but some of the most popular include:
The offset of the pointed-to object in the file
The index of the pointed-to object in some sequence of records
A unique identifier possessed by the pointed-to object, such as a person's Social Security number; in databases, all pointers are unswizzled in this manner (see Foreign key).
Methods of swizzling
Swizzling in the general case can be complicated. The reference graph of pointers might contain an arbitrary number of cycles; this complicates maintaining a mapping from the old unswizzled values to the new addresses. Associative arrays are useful for maintaining the mapping, while algorithms such as breadth-first search help to traverse the graph, although both of these require extra storage. Various serialization libraries provide general swizzling systems. In many cases, however, swizzling can be performed with simplifying assumptions, such as a tree or list structure of references.
The different types of swizzling are:
Automatic swizzling
On-demand swizzling
Potential security weaknesses
For security, unsw |
https://en.wikipedia.org/wiki/PCMag | PC Magazine (shortened as PCMag) is an American computer magazine published by Ziff Davis. A print edition was published from 1982 to January 2009. Publication of online editions started in late 1994 and continues .
Overview
PC Magazine provides reviews and previews of the latest hardware and software for the information technology professional. Articles are written by leading experts including John C. Dvorak, whose regular column and "Inside Track" feature were among the magazine's most popular attractions. Other regular departments include columns by long-time editor-in-chief Michael J. Miller ("Forward Thinking"), Bill Machrone, and Jim Louderback, as well as:
"First Looks" (a collection of reviews of newly released products)
"Pipeline" (a collection of short articles and snippets on computer-industry developments)
"Solutions" (which includes various how-to articles)
"User-to-User" (a section in which the magazine's experts answer user-submitted questions)
"After Hours" (a section about various computer entertainment products; the designation "After Hours" is a legacy of the magazine's traditional orientation towards business computing.)
"Abort, Retry, Fail?" (a beginning-of-the-magazine humor page which for a few years was known as "Backspace"—and was subsequently the last page).
For several years in the 1980s PC Magazine gave significant coverage to programming for the IBM PC and compatibles in languages such as Turbo Pascal, BASIC, Assembly and C. Charles Petzold was one of the notable writers on programming topics.
Editor Bill Machrone wrote in 1985 that If an article doesn't evaluate products or enhance productivity, "chances are it doesn't belong in PC Magazine".
History
In an early review of the new IBM PC, Byte reported that PC: The Independent Guide to the IBM Personal Computer "should be of great interest to owners". The first issue of PC, dated February–March 1982, appeared early that year. (The word Magazine was added to the name with the third issue in June 1982, but not added to the logo until January 1986.)
PC Magazine was created by David Bunnell, Jim Edlin, and Cheryl Woodard (who also helped Bunnell found the subsequent PC World and Macworld magazines). David Bunnell, Edward Currie and Tony Gold were the magazines co-founders. Bunnell and Currie created the magazine's business plan at Lifeboat Associates in New York which included, in addition to PC Magazine, explicit plans for publication of PC Tech, PC Week and PC Expositions (PC Expo) all of which were subsequently realized. Tony Gold, a co-founder of Lifeboat Associates financed the magazine in the early stages. The magazine grew beyond the capital required to publish it; to solve this problem, Gold sold the magazine to Ziff-Davis, moving from California to New York City. By February 1983 it was published by PC Communications Corp., a subsidiary of Ziff-Davis Publishing Co., Bunnell and his staff left to form PC World magazine.
The first issue of PC carried |
https://en.wikipedia.org/wiki/2RPH | 2RPH is an Australian radio reading service that reads newspapers and magazines for the benefit of those who have difficulties reading for themselves. It is the Sydney station of the RPH Network.
The 2RPH Sydney and 3RPH Melbourne were available free to air (no smartcard required) on the Optus Aurora radio platform via Optus C1 before the switch over to the more restrictive VAST platform. Now only the 3RPH Melbourne service is the only RPH service available free-to-air on Optus C1.
History
The need for a radio reading service was realised in New South Wales in 1983 with the establishment of 2RPH as a Community Benefit Organisation, incorporated as a Co-operative Society. The station began operating on 18 April 1983.
The first broadcast frequency was off the main broadcast band (1629 kHz), and was thus unsuitable, as many people could not receive the station. The problem was partly resolved by a move to a more suitable band location (1539 kHz, in 1991), and further in 1993 when the Commonwealth Government provided the station with transmission facilities previously used by commercial station 2WS. These facilities are still in use and provide a strong signal to most parts of Greater Sydney and some suburbs outside the metropolitan area.
In 2023, the station changed its name from Radio for the Print Handicapped NSW Cooperative Limited to Radio 2RPH Co-operative Limited. This was in response to the word handicapped being no longer acceptable in current Australian and global usage.
Audience
Though specifically designed for the vision-impaired, elderly, and infirm, its accessibility and clear announcers are used by English as a second language instructors to help their students understand the printed materials read from.
Programming
Volunteers prepare, produce, and present all the programs, including readings from magazines and other publications, which are pre-recorded. Many of these recorded programs are re-broadcast by RPH stations in other parts of Australia and the Radio Reading Service in New Zealand. 2RPH is the largest supplier of programs to the national network feed.
Applicants for on-air work must pass an audition carefully designed to demonstrate their skills at reading aloud. Volunteer positions are often available for behind-the-scenes duties.
See also
List of radio stations in Australia
Radio Print Handicapped Network
Community Radio Network (Australia)
References
External links
Radio stations in Sydney
Radio reading services of Australia
Radio stations established in 1983 |
https://en.wikipedia.org/wiki/Drive%20bay | A drive bay is a standard-sized area for adding hardware to a computer. Most drive bays are fixed to the inside of a case, but some can be removed.
Over the years since the introduction of the IBM PC, it and its compatibles have had many form factors of drive bays. Four form factors are in common use today, the 5.25-inch, 3.5-inch, 2.5-inch or 1.8-inch drive bays. These names do not refer to the width of the bay itself, but rather to the width of the disks used by the drives mounted in these bays.
Form factors
8.0-inch
8.0-inch drive bays were found in early IBM computers, CP/M computers, and the TRS-80 Model II. They were high, wide, and approximately deep, and were used for hard disk drives and floppy disk drives. This form factor is obsolete.
5.25-inch
5.25-inch drive bays are divided into two height specifications, full-height and half-height.
Full-height bays were found in old PCs in the early to mid-1980s. They were high, wide, and up to deep, used mainly for hard disk drives and floppy disk drives. This is the size of the internal (screwed) part of the bay, as the front side is actually . The difference between those widths and the name of the bay size is because it is named after the size of floppy that would fit in those drives, a 5.25-inch-wide square.
Half-height drive bays are high by wide, and are the standard housing for CD and DVD drives in modern computers. They were sometimes used for other things in the past, including hard disk drives (roughly between 10 and 100 MB) and floppy disk drives. As the name indicates, two half-height devices can fit in one full-height bay. Often represented as 5.25-inch, these floppy disk drives are obsolete.
The dimensions of a 5.25-inch floppy drive are specified in the SFF standard specifications which were incorporated into the EIA-741 "Specification for Small Form Factor 133.35 mm (5.25 in) Disk Drives" by the Electronic Industries Association (EIA). Dimensions of 5.25 optical drives are specified in the SFF standard (they are somewhat shorter and not only size of the body is standardized, but also size of the bezel).
3.5-inch
3.5-inch bays, like their larger counterparts, are named after diskette dimensions; their actual dimensions are wide by high. Those with an opening in the front of the case are generally used for floppy or Zip drives. Hard drives in modern computers are typically mounted in fully internal 4″ (nominally 3.5″) bays. Most modern computers do not come with a floppy drive at all, and may lack any externally accessible 3.5″ bays. There are adapters, sometimes called a "sled", which can be used to mount a 3.5″ device in a 5.25″ bay.
More recently, it is becoming common to use 3.5″ bays for smart card and memory card readers, or for panels with additional USB ports.
The dimensions of a 3.5″ drive are specified in the SFF standard specifications SFF-8300 and SFF-8301 which were incorporated into the EIA-740 specification by the Electronic Industries Asso |
https://en.wikipedia.org/wiki/Computational%20indistinguishability | In computational complexity and cryptography, two families of distributions are computationally indistinguishable if no efficient algorithm can tell the difference between them except with negligible probability.
Formal definition
Let and be two distribution ensembles indexed by a security parameter n (which usually refers to the length of the input); we say they are computationally indistinguishable if for any non-uniform probabilistic polynomial time algorithm A, the following quantity is a negligible function in n:
denoted . In other words, every efficient algorithm As behavior does not significantly change when given samples according to Dn or En in the limit as . Another interpretation of computational indistinguishability, is that polynomial-time algorithms actively trying to distinguish between the two ensembles cannot do so: that any such algorithm will only perform negligibly better than if one were to just guess.
Related notions
Implicit in the definition is the condition that the algorithm, , must decide based on a single sample from one of the distributions. One might conceive of a situation in which the algorithm trying to distinguish between two distributions, could access as many samples as it needed. Hence two ensembles that cannot be distinguished by polynomial-time algorithms looking at multiple samples are deemed indistinguishable by polynomial-time sampling'. If the polynomial-time algorithm can generate samples in polynomial time, or has access to a random oracle that generates samples for it, then indistinguishability by polynomial-time sampling is equivalent to computational indistinguishability.
References
External links
Yehuda Lindell. Introduction to Cryptography
Donald Beaver and Silvio Micali and Phillip Rogaway, The Round Complexity of Secure Protocols (Extended Abstract), 1990, pp. 503–513
Shafi Goldwasser and Silvio Micali. Probabilistic Encryption. JCSS, 28(2):270–299, 1984
Oded Goldreich. Foundations of Cryptography: Volume 2 – Basic Applications. Cambridge University Press, 2004.
Jonathan Katz, Yehuda Lindell, "Introduction to Modern Cryptography: Principles and Protocols," Chapman & Hall/CRC, 2007
Algorithmic information theory |
https://en.wikipedia.org/wiki/TLU | TLU may mean:
Computing
Tape Library Unit, an individual computer storage tape library
Threshold Logical Unit in neural networks
Universities
Tallinn University
Texas Lutheran University
"The Lords University", a jocular acronym referring to BYU, Brigham Young University
Transportation
Golfo de Morrosquillo Airport (IATA airport code: TLU; ICAO airport code: SKTL) in Tolú, Sucre, Colombia
Aero Toluca Internactional (ICAO airline code: TLU), see List of airline codes (A)
The London Underground, the subway of London, England, UK
Other uses
The Last of Us (series), a video game series and media franchise
The Last of Us (2013 videogame) first game in the series
Tulehu language (ISO 639 language code: tlu)
St. Kitts and Nevis Trades and Labour Union
Tropical Livestock Unit |
https://en.wikipedia.org/wiki/GEOS%20%28eikaiwa%29 | was one of the Big Four private eikaiwa, or English conversation teaching companies, in Japan. Its extensive network of overseas schools made it the world's largest language school chain. The firm went into bankruptcy in Japan on April 20, 2010. Its headquarters were in the in Shinagawa, Tokyo.
GEOS (eikaiwa), which stands for Global Education Opportunities and Services, was formed in 1973 by Tsuneo Kusunoki. The first school was based in Tokushima City, Tokushima Prefecture, Japan, also the location of one of the company's main registered offices.
The GEOS eikaiwa group also ran children-only schools called "Kodomo Schools" (子供校) throughout Japan. The adult GEOS eikaiwa schools had themselves taken on more classes for children. As of February 2007, GEOS had a total of around 500 "Kodomo" and adult schools in Japan and over 55 schools outside Japan.
The main language the school taught was English. Other languages included French, Spanish, Italian, German, Chinese and Korean. The school also taught Japanese to foreigners living in Japan at their Kudan Japanese Culture, Research Center and Language Institute in Kudanshita, Tokyo. The school used a one-teacher system it calls "Tanninsei" where students keep the same teacher for an extended period of time and advertised this system as having benefits of promoting continuity and strong teacher-student relationship.
The GEOS Eikaiwa Corporation filed for bankruptcy on April 21, 2010; 99 schools were closed and the remaining 230 were sold to G.Communication, which is also the "sponsor" of Nova. On October 1, 2010, the schools were resold to Inayoshi Capital.
The GEOS Eikaiwa Group has subsequently ceased trading. After a successful purchase in 2011 the German-based Sprachcaffe Languages Plus currently operates 11 of the former GEOS eikaiwa schools under the GEOS brand.
History
In 1973, roommates Kiyoshi Aki and Tsuneo Kusunoki founded the company AMVIC, an acronym of the phrase, "AMbition and VICtory". The company would focus on foreign language studies.
Later, AMVIC International split into two divisions. Aki became the head of , which provided foreign language training for students. Kusunoki would assume control of the , which specialized in English language education for non-native speakers. In 1989, Kusunoki's branch of AMVIC International entered negotiations with Warner Pacific College to assume control of 49% of its physical plant for $6 million, a 30-year lease on the schools facilities and a seat as a regent of the school.
International
International expansion began in Vancouver in 1987, and New York, Brighton (UK) in 1989 and Montreal, San Francisco in 1997, Ottawa and Halifax in 1998 (though the Halifax school later closed in 2001). In 2001, GEOS Eikaiwa created a network of international support offices, starting with GEOS International Korea and followed by offices in Korea, Taiwan, Japan, Thailand, Brazil, Hong Kong, Mexico and the Czech Republic. On July 6, 2007, The Japan Times |
https://en.wikipedia.org/wiki/IPodLinux | iPodLinux is a µClinux-based Linux distribution designed specifically to run on Apple Inc.'s iPod. When the iPodLinux kernel is booted it takes the place of Apple's iPod operating system and automatically loads Podzilla, an alternative GUI and launcher for a number of additional included programs such as a video player, an image viewer, a command line shell, games, emulators for video game consoles, programming demos, and other experimental or occasionally unfinished software.
The project has been inactive since 2009, but its website is still maintained. Further development of free and open source software for iPods have continued with the Rockbox Project, zeroslackr, and freemyipod, which have largely supplanted iPodLinux. Some third party installers are still available.
Basic structure
iPodLinux in essence consists of a Linux kernel built from µClinux sources using the uClibc C standard library with driver code for iPod components (or reverse engineered drivers where available). It includes userland programs from µClinux and/or BusyBox, a UNIX-style file system (which can be created within HFS+ formatted iPods, or an ext2 partition on FAT32 formatted iPod), and the Podzilla GUI (and its modules). Apple's proprietary iPod OS in contrast uses an invisible boot loader and is based on an ARM processor kernel originally written by Pixo, and the iPod Miller Columns browser program, a GUI written by Apple and Pixo using the Pixo application framework, and other firmware and component drivers written from manufacturer's reference code to support the standard behavior Apple wanted the iPod to have.
Features
Besides the kernel, iPodLinux features as a primary component podzilla and podzilla2, applications which provide:
An iPod-like user interface
Video playback with sound
Support for AAC, MP3 and basic OGG playback (4G & 5G Music Player Daemon malfunctions, but can be fixed).
Many games, including TuxChess, Bluecube (Tetris clone), Chopper, StepMania (a Dance Dance Revolution clone) and more.
Recording through audio jack at much higher quality than Apple's firmware
Ability to play the games Doom and Doom II (and presumably any Doom Total Conversion; Chex Quest for instance)
Color scheme support
Ability to run many emulators, such as iBoy (Nintendo Game Boy Emulator), iNES (Nintendo Entertainment System Emulator), iDarcNES (port of the multiple system emulator DarcNES), iMAME (port of Multiple Arcade Machine Emulator), and iGPSP (Game Boy Advance emulator).
History
The bootloader for the 4th generation iPod was extracted by Nils Schneider, a German computer science student. Previous software methods to extract the necessary bootloader no longer worked. Bernard Leach had previously discovered how to operate the piezo buzzer inside the iPod. Schneider was able to use his program with some modifications to make a series of clicks for each byte of the new iPod's bootloader. The extraction process took 22 hours to complete and required Schn |
https://en.wikipedia.org/wiki/Valu-Rite | Valu-Rite is a network of over 4,000 independently owned and operated pharmacies established in 1979. It has a business affiliation with McKesson Pharmaceuticals, which sponsors the network and owns the name "Valu-Rite". It operates like a retailers' cooperative, though it is not owned by its members.
Radio commercials for Valu-Rite in the 1980s used spokesmen Dick Clark and Tom Bosley.
External links
[ Valu-Rite]
McKesson's Valu-Rite page
Pharmacies of the United States
Retailers' cooperatives in the United States
American companies established in 1979
Retail companies established in 1979 |
https://en.wikipedia.org/wiki/G%20programming%20language | G programming language may refer to:
G-code, programming language, used mainly in automation.
G, the graphical programming language used in LabVIEW.
G, a programming language for rapid development of OpenGL applications. |
https://en.wikipedia.org/wiki/Leader%20Drug%20Stores | Leader Drug Stores is a network of over 3,100 independently owned and operated pharmacies. It has a business affiliation with Cardinal Health, which sponsors the network and owns the name "Leader Drug Stores". Cardinal Health also owns the franchise chain The Medicine Shoppe. It operates like a retailers' cooperative, though it is not owned by its members.
References
External links
Leader Drug stores
Cardinal Health's Leader page
Pharmacies of the United States
Retailers' cooperatives in the United States |
https://en.wikipedia.org/wiki/Delay%20insensitive%20circuit | A delay-insensitive circuit is a type of asynchronous circuit which performs a digital logic operation often within a computing processor chip. Instead of using clock signals or other global control signals, the sequencing of computation in delay-insensitive circuit is determined by the data flow.
Data flows from one circuit element to another using "handshakes", or sequences of voltage transitions to indicate readiness to receive data, or readiness to offer data. Typically, inputs of a circuit module will indicate their readiness to receive, which will be "acknowledged" by the connected output by sending data (encoded in such a way that the receiver can detect the validity directly), and once that data has been safely received, the receiver will explicitly acknowledge it, allowing the sender to remove the data, thus completing the handshake, and allowing another datum to be transmitted.
In a delay-insensitive circuit, there is therefore no need to provide a clock signal to determine a starting time for a computation. Instead, the arrival of data to the input of a sub-circuit triggers the computation to start. Consequently, the next computation can be initiated immediately when the result of the first computation is completed.
The main advantage of such circuits is their ability to optimize processing of activities that can take arbitrary periods of time depending on the data or requested function. An example of a process with a variable time for completion would be mathematical division or recovery of data where such data might be in a cache.
The Delay-Insensitive (DI) class is the most robust of all asynchronous circuit delay models. It makes no assumptions on the delay of wires or gates. In this model all transitions on gates or wires must be acknowledged before transitioning again. This condition stops unseen transitions from occurring. In DI circuits any transition on an input to a gate must be seen on the output of the gate before a subsequent transition on that input is allowed to happen. This forces some input states or sequences to become illegal. For example OR gates must never go into the state where both inputs are one, as the entry and exit from this state will not be seen on the output of the gate. Although this model is very robust, no practical circuits are possible due to the lack of expressible conditionals in DI circuits. Instead the Quasi-Delay-Insensitive model is the smallest compromise model yet capable of generating useful computing circuits. For this reason circuits are often incorrectly referred to as Delay-Insensitive when they are Quasi Delay-Insensitive.
See also
self-clocking signal
delay-tolerant networking
References
External links
"Delay-Insensitive Codes -- An Overview" by Tom Verhoeff
"TITAC: Design of A Quasi-Delay-Insensitive Microprocessor" by Takashi Nanya et al. 1994
"A Quasi Delay-Insensitive Bus Proposal for Asynchronous Systems" by Pedro A. Molina and Peter Y. K. Cheung 1997
"Quasi-Dela |
https://en.wikipedia.org/wiki/Gran%20Turismo%204 | Gran Turismo 4 is a 2004 racing simulation game developed by Polyphony Digital and published by Sony Computer Entertainment for the PlayStation 2. It is the fourth main installment and the sixth overall in the Gran Turismo series. It was released on December 28, 2004, in Japan and Hong Kong, February 22, 2005, in North America, and March 9, 2005, in Europe, and has since been re-issued under Sony's Greatest Hits brand.
Originally planned for a 2003 release, Gran Turismo 4 was delayed for over a year and a half by Polyphony Digital, and had its online mode removed. The game features over 721 cars from 80 manufacturers, from as early as the 1886 Daimler Motor Carriage, and as far into the future as concepts for 2022. The game also features 51 tracks, many of which are new or modified versions of old Gran Turismo tracks, with some notable real-world additions.
Gran Turismo 4 was well-received critically and a commercial success, becoming one of the highest-selling games of 2005, and the third best-selling game on the PlayStation 2. The Chinese, Japanese, and South Korean releases of the game were bundled with a 212-page driving guide and lessons on the physics of racing. A PlayStation Portable enhanced port entitled Gran Turismo Mobile was originally planned for development, but was later renamed to Gran Turismo, which was released October 1, 2009.
Gameplay
Players accumulate points by winning races in the normal first-person driving mode, called A-Spec mode. Each race event can yield up to a maximum of 200 A-Spec points. Generally, a win using a car with less of an advantage over the AI opponents is worth more points. Points can only be won once, so to win further points from a previously won event, it must be re-won using a car with less of an advantage over the AI. There are also the 34 Missions which can yield 250 points each. Despite this, A-Spec points are experience points, not money.
The new B-Spec mode puts players in the place of a racing crew chief: telling the driver how aggressively to drive, when to pass, and mandating pit stops (by monitoring tire wear and fuel level). The speed of the time in the race can be increased up to 3×, allowing for Endurance races to be completed in less time than would take in A-Spec mode. The 3× feature, however, must be turned on after every pit stop because it resets to normal time. The game manual says that the player may speed up B-Spec mode by up to 5×, but this is believed to be a typo. B-Spec points are given out for each race completed in B-Spec mode. This increases the skill level of the AI driver in the categories of vehicle skill, course skill, and battle skill. Players can thereby use B-Spec mode in harder races as the game progresses, but this mode cannot be used on wet, dirt, and snow courses.
Another new addition to the game is the Driving Missions, which are similar in experience to the license tests, but award successful completion with 250 A-Spec points and 1000 or more credits. Each |
https://en.wikipedia.org/wiki/NORDUnet | NORDUnet is an international collaboration between the National research and education networks in the Nordic countries.
Members
The members of NORDUnet are:
SUNET of Sweden
UNINETT of Norway
FUNET of Finland
Forskningsnettet of Denmark
RHnet of Iceland
Network
NORDUnet interconnects the Nordic national research and education networks and connects them to the worldwide network for research and education and to the general purpose Internet. NORDUnet provides its services by a combination of leased lines and Internet services provided by other international operators. NORDUnet has peering in multiple important internet exchange sites outside the Nordics, such as Amsterdam, Chicago, Frankfurt, London, Miami and New York.
In addition to the basic Internet service NORDUnet operates information services and provides USENET NetNews and Multicast connectivity to the Nordic national networks. NORDUnet also coordinates the national networks' Computer Emergency Response Team (CERT) activities and the Nordic national networks' IPv6 activities - an area where NORDUnet has been active for years.
NORDUnet is one of the members, alongside Internet2, ESnet, SURFnet, CANARIE and GÉANT, to pilot a 100G intercontinental connection between Europe and North America.
History
NORDUnet is the result of the NORDUNET programme (1986 to 1992) financed by the Nordic Council of Ministers, officially beginning operations 1989. It was the first European NREN to embrace the TCP/IP technology and to connect to the National Science Foundation Network in the United States providing open access for university students in member countries. Along with other early adopters of TCP/IP, particularly CERN, it encouraged the adoption of TCP/IP in Europe (see Protocol Wars).
NORDUnet has only few permanent employees. Most of the work is contracted to appropriate organisations in the Nordic area.
Distinction
The web site for NORDUNet, nordu.net, is the oldest active domain name. It was registered on January 1, 1985.
See also
History of the Internet
History of the Internet in Sweden
NORSAR – one of the two original international connections on the ARPANET
Norwegian Defence Research Establishment – carried out early research on TCP/IP in Europe along with Peter Kerstein's group at University College London and the Royal Signals Radar Establishment in Britain
References
External links
NORDUnet website
Academic computer network organizations
Information technology organizations based in Europe
Internet in Denmark
Nordic organizations
1985 establishments in Europe
Organizations established in 1985 |
https://en.wikipedia.org/wiki/Docking%20station | In computing, a docking station or port replicator (hub) or dock provides a simplified way to plug-in a mobile device, such as connect common peripherals to a laptop, or charge a smartphone. Because a wide range of dockable devices—from mobile phones to wireless mouse—have different connectors, power signaling, and uses, docks are unstandardized and are therefore often designed for a specific type of device.
A dock can allow some laptop computers to become a substitute for a desktop computer, without sacrificing the mobile computing functionality of the machine. Portable computers can dock and undock hot, cold or standby, depending on the abilities of the system. In a cold dock or undock, one completely shuts the computer down before docking/undocking. In a hot dock or undock, the computer remains running when docked/undocked. Standby docking or undocking, an intermediate style used in some designs, allows the computer to be docked/undocked while powered on, but requires that it be placed into a sleep mode prior to docking/undocking.
Types
Docking stations can be broadly split up into five basic varieties.
Expansion dock
This type of dock provides some sort of hardware expansion for the device docked to it, such as an external storage drive, a GPU, or a liquid cooling radiator.
Port replicator/hub
Port replicators (sometimes referred to as passthroughs) are functionally and logically identical to a bundle of extension cables, except that they are plugged in and unplugged together through the device. Some also include electrical adaptors to change from one pinout to another (e.g., Micro-DVI to normal DVI connector.) Often Bus-Powered and small form factor, they functionally duplicate ports from the device to easily access more of the existing ports like: SD cards, peripherals, audio jacks, etc. as well as external display(s).
Breakout dock/multi-port adapter
A breakout dock is conceptually a breakout box in the form of a dock. It is an extension to a typical port replicator in that it not only replicates existing ports already on the computer, but also offers additional ports. Modern computers most often accomplish this by using a special, often proprietary, connector that consolidates the signals from many concealed traces from onboard external buses into one connector. As such, the dock can offer a greater number of ports than is physically present on the computer. This allows the basic unit to have fewer physical ports while still allowing users a way to access to the full range of features of its motherboard.
Most companies that produce laptops with such breakout ports also offer simpler adapters that grant access to one or two of the buses consolidated in them at a time.
OEM/proprietary dock
Similar to a breakout device, some docking stations produce multiple connections from one port, only instead of extracting them from internal chipsets, they create them inside the dock using converters. They are functionally identical to a hub |
https://en.wikipedia.org/wiki/Company%20Pictures | Company Pictures is an independent British television production company which has produced drama programming for many broadcasters. It was set up in 1998 by Charles Pattinson and George Faber, colleagues at BBC Films. Their first film was Morvern Callar, which was credited as a co-production with BBC Films as they had begun developing it while still employed there. In 2003 Company Pictures became part of All3Media.
In 2012, founders Pattinson and Faber left Company Pictures to set up another independent production company, and John Yorke became managing director until 2015. He was succeeded by Michele Buck, former joint managing director of Mammoth Screen.
For both artistic and fiscal reasons, when producing the TV series The White Queen, Company Pictures entered into collaboration with a Flemish production house. This enabled them to film in the medieval cities of Ghent and Bruges, while receiving tax-breaks as a European co-production and for investment in Flanders.
References
Television production companies of the United Kingdom
2004 mergers and acquisitions
All3Media |
https://en.wikipedia.org/wiki/List%20of%20civil%20parishes%20on%20the%20Isle%20of%20Wight | This is a list of civil parishes in the ceremonial county of Isle of Wight, England. There are 33 civil parishes.
Isle of Wight
The whole of the county is parished.
Data Source: Office of National Statistics: QS102EW - Population density
Notes
Formerly Cowes Urban District
Formerly Isle of Wight Rural District
Formerly Newport Municipal Borough, also formerly Newport Parish Council.
Formerly Ryde Municipal Borough
Formerly Sandown-Shanklin Urban District
Formerly Ventnor Urban District
See also
List of civil parishes in England
References
External links
Office for National Statistics : Geographical Area Listings
Isle of Wight Council : Parish and Town Councils
Isle of Wight - Medieval Parishes (map)
Civil parishes
Isle of Wight
Civil parishes
Civil parishes |
https://en.wikipedia.org/wiki/List%20of%20civil%20parishes%20in%20Staffordshire | This is a list of civil parishes in the ceremonial county of Staffordshire, England. There are 195 civil parishes.
There is no population data for some of the smallest parishes.
The districts of Tamworth and Stoke-on-Trent are fully unparished. Parts of Cannock Chase District and the boroughs of Newcastle under Lyme and Stafford are unparished. These correspond to two separate parts of the former Cannock Urban District, the former municipal boroughs of Stafford, Newcastle-under-Lyme and Tamworth as well as the former county borough of Stoke-on-Trent.
See also
List of civil parishes in England
References
External links
Office for National Statistics : Geographical Area Listings
Staffordshire County Council
Civil parishes
Staffordshire
Civil parishes |
https://en.wikipedia.org/wiki/Holographic%20Versatile%20Disc | The Holographic Versatile Disc (HVD) is an optical disc technology that was expected to store up to several terabytes of data on an optical disc 10 cm or 12 cm in diameter. Its development commenced in April 2004, but it never arrived due to lack of funding. The company responsible for HVD went bankrupt in 2010.
The reduced radius reduces cost and materials used. It employs a technique known as collinear holography, whereby a blue-green and red laser beam are collimated in a single beam. The blue-green laser reads data encoded as laser interference fringes from a holographic layer near the top of the disc. A red laser is used as the reference beam to read servoinformation from a regular CD-style aluminium layer near the bottom. Servoinformation is used to monitor the position of the read head over the disc, similar to the head, track, and sector information on a conventional hard disk drive. On a CD or DVD this servoinformation is interspersed among the data. A dichroic mirror layer between the holographic data and the servo data reflects the blue-green laser while letting the red laser pass through. This prevents interference from refraction of the blue-green laser off the servo data pits and is an advance over past holographic storage media, which either experienced too much interference, or lacked the servo data entirely, making them incompatible with current CD and DVD drive technology.
Standards for 100 GB read-only holographic discs and 200 GB recordable cartridges were published by ECMA in 2007, but no holographic disc product has ever appeared in the market. A number of release dates were announced, all since passed, likely due to high costs of the drives and discs itself, lack of compatibility with existing or new standards, and competition from more established optical disc Blu-ray video streaming.
Technology
Current optical storage saves one bit per pulse, and the HVD alliance hoped to improve this efficiency with capabilities of around 60,000 bits per pulse in an inverted, truncated cone shape that has a 200 μm diameter at the bottom and a 500 μm diameter at the top. High densities are possible by moving these closer on the tracks: 100 GB at 18 μm separation, 200 GB at 13 μm, 500 GB at 8 μm, and most demonstrated of 5 TB for 3 μm on a 10 cm disc.
The system used a green laser, with an output power of 1 watt which is high power for a consumer device laser. Possible solutions include improving the sensitivity of the polymer used, or developing and commoditizing a laser capable of higher power output while being suitable for a consumer unit.
Competing technologies
HVD is not the only technology in high-capacity, holographic storage media. InPhase Technologies was developing a rival holographic format called Tapestry Media, which they claimed would eventually store 1.6 TB with a data transfer rate of 120 MB/s, and several companies are developing TB-level discs based on 3D optical data storage technology. Such large optical storage |
https://en.wikipedia.org/wiki/Commodity%20computing | Commodity computing (also known as commodity cluster computing) involves the use of large numbers of already-available computing components for parallel computing, to get the greatest amount of useful computation at low cost. It is computing done in commodity computers as opposed to in high-cost superminicomputers or in boutique computers. Commodity computers are computer systems - manufactured by multiple vendors - incorporating components based on open standards.
Characteristics
Such systems are said to be based on standardized computer components, since the standardization process promotes lower costs and less differentiation among vendors' products. Standardization and decreased differentiation lower the switching or exit cost from any given vendor, increasing purchasers' leverage and preventing lock-in.
A governing principle of commodity computing is that it is preferable to have more low-performance, low-cost hardware working in parallel (scalar computing) (e.g. AMD x86 CISC) than to have fewer high-performance, high-cost hardware items (e.g. IBM POWER7 or Sun-Oracle's SPARC RISC). At some point, the number of discrete systems in a cluster will be greater than the mean time between failures (MTBF) for any hardware platform, no matter how reliable, so fault tolerance must be built into the controlling software.
Purchases should be optimized on cost-per-unit-of-performance, not just on absolute performance-per-CPU at any cost.
History
The mid-1960s to early 1980s
The first computers were large, expensive and proprietary. The move towards commodity computing began when DEC introduced the PDP-8 in 1965. This was a computer that was relatively small and inexpensive enough that a department could purchase one without convening a meeting of the board of directors. The entire minicomputer industry sprang up to supply the demand for 'small' computers like the PDP-8. Unfortunately, each of the many different brands of minicomputers had to stand on its own because there was no software and very little hardware compatibility between the brands.
When the first general purpose microprocessor was introduced in 1971 (Intel 4004) it immediately began chipping away at the low end of the computer market, replacing embedded minicomputers in many industrial devices.
This process accelerated in 1977 with the introduction of the first commodity-like microcomputer, the Apple II. With the development of the VisiCalc application in 1979, microcomputers broke out of the factory and began entering office suites in large quantities, but still through the back door.
The 1980s to mid-1990s
The IBM PC was introduced in 1981 and immediately began displacing Apple II systems in the corporate world, but commodity computing as we know it today truly began when Compaq developed the first true IBM PC compatible. More and more PC-compatible microcomputers began coming into big companies through the front door and commodity computing was well established.
During |
https://en.wikipedia.org/wiki/Medical%20Reserve%20Corps | The Medical Reserve Corps (MRC) is a network in the U.S. of community-based units initiated and established by local organizations aimed to meet the public health needs of their communities. It is sponsored by the Office of the Assistant Secretary for Preparedness and Response (ASPR) in the United States Department of Health and Human Services (HHS). The MRC consists of medical and non-medical volunteers who contribute to local health initiatives, such as activities meeting the Surgeon General's priorities for public health, and supplement existing response capabilities in time of emergency. The MRC provides the structure necessary to pre-identify, credential, train, and activate medical and public health volunteers.
The Medical Reserve Corps Program (MRC PO) is the national "clearinghouse for information and guidance to help communities establish, implement, and sustain MRC units nationwide."
As of January 2020, there are 839 local MRC units and 175,283 volunteers. MRC units are present in all 50 U.S. states, Washington, D.C., Guam, Palau, Puerto Rico, and the U.S. Virgin Islands.
History
Following the September 11th attacks in 2001, President George W. Bush called for the establishment of the USA Freedom Corps, a "Coordinating Council... working to strengthen our culture of service and help find opportunities for every American to start volunteering". The Freedom Corps was to have three components: responding to crisis, rebuilding communities, and sharing compassion with the world. The Medical Reserve Corps was created as an extension of the Freedom Corps. As of 2017, there are 957 active MRC units.
Affiliations
The MRC is a partner program of Citizen Corps, a national network of volunteers dedicated to ensuring hometown security. Citizen Corps, along with the Corporation for National and Community Service and the Peace Corps, are part of the President's USA Freedom Corps.
The MRC PO also has a cooperative agreement with the National Association of County and City Health Officials (NACCHO). This agreement enables NACCHO to assist the ASPR's Medical Reserve Corps Program Office in enhancing MRC units' ability to meet local, state, and national needs through collaboration, coordination, and capacity-building activities. These activities include:
Coordinating the distribution of grant funding
Developing a national marketing strategy
Publishing a quarterly national newsletter
Assisting in the planning of regional and national meetings
Developing materials, resources, and tools to strengthen the knowledge and skills of MRC members
In addition, NACCHO's relationship with almost 3,000 local health departments further serves as an avenue to promote the MRC program at the local level.
Local and national organization
Locally, each MRC unit is led by an MRC Unit Director and/or Coordinator, who matches community needs with volunteer capabilities. Local MRC leaders are also responsible for building partnerships, ensuring the sustainability |
https://en.wikipedia.org/wiki/EAGLE%20%28program%29 | EAGLE is a scriptable electronic design automation (EDA) application with schematic capture, printed circuit board (PCB) layout, auto-router and computer-aided manufacturing (CAM) features. EAGLE stands for Easily Applicable Graphical Layout Editor () and is developed by CadSoft Computer GmbH. The company was acquired by Autodesk Inc. in 2016 who announced to support the product up to 2026 only.
Features
EAGLE contains a schematic editor, for designing circuit diagrams. Schematics are stored in files with .SCH extension, parts are defined in device libraries with .LBR extension. Parts can be placed on many sheets and connected together through ports.
The PCB layout editor stores board files with the extension .BRD. It allows back-annotation to the schematic and auto-routing to automatically connect traces based on the connections defined in the schematic.
EAGLE saves Gerber and PostScript layout files as well as Excellon and Sieb & Meyer drill files. These are standard file formats accepted by PCB fabrication companies, but given EAGLE's typical user base of small design firms and hobbyists, many PCB fabricators and assembly shops also accept EAGLE board files (with extension .BRD) directly to export optimized production files and pick-and-place data themselves.
EAGLE provides a multi-window graphical user interface and menu system for editing, project management and to customize the interface and design parameters. The system can be controlled via mouse, keyboard hotkeys or by entering specific commands at an embedded command line. Keyboard hotkeys can be user defined. Multiple repeating commands can be combined into script files (with file extension .SCR). It is also possible to explore design files utilizing an EAGLE-specific object-oriented programming language (with extension .ULP).
History
The German CadSoft Computer GmbH was founded by Rudolf Hofer and Klaus-Peter Schmidinger in 1988 to develop EAGLE, a 16-bit PCB design application for DOS. Originally, the software consisted of a layout editor with part libraries only. An auto-router module became available as optional component later on. With EAGLE 2.0, a schematics editor was added in 1991. The software used BGI video drivers, and XPLOT to print. In 1992, version 2.6 changed the definition of layers, but designs created under older versions (up to 2.05) could be converted into the new format using the provided UPDATE26.EXE utility.
EAGLE 3.0 was changed to be a 32-bit extended DOS application in 1994.
Support for OS/2 Presentation Manager was added with version 3.5 in April 1996. This version also introduced multi-window support with forward-/backward-annotation, user-definable copper areas, and a built-in programming language with ULPs. It was also the first to no longer require a dongle.
In 2000, EAGLE version 4.0 officially dropped support for DOS and OS/2, but now being based on Qt 3 it added native support for Windows and was among the first professional electronic CAD t |
https://en.wikipedia.org/wiki/Cos%20%28TV%20series%29 | Cos is an American sketch comedy/variety TV series that debuted on the ABC Network in September 1976. It was hosted by comedian Bill Cosby and featured an ensemble cast who would perform sketches each week. The show was unsuccessful in the Nielsen ratings and was cancelled by November 1976 and replaced with The Hardy Boys/Nancy Drew Mysteries.
Cosby appeared on this series concurrently with his starring role in Fat Albert and the Cosby Kids and the film Mother, Jugs & Speed.
Episodes
References
External links
Bill Cosby
1970s American variety television series
1970s American sketch comedy television series
1976 American television series debuts
1976 American television series endings
American Broadcasting Company original programming |
https://en.wikipedia.org/wiki/Linear%20complementarity%20problem | In mathematical optimization theory, the linear complementarity problem (LCP) arises frequently in computational mechanics and encompasses the well-known quadratic programming as a special case. It was proposed by Cottle and Dantzig in 1968.
Formulation
Given a real matrix M and vector q, the linear complementarity problem LCP(q, M) seeks vectors z and w which satisfy the following constraints:
(that is, each component of these two vectors is non-negative)
or equivalently This is the complementarity condition, since it implies that, for all , at most one of and can be positive.
A sufficient condition for existence and uniqueness of a solution to this problem is that M be symmetric positive-definite. If M is such that has a solution for every q, then M is a Q-matrix. If M is such that have a unique solution for every q, then M is a P-matrix. Both of these characterizations are sufficient and necessary.
The vector w is a slack variable, and so is generally discarded after z is found. As such, the problem can also be formulated as:
(the complementarity condition)
Convex quadratic-minimization: Minimum conditions
Finding a solution to the linear complementarity problem is associated with minimizing the quadratic function
subject to the constraints
These constraints ensure that f is always non-negative. The minimum of f is 0 at z if and only if z solves the linear complementarity problem.
If M is positive definite, any algorithm for solving (strictly) convex QPs can solve the LCP. Specially designed basis-exchange pivoting algorithms, such as Lemke's algorithm and a variant of the simplex algorithm of Dantzig have been used for decades. Besides having polynomial time complexity, interior-point methods are also effective in practice.
Also, a quadratic-programming problem stated as minimize subject to as well as with Q symmetric
is the same as solving the LCP with
This is because the Karush–Kuhn–Tucker conditions of the QP problem can be written as:
with v the Lagrange multipliers on the non-negativity constraints, λ the multipliers on the inequality constraints, and s the slack variables for the inequality constraints. The fourth condition derives from the complementarity of each group of variables with its set of KKT vectors (optimal Lagrange multipliers) being . In that case,
If the non-negativity constraint on the x is relaxed, the dimensionality of the LCP problem can be reduced to the number of the inequalities, as long as Q is non-singular (which is guaranteed if it is positive definite). The multipliers v are no longer present, and the first KKT conditions can be rewritten as:
or:
pre-multiplying the two sides by A and subtracting b we obtain:
The left side, due to the second KKT condition, is s. Substituting and reordering:
Calling now
we have an LCP, due to the relation of complementarity between the slack variables s and their Lagrange multipliers λ. Once we solve it, we may obt |
https://en.wikipedia.org/wiki/Wherry%20Lines | The Wherry Lines are railway branch lines in the East of England, linking to and . There are 14 stations including the three termini. They form part of Network Rail Strategic Route 7, SRS 07.11 and are classified as a rural line.
The lines pass through the Broads of Norfolk and Suffolk. The name is taken from the Norfolk wherries, which played an important role in the transport of goods and people around the Broads before road and rail transport became widespread.
Passenger services on the Wherry Lines are currently operated by Abellio Greater Anglia.
History
The route was opened from Norwich to Great Yarmouth by the Norwich and Yarmouth Railway in 1844, running via . The line from Reedham to Lowestoft was added in 1847 by Samuel Morton Peto as part of the Norfolk Railway. Finally, the northern route from Norwich to Great Yarmouth via was added in 1883 by the Great Eastern Railway, opening from Breydon Junction to Acle on 12 March, and through to Brundall on 1 June.
Community rail
In 2007 the services operating on the line were designated as community rail services as part of the Community Rail Development Strategy aiming to increase patronage and income, improve cost control and develop a greater sense of community involvement.
Infrastructure
The line from Norwich to Lowestoft is double-track throughout, but the two Great Yarmouth branches that diverge from via Acle and from Reedham via are single-track, although the branch via Acle was formerly double-track throughout.
The Wherry Lines are not electrified, hence services are formed by Bi-mode multiple units. The route has a loading gauge of W8, except between Lowestoft and where it is W6, and a maximum line speed of .
Of the 14 stations, two are lightly served. These are Berney Arms, which typically sees four trains call on weekdays and Saturdays (eight on Sundays), and , which sees two trains call on weekdays and Saturdays(thirteen on Sundays). At most of the stations on the Wherry Lines, service frequencies are increased during the summer months.
The signalling system was modernised in 2018–19. The line between Reedham and Great Yarmouth was closed from 20 October 2018 and was scheduled to open again in April 2019. Network Rail a bus replacement service was available during the works In January 2019, it was reported that the project was overrunning and that the line between Reedham and Great Yarmouth would not reopen in April 2019 as scheduled. No firm date was initially given as to when the line would reopen. The Great Yarmouth-Reedham line reopened on 24 February 2020.
Current Rolling stock
Passenger services are operated by Abellio Greater Anglia, typically using Class 755 trains.
Past Rolling stock
In 2015 the train operator introduced DRS Class 37 locomotive-hauled services due to a shortage of rolling stock as the route is not electrified. These ceased following the introduction of the 755s in 2019.
On Mondays to Saturdays, one service in each direction between Norwich |
https://en.wikipedia.org/wiki/Novell%20S-Net | S-Net (aka ShareNet) was a network operating system and the set of network protocols it used to talk to client machines on the network. Released by Novell in 1983, the S-Net operating system was an entirely proprietary operating system written for the Motorola 68000 processor. It used a star network topology.
S-Net has also been called NetWare 68, with the 68 denoting the 68000 processor. It was superseded by NetWare 86, which was written for the Intel 8086 processor, in 1985.
References
Network operating systems
S-Net
Proprietary operating systems |
https://en.wikipedia.org/wiki/Telewizja%20Polska | Telewizja Polska S.A. (; TVP), also known in English as Polish Television, is a state media corporation in Poland, founded in 1952. It is the oldest and largest Polish television network, although viewership has been declining in the 2010s.
Since 1993, the legal status of the broadcaster has been defined by the Broadcasting Act, according to which Telewizja Polska is obliged to implement "a public mission ... by offering ... various programmes and other services in the field of information, journalism, culture, entertainment, education and sport, characterized by pluralism, impartiality, balance and independence as well as innovation, high quality and integrity of the message."
Timeline of Polish TV service
1935: The PIT (Państwowy Instytut Telekomunikacyjny - National Telecommunications Institute) starts working together with Polish Radio on establishing the first television service.
1937: Completion of the first black-and-white broadcasting station.
1938: Experimental channel launched, regular programming scheduled for 1941.
1939: All equipment destroyed by the German Army.
1947: PIT resumes work on television broadcasting.
1951: First Polish telecast after the Second World War.
1952: Beginning of regular programming.
1957: Broadcast of the first sports event; a boxing match Skra Warsaw – Gwardia Łódź
1958: Newscast Dziennik Telewizyjny ("Journal") was founded.
1970: TVP2 was founded.
1971: Start of colour broadcasting (in SECAM).
1989: Introduction of a teletext service.
1989: Dziennik Telewizyjny was replaced by Wiadomości ("News").
1992: Telewizja Polska Spółka Akcyjna comes into existence upon the separation of television and radio public broadcasting by an act of parliament.
1992: TVP Polonia starts test transmissions.
1993: Polskie Radio i Telewizja (Polish Radio and Television) joins the European Broadcasting Union as an active member (regrouping of OIRT and UER).
1994: Beginning of the change over from SECAM to PAL for all channels except TVP1.
1995: Change over from SECAM to PAL was completed as TVP1 moved to this colour standard.
2003: Change of TVP logotype.
2009: New main headquarters building opened in Warsaw.
2013: Analogue terrestrial television was switched-off.
2020: TVP eSzkoła, and TVP Dokument were founded.
2021: was founded.
2022: was founded, replacing TVP eSzkoła.
International cooperation
In 2012, TVP signed an agreement with the BBC, under which they will work together on film and television productions.
The French-German TV liberal arts network ARTE cancelled a 15-year cooperation with TVP, when it learned in February 2009 that TVP's general director, Piotr Farfał, was a member of the League of Polish Families, which opposed Arte's "philosophy based on intercultural exchange" and "the party that TVP's chairman is presently connected with does not share European values". It was again cancelled in January 2016 after an amendment of the media law in Poland, which caused fears of a lack of p |
https://en.wikipedia.org/wiki/WMAQ-TV | WMAQ-TV (channel 5) is a television station in Chicago, Illinois, United States, serving as the market's NBC outlet. It is owned and operated by the network's NBC Owned Television Stations division alongside Telemundo station WSNS-TV (channel 44); it is also sister to regional sports network NBC Sports Chicago. WMAQ-TV and WSNS-TV share studios at the NBC Tower on North Columbus Drive in the city's Streeterville neighborhood and share transmitter facilities atop the Willis Tower in the Chicago Loop.
History
Early years (1948–1964)
The station first signed on the air on October 8, 1948, as WNBQ; it was the fourth television station to sign on in Chicago. It was also the third of NBC's five original owned-and-operated television stations to begin operations, after WNBC-TV in New York City and WRC-TV in Washington, D.C., and before WKYC in Cleveland and KNBC in Los Angeles. WNBQ initially broadcast a minimum of two hours of programming per day.
The station originally proposed WNBY as its call letters. At NBC's request, however, the Federal Communications Commission (FCC) approved an application filed by the network to change the station's calls to WNBQ, a move that was announced on March 3, 1948. NBC officials cited the need to avoid possible confusion with WMBI (1110 AM) and to obtain a callsign that was closer to co-owned NBC Red Network radio station WMAQ (670 AM, now WSCR; and 101.1 FM, now WKQX) as the reasons for the change. The station's first mid-week broadcast came the month following its sign-on when Paul Winchell and Joseph Dunninger were featured on the NBC variety series, The Floor Show. The half-hour program was recorded via kinescope and rebroadcast on WNBQ at 8:30 p.m. on Thursdays.
WMAQ-TV originated several programs for the NBC television network from its original studio facilities—a studio on the 19th floor of the Merchandise Mart on the city's Near North Side—during the 1950s, including Kukla, Fran, and Ollie, featuring Burr Tillstrom and Fran Allison; Garroway at Large, starring Dave Garroway; and Studs' Place, hosted by Studs Terkel. Television critics referred to the broadcasts—often low-budget with few celebrity guests but a good deal of inventiveness—as examples of the "Chicago School of Television".
Reborn as WMAQ-TV (1964–1995)
Although NBC had long owned the WMAQ radio stations, the television station continued to maintain call letters separate from those used by its co-owned radio outlets; this changed on August 31, 1964, when the network changed the station's calls to WMAQ-TV. The call letters of its sister radio station were initially assigned by the government but were used to form the phrase "We Must Ask Questions", which the radio station took as its motto in the 1920s. Although the station's role as a program provider to NBC diminished in the 1960s, WMAQ-TV gathered and distributed more than 200 news footage feeds per month from overseas and the Central United States to NBC News.
On December 3, 1985, NBC s |
https://en.wikipedia.org/wiki/Frank%20Caliendo | Frank Caliendo Jr. (born January 19, 1974) is an American comedian, actor and impressionist, best known for his impersonations on the Fox Network television series MADtv, and as the in-house prognosticator for Fox NFL Sunday. In 2007 and 2008, he performed his impersonations on his own show, Frank TV, which aired on TBS. He is known for his impressions and for his frequent appearances on The Bob & Tom Show. He has released six solo CDs. From 2009 to 2011 he had a show at the Monte Carlo Resort and Casino in Las Vegas.
Early life and education
Caliendo was born in Chicago, Illinois and grew up in Waukesha, Wisconsin, where he attended Waukesha South High School. He is of Italian descent. Before graduating from University of Wisconsin–Milwaukee, Caliendo began performing stand-up comedy at local night clubs and comedy clubs, eventually taking a job as a master of ceremonies at a local comedy club. Within a few years, he was active on the college circuit. Between 2000 and 2001, Caliendo made his television debut on sketch comedy series Hype, later gaining exposure on the comedy series MADtv.
Career
Caliendo has performed stand-up on Premium Blend, Late Show with David Letterman, Late Late Show with Craig Kilborn, The View, The Late Late Show with Craig Ferguson, and Late Night with Conan O'Brien. He was featured in Comedy Central's animated series Shorties Watchin' Shorties in 2004.
His John Madden impression has appeared on Fox NFL Sunday, The Best Damn Sports Show Period and Mohr Sports. Caliendo has also appeared on Comedy Central's Comedy Central Presents, as well as the radio shows The Free Beer and Hot Wings Show, Randy Baumann and the DVE Morning Show, The Dan Le Batard Show, The Dan Patrick Show, The Junkies, Bob & Sheri, The Bob & Tom Show, Mike and Mike in the Morning, Opie and Anthony, The Detroit Cast, The Don and Mike Show, Rise Guys, Bubba the Love Sponge, The John Boy and Billy Big Show, The Howard Stern Show, Mike and the Mad Dog, Elliot in the Morning, The Sports Inferno, The Rick and Bubba Show, The Roe Conn Show, Pardon My Take, The 105.7 WAPL Rick and Len Show, Preston and Steve, Bob and Brian, The Glenn Beck Program, Holmberg's Morning Sickness on 98 KUPD in Phoenix, and Lamont & Tonelli on 107.7 The Bone in San Francisco. From 2001 to 2004, he also made appearances on the KQ Morning Show's annual "Live from Las Vegas" simulcast, appearing on the panel throughout the show and reprising a few bits from his stand-up act. He has also appeared on Garage Logic with Joe Soucheray where he has outshined co-host Matt “Rookie” Michalski’s various impersonations.
Fox NFL Sunday
On November 5, 2000, Caliendo appeared on Fox NFL Sunday; he returned again the same season on January 7 during the playoffs. In 2001 and 2002, Caliendo returned as a semi-regular guest. In 2003, Caliendo joined Fox NFL Sunday as a regular cast member, giving his predictions for the day's NFL games.
On August 2, 2012, Caliendo announced he would not be on Fox |
https://en.wikipedia.org/wiki/Bak | Bak or BAK may refer to:
Computer
Bak file
Betrayal at Krondor, a DOS-based role-playing video game
Bill and keep reciprocal payment in telecommunications systems
Acronyms
Bcl-2 homologous antagonist killer, a protein involved in pro-apoptotic action
Biking Across Kansas
Basic Aeronautical Knowledge
Places
Bäk, a municipality in the district of Lauenburg, in Schleswig-Holstein, Germany
Bąk (disambiguation), several places in Poland
Bak District, Afghanistan
Bak, Hungary
Bäk, Khost Province, Afghanistan
Bak, South Khorasan, Iran
People
Aad Bak (1926–2009), Dutch football player
Arkadiusz Bąk (born 1974), Polish football player
Bąk (surname), Polish surname
Jacek Bąk (born 1973), Polish football player
Justyna Bąk (born 1974), Polish long-distance runner
Mateusz Bąk (born 1983), Polish football player
Nisan Bak or Nissan Beck (1815–1889), Hasidic leader, moderniser and printer in Jerusalem; son of Israel Bak
Per Bak (1948–2002), Danish physicist
Samuel Bak (born 1933), Israeli artist
Stéphane Bak (born 1996), French actor and radio host of Congolese descent
Bek (sculptor) or Bak, ancient Egyptian sculptor
Park (Korean surname) or Bak, common Korean family name
Lauren Haney's Lieutenant Bak series set in Ancient Egypt
Thomas Bak, German artist & art director
Transport
Bakau LRT station (LRT station abbreviation: BAK) in Sengkang, Singapore
Battersea Park railway station (3-Alpha station code: BAK) in London, UK
Columbus Municipal Airport (Indiana) (FAA airport code: BAK), US airport
Heydar Aliyev Airport (previous IATA airport code: BAK, has been changed to: GYD), in Baku, Azerbaijan
Others
BAK (Austria), federal anti corruption agency
BAK (magazine), online arts & design magazine
Backup
Bashkir language (ISO 639 identifier: bak)
Bak (instrument), Korean wooden clapper
'× Bakerara (abbreviation Bak), a genus of orchids
BaK, World War I anti-balloon gun, from the German Ballonabwehrkanone
Benzalkonium chloride drug preservative |
https://en.wikipedia.org/wiki/BRE | BRE, Bre, or BrE may refer to:
Computing
Barren Realms Elite, a multi-player bulletin board system strategy game
Basic regular expression, expressions used for computerized text matching
Business rules engine, a software system to manage and execute business rules
Science
B recognition element, a DNA sequence
benign Rolandic epilepsy, a syndrome
BRE (gene), human gene
Bloom–Richardson–Elston grading system for breast cancer
Organisations
Building Research Establishment, institution in United Kingdom
Language
BrE, common abbreviation for British English
bre (interjection)
Breton language (SIL language code)
Transport
Bremen Airport, Germany (IATA code)
Brentwood railway station (National Rail station code BRE)
Other uses
Bachelor of Religious Education
Berkeley Review of Education, an academic journal
Brè, a village in Switzerland
Brecknockshire, historic county in Wales, Chapman code
Bre people, an ethnic group in Burma
Bustle Rack Extension, a storage bin mounted on the rear of the M1 Abrams tank's bustle rack
Brock Racing Enterprises → Pete Brock |
https://en.wikipedia.org/wiki/J%20Strother%20Moore | J Strother Moore (his first name is the alphabetic character "J" – not an abbreviated "J.") is a computer scientist. He is a co-developer of the Boyer–Moore string-search algorithm, Boyer–Moore majority vote algorithm, and the Boyer–Moore automated theorem prover, Nqthm. He made pioneering contributions to structure sharing including the piece table data structure and early logic programming. An example of the workings of the Boyer–Moore string search algorithm is given in Moore's website. Moore received his Bachelor of Science (BS) in mathematics at Massachusetts Institute of Technology in 1970 and his Doctor of Philosophy (Ph.D.) in computational logic at the University of Edinburgh in Scotland in 1973.
In addition, Moore is a co-author of the ACL2 automated theorem prover and its predecessors including Nqthm, for which he received, with Robert S. Boyer and Matt Kaufmann, the 2005 ACM Software System Award. He and others used ACL2 to prove the correctness of the floating point division operations of the AMD K5 microprocessor in the wake of the Pentium FDIV bug.
For his contributions to automated deduction, Moore received the 1999 Herbrand Award with Robert S. Boyer, and in 2006 he was inducted as a Fellow in the Association for Computing Machinery. Moore was elected a member of the National Academy of Engineering in 2007 for contributions to automated reasoning about computing systems. He is also a Fellow of the AAAI. He was elected a Corresponding Fellow of the Royal Society of Edinburgh in 2015.
He is currently the Admiral B.R. Inman Centennial Chair in Computing Theory at The University of Texas at Austin, and was chair of the Department of Computer Science from 2001–2009.
Before joining the Department of Computer Sciences as the chair, he formed a company, Computational Logic Inc., along with others including his close friend at the University of Texas at Austin and one of the highly regarded professors in the field of automated reasoning, Robert S. Boyer.
Moore enjoys rock climbing.
See also
Boyer–Moore majority vote algorithm
References
External links
"My" Best Ideas (from J Strother Moore's home page)
Boyer–Moore fast string search algorithm
Machines Reasoning about Machines, talk by J Strother Moore given at EPFL in 2011, providing an overview of some of his work
American computer scientists
Formal methods people
Massachusetts Institute of Technology School of Science alumni
Alumni of the University of Edinburgh
University of Texas at Austin faculty
Fellows of the Association for Computing Machinery
Living people
Year of birth missing (living people)
Members of the United States National Academy of Engineering |
https://en.wikipedia.org/wiki/Substitution%20bias | Substitution bias describes a possible bias in economic index numbers if they do not incorporate data on consumer expenditures switching from relatively more expensive products to cheaper ones as prices changed.
Substitution bias occurs when prices for items change relative to one another. Consider how consumer expenditures are reflected in a consumer price index. Consumers will tend to buy more of the good whose price declined, and less of the now relatively more expensive good. This change in consumption may not be reflected in the longstanding market basket from which a consumer price index is constructed. If a selected good is bought by consumers and it is therefore included in the CPI basket, but when an increase in price of that selected good occurs customers may buy a cheaper substitute, while the CPI basket may not quickly capture this change. If product A is purchased by most consumers, and similar product B goes on sale making it cheaper, consumers will naturally buy what is cheaper.
Substitution bias can cause inflation rates to be over-estimated. Data collected for a price index, if from an earlier period, may poorly correspond to the prices and consumer-expenditure-shares going to goods whose prices later changed. To reduce this problem, several steps can be taken by makers of price indices:
Collect price data and expenditure data frequently to capture recent changes, and incorporate both into the indices quickly
Adopt superlative index formulae for price indices, usually Tornqvist indexes or Fisher indexes
Use hedonic index methods to capture attributes of products and their implicit prices; see hedonic regression and the related index problem of quality bias.
References
Price indices |
https://en.wikipedia.org/wiki/Enumerator | Enumerator may refer to:
Iterator (computer science)
An enumerator in the context of iteratees
in computer programming, a value of an enumerated type
Enumerator (computer science), a Turing machine that lists elements of some set S.
a census taker, a person performing door-to-door around census, to count the people and gather demographic data.
a person employed in the counting of votes in an election.
Enumerator polynomial |
https://en.wikipedia.org/wiki/Heureka-Klett | Heureka Klett was a German software engineering company which has made several personal computer games of the sort called "edutainment". They are point-and-click puzzle-adventure games, heavily inspired by Myst for Windows and Mac. These were distributed by Tivola International to be localized for many markets.
On June 1, 2005, Heureka-Klett sold its edutainment software to BrainGame Publishing. The holdings and marketing rights of the 22 games in their back catalogue were transferred.
Seven games in the educational series collectively sold over 500,000 units and won numerous awards.
Titles published
Physikus, localized to Physicus for the English-speaking market, attempts to teach physics by exploring an island whose locks are opened by working machines that illustrate different principles of physics. There also exists Physicus HD and Physicus II.
Bioskopia, localized to Bioscopia for the English-speaking market, attempts to teach biology similarly by having the player try to save a woman explorer who has been attacked by disease-carrying robots once used for experiments. The player must make and supply penicillin to cure her while unlocking hidden areas and exploring the facility.
Opera Fatal, where the player has to search the notes for a blackmailed musician, and therefore has to solve an enormous number of puzzles in the opera building.
Chemikus, localized to Chemicus for the English-speaking market, attempts to teach chemistry by exploring a land whose rooms are linked by an underground railway whose controls are in the form of the periodic table of the elements. The player must set up and perform chemical reactions from substances and objects in his inventory. The plot is in the form of a trying to rescue a friend who has been captured by unseen enemies.
Chemikus 2, the 5th Game of the series and the sequel of Chemikus 1, playing in a similar city, but under an advanced story.
Mathica
Informaticus (awarded Comenius Seal of Quality)
Hystorion
Geograficus
Genius - Task Force Biologie
Genius - Unternehmen Physik
Mission: Amazonas (mission game)
Mission: Schatztaucher (educational game)
Before turning to edutainment only, Heureka-Klett also published a school version of The Interactive Geometry Software Cinderella.
References
Defunct video game companies of Germany |
https://en.wikipedia.org/wiki/Tulip%20Computers | Tulip Computers NV was a Dutch computer manufacturer that manufactured PC clones.
History
It was founded in 1979 as Compudata, as an importer of American microcomputers. Compudata was the distributor for Europe for the Exidy Sorcerer, a Zilog Z80 based home computer. When Exidy gave up on the Sorcerer in 1979, Compudata licensed the design and manufactured them locally for several years.
In 1983 it launched its own PC, the Tulip PC. To achieve 100% compatibility it simply copied the IBM PC, including the BIOS. IBM sued, and after years of litigation, Tulip and IBM settled out of court for an undisclosed amount in 1989. It was listed on the Amsterdam Stock Exchange in 1984. In 1987, Compudata changed its name to Tulip Computers.
Tulip made headlines among Commodore computer enthusiasts when it acquired the Commodore brand name in September 1997, and made headlines again in 2003 and 2004, when it tried to grab a share of the games and entertainment markets with Commodore branded products. In 2000, the Government of Bangladesh cancelled a contract, funded by the Dutch government, with Tulip Computers to supply computers. The Bangladesh government reported the price for the computers were too high. Tulip computers sued the Government of Bangladesh in a court in The Hague and secured a verdict that awarded Tulip computer compensation.
After supposedly making some headway in the market, it sold the Commodore name to Yeahronimo Media Ventures for €22 million. Negotiations began in the end of 2004; the transaction was completed in March 2005. On 27 September 2007, Tulip announced it wanted to buy back the Commodore brand for one dollar per share.
Tulip thought it could make more profit by buying it again, due to the new activities of Commodore on other markets.
Tulip sponsored Crystal Palace Football Club between 1991 and 1993 and eponymous professional cycling teams based in Spain (1989–1990) and Belgium (1990–1992), Tulip Computers. On 26 June 2008, Tulip changed its name to Nedfield NV. Nedfield faced serious problems due to the recession, and filed for suspension of payment after several of its subsidiaries went bankrupt. Nedfield NV itself was pronounced bankrupt by the district court of Utrecht on 3 September 2009.
See also
Tulip System-1, one of the first 16-bit PCs
References
External links
Nedfield.nl on Archive.org
Home computer hardware companies
Defunct computer hardware companies
Defunct companies of the Netherlands
Dutch companies established in 1979
Dutch companies disestablished in 2009
Computer companies established in 1979
Computer companies disestablished in 2009
Companies based in Utrecht (province)
Amersfoort |
https://en.wikipedia.org/wiki/Public%20data%20network | A public data network (PDN) is a network established and operated by a telecommunications administration, or a recognized private operating agency, for the specific purpose of providing data transmission services for the public.
The first experimental public packet switching networks, RETD in Spain and RCP in France were deployed in 1972. "Public data network" was the common name given to the collection of X.25 providers, the first of which were Telenet in the United States and DATAPAC in Canada in 1976, and Transpac in France in 1978. The International Packet Switched Service became the first commercial and international packet-switched network in 1978. The networks were interconnected with gateways using X.75. These combined networks had large global coverage during the 1980s and into the 1990s. The networks later provided the infrastructure for the early Internet.
Description
In communications, a PDN is a circuit- or packet-switched network that is available to the public and that can transmit data in digital form. A PDN provider is a company that provides access to a PDN and that provides any of X.25, Frame Relay, or cell relay (ATM) services. Access to a PDN generally includes a guaranteed bandwidth, known as the committed information rate (CIR). Costs for the access depend on the guaranteed rate. PDN providers differ in how they charge for temporary increases in required bandwidth (known as surges). Some use the amount of overrun; others use the surge duration.
History
Experimental packet switching networks preceded the first public data networks which came into operation in the 1970s. Early examples include: Telenet in the Untied States, which began operation with proprietary protocols and adopted X.25 protocols shortly after they were published in 1976; DATAPAC in Canada, also in 1976, which was the first PDN specifically designed for X.25; RCP/Transpac in France in 1972/1978; EIN/Euronet in the EEC in 1976/1979; EPSS/Packet Switch Stream, in the United Kingdom in 1977/1980; AUSTPAC in Australia 1982; and RETD/Iberpac in Spain, which was the first experimental PDN in 1972 and adopted X.25 in the 1980s. Tymnet and CompuServe in the United States also adopted X.25.
The International Packet Switched Service was the first commercial and international packet-switched network. It was a collaboration between British and American telecom companies that became operational in 1978.
The SITA Data Transport Network for airlines adopted X.25 in 1981, becoming the world's most extensive packet-switching network.
The networks were interconnected with gateways using X.75. These combined networks had large global coverage during the 1980s and into the 1990s.
Over time, other packet-switching technologies, including Frame Relay (FR) and Asynchronous Transfer Mode (ATM) gradually replaced X.25.
Many of these networks later adopted TCP/IP and provided the infrastructure for the early Internet.
Public switched data network
A public switched data |
https://en.wikipedia.org/wiki/Rail%20transport%20in%20Shropshire | The English county of Shropshire has a fairly large railway network, with 19 National Rail stations on various national lines; there are also a small number of heritage and freight lines, including the famous heritage Severn Valley Railway running along its eastern border with Worcestershire.
The majority of the county's public rail services are run by Transport for Wales Rail; the remainder are run by West Midlands Trains (under their West Midlands Railway brand) and Avanti West Coast.
National Rail services
National Rail services in Shropshire are centred about Shrewsbury station (all other 'national rail' stations in Shropshire have a direct train service to Shrewsbury, which is the county town), which is managed by Transport for Wales. The station is at the junction of the Wolverhampton to Shrewsbury Line, Shrewsbury to Chester Line, the Welsh Marches Line (between Cardiff and Manchester) and the Cambrian Line (towards Welshpool). Craven Arms station is at the junction between the Welsh Marches Line and the Heart of Wales Line, although services on the Heart of Wales Line begin at Shrewsbury rather than Craven Arms itself. There are direct train services from Shrewsbury (and elsewhere in the county) to the cities of Manchester, Birmingham and Cardiff, as well as the port at Holyhead where regular ferries to Dublin depart.
There are no electrified railways, as such, in the county despite the surrounding railway nodes of Crewe, Chester and Wolverhampton all being electrified (the funicular Bridgnorth Cliff Railway, although electrically powered, is cable worked). This has meant that since the mid-1990s rail privatisation, there has been a reluctance to establish a direct service to London by the cross-country railway companies (previously British Rail ran direct trains from Shrewsbury to London), notably Virgin Trains West Coast who previously ran services to London Euston from the county in 2000. There was a direct service to London Marylebone, provided by the open-access company Wrexham & Shropshire, which operated from 28 April 2008 to 28 January 2011 and used diesel locomotives. On 11 December 2014, Virgin Trains recommenced direct services between Shrewsbury and London Euston.
Freight only lines
There are two freight only lines in operation in the Telford area. One is the line from Madeley Junction on the Shrewsbury to Wolverhampton Line to Ironbridge Power Station via the historic industrial area of Coalbrookdale. The other is the newly restored line from Wellington to the Telford International Railfreight Park in Donnington which links the Terminal at Donnington with the Shrewsbury to Wolverhampton Line.
There is also the short Abbey Loop line in Shrewsbury which is generally only used by freight trains.
The Gobowen to Blodwell line, which runs through Oswestry, has been a mothballed line since the 1980s. It previously served a small number of stone quarries in the area. In 2008 the line was bought by Shropshire County Council and |
https://en.wikipedia.org/wiki/WVUA-CD | WVUA-CD (channel 7) is a low-power, Class A television station licensed to both Tuscaloosa and Northport, Alabama, United States, affiliated with the classic television network Cozi TV. Owned by the University of Alabama, the station maintains studios and transmitter facilities within the Digital Media Center at Bryant–Denny Stadium on the University's campus in Tuscaloosa.
As WVUA-CD's broadcasting radius does not reach the entire Birmingham–Tuscaloosa–Anniston market, the station's programming is simulcast to the remainder of the area on full-power satellite WVUA (channel 23), which is also licensed to Tuscaloosa with its transmitter located atop Red Mountain, near the southern edge of Birmingham.
In addition to full-power WVUA, WVUA-CD's signal is relayed on low-power digital translator WDVZ-CD (channel 3) in Tuscaloosa.
Overview
Despite being owned by the University of Alabama System, the station is financially independent from the University of Alabama. WVUA is licensed and operates as a commercial television station, and as such, most of its funding is generated from advertising revenue; WVUA/WVUA-CD is one of only two commercial television stations in the United States that is owned by a public institution, alongside University of Missouri-owned NBC affiliate KOMU-TV in Columbia, Missouri. The station has a full-time paid professional staff including station and advertising sales executives, production and news department staff (including anchors, reporters and a news director), and relies heavily on University of Alabama students who act as on-air and production staff, and sales assistants.
History
The station's original construction permit, for operation on UHF channel 49, was issued by the Federal Communications Commission (FCC) in 1994 under the call letters W49BO; the permit was held by Krypton Broadcasting, who intended to operate the station as a repeater of Birmingham independent station WABM (channel 68). Channel 49 first signed on the air in 1998 as WJRD-LP, broadcasting on UHF channel 49. It originally operated out of studio facilities located on Jug Factory Road in Tuscaloosa, that formerly housed the operations of WDBB (channel 17) until the shutdown of its news department in December 1995. The station became a charter affiliate of Pax TV (now Ion Television) when the network launched on August 31 of that year; in August 1999, WJRD-LP became the secondary Pax TV outlet for the Birmingham–Tuscaloosa–Anniston market, when the network's parent company Paxson Communications (now Ion Media) converted its CBS affiliate in Gadsden, WNAL-TV (channel 44), into a Pax owned-and-operated station under the callsign WPXH-TV.
The University of Alabama acquired WJRD-LP in 2001, as part of a $1 million gift from the family of Alabama Crimson Tide football coach Paul "Bear" Bryant. Once the donation was finalized, the station moved its operations to the University of Alabama campus. In January 2002, its call letters were changed to WVUA-CA |
https://en.wikipedia.org/wiki/Cream%20%28software%29 | Cream is a configuration of the Vim text editor that consists of a set of scripts which can be run within Vim to make it behave more like an editor now common to most personal computers which conform to the Common User Access standards of interface and operability.
Through pulldown menus, keyboard shortcuts, and extensive editing functions, Cream tries to make Vim more approachable for novice users and adds features for those more experienced. These are provided through Vim's extensibility, without any special customizations to Vim itself.
Cream's name is a play on the idea of the coffee tamper: Both soften something stronger and more sophisticated, and neither can stand alone.
References
External links
Free text editors
Linux text editors
Windows text editors |
https://en.wikipedia.org/wiki/Pixar%20Image%20Computer | The Pixar Image Computer is a graphics computer originally developed by the Graphics Group, the computer division of Lucasfilm, which was later renamed Pixar. Aimed at commercial and scientific high-end visualization markets, such as medicine, geophysics and meteorology, the original machine was advanced for its time, but sold poorly.
History
Creation
When George Lucas recruited people from NYIT in 1979 to start their Computer Division, the group was set to develop digital optical printing, digital audio, digital non-linear editing and computer graphics. Computer graphics quality was just not good enough due to technological limitations at the time. The team then decided to solve the problem by starting a hardware project, building what they would call the Pixar Image Computer, a machine with more computational power that was able to produce images with higher resolution.
Availability
About three months after their acquisition by Steve Jobs on February 3, 1986, the computer became commercially available for the first time, and was aimed at commercial and scientific high-end visualization markets, such as medical imaging, geophysics, and meteorology. The machine sold for $135,000, but also required a $35,000 workstation from Sun Microsystems or Silicon Graphics (in total, ). The original machine was well ahead of its time and generated many single sales, for labs and research. However, the system did not sell in quantity.
In 1987, Pixar redesigned the machine to create the P-II second generation machine, which sold for $30,000. In an attempt to gain a foothold in the medical market, Pixar donated ten machines to leading hospitals and sent marketing people to doctors' conventions. However, this had little effect on sales, despite the machine's ability to render CAT scan data in 3D to show perfect images of the human body. Pixar did get a contract with the manufacturer of CAT Scanners, which sold 30 machines. By 1988 Pixar had only sold 120 Pixar Image Computers.
In 1988, Pixar began the development of the PII-9, a nine slot version of the low cost P-II. This machine was coupled with a very early RAID model, a high performance bus, a hardware image decompression card, 4 processors (called Chaps or channel processors), very large memory cards (VME sized card full of memory), high resolutions video cards with 10-bit DACs which were programmable for a variety of frame rates and resolutions, and finally an overlay board which ran NeWS, as well as the 9 slot chassis. A full-up system was quite expensive, as the 3 GiB RAID was $300,000 alone. At this time in history most file systems could only address 2 GiB of disk. This system was aimed at high-end government imaging applications, which were done by dedicated systems produced by the aerospace industry and which cost a million dollars a seat. The PII-9 and the associated software became the prototype of the next generation of commercial "low cost" workstations.
Demise and legacy
In 1990, the Pix |
https://en.wikipedia.org/wiki/Context%20mixing | Context mixing is a type of data compression algorithm in which the next-symbol predictions of two or more statistical models are combined to yield a prediction that is often more accurate than any of the individual predictions. For example, one simple method (not necessarily the best) is to average the probabilities assigned by each model. The random forest is another method: it outputs the prediction that is the mode of the predictions output by individual models. Combining models is an active area of research in machine learning.
The PAQ series of data compression programs use context mixing to assign probabilities to individual bits of the input.
Application to Data Compression
Suppose that we are given two conditional probabilities, and , and we wish to estimate , the probability of event X given both conditions and . There is insufficient information for probability theory to give a result. In fact, it is possible to construct scenarios in which the result could be anything at all. But intuitively, we would expect the result to be some kind of average of the two.
The problem is important for data compression. In this application, and are contexts, is the event that the next bit or symbol of the data to be compressed has a particular value, and and are the probability estimates by two independent models. The compression ratio depends on how closely the estimated probability approaches the true but unknown probability of event . It is often the case that contexts and have occurred often enough to accurately estimate and by counting occurrences of in each context, but the two contexts either have not occurred together frequently, or there are insufficient computing resources (time and memory) to collect statistics for the combined case.
For example, suppose that we are compressing a text file. We wish to predict whether the next character will be a linefeed, given that the previous character was a period (context ) and that the last linefeed occurred 72 characters ago (context ). Suppose that a linefeed previously occurred after 1 of the last 5 periods () and in 5 out of the last 10 lines at column 72 (). How should these predictions be combined?
Two general approaches have been used, linear and logistic mixing. Linear mixing uses a weighted average of the predictions weighted by evidence. In this example, gets more weight than because is based on a greater number of tests. Older versions of PAQ uses this approach. Newer versions use logistic (or neural network) mixing by first transforming the predictions into the logistic domain, log(p/(1-p)) before averaging. This effectively gives greater weight to predictions near 0 or 1, in this case . In both cases, additional weights may be given to each of the input models and adapted to favor the models that have given the most accurate predictions in the past. All but the oldest versions of PAQ use adaptive weighting.
Most context mixing compressors predict one bit of input |
https://en.wikipedia.org/wiki/TVC | TVC may refer to:
Television
TVC News, a Nigerian television channel
TVC Communications, a former television equipment distributor
TVC, trade jargon for television commercial
TVC Networks, a Mexican cable network conglomerate, parent of TVC Deportes
Televicentro (Honduras) (TVC), a broadcasting conglomerate
BBC Television Centre, the former headquarters of BBC Television
Televisió de Catalunya, Catalonia's public broadcasting network
Televisión Canaria, a Canarian television channel
TV Centre (Russia), a Russian television network
Places
Cherry Capital Airport, (IATA code TVC, FAA LID code: TVC) serving Traverse City, Michigan
Thiruvananthapuram Central railway station (station code: TVC)
Other uses
Tatsunoko vs. Capcom: Ultimate All-Stars, a 2008 fighting game
Thrust vector control, a method of steering aircraft and missiles
Tinea versicolor, spots on the skin caused by yeast
Total viable count, a measure of microorganisms
Traditional Values Coalition, a United States conservative Christian group
TVC (computer), a Hungarian home computer made in the 1980s
See also
"TVC 15", a song by David Bowie |
https://en.wikipedia.org/wiki/UID | UID may refer to:
Identifying numbers
Unique identifier and instances or systems thereof
In computing
Unique identifier for a specific user of a computer system
Unique ID for the Mifare series of chips (integrated circuits) used in contactless smart cards and proximity cards.
Unique ID of a message in a folder on an IMAP server
User identifier (Unix), a code identifying each user on a Unix and Unix-like systems
Globally unique identifier (GUID)
Universally unique identifier (UUID)
In other areas
PubMed 'Unique Identifier' parameter (PMID) designating specific scientific publication abstracts (PubMed § PubMed identifier)
'Unique Item Identifier', a specific value in the IUID (Item Unique Identification) system used by the United States Department of Defense for the identification of accountable equipment according to DoD Instruction 5000.64
Aadhaar number, originally the Unique Identification Number, an initiative of the Unique Identification Authority of India (UIDAI) of the Indian government to create a unique ID for every Indian resident
uID Center, a nonprofit organization in Tokyo, Japan, responsible for the Ucode system for uniquely identifying real-world objects electronically
German for: "UID = Umsatzsteuer Identifikation" (English: VAT identification number, VAT = value-added tax)
Organizations
Ulster Institute for the Deaf
Umeå Institute of Design
Unitedworld Institute of Design, college in India
Other uses
Unidentified decedent, a deceased person whose body has not yet been identified
Unintelligent Design, a satirical reaction to the Intelligent Design movement
Unit Identification, an LED used as a means of locating a specific computer server in a server room
Universal Instructional Design, an educational method that tries to deliver teaching to meet the needs of wide variety of learners
User interface design, device design with the focus on the user's experience and interaction
See also
IUD |
https://en.wikipedia.org/wiki/Stealware | Stealware refers to a type of malware that covertly transfers money or data to a third party.
Specifically, stealware uses an HTTP cookie to redirect the commission ordinarily earned by the site for referring users to another site.
The term “Stealware” falls under the category of Spyware. Spyware are software applications that collect information about users without their permission instead of directly harming devices. Both of these terms, in the broader classification, fall under the category of Malware. Due to their broad definitions, Spyware and Malware both refer to a lot of different types of Malicious Software and in the more niche sense, stealware is any type of malicious software that "redirects the payment of affiliate marketing revenues from the legitimate affiliate to the spyware vendor by placing the spyware operator's affiliate tag on the user's activity or replacing any other tag, if there is one." The niche aspect of the term stealware makes it a less known and rarely used term. Hence, it is more generalized as a type of spyware in mainstream usage.
Stealware has also broadened its capabilities through the manipulation of online banking systems. In a more mainstream term, this is known as banking malware. This malicious software manipulates online banking transactions and launders the stolen money to the operator of the malware.
References
External links
Definition at Spyware.co.uk
Internet Protocol based network software
Types of malware |
https://en.wikipedia.org/wiki/The%20Challenge%20%28TV%20series%29 | The Challenge (originally known as Road Rules: All Stars, followed by Real World/Road Rules Challenge) is a reality competition show on MTV that is a spin-off of two of the network's reality shows, The Real World and Road Rules. Premiering in 1998, it originally featured alumni from these two shows, casting for The Challenge has slowly expanded to include contestants who debuted on The Challenge itself, alumni from other MTV franchises including Are You the One?, Ex on the Beach (Brazil, UK and US), Geordie Shore, siblings and friends, and from other non-MTV shows, competitions, and modeling. The contestants compete against one another in various extreme challenges to avoid elimination. The winners of the final challenge win the competition and typically share a large cash prize. The Challenge is currently hosted by T. J. Lavin.
The series premiered on June 1, 1998. The show was originally titled Road Rules: All Stars, and had notable Real World alumni participated in a Road Rules style road-trip. It was renamed Real World/Road Rules Challenge for the 2nd season, then later abridged to simply The Challenge by the show's 19th season. Since the fourth season, each season has supplied the show with a unique subtitle, such as Rivals. Each season consists of a format and theme from which the subtitle is derived.
The show's current season, Battle for a New Champion, premiered on October 25, 2023.
Overview
The Challenge casts are season-specific as the cast varies from season to season. The casts are made up of contestants originating from one of The Challenge's related TV programs and, in a few seasons, previously unknown contestants. The cast usually contains both "veterans" (or vets) and "rookies". Veterans are thought of as players that have won at least one Challenge season or have appeared on several seasons of the show; Rookies refer to newer players. Many recent alumni come from various reality shows including Survivor, The Amazing Race, Are You the One?, Big Brother, Ex on the Beach and Love Island.
A season's typical multitude of cast members are usually divided up into separate teams or pairs according to a certain criteria, which varies from season to season. The criteria that teams have been arranged by over the show's history have ranged from gender, the contestants' original show, heroic/villainous status, rivals, countries, family members and ex-romantic partners of contestants. Each of the opposing teams compete in numerous missions in order to win prizes and advance in the overall game. The format of the competition varies by season. In elimination rounds, contestants or teams compete against one another to determine which one is eliminated from the season. Each season has its own, very distinct elimination round, distinguished from those of other seasons in title, design, and general atmosphere. Determining which two teams or two cast members are sent into the episode's elimination round frequently leads to drama and dirty gamepla |
https://en.wikipedia.org/wiki/Information%20Bridge%20Framework | Information Bridge Framework is a Microsoft Office programmability framework from Microsoft targeting Microsoft Office 2003 and later versions. It can be used to extract data from Office documents or embedding functionality of Office applications in custom applications.
External links
Microsoft Office Information Bridge Framework
Microsoft application programming interfaces
Microsoft Office |
https://en.wikipedia.org/wiki/Trilogy%20of%20Error | "Trilogy of Error" is the eighteenth episode of the twelfth season of the American animated television series The Simpsons, and the 266th episode overall. It originally aired on the Fox network in the United States on April 29, 2001. In the episode, Homer's rush to the hospital to re-attach his severed thumb, Lisa's rush to school to win the science fair, and Bart's run-in with an illegal fireworks scheme are interconnected as each act tells the events of the same day, but from a different point of view.
"Trilogy of Error" was directed by Mike B. Anderson and written by Matt Selman. The episode, initially titled "Go, Simpson Go", was initially pitched by Selman who figured the whole plot out before pitching it. The episode features a guest appearance from Malcolm in the Middle star Frankie Muniz as Thelonious, while Joe Mantegna reprises his role as recurring character Fat Tony.
The episode has received positive reviews since its original airing and Selman named it the best episode he has ever written.
Plot
The episode takes place over a single day, which starts when Homer, Bart and Lisa are called down to breakfast by Marge only to find a sticky, gooey cereal called mueslix, which they do not want to eat. While Bart excuses himself to answer the door for Milhouse, Lisa helps Homer come up with an excuse to avoid eating breakfast.
Homer's day
Lisa shows Homer her project for the school science fair, a grammar robot named Linguo, which Homer breaks by pouring beer down his throat. Shortly after, Marge accidentally severs Homer's thumb as she is cooking, and Santa's Little Helper runs around with the severed thumb, forcing Homer to chase him for it. Marge calls the police, but when they mistake her for an attempted murderer, she gives them a fake address (123 Fake Street). After Homer retrieves the thumb, he and Marge drive to the hospital; along the way they crash into Rainier Wolfcastle's car and then steal it. At the hospital, Dr. Hibbert claims that their finger insurance will not cover the cost as thumbs are not included, so they drive off for Dr. Nick's clinic. Since Homer's thumb is starting to shrivel, he stops at Moe's, where he gets a brine solution. He gets distracted when Moe offers him a beer, and then passes out. When Barney wakes him up with coffee, Homer rushes out and sees Marge is gone. He hitchhikes with Cletus who drives him to Dr. Nick's, but they discover the clinic is on fire. Homer asks Cletus to drive him to Shelbyville Hospital, but his truck gets stolen, leaving Homer to walk to the hospital. His thumb is almost completely shriveled up now, and he is about to throw it in a garbage can when an explosion blasts Linguo's head in the air and it lands next to Homer.
Lisa's day
Lisa has to fix Linguo after Homer breaks him, missing the school bus as a result. Her bike is stolen and Marge and Homer drive off without her, so she runs around town before getting a ride from Krusty and his driver Mr. Teeny. However, Mr. Teeny m |
https://en.wikipedia.org/wiki/%C3%89ric%20Chahi | Éric Chahi is a French computer game designer and programmer, best known as the creator of Another World (also known as Out of This World in North America) and Heart of Darkness.
Career
Éric Chahi started programming on Oric Atmos and Amstrad in 1983 for the company Loriciels. He worked on games such as Jeanne d'Arc and Voyage au centre de la Terre published for Chip. In 1989 Éric Chahi quit Chip to join Delphine Software International to work on the graphics for Future Wars, a game designed by Paul Cuisset. After this, over a period of two years, Chahi developed Another World (released in 1991) on his own, only soliciting help for the music score. Another World went on to receive critical acclaim for its atmosphere and minimalism, becoming a cult classic.
After leaving Delphine, Chahi founded Amazing Studio and became one of several designers that were working on Heart of Darkness, a side-scrolling game. It suffered numerous delays, and was in development for six years. When Infogrames finally published it in 1998, it was negatively received by critics due to its short length and by-then dated graphics, though the graphics of the PlayStation port were praised.
Chahi disappeared from the game industry for some years but returned to making games with Ubisoft in the 2010s. In April 2005 he released a free Game Boy Advance version of Another World. It was created in collaboration with a programmer named Cyril Cogordan, who originally started it as a fan project. It can be played using a GBA flash cartridge or emulator.
A version of Another World for mobile phones was made with the help of developer Magic Productions and released in 2005. On April 14, 2006, Chahi and Magic Productions released an updated PC version of Another World which featured remade graphics and ran on modern versions of Microsoft Windows. This HD version was ported to Xbox One, PlayStation 3, PlayStation 4, PS Vita, 3DS and Wii U in June 2014 as a 20th-anniversary edition.
On June 14, 2010, a trailer for Chahi's new game named From Dust was shown at E3. The game was released on July 27, 2011, on Xbox Live Arcade as part of the 2011 Summer of Arcade, is described as a mix between Populous and Black and White. It was also released on the PC later on August 17, 2011, and later was released for the Chrome web browser.
In December 2012, Another World was added to the collection of the New York Museum of Modern Art.
In November 2014, he made a 3D Interactive Lava Simulator for the Volcano Museum La Cité du Volcan on Réunion Island near Madagascar.
In 2016, he created the indie video game studio Pixel Reef in Montpellier, France to work on a new title Paper Beast, a title set to be released on PlayStation VR in 2019 and PlayStation 4 in 2020. This project came out of the work he did for the Réunion Volcano Museum while studying the island's Piton de la Fournaise volcano for these simulations. Chahi started Pixel Reef, along with Sahy and two others after the museum project was |
https://en.wikipedia.org/wiki/Charles%20Molnar | Charles Edwin Molnar (1935–1996) was a co-developer of one of the first minicomputers, the LINC (Laboratory Instrument Computer), while a graduate student at the Massachusetts Institute of Technology (MIT) in 1962. His collaborator was Wesley A. Clark.
The LINC originated decades before the advent of the personal computer. Its development was the result of a National Institutes of Health (NIH) program that placed 20 copies of an early LINC prototype in selected biomedical research laboratories nationwide. Later, the LINC was produced in greater numbers by Digital Equipment Corporation and other computer manufacturers. Later he was on the faculty of Washington University in St. Louis.
Charlie Molnar was also well known as a pioneer in the modeling of the auditory system, especially numerical models of the function of the cochlea (the inner ear).
When he died in 1996, he was working at Sun Microsystems on asynchronous circuits with Ivan Sutherland.
Molnar received a bachelor's degree (1956) and a master's degree (1957) in electrical engineering from Rutgers University, where he was a member of the Cap and Skull Society, and received a doctoral degree (1966) from MIT in electrical engineering.
Important publications
Molnar's significant publications included the following:
Clark, W.A. and C.E. Molnar, 1964, "The LINC," Anal. New York Academy of Sciences, Vol 115, pp. 653–658.
Clark, W.A. and C.E. Molnar, 1965, "A Description of the LINC," Computers in Biomedical Research, Vol II, B.D. Waxman and R. Stacey, eds, Academic Press, New York, NY.
Model for the Convergence of Inputs Upon Neurons in the Cochlear Nucleus, D.Sc. Thesis, MIT, 1966.
Chaney, T.J. and C.E. Molnar, "Anomalous Behavior of Synchronizer and Arbiter Circuits," IEEE Trans. on Computers, Vol. C-22, No. 4, pp. 421–422, Apr. 1973.
Kim, D.O., C.E. Molnar, and R. R. Pfeiffer, 1973, "A system of nonlinear differential equations modeling basilar-membrane motion," J. Acoust. Soc. Am. 54(6):1517–29 Dec. 1973.
Clark, W.A. and C.E. Molnar, 1974, "Macromodular Computer Systems," Computers in Biomedical Research, pp. 45–85, Vol IV, B.D. Waxman and R. Stacey, eds, Academic Press, New York, NY.
Kim, D.O. and C.E. Molnar: Cochlear mechanics: Measurements and models, in The Nervous System, Vol. 3, Human Communication and Its Disorders, edited by DB Tower (Raven, New York) 1975; pp 57–68
Sproull, R.F., I.E. Sutherland, and C.E. Molnar, 1994, "The Counterflow Pipeline Architecture," IEEE Design and Test of Computers, Vol. 11, no.3, pp. 44–59.
References
External links
Obituary at Auditory list
Photo with LINC at Computer History Museum
American computer scientists
MIT School of Engineering alumni
Washington University in St. Louis faculty
1935 births
1996 deaths
Rutgers University alumni |
https://en.wikipedia.org/wiki/Business%20Application%20Programming%20Interface | Business Application Programming Interface (BAPI) is used in mySAP to achieve business related functionalities. It is a remote-enabled function module which is provided by SAP.
Description
BAPIs enable access to SAP functions across formal, stable and dialog-free interfaces. These interfaces can be used by external applications developed by customers and complementary software partners as well as by other SAP applications. Defined as API methods of SAP Business Object Types, these object types are used within the Business Framework to enable object-based communication between components.
Business objects and their BAPIs enable object orientation to be used in central information processing in companies. For example, existing functions and data can be re-used, trouble-free technical interoperability can be achieved and non-SAP components can be implemented. Applications can use BAPIs to directly access the application layer of the R/3 System and, as clients, applications can use the business logic of the R/3 System. BAPIs provide the client with an object-oriented view of the application objects without needing to know the implementation details. BAPIs are always developed by defining scenarios which are used to map and implement system-wide business processes.
References
Application programming interfaces
SAP SE |
https://en.wikipedia.org/wiki/National%20Olympiad%20in%20Informatics | The National Olympiad in Informatics in computing usually refers to the a national competition of a particular country, which usually is the course of selection of the country's top team or persons to participate in the International Olympiad in Informatics. Examples are:
Philippines : National Olympiad in Informatics - Philippines
China :
Singapore : National Olympiad in Informatics, Singapore
Greece : National Greek Competition in Informatics
References
Information science |
https://en.wikipedia.org/wiki/Hacker%20%28card%20game%29 | Hacker is a dedicated deck card game for 3–6 players published by Steve Jackson Games (SJG) in 1992.
History
In early 1990, SJG was developing a game called GURPS Cyberpunk. On March 1 of that year, the company was raided by the United States Secret Service as part of a nationwide investigation of data piracy. The agents took computers, printers, hard drives, at least one pocket calculator, over 300 floppy disks, and an entire BBS server. In the court case that followed, the Secret Services justified their actions by calling GURPS Cyberpunk "a handbook for computer crime".
In 1992, SJG made a card game called Hacker based on the Secret Service's beliefs.
In 1993, SJG released the supplement Hacker II: The Dark Side, which added new rules and new cards to the gameplay.
Gameplay
The original game has 110 cards, 172 die-cut cardboard counters, 53 thin cardstock counters, two network ID cards, and a plastic ziplock bag.
The players use cards to construct a computer network, and then roll dice to try and infiltrate the system. Successful entry gains access to new systems, or the ability to crash the system or upgrade the player's equipment. If too many hackers try to infiltrate the same system, it initiates a system housecleaning. A player can also be raided by the FBI or Secret Service.
The first player to gain access to 12 systems wins the game.
Reception
Allen Varney reviewed the game twice for Dragon:
In the September 1992 edition (Issue 185), Varney found the game didn't have enough player interaction. Varney also didn't like the length of the game, which he felt went on too long because "When a Hacker game player pulls ahead of the pack and becomes 'Net Ninja', the others can bring down the Ninja easily, leading to a draggy war of attrition." Varney concluded, "[Steve] Jackson has made a fair hack at the subject... but he should have debugged a few more times before running it."
A year later, in the December 1993 edition Varney gave a retrospective thumbs down to the game because of the lack of differentiation between players' roles. "Though individual roles aren’t vital, it helps when a social game gives each player a unique identity — a particular game position, a special power, or just a name. Hacker misses a bet on this count."
Awards
Hacker won the 1992 Origins Award for Best Modern-Day Boardgame.
Hacker II won the 1993 Origins Award for Best Modern-Day Boardgame.
Reviews
Challenge #67 (December 1992)
Casus Belli #71 (Sep 1992)
References
External links
The official Hacker home page
The official Hacker rules
Cyberpunk_games
Dedicated deck card games
Steve Jackson (American game designer) games
Origins Award winners
Steve Jackson Games games |
https://en.wikipedia.org/wiki/Gerald%20Chamales | Gerald "Jerry" Chamales is an American entrepreneur, film producer and philanthropist. Chamales was the founder of Rhinotek Computer Products, a revolutionary printer cartridge manufacturer and retailer. In 2001, he was awarded the Ernst & Young Entrepreneur of the Year Award for business service. Chamales has since forged a successful career in the film industry as a producer of The Irishman, which went on to garner 10 nominations at the 92nd Academy Awards. He also produced the acclaimed animated short If Anything Happens I Love You, which was named Best Animated Short Film at the 93rd Academy Awards.
In addition to his work in the tech industry and in film, Chamales is a noted philanthropist, with decades of experience helping those recovering from alcoholism and substance addiction. He has also been an active proponent of wildlife conservation in Kenya, particularly efforts to protect the black rhino.
Early life
Chamales was born into a Greek family, and spent his early life in a foster home, before moving back in with his single mother. His father was Tom T. Chamales, a World War II veteran and celebrated author who wrote Never So Few in 1957, based on his real life experiences serving in wartime Burma. This was later adapted into a film starring Frank Sinatra and providing Steve McQueen with one of his earliest roles. Chamales began taking drugs and drinking as a teenager, which led to a period of addiction, failed treatment and homelessness. Chamales ultimately decided to turn his life around and turned to sobriety and his innovative idea for a fledgling tech company.
Business career
In 1980, Chamales founded what is now known as Rhinotek Computer Products, a revolutionary printer cartridge company. Chamales founded the company in his Venice, California studio apartment, with only $7000 in his pocket, and paid himself only $200 per month in salary for the first 5 years. He even started the business on a card table, where he made his initial sales. In 1985, he moved the business venture into an office in Santa Monica, California and expanded again 2 years later by hiring 15 new employees. By taking business classes at UCLA and closely studying the industry, Chamales was able to turn the company to a rapidly growing business, and eventually built a manufacturing plant in Carson, California that included major production capabilities and two floors of call centers.
By 1998, Chamales had built what was then known as Omni Computer Products into a major force in the printer business, with 250 employees and $25.5 million in sales. That number would rise to $45 million by 2002. Omni was known for a cutting edge manufacturing approach and significant discount compared to their competitors. Omni's relatively small size and innovative strategy allowed it to undercut a printer cartridge market that had long been dominated by near-monopolies like Hewlett-Packard. When asked about this, Chamales stated that while there is nothing wrong with making |
https://en.wikipedia.org/wiki/M-Net | M-Net (an abbreviation of Electronic Media Network) is a South African pay television channel established by Naspers in 1986. The channel broadcasts both local and international programming, including general entertainment, children's series, sport and movies. While the TV signal is generally encrypted, M-Net showed some programmes 'free to air' in its "Open Time" slot between 5 p.m. and 7 pm, until the slot closed on 1 April 2007.
In the early 1990s, M-Net added a second analogue channel called Community Services Network (CSN), and began digital broadcasting via satellite to the rest of Africa, via its sister company MultiChoice. With the introduction of MultiChoice's multi-channel digital satellite TV service, DStv, in 1995, several different channels have been created to complement the original M-Net channel, including the now-defunct M-Net Series and several film/movie channels based on genre and preference.
History
Early years
The idea of a pay-TV network in South Africa came to life in the mid-1980s, when Nasionale Pers (Naspers) — headed by executive Koos Bekker — started to promote the idea to the country's other three largest media corporations: Times Media Ltd (now Avusa/BDFM), Argus (now the Independent Group) and Perskor (which is now defunct).
The newspapers and magazines published by Naspers had lost a lot of advertising revenue to the SABC after the arrival of television and for this reason, according to some sources, the National Party government wanted Naspers to run its own television network.
Initially, the plan was for M-Net to be jointly owned by the four media corporations, with the Natal Witness also having a small share in the station. However, as time went on, the project became that of Naspers only.
In October 1986, they started broadcasting for 12 hours a day, to about 500 households who had bought decoders. (Their aim at that stage was to sell 9,000 decoders per month.) The service used the Oak Orion scrambling system, and the decoders were manufactured in South Africa by the local affiliate of Matsushita Electric.
Although it was subscription-based, the Broadcasting Authority granted them a one-hour time slot each day, in which the channel could broadcast unencrypted, free-to-air content, in order to promote itself and attract potential subscribers. In 1987, the Cabinet also approved an arrangement under which the SABC was required to make its TV4 channel available to M-Net between 6 and 7pm. This time slot became known as Open Time, but was only meant to be temporary — M-Net was supposed to close Open Time immediately when it had 150,000 subscribers.
At the end of its first year, they recorded a loss of R37 million. However, it pushed forward and eventually, the public started taking notice. After two years, the loss was turned into a R20 million profit. In 1988, the channel launched Carte Blanche, a multi-award-winning actuality program hosted by Derek Watts and Ruda Landman. In only a few years, Carte Blanc |
https://en.wikipedia.org/wiki/Wimp | Wimp, WIMP, or Wimps may refer to:
Science and technology
Weakly interacting massive particle, a hypothetical particle of dark matter
WIMP (computing), the "window, icon, menu, pointer" paradigm
WIMP (software bundle), the web stack of Windows, IIS, MySQL, and PHP/Perl/Python
Arts and entertainment
WiMP, a defunct music streaming service
WURH-CD (former call signs WIMP-LP, WIMP-CA, and WIMP-CD), a television station licensed to serve Miami, Florida, US
Wimps (band), a US punk rock band
Wimp, played by Rick Lawless, a character on the TV sitcom Herman's Head
People
Wimp Sanderson (born 1937), retired basketball coach known as "Wimp"
Kay Davis or Katherine McDonald Wimp (1920–2012), jazz singer
Mary Baumgartner, also known as "Wimp" (1930–2018), former female baseball catcher
derogatory term for a coward
See also
Farkle (Wimp Out), a dice game that has also been called or is similar to 1000/5000/10000, Cosmic Wimpout, Greed, Hot Dice, Squelch, Zilch, or Zonk
"The Diary of Horace Wimp", a track on the Electric Light Orchestra album Discovery
WIMP Argon Programme, a cold dark matter experiment at Laboratori Nazionali del Gran Sasso, Italy
Wimpy (disambiguation)
ru:WIMP |
https://en.wikipedia.org/wiki/ShmooCon | ShmooCon is an American hacker convention organized by The Shmoo Group. There are typically 40 different talks and presentations on a variety of subjects related to computer security and cyberculture. Multiple events are held at the convention related to cryptography and computer security such as Shmooganography, Hack Fortress, a locksport village hosted by TOOOL DC, and Ghost in the Shellcode. ShmooCon 2021 was not held in January due to the COVID-19 pandemic. The next event is set for January 20-22, 2023
History
From 2005 to 2010, ShmooCon was held at the Marriott Wardman Park in Washington, D.C.
ShmooCon VII and VII (2011–2012) were held at the Washington Hilton in Washington, D.C.
ShmooCon IX was held at the Hyatt Regency Washington in Washington, D.C.
ShmooCon X and later returned to the Washington Hilton in Washington, D.C.
ShmooCon I: February 4–6, 2005: ≈ 400 attendees
ShmooCon II: January 13–15, 2006: ≈ 700 attendees
ShmooCon III: March 23–25, 2007: Sold out; > 900 attendees
ShmooCon IV: February 15–17, 2008: Sold out; > 1200 attendees
ShmooCon V: February 6–8, 2009: Sold out; > 1600 attendees
ShmooCon VI: February 5–7, 2010: Sold out; around 1600 attendees
ShmooCon VII: January 28–30, 2011: Sold out; > 1600 attendees
ShmooCon VIII: January 27–29, 2012: Sold out; > 1800 attendees
ShmooCon IX: February 15–17, 2013: Sold out; > 1600 attendees
ShmooCon X: January 17–19, 2014: Sold out; > 1900 attendees
ShmooCon XI: January 16–18, 2015: Sold out; > 1900 attendees
ShmooCon XII: January 19–21, 2016: Sold out; > 1500 attendees
ShmooCon XIII: January 13–15, 2017: Sold out; ≈ 2200 attendees
ShmooCon XIV: January 19–21, 2018: Sold out; ≈ 2200 attendees
ShmooCon XV: January 18–20, 2019: Sold out; ≈ 2200 attendees
ShmooCon XVI: January 31 – February 2, 2020; ≈ 2175 attendees
ShmooCon XVII: March 24 – March 26, 2022; ≈ 2000 attendees
Research presented at ShmooCon
ShmooCon seeks to select talks that are original research and have not been presented at other conventions.
Charitable efforts
Every year ShmooCon supports multiple charities, such as the Electronic Frontier Foundation and Hackers for Charity, by sponsoring T-shirt sales. Attendees are provided the opportunity to donate a fixed amount of money for a charity in exchange for a T-shirt.
References
External links
ShmooCon website
ShmooCon "find a room" mailing list
Hacker conventions
Recurring events established in 2005 |
https://en.wikipedia.org/wiki/Quality%20bias | Quality bias in price indices is a kind of mismeasurement if they do not incorporate data on the quality of goods from period to period, as well as their nominal price.
Personal computers are a canonical case. Because of improvements in computer chips, greater and greater speeds and features have become available, without substantial increases in price. If only price information on personal computers were used, quality bias would cause growth in a consumer price index (CPI) to be overestimated, since an equivalent computer would actually be much cheaper in later periods.
Determining quality
Quality bias can work both ways. Faster computers with enhanced performance require greater memory and more expensive support software. Most personal computers were previously bundled with software, but now come only with a basic operating system and a requirement for the purchaser to purchase the bundled software after a "trial period", so the actual value per dollar is much lower. Obsolescence is built into most personal electronics, shortening their useful live, again lowering the actual value. All these issues make the quality bias tend to be negative rather than positive. As products and the manufacturing methodology advances, the cost of manufacture is expected to go down, and improved products are part of every product life cycle, and many products go through repeated cycling. An example is the automobile. Quality bias is most often seen in a negative manner in the cases of mature products as companies lower their acceptance standards in order to increase their profit margins. There is no effective measure for declining quality, unfortunately, which is why some nations such as Germany and Japan have developed very meticulous standards for nearly everything, including services. The DIN and JIS enable anyone to evaluate whether or not an article has been properly produced. There is no such standard in the U.S., except for some scattered attempts by insurers to control electrical quality (such as UL). Engineering standards, such as ASME and ASTM; Automotive, such as ASE and ISO are not effective standards and do not compare with JIS or DIN because it is self-imposed, self-regulated, and self-inspected by the very people it is designed to regulate.
Makers of price indexes can address the quality bias problem with several steps. The main approach is to use hedonic index methods to capture attributes of products and their implicit prices:
Use matching models to relate goods from one period to the next
Gather data on the attributes of goods and use hedonic regressions to infer implicit prices for these attributes and the net change in price for a good whose attributes have changed.
References
Price indices
Price index theory
Quality |
https://en.wikipedia.org/wiki/WLM | WLM or wlm may refer to or stand for:
Computing
Windows Live Mail, a former e-mail and newsgroup client included in Microsoft's Windows Live group of services
Windows Live Messenger, a former free instant message program by Microsoft
Workload Manager, a resource distributor in IBMs mainframe z/OS operating system
Organizations and movements
West London Methodist Mission, a British Methodist mission, also known as West London Mission
White Lives Matter, an international activist group created in response to Black Lives Matter
Women's Liberation Movement, a former political alignment of women and feminist intellectualism
Other uses
Middle Welsh, based on its iso language code wlm.
Wiki Loves Monuments, an annual international photographic competition
Wolf-Lundmark-Melotte, a barred irregular galaxy
(WLM), the United States Navy and United States Coast Guard hull classification symbol for Coast Guard coastal buoy tenders |
https://en.wikipedia.org/wiki/Early%20Music%20Network | Early Music Network is an international early music society. Its stated mission is: "To support and promote early music and historical performance by providing information and services which would benefit and help early music organizations, ensembles and solo musicians (such as free web hosting, instrument exchange, help with organization of concerts, to provide info about education, master classes, etc.). To help the growth of early music community on the web and in every community around the world."
Early Music Network was founded in 1998 by Predrag Gosta, and it is based in Atlanta, United States.
External links
Early Music Network
Early music groups
Musical groups established in 1998 |
https://en.wikipedia.org/wiki/Housing%20starts | Housing starts is an economic indicator that reflects the number of privately owned new houses (technically housing units) on which construction has been started in a given period. These data are divided into three types: single-family houses, townhouses or small condos, and apartment buildings with five or more units.
Each apartment unit is considered a single start. The construction of a 30-unit apartment building is counted as 30 housing starts.
External links
United States Census Bureau
US Relationship Between Building Permits, Housing Starts, and Housing Completions
Housing Starts at NYU
UK National Statistics
Historical US housing starts – monthly data since 1959
Housing |
https://en.wikipedia.org/wiki/Giovanni | Giovanni may refer to:
Giovanni (name), an Italian male given name and surname
Giovanni (meteorology), a Web interface for users to analyze NASA's gridded data
Don Giovanni, a 1787 opera by Wolfgang Amadeus Mozart, based on the legend of Don Juan
Giovanni (Pokémon), boss of Team Rocket in the fictional world of Pokémon
Giovanni (World of Darkness), a group of vampires in Vampire: The Masquerade/World of Darkness roleplay and video game
"Giovanni", a song by Band-Maid from the 2021 album Unseen World
Giovanni's Island, a 2014 Japanese anime drama film
Giovanni's Room, a 1956 novel by James Baldwin
Via Giovanni, places in Rome
See also
Geovani
Giovanni Battista
San Giovanni (disambiguation)
San Giovanni Battista (disambiguation) |
https://en.wikipedia.org/wiki/External%20sorting | External sorting is a class of sorting algorithms that can handle massive amounts of data. External sorting is required when the data being sorted do not fit into the main memory of a computing device (usually RAM) and instead they must reside in the slower external memory, usually a disk drive. Thus, external sorting algorithms are external memory algorithms and thus applicable in the external memory model of computation.
External sorting algorithms generally fall into two types, distribution sorting, which resembles quicksort, and external merge sort, which resembles merge sort. External merge sort typically uses a hybrid sort-merge strategy. In the sorting phase, chunks of data small enough to fit in main memory are read, sorted, and written out to a temporary file. In the merge phase, the sorted subfiles are combined into a single larger file.
Model
External sorting algorithms can be analyzed in the external memory model. In this model, a cache or internal memory of size and an unbounded external memory are divided into blocks of size , and the running time of an algorithm is determined by the number of memory transfers between internal and external memory. Like their cache-oblivious counterparts, asymptotically optimal external sorting algorithms achieve a running time (in Big O notation) of .
External merge sort
One example of external sorting is the external merge sort algorithm, which is a K-way merge algorithm. It sorts chunks that each fit in RAM, then merges the sorted chunks together.
The algorithm first sorts items at a time and puts the sorted lists back into external memory. It then recursively does a -way merge on those sorted lists. To do this merge, elements from each sorted list are loaded into internal memory, and the minimum is repeatedly outputted.
For example, for sorting 900 megabytes of data using only 100 megabytes of RAM:
Read 100 MB of the data in main memory and sort by some conventional method, like quicksort.
Write the sorted data to disk.
Repeat steps 1 and 2 until all of the data is in sorted 100 MB chunks (there are 900MB / 100MB = 9 chunks), which now need to be merged into one single output file.
Read the first 10 MB (= 100MB / (9 chunks + 1)) of each sorted chunk into input buffers in main memory and allocate the remaining 10 MB for an output buffer. (In practice, it might provide better performance to make the output buffer larger and the input buffers slightly smaller.)
Perform a 9-way merge and store the result in the output buffer. Whenever the output buffer fills, write it to the final sorted file and empty it. Whenever any of the 9 input buffers empties, fill it with the next 10 MB of its associated 100 MB sorted chunk until no more data from the chunk is available. This is the key step that makes external merge sort work externally—because the merge algorithm only makes one pass sequentially through each of the chunks, each chunk does not have to be loaded completely; rather, sequenti |
https://en.wikipedia.org/wiki/Match%20moving | In visual effects, match moving is a technique that allows the insertion of 2D elements, other live action elements or CG computer graphics into live-action footage with correct position, scale, orientation, and motion relative to the photographed objects in the shot. It also allows for the removal of live action elements from the live action shot. The term is used loosely to describe several different methods of extracting camera motion information from a motion picture. Sometimes referred to as motion tracking or camera solving, match moving is related to rotoscoping and photogrammetry.
Match moving is sometimes confused with motion capture, which records the motion of objects, often human actors, rather than the camera. Typically, motion capture requires special cameras and sensors and a controlled environment (although recent developments such as the Kinect camera and Apple's Face ID have begun to change this). Match moving is also distinct from motion control photography, which uses mechanical hardware to execute multiple identical camera moves. Match moving, by contrast, is typically a software-based technology, applied after the fact to normal footage recorded in uncontrolled environments with an ordinary camera.
Match moving is primarily used to track the movement of a camera through a shot so that an identical virtual camera move can be reproduced in a 3-D animation program. When new animated elements are composited back into the original live-action shot, they will appear in perfectly matched perspective and therefore appear seamless.
As it is mostly software-based, match moving has become increasingly affordable as the cost of computer power has declined; it is now an established visual-effects tool and is even used in live television broadcasts as part of providing effects such as the yellow virtual down-line in American football.
Principle
The process of match moving can be broken down into two steps.
Tracking
The first step is identifying and tracking features. A feature is a specific point in the image that a tracking algorithm can lock onto and follow through multiple frames (SynthEyes calls them blips). Often features are selected because they are bright/dark spots, edges or corners depending on the particular tracking algorithm. Popular programs use template matching based on NCC score and RMS error. What is important is that each feature represents a specific point on the surface of a real object. As a feature is tracked it becomes a series of two-dimensional coordinates that represent the position of the feature across a series of frames. This series is referred to as a "track". Once tracks have been created they can be used immediately for 2-D motion tracking, or then be used to calculate 3-D information.
Calibration
The second step involves solving for 3D motion. This process attempts to derive the motion of the camera by solving the inverse-projection of the 2-D paths for the position of the camera. This process i |
https://en.wikipedia.org/wiki/Ross%20Shafer | Ross Alan Shafer (born December 10, 1954) is an American comedian, network television host, and motivational and leadership speaker/consultant. He has authored nine business books, and earned six Emmys as a network talk and game show host.
Biography
Born in McMinnville, Oregon, Shafer graduated from Federal Way High School in Federal Way, Washington. As a high school All-Conference football player, he received a scholarship to play linebacker for the University of Puget Sound in Tacoma, Washington, where he earned a business marketing degree.
Shafer said, "I had trouble finding anything that I was passionate about, or that made me happy." He then opened a "combination pet and stereo store". His first act came in the form of a community play; afterward, he tried out for a stand-up comedy competition.
From 1984 to 1989, Shafer hosted the local Seattle-based talk and comedy show, Almost Live!, and also hosted Fox's late night talk show, The Late Show.
In the 1986–1987 season, Shafer hosted the Canadian game show Love Me Love Me Not. It also aired in the United States on the USA Network and ended after one season of 130 episodes.
From 1990 to 1991, Shafer hosted a short-lived revival of Match Game on ABC.
Ross works as a keynote speaker and leadership coach in the areas of market share growth, customer friction, and workforce motivator.
Bibliography
Cook-Like-A-Stud (1991)
Nobody Moved Your Cheese! (2003)
The Customer Shouts Back! (2006)
Are You Relevant? (2009)
Grab More Market Share (2011)
Shy to Confident (2013)
Absolutely Necessary (2015)
Behave Like a Startup (2016)
Success: It's on You (2016)
No More Customer Friction (2017)
Rattled (2021)
See also
References
External links
1954 births
American game show hosts
21st-century American comedians
American television talk show hosts
Late night television talk show hosts
Living people
People from Denver
People from McMinnville, Oregon
People from Seattle
University of Puget Sound alumni |
https://en.wikipedia.org/wiki/Software%20transactional%20memory | In computer science, software transactional memory (STM) is a concurrency control mechanism analogous to database transactions for controlling access to shared memory in concurrent computing. It is an alternative to lock-based synchronization. STM is a strategy implemented in software, rather than as a hardware component. A transaction in this context occurs when a piece of code executes a series of reads and writes to shared memory. These reads and writes logically occur at a single instant in time; intermediate states are not visible to other (successful) transactions. The idea of providing hardware support for transactions originated in a 1986 paper by Tom Knight. The idea was popularized by Maurice Herlihy and J. Eliot B. Moss. In 1995 Nir Shavit and Dan Touitou extended this idea to software-only transactional memory (STM). Since 2005, STM has been the focus of intense research and support for practical implementations is growing.
Performance
Unlike the locking techniques used in most modern multithreaded applications, STM is often very optimistic: a thread completes modifications to shared memory without regard for what other threads might be doing, recording every read and write that it is performing in a log. Instead of placing the onus on the writer to make sure it does not adversely affect other operations in progress, it is placed on the reader, who after completing an entire transaction verifies that other threads have not concurrently made changes to memory that it accessed in the past. This final operation, in which the changes of a transaction are validated and, if validation is successful, made permanent, is called a commit. A transaction may also abort at any time, causing all of its prior changes to be rolled back or undone. If a transaction cannot be committed due to conflicting changes, it is typically aborted and re-executed from the beginning until it succeeds.
The benefit of this optimistic approach is increased concurrency: no thread needs to wait for access to a resource, and different threads can safely and simultaneously modify disjoint parts of a data structure that would normally be protected under the same lock.
However, in practice, STM systems also suffer a performance hit compared to fine-grained lock-based systems on small numbers of processors (1 to 4 depending on the application). This is due primarily to the overhead associated with maintaining the log and the time spent committing transactions. Even in this case performance is typically no worse than twice as slow. Advocates of STM believe this penalty is justified by the conceptual benefits of STM.
Theoretically, the worst case space and time complexity of n concurrent transactions is O(n). Actual needs depend on implementation details (one can make transactions fail early enough to avoid overhead), but there will also be cases, albeit rare, where lock-based algorithms have better time complexity than software transactional memory.
Conceptual advantag |
https://en.wikipedia.org/wiki/NBA%20TV%20Canada | NBA TV Canada is a Canadian English language discretionary specialty channel owned by Maple Leaf Sports & Entertainment (MLSE). It is a Canadian version of NBA TV, broadcasting programming focused on the National Basketball Association, and its Canadian franchise, the Toronto Raptors.
History
In December 2000, MLSE was granted approval by the Canadian Radio-television and Telecommunications Commission (CRTC) for a Category 2 digital specialty channel licence tentatively known as Raptors Basketball Channel, a channel described as being devoted primarily to the Toronto Raptors basketball franchise and the National Basketball Association (NBA), with additional programming related to other aspects of basketball.
The channel was launched on September 7, 2001, as Raptors NBA TV, with programming focused on the NBA and other basketball-related programming, although it maintained a particular emphasis on the Toronto Raptors. On November 1, 2005, the network launched a high definition simulcast.
On October 15, 2010, the channel was renamed as NBA TV Canada, as the network began to air more programming devoted to the NBA and international basketball in general, sourced from its U.S. counterpart.
The channel was valued at $21 million on behalf of the CRTC in 2012.
Programming
NBA TV Canada broadcasts programming primarily related to the NBA and the Raptors, as well as coverage of other leagues including the NBA G League, Summer League, and the Women's National Basketball Association (WNBA). Regular hosts for local studio programming include David Amber, Sherman Hamilton, Matt Devlin, Leo Rautins and Jack Armstrong. The channel broadcasts NBA games sourced from NBA TV and ESPN, and NBA TV series and studio programs.
NBA TV Canada does not broadcast live Raptors games outside of the pre-season (which are split between the networks of TSN and Sportsnet—which are owned by the co-majority owners of MLSE, Rogers Communications and Bell Canada), but does broadcast full and abbreviated encores of Raptors telecasts.
References
External links
Sports television networks in Canada
Maple Leaf Sports & Entertainment
National Basketball Association on television
English-language television stations in Canada
Television channels and stations established in 2001
Digital cable television networks in Canada |
https://en.wikipedia.org/wiki/You%20Only%20Move%20Twice | "You Only Move Twice" is the second episode of the eighth season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on November 3, 1996. The episode, based on a story idea by Greg Daniels, has three major concepts: the family moves to a new town; Homer starts to work for a friendly, sympathetic boss; and that boss, unbeknownst to Homer, is a supervillain. Bart, Lisa and Marge each have individual secondary storylines. John Swartzwelder wrote the episode, which was directed by Mike B. Anderson.
The episode's title is a reference to the James Bond film You Only Live Twice. Many elements of the episode parody the James Bond films, with a character modeled after Bond making a brief appearance. Setting the second and third acts in a new town, Cypress Creek, required the animators to create entirely new layouts and background designs. Albert Brooks, in his fourth appearance on The Simpsons, guest stars as the voice of Hank Scorpio, one of the most popular one-time characters in the entire series. The episode has received critical acclaim. IGN named "You Only Move Twice" the best episode of the eighth season and Albert Brooks as one of the best guest stars in the history of the show.
Plot
On his way to work one morning, Smithers is offered a job at the Globex Corporation, but refuses. Being the next-longest tenured employee of the plant, Homer ends up getting the job. He informs his family that the new job pays better but involves them moving to Cypress Creek. The family originally opposes the move, but they watch a video about the planned community and, seeing that it is much nicer than Springfield, agree to move there. Abandoning their house, the Simpsons pack up and leave town.
After arriving at their new house at 15201 Maple Systems Road, Homer's new boss, Hank Scorpio, introduces himself. Scorpio, who seems like the perfect boss, takes a shine to Homer and makes him chief motivator in the nuclear division. Meanwhile, Bart starts school, but he soon finds that his new class is far above the standards of Springfield Elementary and is sent to a remedial education class. Lisa goes for a nature walk and discovers that she is allergic to all the wildlife around Cypress Creek. Marge tries to go about her daily chores, but as their new house does everything automatically, she has nothing to do during the day but drink wine and mope.
On Homer's first day at work, Scorpio gives him a tour of the company and listens with interest to his secret dream of owning the Dallas Cowboys football team. He tells Homer that his dream may come true someday. Homer does an excellent job of motivating his team. During a meeting with Homer, Scorpio excuses himself, turns to a screen, threatens the United Nations Security Council by saying they have 72 hours to deliver an unspecified amount of gold and promptly blows up the 59th Street Bridge. Homer remains oblivious to Scorpio's evil genius tendencies, which in |
https://en.wikipedia.org/wiki/Balloon%20help | Balloon help is a help system introduced by Apple Computer in their 1991 release of System 7.0. The name referred to the way the help text was displayed, in "speech balloons", like those containing words in a comic strip. The name has since been used by many to refer to any sort of pop-up help text.
The problem
During the leadup to System 7, Apple studied the problem of getting help in depth. They identified a number of common questions, such as Where am I?, How do I get to...?, or worse, Why is that item "grayed out"?. In the context of computer use they identified two main types of questions users asked: What is this thing? and How do I accomplish...?. Existing help systems typically didn't provide useful information on either of these topics, and were often nothing more than the paper manual copied into an electronic form.
One of the particularly thorny problems was the What is this thing? question. In an interface that often included non-standard widgets or buttons labeled with an indecipherable icon, many functions required the end user referring to their manual. Users generally refused to do this, and ended up not using the full power of their applications since many of their functions were "hidden". It was this problem that Apple decided to attack, and after extensive testing, settled on Balloon Help as the solution.
Apple's solution for How do I accomplish...? was Apple Guide, which would be added to System 7.5 in 1994.
Mechanism
Balloon help was activated by choosing Show Balloon Help from System 7's new Help menu (labelled with a Balloon Help icon in System 7, the Apple Guide icon in System 7.5, and the word Help in Mac OS 8). While balloon help was active, moving the mouse over an item would display help for that item. Balloon help was deactivated by choosing Hide Balloon Help from the same menu.
The underlying system was based on a set of resources included in application software, holding text that would appear in the balloons. The balloon graphics and resizing were supplied by the operating system itself. The balloon content when displayed in text typically was sourced entirely from resources, as they could be added fairly easily using Apple's Rez resource compiler or third-party software like Resourcerer. Apple also supplied a custom editor application to simplify the process, which displayed a list of only those objects that required balloons, and edited the text inside a balloon shape to give the developer a somewhat rough idea of how the resulting balloon would be displayed. Additionally, there was a system level API that could be utilized by the application programmer to directly create and display balloons containing text, graphics, or a mixture of both.
The engine would automatically display the proper balloon based on the mouse location and the item's current state. It also positioned the balloon using an algorithm designed to keep it from covering the objects being examined and adjusted the cartouche to point appropr |
https://en.wikipedia.org/wiki/Leafs%20Nation%20Network | Leafs Nation Network (formerly Leafs TV) was a Canadian English language Category B regional specialty channel owned by Maple Leaf Sports & Entertainment Ltd. Leafs Nation Network broadcasts programming related to the Toronto Maple Leafs National Hockey League club and its American Hockey League affiliate, the Toronto Marlies.
Leafs Nation Network was only available within the Maple Leafs' "home market" of Ontario, excluding the Ottawa Valley (which is in the home market of the Ottawa Senators).
History
In November 2000, MLSE (Maple Leaf Sports and Entertainment), was granted approval by the Canadian Radio-television and Telecommunications Commission (CRTC) to launch a television channel called Maple Leaf Channel, described as "a regional English-language Category 2 specialty television service devoted to the Toronto Maple Leafs. Programming was to include historical events, profiles of players, panel and call-in shows, classic Maple Leaf hockey games, interviews with Maple Leaf players, coaches and management, statistics, insights and analysis of the current hockey scene from a Maple Leaf perspective, and information as to the purchase of merchandise, tickets and collectibles. There was also to be a small amount of programming related to general hockey matters, including minor hockey league hockey and hockey instruction." The channel was launched on September 7, 2001 as Leafs TV. The channel was valued at $19 million on behalf of the CRTC in 2012.
From the channel's launch until the 2014–15 season, the Leafs retained a small number of regional telecasts for broadcast on Leafs TV, typically around 12 games per season. That changed going into the 2014–15 NHL season when regional rights formerly held by the channel went to Sportsnet Ontario and TSN4.
On October 7, 2017, Leafs TV was renamed as Leafs Nation Network and re-launched as a multi-platform iteration of Leafs TV, with most of its programming shifting to the team's website and mobile apps and the television network slowly becoming an overall afterthought with the shift of content over to streaming and a lack of live games. It continued to carry pre-game and post-game coverage and other documentary programming.
On August 16, 2022, Toronto Sun's Lance Hornby reported that MLSE announced that the channel would go off the air on August 31. At MLSE's request, the CRTC formally revoked Leafs Nation Network's license on September 1.
Programming
Programming on Leafs Nation Network included re-airings of recent and past games (both in entirety, and edited), pre- and post-game shows, biographies of players and other personalities and other related programming.
Leafs Nation Network broadcast all Toronto Marlies home games. The channel broadcast the 2014 Calder Cup Finals between the Texas Stars (Dallas Stars AHL team) and the St. John's Ice Caps (Winnipeg Jets AHL team) which simulcasted in the U.S. on NHL Network.
Hosts
Jody Vance - lead anchor 2006 to 2009
Bob McGill - Former Leafs De |
https://en.wikipedia.org/wiki/MacApp | MacApp is the object oriented application framework for Apple Computer's discontinued classic Mac OS. Released in 1985, it transitioned from Object Pascal to C++ in 1991's version 3.0 release, which offered support for much of System 7's new functionality. MacApp was used for a variety of major applications, including Adobe Photoshop and SoftPress Freeway. Microsoft's MFC and Borland's OWL were both based directly on MacApp concepts.
Over a period of ten years, the product had periods where it had little development followed by spurts of activity. Through this period, Symantec's Think Class Library/Think Pascal had become a serious competitor to MacApp, offering a simpler model in a much higher-performance integrated development environment (IDE).
Symantec was slow to respond to the move to the PowerPC platform in the early 1990s, and when Metrowerks first introduced their CodeWarrior/PowerPlant system in 1994, it rapidly displaced both MacApp and Think as the primary development platforms on the Mac. Even Apple used CodeWarrior as its primary development platform during the Copland era in the mid-1990s.
MacApp had a brief reprieve between 2000 and 2001, as a system for transitioning to the Carbon system in MacOS X. However, after demonstrating a version at Worldwide Developers Conference (WWDC) in June 2001, all development was cancelled that October.
History
Pascal versions
MacApp was a direct descendant of the Lisa Toolkit, Apple's first effort in designing an object-oriented application framework, led by Larry Tesler. The engineering team for the Toolkit included Larry Rosenstein, Scott Wallace, and Ken Doyle. Toolkit was written in a custom language known as Clascal, which added object-oriented techniques to the Pascal language.
Initially, development for the Mac was carried out using a cross-compiler in Lisa Workshop. As Mac sales effectively ended Lisa sales, an effort began to build a new development platform for the Mac. Lisa Programmer's Workshop became in 1985 the Macintosh Programmer's Workshop, or MPW. As part of this process, Clascal was updated to become Object Pascal and Lisa Toolkit offered design notes for what became MacApp.
Writing a Mac program without an application framework is not an easy task, but at the time the object-oriented programming field was still relatively new and considered somewhat suspect by many developers. Early frameworks tended to confirm this suspicion, being large, slow, and typically inflexible.
MacApp was perhaps the first truly usable framework in all meanings of the term. Compiled applications were quite reasonable in terms of size and memory footprint, and the performance was not bad enough to make developers shy from it. Although "too simple" in its first releases, a number of follow-up versions quickly addressed the main problems. By this point, around 1987, the system had matured into a useful tool, and a number of developers started using it on major projects.
MacApp 2.0 was released |
https://en.wikipedia.org/wiki/Homer%20and%20Ned%27s%20Hail%20Mary%20Pass | "Homer and Ned's Hail Mary Pass" is the eighth episode of the sixteenth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on February 6, 2005. It is a Super Bowl-themed episode that was broadcast the day American Dad! premiered and after Super Bowl XXXIX.
This is the first episode in which Comic Book Guy's real name, Jeff Albertson, is revealed to the audience.
Plot
The Simpsons go to Springfield Park and find it has become a trash-strewn dump, but they see a nearby charity carnival which is raising money to help the park. Bart wins the grand prize in a carnival game, and then Homer beats him, going into an extended victory dance. Ned Flanders captures the dance on video and Comic Book Guy places it on his website. Soon, the entire world has seen Homer's embarrassing dance, humiliating him. However, several major sports stars ask Homer to teach them elaborate victory dances.
Meanwhile, Ned uses his camera to make a movie about Cain (Rod) and Abel (Todd). Everyone loves the film, except Marge, who finds it bloody and disgusting. Mr. Burns decides to finance Ned's next film, "Tales of the Old Testament" (which has a running time of 800 minutes – more than 13 hours). The bloodiness of the film angers Marge and she announces at the screening that she will protest anything that Burns owns. Burns retorts, noting that he owns the town's nuclear power plant and there is no other power source. When the crowd blurt out alternative forms of power they can use Burns admits defeat and says the film will never be seen again, much to Ned's dismay.
Homer's victory dances annoy some purist fans but become so popular that he is recruited by professional football to choreograph the Super Bowl halftime show. When he is unable to think of any ideas with the game looming the following night, Homer finds Ned at church. Together they decide to stage one of Ned's Bible stories at the show. At the Super Bowl, Ned and Homer stage the story of Noah's Ark, at the end of which Ned appears and reads a passage from the Bible. The audience jeers and boos, while both Homer and Ned are disappointed. The media and the general public later accuse the Super Bowl of forcing Christianity onto the country via their "blatant display of decency".
Production
The episode is notable for revealing the real name of the character Comic Book Guy to be Jeff Albertson. It was a long-running gag on the show that the character's name never be revealed, with other characters referring to him as "Comic Book Guy". The writers had intended to name the character as early as his first episode, but they could not think of a name for him, and they called him "Comic Book Guy", with the intention of naming the character the next time they used him. However, they kept putting it off. Showrunner Al Jean remarked: "That was specifically done to make people really mad. We just tried to pick a generic name. It was also the Super Bowl sh |
https://en.wikipedia.org/wiki/John%20Mark%20Ockerbloom | John Mark Ockerbloom (born 1966) is a digital library architect and planner in the library science field. Formerly at Carnegie Mellon University, from which he earned a PhD in computer science, he now works for the University of Pennsylvania. He is the editor of The Online Books Page, which lists over two million books including project Gutenberg titles, all of which are freely available for reading online or by download.
Education
Mark Ockerbloom attended Carnegie Mellon University in the 1990s and earned a PhD in computer science.
Career
Mark Ockerbloom works as a digital library planner and researcher at the University of Pennsylvania.
He is involved in the use of technology by the general public for the public good. He is the chair of the ILS-DI Task Group for the Digital Library Federation.
Free speech
In 1994, Mark Ockerbloom created Banned Books On-Line in response to the censoring of usenet newsgroups on Carnegie Mellon's servers. A number of organizations including Electronic Frontier Foundation and the American Civil Liberties Union were opposing the Communications Decency Act around that time and took note of Banned Books On-Line, linking to it from their websites.
In 1998, Mark Ockerbloom joined as a plaintiff along with columnist Rob Morse of the San Francisco Examiner, the ACLU and others in a federal lawsuit against a library using web filtering software. The Loudoun County Library in Virginia installed X-Stop filtering software created by Log-On Data Corporation. The filtering software stopped library patrons from visiting the websites of the San Francisco Examiner, The San Francisco Chronicle and Ockerbloom's Banned Books On-Line.
Copyright
Mark Ockerbloom has pointed out some of the conflicts between web 2.0 and copyright law, describing how multimedia can contain unintended copyright violations. Mark Ockerbloom runs the Online Books Page, which indexes books that are free to read over the Internet. In 1993, while at Carnegie Mellon University, Ockerbloom started the Online Books Page which allows readers to find books by title, subject or author. The site has been described as one of the largest and most popular resources for online books. He has said the Copyright Term Extension Act can have a chilling effect on websites that provide readers easy access to books online and is concerned about the conflict between the public good and the interests of for-profit enterprises.
Personal life
Mark Ockerbloom's wife, Mary Mark Ockerbloom, is the editor of A Celebration of Women Writers website, which lists resources about women writers and works written by women that are freely viewable online.
Bibliography
References
External links
Selected works of John Mark Ockerbloom
1966 births
American librarians
Living people
University of Pennsylvania staff
Carnegie Mellon University alumni
Place of birth missing (living people)
American software engineers |
https://en.wikipedia.org/wiki/List%20of%20former%20UPN%20affiliates | This is a list of stations that were affiliated with UPN in the United States at the time of network closure on September 15, 2006.
References
UPN |
https://en.wikipedia.org/wiki/Agatsuma%20Line | The is a local rail line in Gunma, Japan, and is part of the East Japan Railway Company (JR East) network. Approximately following the Agatsuma River, it is 55.6 km between and stations.
Operations
Although the official start of the line is at Shibukawa, all trains run through on the Jōetsu Line to/from .
Stations
All stations are in the Gunma Prefecture.
Rolling stock
Present
211-3000 series 4-car EMUs (since August 2016)
E257-5000 series
E257-5500 series
Former
115-1000 series 4-car EMUs (until March 2018)
185 series 7-car EMUs (Kusatsu limited express services until March 2014)
651-1000 series
Four-car 211 series EMUs entered service on the line from 22 August 2016.
History
The line opened on 2 January 1945 as the freight-only operating between and (present-day Naganohara-Kusatsuguchi Station). Passenger services were introduced as far as from 5 August 1945, to from 20 November 1945, and to Naganohara-Kusatsuguchi from 20 April 1946.
On 1 October 1952, the line was extended to , initially for freight only, but passengers services were also introduced from 21 June 1954. Freight services between Shibukawa and Ōshi ceased as of 1 October 1966.
Services on the section between Naganohara and Ōshi were suspended as of 1 November 1970, and on 7 March 1971, a new line was opened beyond Naganohara to , with the entire line renamed Agatsuma Line at the same time. The Naganohara-Kusatsuguchi to Ōshi line was formally closed as of 1 May 1971. CTC signalling on the entire line was also commissioned at the same time.
With the privatization of JNR on 1 April 1987, the Agatsuma Line came under the ownership of JR East.
It had been proposed to extend the line to Nagano, but geological exploratory drilling revealed extensive faulting beyond Ōmae, and as any extension would have required extensive tunnelling, this was considered impractical.
Yanba Dam construction
The Yanba Dam was proposed for construction, and required the realignment of the line between and . Construction of the diversion was well advanced when a change of government in 2009 resulted in the project being halted. Another change of government in 2012 revived the project. Services on the old section of the line were suspended following the last scheduled service on 24 September 2014 to allow commissioning of the new alignment. The new alignment opened for passenger services on 1 October 2014. The new route is 0.3 km shorter, resulting in the shortest tunnel in Japan, the 7m Tarusawa Tunnel, being abandoned, although it is not inundated by the new dam.
Points of interest
The Agatsuma Line is noted for numerous onsen hot springs along the route. The famous hot springs at Kusatsu are some distance north of the line, but several rural onsen such as those at Shima, Sawatari, Kawarayu, and Shiriyaki are more accessible.
Mount Asama, Mount Kusatsu-Shirane, and the Agatsuma Canyon can all be seen from the Agatsuma Line, though the canyon will be inundated when the Yanba Dam |
https://en.wikipedia.org/wiki/Noah%27s%20Arc%20%28TV%20series%29 | Noah's Arc is an American cable television comedy-drama series that aired for two seasons on the Logo network from October 19, 2005 to October 4, 2006. The show centered on the lives of four African-American gay friends who share personal and professional experiences while living in Los Angeles.
After its cancellation, a film was produced entitled Noah's Arc: Jumping the Broom, which was released theatrically in 2008.
Series overview
Originally, the show focused around friends Noah Nicholson, Alex Kirby, Ricky Davis, and Chance Counter. Noah is a financially struggling screenwriter who eventually lands a job as a Hollywood film writer, a job that was originally belonged to his boyfriend Wade Robinson. Alex is a HIV counselor and the sassy friend of the group. Ricky is the owner of clothing boutique and the closest friend of Noah. Chance is a college professor. Wade who eventually becomes Noah's boyfriend struggles with his sexual identity as well as the acceptance by Noah's friends. The group endures many social issues throughout the series including same sex dating, same-sex marriage, same-sex parenthood, HIV and AIDS awareness, infidelity, promiscuity, homophobia, and gay bashing.
By season two, Noah and Wade's intimate relationship ends with Noah having a new boyfriend and moving into new home. Alex opens his own HIV clinic with the help of his friends. Ricky enters into a brief relationship with a doctor who is HIV positive but Ricky has his reservations about being intimate. Chance is now a married man who is adapting to married life.
Cast and characters
Darryl Stephens as Noah Nicholson, a screenwriter
Rodney Chester as Alex Kirby, an HIV/AIDS educator
Christian Vincent as Ricky Davis, a promiscuous boutique owner
Doug Spearman as Chance Counter, an economics professor
Jensen Atwood as Wade Robinson, a screenwriter who comes out after falling for Noah
Production
Development
The idea for Noah's Arc originated in 2003 when Patrik-Ian Polk attended a Los Angeles Black gay pride club event. The experience inspired Ian-Polk to write the series that was centered around the lives of Black gay men. The original one-hour pilot was produced independently and released as a web series in 2004, and to assist in funding each episode, the show was originally envisioned as a DVD subscription series. After the web series was well received, the series was picked up by Logo TV as a half-hour series. During production of the pilot episode, Rodney Chester – who portrays Alex in the show – used his own truck as a makeshift hair, make-up and dressing room. After the pilot episode was well received at film festivals and independent screenings, the series was picked up by MTV-affiliated cable network Logo as a half-hour series. The pilot, "My One Temptation", was re-written and re-shot as a two-part premiere episode, and Noah's Arc became LOGO's first scripted series.
Executive producer Dave Mace served as the series' showrunner, with Patrik-Ian Polk and C |
https://en.wikipedia.org/wiki/Antonina%20Liedtke | Antonina Liedtke, aka Nina, is a Polish science fiction writer and a technical editor.
Life
She became known in Poland with her short story CyberJoly Drim (Fenix, 1(80) 1999). Her other stories include Psychika ofiary (Psychic of the victim, Framzeta 8(2000)).
CyberJoly drim has been awarded with Elektrybałt, Janusz A. Zajdel Award, Srebrny Glob Award, and the On-Line Award from the ezine Fahrenheit The story was extremely popular, despite being initially rejected by Maciej Parowski, the editor-in-chief of Nowa Fantastyka. Some quotes entered Polish internet jargon, e.g. "You can log off, but you can never leave".
She is a graduate of librarianship and information science from the University of Warsaw and worked in the library and publishing house of Warsaw University of Technology, and then the Publishing School of Economics. She is now editorial secretary in the publishing house Runa (Agencja Wydawnicza RUNA), created by an editor and translator Paulina Braiter-Ziemkiewicz, fantasy author Anna Brzezińska, and Edyta Szulc.
References
Polish science fiction writers
Living people
Year of birth missing (living people)
University of Warsaw alumni
Women science fiction and fantasy writers |
https://en.wikipedia.org/wiki/John%20Ledford | John Robert Ledford II (born August 19, 1968, in Houston, Texas) is an American entrepreneur and producer in the anime industry. He founded A.D. Vision, Anime Network, Newtype USA and Sentai Filmworks, and has been an executive producer for hundreds of anime titles including Halo Legends, Appleseed Alpha, Short Peace, Sailor Moon, Hello Kitty, and the dubbing of Neon Genesis Evangelion.
Life and career
John Robert Ledford II was born on August 19, 1968, in Houston, Texas, to Gayle Greer (1945–2009) and John Robert Ledford. His mother, Gayle, was a harpist and an equestrian.
A fan of video games, Ledford began his career in 1990 by founding Gametronix. The business grew to become America's second largest importer of Japanese video games and consoles such as Mega Drive, Famicom, Super Famicom and PC Engine. John's interest in anime began after being introduced to My Neighbor Totoro. In 1992, he and his business partner Matt Greenfield turned their attention to the anime industry and founded A.D. Vision.
A.D. Vision (aka ADV Films or ADV) became a global leader of anime entertainment, innovation, media diversity, branded consumer products, licensing and publishing. By its tenth year, ADV was the largest employer of actors in the Southwest United States and expanded to include Tokyo and UK branches. Within a decade, ADV cemented its status as a major distributor of anime in North America, releasing titles such as Neon Genesis Evangelion, Sailor Moon, and Hello Kitty. The company also released live-action films on DVD, such as Gene Roddenberry's Andromeda (TV Series) and Earth Final Conflict as well as the Sci-Fi Channel and Jim Henson hit series Farscape, promoted original film releases and ventured into extreme wrestling with Combat Zone Wrestling.
Ledford then founded Anime Network, North America's first all-anime dedicated cable TV network, in 2001; it grew from just 500,000 households to reach over 40,000,000 households. The following year he started publishing Newtype USA in partnership with Kadokawa Publishing. The publishing operation grew to include ADV Manga, which licensed and published hundreds of Japanese manga and Korean manhwa for North American distribution.
Ledford co-founded J-Spec Pictures in 2008 with producer Joseph Chou. The company's first project revolved around Halo, the number one global franchise by developer Bungie and published by Microsoft Corp.
In 2008, Ledford established separate companies from ADV called Sentai Filmworks and Sentai Holdings. Since then, Sentai has acquired roughly four hundred licenses including a number of acclaimed titles such as Grave of the Fireflies, Ninja Scroll, High School of the Dead, and Gatchaman. In 2014, Sentai Filmworks acquired the North American license to Short Peace, an omnibus collection of four anime shorts including the 86th Academy Awards nominated Best Animated Short Film Possessions directed by Shuhei Morita. The film had a nationwide theatrical release in over 250 theate |
https://en.wikipedia.org/wiki/Domain/OS | Domain/OS is the discontinued operating system used by the Apollo/Domain line of workstations manufactured by Apollo Computer. It was originally launched in 1981 as AEGIS, and was rebranded to Domain/OS in 1988 when Unix environments were added to the operating system. It is one of the early distributed operating systems. Hewlett-Packard supported the operating system for a short time after they purchased Apollo, but they later ended the product line in favor of HP-UX. HP ended final support for Domain/OS on January 1, 2001.
AEGIS
AEGIS is distinctive mainly for being designed for the networked computer, as distinct from its competitors, which are essentially standalone systems with added network features. The prime examples of this are the file system, which is fully integrated across machines, as opposed to Unix which draws a distinction between file systems on the host system and on others, and the user administration system, which is fundamentally network-based. So basic is this orientation that even a standalone Apollo machine cannot be configured without a network card.
Domain/OS implements functionality derived from both System V and early BSD Unix systems. It improves on AEGIS by providing a core OS upon which the user can install any or all of three environments: AEGIS, System V Unix, and BSD Unix. This was done in order to provide greater compatibility with Unix; AEGIS version SR9, which immediately preceded Domain/OS (itself numbered SR10) has an optional product called Domain/IX available, which provides a similar capability, but with some drawbacks, principally the fact that core administrative tasks still require AEGIS commands. Also, the SR9 permissions system is not fully compatible with Unix behaviour. Domain/OS provides new administrative commands and a more complex permissions system which can be configured to behave properly under any of the three environments. Domain/OS also provides an improved version of the X Window System, complete with VUE (HP's predecessor to CDE), but performance tends to be poor.
User upgrading from AEGIS SR9 to Domain/OS SR10 was slowed by the fact that many users saw no requirement, by increased disk space requirements, by new and more complex administration tools, by SR10's poorer performance, and by the buggy nature of SR10.0, although later versions are more reliable. However, later HP/Apollo machines (the DN10000, DN2500 and 4xx series workstations) can only run SR10.
Unlike many operating systems of the day, which were written in C or assembly language, many Domain/OS components are written in Pascal. Compilers for users are available for C, C++, Pascal, and Fortran.
All of the distributed administration features of Domain/OS are built around a remote procedure call system called NCS RPC. Though RPC was later end-of-lifed with the operating system, HP contributed RPC to the Open Software Foundation, which incorporated its Interface Definition Language (IDL) into their DCE product, from whi |
https://en.wikipedia.org/wiki/High%20Incident | High Incident was a police drama television series produced by DreamWorks Television for the ABC network. The show was created by Steven Spielberg, Michael Pavone, Eric Bogosian, and Dave Alan Johnson. It aired from March 4, 1996, to May 8, 1997, running a total of 32 episodes.
Premise
The show focused on the everyday stories of a group of El Camino Police Department (ECPD) officers investigating and solving crimes.
Cast
Matthew Beck as Officer Terry Hagar
Dylan Bruno as Officer Andy Lightner (season 1)
Matt Craven as Officer Lenny Gayer
Wendy Davis as Lynette White
Aunjanue Ellis as Officer Leslie Joyner
Cole Hauser as Officer Randy Willitz
David Keith as Senior Lead Officer Jim Marsh
Catherine Kellner as Officer Gayle Van Camp (season 1)
Julio Oscar Mechoso as Officer Richie Fernandez (season 1)
Louis Mustillo as Officer Russell Topps
Lindsay Frost as Sergeant Helen Sullivan (season 2)
Blair Underwood as Senior Lead Officer Michael Rhoades (season 2)
Lisa Vidal as Officer Jessica Helgado (season 2)
Production
The executive producers of the series are Michael Pavone, Dave Alan Johnson, and Eric Bogosian, with Charles Haid as the co-executive producer-director. Steven Spielberg receives story credit, with Haid noting that "Steven Spielberg is on the set almost every day." High Incident was filmed in the San Fernando Valley neighborhood of Chatsworth, Los Angeles, which doubles for the fictional El Camino.
The series was renewed for a second season, but was moved to the Thursday at 8:00 p.m. timeslot opposite Friends on NBC, with Blair Underwood, Lisa Vidal, and Lindsay Frost joining the cast. Although it received good reviews and fair ratings, it was canceled after the end of its second season in May 1997, due to its lower ratings against NBC's Friends and The Single Guy, and CBS's Diagnosis: Murder on Thursday evenings.
Episodes
Series overview
Broadcast history
Mondays 9:00 p.m. (March 4, 1996 – April 15, 1996)
Thursdays 8:00 p.m. (August 15, 1996 – May 8, 1997)
Tuesday 10:00 p.m. (Special "preview" premiere time for second-season premiere on September 17, 1996)
Season 1 (1996)
Season 2 (1996–97)
Reception
Todd Everett of Variety describes some of the series' characters as being a "tired stereotype", but praises director/co-exec producer Charles Haid for getting "a lot out of his fine cast, and several of the action scenes show above-average energy."
References
https://www.thefreelibrary.com/REAL+LAPD+OFFICERS+KEEP+AN+EYE+ON+%27HIGH+INCIDENT%27.-a083923808
External links
1990s American crime drama television series
1990s American police procedural television series
1996 American television series debuts
1997 American television series endings
English-language television shows
American Broadcasting Company original programming
Television shows set in Los Angeles
Television shows scored by Hans Zimmer
Television shows scored by John Powell
Television series by DreamWorks Television |
https://en.wikipedia.org/wiki/Tornado%20code | In coding theory, Tornado codes are a class of erasure codes that support error correction. Tornado codes require a constant C more redundant blocks than the more data-efficient Reed–Solomon erasure codes, but are much faster to generate and can fix erasures faster. Software-based implementations of tornado codes are about 100 times faster on small lengths and about 10,000 times faster on larger lengths than Reed–Solomon erasure codes. Since the introduction of Tornado codes, many other similar erasure codes have emerged, most notably Online codes, LT codes and Raptor codes.
Tornado codes use a layered approach. All layers except the last use an LDPC error correction code, which is fast but has a chance of failure. The final layer uses a Reed–Solomon correction code, which is slower but is optimal in terms of failure recovery. Tornado codes dictates how many levels, how many recovery blocks in each level, and the distribution used to generate blocks for the non-final layers.
Overview
The input data is divided into blocks. Blocks are sequences of bits that are all the same size. Recovery data uses the same block size as the input data. The erasure of a block (input or recovery) is detected by some other means. (For example, a block from disk does not pass a CRC check or a network packet with a given sequence number never arrived.)
The number of recovery blocks is given by the user. Then the number of levels is determined along with the number of blocks in each level. The number in each level is determined by a factor B which is less than one. If there are N input blocks, the first recovery level has B*N blocks, the second has B*B*N, the third has B*B*B*N, and so on.
All levels of recovery except the final one use an LDPC, which works by xor (exclusive-or). Xor operates on binary values, 1s and 0s. A xor B is 1 if A and B have different values and 0 if A and B have the same values. If you are given result of (A xor B) and A, you can determine the value for B. (A xor B xor A = B) Similarly, if you are given result of (A xor B) and B, you can determine the value for A. This extends to multiple values, so given result of (A xor B xor C xor D) and any 3 of the values, the missing value can be recovered.
So the recovery blocks in level one are just the xor of some set of input blocks. Similarly, the recovery blocks in level two are each the xor of some set of blocks in level one. The blocks used in the xor are chosen randomly, without repetition. However, the number of blocks xor'ed to make a recovery block is chosen from a very specific distribution for each level.
Since xor is a fast operation and the recovery blocks are an xor of only a subset of the blocks in the input (or at a lower recovery level), the recovery blocks can be generated quickly.
The final level is a Reed–Solomon code. Reed–Solomon codes are optimal in terms of recovering from failures, but slow to generate and recover. Since each level has fewer bl |
https://en.wikipedia.org/wiki/Swiki | Swiki (Squeak wiki) is wiki software written in Squeak.
It was formerly used by the Georgia Institute of Technology's College of Computing, but its use was discontinued in 2011 following a student complaint about privacy. Swiki comes bundled with its own web server.
A swiki installation consists of the Virtual Machine (VM) file (usually squeak.exe), an image file (usually squeak.image), and a set of files and folders with templates and the virtual wikis. One swiki installation allows a large number of virtual wikis to be created through the admin interface using a web browser. The image file and associated templates and virtual wikis can be run on any OS as long as the VM for that OS is used.
The VM and image file are the only binary files. All of the swiki templates and pages are stored as text files using XML tags. Each new virtual swiki goes in its own folder, and each page in the virtual swiki is a numbered XML file. For example, the first page is 1.xml, the second is 2.xml, etc. History for each page is a separate XML file that used the file extension "old", e.g., 1.old, 2.old.
See also
Comparison of wiki software
References
External links
Smalltalk programming language family
Wiki software |
https://en.wikipedia.org/wiki/Radix%20tree | In computer science, a radix tree (also radix trie or compact prefix tree or compressed trie) is a data structure that represents a space-optimized trie (prefix tree) in which each node that is the only child is merged with its parent. The result is that the number of children of every internal node is at most the radix of the radix tree, where is a positive integer and a power of 2, having ≥ 1. Unlike regular trees, edges can be labeled with sequences of elements as well as single elements. This makes radix trees much more efficient for small sets (especially if the strings are long) and for sets of strings that share long prefixes.
Unlike regular trees (where whole keys are compared en masse from their beginning up to the point of inequality), the key at each node is compared chunk-of-bits by chunk-of-bits, where the quantity of bits in that chunk at that node is the radix of the radix trie. When is 2, the radix trie is binary (i.e., compare that node's 1-bit portion of the key), which minimizes sparseness at the expense of maximizing trie depth—i.e., maximizing up to conflation of nondiverging bit-strings in the key. When ≥ 4 is a power of 2, then the radix trie is an -ary trie, which lessens the depth of the radix trie at the expense of potential sparseness.
As an optimization, edge labels can be stored in constant size by using two pointers to a string (for the first and last elements).
Note that although the examples in this article show strings as sequences of characters, the type of the string elements can be chosen arbitrarily; for example, as a bit or byte of the string representation when using multibyte character encodings or Unicode.
Applications
Radix trees are useful for constructing associative arrays with keys that can be expressed as strings. They find particular application in the area of IP routing, where the ability to contain large ranges of values with a few exceptions is particularly suited to the hierarchical organization of IP addresses. They are also used for inverted indexes of text documents in information retrieval.
Operations
Radix trees support insertion, deletion, and searching operations. Insertion adds a new string to the trie while trying to minimize the amount of data stored. Deletion removes a string from the trie. Searching operations include (but are not necessarily limited to) exact lookup, find predecessor, find successor, and find all strings with a prefix. All of these operations are O(k) where k is the maximum length of all strings in the set, where length is measured in the quantity of bits equal to the radix of the radix trie.
Lookup
The lookup operation determines if a string exists in a trie. Most operations modify this approach in some way to handle their specific tasks. For instance, the node where a string terminates may be of importance. This operation is similar to tries except that some edges consume multiple elements.
The following pseudo code assumes that these methods |
https://en.wikipedia.org/wiki/Superior%20Software | Superior Software Ltd (also known as Superior Interactive) is a video game publisher. It was one of the main publishers for the BBC Micro and Acorn Electron computers in the 1980s and early 1990s. It currently releases games for Microsoft Windows, iOS and Android; mostly updates of its original games.
History
Superior Software was established in 1982 by Richard Hanson and John Dyson, university graduates with degrees in Computational Science and Physics of Natural Resources respectively. They had previously programmed software published by Micro Power, and they wrote Superior's first four game releases for the BBC Micro; three were written by Hanson and one by Dyson. Describing the early days, Hanson commented:
During the 1980s and 1990s, Superior focused on the machines of Acorn Computers while also publishing software for the Commodore 64, Amiga, ZX Spectrum, and Oric-1. Key management has included Steve Botterill, Chris Payne and Steve Hanson.
Developers including Chris Roberts, David Braben, Ian Bell, Geoff Crammond, and Nick Pelling have all had software published by Superior, sometimes released under the joint Superior Software / Acornsoft brand name.
Releases
Their best-known games are the Repton series of games, which have sold over 125,000 units in total. Other notable Superior Software games for the BBC Micro and Acorn Electron include Overdrive, Citadel, Thrust, Galaforce, Stryker's Run, Ravenskull, Codename: Droid (sequel to Stryker's Run), Palace of Magic, Bonecruncher, Quest, Pipeline, Exile and Ricochet. They also published the seminal Zarch for the Acorn Archimedes, as well as follow-up games using the same engine, Conqueror and Air Supremacy.
As well as their high quality original games, Superior has released a number of official Acorn conversions of big games from other systems including Barbarian, The Last Ninja, Predator, Hostages and Sim City. Superior has also published a number of educational and utility software titles including the speech synthesis program Speech!.
The "Play It Again Sam" series of compilations included re-releases of their old titles, with four games for the usual price of one. The original Play It Again Sam featured four Superior games which had each made No. 1 individually (Citadel, Thrust, Ravenskull, and Stryker's Run), while subsequent compilations increasingly featured games licensed from other software houses such as Micro Power or Alligata. These compilations also occasionally included some new games that were thought to be not quite up to the standard of their full price games. The series eventually ran to 18 issues for the BBC Micro, although the latest ones were released on disc only, well into the demise of the 8-bit scene with lower sales as a result.
Superior, under the brandname Superior Interactive, now mainly develops and publishes software for computers and devices running Microsoft Windows, iOS and Android; and they have released several updated versions of some of their po |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.