source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/Inverted%20index
|
In computer science, an inverted index (also referred to as a postings list, postings file, or inverted file) is a database index storing a mapping from content, such as words or numbers, to its locations in a table, or in a document or a set of documents (named in contrast to a forward index, which maps from documents to content). The purpose of an inverted index is to allow fast full-text searches, at a cost of increased processing when a document is added to the database. The inverted file may be the database file itself, rather than its index. It is the most popular data structure used in document retrieval systems, used on a large scale for example in search engines. Additionally, several significant general-purpose mainframe-based database management systems have used inverted list architectures, including ADABAS, DATACOM/DB, and Model 204.
There are two main variants of inverted indexes: A record-level inverted index (or inverted file index or just inverted file) contains a list of references to documents for each word. A word-level inverted index (or full inverted index or inverted list) additionally contains the positions of each word within a document. The latter form offers more functionality (like phrase searches), but needs more processing power and space to be created.
Applications
The inverted index data structure is a central component of a typical search engine indexing algorithm. A goal of a search engine implementation is to optimize the speed of the query: find the documents where word X occurs. Once a forward index is developed, which stores lists of words per document, it is next inverted to develop an inverted index. Querying the forward index would require sequential iteration through each document and to each word to verify a matching document. The time, memory, and processing resources to perform such a query are not always technically realistic. Instead of listing the words per document in the forward index, the inverted index data structure is developed which lists the documents per word.
With the inverted index created, the query can be resolved by jumping to the word ID (via random access) in the inverted index.
In pre-computer times, concordances to important books were manually assembled. These were effectively inverted indexes with a small amount of accompanying commentary that required a tremendous amount of effort to produce.
In bioinformatics, inverted indexes are very important in the sequence assembly of short fragments of sequenced DNA. One way to find the source of a fragment is to search for it against a reference DNA sequence. A small number of mismatches (due to differences between the sequenced DNA and reference DNA, or errors) can be accounted for by dividing the fragment into smaller fragments—at least one subfragment is likely to match the reference DNA sequence. The matching requires constructing an inverted index of all substrings of a certain length from the reference DNA sequence. Since th
|
https://en.wikipedia.org/wiki/Hierarchical%20state%20routing
|
Hierarchical state routing (HSR), proposed in Scalable Routing Strategies for Ad Hoc Wireless Networks by Iwata et al. (1999), is a typical example of a hierarchical routing protocol.
HSR maintains a hierarchical topology, where elected clusterheads at the lowest level become members of the next higher level. On the higher level, superclusters are formed, and so on. Nodes which want to communicate to a node outside of their cluster ask their clusterhead to forward their packet to the next level, until a clusterhead of the other node is in the same cluster. The packet then travels down to the destination node.
Furthermore, HSR proposes to cluster nodes in a logical way instead of in a geological way: members of the same company or in the same battlegroup are clustered together, assuming they will communicate much within the logical cluster.
HSR does not specify how a cluster is to be formed.
Routing algorithms
|
https://en.wikipedia.org/wiki/Fallujah%2C%20The%20Hidden%20Massacre
|
Fallujah, The Hidden Massacre is a documentary film by Sigfrido Ranucci and Maurizio Torrealta which first aired on Italy's RAI state television network on November 8, 2005. The film documents the use of chemical weapons, particularly the use of incendiary bombs containing white phosphorus, and alleges that insurgents and civilians, including children, had been killed or injured by chemical burns by military forces of the United States of America in the city of Fallujah in Iraq during the Fallujah Offensive of November 2004.
The film's primary themes are:
Establishing a case for war crimes against civilians committed by the United States.
Documenting evidence for the use of chemical devices by the US military.
Documenting other human rights abuses by American forces and their Iraqi counterparts.
White phosphorus
White phosphorus (WP) is a chemical smoke-producing agent, reacting quickly and spontaneously with air and causing an instant bank of smoke. As a result, WP munitions are common, particularly as smoke grenades for infantry, loaded in defensive grenade dischargers on tanks and other armored vehicles, or as part of the ammunition allotment for artillery or mortars. These create smokescreens to mask movement from the enemy, or to mask his fire. WP burns fiercely and can set cloth, fuel, ammunition and other combustibles on fire, so it is also used as an incendiary weapon. WP use is legal for purposes such as illumination and obscuring smoke, and the Chemical Weapons Convention does not list WP in its schedules of chemical weapons.
National Institute for Occupational Safety and Health (NIOSH) gives the following information about white phosphorus. It "spontaneously catches fire in air". Handling requires the most severe level of safety equipment because it is classified as a level 4 hazard, the highest level. When WP comes in contact with skin, it reacts to become phosphoric acid, and continues burning until neutralized. WP causes severe second and third degree burns upon contact with skin or eyes. WP smoke also causes eye and respiratory tract irritation. It not only reacts with skin, but dissolves fat and tissues beneath the skin. When it was used for producing matches, inhalation of the vapors caused a condition known as phossy jaw, where the bones of workers dissolved in their faces.
War crimes
The primary theme of the film is its assertion of a case for war crimes committed by the United States in its military offensive against Fallujah in Iraq. The film documents the use of weapons based on white phosphorus and other substances similar to napalm, such as Mark 77 bomb, by American forces.
Interviews with American ex-military personnel who were involved in the Fallujah offensive testify to the use of the weapons by the United States, while reporters who were stationed in Iraq discuss the American government's attempts to suppress the news by covert means.
Incendiary weapons used against personnel and civilians
The film states
|
https://en.wikipedia.org/wiki/Micro%20Mart
|
Micro Mart was a weekly computer magazine published in the United Kingdom by Dennis Publishing Ltd. As of 2015, it had a circulation of 5,422. In a letter to subscribers in December 2016 it was announced that the magazine would cease publication with issue No 1445 (published just after Christmas 2016): "After 30 amazing years of telling it like it is, Micro Mart magazine is logging off."
The magazine contained news, reviews, articles, and classified adverts covering many popular areas of computing (both in hardware and software areas). The magazine's articles are targeted at many different levels of expertise, from beginners' tasks (such as working with Word documents, setting up a simple wireless network, or building a water-cooled PC) to more advanced articles (such as working with Linux kernels or becoming a shareware author).
The magazine was also notable for being the only publication in the UK to still regularly cover the Amiga market, most magazines having abandoned coverage of the format in the years following the collapse of Commodore.
History
Micro Mart was launched in November 1985 as a fortnightly publication called Micro Computer Mart consisting of classified advert listings for the computer trade. The magazine soon expanded in editorial content to include articles and reviews from many realms of computing. It became popular with both amateur and professional system builders. In 1991, due to reader demands, Micro Mart moved to a weekly format.
On 14 November 2002 (issue 723) the magazine moved to a full colour format, having previously been printed in black and white. At this time, Micro Mart also expanded in content (for example Ask Jason moved from 1 to 2 pages).
Since then, the magazine celebrated its 30th birthday, its 1,400th issue and had several design changes, the most recent in 2011.
Micro Mart was initially published by MicroMart (UK) Ltd. Owners Stewart Somerville and Roy Perrin, along with Stewart's wife Fiona, controlled publication and distribution of the magazine until 28 February 1995 when Trinity Publications (a subsidiary of the Trinity Mirror group) bought the company. The headquarters was in Birmingham. On 12 June 2006 the magazine was bought by Dennis Publishing Ltd. after a deal brokered by Ian Savage Publishing. The magazine joined the ranks of titles such as Computer Shopper, PC Pro, and Custom PC.
The magazine was under the editorship of Anthony Enticknap, whose leadership in recent years saw the magazine solidifying its sales and readership figures at a time when traditional print media was being squeezed by the Internet. The magazine was overseen by Simon Brew.
Identity
Micro Mart had several quirks that helped to give it an identity. For example, the disclaimer printed at the end of the magazine was ended with a short insight into the news and events in the editorial office. One feature of Micro Mart was the images of the regular experts placed alongside their columns.
As well as this, there were
|
https://en.wikipedia.org/wiki/Rich%20client%20platform
|
The rich client platform (RCP) is a programmer tool that makes it easier to integrate independent software components, where most of the data processing occurs on the client side.
Overview
RCP is a software consisting of the following components:
A core (microkernel), lifecycle manager
A standard bundling framework
A portable widget toolkit
File buffers, text handling, text editors
A workbench (views, editors, perspectives, wizards)
Data binding
Update manager
With an RCP, programmers can build their own applications on existing computing platforms. Instead of having to write a complete application from scratch, they can benefit from proven and tested features of the framework provided by the platform. Building on a platform facilitates faster application development and integration, while the cross-platform burden is taken on by the platform developers. The platform allows the seamless integration of independent software modules like graphic tools, spreadsheets and mapping technologies into a software application with a simple click of the mouse.
Their creators claim that programs built with RCP are portable to many operating systems while being as rich as client–server applications which use traditional clients.
Open-source examples are the Eclipse, NetBeans and Spring Framework RCPs for Java.
See also
rich client
Component-based software engineering
References
External links
Eclipse Rich Client Platform wiki
Projecto Colibri RCP
NetBeans Platform
Software architecture
|
https://en.wikipedia.org/wiki/Exatron
|
Exatron manufactures a series of automated handling, testing, programming, and marking equipment for the packaged integrated circuit industry.
Products
Exatron designs, develops, manufactures, markets, and services a wide variety of I.C. component handling and testing equipment. Exatron products are used in the testing and programming of PLDs and other integrated circuits.
Stringy Floppy and Entrepo
In the late 1970s and early 1980s, Exatron designed and manufactured the Exatron Stringy Floppy (ESF) tape storage device for a variety of microcomputers. Coleco also planned to use the ESF in their Colecovision Super Game Module; however, it ultimately proved to be unsuitable for the amounts and types of accesses that games inflict (the Super Game Module ended up being shelved in favor of the Adam computer, which used a different type of tape drive that Coleco developed internally).
Around this same time, Exatron announced that it was changing its name to Entrepo. From Video Games magazine, June 1983, page 49:
"Last February the Exatron Corporation changed its name to Entrepo (meaning "a storage place")."
This name change caused some people to believe that there were two manufacturers of Stringy Floppy tape drives, when in fact there were not. Note that since the company's present name is still Exatron, it is unclear if this name change never actually took place or if it was changed back at some point.
The ESF was available by mail-order through A&J Micro Drive, a related company.
References
External links
Official Web Site
Electronics companies of the United States
|
https://en.wikipedia.org/wiki/Mr.%20Lisa%20Goes%20to%20Washington
|
"Mr. Lisa Goes to Washington" is the second episode of the third season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on September 26, 1991. In the episode, Lisa wins a patriotic essay contest about the United States. She and her family attend the contest finals in Washington, D.C., where she is dismayed after watching a congressman accept a bribe. Lisa loses the contest when she pens a scathing screed condemning the government system, but the corrupt congressman is jailed and removed from office, restoring her faith in government.
The episode was written by George Meyer and directed by Wes Archer. It was the first episode for which Al Jean and Mike Reiss served as show runners. It features multiple references to the 1939 film Mr. Smith Goes to Washington, including the scene in which Lisa appeals to Lincoln's statue at the Lincoln Memorial for advice. Other Washington landmarks referenced in the episode include the White House, the Watergate Hotel, the Jefferson Memorial, the Washington Monument, the National Air and Space Museum and the Kennedy Center for the Performing Arts.
The episode acquired a Nielsen rating of 12.9, and was the third highest-rated show on Fox the week it aired. It received mostly positive reviews from television critics, who praised the episode for its satire on American politics. The timber industry criticized the scene in which Lisa witnesses a timber industry lobbyist offering a bribe to the congressman to allow loggers to raze the Springfield Forest. The scene was described as "an easy shot at hard-working people whose only crime is to have been born in a timber town".
Plot
Homer sees an ad for a children's essay contest in the Reading Digest magazine. Lisa submits an essay on the contest's topic – "what makes America great" – after visiting Springfield Forest and seeing a bald eagle land nearby. The Simpsons travel to Washington, D.C. after Lisa's essay, "The Roots of Democracy", earns her a spot in the national finals there.
While Bart and Homer enjoy the all-expenses-paid perks of their trip, Lisa visits famous monuments for inspiration. At a shrine to a feminist icon, she sees a corrupt congressman, Bob Arnold, taking a bribe from a timber industry lobbyist to allow loggers to clearcut Springfield Forest. Heartbroken and disillusioned by government corruption, Lisa destroys her winning essay. She pens a scathing indictment, "Cesspool on the Potomac", which condemns government greed and corruption and names the politician involved in the bribery.
Lisa's essay elicits a hostile reaction from the judges and audience members. When word of her speech quickly spreads through the capital, Congressman Arnold is arrested, removed from office and sent to prison, where he becomes a born-again Christian. Lisa's essay fails to win the contest, but her faith in government is restored and the contest winner commends her courage and honesty.
Production
|
https://en.wikipedia.org/wiki/Boolean%20expression
|
In computer science, a Boolean expression is an expression used in programming languages that produces a Boolean value when evaluated. A Boolean value is either true or false. A Boolean expression may be composed of a combination of the Boolean constants true or false, Boolean-typed variables, Boolean-valued operators, and Boolean-valued functions.
Boolean expressions correspond to propositional formulas in logic and are a special case of Boolean circuits.
Boolean operators
Most programming languages have the Boolean operators OR, AND and NOT; in C and some languages inspired by it, these are represented by "||" (double pipe character), "&&" (double ampersand) and "!" (exclamation point) respectively, while the corresponding bitwise operations are represented by "|", "&" and "~" (tilde). In the mathematical literature the symbols used are often "+" (plus), "·" (dot) and overbar, or "∨" (vel), "∧" (et) and "¬" (not) or "′" (prime).
Some languages, e.g., Perl and Ruby, have two sets of Boolean operators, with identical functions but different precedence. Typically these languages use and, or and not for the lower precedence operators.
Some programming languages derived from PL/I have a bit string type and use BIT(1) rather than a separate Boolean type. In those languages the same operators serve for Boolean operations and bitwise operations. The languages represent OR, AND, NOT and EXCLUSIVE OR by "|", "&", "¬" (infix) and "¬" (prefix).
Short-circuit operators
Some programming languages, e.g., Ada, have short-circuit Boolean operators. These operators use a lazy evaluation, that is, if the value of the expression can be determined from the left hand Boolean expression then they do not evaluate the right hand Boolean expression. As a result, there may be side effects that only occur for one value of the left hand operand.
Examples
The expression is evaluated as .
The expression is evaluated as .
and are equivalent Boolean expressions, both of which are evaluated as .
typeof true and typeof false return
Of course, most Boolean expressions will contain at least one variable (), and often more ().
See also
Expression (computer science)
Expression (mathematics)
Boolean function
References
External links
The Calculus of Logic, by George Boole, Cambridge and Dublin Mathematical Journal Vol. III (1848), pp. 183–98.
Boolean algebra
Operators (programming)
|
https://en.wikipedia.org/wiki/Another%20Life%20%281981%20TV%20series%29
|
Another Life is an American television soap opera produced and broadcast by The Christian Broadcasting Network from June 1, 1981 to October 5, 1984. It was co-created by Roy Winsor and Bob Aaron, and ran for 875 episodes. It attempted to combine standard afternoon intrigue with religious overtones, as many characters were portrayed as born again who relied on the power of prayer to solve their problems. Set in the fictional east coast town of Kingsley (ostensibly thought to be in Virginia), the show was taped in CBN's hometown of Virginia Beach, Virginia.
Synopsis
Through its run, Another Life revolved around the Davidson family - local anchorman Scott Davidson, his wife Terry who works as a nurse (Mary Jean Feton), daughter Lori (Jeannette Larson and later Debbie McLeod), and teenage son Peter (Darrel Campbell). Although they sometimes struggle with their faith, they stick by their principles, show compassion towards their fellow man - most notably next-door neighbor Liz Cummings (Carolyn Lenz) who lives with her alcoholic and adulterous husband Jeff (Tom McGowan) and their daughter Jenny - and eschew revenge to those who have caused them grief.
Wealthy businessman Charles Carpenter (Randy Kraft) attempts to control every situation with his power and influence, and holds a grudge against the Davidsons, particularly after Scott investigates a crime story involving a mob gang which has connections with Kingsley's upper-crust which includes the Carpenter family. Charles' daughter Miriam Mason (Ginger Burgett) also holds a grudge against the Davidsons, and files an adultery case against daughter Lori who is accused of having an affair with her husband Paul, a lecturer at the local college. Although it was later proved that Lori was innocent, Paul and Miriam get a divorce, with the latter losing custody of their son - although it is often hinted that Paul does indeed have feelings for Lori. Charles would later date Terry Davidson's half-sister, the equally nefarious Nancy Lawson (Nancy Mulvey) who also clashes with the Davidsons and uses her charms to lure wealthy men into relationships with her, but never appears to hold down a steady career.
Russ Weaver (Christopher Roland), a pre-medical student who is about to propose to Lori, finds himself tangled with the drug ring when he is left with a huge debt after paying his girlfriend's medical bills following a serious car accident the couple are involved in. He is also torn between Lori and fellow student Becky Hewitt (Sue Scannell) who is Lori's best friend. Unknown to Lori, Becky slept with Russ after the latter grew frustrated with Lori's refusal to have sex with him due to her beliefs. Lori would later catch the attention of Ben Martin, a handsome but older doctor who attends to Lori after her accident, and this infuriates Russ even after she breaks up with him. Russ's father is later revealed to be Vince Cardello, a member of the local mob.
Russ and Becky secretly marry shortly after she becom
|
https://en.wikipedia.org/wiki/Kendall%20Hart
|
Kendall Hart is a fictional character from All My Children, an American soap opera on the ABC network. The character was portrayed by Sarah Michelle Gellar from February 24, 1993, to July 3, 1995, and by Alicia Minshew from January 2002 until the show's series finale on September 23, 2011. On March 7, 2013, it was announced that Minshew would guest star on the Prospect Park's continuation of All My Children. She appeared on the second July 8 episode.
Kendall is the daughter of Erica Kane, a child conceived when Erica was raped on the night of her 14th birthday by movie matinee idol Richard Fields. Emerging as one of daytime television's most popular and layered characters, Kendall was originally written as a complex villain, described as a "complicated bad girl" and "the scheming daughter of the biggest schemer of them all, Erica Kane," but was later reformed. The writers scripted her as a heroine, while keeping devious aspects of the character intact.
Background
Rapid aging
Kendall has been the subject of Soap Opera Rapid Aging Syndrome (SORAS), which caused the show's producers to "de-SORAS" her mother, Erica Kane, portrayed by Susan Lucci. Lucci says that Erica was 15 when the show began in 1970. "I love playing her. I enjoyed playing her when she was a 15-year-old high school girl, the naughty girl in town, and I enjoy playing her now, when she's still the naughty girl, but she's broadened her area of operation to include the entire world," said Lucci. Erica being 15 in 1970 placed her birth year at 1955.
When Kendall first appears on the show in 1993, she is 16 years old, portrayed by a then 16-year-old (or 15-year-old) Sarah Michelle Gellar. This was despite the fact that Kendall was conceived when Erica was raped at the age of 14 before the show began in 1970 (23 years earlier). Fans protested the age differences due to the changes making Erica and Kendall too young compared to Erica's original 1955 birth year. In response to this, the show's producers rapidly aged Kendall to 23, which moved Erica's birth year one year forward to 1956.
When Minshew took over the role in 2002, the character's birth year was changed to 1976; Erica's birth year was subsequently pushed even later than where it was before, to 1962. Though Kendall's birthdate was changed to September 25, 1970, in 1993 as a result of SORAS, her birthdate was revised to September 25, 1976, in 2002, closer to her intended birthdate when she first appeared as a 16-year-old girl on February 24, 1993.
Casting and character portrayal
Sarah Michelle Gellar
For at least two years, the producers of All My Children had been thinking about introducing a new character to complicate Erica's storylines. A casting call went out for a young actress to portray the part of Kendall Hart, Erica's long-lost daughter. Many teenage actors in New York auditioned for the role, and the show's producers were adamant about keeping the character's storyline a secret. The actresses were told that Ken
|
https://en.wikipedia.org/wiki/Berliner%20Verkehrsbetriebe
|
The (German: 'Berlin Transport Company') is the main public transport company of Berlin, the capital city of Germany. It manages the city's (underground), tram, bus and ferry networks, but not the urban rail system.
The generally used abbreviation, BVG, has been retained from the company's original name, (Berlin Transportation Stock Company). Subsequently, the company was renamed . During the division of Berlin, the BVG was split between BVG ( in West Berlin) and BVB ( in East Berlin, also known as the , BVB). After reunification, the current formal name was adopted.
History
The was formed in 1928, by the merger of the (the operator of the city's buses), the (the operator of the U-Bahn) and the (the operator of the city's trams). On 1 January 1938, the company was renamed , but the acronym BVG was retained.
In 1933, the State Commissioner for Berlin, Julius Lippert, appointed the NSDAP politician and later Waffen SS soldier Johannes Engel as head of the BVG Supervisory Board. The board of directors and most of the senior staff were dismissed or disempowered. During World War II, the BVG used some 4000 forced laborers, for whom the company built its own barracks camp.
From 1 August 1949, the BVG networks in West Berlin and East Berlin were operated separately. The two operators were originally known as and , but from 1 January 1969 the eastern operator was renamed as the or BVB. After the reunification of Berlin, the two operators were recombined into the on 1 January 1992.
Prior to the division of Berlin, tram lines existed throughout the city, but abandoned all the tram lines in its part of the city, replacing them all by buses by 1967. However retained its tram lines, and on the reunification of Berlin the BVG inherited a considerable network of routes in the eastern half of Berlin.
On 9 January 1984, took over the responsibility for operation of the services in West Berlin. This urban rail network had previously been operated in both halves of Berlin by the , the state rail operator of East Germany, but had been subject to a boycott in the west after the building of the Berlin Wall. With the reunification of Berlin, responsibility for the reverted to (DBAG), the state rail operator of Germany. The is currently managed by the , a subsidiary company of DBAG.
also took part in the Berlin project, an urban maglev system, in the period between 1984 and 1992. The project used a section of the right of way that was out of service due to the building of the Berlin Wall, and was dropped with the fall of that wall.
The BVG launched the on 12 December 2004 which remodeled the tram and bus network to create 24 tram and bus lines (with M prefix) covering parts of the city that weren't served by or .
In September 2019, BVG launched first in the world large scale Mobility as a service project “Jelbi” together with a Lithuanian mobility startup Trafi.
Chief executive officers
Operations
BVG operates the , an urban rapid
|
https://en.wikipedia.org/wiki/Catalogues%20of%20Fundamental%20Stars
|
The Catalogue of Fundamental Stars is a series of six astrometric catalogues of high precision positional data for a small selection of stars to define a celestial reference frame, which is a standard coordinate system for measuring positions of stars.
Publication history
The six volumes in the fundamental catalogue series are as follows:
The Fundamental-Catalog (FC) was compiled by Auwers and published in two volumes. The first volume, published in 1879, contains 539 stars. The second volume, published in 1883, contains 83 stars from the southern sky.
The Neuer Fundamentalkatalog (NFK) was compiled by J. Peters and contained 925 stars.
The Third Fundamental Catalogue (FK3) was compiled by Kopff and published in 1937, with a supplement in 1938.
The Fourth Fundamental Catalogue (FK4) was published in 1963, and contained 1,535 stars in various equinoxes from 1950.0.
The Fourth Fundamental Catalogue's Supplement (FK4S) was an amendment to FK4 that contains a further 1,987 stars.
The Fifth Fundamental Catalogue (FK5) was a 1988 update of FK4 with new positions for the 1,535 stars. It was superseded by the quasar-based International Celestial Reference Frame (ICRF).
The Fifth Fundamental Catalogue Extension (FK5), published in 1991, added 3,117 new stars.
The Sixth Fundamental Catalogue (FK6) is a 2000 update of FK5 correlated with the ICRF through the Hipparcos satellite. It comes in two parts: FK6(I) and FK6(III). FK6(I) contains 878 stars, and FK6(III) contains 3,272 stars. Both are updated and amended versions of FK5 using Hipparcos Catalogue data.
Examples
Iota Arietis is located in FK5 as item 2132
Alpha Arietis is FK5 item 74
Kappa Aurigae is FK5 item 1168
See also
Gaia, a star catalogue mission launched in 2013 covering approximately 1billion astronomical objects
International Celestial Reference System and Its Realizations, the current IAU approved reference frames in radio and optical wavelengths
References
External links
Fifth Fundamental Catalogue (1988)
Fifth Fundamental Catalogue Extension
Astronomical catalogues of stars
|
https://en.wikipedia.org/wiki/Taikodom
|
Taikodom was a computer game by Brazilian developer Hoplon Infotainment. Considered by the developers to be a Massive Social Game rather than MMORPG, Taikodom featured a persistent online outer space environment.
In 2007, an English version of the beta was released. The game was eventually shut down in May 2015.
Hoplon hosted the commercial version on an IBM zSeries (specifically the z9, then later upgrade to a z10) mainframe (also called a "gameframe" because it is linked to bladeservers with Cell/B.E. processors) running Linux.
Videos
Hoplon Infotainment, Brazil startup and maker of Taikodom online video game 27 Apr 2009 at youtube.com
References
External links
Taikodom website
Hoplon Infotainment
English In-Development Wiki
2008 video games
Massively multiplayer online role-playing games
Space massively multiplayer online role-playing games
Video games developed in Brazil
Windows games
Windows-only games
|
https://en.wikipedia.org/wiki/Central%20England%20temperature
|
The Central England Temperature (CET) record is a meteorological dataset originally published by Professor Gordon Manley in 1953 and subsequently extended and updated in 1974, following many decades of painstaking work. The monthly mean surface air temperatures, for the Midlands region of England, are given (in degrees Celsius) from the year 1659 to the present.
This record represents the longest series of monthly temperature observations in existence. It is a valuable dataset for meteorologists and climate scientists. It is monthly from 1659, and a daily version has been produced from 1772. The monthly means from November 1722 onwards are given to a precision of 0.1 °C. The earliest years of the series, from 1659 to October 1722 inclusive, for the most part only have monthly means given to the nearest degree or half a degree, though there is a small 'window' of 0.1 degree precision from 1699 to 1706 inclusive. This reflects the number, accuracy, reliability and geographical spread of the temperature records that were available for the years in question.
Data quality
Although best efforts have been made by Manley and subsequent researchers to quality control the series, there are data problems in the early years, with some non-instrumental data used. These problems account for the lower precision to which the early monthly means were quoted by Manley. Parker et al. (1992) addressed this by not using data prior to 1772, since their daily series required more accurate data than did the original series of monthly means. Before 1722, instrumental records do not overlap and Manley used a non-instrumental series from Utrecht compiled by Labrijn (1945), to make the monthly central England temperature (CET) series complete.
For a period early in the 21st century there were two versions of the series: the "official" version maintained by the Hadley Centre in Exeter, and a version that was maintained by the late Philip Eden which he argued was more consistent with the series as originally compiled by Manley.
The warmest year on record was recorded in 2022, with an average temperature of 11.15 degrees Celsius. This beat the previous 2014 record by 0.2 degrees and was almost 2 degrees over the 1961-1990 average
Trends revealed by the series
During the eighteenth and nineteenth centuries, a cool period which coincided with cool winters and generally cool summers, the temperatures fluctuated widely but with little trend. From 1910, temperatures increased until about 1950, when they flattened before a sharp rising trend began in about 1975. The warmest decade on record is the 2010s (2011–2020) with a mean temperature of .
Both the general warming trend and the hottest year on record at the time, 2014, have been attributed to human-caused climate change using observational and climate model-based techniques. This record was subsequently broken in 2022, when a mean CET of 11.15 C was recorded, 1.68 degrees above the 1961-90 average and breaking the 2014
|
https://en.wikipedia.org/wiki/Collaborative%20human%20interpreter
|
The collaborative human interpreter (CHI) is a proposed software interface for human-based computation (first proposed as a programming language on the blog Google Blogoscoped, but implementable via an API in virtually any programming language) specially designed for collecting
and making use of human intelligence in a computer program.
One typical usage is implementing impossible-to-automate functions.
For example, it is currently difficult for a computer to differentiate between images of men, women and non-humans. However, this is easy for people. A programmer using CHI could write a code fragment along these lines:
enum GenderCode {
MALE, FEMALE, NOT_A_HUMAN
}
Photo photo = loadPhoto(file)
GenderCode result = checkGender(photo)
Code for the function checkGender(Photo p) can currently only approximate a result, but the task can easily be solved by a person. When the function checkGender() is called, the system will send a request to someone, and the person who received the request will process the task and input the result. If the person (task processor) inputs value MALE, you'll get the value in your variable result, in your program. This querying process can be highly automated.
Deployment
On November 6, 2005, Amazon.com launched
CHI as its business platform in the Amazon Mechanical Turk. It's the first business application using CHI.
Origins
CHI is originally mentioned in Philipp Lenssen's blog.
References
External links
"Amazon looks to solve problems that stump computers", ZDnet, Nov 10, 2005
Domain-specific programming languages
Human-based computation
|
https://en.wikipedia.org/wiki/MSNBC%20Reports
|
MSNBC Reports (formerly MSNBC Live) is the blanket title for the daytime rolling news programming block of the American cable news channel MSNBC.
Programs under the banner are broadcast from 10:00 a.m. to 4:00 p.m. ET on weekdays, 12:00 p.m. to 4:00 p.m. ET on Saturdays, and 1:00 p.m. to 4:00 p.m. ET on Sundays. The programs are officially branded under the title of the current anchor, i.e. Katy Tur Reports—a naming scheme introduced in 2021 that was influenced by the existing MSNBC program Andrea Mitchell Reports.
History
MSNBC Reports is the name of several hours of straight news programming on the network (both weekdays and weekends), similar to what is known as "dayside" programming on other cable news channels. Beginning in 2009, MSNBC began to fill in these hours with more "opinionated" news programming. During the network's pivot back to hard news in 2015, the name, then-MSNBC Live, returned during daytime hours. The brand is also used during holidays and as fill-in programming when a show ends or is canceled until a new show is ready.
The program aired at various times through the years, but most recently aired Saturdays from 2-4 pm ET, and Sundays from 3-4 pm ET until late 2014, when the program's anchor, Craig Melvin, was reassigned, seeing the end of the program.
After Andrew Lack became chairman of the NBC News Group in 2015, MSNBC began to remove opinion-driven programs from its daytime lineup in favor of more live news programming. Thomas Roberts was appointed to a new weekday time slot from 1-3 pm ET under the Live branding, beginning on March 2. Later in August 2015, MSNBC Live was extended to 1-6 pm ET, replacing the canceled The Cycle, Now with Alex Wagner, and The Ed Show.
On October 5, 2015, José Díaz-Balart's morning program, The Daily Rundown, and Tamron Hall's show of five years, NewsNation, were reverted to the Live branding, airing at 9:00 a.m. and 11:00 a.m, respectively. In July 2016, Díaz-Balart left MSNBC to begin his new duties as Saturday anchor of the NBC Nightly News. He was succeeded by Weekend Today anchor Craig Melvin. On December 15, 2016, Thomas Roberts was removed from the 3:00 p.m. hour.
In January 2017, Hallie Jackson and Katy Tur were announced as the new anchors for the 9:00 a.m. and 2:00 p.m. hours respectively. In February 2017, Tamron Hall departed from MSNBC and Today. In March 2017, MSNBC began to increase its use of NBC News branding during its daytime programming (including on sets and graphics), in order to emphasize its leverage of the division's resources. In April 2017, Kate Snow left the network, electing to focus more on long-form reporting and her role as a Sunday anchor for the NBC Nightly News. Steve Kornacki's 4 p.m. hour was replaced on May 8, 2017, with Deadline: White House, a new program hosted by Nicolle Wallace.
In 2020, Ali Velshi moved from the daytime lineup to weekend mornings, replacing David Gura's Up. Gura moved to a Saturday afternoon MSNBC Live block. On March 2,
|
https://en.wikipedia.org/wiki/Open%20Invention%20Network
|
Open Invention Network (OIN) is a company that acquires patents and licenses them royalty-free to its community members who, in turn, agree not to assert their own patents against Linux and Linux-related systems and applications.
History
The company was incorporated on 31 October 2005. Based in Durham, NC, it was founded on November 10 by IBM, Novell, Philips, Red Hat, and Sony. NEC subsequently became a member. In December 2013, Google became a member. In July 2016, it was announced that Toyota became a member. On October 10, 2018, Erich Andersen announced that Microsoft joined as a licensee. Canonical and TomTom are associate members. Keith Bergelt is the chief executive of the company. Bergelt had previously served as President and CEO of Paradox Capital, LLC As of November, 2021 membership in the OIN stood at approximately 3,500 business licensees.
The list of applications considered by OIN, according to Red Hat's Mark Webbink, includes Apache, Eclipse, Evolution, Fedora Directory Server, Firefox, GIMP, GNOME, KDE, Mono, Mozilla, MySQL, Nautilus, OpenLDAP, OpenOffice.org, Open-Xchange, Perl, PostgreSQL, Python, Samba, SELinux, Sendmail, and Thunderbird.
There have been 10 updates, produced through a well-established process of carefully maintaining a balance between stability and adding innovative core open source technology, to the list of software components and packages covered by the Open Invention Network cross license. As of March 2022, more than 3,700 packages have been listed.
On March 26, 2007, Oracle licensed OIN's portfolio, thus agreeing not to assert patents against the Linux-based environment, including competitors MySQL and PostgreSQL when used as part of a Linux system. Oracle exercised a Limitation Election on March 29, 2012. On August 7, 2007, Google also joined OIN as a licensee. On October 2, 2007, Barracuda Networks joined OIN as a licensee. On March 23, 2009 TomTom joined OIN as a licensee. In May 2011, the European Open Source software manufacturer Univention joined OIN as a licensee.
In early September 2009, Open Invention Network acquired 30 patents, from Allied Security Trust, another defensive patent management organization, that had been acquired from Microsoft through a private auction. If the patents had been acquired by patent trolls, they might have caused financial obstacles to Linux developers, distributors and users. OIN was able to avert this issue with the patent acquisition.
On October 10, 2018, Microsoft joined the Open Invention Network community despite holding more than 60,000 patents.
On November 19, 2019, Open Invention Network announced that it was teaming with IBM, Microsoft and the Linux Foundation to further protect Linux and open source from Patent Assertion Entities (PAE), commonly called Patent Trolls. Together, the organizations are funding a multi-million dollar, multi-year initiative with Unified Patents' Open Source Zone. This expands OIN’s and its partners’ patent non-aggression a
|
https://en.wikipedia.org/wiki/S6
|
S6 or S-6 may refer to:
Routes
S6 (Berlin), a S-Bahn line
S6 (Milan suburban railway network)
S6 (Munich), a S-Bahn line in Munich
S6 (Rhine-Main S-Bahn)
S6 (Rhine-Ruhr S-Bahn), line
S6 (St. Gallen S-Bahn)
S6 (ZVV), a S-Bahn line in the cantons of Zürich and Aargau in Switzerland
County Route S6 (California)
Expressway S6 (Poland)
Essex, a county of England
S6 postcode, covering areas of north western Sheffield
a Hanover S-Bahn, line
a Rhein-Ruhr S-Bahn, line
a Rhine-Main S-Bahn, line
a Stuttgart S-Bahn, line
a Stadtbahn Karlsruhe, line
Tongmi line
Science
Ribosomal protein s6
S6: Keep under ... (inert gas to be specified by the manufacturer), a safety phrase in chemistry
hexasulfur, a cyclic sulfur allotrope
the symmetric group of degree six
Technology
Samsung Galaxy S6, a smartphone produced by Samsung
Samsung Galaxy Tab S6, an Android tablet
S6 NBC Respirator, the protective gas mask issued to the British armed forces from 1966 up until the introduction of the current-issue S10 in 1986
S6 truss, a part of the International Space Station
Vehicles
Audi S6, a car
ALCO S-6, and American diesel switching (shunting) locomotive
Prussian S 6, a 1906 steam locomotives class
Rans S-6 Coyote II, a light aircraft
Supermarine S.6, and Supermarine S.6B, two 1929 and 1931 racing seaplanes
USS S-6 (SS-111), a 1919 S-class submarine of the United States Navy
HMS Cachalot (S06), a 1957 British Porpoise-class submarine
Other uses
S6 (military), a communications officer within military units
Star Air (Denmark), IATA airline designator
S6 (classification), a paralympic swimming classification
|
https://en.wikipedia.org/wiki/Connecticut%20Food%20Bank
|
Connecticut Food Bank is a nonprofit organization, based in Wallingford, Connecticut. As a member of Feeding America, Connecticut Food Bank secures food donations from a national and regional network of food donors, retail partners, manufacturers, wholesalers and farms. Connecticut Food Bank supplies food to a network of local agencies and programs (such as soup kitchens, food pantries, and emergency shelters) serving nearly 270,000 food-insecure individuals of all ages across the six counties of Fairfield, Litchfield, Middlesex, New Haven, New London, and Windham. In 2019, Connecticut Food Bank distributed enough food to provide nearly 22.5 million meals.
History
Born from the concept of matching excess food supplies to individuals with limited resources, Connecticut Food Bank began distributing food in 1982 out of a 2,000 square foot warehouse in New Haven, supplying 400,000 pounds to 70 programs. Today, through distribution centers in Wallingford and Bridgeport, and an affiliated distribution center in New London, Connecticut Food Bank provides 27 million pounds of nutritious food annually to people in need.
See also
List of food banks
References
External links
Food banks in Connecticut
Charities based in Connecticut
Organizations established in 1982
1982 establishments in Connecticut
|
https://en.wikipedia.org/wiki/E-mu%20Emulator%20X
|
Emulator X is a software-based audio sampler that was produced by E-MU Systems from 2004 to 2009.
Emulator X software is compatible with PCs running the Microsoft Windows operating system. The sampler can operate as a stand-alone program or as a VST instrument and, as of Emulator X3, is available in both 32-bit and 64-bit versions.
For the software to run, one of several sound cards sold by E-MU was originally required. The sound card acted as a hardware dongle to prevent unauthorised use without the purchase of an E-MU branded device. This requirement was later dropped with the release of Emulator X3.
Versions
Following E-MU's decision to end sales and production of its hardware sampler line in 2003, Emulator X was released as the company's first entry into the software sampler market in 2004. Emulator X2 was released in 2006, followed by the third and final incarnation, Emulator X3, in 2009. The product has since been discontinued and is no longer available to purchase from either E-MU or its parent company, Creative Technology.
Functionality
Emulator X was largely based on E-MU's hardware sampler operating system, EOS. As such, it replicates or expands upon most of the design and features available in the final revision of the operating system, EOS 4.70. An example of this is the inclusion of E-MU's highly publicized "Z-Plane" filters, with Emulator X containing over 25 new filters not available in EOS.
It is also capable of importing and exporting bank files in EOS format for compatibility with E-MU's legacy hardware samplers such as the Emulator IV and E4 Ultra series devices.
It is the last software sampler produced that retains the ability to directly sample other sources, in contrast to current software samplers, which require existing samples and are therefore more akin to traditional ROMplers. Among the more noteworthy sampling features added in Emulator X2 is SynthSwipe, a tool which gives Emulator X the ability to sample from connected MIDI devices such as hardware synthesizers by sending a series of notes at differing velocities via MIDI and automatically recording the device's output to create a new fully mapped sample bank.
References
Samplers (musical instrument)
|
https://en.wikipedia.org/wiki/WJMN-TV
|
WJMN-TV (channel 3) is a television station licensed to Escanaba, Michigan, United States, serving the Central and Western Upper Peninsula of Michigan as an affiliate of MyNetworkTV. The station is owned by Nexstar Media Group, and maintains studios off US 41/M-28 on Wright Street in Marquette Township; its transmitter is located in unincorporated northern Delta County (south of the Alger County line).
Master control and internal operations for WJMN are based at the studios of Nexstar sister station and CBS affiliate WFRV-TV (channel 5) on East Mason Street in Green Bay, Wisconsin. Although identifying as a separate station in its own right, WJMN operated as a semi-satellite of WFRV, which established it in 1969 to expand its reach into Upper Michigan and far Northeastern Wisconsin.
On January 21, 2022, WJMN disaffiliated from CBS and became a MyNetworkTV affiliate, retaining previous syndicated programming, but also taking programming from Nexstar-owned classic television network Antenna TV to fill time where CBS programming formerly resided. The station also extended its existing 6 p.m. newscast to one hour, while moving its 11 p.m. newscast to a 10 p.m. hour. WZMQ (channel 19) acquired the CBS affiliation for its second digital subchannel.
History
Establishment as WFRV-TV satellite
As early as 1960, WFRV-TV began to analyze ways to extend its reach in the Upper Peninsula. The station had applied for channel 8 at Iron Mountain, Michigan, which was abandoned after WFRV-TV was sold that year alongside an application for channel 9 in Wausau, Wisconsin. Seven years later, Orion Broadcasting renewed the push by filing for channel 3 at Escanaba on June 20, 1967. A push by Northern Michigan University to use channel 3 instead of 13 for educational television use in the Upper Peninsula delayed approval until April 1969. From a transmitter site and new near Trenary, WJMN-TV—so designated in honor of Jane Morton Norton, chairwoman of the board of Orion Broadcasting and a part of the Norton family that founded the company—began broadcasting October 7, bringing a full NBC lineup and WFRV-TV's signal to a further 50,000 households.
Orion Broadcasting reached a deal to merge with Cosmos Broadcasting, a subsidiary of the Liberty Corporation, in 1980. The merger would put the combined company over the limit for the number of VHF television stations it could own, prompting it to immediately announce that it would divest WFRV-WJMN. In January 1981, Cosmos found a buyer: Midwest Radio-Television, owners of WCCO radio and television in Minneapolis. The transaction closed in October.
WJMN's connection to WFRV meant that affiliation switches in Green Bay twice affected viewers in Marquette. In 1983, the two stations switched from NBC to ABC; this prompted the other established station in Marquette, WLUC-TV, to drop its ABC programming for NBC. The two stations then changed network affiliations one more time in 1992, after CBS purchased Midwest Radio-Televisi
|
https://en.wikipedia.org/wiki/Daniel%20P.%20Friedman
|
Daniel Paul Friedman (born 1944) is a professor of Computer Science at Indiana University in Bloomington, Indiana. His research focuses on programming languages, and he is a prominent author in the field.
With David Wise, Friedman wrote a highly influential paper on lazy programming, specifically on lazy streams (ICALP 1976). The paper, entitled "Cons should not evaluate its arguments," is one of the first publications pushing for the exploration of a programming style with potentially infinite data structures and a form of programming that employs no computational effects (though programs may diverge). Over the 1970s, Friedman and Wise explored the topic in depth and also considered extensions to the world of parallel computing.
In the 1980s, Friedman turned to the study of the Scheme programming language. He explored the use of macros for defining programming languages; with Eugene Kohlbecker, Matthias Felleisen, and Bruce Duba, he co-introduced the notion of hygienic macros in a 1986 LFP paper that is still widely cited today. With Christopher T. Haynes and Mitchell Wand, he simultaneously studied the nature of continuation objects, their uses, and the possibilities of constraining them. Following that, Friedman and Felleisen introduced a lambda calculus with continuations and control operators. Their work has spawned work on semantics, connections between classical logic and computation, and practical extensions of continuations.
Friedman is also a prolific textbook author. His first textbook, The Little LISPer, dates back to 1974 and is still in print in its fourth edition, now called The Little Schemer (with Felleisen). Friedman and Felleisen wrote three more "little" books in the 1990s: The Little MLer, The Seasoned Schemer, and A Little Java, A Few Patterns.
Friedman is also the lead author of Essentials of Programming Languages, a textbook on programming languages. As such, it changed the landscape of language textbooks in the 1980s, shifting the focus from surveys of languages to the study of principles via series of interpreters. Today's textbooks on this topic tend to follow this organization, employing operational semantics and type theory instead of interpreters. Like The Little LISPer, Essentials of Programming Languages is a long-living book and is in its third edition now.
Most recently, Friedman resumed work on his "Little" series with the following titles: The Reasoned Schemer (with William E. Byrd and Oleg Kiselyov) explains logic programming via an extension of Scheme. The Little Prover (with Carl Eastlund) introduces inductive proofs as a way to determine facts about computer programs. The Little Typer (with David Thrane Christiansen) explains dependent types, beginning with a very small language that looks very much like Scheme and extending it to cover both programming with dependent types and using dependent types for mathematical reasoning. The Little Learner (with Anurag Mendhekar) introduces deep learning fr
|
https://en.wikipedia.org/wiki/George%20Vari%20Engineering%20and%20Computing%20Centre
|
The George Vari Engineering and Computing Centre is a 4-story building that is part of Toronto Metropolitan University in Toronto, Ontario, Canada.
Initially, in 2000, Santiago Calatrava proposed that the engineering building be 33 floors. The cost was $90 million and $25 million over the university's budget.
Completed in 2004 by Moriyama & Teshima Architects, the state-of-the-art building cost $45 million to complete.
The building houses the Faculty of Engineering and Architectural Science Dean's Office, the First Year Engineering Office and the offices for the Departments of Aerospace Engineering; Electrical, Computer, and Biomedical Engineering; Computer Science; and Mathematics.
The building was officially renamed in 2005 as the George Vari Centre for Computing and Engineering after a gift from George and Helen Vari.
References
External links
Ryerson Centre for Computing and Engineering
Timelapse movie of the construction
Photographs of the construction
Toronto Metropolitan University buildings
|
https://en.wikipedia.org/wiki/Witty%20%28computer%20worm%29
|
The Witty worm was a computer worm that attacked the firewall and other computer security products written by a particular company, the Internet Security Systems (ISS) now IBM Internet Security Systems. It was the first worm to take advantage of vulnerabilities in the very pieces of software designed to enhance network security, and carried a destructive payload, unlike previous worms. It is so named because the phrase "(^.^) insert witty message here (^.^)" appears in the worm's payload.
The Witty worm incident was unique in that the worm spread very rapidly after announcement of the ISS vulnerability (a day later), and infected a much smaller and presumably harder-to-infect (because the administrators had taken security measures) host population than previous worms.
Propagation
On March 19, 2004, the 'Witty' worm began infecting hosts connected to the Internet (and running the vulnerable ISS software) without any seed population. Within a half-hour it infected 12,000 computers and was generating 90 Gbit/s (gigabits per second) of UDP traffic.
Effect of worm
Once Witty infects a computer by exploiting a vulnerability in the ISS software packages (RealSecure Network, RealSecure Server Sensor, RealSecure Desktop, and BlackICE), it attempts to infect other computers using the same vulnerability.
Witty launches these attacks as fast as possible, attacking a pseudo-random subset of IP addresses as quickly as allowed by the computer's Internet connection. It repeats these attacks in groups of 20,000, alternately launching attacks and overwriting sections of the computer's hard disk(s).
References
Shannon, Colleen and David Moore (2004). "The Spread of the Witty Worm". (Last updated June 21, 2005; Retrieved November 14, 2005.)
Abhishek Kumar, Vern Paxson and Nicholas Weaver (2005). "Outwitting the Witty worm". (Last updated May 24, 2005; Retrieved February 2, 2006.)
External links
ISS vulnerability announcement (from Internet Archive)
Analysis of the worm propagation by CAIDA (Cooperative Association for Internet Data Analysis)
Slashdot article
Exploit-based worms
Hacking in the 2000s
|
https://en.wikipedia.org/wiki/Cray%20MTA-2
|
The Cray MTA-2 is a shared-memory MIMD computer marketed by Cray Inc. It is an unusual design based on the Tera computer designed by Tera Computer Company. The original Tera computer (also known as the MTA) turned out to be nearly unmanufacturable due to its aggressive packaging and circuit technology. The MTA-2 was an attempt to correct these problems while maintaining essentially the same processor architecture respun in one silicon ASIC, down from some 26 gallium arsenide ASICs in the original MTA; and while regressing the network design from a 4-D torus topology to a less efficient but more scalable Cayley graph topology. The name Cray was added to the second version after Tera Computer Company bought the remains of the Cray Research division of Silicon Graphics in 2000 and renamed itself Cray Inc.
The MTA-2 was not a commercial success, with only one moderately-sized 40-processor system ("Boomer") being sold to the United States Naval Research Laboratory in 2002, and one 4-processor system sold to the Electronic Navigation Research Institute (ENRI) in Japan.
The MTA computers pioneered several technologies, presumably to be used in future Cray Inc. products:
A simple, whole-machine-oriented programming model.
Hardware-based multithreading.
Low-overhead thread synchronization.
See also
Cray MTA
Heterogeneous Element Processor
References
External links
Utrecht University HPCG - Cray MTA-2 page
Mta-2
Supercomputers
|
https://en.wikipedia.org/wiki/Bangkok%20Bank
|
Bangkok Bank Public Company Limited (, RTGS: Thanakhan Krung Thep) is one of the largest commercial banks in Thailand. Its branch network includes over 1,165 branches as of September 2018, within Thailand, with 32 international branches in 15 economies, including wholly owned subsidiaries in Indonesia, Malaysia, and China. Bangkok Bank has branches in London and New York to complement its Southeast Asian network.
History
Bangkok Bank was established in 1944 and was listed on the Stock Exchange of Thailand in 1975.
One of Thailand's 3rd class banks, Bangkok Bank has an extensive distribution channel network to serve a variety of customers. Services are provided through physical premises such as branches and business centers, digital banking such as internet banking ("Bualuang iBanking"), mobile banking (Bualuang mBanking), phone banking, 9,300 ATMs, 1,200 CDMs, and other self-service machines.
Bangkok Bank currently has the largest overseas branch network of any Thai bank with 32 international branches in 15 economies, including wholly owned subsidiaries in Malaysia and China. The international branch network is concentrated in Southeast Asia, China, Hong Kong, Taiwan and Japan; and the bank also has branches in London and New York. Bangkok Bank is the only Thai bank with a local bank in China with its head office in Shanghai and six branches. The China branches are in Shanghai, Beijing, Shenzhen, Chongqing, Xiamen, and the Shanghai Free Trade Zone. Bangkok Bank has 16 international branches in ASEAN countries which form the ASEAN Economic Community (AEC). Bangkok Bank is the only Thai bank to have a branch in Myanmar where its Yangon Branch opened on 2 June 2015.
Bangkok Bank has 1,167 branches in its domestic network, including self-service outlets, covering all 77 provinces in Thailand. The branch network is one of the largest branch networks among Thai banks, second only in size to Krung Thai Bank. In 2018 the bank also had 117 business centers, 126 business desks and 68 trade finance centers.
In 2020, Bangkok Bank purchased an 89.12% stake in Indonesia's PermataBank from Standard Chartered and Astra International for Rp33.66 trillion (US$2.3 billion). The Indonesian branch of Bangkok Bank merged its operations with PermataBank from December 2020, with PermataBank as the surviving entity.
Bangkok Bank has a full range of business, investment banking, and personal banking services. It is one of the most active global traders of Thai baht and baht-denominated bonds. The bank trades in all major currencies as well as a large number of regional currencies. Other services include same-day transactions in import and export bills, inward and outward remittances, swaps, options, and forward contracts trading in the primary and secondary markets for government bonds and corporate debentures.
The company's current president is Chartsiri Sophonpanich, the grandson of its founder and former president Chin Sophonpanich, and the son of former pres
|
https://en.wikipedia.org/wiki/Gloom%20%28video%20game%29
|
Gloom is a 1995 computer game for the Amiga computer. Gloom was the first commercially released Amiga clone of first-person shooter Doom.
Gameplay
Gloom features 'Messy' or 'Meaty' graphics settings. If 'Messy' graphics are enabled, gibs from enemies explode more violently but disappear promptly, and if 'Meaty' graphics are enabled, all gibs from defeated enemies will remain on the floor where they died until the level is completed. Gloom Deluxe is playable on a workbench screen, a feature absent from its predecessor. Gloom has a two-player mode, and can be played over a network or by using split screen.
History
Gloom was developed as an Amiga Doom clone by Mark Sibly (programmer) Kurt & Hans Butler (graphics), Laki Schuster (additional artwork) and Kev Stannard (music). A later version of the game, Gloom Deluxe, featured higher resolution graphic modes.
Gloom was followed by Gloom 3. A Gloom 2 was announced but not released.
In January 2017 the assembly and BlitzBasic 2 source code of Gloom was released as public domain software under unlicense on GitHub. The assets were released "for historical and archiving purposes".
Development
Gloom's map editor and utility programs were written in Blitz BASIC, a programming language written by Mark Sibly, one of the developers of Gloom. Gloom was developed in a year, and development began in May 1994. In a 1995 issue of The One, a British gaming magazine, Gloom was previewed before release with some information about its development. Gloom was also the cover story of this issue, and a demo of Gloom was included on the cover disk. The One's logo is on several walls in Gloom in the demo. Several developers at Black Magic Software were interviewed, including Mark Sibly, Hans and Kurt Butler, who worked on graphics, and Kev Stannard. Mark stated in regards to Gloom's name: "The name sort of started out as a joke ... just something to call the project while we were working on it. By the time we had to settle on a 'real' name, we threw around some petty weird ones like Gorefest '95, and Bloodbath, but wound up sticking with Gloom. Probably because we were all used to it."
The crew behind Gloom met while working on a game together, with Mark describing the situation as "a bit of a drama, to be honest. We'd gone over there to work for this rich guy who wanted to get into the games publishing biz, but things turned pretty ugly at the end. We actually finished the game, but nothing ever came of it." While it is a Doom clone, the development team attempted to differentiate Gloom from its inspiration and other Doom clones by dividing the game into "distinct graphic styles" to "alter the mood of the game entirely." A trait noted by Kurt Butler is that many other Doom clones' sprites "don't really stand out from the background graphics ... I think this is due to the fact that they used colours too dull and similar to the background shades." Gloom's enemy sprites are designed to stand out from the background, w
|
https://en.wikipedia.org/wiki/Warner%20Bros.%20Discovery%20EMEA
|
Warner Bros. Discovery Europe, Middle East & Africa (EMEA) is a division of Warner Bros. Discovery. The division is responsible for managing the collection of their cable and satellite networks around the Europe, Middle East and Africa regions.
History
WarnerMedia EMEA
As Turner Broadcasting System EMEA
In 1985, Ted Turner launched a European division in London, England, which would reach across the Middle East and African regional feed.
Rebranding as WarnerMedia
In 2019, Turner EMEA would be moving to its new headquarters in Old Street, Shoreditch, London. The new headquarters would have more office space, allowing room for the company's European operations to expand, and a brand new custom-built CNN newsroom. The remaining division was later rebranded as WarnerMedia EMEA by 2020.
Discovery Networks EMEA
It started out with the launch of the Discovery Channel in Europe in 1989. In mid-2007, Discovery Networks Europe was split into two separate branches, Discovery Networks UK and Discovery Networks EMEA, with the following: localised branches Discovery Networks Deutschland, Discovery Networks Benelux, Discovery Networks Nordic, Discovery Networks Italia and Discovery Networks EMEA (which served all other territories). Again in 2011, Discovery Networks Europe was split into two key branches Discovery Networks Western Europe (DNWE) and Discovery Networks CEEMEA (Central & Eastern Europe, Middle East and Africa). DNWE was located in London and the operations in the United Kingdom, Republic of Ireland, Netherlands, Sweden, Denmark, Norway, Finland, France and Flanders. All other operations in Europe are operated by Discovery Networks CEEMEA in Warsaw.
In November 2014, Discovery Networks Western Europe was split into Discovery Networks Northern Europe and Discovery Networks Southern Europe. Its previous Discovery Networks Western Europe served 30 countries including the United Kingdom, Ireland, Iceland, Denmark, Sweden, Norway, France, the Netherlands and other territories, comprising 18 brands.
Between 2014 and 2016 Discovery Networks EMEA consisted of the following branches: Northern Europe, CEEMEA, Southern Europe.
From late 2016 all localised operations fall under the umbrella of Discovery EMEA with headquarters in Amsterdam and London, and local offices in among other Milan and Warsaw.
Discovery halted all broadcasts of its 15 linear channels to Russia through the Media Alliance partnership on 9 March 2022 in response to the Russian invasion of Ukraine.
Merger as Warner Bros. Discovery EMEA
Discovery EMEA were merged into WarnerMedia, forming Warner Bros. Discovery EMEA in 2022.
Pan-European
Animal Planet
CIS
Denmark
Netherlands & Flanders
Poland
Scandinavia
Boing
Africa
Italy (49%)
Spain (50%)
Boomerang
France
Italy
Cartoon Network
Arabic
Central and Eastern Europe
CIS and Southeastern Europe
France, Wallonia and Switzerland
Germany, Austria, Switzerland and Liechtenstein
Italy
Middle East, Africa and Cyprus
|
https://en.wikipedia.org/wiki/Parallel%20optical%20interface
|
A parallel optical interface is a form of fiber optic technology aimed primarily at communications and networking over relatively short distances (less than 300 meters), and at high bandwidths.
Parallel optic interfaces differ from traditional fiber optic communication in that data is simultaneously transmitted and received over multiple fibers. Different methods exist for splitting the data over this high bandwidth link. In the simplest form, the parallel optic link is a replacement for many serial data communication links. In the more typical application, one byte of information is split up into bits and each bit is coded and sent across the individual fibers. Needless to say, there are many ways to perform this multiplexing provided the fundamental coding at the fiber level meets the channel requirement.
The main applications for parallel optical interfaces are found in telecommunications and supercomputers, also being introduced to consumer applications. It displaces copper backplanes that are commonly used for large switching equipment design.
There are two forms of commercially available products for parallel optic interfaces. The first is a twelve channel system consisting of an optical transmitter and an optical receiver. The second is a four channel transceiver product that is capable of transmitting four channels and receiving four channels in one product.
Parallel optics is often the most cost effective solution for getting 40 Gigabit per second transmission of data over distances exceeding 100 meters. 100GE Optical Transceiver comes with 100 Gigabit of data transmit. Data is delivered in both duplex and parallel mechanism with 100GE.
See also
Thunderbolt (interface)
Interconnect bottleneck
Optical fiber cable
Optical communication
References
Fiber-optic communications
|
https://en.wikipedia.org/wiki/The%20Big%20Showdown
|
The Big Showdown is an American game show that aired on the ABC television network from December 23, 1974 to July 4, 1975. Jim Peck (in his national television debut) hosted the program and Dan Daniel (then a disc jockey on New York City's WHN) served as announcer.
The series was recorded at ABC's New York studio TV15 on West 58 Street, and packaged by Don Lipp’s Daphne Productions and Ron Greenberg, with assistance by MCA Television.
Gameplay
The Big Showdown
Three contestants competed. Before the round began, Peck announced a target score or "payoff point," and selected a dollar value for it by pressing a buzzer on his podium to stop a randomizer ($25, $50, $75, $100, or $500). He then read a one-point toss-up question. The first contestant to buzz-in and correctly answer it chose from one of six available categories, each with a different point value from 1 to 6 as represented by faces of a die. A correct answer to a question awarded the points for the chosen category and allowed the contestant to select the next one. A miss locked the contestant out of that question and gave the opponents a chance to answer. The payoff point had to be reached exactly, and contestants were not allowed to select or answer any question that would put them over that total, being automatically locked out in the latter case. The first contestant to reach the payoff point won the money associated with it. A new dollar value and payoff point were set, the latter raised by several points above the previous one, and Peck asked a one-point toss-up to award control of the board. A toss-up was also asked whenever all players missed a question.
A new set of categories was introduced after the second payoff point had been reached. Four or more payoff points were played during this round, depending on the speed with which the game progressed.
At the sound of a bell, a 90-second speed round was played under the same rules. The current payoff point (if any) was played for its set value, after which all others were worth $100. Once time ran out, the two highest scorers advanced to the Final Showdown. The lowest scorer was eliminated and kept his/her money, or received a parting gift if he/she had not hit any payoff points.
In the event of a tie, Peck asked questions from the one-point category to the tied contestants until the deadlock was broken. Answering correctly allowed the contestant to advance, while an incorrect answer eliminated the contestant.
Final Showdown
The two remaining contestants competed to reach a payoff point of seven. Three categories were played, again represented by faces on a die, and point values were 1, 2, and 3 respectively. The scores were reset to zero, and the contestant who had been in the lead at the end of the Big Showdown chose the first category. As before, no contestant could choose or answer a question that would put him/her above the payoff point. If both contestants missed a question, a one-point toss-up was asked for control of th
|
https://en.wikipedia.org/wiki/High-water%20mark%20%28computer%20security%29
|
In the fields of physical security and information security, the high-water mark for access control was introduced by Clark Weissmann in 1969. It pre-dates the Bell–LaPadula security model, whose first volume appeared in 1972.
Under high-water mark, any object less than the user's security level can be opened, but the object is relabeled to reflect the highest security level currently open, hence the name.
The practical effect of the high-water mark was a gradual movement of all objects towards the highest security level in the system. If user A is writing a CONFIDENTIAL document, and checks the unclassified dictionary, the dictionary becomes CONFIDENTIAL. Then, when user B is writing a SECRET report and checks the spelling of a word, the dictionary becomes SECRET. Finally, if user C is assigned to assemble the daily intelligence briefing at the TOP SECRET level, reference to the dictionary makes the dictionary TOP SECRET, too.
Low-water mark
Low-water mark is an extension to Biba Model. In the Biba model, no-write-up and no-read-down rules are enforced. In this model, the rules are exactly opposite of the rules in Bell-La Padula model. In the low-water mark model, read down is permitted, but the subject label, after reading, will be degraded to object label. It can be classified in floating label security models.
See also
Watermark (data synchronization)
References
Computer security models
|
https://en.wikipedia.org/wiki/Telecommunications%20systems%20management
|
Telecommunications systems management (Telecomm or TSM for short, also Telecommunication systems, Telecommunications management, Network management) is an interdisciplinary area of study offered at some universities to fill the need for a liaison between the technical aspect and the business aspect of telecommunications. At Murray State University it has been regarded as a half-and-half program, half business and half networking classes with the option to specialize in certain aspects in the field.
Colleges and Universities Offering TSM
California State University, East Bay
Capitol College
DePaul University
Istanbul Technical University
Midlands Technical College
Murray State University
University of Athens
New Jersey Institute of Technology
New York Institute Of Technology
Northeastern
Ohio University
Oklahoma State University (College of Engineering, Architecture, and Technology)
Stevens Institute of Technology
Syracuse University
Trident Technical College
University of Maryland University College
University of Pennsylvania
Indian Institute of Technology Delhi - Department of Management Studies (DMS-IIT Delhi)
Network management
Telecommunications systems
|
https://en.wikipedia.org/wiki/Airespace
|
Airespace, Inc., formerly Black Storm Networks, was a networking hardware company founded in 2001, manufacturing wireless access points and Controllers. The company developed the AP-Controller model for fast deployment and the Lightweight Access Point Protocol, the precursor to the CAPWAP protocol.
Corporate history
Airespace was founded in 2001 by Pat Calhoun, Bob Friday, Bob O'Hara, and Ajay Mishra. The company was venture backed by Storm Ventures, Norwest Venture Partners and Battery Ventures. In 2003, it entered into an agreement to provide OEM equipment to NEC. In 2004 it signed an agreement with Alcatel and Nortel to provide equipment to the two companies on an OEM basis.
Airespace was first to market with integrated location tracking. Within a year and a half, the company grew rapidly into the market leader of enterprise Wi-Fi.
Cisco Systems acquired Airespace in 2005 for $450 million; this was one of 13 acquisitions Cisco made that year and the largest up to that point. Airespace products were merged into Cisco Aironet product line.
References
2001 establishments in California
2005 disestablishments in California
2005 mergers and acquisitions
American companies established in 2001
American companies disestablished in 2005
Cisco Systems acquisitions
Computer companies established in 2001
Computer companies disestablished in 2005
Defunct computer companies of the United States
Defunct computer hardware companies
Defunct networking companies
Networking hardware companies
|
https://en.wikipedia.org/wiki/Alexander%20Tropsha
|
Alexander Tropsha is a chemist and professor at the University of North Carolina - Chapel Hill. Tropsha is Associate Dean for Pharmacoinformatics and Data Science at the UNC Eshelman School of Pharmacy. His primary fields of research are cheminformatics and quantitative structure-activity relationship (QSAR) modeling in the context of drug discovery. As of 2015, Tropsha has been an associate editor of the American Chemical Society’s Journal of Chemical Information and Modeling.
Background
In 1982, Tropsha earned his master's degree chemistry from Moscow State University. Tropsha continued his studies under Lev S. Yaguzhinski earning his PhD in biochemistry and pharmacology in 1986.
Tropsha immigrated to the United States in 1989 where he began his career in academics as an assistant professor and director of the Laboratory for Molecular Modeling at the University of North Carolina - Chapel Hill in 1991. Tropsha became a professor in 2004, and, in 2008, he became the K.H. Lee Distinguished Professor at the UNC Eshelman School of Pharmacy.
Research
Research in his laboratory includes the development and application of k-nearest neighbor pattern recognition methods to the field of QSARs and application of the Delaunay tessellation technique to protein structure analysis. His recent work focuses on methods of rigorous validation of QSAR models and the development of best-practice QSAR workflows. Tropsha's group has also raised concerns over the utility of structural alerts in toxicology and for PAINS.
References
Living people
21st-century American chemists
Moscow State University alumni
University of North Carolina at Chapel Hill faculty
Year of birth missing (living people)
|
https://en.wikipedia.org/wiki/Data%20file
|
A data file is a computer file which stores data to be used by a computer application or system, including input and output data. A data file usually does not contain instructions or code to be executed (that is, a computer program).
Most of the computer programs work with data files.
Types of data files
Data files can be stored in two ways:
Text files;
Binary files.
Text files
A text file (also called ASCII files) stores information in ASCII characters. A text file contains human-readable characters. A user can read the contents of a text file or edit it using a text editor. In text files, each line of text is terminated, (delimited) with a special character known as EOL (End of Line) character. In text files some internal translations take place when this EOL character is read or written.
Examples of text files
A text document (often .txt)
Binary files
A binary file is a file that contains information in the same format in which the information is held in memory, i.e. in the binary form. In a binary file, there is no delimiter for a line. Also no translations occur in binary files. As a result, binary files are faster and easier for a program to read and write than the text files. As long as the file doesn't need to be read or ported to a different type of system, binary files are the best way to store program information.
Examples of binary files
A JPEG image (.jpg or .jpeg)
Data file categories
Closed data file formats, frequently referred to as proprietary format files, have their metadata data elements hidden, obscured or unavailable to users of the file. Application developers do this to discourage users from tampering with or corrupting the data files or importing the data into a competitor's application.
Open data format files have their internal structures available to users of the file through a process of metadata publishing. Metadata publishing implies that the structure and semantics of all the possible data elements within a file are available to users.
Examples of open data files include CSV, XLS and XML formats such as HTML for storing web pages or SVG for storing scalable graphics.
See also
Index file
Indexed file
Database
Serialisation
References
Computer files
Data types
|
https://en.wikipedia.org/wiki/When%20Flanders%20Failed
|
"When Flanders Failed" is the third episode of the third season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on October 3, 1991. In the episode, Homer makes a wish for Ned Flanders's new left-handed store to go out of business. The wish comes true and soon the Flanders family is in financial trouble. When he discovers that Ned's house is about to be repossessed, Homer feels guilty. He helps the store flourish by telling all of Springfield's left-handed citizens to patronize it. Meanwhile, Bart takes karate lessons but quits after learning it is not as interesting as he had hoped.
The episode was written by Jon Vitti and directed by Jim Reardon. It had an unusual amount of animation glitches because the animation studio was training a new group of animators. The episode features cultural references to playwright William Shakespeare and the film It's a Wonderful Life. The title of the episode is a reference to the title of the poem "In Flanders Fields".
Since airing, the episode has received mostly positive reviews from television critics. It acquired a Nielsen rating of 13.9, and was the highest-rated show on Fox the week it aired.
Plot
Ned Flanders invites the Simpson family to a barbecue where he announces plans to quit the pharmaceutical business and open the Leftorium, a store for left-handed people. While pulling a wishbone with Ned, Homer—jealous of Ned's material success—wishes for the Leftorium to fail and go out of business. Undeterred after Lisa scolds him for indulging in schadenfreude, Homer gloats when Ned tells him business is slow. Afterwards, Homer keeps seeing left-handed citizens struggling with items made for right-handed people (including his boss, Mr. Burns) and considers telling them about the Leftorium, but decides not to.
Eventually the store closes, plunging the Flanders family into debt and misery. Ned is forced to sell his possessions, and Homer gleefully buys many of them for a pittance. Overcome by regret, Homer decides to return Ned's possessions, but he finds Ned's house repossessed and the family living in their car. Homer tells Ned to open the store one final time and informs all the left-handed residents of Springfield about the Leftorium; they descend upon the store and buy almost everything. The business boom helps Ned keep the store open and get his house back.
In the subplot, Bart begins taking karate lessons at Akira's karate school. He soon finds himself bored with karate, so he decides to skip each lesson and play video games at the mall arcade instead. Whenever Bart is asked by his friends and family about the karate techniques he is learning, he refers to the Touch of Death, an ability he sees in one of the arcade games he plays. He proceeds to terrorize Lisa into doing his will by threatening her with the Touch of Death.
When the school bullies take Lisa's saxophone, she tells them Bart will defend her with the Touch of Death.
|
https://en.wikipedia.org/wiki/Grammar-based%20code
|
Grammar-based codes or Grammar-based compression are compression algorithms based on the idea of constructing a context-free grammar (CFG) for the string to be compressed. Examples include universal lossless data compression algorithms. To compress a data sequence , a grammar-based code transforms into a context-free grammar .
The problem of finding a smallest grammar for an input sequence (smallest grammar problem) is known to be NP-hard, so many grammar-transform algorithms are proposed from theoretical and practical viewpoints.
Generally, the produced grammar is further compressed by statistical encoders like arithmetic coding.
Examples and characteristics
The class of grammar-based codes is very broad. It includes block codes, the multilevel pattern matching (MPM) algorithm, variations of the incremental parsing Lempel-Ziv code, and many other new universal lossless compression algorithms.
Grammar-based codes are universal in the sense that they can achieve asymptotically the entropy rate of any stationary, ergodic source with a finite alphabet.
Practical algorithms
The compression programs of the following are available from external links.
Sequitur is a classical grammar compression algorithm that sequentially translates an input text into a CFG, and then the produced CFG is encoded by an arithmetic coder.
Re-Pair is a greedy algorithm using the strategy of most-frequent-first substitution. The compressive performance is powerful, although the main memory space requirement is very large.
GLZA, which constructs a grammar that may be reducible, i.e., contain repeats, where the entropy-coding cost of "spelling out" the repeats is less than the cost creating and entropy-coding a rule to capture them. (In general, the compression-optimal SLG is not irreducible, and the Smallest Grammar Problem is different from the actual SLG compression problem.)
See also
Dictionary coder
Grammar induction
Straight-line grammar
References
External links
GLZA discussion and paper
Description of grammar-based codes with example
Sequitur codes
Re-Pair codes
Re-Pair codes a version of Gonzalo Navarro.
GrammarViz 2.0 - implementation of Sequitur, Re-Pair, and parallel Re-Pair in Java.
Data compression
Coding theory
Information theory
|
https://en.wikipedia.org/wiki/RC%20flight%20simulator
|
An RC flight simulator is a computer program that allows pilots of radio-controlled aircraft to practice on a computer, without the risk and expense of damaging a real model. Besides the obvious use of training beginners, they are also used for practising new aerobatics, evaluating a model before buying it, and to allow flight practice when conditions are otherwise unsuitable. Most simulators allow the use of real R/C transmitters to control the sim.
There are a number of commercial packages available, such as Eiperle CGM's neXt - RC Flight Simulator, SVK Systems' ClearView, Knife Edge Software's RealFlight, IPACS' AeroFly and Trasna Technology's AccuRC. There are also a number of free simulators, with FS One being the most well known and most feature rich.
Most simulators allow the importing of add-ons such as new models and landscapes. There are many web sites dedicated to offering free content like this.
Some of these simulators are dedicated to R/C flight, while others are generic simulators that can simulate both full-scale and R/C flight.
Feature Comparison
References
External links
Forum - RC-Sim.de , the RC-Simulation Server
Radio-controlled aircraft
|
https://en.wikipedia.org/wiki/Edgar%20Mortiz
|
Edgardo Mortiz (born August 30, 1954) is a Filipino actor, comedian, singer and director who is currently affiliated with GMA Network and Brightlight Productions. He previously directed numerous shows under ABS-CBN, until its shutdown where he left the network after 34 years.
Filmography
As director
Isa, Dalawa, Takbo (1996)
Pera o Bayong (Not Da TV!) (2000)
Young Love (1970)
Drakulita (1969)
As writer
Agent X44 (2007)
Film roles
Zoom, Zoom, Superman! (1973)
My Juan En Only (1982) as Andres/ Andy
Bad Bananas sa Puting Tabing (1983)
The Untouchable Family (1988) as Mad Max
Television roles
Goin' Bananas (1986–1991; ABS-CBN)
Lovingly Yours, Helen (1986–1996; GMA Network)
Maalaala Mo Kaya (1991–2020; ABS-CBN)
Rated PB: Pugad Baboy Sa TV (1992–1993; GMA Network)
Que Horror (1996–1998; TV5)
Tara Jing Pot Pot (1998–2000; ABS-CBN)
Maynila (1999; GMA Network)
Arriba, Arriba! – Sodi Arriba (2000–2003; ABS-CBN)
All Together Now (2003; GMA Network)
Basta't Kasama Kita (2003–2004; ABS-CBN)
Magpakailanman (2004; GMA Network)
O Ha! (2005; TV5)
Kampanerang Kuba – Father Agaton (Reprised Role) (2005; ABS-CBN)
Talentadong Pinoy – guest judge (2008; TV5)
Star Power – judge (2010; ABS-CBN)
It's Showtime – judge in Tawag ng Tanghalan (2016; ABS-CBN)
Dolce Amore – Ruben "Dodoy" Ibarra (2016; ABS-CBN)
Sana Dalawa ang Puso – Ramon Bulalayao (2018; ABS-CBN)
Dear Uge (2020; GMA Network)
Happy Together (2021; GMA Network)
Television credits
Tropang Trumpo (1994–1998; ABC), Director
Magandang Tanghali Bayan (1999–2003; ABS-CBN), Director
Goin' Bulilit (2005–2019), Director
Mga Anghel na Walang Langit (2005; ABS-CBN), Creative Consultant
Wowowee (2005–2010), Creative Director
Let's Go (2006–2007; ABS-CBN), Director
Banana Sundae (2008–2020), Director
Pilipinas Win na Win (2010–2011), Creative Director
Happy Yipee Yehey! (2011–2012), Creative Director
Home Sweetie Home (2014–2020), Director
Luv U (2012–2016), Director
Sunday 'Kada (2020–2021), Director
Wowowin (2020–2022), Creative Director
Happy Together (2021–present), creator and director
Discography
Studio albums
My Pledge of Love (1969, Wilear's Records)
Simply the Best (1970, Wilear's Records)
Alaala ang Pagbabalik (Vicor Music Corporation)
People (Vicor Music Corporation)
Compilation album
Edgar Mortiz (Vicor Music Corporation)
Awards
References
External links
1954 births
Living people
ABS-CBN personalities
GMA Network personalities
Filipino film directors
Filipino male child actors
Filipino male comedians
Filipino male film actors
20th-century Filipino male singers
Filipino male television actors
Filipino television directors
Vicor Music artists
Male actors from Quezon City
Comedians from Quezon City
Singers from Quezon City
|
https://en.wikipedia.org/wiki/List%20of%20hospitals%20in%20Romania
|
The list below is a database that contains hospitals in Romania. All public hospitals receive funding from the Ministry of Health. Romania has a universal healthcare system, hence all public hospitals are charge-free and available to each citizen of the European Union. There are 425 operational hospitals across the country. At the moment, there are 6.2 hospital beds available per 1000 citizens.
As a result of the European recession, the executive has decided to shut down 67 hospitals nationwide.
Classification
In Romania, each hospital is assigned to a certain city, town, region or medical university.
A dispensary ( in Romanian) is common out in the countryside. They do not have the facilities or labor power of a hospital, but some famous dispensaries appear in the list below.
A town hospital ( in Romanian) is a hospital where residents of a particular town are being admitted into. Such hospitals are able to sustain most medical emergencies and common surgeries.
A municipal hospital ( in Romanian) is a hospital where residents of a particular municipality are being admitted into. Such hospitals usually have a greater bed capacity than a town hospital.
A county hospital ( in Romanian) is a hospital where citizens from all over the county are being brought in. If the procedure cannot be performed into a town hospital, the patients are being admitted in a hospital as such. This kind of hospital has a wide range of departments and a high bedding capacity.
A university hospital ( in Romanian) is a hospital ascribed to a medical university. Such hospitals have a state-of-the-art medical technologies and tend to perform experimental operations.
A sanatorium ( in Romanian) is a recovery facility where patients with a chronic disease are being admitted into shortly before treatment.
A private hospital is a hospital that only operates with people that own a private medical insurance. Such hospitals have a closed circuit network and differ from the public hospitals.
Active hospitals
This list has been created with information provided by the Romanian Ministry of Health.
References
Romania
Hospitals
Romania
|
https://en.wikipedia.org/wiki/Satellite%20Sisters
|
The Satellite Sisters, is an internet–based podcast. Previously, the show was a syndicated radio program heard on Public Radio International and ABC News & Talk (via ABC Radio Networks). The program began on Public Radio International in 2000; A year after its launch, it was syndicated on 70 radio stations. The show revolves around five real-life sisters living in different cities. Its premise is: the sisters "get together" via satellite to talk as if they were going to meet in person or talk on the phone. The sisters typically rotate the days on which they host the show, and the show most often is co-hosted by three of the five sisters simultaneously.
The show has received 13 Gracie Awards for excellence from American Women in Radio and Television.
ABC Radio ceased syndication of the show on November 9, 2008, and the show transformed into an internet-based podcast, with three new shows posted per week.
In addition to the radio show/podcast, the Sisters have written a book called UnCommon Senses. Published by Riverhead Books in 2001, the book is short stories about the Dolan sisters' lives growing up in Fairfield, CT. The sisters bring the chapters/stories to life by posting podcast readings. The Satellite Sisters released a second book called You're the Best: A Celebration of Friendship in October 2015, published by Prospect Park Books.
There is also an internet community radio station named BSIDE Radio in Vancouver BC Canada, that hosts a Radio program that also is hosted as a podcast called Satellite Sisters on Bside Radio. This program/podcast showcases "Bassmusic" tracks produced by women and plays a mixed set by a woman DJ in every episode. (Women and non -inary people/trans women).
The Sisters
Julie Dolan
Julie Dolan Smith is the oldest of the sisters. She is the one "true" satellite sister as she is a "trailing spouse". Among other things, she has held the position of Dean of College Admissions. Until September 2006, Julie lived in Russia and would broadcast the show from overseas. After a short stay in San Francisco, she and her husband moved to Steamboat Springs, Colorado, and then relocated to Dallas, Texas. She has two grown sons. She is also the first of the sisters to become a grandmother. Prior to moving overseas, she had a successful career in academic university administration.
Liz Dolan
Liz Dolan is the second-oldest of the sisters. Liz is a 1979 graduate of Brown University. She is a former corporate vice-president at the Nike Corporation. She played a major role in the development of the Satellite Sisters show. In January 2009 she was named Chief Marketing Officer for "OWN", The Oprah Winfrey Network based in Burbank, Ca. She then worked at Fox International as the Chief Marketing Officer. Liz resides in Santa Monica, California with her dog Hooper.
Sheila Dolan
Sheila Dolan is the middle sister. She has spent the bulk of her career in education, including stints as a teacher and principal in New York City. S
|
https://en.wikipedia.org/wiki/Anime%20NebrasKon
|
Anime NebrasKon is an annual three-day anime convention held during October at the Mid-America Center in Council Bluffs, Iowa. It is organized by the Nebraska Japanese Animation Society.
Programming
The convention typically offers an artist's alley, anime idol, anime music video contest, cosplay contests, cosplay masquerade, dance/rave, dating auction, dealer's room, game room (video, tournaments, tabletop), formal ball, human chess, panels, and talent shows. The convention raised $2,600 for Big Brothers Big Sisters during the 2012 charity auction. Charity auctions prior to 2012 raised around $1,000 which was donated to Make-a-Wish and Open Door Mission. The convention's charity events in 2015 benefited the National Alliance on Mental Illness and raised around $7,500. Basset and Beagle Rescue of the Heartland was 2018's charity. The conventions charity events in 2022 benefited The Trevor Project.
History
Anime NebrasKon was founded by the members of University of Nebraska-Lincoln's anime club (Otaku Jinrui) in 2004 as an fund-raising project and had 300 attendees at the first convention. Due to the conventions growth, in 2009 it moved to the Holiday Inn Omaha Convention Center in Omaha, Nebraska, and added 24-hour programming. Weddings have been held at the convention in both 2010 and 2011. The dealers room was expanded in 2012 because of renovations at the Ramada. An attendee on the way to the convention in 2012 was briefly detained by police after entering a bank wearing cosplay from the series Resident Evil. For 2016, the convention moved to La Vista in order to accommodate growth. Anime NebrasKon 2020 was cancelled due to the COVID-19 pandemic.
Event history
NebKon Abridged
Anime NebrasKon held a one-day event on July 9, 2022, at the DoubleTree by Hilton Hotel Omaha Downtown in Omaha, Nebraska named NebKon Abridged.
Mascot
Anime NebrasKon's mascot is the Husker Ninja.
References
External links
Anime NebrasKon Website
Anime conventions in the United States
Recurring events established in 2004
2004 establishments in Nebraska
Nebraska culture
University of Nebraska–Lincoln
Annual events in Iowa
Iowa culture
Festivals in Iowa
Tourist attractions in Council Bluffs, Iowa
Conventions in Iowa
|
https://en.wikipedia.org/wiki/PMH
|
PMH may stand for:
Phú Mỹ Hưng urban area, a planned city in Vietnam
Greater Portsmouth Regional Airport, IATA code
OAI-PMH, the OAI Protocol for Metadata Harvesting
Past medical history
Princess Margaret Hospital (disambiguation), various hospitals
Portsmouth Harbour railway station, Hampshire, England, National Rail station code
|
https://en.wikipedia.org/wiki/ATV%20Offroad%20Fury
|
ATV Offroad Fury is a 2001 racing video game developed by Rainbow Studios and published by Sony Computer Entertainment exclusively for the PlayStation 2 in North America and Europe.
A sequel, ATV Offroad Fury 2, was released in 2002.
Gameplay
The player may choose between 12 different types of all-terrain vehicles and race on 20 different free-roaming tracks in a variety of types, including Training, MAXXIS Nationals, Stadium Supercross, Freestyle Competitions, Cross Country Enduro, and Pro-Career, as well as various multiplayer modes. Each of the different game types have different objectives the player must accomplish in order to succeed. The player can perform stunts in Freestyle and it will award them with points.
Race modes
The game features three race "modes" that can be accessed through the track selection screen; Single Race, Lap Attack, and Practice. These cannot be selected during Pro-Career mode, and not all modes are available during certain events.
Reception
ATV Offroad Fury received "generally favorable" reviews, according to review aggregator Metacritic. Jeff Lundgren of Next Generation said that "the game sports brilliant graphics, a (mostly) rock-solid framerate, intense tracks, a plethora of options, and excellent control".
By July 2006, the game had sold 1.7 million copies and earned $49 million in the United States. Next Generation ranked it as the 20th highest-selling game launched for the PlayStation 2, Xbox or GameCube between January 2000 and July 2006 in that country. Combined sales of ATV Offroad console games released in the 2000s reached 4.5 million units in the United States by July 2006.
References
External links
2001 video games
MX vs. ATV
PlayStation 2 games
PlayStation 2-only games
Sony Interactive Entertainment games
Multiplayer and single-player video games
Video games developed in the United States
Video games with gender-selectable protagonists
Rainbow Studios games
|
https://en.wikipedia.org/wiki/Friend%20or%20Foe
|
Friend or Foe may refer to:
Film and television
Friend or Foe (film), a 1982 British film by John Krish
Friend or Foe (game show), a 2002–2003 American game show that aired on Game Show Network
Friend or Foe (SpongeBob SquarePants), animated TV series episode
Music
Friend or Foe (album), album by Adam Ant
"Friend or Foe" (Adam Ant song) (1982)
Friend or Foe? (The Forces of Evil album)
Friend or Foe? (Blackmail album) (2003)
"Friend or Foe" (t.A.T.u song)
Other uses
Identification friend or foe, cryptographic identification system
Spider-Man: Friend or Foe, computer and video game
Friend or Foe, a former YouTube series on SB737’s, Tomohawk’s, iBallisticSquid’s and BigBSt4tz’s YouTube channels
See also
Friend and Foe, an album by Menomena
|
https://en.wikipedia.org/wiki/List%20of%20television%20networks%20by%20country
|
This is a list of television networks by country, as officially available at major countries. Mostly are free-to-air digital terrestrial television channels and also digital satellite television channels.
Åland Islands
Åland24
TV Åland
D Channel
A1
A2
A24
ATVR (Åland Island television radio)
Afghanistan
RTA TV
Ariana TV
Tolo TV
Tolo News
Tamadon TV
Metra Television
Shamshad TV
ANAAR TV
Pashto TV
Zhwandon TV
Zan TV
Banoo TV
Jawanan Afghanistan TV
Mishrano Jirga TV
MTV Asia
VH1 Asia
MTV2 Asia
Afghani TV
Afghani 24
1TV (Afghanistan)
2TV (Afghanistan)
Albania
Syri TV
TV Klan
Nan Tul Kanäl
TVSH 1 (RTSH 1)
TVSH 2 (RTSH 2)
TVSH 3 (RTSH 3)
TVSH Film (RTSH Film)
TVSH Muzikë (RTSH Music)
TVSH Shqip (RTSH Shqip)
TVSH Fëmijë (RTSH Kids)
TVSH Sport (RTSH Sports)
TVSH Plus (RTSH Plus)
TVSH 24 (RTSH 24)
TVSH Sat (RTSH Satellite)
TVSH Kuvend (RTSH Parliament)
A2 CNN
BBC World
Euronews Albania
Vizion Plus
Klan Plus
News 24
13TV
BBF TV
ABC News (Albanian TV channel)
UTV News (Albania)
OBTV
Report TV
Top Channel
Alsat M
Algeria
ENTV (Entreprise Nationale de la Télévision)
Canal Algérie
Algérie 3 (Thalitha TV)
Tamazight TV 4
Coran TV 5
News TV Algeria
Echorouk TV
27TV
15TV
DTV 1
DTV 2
Ennahar TV
El-Djazairia TV
El Bahia TV
El Bilad TV
Echorouk Benna TV
Echorouk News TV
Beur TV
El Heddaf TV
Chams TV
El Fedjr TV
Dzair TV
Dzair News
Samira TV
Numdia TV
El Edjwaa TV
Al Hayat TV
Al Anis TV
American Samoa
K34HI (Fox)
K36GY
KJCP-LP
KVZK-1 (MTV American Samoa)
KVZK-2 (PBS)
KVZK-3 (MTV Hits American Samoa)
KVZK-4 (ABC/CBS)
KVZK-5 (ABC/CBS)
RNHA-LP (ABC)
SPI American Samoa
FilmBox Russia
Kino Polska International
Timeless Drama Channel
Andorra
ATV (Andorra Televisió)
ATV2 (Andorra Televisió 2)
ATV3 in English (Andorra Television 3 in English)
Angola
TPA (Televisão Pública de Angola)
TPA1
TPA2
TPA Internacional
TV Zimbo
RecordTV África
ZAP Novelas
TV Angola
A1 Angola
A2 Angola
A3 Angola
A4 Angola
Viacom Angola
MTV Angola
VH1 Angola
Nickelodeon Angola
ZTV (Angola)
Anguilla
ATV Anguilla
PJF-TV 3
PJR-TV 17
R1
R2
R24
BN TV Anguilla
BBC World News
Antigua and Barbuda
ABS-TV
Argentina
América TV
Televisión Pública Argentina
El Nueve
Telefe
El Trece
NET TV
Armenia
Armenia TV
Public Television of Armenia
Shant TV
ATV
Aruba
ATV Channel 15
Bo Canal 24
TeleAruba
ArubaTV Plus (ViewSat DvB2)
Australia
Here's the full high definition (HD) digital terrestrial television channels in Australia :
ABC
ABC TV
ABC TV Plus
ABC Me
ABC News
ABC Kids (Australia)
SBS
SBS
SBS Viceland
NITV
SBS World Movies
SBS Food
SBS WorldWatch
Seven West Media
Seven Network
7HD
7two
7mate
7flix
7Bravo
Racing.com
Nine Entertainment Co.
Nine Network
9HD
9Go!
9Gem
9Life
9Rush
Extra
Ten Network Holdings
Network 10
10 HD
10 Peach
10 Bold
Nickelodeon
Gecko
TVSN
Aboriginal Broadcasting Australia
Aboriginal TV (Channel 4)
|
https://en.wikipedia.org/wiki/The%20Sunday%20Roast
|
The Sunday Roast was an Australian sports talk show that dealt with the issues in the National Rugby League. Created by sports presenter Andrew Voss, it aired on the Nine Network, first screening in 2005, beginning at and leading into The Sunday Footy Show. In 2006, with the axing of Voss's previous show, Boots N' All, The Sunday Footy Show moved to , with The Sunday Roast moving to midday.
In 2012, the show, by then hosted by Tim Gilbert following Voss's controversial demotion and ultimate departure from the Nine Network, was incorporated into The Sunday Footy Show as a shorter segment rather than airing as a separate show. In 2015, the segment was dropped altogether due to its sharp decline in popularity.
Hosts
Presenters
Tim Gilbert
Adam MacDougall
Terry Kennedy
Brad Fittler
Former Presenters
Andrew Voss (2005–2011)
Matthew Johns
Mark Geyer (2005–2011)
Phil Gould
Laurie Daley
Ray Warren
See also
List of Australian television series
List of longest-running Australian television series
The Sunday Footy Show (rugby league)
References
Nine's Wide World of Sport
2005 Australian television series debuts
2010s Australian television series
English-language television shows
Australian sports television series
Rugby league television shows
|
https://en.wikipedia.org/wiki/TWE
|
TWE may refer to:
Test of Written English, a required component of the computer-based TOEFL (Test of English as a Foreign Language)
TransWest Express, an electricity transmission line in the US
Trans World Express, an airline
Treasury Wine Estates, a company
See also
Twe, a Cyrillic letter
|
https://en.wikipedia.org/wiki/CoSy
|
CoSy, short for Conferencing System, was an early computer conferencing system developed at the University of Guelph.
The CoS software grew out of an interest in group computer mediated communication systems in 1981 by Dick Mason and John Black. A project was initiated in the Institute of Computer Science to investigate and possibly acquire an asynchronous computer conferencing system, and a small team of Bob McQueen, Alastair Mayer and Peter Jaspers-Fayer undertook the investigation of two existing systems, EIES from New Jersey, and COM from Sweden. It was then decided that developing a new system in-house would be the best path to take.
A new system started to take shape, written in C and operating under a UNIX operating system on a Digital Equipment Corporation PDP-11 with dial-up telephone ports. Much thought was given to the user interface and group interaction processes, especially as most of the user dial-up connections were originally at very slow 300 bits (30 characters) per second through acoustic modems. The system was gradually introduced to and tested by a small group of users, and eventually made available to other external organizations beginning in 1983. Licenses to use the Unix version of the software were granted to other sites, mainly universities, and a VMS version was also developed and made available for license. CoSy was selected by Byte to launch their BIX system in 1985
In addition to BIX, it was used to implement a similar British system named CIX, as well as numerous other installations such as CompuLink Network. CoSy was also chosen for the Open University's "electronic campus".
The software was used at the University of Victoria in the Creative Writing department in the 1980s. This exposure to Dave Godfrey led to some rights to the software being later acquired by the British Columbia company SoftWords, who developed it into CoSy400 and added a simple web interface, before losing interest.
When the BIX system closed down, several former "bixen" approached University of Guelph and SoftWords and obtained the right to release the original version of CoSy under the GPL. It is now developed as an open source project, and was the basis of the BIX-like NLZero (Noise Level Zero) conferencing service.
References
External links
WebCoSy
CoSy at SourceForge
NLZ website
Free groupware
|
https://en.wikipedia.org/wiki/Benjamin%20Edwards%20%28artist%29
|
Benjamin Edwards (born 1970) is an American visual artist known for his work with satellite maps, architectural blueprints, and computer models as source material. He is the husband of political consultant and government official Neera Tanden.
Early life and education
Benjamin Edwards was born in Iowa City, Iowa. He earned a bachelor's degree from University of California, Los Angeles and studied toward a master's in painting at the San Francisco Art Institute before earning a Master of Fine Arts from the Rhode Island School of Design.
Career
Edwards is known for his paintings that employ appropriated imagery such as satellite maps, architectural blueprints or computer models as source material. His 2004 painting Immersion, for example, used cartography to explore the impact of the highway system on the development of the American suburbs. His 1998 work Starbucks: Seattle: Compression compressed all of the Starbucks stores in Seattle into one image. In other works, he has created landscapes from images of fast-food restaurants, commercial signs, condominiums, shopping malls, convenience stores or corporate logos.
Collections
Carnegie Museum of Art
Museum of Modern Art, New York
Orlando Museum of Art
Personal life
Edwards is married to Neera Tanden, a lawyer and Democratic political advisor. Tanden was the nominee-designee for Director of the Office of Management and Budget in the Joe Biden presidential administration briefly before her nomination was withdrawn after opposition.
References
External links
1970 births
Living people
American printmakers
Rhode Island School of Design alumni
University of California, Los Angeles alumni
Artists from Iowa
American male painters
|
https://en.wikipedia.org/wiki/Television%20in%20Scotland
|
Television in Scotland mostly consists of UK-wide broadcasts, with regional variations at different times which are specific to Scotland. The BBC and ITV networks both began broadcasting in the country during the 1950s. There were further expansions in the early 1960s with the arrival of Grampian, Border and BBC2 television.
The experience of commercial expansion of television services in Scotland since has been broadly similar to that in the UK generally. Terrestrial television is available through DTT platform Freeview along with various other channels. Cable services are available to limited parts of the country with Virgin Media, satellite television is provided by Sky and IPTV services are available with BT TV and TalkTalk TV.
History
Television transmissions in Scotland first began on 14 March 1952 when Britain's sole state broadcaster of the time, the BBC, started broadcasting from the transmitting station at Kirk o'Shotts using the 405-line television system. These early transmissions offered no significant separate content; all BBC programming came direct from London with only very occasional Scottish variation made using an outside broadcast unit. With time, BBC television in Scotland gradually accrued some limited rights to "opt out" of the UK network, particularly after the entry of the Independent Television (ITV) network into the picture, but it was well over 60 years before the corporation allowed an autonomous BBC television channel for the country when it finally launched a still relatively limited BBC Scotland TV service in February 2019.
ITV's Scottish Television (STV) began transmissions on 31 August 1957. Grampian Television, the ITV service for the North-East of the country, was launched in the Spring of 1960. Border Television, with its headquarters in Carlisle, transmitting across the south of Scotland and north of England, followed suit on 1 September 1961. BBC 2 arrived in Scotland in 1966, two years after its initial launch in London. At first this was a black and white service on 625-lines CCIR System I from the Black Hill transmitter. In 1967, when BBC 2 upgraded to PAL colour across the UK, this included Scotland.
Although BBC 1 UK network programmes upgraded to colour in 1969, local output at first was still in black-and-white. STV likewise made the upgrade to colour in December 1969, and BBC Scotland's Queen Margaret Drive Studio "A" in Glasgow followed suit in 1971, one of the first of the regional BBC studios to make the upgrade.
STV, now legally known as "STV Central Ltd", is currently the largest of the three ITV network franchises in Scotland and the second oldest active franchise holder in the UK (the oldest being ITV Granada).
Terrestrial channels
Viewers in Scotland receive seven public terrestrial television stations:
BBC One Scotland
BBC Two
BBC Scotland
BBC Alba
ITV (Branded STV or ITV1 depending on location)
Channel 4
Channel 5
BBC Scotland and BBC Alba are dedicated channels, with
|
https://en.wikipedia.org/wiki/Generalized%20suffix%20tree
|
In computer science, a generalized suffix tree is a suffix tree for a set of strings. Given the set of strings of total length , it is a Patricia tree containing all suffixes of the strings. It is mostly used in bioinformatics.
Functionality
It can be built in time and space, and can be used to find all occurrences of a string of length in time, which is asymptotically optimal (assuming the size of the alphabet is constant).
When constructing such a tree, each string should be padded with a unique out-of-alphabet marker symbol (or string) to ensure no suffix is a substring of another, guaranteeing each suffix is represented by a unique leaf node.
Algorithms for constructing a GST include Ukkonen's algorithm (1995) and McCreight's algorithm (1976).
Example
A suffix tree for the strings ABAB and BABA is shown in a figure above. They are padded with the unique terminator strings $0 and $1. The numbers in the leaf nodes are string number and starting position. Notice how a left to right traversal of the leaf nodes corresponds to the sorted order of the suffixes. The terminators might be strings or unique single symbols. Edges on $ from the root are left out in this example.
Alternatives
An alternative to building a generalized suffix tree is to concatenate the strings, and build a regular suffix tree or suffix array for the resulting string. When hits are evaluated after a search, global positions are mapped into documents and local positions with some algorithm and/or data structure, such as a binary search in the starting/ending positions of the documents.
References
External links
A C implementation of Generalized Suffix Tree for two strings
Trees (data structures)
Substring indices
String data structures
Computer science suffixes
|
https://en.wikipedia.org/wiki/386MAX
|
{{DISPLAYTITLE:386MAX}}
386MAX (originally 386 to the Max, later Qualitas MAX) is a computer memory manager for DOS-based personal computers. It competed with Quarterdeck's QEMM memory manager. It was manufactured by Qualitas.
BlueMax was a special version designed for the IBM PS/2 with ROM compression to get the most of the Upper Memory Blocks.
In 2022, the source code was made available on GitHub, and released under the GNU GPL v3 license by Bob Smith of Sudley Place Software. It joined other tools that Smith had originally written at Qualitas which had their source code released in 2012:
DPMIONE, a DPMI 1.0 host component
386SWAT, a protected-mode debugger
QLINK, a linker tool written to handle 32-bit data types, in support of the 386SWAT program
See also
MSDPMI
References
External links
Qualitas support page
DPMIONE Documentation File Version 0.91
386MAX source code on GitHub
Expanded memory managers
Software using the GPL license
Formerly proprietary software
|
https://en.wikipedia.org/wiki/Jane%20Root
|
Jane Fairbairn Root (born 18 May 1957) is a creative executive in the media industry, who has run major television networks on both sides of the Atlantic. As Controller of BBC Two (1999 to 2004), she was the first woman to be a channel controller for the BBC, and was later President of Discovery Networks in the United States.
Root studied Media Studies at London College of Communication, before moving on to Sussex University to study International Relations. Later awarded an honorary doctorate from the university in 2002, she worked for several years as a freelance journalist, writing for publications such as Honey, The Guardian, and Cosmopolitan. She also worked as a journalist with the British Film Institute and with the Cinema of Women film collective.
Moving into television production, Root worked as a researcher and a producer on a range of projects including working with Michael Jackson (television executive) on the Channel 4 series Open The Box. Root also wrote the accompanying book Open the Box: About Television (1986) as well as the accompanying book to the series Pictures of Women titled Pictures of Women: Sexuality (1984).
Wall to Wall
In 1987, Root co-founded and was Joint Managing Director of independent production company Wall to Wall. She helped to launch The Media Show, a defining program from the early years of Channel 4. During her tenure, alongside business partner Alex Graham, she helped nurture Wall to Wall from being a start-up to becoming 'one of the leading factual programme-makers in the business', best known in the United States for Texas Ranger House on PBS. The company was recently sold to Shed Media.
The BBC
In 1997, Root became the head of the BBC's Independent Commissioning Group, a new department tasked with finding 25% of the BBC's output from the independent production sector. The group – which dealt with drama, entertainment and factual – was responsible for hits like The Naked Chef, and Root was dubbed the "high priestess of lifestyle television" after she championed Jamie Oliver.
In 1999, she became Controller for BBC Two, running the UK's 3rd largest network, and was the first woman controller of a BBC television channel. Her controllership included commissioning the original British series of The Office as well as Coupling, The Weakest Link, Top Gear, What Not to Wear, and Who Do You Think You Are?. During her time as controller, the network also had a relationship with HBO which produced Band of Brothers and Rome. Root is credited with the success of viewer vote 'event' programming like 100 Greatest Britons, a format which went on to be sold to countries around the world. The series was received with a mixed response in the press, with some critics targeting the populist nature of the chosen personalities. The Big Read, a series with a similar public vote format, was equally successful with viewers but was reviled by some critics.
There were criticisms of her time at the channel, "Root's BBC Two in
|
https://en.wikipedia.org/wiki/Cross-industry%20standard%20process%20for%20data%20mining
|
The Cross-industry standard process for data mining, known as CRISP-DM, is an open standard process model that describes common approaches used by data mining experts. It is the most widely-used analytics model.
In 2015, IBM released a new methodology called Analytics Solutions Unified Method for Data Mining/Predictive Analytics (also known as ASUM-DM), which refines and extends CRISP-DM.
History
CRISP-DM was conceived in 1996 and became a European Union project under the ESPRIT funding initiative in 1997. The project was led by five companies: Integral Solutions Ltd (ISL), Teradata, Daimler AG, NCR Corporation, and OHRA, an insurance company.
This core consortium brought different experiences to the project. ISL, was later acquired and merged into SPSS. The computer giant NCR Corporation produced the Teradata data warehouse and its own data mining software. Daimler-Benz had a significant data mining team. OHRA was starting to explore the potential use of data mining.
The first version of the methodology was presented at the 4th CRISP-DM SIG Workshop in Brussels in March 1999, and published as a step-by-step data mining guide later that year.
Between 2006 and 2008, a CRISP-DM 2.0 SIG was formed, and there were discussions about updating the CRISP-DM process model. The current status of these efforts is not known. However, the original crisp-dm.org website cited in the reviews, and the CRISP-DM 2.0 SIG website are both no longer active.
While many non-IBM data mining practitioners use CRISP-DM, IBM is the primary corporation that currently uses the CRISP-DM process model. It makes some of the old CRISP-DM documents available for download and it has incorporated it into its SPSS Modeler product.
Based on current research, CRISP-DM is the most widely used form of data-mining model because of its various advantages which solved the existing problems in the data mining industries. Some of the drawbacks of this model is that it does not perform project management activities. The success of CRISP-DM is largely attributable to the fact that it is industry, tool, and application neutral.
Major phases
CRISP-DM breaks the process of data mining into six major phases:
Business Understanding
Data Understanding
Data Preparation
Modeling
Evaluation
Deployment
The sequence of the phases is not strict and moving back and forth between different phases is usually required. The arrows in the process diagram indicate the most important and frequent dependencies between phases. The outer circle in the diagram symbolizes the cyclic nature of data mining itself. A data mining process continues after a solution has been deployed. The lessons learned during the process can trigger new, often more focused business questions, and subsequent data mining processes will benefit from the experiences of previous ones.
Polls
Polls conducted at the same website (KDNuggets) in 2002, 2004, 2007, and 2014 show that it was the leading methodology used by industry
|
https://en.wikipedia.org/wiki/Democratic%20Network
|
Democratic Network (RED Democratico, RED) is a progressive, green political party in Aruba. Since the 2017 Aruban general election it has one seat in the Estates of Aruba and is part of the government coalition under Prime Minister Evelyn Wever-Croes.
History
founded the party.
During the 2005 Aruban general election the party obtained 3330 votes which was sufficient for 1 out of 21 seats. In 2009 and 2013 it participated but did not obtain a seat.
For the 2017 Aruban general election Ricardo Croes was the party list leader. Party founder Lampe was number two on the list. The party obtained 4166 votes and thus one seat in the Estates of Aruba. The party subsequently became part of the government coalition led by Prime Minister Evelyn Wever-Croes. Lampe joined the cabinet as specialist Minister of Education, Science and Sustainable Development and resigned his party membership to do so.
References
Political parties in Aruba
São Paulo Forum
|
https://en.wikipedia.org/wiki/Physical%20medium%20dependent
|
Physical medium dependent sublayers or PMDs further help to define the physical layer of computer network protocols. They define the details of transmission and reception of individual bits on a physical medium. These responsibilities encompass bit timing, signal encoding, interacting with the physical medium, and the properties of the cable, optical fiber, or wire itself. Common examples are specifications for Fast Ethernet, Gigabit Ethernet and 10 Gigabit Ethernet defined by the Institute of Electrical and Electronics Engineers (IEEE).
For cable modems physical medium dependent sublayers define the physical sub-layer.
Description
The Ethernet PMD sublayer is part of the Ethernet physical layer (PHY). The hierarchy is as follows:
Data link layer (Layer 2)
Logical link control (LLC) sublayer
Medium access control (MAC) sublayer
Reconciliation sublayer (RS) - This sublayer processes PHY local/remote fault messages and handles DDR conversion
PHY layer (Layer 1)
Physical coding sublayer (PCS) - This sublayer performs auto-negotiation and coding such as 8b/10b
Physical medium attachment (PMA) sublayer - This sublayer performs PMA framing, octet synchronization/detection, and scrambling/descrambling
Physical medium dependent (PMD) sublayer - This sublayer consists of a transceiver for the physical medium
Physical medium dependent sublayer specifications
10 Gigabit Ethernet
10GBASE-E has been defined for single-mode fiber operation only. It operates in the 1550 nm band allowing for distances of up to 40 km to be reached.
10GBASE-L was also defined for single-mode fiber operations, uses the 1300 nm band allowing it to reach up to 10 km.
10GBASE-S was defined for use in multimode fiber and ultimately costs less than the other 10GbE standards. It uses 850 nm lasers and only reaches distances ranging between 26 and 82 metres on older fiber technology. In newer optimized multimode fibers (a.k.a. OM3) it can reach up to 300 m.
10GBASE-LX4 uses four lasers that each transmit at 3.125 Gbit/s. The receiver is arranged in a wavelength-division multiplexing manner. On legacy FDDI multimode fiber it can reach up to 300 m while on single-mode fiber it can reach up to 10 km.
After these specifications have been laid out, they are then completed with local area network and wide area network specifications using different Physical Coding Sublayer standards.
References
Ethernet 1000BASE-X PCS/PMA Technology Basics
IEEE 802.3-2012 Specification
Ethernet
|
https://en.wikipedia.org/wiki/Pose%20%28computer%20vision%29
|
In the fields of computing and computer vision, pose (or spatial pose) represents the position and orientation of an object, usually in three dimensions. Poses are often stored internally as transformation matrices. The term “pose” is largely synonymous with the term “transform”, but a transform may often include scale, whereas pose does not.
In computer vision, the pose of an object is often estimated from camera input by the process of pose estimation. This information can then be used, for example, to allow a robot to manipulate an object or to avoid moving into the object based on its perceived position and orientation in the environment. Other applications include skeletal action recognition.
Pose estimation
The specific task of determining the pose of an object in an image (or stereo images, image sequence) is referred to as pose estimation. Pose estimation problems can be solved in different ways depending on the image sensor configuration, and choice of methodology. Three classes of methodologies can be distinguished:
Analytic or geometric methods: Given that the image sensor (camera) is calibrated and the mapping from 3D points in the scene and 2D points in the image is known. If also the geometry of the object is known, it means that the projected image of the object on the camera image is a well-known function of the object's pose. Once a set of control points on the object, typically corners or other feature points, has been identified, it is then possible to solve the pose transformation from a set of equations which relate the 3D coordinates of the points with their 2D image coordinates. Algorithms that determine the pose of a point cloud with respect to another point cloud are known as point set registration algorithms, if the correspondences between points are not already known.
Genetic algorithm methods: If the pose of an object does not have to be computed in real-time a genetic algorithm may be used. This approach is robust especially when the images are not perfectly calibrated. In this particular case, the pose represent the genetic representation and the error between the projection of the object control points with the image is the fitness function.
Learning-based methods: These methods use artificial learning-based system which learn the mapping from 2D image features to pose transformation. In short, this means that a sufficiently large set of images of the object, in different poses, must be presented to the system during a learning phase. Once the learning phase is completed, the system should be able to present an estimate of the object's pose given an image of the object.
Camera pose
See also
Gesture recognition
Homography (computer vision)
Camera calibration
Structure from motion
Essential matrix and Trifocal tensor (relative pose)
References
Computer vision
Geometry in computer vision
Robot control
|
https://en.wikipedia.org/wiki/DOCSIS%20Set-top%20Gateway
|
DOCSIS Set-top Gateway (or DSG) is a specification describing how out-of-band data is delivered to a cable set-top box. Cable set-top boxes need a reliable source of out of band data for information such as program guides, channel lineups, and updated code images.
Features
DSG is an extension of the DOCSIS protocol governing cable modems, and applies to all versions of DOCSIS.
The principal features of DSG are:
One-way operation
The original DOCSIS protocol supports only two way connectivity. A cable modem that is unable to acquire an upstream channel will give up and resume scanning for new channels. Likewise, persistent upstream errors will cause a cable modem to "reinitialize its MAC" and scan for new downstream channels. This behavior is appropriate for traditional cable modems, but not for cable set-top boxes. A cable set-top box still needs to acquire its out of band data even if the upstream channel is impaired.
The DSG specification introduced one way (downstream only) modes of operation. When upstream errors occur, the set-top enters a downstream-only state, periodically attempting to reacquire the upstream channel.
Defining how to recognize the correct downstream channel
Set-top out of band data is generally present only on certain downstream channels. The set-top needs a way to distinguish a valid downstream (containing the set-top's data) from an invalid one used only by standalone cable modems.
The DSG specification defines a special downstream keep-alive message so that the set-top can recognize an appropriate downstream channel.
Creating an out-of-band directory
The Advanced Mode of the DSG Specification introduces a special MAC Management message called the Downstream Channel Descriptor (DCD). The DCD provides a directory identifying the MAC and IP parameters associated with the out of band data streams.
Each data consumer is assigned a special Client Identifier that names the out of band data stream in the DCD.
SNMP MIBs
The DSG Specification creates two new SNMP management information bases (MIBs) to manage DSG devices. One MIB is used by the set-top, the other by the cable modem termination system (CMTS).
Architecture
A DSG network comprises three components. The Conditional Access Server generates a stream of out of band data. The DSG Agent (the CMTS) forwards the out of band data and publishes the out of band directory (the DCD). The DSG client on the set-top digests the DSG data.
The set-top device comprises three subcomponents. The DSG-capable cable modem is referred to as the DSG eCM (Embedded Cable Modem). A data consumer is called a DSG Client (there are generally many of these.) Finally, the eCM is configured and controlled by a component called the DSG Client Controller.
See also
Residential gateway
References
Broadcasting standards
Digital cable
Set-top box
|
https://en.wikipedia.org/wiki/Physical%20coding%20sublayer
|
The physical coding sublayer (PCS) is a networking protocol sublayer in the Fast Ethernet, Gigabit Ethernet, and 10 Gigabit Ethernet standards. It resides at the top of the physical layer (PHY), and provides an interface between the Physical Medium Attachment (PMA) sublayer and the media-independent interface (MII). It is responsible for data encoding and decoding, scrambling and descrambling, alignment marker insertion and removal, block and symbol redistribution, and lane block synchronization and deskew.
Description
The Ethernet PCS sublayer is at the top of the Ethernet physical layer (PHY). The hierarchy is as follows:
Data link layer (Layer 2)
Logical link control (LLC) sublayer
Medium access control (MAC) sublayer
Reconciliation sublayer (RS) - This sublayer processes PHY local/remote fault messages and handles DDR conversion
PHY Layer (Layer 1)
Physical coding sublayer (PCS) - This sublayer determines when a functional link has been established, provides rate difference compensation, and performs coding such as 64b/66b encoding and scrambling/descrambling
Physical Medium Attachment (PMA) sublayer - This sublayer performs PMA framing, octet synchronization/detection, and scrambling/descrambling
Physical Medium Dependent (PMD) sublayer - This sublayer consists of a transceiver for the physical medium
Specifications
10 Mbit/s Ethernet
Classic Ethernet uses Manchester code in the Physical signaling sublayer (PLS), encoding each bit as a high-low (logical zero) or low-high transition (logical one).
Fast Ethernet
100BASE-X for fiber (100BASE-FX) and twisted pair copper (100BASE-TX) encodes data nibbles to five-bit code groups (4B5B).
Gigabit Ethernet
1000BASE-X for fiber and 150 Ω balanced copper (twinaxial) uses 8b/10b encoding with a symbol rate of 1.25 GBd.
1000BASE-T for twisted pair copper splits the data into four lanes and uses four-dimensional, five-level (quinary) Trellis modulation with PAM-5 and a symbol rate of 125 MBd.
2.5 and 5 Gigabit Ethernet
2.5GBASE-T and 5GBASE-T use the same encoding as 10GBASE-T slowed by a factor of four or two, respectively.
10 Gigabit Ethernet
10GBASE-R (LAN) is the serial encoded PCS using 64b/66b encoding that allows for Ethernet framing at a rate of 10.3125 Gbit/s. This rate does not match the rate 9.953 Gbit/s used in SONET and SDH and is not supported over a WAN based on SONET or SDH.
10GBASE-X (LAN/WAN) uses 8b/10b encoding over four lanes at 3.125 GBd each and is used for 10GBASE-LX4 (single-mode and multi-mode fiber), 10GBASE-CX4 (twinax), and 10GBASE-KX4 (backplane).
10GBASE-W (WAN) defines WAN encoding for 10GbE. It uses 64/66b encoding and lowers the MAC rate to 9.95 Gbit/s, so that is compatible with SONET STS-192c data rates and SDH VC-4-64 transmission standards when wrapped into a SONET frame.
10GBASE-T for twisted pair copper splits the data into four lanes and uses 64B/65B encoding, scrambling, and 128 double-square (DSQ128) checkerboard encoding with PAM-16 gene
|
https://en.wikipedia.org/wiki/Star%20Raiders%20II
|
Star Raiders II is a video game released in 1986 for the Atari 8-bit family as a sequel to 1979's Star Raiders, which was the killer app for the Atari computers. The game was originally developed as part of a tie-in with the movie The Last Starfighter, which featured an arcade game of the same name as part of its plotline. Versions for the Atari 5200 and the Atari 8-bit computers were developed in 1984, although those were never released. Later the tie-in was dropped, and the game converted into a sequel to Star Raiders by changing a number of gameplay elements. The gameplay remained different from the original Star Raiders.
Conversions for the ZX Spectrum, Amstrad CPC, and Commodore 64 were published under license by Electric Dreams Software in 1987.
In 2015 it was revealed that a true sequel, also called Star Raiders II, had been under development for some time by Atari programmer Aric Wilmunder. It was nearing completion when he was laid off during the massive downsizing of the company in early 1984. Although the programmer continued talks with Atari after its takeover by Jack Tramiel, no deal was ever forthcoming. The source code, largely complete but not polished for release, was posted publicly in December the same year. This version is far more faithful to the original version in terms of gameplay.
Gameplay
Movie concept
The plot of The Last Starfighter revolves around the latest outbreak in a long-running war between two races. In the past, the Rylan Star League protected themselves from the warlike Ko-Dan through their fleet of advanced "Gunstar" fighters, and the "Frontier", a space-based energy field. Their protection is removed when a member of the League defects to the Ko-Dan cause, destroying the Gunstar base and showing the Ko-Dan how to pass through the Frontier. The movie follows the protagonist Alex Rogan as he crews the remaining Gunstar fighter and defeats the Ko-Dan fleet. Rogan was discovered by the Rylans by his high scores in an arcade game that was actually a Gunstar simulator.
Last Starfighter
The original videogame remained faithful to this basic plotline, standing in for the arcade game in the movie. It expanded on the movie's action by having multiple Ko-Dan fleets attacking the League. Each fleet contained a group of Deckfighters for protection, Destroyers that attacked the cities on League planets, and a single command ship that was responsible for breaching the Frontier. The command ship left the fleet once the Frontier was breached, leaving the Destroyers and Deckfighters to attack.
The game opened with the player in orbit above Rylos, being attacked by the fighters. After defeating this initial force, pressing space opened a display of the local solar system, showing the multiple planets, the Frontier, and any attacking fleets. The joystick is used to move between the various objects on the screen, which can be selected in order to warp to them. Fleets could be attacked at any point, but there was an advant
|
https://en.wikipedia.org/wiki/Bland%E2%80%93Altman%20plot
|
A Bland–Altman plot (difference plot) in analytical chemistry or biomedicine is a method of data plotting used in analyzing the agreement between two different assays. It is identical to a Tukey mean-difference plot, the name by which it is known in other fields, but was popularised in medical statistics by J. Martin Bland and Douglas G. Altman.
Agreement versus correlation
Bland and Altman drive the point that any two methods that are designed to measure the same parameter (or property) should have good correlation when a set of samples are chosen such that the property to be determined varies considerably. A high correlation for any two methods designed to measure the same property could thus in itself just be a sign that one has chosen a widespread sample. A high correlation does not necessarily imply that there is good agreement between the two methods.
Construction
Consider a sample consisting of observations (for example, objects of unknown volume). Both assays (for example, different methods of volume measurement) are performed on each sample, resulting in data points. Each of the samples is then represented on the graph by assigning the mean of the two measurements as the -value, and the difference between the two values as the -value.
The Cartesian coordinates of a given sample with values of and determined by the two assays is
For comparing the dissimilarities between the two sets of samples independently from their mean values, it is more appropriate to look at the ratio of the pairs of measurements. Log transformation (base 2) of the measurements before the analysis will enable the standard approach to be used; so the plot will be given by the following equation:
This version of the plot is used in MA plot.
Application
One primary application of the Bland–Altman plot is to compare two clinical measurements each of which produced some error in their measures. It can also be used to compare a new measurement technique or method with a gold standard, as even a gold standard does not—and should not—imply it to be without error. See Analyse-it, MedCalc, NCSS, GraphPad Prism, R, or StatsDirect for software providing Bland–Altman plots.
Bland–Altman plots are extensively used to evaluate the agreement among two different instruments or two measurements techniques. Bland–Altman plots allow identification of any systematic difference between the measurements (i.e., fixed bias) or possible outliers. The mean difference is the estimated bias, and the SD of the differences measures the random fluctuations around this mean. If the mean value of the difference differs significantly from 0 on the basis of a 1-sample t-test, this indicates the presence of fixed bias. If there is a consistent bias, it can be adjusted for by subtracting the mean difference from the new method. It is common to compute 95% limits of agreement for each comparison (average difference ± 1.96 standard deviation of the difference), which tells us how far apa
|
https://en.wikipedia.org/wiki/Craft%20Corner%20Deathmatch
|
Craft Corner Deathmatch was a television show aired on the Style Network in 2005.
Two contestants are challenged by host Jason Jones to make things such as notebooks and handbags out of various objects. After ten minutes, the contestants show their projects to a panel of judges who then rate it on a scale from one to ten. After two rounds, the winner faces the Craft Lady of Steel for a bonus prize.
Craft Corner Death Match had a wide range of celeb judges from Betsy Johnson to Michael Kors. The show aired about 20 episodes and then due to bad ratings, was taken off the air.
External links
Craft Corner Deathmatch home page
2000s American game shows
2005 American television series debuts
|
https://en.wikipedia.org/wiki/Egypt%20%281991%20video%20game%29
|
is a puzzle video game released for the Family Computer in 1991 by Human. It was released only in Japan. It is an object elimination type puzzle game. A player controls a spherical jewel and jumps from tile to tile. Stepping on an arrow shifts a row or column in the direction of the arrow. Placing two or more of the same object next to each other will erase them from the board, and this must be repeated until all the objects have been eliminated from the board.
Story
An Indiana Jones style explorer is trapped inside an Ancient Egyptian temple. He meets a goddess who is so low in power that she can only take the form of a large, spherical jewel. He enters the jewel to restore her power by clearing each level.
Gameplay
The game is played on an 8x8 tiled grid. The player controls the large spherical jewel and can move around with the directional pad. The player can step on any type of tile except a wall. A tile can be either an empty space, a wall, an object, or an arrow.
Shifting the map
When the player steps on an arrow, the row or column of the map is shifted in the direction of the arrow. For example, stepping on an up-arrow shifts the column containing the arrow, while stepping on a right-arrow shifts the row. Shifting a row or column does not move the player, so it appears that the map is shifting beneath the player. Arrows can be stepped on multiple times. When a tile is pushed off the edge of the map, it wraps around to the other side.
Eliminating Objects
When a row or column is shifted, the objects are shifted as well. If two or more objects come into contact, they are eliminated. Eliminating all the objects moves the player to the next level. If there is only one object of any type remaining, the level is unfinishable, since there is no other object to eliminate it with.
Items
On the two easier levels of the game, the player can use items to assist with solving the levels. Items do not exist on the Hard difficulty mode. Use of items is not necessary to complete the game, as every level is solvable without items.
Lightning Bolt - Destroys all walls within a 3x3 area surrounding the player. This does not wrap around to the opposite edges.
Feather - The player flies up into the air and can move freely up to five times without hitting walls or activating arrows.
Flash - Destroys all walls in a level.
Legacy
A translation group named "Dodgy Translations" has produced an English translation patch.
References
External links
Egypt at GameFAQs
1991 video games
Human Entertainment games
Japan-exclusive video games
Nintendo Entertainment System games
Nintendo Entertainment System-only games
Puzzle video games
Video games developed in Japan
|
https://en.wikipedia.org/wiki/Galaxy%20%28British%20TV%20channel%29
|
Galaxy was a short-lived British satellite television channel, owned and operated by British Satellite Broadcasting.
The station, focused on general entertainment and children's programming, was one of the five BSB channels, based at the network's headquarters at Marco Polo House in Battersea.
Galaxy broadcast a mix of original programming, American imports and archive repeats from the BBC library. Its most infamous production was Heil Honey I'm Home, a sitcom about Adolf Hitler, which aired only its pilot episode.
History
Original programmes
Some of the programmes made for Galaxy included:
Jupiter Moon
Jupiter Moon was Galaxy's sci-fi soap opera, shown three times a week (on Mondays, Wednesdays, and Fridays at 6.30pm), with an omnibus at weekends. 150 episodes were made, but only the first 108 were broadcast by Galaxy before it closed, while the last 42 episodes would air six years later on the Sci Fi Channel. The cast included Richard Derrington, Anna Chancellor, Alison Dowling, Lucy Benjamin, Fay Masterson, Richard Lintern and Jason Durr. The entire series has been released on Region 1 DVD.
Up Yer News
This was Galaxy's topical satire show, which aired a 15-minute episode each weeknight. It featured Chris Morris, Armando Iannucci, Stewart Lee, Richard Herring, Patrick Marber, Steve Coogan, Rebecca Front, Doon Mackichan, David Schneider, Jon Thomson, Al Murray, Julian Clary, Stephen Fry, David Baddiel, Rob Newman, Steve Punt, Hugh Dennis, Henry Normal, Fred Harris, Jo Brand, Mark Heap, and Alistair McGowan.
The Happening
A weekly 90-minute music and comedy show presented by Jools Holland.
31 West
Galaxy's showbiz magazine show broadcast each weeknight, 6.00–6.30pm, presented by Simon Potter, Debbie Flint and Shyama Perera and soap expert Chris Stacey. The show got its name from the placing of BSB's Marcopolo Satellite at 31 degrees west.
The Last Laugh
Stand-up comedy show. Comedians featured included Ben Elton, Nick Revell, Jack Dee, Kevin Day, Simon Fanshawe, Punt and Dennis, Norman Lovett, Mark Steel and Mark Thomas.
Corrigan & Womack
This was a comedy series, starring Bernadine Corrigan and Steve Womack, where they would perform comedy sketches. This show was carried over to Sky One following Galaxy's closure.
Doctor Who weekend
Galaxy broadcast early episodes of Doctor Who every week, and on the weekend of Saturday 22 and Sunday 23 September, the channel presented a complete weekend.
Saturday 22 September: 9.15am An Unearthly Child, 11.15am The Daleks (episodes 1–3), 12.35pm Doctor Who's Who's Who, 1.40pm The Daleks (episodes 4–7), 3.30pm The Edge of Destruction, 4.30pm The Yeti Rarities (The Abominable Snowmen episode 2 and The Web of Fear episode 1), 6.00pm The Space Museum, 8.00 The Keys of Marinus, 11.00pm The Aztecs, 1.00am Dr. Who and the Daleks (film).
Sunday 23 September: 9.15am The War Games (episodes 1–5), 11.30am Whose Doctor Who, 12.45pm The War Games (episodes 6–10), 3.00pm The Dominators, 5.45pm The Mind Robber, 8
|
https://en.wikipedia.org/wiki/List%20of%20airports%20by%20ICAO%20code%3A%20A
|
Format of entries is:
ICAO (IATA) – airport name – airport location
AG - Solomon Islands
AN - Nauru
AY - Papua New Guinea
References
- includes IATA codes
Aviation Safety Network - IATA and ICAO airport codes
A
Airport designator, ICAO:A
Airport designator, ICAO:A
Airports by ICAO code: A
|
https://en.wikipedia.org/wiki/Pseudo-polynomial%20time
|
In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is a polynomial in the numeric value of the input (the largest integer present in the input)—but not necessarily in the length of the input (the number of bits required to represent it), which is the case for polynomial time algorithms.
In general, the numeric value of the input is exponential in the input length, which is why a pseudo-polynomial time algorithm does not necessarily run in polynomial time with respect to the input length.
An NP-complete problem with known pseudo-polynomial time algorithms is called weakly NP-complete.
An NP-complete problem is called strongly NP-complete if it is proven that it cannot be solved by a pseudo-polynomial time algorithm unless . The strong/weak kinds of NP-hardness are defined analogously.
Examples
Primality testing
Consider the problem of testing whether a number n is prime, by naively checking whether no number in divides evenly. This approach can take up to divisions, which is sub-linear in the value of n but exponential in the length of n (which is about ). For example, a number n slightly less than would require up to approximately 100,000 divisions, even though the length of n is only 11 digits. Moreover one can easily write down an input (say, a 300-digit number) for which this algorithm is impractical. Since computational complexity measures difficulty with respect to the length of the (encoded) input, this naive algorithm is actually exponential. It is, however, pseudo-polynomial time.
Contrast this algorithm with a true polynomial numeric algorithm—say, the straightforward algorithm for addition: Adding two 9-digit numbers takes around 9 simple steps, and in general the algorithm is truly linear in the length of the input. Compared with the actual numbers being added (in the billions), the algorithm could be called "pseudo-logarithmic time", though such a term is not standard. Thus, adding 300-digit numbers is not impractical. Similarly, long division is quadratic: an m-digit number can be divided by a n-digit number in steps (see Big O notation.)
In the case of primality, it turns out there is a different algorithm for testing whether n is prime (discovered in 2002) that runs in time .
Knapsack problem
In the knapsack problem, we are given items with weight and value , along with a maximum weight capacity of a knapsack .
The goal is to solve the following optimization problem; informally, what's the best way to fit the items into the knapsack to maximize value?
maximize
subject to and .
Solving this problem is NP-hard, so a polynomial time algorithm is impossible unless . However, an time algorithm is possible using dynamic programming; since the number only needs bits to describe, this algorithm runs in pseudo-polynomial time.
Generalizing to non-numeric problems
Although the notion of pseudo-polynomial time is used almost exclusively for numeric problems,
|
https://en.wikipedia.org/wiki/Metro%20Networks
|
Metro Networks was a broadcasting outsourcing company based in Houston, Texas. It was a subsidiary of Westwood One until its sale to Clear Channel Communications in 2011. The company operated local and regional news and traffic operations that provided regular reports to affiliates, together with its sister company Shadow Broadcast Services. At the time of the sale to Clear Channel Communications, Metro Networks had approximately 2,300 radio affiliates and 170 television affiliates operating in nearly every major radio and television market of the United States, as well as 700+ websites.
In addition to offering live and recorded broadcasting reports, Metro Networks operated its own news wire service, Metro Source, rebranded by Clear Channel as 24/7 News Source. Metro Source was started in 1997 to compete with other wire services, such as the Associated Press and Reuters. Its "World Desk" is based in Phoenix, Arizona. 24/7 News Source provides hundreds of radio stations and websites with national, state, feature and local stories, including audio and photos.
On April 29, 2011, Westwood One sold Metro Networks to Clear Channel Communications for $119.25 million so it can concentrate on their other properties. Clear Channel combined Metro Networks with its own Total Traffic Networks. Metro Networks' traffic service was eventually folded into Total Traffic Networks later that year, with Clear Channel keeping the Total Traffic name for the operation.
References
External links
Official Website of Metro Traffic (no longer owned by Metro Networks)
Companies based in Houston
|
https://en.wikipedia.org/wiki/KKFX-CD
|
KKFX-CD (channel 24) is a low-power, Class A television station licensed to San Luis Obispo, California, United States, serving the Central Coast of California as an affiliate of the Fox network. It is owned by the News-Press & Gazette Company (NPG) alongside Santa Barbara–licensed ABC/CBS affiliate KEYT-TV (channel 3); NPG also provides certain services to Santa Maria–licensed Telemundo affiliate KCOY-TV (channel 12) under a shared services agreement (SSA) with owner VistaWest Media, LLC. KKFX-CD and KCOY-TV share studios at West McCoy Lane and Skyway Drive in Santa Maria north of Santa Maria Public Airport; KEYT-TV maintains separate facilities on Miramonte Drive on TV Hill, overlooking downtown Santa Barbara. KKFX-CD's transmitter is located near Serrano and US 101 in the Los Padres National Forest. The station can be seen on channel 11 on most cable systems in the market, hence the Fox 11 branding.
Although KKFX-CD identifies as a station in its own right, it is officially licensed as a translator of KCOY-TV. In addition to its own digital signal, KKFX-CD is simulcast in high definition on KCOY-TV's second digital subchannel from a transmitter on Tepusquet Peak in the Los Padres National Forest east of Santa Maria. KCOY-TV, in turn, is simulcast on KKFX-CD's second digital subchannel.
History
KKFX-CD signed on for the first time on November 6, 1998, as the area's Fox affiliate. Network-owned West Coast flagship station KTTV in Los Angeles (which had been carried on cable throughout the Central Coast dating back to its days as a superstation) served as the affiliate of record for the Central Coast before the station began operations. Before July 1, 2006, this station could also be seen in Santa Barbara on KSBB-LP channel 17, but it switched to a repeater of KEYT-TV. On April 20, 2007, Clear Channel Communications entered into an agreement to sell its television station group to Providence Equity Partners. The sale was finalized on March 14, 2008. However, Providence Equity Partners did not keep KKFX and sister station KCOY due to Federal Communications Commission (FCC) restrictions. As a result, they were resold to the Cowles Publishing Company. On May 7, 2008, the deal between Cowles and Newport Television closed.
On September 20, 2013, News-Press & Gazette Company, owner of KEYT-TV in Santa Barbara, announced that it would purchase KKFX-CA as well as Monterey sister stations KION-TV and KMUV-LP. NPG also took over some operations of KCOY that Cowles retained under a shared services agreement. The sale was completed on December 13, 2013.
On January 20, 2015, KKFX began broadcasting over the air in high definition and providing an HD feed directly to cable and DirecTV. On that same date, KKFX-CA returned to the airwaves in Santa Barbara on low-power KSBB-CD channel 17.
Newscasts
Fox 11 News in the Morning airs weekdays on KKFX from 7 a.m. to 8 a.m. A nightly hour-long newscast is included.
Subchannels
The station's digital signal is mult
|
https://en.wikipedia.org/wiki/MikroDatorn
|
MikroDatorn was a Swedish computer magazine. The first issue of MikroDatorn was published in 1978, which makes it one of the oldest computer magazines in Sweden (Datornytt, published by Nordpress and disestablished in 1991, was older). MikroDatorn was published on a monthly basis.
MikroDatorn focused on reviews of computer products. In 2011 the magazine merged with PC för Alla to form PC för Alla Extreme!.
References
External links
MikroDatorn
1978 establishments in Sweden
2011 establishments in Sweden
Defunct computer magazines
Defunct magazines published in Sweden
Magazines established in 1978
Magazines disestablished in 2011
Monthly magazines published in Sweden
Computer magazines published in Sweden
Swedish-language magazines
|
https://en.wikipedia.org/wiki/Hover%21
|
Hover! is a video game that combines elements of the games bumper cars and capture the flag. It was included on CD-ROM versions of the Microsoft Windows 95 operating system. It was a showcase for the advanced multimedia capabilities available on personal computers at the time. It is still available from Microsoft. The game will not run on earlier versions of Windows.
Gameplay
Hover! has three mazes that resemble a medieval castle, a futuristic city, and a sewer. Each maze has its own unique texture maps, music theme, and spawn locations.
For each level, Hover! will cycle through each of the three mazes, or randomly select one (if that option is set). The goal of each level is to capture all of the blue flags hidden throughout the level (playing as the red hovercraft), before the opposing (blue) team collects all of the red flags. A game starts with having 3 red flags and 3 blue flags in each level, but will go up to 6 flags of each color in higher levels. Higher levels also have more opposing hovercraft and a more difficult AI. The opponent hovercraft are split into two groups: One group acts as the capture team, trying to secure all the red flags before the player collects all the blue flags, while the other group serves as the protection for the capture team, trying to defend their flags and prevent the player from interfering with the capture team's efforts. If one of those hovercraft see the player, a tone will sound, like a sonar ping, indicating they've seen him and will move to attack.
There are also orbs scattered throughout each maze that will give the player a collectable item or a status effect (such as increasing or decreasing the hovercraft's speed, or temporarily giving an invincibility shield). The collectable items are Wall (which can be placed to temporarily impede an opponent hovercraft), Spring (to make the player's hovercraft jump really high), and Cloak (to temporarily hide the player's hovercraft from the opposing team).
The HUD shows the player's score (in the top right corner), an indicator of how many flags have been captured (in the top left corner), a mini-map (in the center of the bottom), indicators of the player's speed and direction (in the bottom right), and a display of how many items the player has (in the bottom left).
Remake
Hover! was officially re-released by Microsoft in 2013, as a browser game. The re-release, although published by Microsoft, was mostly developed by Dan Church, with help from Pixel Labs and Microsoft. It was made to showcase the WebGL support in Internet Explorer 11 (but will also work on any WebGL-enabled browser). This version includes updated graphics and touch control support, as well as a multiplayer feature for up to 8 players. Microsoft also offers more technical details about this release on its modern.ie website. In April of 2019, the website for the game was shut down.
This version of the game was also released as a Windows 8.1 app available on the Windows Store (no longe
|
https://en.wikipedia.org/wiki/Frank%E2%80%93Wolfe%20algorithm
|
The Frank–Wolfe algorithm is an iterative first-order optimization algorithm for constrained convex optimization. Also known as the conditional gradient method, reduced gradient algorithm and the convex combination algorithm, the method was originally proposed by Marguerite Frank and Philip Wolfe in 1956. In each iteration, the Frank–Wolfe algorithm considers a linear approximation of the objective function, and moves towards a minimizer of this linear function (taken over the same domain).
Problem statement
Suppose is a compact convex set in a vector space and is a convex, differentiable real-valued function. The Frank–Wolfe algorithm solves the optimization problem
Minimize
subject to .
Algorithm
Initialization: Let , and let be any point in .
Step 1. Direction-finding subproblem: Find solving
Minimize
Subject to
(Interpretation: Minimize the linear approximation of the problem given by the first-order Taylor approximation of around constrained to stay within .)
Step 2. Step size determination: Set , or alternatively find that minimizes subject to .
Step 3. Update: Let , let and go to Step 1.
Properties
While competing methods such as gradient descent for constrained optimization require a projection step back to the feasible set in each iteration, the Frank–Wolfe algorithm only needs the solution of a linear problem over the same set in each iteration, and automatically stays in the feasible set.
The convergence of the Frank–Wolfe algorithm is sublinear in general: the error in the objective function to the optimum is after k iterations, so long as the gradient is Lipschitz continuous with respect to some norm. The same convergence rate can also be shown if the sub-problems are only solved approximately.
The iterations of the algorithm can always be represented as a sparse convex combination of the extreme points of the feasible set, which has helped to the popularity of the algorithm for sparse greedy optimization in machine learning and signal processing problems, as well as for example the optimization of minimum–cost flows in transportation networks.
If the feasible set is given by a set of linear constraints, then the subproblem to be solved in each iteration becomes a linear program.
While the worst-case convergence rate with can not be improved in general, faster convergence can be obtained for special problem classes, such as some strongly convex problems.
Lower bounds on the solution value, and primal-dual analysis
Since is convex, for any two points we have:
This also holds for the (unknown) optimal solution . That is, . The best lower bound with respect to a given point is given by
The latter optimization problem is solved in every iteration of the Frank–Wolfe algorithm, therefore the solution of the direction-finding subproblem of the -th iteration can be used to determine increasing lower bounds during each iteration by setting and
Such lower bounds on the unknown optimal value are importa
|
https://en.wikipedia.org/wiki/New%20York%20Area%20Bisexual%20Network
|
New York Area Bisexual Network (NYABN) is a central communications network for bisexual and bi-friendly groups and resources in the five boroughs (Brooklyn, the Bronx, Manhattan, Queens and Staten Island) of New York City and the surrounding Tri-State area. The mission of the New York Area Bisexual Network is to facilitate the development of a cohesive bisexual community in the New York Area. The network promotes bisexual visibility, works to protect the bisexual community from discrimination and biphobia and assists and empowers the individual community members, their families and friends to live full, rich, safe and happy lives.
NYABN provides listings of groups, events and general information of interest to the local bisexual community as well as providing links to Regional, National and International Groups and Events on its website and phone-line. Additionally NYABN has a Bisexual Speakers Bureau, coordinates the Bisexual-Information Phone-Line, keeps up the Bisexual Community PO Box, works with Bialogue an NYC based bisexual activist/political group, hosts various groups, meetings and events of interest to the entire bisexual community, helps new groups form and coordinates arrangements for the Bisexual Contingent(s) at NYC's annual LGBT PrideFest and Parade each June. NYABN began having regular meetings and engaging in PrideFest activities virtually in 2020 due to the COVID-19 pandemic.
History
After the Stonewall riots in June 1969 Brenda Howard, a bisexual woman who had previously been active in the anti-war and feminist movements, both organized a rally one month after the riots and then co-ordinated the very first Gay Pride in June 1970, commemorating the first anniversary of Stonewall. Howard continued to be active in the LGBT community in New York during the 1970s and 1980s whilst the bisexual community in the Tri-State area of New York, New Jersey and Connecticut grew larger, more active and more diverse. In the 1980s regional bisexual networks started to form such as Boston's highly successful East Coast Bisexual Network, now the Bisexual Resource Center and the Bay Area Bisexual Network. In 1987 Howard was involved in setting up the New York Area Bisexual Network.
See also
Bisexual Resource Center
Bisexual American history
Bisexual community
References
External links
Official website
Bisexual Resource Center (BRC)
Bi-Perspective: NYC social, discussion and support group
Bialogue = Bisexual + Dialogue: NYC based activist/political group
BiRequest: NYC discussion group for bisexual and bi-friendly people
1987 establishments in New York (state)
LGBT political advocacy groups in New York (state)
Bisexual culture in the United States
Bisexual organizations
Organizations based in New York City
LGBT organizations based in New York City
1987 in LGBT history
Organizations established in 1987
|
https://en.wikipedia.org/wiki/Suikoden%20%28video%20game%29
|
is a role-playing video game published by Konami. It is the first installment of the Suikoden series. Developed by Konami Computer Entertainment Tokyo, it was released initially in 1995 for the PlayStation in Japan. A North American release followed one year later, and a mainland European release came the following April. The game was also released for Windows and Sega Saturn in 1998, but only in Japan.
The game centers on the political struggles of the Scarlet Moon Empire. The player controls a Scarlet Moon Empire general's son, who is destined to seek out 108 warriors (referred to as the 108 Stars of Destiny) in order to revolt against the corrupt sovereign state and bring peace to a war-torn land. The game is loosely based on the Chinese novel Water Margin, and features a vast array of characters both controllable and not, with over ninety characters usable in combat and many more able to help or hinder the hero in a variety of ways.
A compilation of the first two Suikoden games, Suikoden I & II, was released for PlayStation Portable in Japan on February 23, 2006. A high-definition English localization version of the compilation, under the title Suikoden I & II HD Remaster: Gate Rune and Dunan Unification Wars was originally scheduled for a worldwide release in 2023 for Nintendo Switch, PlayStation 4, Windows and Xbox One but on August 30, 2023, it was announced that it was delayed to an unknown date.
Gameplay
Suikoden plays like a traditional role-playing video game, with the player moving characters across a landscape, advancing the plot by completing tasks and talking with other characters. It has been compared to Beyond the Beyond and, more rarely, Final Fantasy VII.
The Hero may recruit up to 107 new characters to his cause, although not all recruited characters are playable characters, and the battle system in Suikoden features six person parties in combat, with each character being individually controllable, with an option to allow the characters to fight automatically. Some characters can only be recruited if the party has reached a certain experience level or found a special item.
Combat triggers through random encounters and is turn-based. Both the player-controlled party members and the computer-controlled enemy combatants select their actions before the turn commences. Characters carry out their actions in the order of their speed.
A variety of statistics determine in-game combat ability, including optimum weapon range. Weapon range requires the player to think about character placement in the standard battle formation. There are three ranges from which a character can have the ability to attack: Short, Medium and Long. Short range characters are typically swordsmen who have to be placed at the front row of the six party formation, while Medium range attacks can fight from either the front or the back row, meanwhile Long range attackers can attack from both ranges but benefit more so from fighting in the back row, usually du
|
https://en.wikipedia.org/wiki/Memory%20refresh
|
Memory refresh is the process of periodically reading information from an area of computer memory and immediately rewriting the read information to the same area without modification, for the purpose of preserving the information. Memory refresh is a background maintenance process required during the operation of semiconductor dynamic random-access memory (DRAM), the most widely used type of computer memory, and in fact is the defining characteristic of this class of memory.
In a DRAM chip, each bit of memory data is stored as the presence or absence of an electric charge on a small capacitor on the chip. As time passes, the charges in the memory cells leak away, so without being refreshed the stored data would eventually be lost. To prevent this, external circuitry periodically reads each cell and rewrites it, restoring the charge on the capacitor to its original level. Each memory refresh cycle refreshes a succeeding area of memory cells, thus repeatedly refreshing all the cells in a consecutive cycle. This process is conducted automatically in the background by the memory circuitry and is transparent to the user. While a refresh cycle is occurring the memory is not available for normal read and write operations, but in modern memory this "overhead" time is not large enough to significantly slow down memory operation.
Electronic memory that does not require refreshing is available, called static random-access memory (SRAM). SRAM circuits require more area on a chip, because an SRAM memory cell requires four to six transistors, compared to a single transistor and a capacitor for DRAM. As a result, data density is much lower in SRAM chips than in DRAM, and SRAM has higher price per bit. Therefore, DRAM is used for the main memory in computers, video game consoles, graphics cards and applications requiring large capacities and low cost. The need for memory refresh makes DRAM timing and circuits significantly more complicated than SRAM circuits, but the density and cost advantages of DRAM justify this complexity.
How DRAM refresh works
While the memory is operating, each memory cell must be refreshed repetitively, within the maximum interval between refreshes specified by the manufacturer, which is usually in the millisecond region. Refreshing does not employ the normal memory operations (read and write cycles) used to access data, but specialized cycles called refresh cycles which are generated by separate counter circuits in the memory circuitry and interspersed between normal memory accesses.
The storage cells on a memory chip are laid out in a rectangular array of rows and columns. The read process in DRAM is destructive and removes the charge on the memory cells in an entire row, so there is a row of specialized latches on the chip called sense amplifiers, one for each column of memory cells, to temporarily hold the data. During a normal read operation, the sense amplifiers after reading and latching the data, rewrite the data in the a
|
https://en.wikipedia.org/wiki/Christian%20Television%20Network
|
Christian Television Network (CTN) is an American non-profit broadcast television network of small owned-and-operated stations (O&O) that broadcasts religious programming. It is based in Largo, Florida (with a mailing address of Clearwater), and the flagship station is WCLF channel 22, which signed on the air in the Tampa Bay region in 1979. It is now available on DirecTV channel 376, Dish Network channel 262, and Glorystar channel 117. The channel was started to produce and broadcast programming to teach and encourage Christian living. It was founded by Robert D'Andrea, who died in January 2022.
Program services
CTN operates three channels:
The main CTN service focuses primarily on televangelism with some alternative medicine infomercials.
CTNi is also televangelism-based but with all programming in Spanish.
CTN Lifestyle includes secular syndicated programming (such as Small Town Big Deal, Positively Paula and Ron Hazelton's HouseCalls) along with some Christian talk shows (The 700 Club, AFA Focal Point), movies and Christian-themed entertainment programs.
Stations (by callsign)
All stations are owned and operated by CTN unless specified. A blue background indicates a station signed on by CTN or a CTN subsidiary.
Former affiliates (by callsign)
Note
Until 2011, Detroit, Michigan-based WLPC-LD also used the CTN and Christian Television Network names, but was never affiliated or associated with this network; that station has since renamed itself as Impact Network.
Programming
COME HOME with Jen Mallan
Man 360
It's Time With Herman and Sharon (also known as It's Time With Herman and Friends)
You and Me
Christian Fitness
Gospel Voice
Bridges
Christian Music Countdown
The Awakening
Tightline
Bayfocus
Real Life
In The Blink Of An Eye
Homekeeper's Classics
Destined 2 Roam
Generation Now
We Got Next
References
External links
Official site
Television networks in the United States
Lists of American television network affiliates
Religious television stations in the United States
Television channels and stations established in 1979
Evangelical television networks
Christian mass media companies
1979 establishments in Florida
|
https://en.wikipedia.org/wiki/Uncle%20Bobby
|
Uncle Bobby is a Canadian children's television show that aired from 1964 to 1979 on Toronto's CFTO and, for two years beginning in 1968, was a weekly show on the CTV television network (although it continued to be aired on local CTV stations across Canada thereafter). In its later run the show was known as Uncle Bobby and Friends and, in 1979, the show was renamed Kid's Corner and lasted for a few more years as a syndicated Saturday morning offering (and into the early 1990s in repeats on YTV).
The half-hour show starred Bobby Ash (1924–2007), a former comedian and circus clown who had moved to Canada from the United Kingdom. The show aired weekdays over noonhour and featured staples such as "Bimbo: The Birthday Clown", a stationary cardboard cut-out who would come out of his closet, with a booming laugh, to the tune of Jim Reeves's Bimbo as Uncle Bobby announced that day's birthday greetings. Accompanying Bimbo were three puppets on a string, Wilson, Keppel and Betty, named after British music hall performers, who would "dance" to Bimbo's theme. The show featured regulars such as guitarist and singer Alex Laurier, Meredith Cutting (the singing police officer), ventriloquists Jack O'Reilly with his partner Daniel O'Rourke, and Cy Leonard and his partner Happy, magician Ron Leonard, accordionist Nancy McCaig, wildlife artist Barry Kent MacKay, clay artist Ruth Winkler, and Traffic Officer John (Big Big John) with safety tips for children. Uncle Bobby's catch phrase was MMMM...BOBBY'S HERE!!! Produced out of CFTO's Channel Nine Court studios, executive producers were Gerry Rochon, and, in the later years, Wayne Dayton. Children would also appear on the show and would be referred to by Uncle Bobby as "bobbysoxers". Maclean's magazine described Uncle Bobby as "avuncular without being condescending."
Ash had previously played a clown on Professor's Hideaway starring former BBC Radio star Stan Francis. He then went to England for three years and, upon his return, was given the job of Uncle Bobby on his own show. He did not earn very much from the show and had to support himself by moonlighting as a school bus driver in Scarborough, Ontario. He retired to Elliot Lake, where he died May 20, 2007, of a heart attack at age 82.
References
External links
CTV Television Network original programming
Canadian television shows featuring puppetry
Television series by Glen-Warren Productions
1964 Canadian television series debuts
1979 Canadian television series endings
1960s Canadian children's television series
1970s Canadian children's television series
Black-and-white Canadian television shows
Television shows about clowns
|
https://en.wikipedia.org/wiki/WinFixer
|
WinFixer was a family of scareware rogue security programs developed by Winsoftware which claimed to repair computer system problems on Microsoft Windows computers if a user purchased the full version of the software. The software was mainly installed without the user's consent. McAfee claimed that "the primary function of the free version appears to be to alarm the user into paying for registration, at least partially based on false or erroneous detections." The program prompted the user to purchase a paid copy of the program.
The WinFixer web page (see the image) said it "is a useful utility to scan and fix any system, registry and hard drive errors. It ensures system stability and performance, frees wasted hard-drive space and recovers damaged Word, Excel, music and video files."
However, these claims were never verified by any reputable source. In fact, most sources considered this program to actually reduce system stability and performance. The sites went defunct in December 2008 after actions taken by the Federal Trade Commission.
Installation methods
The WinFixer application was known to infect users using the Microsoft Windows operating system, and was browser independent. One infection method involved the Emcodec.E trojan, a fake codec scam. Another involves the use of the Vundo family of trojans.
Typical infection
The infection usually occurred during a visit to a distributing website using a web browser. A message appeared in a dialog box or popup asking the user if they wanted to install WinFixer, or claimed a user's machine was infected with malware, and requested the user to run a free scan. When the user chose any of the options or tried to close this dialog (by clicking 'OK' or 'Cancel' or by clicking the corner 'X'), it would trigger a pop-up window and WinFixer would download and install itself, regardless of the user's wishes.
"Trial" offer
A free "trial" offer of this program was sometimes found in pop-ups. If the "trial" version was downloaded and installed, it would execute a "scan" of the local machine and a couple of non-existent trojans and viruses would be "discovered", but no further action would be undertaken by the program. To obtain a quarantine or removal, WinFixer required the purchase of the program. However, the alleged unwanted bugs were bogus, only serving to persuade the owner to buy the program.
WinFixer application
Once installed, WinFixer frequently launched pop-ups and prompted the user to follow its directions. Because of the intricate way in which the program installed itself into the host computer (including making dozens of registry edits), successful removal would have taken a fairly long time if done manually. When running, its process could be found in the task manager and be stopped, but would automatically relaunch itself after a period of time.
WinFixer was also known to modify the Windows Registry so that it started up automatically with every reboot, and scanned the user's computer.
|
https://en.wikipedia.org/wiki/Tracking%20system
|
A tracking system, also known as a locating system, is used for the observing of persons or objects on the move and supplying a timely ordered sequence of location data for further processing.
Applications
A myriad of tracking systems exists. Some are 'lag time' indicators, that is, the data is collected after an item has passed a point for example a bar code or choke point or gate. Others are 'real-time' or 'near real-time' like Global Positioning Systems (GPS) depending on how often the data is refreshed. There are bar-code systems which require items to be scanned and automatic identification (RFID auto-id). For the most part, the tracking worlds are composed of discrete hardware and software systems for different applications. That is, bar-code systems are separate from Electronic Product Code (EPC) systems, GPS systems are separate from active real time locating systems or RTLS for example, a passive RFID system would be used in a warehouse to scan the boxes as they are loaded on a truck - then the truck itself is tracked on a different system using GPS with its own features and software. The major technology “silos” in the supply chain are:
Distribution/warehousing/manufacturing
Indoors assets are tracked repetitively reading e.g. a barcode, any passive and active RFID and feeding read data into Work in Progress models (WIP) or Warehouse Management Systems (WMS) or ERP software. The readers required per choke point are meshed auto-ID or hand-held ID applications.
However tracking could also be capable of providing monitoring data without binding to a fixed location by using a cooperative tracking capability, e.g. an RTLS.
Yard management
Outdoors mobile assets of high value are tracked by choke point,
802.11, Received Signal Strength Indication (RSSI), Time Delay on Arrival (TDOA), active RFID or GPS Yard Management; feeding into either third party yard management software from the provider or to an existing system. Yard Management Systems (YMS) couple location data collected by RFID and GPS systems to help supply chain managers to optimize utilization of yard assets such as trailers and dock doors. YMS systems can use either active or passive RFID tags.
Fleet management
Fleet management is applied as a tracking application using GPS and composing tracks from subsequent vehicle's positions. Each vehicle to be tracked is equipped with a GPS receiver and relays the obtained coordinates via cellular or satellite networks to a home station. Fleet management is required by:
Large fleet operators, (vehicle/railcars/trucking/shipping)
Forwarding operators (containers, machines, heavy cargo, valuable shippings)
Operators who have high equipment and/or cargo/product costs
Operators who have a dynamic workload
Person tracking
Person tracking relies on unique identifiers that are temporarily (RFID tags) or permanently assigned to persons like personal identifiers (including biometric identifiers), or national identification numbers an
|
https://en.wikipedia.org/wiki/LOINC
|
Logical Observation Identifiers Names and Codes (LOINC) is a database and universal standard for identifying medical laboratory observations. First developed in 1994, it was created and is maintained by the Regenstrief Institute, a US nonprofit medical research organization. LOINC was created in response to the demand for an electronic clinical care and management database and is publicly available at no cost.
It is endorsed by the American Clinical Laboratory Association. Since its inception, the database has expanded to include not just medical laboratory code names but also nursing diagnosis, nursing interventions, outcomes classification, and patient care data sets.
Function
LOINC applies universal code names and identifiers to medical terminology related to electronic health records. The purpose is to assist in the electronic exchange and gathering of clinical results (such as laboratory tests, clinical observations, outcomes management and research). LOINC has two main parts: laboratory LOINC and clinical LOINC. Clinical LOINC contains a subdomain of Document Ontology which captures types of clinical reports and documents.
Several standards, such as IHE or HL7, use LOINC to electronically transfer results from different reporting systems to the appropriate healthcare networks. However, the health information enclosed is identified by a multiplicity of code values that may vary according to the entity producing those results. This has obvious disadvantages to the healthcare network that may need to adopt different codes to access and manage information coming from multiple sources. Managed care providers, for example, often have negotiated contracts that reimburse episodes of care and unique coding to trigger automated claim payment. Mapping each entity-specific code to its corresponding universal code can represent a significant investment of both human and financial capital.
A universal code system will enable facilities and departments across the world to receive and send results from their areas for comparison and consultation and may contribute toward a larger public health initiative of improving clinical outcomes and quality of care.
LOINC is one of the standards used in U.S. Federal Government systems for the electronic exchange of clinical health information. In 1999, it was identified by the HL7 Standards Development Organization as a preferred code set for laboratory test names in transactions between health care facilities, laboratories, laboratory testing devices, and public health authorities.
Content
LOINC terminology has two main parts:
Laboratory LOINC: It covers laboratory tests, microbiology tests (including antibiotic susceptibilities)
Clinical LOINC: It covers a variety of non-lab concepts (ECG concepts, cardiac echo, obstetric ultrasound). Within clinical LOINC, there are also sup-parts for
Clinical documents: concepts for various types of clinical reports (e.g., discharge summary, well-child visit note)
Su
|
https://en.wikipedia.org/wiki/Tom%20Limoncelli
|
Tom Limoncelli (born December 2, 1968) is an American system administrator, author, and speaker.
A system administrator and network engineer since 1987, he speaks at conferences around the world on topics ranging from firewall security to time management. He is the author of Time Management for System Administrators from O'Reilly; along with Christine Hogan, co-author of the book The Practice of System and Network Administration from Addison-Wesley, which won the 2005 SAGE Outstanding Achievement Award, and in 2007 with Peter H. Salus he has published a compilation of the best April Fools jokes created by the IETF entitled The Complete April Fools' Day RFCs.
He has also published papers at conferences such as the Usenix LISA on a wide variety of topics including innovative firewall techniques, coordinating massive network changes, models for improving customer support, and the security issues related to firing a system administrator.
Biography
Limoncelli is the youngest of five children. He was born in New Haven, Connecticut and has lived in New Jersey since the age of four. He holds a Bachelor of Arts in Computer Science from Drew University in Madison, New Jersey.
He is a Site Reliability Engineer at Stack Exchange. Before that, he was a systems administrator in the New York City office of Google. He has previously been Director, IT Services for Cibernet Corporation, Director of Operations at Lumeta and also worked at Bell Labs / Lucent Technologies where he ran the Internet gateway and networks used by the scientists as well as consulted internally to various business units.
Work for bisexual rights
Limoncelli started his activism on campus when he was a student at Drew University. He facilitated a men's support group that was part of the Gay Activists Alliance in Morris County in 1989–1990.
In 1991-2 he worked on New Jersey's successful effort to amend the New Jersey's Law Against Discrimination, to add "sexual or affectional orientation" for protection in housing, hiring, banking, and public accommodations.
He served as outreach co-chair and logistics coordinator. He co-created BiNet/NJ (now known as BiZone) in 1991. He was vice-president, then president of the New Jersey Lesbian and Gay Coalition 1994–1996, which included such accomplishments as the creation of a community center, spinning off the NJ Pride Parade as a separate organization, modifying the by-laws to be fully bisexual and transgender inclusive, participation in the 1993 March on Washington and Stonewall 25, and other projects.
He has worked with BiNet USA since 1992 including four years spent as the Regional Organizer from the Tri-State area region. He edited the New Jersey section of the Bisexual Resource Guide for much of the 1990s.
Limoncelli has worked with the Tri-State Bisexual Conferences which he created/co-chaired in 1996 (NYC, NY), was advisor to in 1997 (Hartford, CT), co-chair in 1999 (New Brunswick NJ), and on the planning committee of the highly successf
|
https://en.wikipedia.org/wiki/%C3%96sterg%C3%B6tland%20Runic%20Inscription%20179
|
The runestone known as Östergötland Rune Inscription 179 or Ög 179, as listed in the Rundata catalog, stands on the east side of the Vadstena Abbey in Vadstena, Sweden. The stone is tinted red and is about 193 cm in height. The inscription is classified as being carved in runestone style Fp. This is the classification for runic bands that have attached serpent or beast heads depicted as seen from above.
The earliest information about this stone indicates that it originally stood close to Lake Vättern. When it was moved to its present location it was discovered that the lower part of the stone had been worn away by the waves and none of the runes on that part of the stone remain.
The runic text indicates that the stone was raised as a memorial to a father named Áskell. In the text, the runes for the initial vowels in Old Norse words for ("after") and the name were replaced by a ʀ-rune. A similar replacement of the initial vowel in the word æftiʀ is indicated on eight other inscriptions, Ög 219 in Lundby, Sö 82 in Tumbo, Sö 98 in Jäders, U 742 in Myrby, U 771 in Tjursåker, U 789 in Mälby, U 791 in Tibble, and U 1152 in Brunnby.
Transliteration of the runes into Latin characters
References
Runestones in Östergötland
|
https://en.wikipedia.org/wiki/Digital%20Video%20Interactive
|
Digital Video Interactive (DVI) was the first multimedia desktop video standard for IBM-compatible personal computers. It enabled full-screen, full motion video, as well as stereo audio, still images, and graphics to be presented on a DOS-based desktop computer using a special compression chipset. The scope of Digital Video Interactive encompasses a file format, including a digital container format, a number of video and audio compression formats, as well as hardware associated with the file format.
History
Development of DVI was started around 1984 by Section 17 of The David Sarnoff Research Center Labs (DSRC) then responsible for the research and development activities of RCA. When General Electric purchased RCA in 1986, GE considered the DSRC redundant with its own labs, and sought a buyer. In 1988, GE sold the DSRC to SRI International, but sold the DVI technology separately to Intel corporation.
DVI technology allowed full-screen, full motion digital video, as well as stereo audio, still images, and graphics to be presented on a DOS-based desktop computer. DVI content was created using the Authology Multimedia authoring system developed by CEIT Systems and usually distributed on CD-ROM discs, which in turn was decoded and displayed via specialized add-in card hardware installed in the computer. Audio and video files for DVI were among the first to use data compression, with audio content using ADPCM. DVI was the first technology of its kind for the desktop PC, and ushered in the multimedia revolution for PCs.
DVI was announced at the second annual Microsoft CD-ROM conference in Seattle to a standing ovation in 1987. The excitement at the time stemmed from the fact that a CD-ROM drive of the era had a maximum data playback rate of ~1.2 Mbit/s, thought to be insufficient for good quality motion video. However, the DSRC team was able to extract motion video, stereo audio and still images from this relatively low data rate with good quality.
Implementations
The first implementation of DVI developed in the mid-80s relied on three 16-bit ISA cards installed inside the computer, one for audio processing, another for video processing, and the last as an interface to a Sony CDU-100 CD-ROM drive. The DVI video card used a custom chipset (later known as the i80750 or i750 chipset) for decompression, one device was known as the pixel processor & the display device was called the VDP (video display processor).
Later DVI implementations used one, more highly integrated card, such as Intel's ActionMedia series (omitting the CD-ROM interface). The ActionMedia (and the later ActionMedia II) were available in both ISA and MCA-bus cards, the latter for use in MCA-bus PCs like IBM's PS/2 series.
Intel utilized the i750 technology in driving creation of the MMX instruction set.
Compression
The DVI format specified two video compression schemes, Presentation Level Video or Production Level Video and Real-Time Video and two audio compression scheme
|
https://en.wikipedia.org/wiki/Popful%20Mail
|
is a side-scrolling platform game developed by Nihon Falcom. It was originally released for the NEC PC-8801 home computer in 1991 and the PC-9801 in 1992. The game was later ported to the PC Engine CD-ROM by NEC Home Electronics, to the Sega CD by Sega, to DoJa mobile phones by Bothtec, and to the Super Famicom and Microsoft Windows by Falcom.
After the failed attempt to bring the game to the west by reworking it to be the part of Sonic the Hedgehog series, the Sega CD version of the game was localized by Working Designs and released in North America in late 1994. Most versions of Popful Mail are for the most part similar to each other, but the Super Famicom and Sega CD versions differ significantly both from each other and from the previous releases.
Gameplay
Popful Mail is a 2D platform game with several RPG elements - excluding the ability to level-up characters. The controls allow the player to jump, attack, open doors or treasure chests, and speak to another character. Additionally, the player can summon a menu to change some of the game's attributes, the current character, the current character's equipment, use or activate an item, read the game's status, save, load and quit.
At the start of the game, the only playable character is Mail; as the game progresses, Tatt and Gaw will be available, and the player may switch between them at any time through the use of the "character" option in the menu (except in the middle of dialogues). Each character has different attacks and armor, as well as differences in walking speed and jump. Mail is the fastest character, but is the one whose jump is lowest. Tatt is balanced - slower than Mail but faster than Gaw - and his jump is similarly in between. Gaw is the slowest of the three, but can jump the highest and usually has the strongest attacks.
The character encounters enemies as well as non-playable characters. Often, when encountering an important character, dialogue begins immediately, with the player having no control over it. These important dialogues are by default always voice acted; text accompanies them, and the voiced speech can be turned off in an options menu if so desired.
The character has 100 health points, and attacks from enemy characters diminish it according to the strength of the attacker. Similarly, all enemies have a 100 health point bar that has to be brought down to 0 for the enemy to be defeated. How much damage is dealt depends on the strength of the character, although an attack always causes the same amount of damage to the same enemy. The character also has a blue-grey bar that is depleted as a distance weapon or a magical attack is used. When the bar reaches 0, the character can still perform the weapon motion, but the magical or long range portion of the attack will fail. The bar regenerates quickly if given time to do so (if the character uses no attacks or switches to a melee weapon). Use of a distance weapon or magical attack while the bar is regenerating halts
|
https://en.wikipedia.org/wiki/ExtraVision
|
ExtraVision was a short-lived teletext service created and operated by the American television network CBS in the early to mid-1980s. It was carried in the vertical blanking interval of the video from local affiliate stations of the CBS network. It featured CBS program information, news, sports, weather, even subtitling for CBS programming (much like page 888 in British-based World System Teletext, and American line 21 closed-captioning). ExtraVision could also have its pages customized by the local affiliate station carrying it, for such things as program schedules, local community announcements, and station promotions. WGBH Boston, a pioneer in assisting the deaf and hard-of-hearing with closed captioning, also provided content for those audiences to ExtraVision and assisted in providing captioning for CBS programming via ExtraVision.
CBS had begun tests in 1979 at their St. Louis station KMOX-TV (currently KMOV) using the French Antiope system, and again in 1981 in the Los Angeles area on KNXT (currently KCBS), in a joint test with PBS station KCET. The full ExtraVision service began in April 1983 on CBS affiliate WBTV in Charlotte, NC, and went nationwide in 1984.
One issue was that, due to CBS' heavy emphasis on the ExtraVision service, it did not offer line 21 closed-captioning for the hearing impaired, unlike ABC, NBC or PBS (ABC never offered teletext services, while only certain PBS stations, including the aforementioned KCET and WGBH, experimented with teletext). Some believed that CBS' opposition to line-21 services was so large, they even wanted to strip captioning from commercials to be run during programming. The result was nationwide protests against CBS by the National Association of the Deaf, with people picketing the studios of CBS and affiliate stations; one child protested in Grand Rapids, MI with a sign reading "Please caption for my Mom and Dad".
The situation was further compounded in August 1982, when NBC ceased to offer closed-captioning on account of decreased demand. While the NAD's Phil Bravin, chairman of the NAD's newly-formed TV Access Committee, was able to persuade NBC to resume captioning, he continued to meet with resistance by CBS; after an unproductive meeting with then-head of CBS affiliate relations, Tony Malara, Bravin promised to "see you on the streets of America". CBS ultimately relented in March 1984, promising three hours of closed-captioned programming starting that fall.
Due to the service using the NABTS protocol, which required a quite expensive decoder to receive the service, and the FCC not choosing to require TV manufacturers to integrate teletext into their sets or choose between either NABTS or the British-based World System Teletext (used by Electra and several other services), ExtraVision eventually began to experience cutbacks, with several staffers laid off in May 1986; the production of news content was outsourced to AP/TMS Media Services (a joint venture between the Associated Press
|
https://en.wikipedia.org/wiki/Intercast
|
Intercast was a short-lived technology developed in 1996 by Intel for broadcasting information such as web pages and computer software, along with a single television channel. It required a compatible TV tuner card installed in a personal computer and a decoding program called Intel Intercast Viewer. The data for Intercast was embedded in the Vertical Blanking Interval (VBI) of the video signal carrying the Intercast-enabled program, at a maximum of 10.5 Kilobytes/sec in 10 of the 45 lines of the VBI.
With Intercast, a computer user could watch the TV broadcast in one window of the Intercast Viewer, while being able to view HTML web pages in another window. Users were also able to download software transmitted via Intercast as well. Most often the web pages received were relevant to the television program being broadcast, such as extra information relating to a television program, or extra news headlines and weather forecasts during a newscast. Intercast can be seen as a more modern version of teletext.
The Intercast Viewer software was bundled with several TV tuner cards at the time, such as the Hauppauge Win-TV card. Also at the time of Intercast's introduction, Compaq offered some models of computers with built-in TV tuners installed with the Intercast Viewer software.
Upon its debut, Intercast was used by several TV networks, such as NBC, CNN, The Weather Channel, and MTV Networks.
On June 25, 1996, Intel and NBC announced an arrangement which enabled users to watch coverage of the 1996 Summer Olympics and other programming from NBC News.
Intel discontinued support for Intercast a couple of years later.
NBC's series Homicide: Life on the Street was a show that was Intercast-enabled.
References
External links
Archived copy of Intercast's web site from archive.org
Article about Intercast, NBC, and the 1996 Summer Olympics
Businessweek article
Microsoft press release regarding Intercast and Windows 98
Intercast dying of neglect
Television technology
Multimedia
1996 introductions
|
https://en.wikipedia.org/wiki/Sage%20Computer%20Technology
|
SAGE Computer Technology was a computer company based in Reno, Nevada, United States. It was founded in 1981 by Rod Coleman, Bill Bonham and Bob Needham; it went through several name changes. The change from Sage computer came about when "Sage Software" in Maryland demanded cessation of use of the name Sage in the computer segment.
SAGE Computer Technology
- created the Sage II and Sage IV computers based on the Motorola 68000 microprocessor.
SAGE Computer
Stride Micro
MicroSage Computer Systems (a wholly owned subsidiary, 1987)
- created the Stride 420, Stride 440, Stride 460 (VME), Stride 660 and Stride 740 computers.
SAGE IV
The SAGE IV was released in 1983. Hardware:
Board0: CPU: MC68000 @ 8 MHz, 2× serial RS-232 ports 19.2 kbit/s, Parallel input/output (PIO) for printers, GPIB, Floppy disc controller, 512 KByte DRAM. Same as in SAGE II.
Board1: 4× serial RS-232 ports 19.2 kbit/s, Hard disk controller, 512 KByte DRAM.
Memory consisting of 64 Kbit 150 ns memory modules. Parity error protected setup.
Minimum system memory is 256 KByte.
Storage: 1× 5¼" 800 KByte F.D. drive. 1× 5 - 40 MByte Winchester harddisk.
Built-in multi-user BIOS.
Introduced in November 1982
Price: $3,600 USD (for the single-floppy entry-level configuration)
The SAGE managed multitasking with six serial ports in real time with 1 MByte of RAM in 1983. It was used by scientists and engineers for more than ten years when it was popular, "running over 10 years with zero admin, and maybe even zero reboot." "13 times faster than the Apple II" (when introduced).
Sage IV computers were used for the development of the Amiga prototype computer system "Lorraine". The Sage system got the nickname "Agony".
Access was through an serial video terminal. Graphics capability was possible with the addition of a third-party colour graphics system from Robinson Systems which plugged directly into the Sage 68000 bus and provided output compatible with a range of colour monitors (e.g., Cotron Sword, Electrohome 1301).
The included operating system was the UCSD p-System. Many other operating systems were available including CP/M-68K, Idris, PDOS, HyperFORTH Plus, BOS, TRIPOS, Mirage, and MOSYS. Programming languages available included Pascal, Modula-2, C, FORTRAN77, BASIC, 68000 macro assembler, APL, BCPL, LISP and Forth.
System bus
An "m68k" bus was used up to the Stride series of computers (Sage VI). Later a VME bus was used.
NOD
NOD is a head-motion operated mouse device that Wilbur Harvey and Rod came up with one afternoon in about 1983. It works by putting a special reflective pencil behind your ear and a quadrature detector that tracks its movement. The point was to be able to use the keyboard while you used the mouse cursor. It had an RS-232C interface and cost US$400. Apple Inc. were presented with a prototype but the project it was intended for got canceled.
See also
History of the Amiga
References
External links
SAGE collector site mirror
Booting Sage Compu
|
https://en.wikipedia.org/wiki/Poker%20Royale
|
Poker Royale is a television series on the Game Show Network (GSN), which featured No Limit Texas hold 'em Poker. The first series began on December 7, 2004. The eighth and final series, Poker Royale: Young Bloods II, began airing on December 9, 2005. The series host at its conclusion was John Ahlers, with commentary by Robert Williamson III and sideline reporting by Lisa Dergan.
The series
Poker Royale: The WPPA Championship
The first series was based on the championship of the World Poker Players Association. The show was hosted by Kevin Nealon, with commentary by Williamson (Evelyn Ng provided commentary for the first two episodes). Suzanne Freeman provided sideline reporting. A total of 72 players participated and put up the $5,000 entrance fee.
Unlike later series, this series was done in a tournament-style format where players who had zero chips were eliminated. Also different from other series were that three tables were active during the early episodes, and was later lowered to the top ten players at the main table in center stage.
This was the only series where there was a contest for viewers. During intervals of the program, various poker buzzwords would appear on screen. Viewers would log into GSN's website and input this word for a chance to win up to $10,000,000 in a poker hand with the winner of the WPPA championship.
In order to win the grand prize, the poker tournament winner had to get a full house or better by choosing 5 cards from a deck at random (each card was sealed in an envelope). James Van Alstyne won the tournament and shared an additional $30,000 with a member of GSN's website, in addition to the cash received, they each won a year's supply of pizza from Pizza Hut.
Results
Poker Royale: Battle of the Sexes
Poker Royale: Battle of the Sexes was the second series, hosted by radio personality Tom Leykis and Kennedy. Additional commentary was by Williamson once again, except for preliminary match #6, when Matt Vasgersian covered for him. Suzanne Freeman again returned as sideline reporter.
As opposed to the previous series, this one relied on males vs. females, which also incorporated the current scoring format, where players would be awarded points for their teams, depending on how they finished in that particular episode (one point for finishing sixth place to six points for finishing first). The six players (three each of men and women) who had the highest points played in a grand final with the same rules as above, and the highest team score won the tournament and the 6 teammates split a $30,000 bonus ($5,000 each) each daily winner also received $20,000, each finalist received a $5,000 bonus and the tournament's overall winner won $40,000. Kathy Liebert won the tournament and a total of $50,000. Despite losing all 6 preliminary games the women scored the most points at the final table to capture the $30,000 bonus.
The men were Chris Moneymaker, Paul Wolfe, Greg Raymer, Amir Vahedi, Layne Flack and Antonio Esfa
|
https://en.wikipedia.org/wiki/Production%20system%20%28computer%20science%29
|
A "production system" (or "production rule system") is a computer program typically used to provide some form of artificial intelligence, which consists primarily of a set of rules about behavior, but it also includes the mechanism necessary to follow those rules as the system responds to states of the world. Those rules, termed productions, are a basic representation found useful in automated planning, expert systems and action selection.
Productions consist of two parts: a sensory precondition (or "IF" statement) and an action (or "THEN"). If a production's precondition matches the current state of the world, then the production is said to be triggered. If a production's action is executed, it is said to have fired. A production system also contains a database, sometimes called working memory, which maintains data about the current state or knowledge, and a rule interpreter. The rule interpreter must provide a mechanism for prioritizing productions when more than one is triggered.
Basic operation
Rule interpreters generally execute a forward chaining algorithm for selecting productions to execute to meet current goals, which can include updating the system's data or beliefs. The condition portion of each rule (left-hand side or LHS) is tested against the current state of the working memory.
In idealized or data-oriented production systems, there is an assumption that any triggered conditions should be executed: the consequent actions (right-hand side or RHS) will update the agent's knowledge, removing or adding data to the working memory. The system stops processing either when the user interrupts the forward chaining loop; when a given number of cycles have been performed; when a "halt" RHS is executed, or when no rules have LHSs that are true.
Real-time and expert systems, in contrast, often have to choose between mutually exclusive productions—since actions take time, only one action can be taken, or (in the case of an expert system) recommended. In such systems, the rule interpreter, or inference engine, cycles through two steps: matching production rules against the database, followed by selecting which of the matched rules to apply and executing the selected actions.
Matching production rules against working memory
Production systems may vary on the expressive power of conditions in production rules. Accordingly, the pattern matching algorithm that collects production rules with matched conditions may range from the naive—trying all rules in sequence, stopping at the first match—to the optimized, in which rules are "compiled" into a network of inter-related conditions.
The latter is illustrated by the Rete algorithm, designed by Charles L. Forgy in1974, which is used in a series of production systems, called OPS and originally developed at Carnegie Mellon University culminating in OPS5 in the early 1980s. OPS5 may be viewed as a full-fledged programming language for production system programming.
Choosing which rules to ev
|
https://en.wikipedia.org/wiki/Bidirectional%20search
|
Bidirectional search is a graph search algorithm that finds a shortest path from an initial vertex to a goal vertex in a directed graph. It runs two simultaneous searches: one forward from the initial state, and one backward from the goal, stopping when the two meet. The reason for this approach is that in many cases it is faster: for instance, in a simplified model of search problem complexity in which both searches expand a tree with branching factor b, and the distance from start to goal is d, each of the two searches has complexity O(bd/2) (in Big O notation), and the sum of these two search times is much less than the O(bd) complexity that would result from a single search from the beginning to the goal.
Andrew Goldberg and others explained the correct termination conditions for the bidirectional version of Dijkstra’s Algorithm.
As in A* search, bi-directional search can be guided by a heuristic estimate of the remaining distance to the goal (in the forward tree) or from the start (in the backward tree).
was the first one to design and implement a bi-directional heuristic search algorithm. Search trees emanating from the start and goal nodes failed to meet in the middle of the solution space. The BHFFA algorithm fixed this defect Champeaux (1977).
A solution found by the uni-directional A* algorithm using an admissible heuristic has a shortest path length; the same property holds for the BHFFA2 bidirectional heuristic version described in de Champeaux (1983). BHFFA2 has, among others, more careful termination conditions than BHFFA.
Description
A Bidirectional Heuristic Search is a state space search from some state to another state , searching from to and from to simultaneously. It returns a valid list of operators that if applied to will give us .
While it may seem as though the operators have to be invertible for the reverse search, it is only necessary to be able to find, given any node , the set of parent nodes of such that there exists some valid operator from each of the parent nodes to . This has often been likened to a one-way street in the route-finding domain: it is not necessary to be able to travel down both directions, but it is necessary when standing at the end of the street to determine the beginning of the street as a possible route.
Similarly, for those edges that have inverse arcs (i.e. arcs going in both directions) it is not necessary that each direction be of equal cost. The reverse search will always use the inverse cost (i.e. the cost of the arc in the forward direction). More formally, if is a node with parent , then , defined as being the cost from to .(Auer Kaindl 2004)
Terminology and notation
the branching factor of a search tree
the cost associated with moving from node to node
the cost from the root to the node
the heuristic estimate of the distance between the node and the goal
the start state
the goal state (sometimes , not to be confused with the function)
the
|
https://en.wikipedia.org/wiki/Independent%20Labour%20Network
|
The Independent Labour Network was a left-wing political organisation in the United Kingdom.
It was founded in 1998 by MEPs Ken Coates and Hugh Kerr following their expulsion from the Labour Party. They stood candidates in the 1999 European Parliament election and were involved in setting up first local branches of the Socialist Alliance, then the national organisation. The Leeds North East Constituency Labour Party supported the ILN and as a result were threatened with disaffiliation from the Labour Party, many of its members forming the Leeds Left Alliance.
The organisation attracted few votes in the 1999 European Parliament election, and had disbanded by 2003.
External links
Independent Labour Network (inactive)
Article from What Next? critical of the ILN
Political parties established in 1998
Defunct socialist parties in the United Kingdom
1998 establishments in the United Kingdom
Labour parties
|
https://en.wikipedia.org/wiki/Marge%27s%20Son%20Poisoning
|
"Marge's Son Poisoning" is the fifth episode of the seventeenth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on November 13, 2005.
Plot
The family visits Paradise Pier, the Ferris wheel of which Marge has been looking forward all her life to riding, only to find out that it is being dismantled with its equipment being too old. Homer purchases a dumbbell, while Marge gets a tandem bicycle. When Marge wants to take the bike for a ride, she finds Homer and the kids unwilling to join her. Marge tries it on her own and repeatedly falls. Realizing that she might actually be lonely, Bart offers to go for a ride with her. They ride into an unincorporated part of the county and come upon a small village that features a tea house. Later, the tea house closes forever, causing Bart to invite Marge to his treehouse for tea.
Marge redecorates the treehouse and the pair goes off to get a new tea service; Bart gets a Krusty the Clown Tea Set. Outside the store, the bullies Jimbo, Dolph and Kearney accuse Bart of being a mama's boy, which causes Bart to rebel against her. Marge goes into a depression and eventually sells the bike to Chief Wiggum, Eddie and Lou.
Feeling bad, Bart offers to team with her in a karaoke contest. While seeing Principal Skinner and his mother Agnes perform, Marge has visions of a bad future for her and Bart, and she stops the show to prevent that future from occurring. She then lets Bart know that he can find his own way of life and that he should not worry about her because she has to worry about him. To make things better, she gives him a fire extinguisher to spray in front of the audience, including the bullies that tormented him.
Meanwhile, at Moe's tavern, Homer shows off the strength in one of his arms he has gained from working with the dumbbell, and Moe has an idea on how to capitalize on it. Moe takes Homer to the arm wrestling championships, where Homer readily wins the grand prize—a refund on his $50 admission fee—but finds that he really misses his wife. He drives home to reunite with Marge at karaoke, stopping to win a pie-eating contest along the way.
Reception
Ryan Budke of 'The Huffington Post' praised the episode, saying "although, this episode wasn't the best this season, it was still a great one, and a vast improvement over the majority of shows they've had in the past couple of years.'"
References
External links
The Simpsons (season 17) episodes
2005 American television episodes
|
https://en.wikipedia.org/wiki/Hit40UK
|
Hit40UK was a networked Top 40 chart show broadcasting on around 130 UK commercial radio stations every Sunday from 4pm to 7pm. It was also a TV programme shown on 4Music. The radio version was produced in house by Global Radio (formerly GCap Media) and Somethin' Else. The show was cancelled on 7 June 2009 and the last number 1 single was Boom Boom Pow by The Black Eyed Peas, played at 6:52pm.
Although the radio version of the chart has ended, it continued to be compiled, and a TV version was shown on 4Music, The Box, and Smash Hits. The TV version has since renamed UKHot40.
Format
The radio show counted down the top 40 songs in the chart. Unlike the official UK Singles Chart broadcast at the same time by BBC Radio 1, the Hit40UK chart included only the digital downloads and airplay in the UK, whereas the official chart includes physical and download sales with no radio airplay. The show always enjoyed higher audience figures than Radio 1's Official Chart Show since 1993, however, this is because Hit40UK is broadcast on 130 stations, whereas the Official Chart is only broadcast on BBC Radio 1, except for a brief period of 2006, when a weak commercial radio sector caused Hit40UKs share to fall below that of its rival.
Chart history
Hit40UK descended from The Network Chart Show which began on 30 September 1984 and which was originally hosted by David Jensen and broadcast on competing commercial radio stations across the UK. The Network Chart Show aired on Sundays from 5-7pm, as competition to BBC Radio 1's own Top 40 chart show, The Official Chart. In October 1990, the show was extended to start at 4pm and the chart expanded from a Top 30 to a Top 40 countdown. The Network Chart Show had been compiled by MRIB until Pepsi took over sponsorship from Nescafé in August 1993. In 1995, it was called the Pepsi Network Chart Show, but in 1996 it was renamed the Pepsi Chart. Pepsi ended their sponsorship of the show on 29 December 2002, and the Hit40UK name was adopted on 5 January 2003, but Dr. Fox remained the host until 30 May 2004. On 6 June 2004 Stephanie Hirst and Katy Hill became co-hosts of Hit40UK, from 23 October 2005 Hirst hosted the show on her own.
In March 2006, Hit40UK began broadcasting worldwide on the U-Pop satellite channel. The international version of the show is hosted by Mark Daley. It can be heard on XM Satellite Radio across the US and around the planet on WorldSpace Satellite Radio.
Hirst who during the week hosted the Galaxy Breakfast show in Yorkshire and was enjoying considerable success doing so, had to stand down as presenter of Hit40uk due to objections from Galaxy's rival Yorkshire radio stations Viking FM, Radio Aire and Hallam FM who were due to start broadcasting the chart on 22 October 2006. They were unhappy that a Galaxy Yorkshire presenter would be heard on their station, since they could possibly lose a proportion their breakfast audience to Hirsty's weekday breakfast show.
On 12 October 2006, it was announced
|
https://en.wikipedia.org/wiki/ODM
|
ODM may refer to:
Computing
.odm, Overdrive Media file
IBM Operational Decision Management, IBM's Business Rule Management System (BRMS)
Object Data Manager, a component of the AIX operating system used to store configuration information
Object Data Modelling, similar to Object-role modeling (ORM)
Operational Data Model, an XML-based data model to describe and collect clinical trial data
Ontology Definition MetaModel, an Object Management Group specification
Oracle Data Mining, an optional extra for Oracle Database
Oracle Directory Manager, part of Oracle Internet Directory, a tool for administering LDAP servers
Other uses
Odm., the abbreviation for the orchid genus Odontoglossum
Office of Defense Mobilization, a United States government agency, active from 1950 to 1958
Orange Democratic Movement, a Kenyan political party
Original design manufacturer, a company that produces a product to be sold under another company's brand
|
https://en.wikipedia.org/wiki/PME
|
PME may refer to:
Electronics and computing
Physical Medium Entity, an abstract defined by the IEEE 802.3 standard
Power Management Event, both a signal sent by a PCI bus and in Wake-on-LAN standard.
Protective Multiple Earthing, another name for the TN−C−S earthing system
Particle mesh Ewald, an algorithm used in calculating electrostatic forces in molecular dynamics simulations in computational biology and physics
Education
Professional Military Education, a term for systems for educating military personnel in the United States
Professional Master of Education, a type of initial teacher education qualification in Ireland.
Other
Progressive myoclonus epilepsies, a group of neurodegenerative diseases characterized by myoclonus (erratic muscle twitching)
Public Market Equivalent, a measure of historical performance of private equity
Pi Mu Epsilon, a U.S. national mathematics honor-society
Pacific Mozart Ensemble, the old name of Pacific Edge Voices, a choir in California
P.M.E., a clerical abbreviation for the members of the Roman Catholic Société des Missions-Étrangères du Québec
|
https://en.wikipedia.org/wiki/Danish%20Geodata%20Agency
|
The Danish Geodata Agency (GST) (), (previously National Survey and Cadastre of Denmark (, short KMS)), is the Danish state owned central agency responsible for surveying, mapping and land registering of all of Denmark, Greenland, the Faroe Islands and all waters associated with these. Geodatastyrelsen is an agency under the Danish Ministry of the Environment.
The overall goal of Geodatastyrelsen is to supply and ensure that everyone in the Danish society has access to reliable and accurate maps and information on all parts of the Realm.
Until 31 December 2004, KMS was a Sector research institute for the Ministry of the Environment in the fields of seismology, geodynamic and geodesy.
The seismology part was detached on 1 July 2004 and moved under the responsibility of Geological Survey of Denmark and Greenland (GEUS). On 1 January 2005, the geodesy part was detached and together with Danish Space Research Institute it formed Danish National Space Center.
History
KMS was officially formed on 1 January 1989 by combining Geodætisk Institut, Søkortarkivet and Matrikeldirektoratet, in an effort to strengthen mapping in Denmark. The political decision was conceived in a Royal resolution of 10 September 1987. The definition of its responsibilities is described in law #749 of 7 December 1988. Initially it was located under the Ministry of Housing, but in 2001 it was moved to the Ministry of the Environment.
On 1 January 2013, the agency changed its name to Danish Geodata Agency.
In 2014, the Danish government (through the GST) launched a full 1:1 recreation of the country of Denmark in Minecraft. The game map was based on real, official measurements made public by the Danish Geodata Agency. The reason was to "use the appeal of gaming to draw the public’s attention to geographical data" and an "invitation to teachers and schools to use the data in geography, math, science and history lessons". This, of course, drew attention of cyber vandals who attacked the server by blowing up areas of the map, destroying buildings and planting American flags. It is unclear exactly why.
Chris Hammeken, chief press officer at the Danish Geodata Agency, responded with "Minecraft is about building and rebuilding. [...] Only a minor area was destroyed. [...] It was the players who cleaned up the damage, replacing it with green grass and flowers the following morning." Regardless of the attacks ‒ which have since been fixed ‒ the replica appears to have been a success. On 1 January 2016, the Agency changed into the Agency for Data Supply and Efficiency, and links in English regarding “Denmark in Minecraft” were removed, although individual sections could still be downloaded elsewhere.
See also
List of national mapping agencies
References
External links
General information on the "basic data programme" Danish Geodata Agency (Official Homepage)
Survey and Cadastre
National mapping agencies
1989 establishments in Denmark
Environmental agencies in Denmark
|
https://en.wikipedia.org/wiki/TK95
|
The TK 95 microcomputer was a 1986 ZX Spectrum clone by Microdigital Eletrônica, a company located at São Paulo, Brazil. It was an evolution of the TK90X introduced the previous year.
The case was redesigned (copied from the Commodore Plus/4) and the keyboard was said to be "semi-professional" (according to the Brazilian manufacturer), with the some additional Sinclair BASIC commands that did not exist in the ZX Spectrums (for user defined charactersUDG), and better compatibility with the original ZX Spectrum (compared to the TK90X).
Like the Spectrum, the machine had 48 kilobytes of RAM. Inside, the same processor: Z80A running at 3.58 MHz, a 16 KB ROM chip and some RAM chips (old dynamic rams 4116 and 4416). Microdigital did some reverse engineering to develop a chip with the functions of the original ULA from Sinclair/Ferranti. The modulator was tuned to VHF channel 3 and the TV system was PAL-M (60 Hz). The cassette interface ran at a faster speed than the Spectrum.
Only two peripherals were released by Microdigital a light pen interface and a parallel printer interface. Other companies in Brazil released clone versions of Interface 1 joysticks (Atari 2600-compatibles) and interfaces for 5¼" PC drives (360 KB). The games had questionable legality being close to copies of the originals and the fans of the ZX Spectrum computer in Brazil were counted in tens of thousands.
References
External links
– Clube do TK90X
TK95 in Old-Computers
ZEsarUX – ZX Second-Emulator And Released for UniX (GPL)
Microdigital Eletrônica
Computer-related introductions in 1986
Goods manufactured in Brazil
Products introduced in 1986
ZX Spectrum clones
|
https://en.wikipedia.org/wiki/Night%20Flight%20%28TV%20series%29
|
Night Flight is an online visual-arts magazine and variety television show that originated on cable TV network USA Network. It originally aired from 1981 to 1988 before moving to syndication in the early 1990s. The show relaunched online on nightflight.com in 2015 with original episodes that can be streamed on the subscription channel Night Flight Plus. In April 2018, it returned to cable television as a short form (15 minute) program airing late Friday nights/early Saturday mornings on the network IFC. It includes a mix of mainstream and alternative music videos, artist interviews, B movies, documentaries, short films, stand-up comedy and animation.
History
Jeff Franklin (head of American Talent International) and Stuart S. Shapiro (head of International Harmony) approached USA Network about developing Night Flight in February 1981.
A new series that defied conventional formats and easy categorization was an acceptable risk to USA, and it aired the first episode of Night Flight on June 5, 1981. The timing was a deliberate move to exploit the Hollywood writers' strike, which had halted production on NBC's highly popular program Saturday Night Live.
Episodes originally lasted four hours each, and aired in the late-night programming block after 11:00 PM Eastern Time on Friday and Saturday nights. The final original broadcast of Night Flight aired December 30, 1988; it was replaced with the programs Camp Midnite and USA Up All Night starring Gilbert Gottfried, starting the following week.
In 1990, Night Flight was revived in syndication. New episodes were produced for three seasons until 1992, when the program reverted to selected reruns of episodes from the USA Network years hosted by Tom Juarez. These “best of” shows were aired as late as 1996.
In 2015, the series found a new life on NightFlight.com. In addition to the original series, it features new short and feature films, as well as curated YouTube and Vimeo clips. A subscription service called Night Flight Plus launched in March 2016 which allows viewers to pay a monthly or annual fee for access to full segments of the show.
In 2018, a new Night Flight program began airing on IFC as a 15-minute series. It mixes highlights from the original series with surreal footage taken from films, television and the Internet.
Format
Night Flight was one of the first sources in American television to see full-length and short films not generally aired on network television, or even pay-cable TV channels such as HBO. It was the first place that many Americans were able to see music documentaries such as Another State of Mind, The Grateful Dead Movie, Word, Sound and Power and Yessongs. Night Flight was also one of the first American television shows to present the music video as a serious visual art form rather than a mere promotional tool for musicians. Late-night broadcasts also afforded cable television the freedom to air portions of videos that MTV and other outlets had either censored or banned
|
https://en.wikipedia.org/wiki/Multiboot%20specification
|
The Multiboot specification is an open standard describing how a boot loader can load an x86 operating system kernel. The specification allows any compliant boot-loader implementation to boot any compliant operating-system kernel. Thus, it allows different operating systems and boot loaders to work together and interoperate, without the need for operating system–specific boot loaders. As a result, it also allows easier coexistence of different operating systems on a single computer, which is also known as multi-booting.
The specification was originally created in 1995 and developed by the Free Software Foundation. GNU Hurd, VMware ESXi, Xen, and L4 microkernels all need to be booted using this method. GNU GRUB is the reference implementation used in the GNU operating system and other operating systems. , the latest version of Multiboot specification is 0.6.96, defined in 2009. An incompatible second iteration with UEFI support, Multiboot2 specification, was later introduced. , the latest version of Multiboot2 is 2.0, defined in 2016.
Technical overview
While Multiboot defines a header as a struct, which needs to be present in the image file as a whole, in Multiboot2, fields or group of fields have a type tag, which allows them to be omitted from the Multiboot2 header.
Within the OS image file, the header must be in the first 8192 (213) bytes for Multiboot and 32768 (215) bytes for Multiboot2. The loader searches for a magic number to find the header, which is 0x1BADB002 for Multiboot and 0xE85250D6 for Multiboot2.
In the header, entry_addr points to the code where control is handed over to the OS.
This allows different executable file formats (see Comparison of executable file formats).
If the OS kernel is an ELF file (Executable and Linkable Format), which it is for the Linux kernel, this can be omitted for Multiboot2.
The ELF format is very common in the open source world and has its own field (e_entry) containing the entry point.
Before jumping to the OS entry point, the boot loader must provide a boot information structure to tell the OS how it left the system; for Multiboot, this is a struct, and for Multiboot2, every field (group) has a type tag and a size.
See also
El Torito (CD-ROM standard), for booting CD-ROM disks
List of tools to create bootable USB
Live USB
Multi-booting
References
External links
Booting
Computer standards
|
https://en.wikipedia.org/wiki/The%20Bilestoad
|
The Bilestoad is a fighting video game by Marc Goodman (credited as "Mangrove Earthshoe") for the Apple II and published in 1982 by Datamost.
In The Bilestoad, players control "meatlings" that hack and battle with axes and shields from a top-view perspective. The name is derived from the German words Beil (axe) and Tod (death). The odd spelling reflects Goodman's idea of a future language similar to A Clockwork Orange's Nadsat in which English has been modified by the borrowing of foreign words. Although the game may seem medieval, the backstory in the manual explains that the axe fighting is actually a future virtual reality game designed to reduce real violence.
According to the author, influences for The Bilestoad include the movie Excalibur and Monty Python and the Holy Grail.
Gameplay
The Bilestoad allows a human player to fight against either a computer-controlled opponent or another human. One can also pit two robots against each other. Movement and combat is accomplished with the keyboard, pressing keys to swing the gladiator's axe or shield outwards or inwards, or to make the gladiator turn, stop or walk. Players can lop off their opponents' shield or sword arms, and dispatch them by decapitation. Players progress through levels by successfully defeating their opponent. The highest level is called "Master".
The combat arena is a small island, maps of which (at short, medium, and long range) are shown at the right side of the screen. Scattered around the arena are various objects, including yin/yang discs which players can stand on to accelerate their movement, stars that transport players to other points in the arena, and "faces" that allow players to leave the level. The game offers more strategic variation than many fighting games, letting the player run away and be chased around the island. The musical soundtrack begins with Beethoven's "Für Elise".
Development
The Apple II has no built-in tone generator; all sound and music is produced by toggling on/off the speaker at appropriate intervals to generate the desired frequency. The game's incorporation of music with gameplay was an impressive technical feat.
Reception
Legacy
In the mid-1990s, Marc Goodman released an alpha demo of a re-working of the game for the Macintosh. Peter Akemann cited The Bilestoad as a major inspiration for his game Die by the Sword.
The assembly language source code for The Bilestoad was found on two 5.25 diskettes retrieved from a dumpster in Berkeley, California and purchased on eBay by the maintainer of apple2games.com in 2018. It was made available on GitHub in 2019.
References
1982 video games
Apple II games
Apple II-only games
Datamost games
Fighting games
Multiplayer and single-player video games
Top-down video games
Video games developed in the United States
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.