source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/NFL%20Head%20Coach
|
NFL Head Coach is a National Football League video game that was released on June 20, 2006 for the PlayStation 2, Xbox and Windows Computer. The game allows the player to control an NFL team and become the greatest coach in NFL history. It features then-Pittsburgh Steelers head coach Bill Cowher on the cover.
Gameplay
The concept behind the game puts the player in the position of a head coach for a National Football League franchise, similar to FIFA Manager where the player takes control of the head coach of a football team. The player will make roster moves, create playbooks, and hire and fire assistant coaches. Success is measured by wins, playoff success, how well the player does in the NFL Draft, and the careers of assistant coaches. The game also has ESPN integration, such as Mel Kiper, Jr. hosting the NFL Draft, Trey Wingo for the game's first few cutscenes and cutscenes featuring Steve Sabol as the player move through the ranks as a head coach.
Plot
The game begins the week after Super Bowl XL when the Pittsburgh Steelers pull off a 21–10 victory over the Seattle Seahawks. The coach that the player is about to take control of was formerly the offensive/defensive coordinator for the Steelers, will soon become a head coach. First, the player selects a team and then proceeds to the job interview. The coach overall will range from 50 to around 80 at the end of the interview. Depending on how well the interview goes, the player will receive up to five offers from five teams though there are eight teams that are likely to send the player an offer although the player can pick any team they wish. The player selects a team and then signs a contract with them. In addition to being the head coach, the player is also the general manager of the team. On the first day, the player will meet the team owner. Aside from meeting the team owner, the player also meets the other coaches with whom he will work. Daily activities, depending on the time of the season, include hiring and firing coaches, calling players' agents, checking e-mail, identifying players to scout at the NFL Scouting Combine, gameplanning for the next game, and running practice. During the game, the player can motivate and discuss strategy with the team, which can affect the motivated player's reception. The career is 30 years long from 2006 to 2036.
Teams and stadiums
The game consists of all 32 teams from the 2005 NFL season with all 31 stadiums. Unlike NFL Head Coach 09, however, Aloha Stadium is not in NFL Head Coach.
New England Patriots head coach Bill Belichick, as well as Dallas Cowboys head coach Bill Parcells, are not in the game due to liscensing issues.
Reception
The game received positive reviews. IGN gave the game a 7.2/10, praising the NFL Films score, though commenting about the Madden engine being "not as pretty as other football games". On the contrary, GameSpot praised the engine, though criticizing the multiplayer; GameSpot also graded the game as 7.2/10. CNET scored
|
https://en.wikipedia.org/wiki/Clare%20O%27Neil
|
Clare Ellen O'Neil (born 12 September 1980) is an Australian politician who is the Minister for Home Affairs and Minister for Cyber Security, since 2022. She is a member of the Australian Labor Party (ALP) and has been a member of the House of Representatives since 2013, representing the Victorian seat of Hotham.
O'Neil was elected mayor of the City of Greater Dandenong in 2004, aged 23, becoming the youngest female mayor in Australian history. Before entering federal parliament she worked as a manager at McKinsey & Company. O'Neil was elected to parliament at the 2013 federal election. In 2016 she was appointed as a shadow minister by opposition leader Bill Shorten. She continued in the shadow ministry after Anthony Albanese succeeded Shorten as ALP leader in 2019.
Early life
O'Neil was born in Melbourne in 1980, the daughter of prolific Australian publishers Anne O'Donovan and Lloyd O'Neil. She undertook her VCE at Loreto Mandeville Hall in Toorak, where she later served on the school council. She then undertook further education at Monash University, studying a Bachelor of Arts (History), and then a Bachelor of Laws, graduating with honours in both fields. In 2006, she was awarded a Fulbright Scholarship to undertake a Master of Public Policy at Harvard University's John F. Kennedy School of Government.
Career
O'Neil joined the Australian Labor Party at 16 and soon met Simon Crean, former party leader and her predecessor as the member for the division of Hotham. In her maiden speech, she described Crean as one of her "Labor heroes" and "a person in whose footsteps I am honoured to walk".
In March 2003, O'Neil ran as a candidate for Springvale South Ward in the City of Greater Dandenong and was subsequently elected. After one year in the position, she was also elected as mayor, becoming the youngest female mayor of a local government area in Australian history.
In 2007, while studying in the United States, O'Neil worked as an intern on the New York Stock Exchange; and in 2008 returned to Australia to serve briefly as an adviser to the Office of the Commonwealth Treasurer. She later worked at management consulting firm McKinsey & Company from 2009 to 2013 as an engagement manager.
Politics
O'Neil was endorsed as a late replacement candidate for the Australian Labor Party in Hotham at the 2013 Australian federal election, following the disendorsement of her friend Geoff Lake. She retained the seat for Labor and was quickly flagged by political commentator Peter van Onselen as a future front bencher.
O'Neil is a member of the Labor Right faction. From 2013 to 2016, she served on the House of Representatives standing committees on Agriculture and Industry and Tax and Revenue. Following the 2016 election, O'Neil was appointed to the shadow ministry under opposition leader Bill Shorten, becoming Shadow Minister for Justice. She was additionally made Shadow Minister for Financial Services in June 2018. After Labor lost the 2019 election, O'Ne
|
https://en.wikipedia.org/wiki/Yankee%20Network
|
The Yankee Network was an American radio network, based in Boston, Massachusetts, with affiliate radio stations throughout New England. At the height of its influence, the Yankee Network had as many as twenty-four affiliated radio stations. The network was co-founded by John Shepard III and his brother Robert, in 1929–1930. The beginnings of what became the Yankee Network occurred in the mid-1920s, when John Shepard's Boston station WNAC linked by telephone land lines with Robert Shepard's station in Providence, Rhode Island, WEAN, so that the two stations could share or exchange programming. Those two stations became the first two Yankee Network stations. In 1930, they were joined by the first affiliated radio stations, including WLBZ in Bangor, Maine; WORC in Worcester, Massachusetts; WNBH in New Bedford, Massachusetts; and WICC in Bridgeport, Connecticut. During the 1930s, the network became known for developing its own local and regional news bureau, the Yankee News Service. The Yankee Network and the Yankee News Service operated until February 1967.
History
Early years
The main benefit of joining the Yankee Network was that it offered its affiliates as much as 17 hours of daily programming. Yankee affiliates were provided with access to some of the best-known Boston vocalists and orchestras, as well as nationally-known entertainers who were appearing in Boston or Providence. For example, a concert by opera star Mary Garden was broadcast, as was a concert by the Providence Symphony Orchestra. Dance music was often played by bandleader Joe Rines and his orchestra, or by other popular bandleaders like Dok Eisenbourg. The Yankee Network also had its own 22-piece orchestra, led by Charles R. Hector. Among other popular entertainers heard on the Yankee Network in the early 1930s were pianist, songwriter and bandleader Gus Arnheim, and local favorites "Hum and Strum." The Yankee Network broadcast radio plays, featuring its own drama troupe, made up of members of the WNAC staff, led by announcer Ben Hadfield. In addition to religious services and educational talks, there were also cultural programs, including excerpts from "The Green Pastures," a play starring black actor Richard B. Harrison; and talks by the region's mayors, governors, and other political leaders. For sports fans, they could hear Boston Braves and Boston Red Sox baseball games, announced by Fred Hoey. College football, broadcast live from various schools in the region, was also a popular feature. In addition to providing local and regional programming, the Yankee Network was also affiliated with the Columbia Broadcasting System (later known as CBS), which provided national programs to complement Yankee's New England focus.
By 1931, the network was also offering regular news broadcasts, on the half-hour, making use of reporting by some of Boston's newspapers. But by 1933, the relationship between print and radio had become contentious, with newspapers no longer willing t
|
https://en.wikipedia.org/wiki/Human%20Protein%20Reference%20Database
|
The Human Protein Reference Database (HPRD) is a protein database accessible through the Internet. It is closely associated with the premier Indian Non-Profit research organisation Institute of Bioinformatics (IOB), Bangalore, India. This database is a collaborative output of IOB and the Pandey Lab of Johns Hopkins University.
Overview
The HPRD is a result of an international collaborative effort between the Institute of Bioinformatics in Bangalore, India and the Pandey lab at Johns Hopkins University in Baltimore, USA. HPRD contains manually curated scientific information pertaining to the biology of most human proteins. Information regarding proteins involved in human diseases is annotated and linked to Online Mendelian Inheritance in Man (OMIM) database. The National Center for Biotechnology Information provides link to HPRD through its human protein databases (e.g. Entrez Gene, RefSeq protein pertaining to genes and proteins.
This resource depicts information on human protein functions including protein–protein interactions, post-translational modifications, enzyme-substrate relationships and disease associations. Protein annotation information that is catalogued was derived through manual curation using published literature by expert biologists and through bioinformatics analyses of the protein sequence. The protein–protein interaction and subcellular localization data from HPRD have been used to develop a human protein interaction network.
Highlights of HPRD as follows:
From 10,000 protein–protein interactions (PPIs) annotated for 3,000 proteins in 2003, HPRD has grown to over 36,500 unique PPIs annotated for 25,000 proteins including 6,360 isoforms by the end of 2007.
More than 50% of molecules annotated in HPRD have at least one PPI and 10% have more than 10 PPIs.
Experiments for PPIs are broadly grouped into three categories namely in vitro, in vivo and yeast two hybrid (Y2H). Sixty percent of PPIs annotated in HPRD are supported by a single experiment whereas 26% of them are found to have two of the three experimental methods annotated.
HPRD contains 18,000 manually curated PTMs data belonging to 26 different types. Phosphorylation is the leading type of modification of protein contributing to 63% of PTM data annotated in HPRD. Glycosylation, proteolytic cleavage and disulfide bridge events are the next leading contributors of PTM data.
HPRD data is available for download in tab delimited and XML file formats.
HPRD also integrates data from Human Proteinpedia, a community portal for integrating human protein data. The data from HPRD can be freely accessed and used by academic users while commercial entities are required to obtain a license for use. Human Proteinpedia content is freely available for anyone to download and use.
PhosphoMotif Finder
PhosphoMotif Finder contains known kinase/phosphatase substrate as well as binding motifs that are curated from the published literature. It reports the PRESENCE of any literatu
|
https://en.wikipedia.org/wiki/Anixter
|
Anixter International Inc. is a company based in Glenview, Illinois, United States and founded in 1957. The company supplies goods and services for communications, security, networking, audio-visual, and industrial control applications.
The company operates with three major divisions: Network & Security Solutions, Electrical and Electronic Solutions, and Utility Power Solutions. Aerospace Hardware, once considered the fourth division, was sold by Anixter in 2011 to Greenbriar Equity, which formed Align Aerospace.
In 2002 Anixter was named as a Forbes "Platinum 400" company.
On January 13, 2020, Anixter agreed to be acquired by WESCO International for $4.5 billion in cash and WESCO stock. Anixter's shares ceased trading as of June 22, 2020.
Early history
Anixter was started in 1956 by brothers Alan and Bill Anixter. Known originally as Anixter Brothers, the two opened Anixter as a wholesale distribution company that resold cable. The two brothers received a $20,000 loan from their mother to get the business started, and within 10 years grew revenue to $10 million. In 1969, Anixter moved its headquarters to Skokie. In an interview with the Chicago Tribune, Alan Anixter said he carried a list of acquisitions in his pocket, and by the end of the 1960s, Anixter acquired 19 companies. Anixter went public on the American Stock Exchange in 1967 and expanded to the U.K. in 1972. In 1975, Anixter gained a listing on the New York Stock Exchange, and by the end of the 1970s it had $268 million in sales and 38 warehouses in the U.S., nine in Canada, three in the U.K. and one in the Netherlands.
Telecommunications Era
With the breakup of AT&T in early 1984, Anixter went about hiring executives from phone companies and suppliers and invested heavily in its telecommunications business. Until this time, regional telephone companies had to buy their equipment directly from AT&T's Western Electric Company; however, this ruling allowed a business like Anixter's to sell direct to regional telephone companies. By the mid 1980s, telecommunications sales made up 60 to 70 percent of Anixter's business. In 1987, the holding company bought Anixter, which had moved into the data communications business. Itel was led by Samuel Zell, who had become chairman in 1985. In the late 1980s, Anixter created a program called Levels to compare one brand of cable to the other. By the 1990s, the Levels program became industry standard, and in 2003, Anixter sold the Levels program to Underwriters Laboratories. In 1989, Anixter crossed the $1 billion mark in sales. By the 1990s, Itel made Anixter its core operation, and in 1995, Itel changed its name to Anixter. In the 1990s, Anixter continued to expand into different markets. It entered the Mexico market in 1991, Australia in 1992, and Eastern Europe and Asia Pacific in 1993. Anixter entered the South American market in 1995. In the later 1990s and 2000s, Anixter purchased Pacer Electronics, Pentacon, Walters Hexagon, DDI, Infast G
|
https://en.wikipedia.org/wiki/Wireless%20Communications%20Transfer%20Protocol
|
Wireless Communications Transfer Protocol (WCTP) is the method used to send messages to wireless devices such as pagers on NPCS (Narrowband PCS) networks. It uses HTTP as a transport layer over the World Wide Web.
Development of WCTP was initiated by the Messaging Standards Committee and submitted to the Radio Paging Community. When the first proposal was received, a sub-committee was established to improve the protocol and issue it as a specification. The sub-committee was moved into the PTC (Paging Technical Committee) which is a volunteer committee composed of industry representatives. The PCIA (Personal Communications Industry) accepted the first full release and adopted the protocol as a PCIA standard. The current version is WCTP 1.3.
External links
WCTP 1.3 Update 1 specification
WCTP Settings for Carriers
Application layer protocols
|
https://en.wikipedia.org/wiki/Paz%20Oil%20Company
|
Paz Oil Company Ltd. () () is the largest Israeli fuels company. Paz distributes gasoline and other petroleum products through a network of gas stations, as well as LPG and natural gas for home use (cooking and heating) through its subsidiary PazGaz. Paz operates combined cafes and stores in many gas stations, through its subsidiary Yellow. It also owns the supermarket chains Freshmarket and Super Yuda.
History
Foundation, names, and ownership in the 20th century
Paz was founded in 1922, as Anglo-Asiatic Petroleum. From 1927 it operated as part of Royal Dutch Shell, under the name Shell Palestine.
In 1957 Shell decided to withdraw from Israel under economic pressure from Arab countries. In 1958, the company changed to the ownership of the Briton Isaac Wolfson and the French Nahmias brothers and changed its name to Paz Petroleum Company Ltd. The symbol of the company, a yellow triangle, still resembles that of Shell.
Wolfson sold his company holdings in 1981 to the State of Israel, who sold it in 1988 to the Australian Jack Liberman. Since 1999, the Israeli businessman Zadik Bino owns the majority of the shares, with the Liberman family and other groups holding minority interests.
Investments and market reach in the 21st century
In 1999, Paz acquired 74 percent of the Israeli fast food chain Burger Ranch. In late 2001, Paz completed the acquisition of Burger Ranch, becoming 100 percent owners of the chain. New branches of Burger Ranch were opened at Paz gas stations. In 2006, Paz sold the chain to the Israeli businessman Yossi Hoshinski.
In August 2006 Paz won a tender to acquire the Ashdod Oil Refineries with a NIS 3.5 billion bid, from Oil Refineries Ltd; which was forced to break its monopoly on oil refining in Israel. The acquisition made Paz Israel's most powerful energy company and its owner Zadik Bino the industry's most powerful figure.
In 2012, Paz held 30% of the Israeli fuel market and 31% of the Israeli gas stations. On 12 February 2020, Paz Oil was listed on the United Nations list of companies operating in West Bank settlements. On 5 July 2021, Norway's largest pension fund KLP said it would divest from Paz Oil as it helped to power Israeli settlements in the West Bank.
In March 2021, Paz acquired the Super Yuda supermarket chain for 170 million NIS. In August that year, it also acquired the Freshmarket chain.
Operations
Retail and Wholesale
260 filling stations across Israel
255 Yellow convenience stores
Pazgas - Israel’s largest gas company, supplying LPG to over half a million customers
Refining and Logistics
Ashdod Oil Refineries
Industries and Services
Paz Aviation
Paz Solar
Paz Lubricants & Chemicals
Pazkar – manufacturer of bituminous products, waterproofing membranes, coatings and adhesives
References
Filling stations in Israel
Oil and gas companies of Israel
Israeli brands
Companies listed on the Tel Aviv Stock Exchange
Companies based in Netanya
|
https://en.wikipedia.org/wiki/Macintosh%20Quadra%20660AV
|
The Macintosh Quadra 660AV, originally sold as the Macintosh Centris 660AV, is a personal computer designed, manufactured and sold by Apple Computer from July 1993 to September 1994. It was introduced alongside the Quadra 840AV; the "AV" after both model numbers signifies video input and output capabilities and enhanced audio.
The 660AV was discontinued a few months after the introduction of the Power Macintosh 6100/60AV. Apple sold a Power Macintosh Upgrade Card that upgrades the 660AV to match the 6100/60AV's specifications for . This and the Quadra 630 were positioned for users who were not ready to move to PowerPC.
Hardware
The 660AV uses the pizza box form factor of the earlier Centris 610. The 660AV has a full Motorola 68040 instead of the 610's FPU-less 68LC040. Like the 840AV, the 660AV features video input/output capability and an onboard AT&T 3210 digital signal processor (here clocked at 55 MHz) to make the video handling less of a burden on the CPU.
The 660AV is the first Macintosh to include GeoPort; an optional GeoPort Telecom Adapter enables fax and modem capabilities.
Some of the earliest Centris 660AVs have the older auto-inject floppy drive opening similar to the 610, but most of the Centris models and all of the Quadra models have a drive similar to the Power Macintosh 6100, lacking the auto-inject feature. These models have a deep round indentation at the center of the floppy drive slot to make it possible to fully insert the disk.
The Quadra AV Macs introduced a new universal ROM (codenamed SuperMario) that would later be used in all PowerPC systems. It includes SCSI Manager 4.3 and Sound Manager 3.0. It also is "vectorized", making it easier to patch.
Models
Introduced July 29, 1993:
Macintosh Centris 660AV
Introduced October 21, 1993:
Macintosh Quadra 660AV
Reception
Jonathan Chevreau of the National Post said on August 7, 1993, that the Quadra 840AV and Centris 660AV were the next most interesting multimedia computers behind the new SGI Indy, putting Apple among the forefront of the birth of the major industry of desktop multimedia. Byte magazine said in September 1993 that Apple and Silicon Graphics were trailblazers by setting audio and video input as default features of these two Macintosh and of the Indy desktop PCs, which "could change the way businesspeople communicate".
References
External links
Centris 660av (Quadra 660AV) at Low End Mac
Centris 660AV and Quadra 660AV at EveryMac.com
660AV
660AV
Quadra 660AV
Quadra 660AV
Computer-related introductions in 1993
Products and services discontinued in 1994
|
https://en.wikipedia.org/wiki/Bryant%20Grinder
|
Bryant is a brand of machine tools headquartered in Springfield, Vermont. Acquired by Fives in 2015, the Bryant product line specializes in the grinding field, building grinding machines with computer numerical control (CNC).
Bryant began as an independent machine tool builder. The Bryant Chucking Grinder Company was founded in Springfield, Vermont in 1909 and was an independent company for its first half century, during which time it was widely known in the machining industries by the colloquial name Bryant Grinder. In 1958, it was bought by Ex-Cell-O Corporation, another machine tool builder, and became a subsidiary. In 1986, Ex-Cell-O and its subsidiaries, including Bryant, were purchased by Textron. In 1988, Textron sold Bryant Grinder to the Goldman Group, a financial investment group. In 2002, Bryant was purchased by Vermont Machine Tool, where it was operated as a division. In 2015, Bryant was purchased by Fives, an international engineering group, expanding its expertise to the design and manufacture of high-precision/high-production inner-outer diameter grinders.
Early decades (1910s-1930s)
The Bryant Chucking Grinder Company was founded in 1909 by William LeRoy (Roy) Bryant, one of the machine tool entrepreneurs mentored by James Hartness of the Jones & Lamson Machine Company (J&L). Roy Bryant had joined J&L in 1897, became chief draughtsman in 1899, and was chief engineer by 1905. While working on tooling for chucking lathes, he invented a multispindle grinder for second-operation work, which he patented (). He took Hartness's advice and formed a company to build his grinders, and the Bryant Chucking Grinder Company joined J&L as one of several firms that made Springfield, Vermont an important center for machine tools and their tooling, such as accessories and cutting tools. (Others were the Fellows Gear Shaper Company and the Lovejoy Tool Company). Hartness helped finance the Bryant venture and was the firm's first president; Roy Bryant afterward assumed the post.
According to Vermont Machine Tool, "By 1910, a 20,000 sq ft building was built on the current location across the street from J&L. During the same year, 9 machines were shipped to Ford and Cadillac." The Bryant Company established itself as a noted brand for both internal and external grinding, and (like J&L) it became an important machine tool builder to the automotive industry.
World War I fueled great demand for machine tool builders such as J&L and Bryant. By 1917, the plant had doubled in size and was running 3 shifts a day. Vermont Machine Tool says, "Additional space was rented from J&L to help produce artillery shells. The war promotion created two new machine models especially for the aircraft industry." During World War I, the Ford Aircraft Division kept 102 Bryant machines busy in its production of the Liberty engine, and Bryant earned such a reputation for accuracy and precision that most of the grinding done on aircraft engines from World War I through the I
|
https://en.wikipedia.org/wiki/TV9%20%28Malaysian%20TV%20network%29
|
TV9 (spelled as tivi sembilan) is a Malaysian free-to-air television network launched on 22 April 2006 as a subsidiary of Media Prima Berhad. It airs programming that tends mostly towards the Malay demographic. The channel formerly existed as Channel 9 from 9 September 2003 until 3 February 2005 due to financial difficulties faced by the operator. TV9 started broadcasting 24 hours a day on 6 May 2019.
History
As Channel 9/nine
nine was launched on 9 September 2003, broadcasting daily from 8:00 am to 3:00 am daily. Channel 9 was conceived and launched by media entrepreneur, Jamal Hassim. At the time it was a rare feat for a national free-to-air television network to be established by a private individual. Its headquarters was located at Temasya Industrial Park in Shah Alam, Selangor.
Channel Nine was acquired by Malaysia's largest media corporation, Media Prima Berhad. Media Prima announced its acquisition of 100% equity stake in Ch-9 Media Sdn Bhd and almost completed the company's ownership of all commercial free-to-air television channels in Malaysia.
Renamed as TV9 and early history
Channel 9 was renamed as TV9, with test transmission commenced on Saturday, 1 April 2006 with 4-hour broadcasts from 8:00 pm to midnight daily and airing music videos mostly in Malay. Full launch of the channel began at noon of 22 April 2006 with 13-hour broadcasts from 12:00 pm to 1:00 am daily and a new slogan: Dekat di Hati (Malay for Close at heart). TV9 is available via terrestrial television in Peninsular Malaysia. Since 28 December 2006, it expanded its coverage to Sabah, Sarawak and Astro Malaysia.
For the first months of broadcast, TV9 did not have its in-house news bulletin, except for Edisi 7 simulcasts from NTV7. TV9 began to produce news bulletins on New Year's Day 2007, under the Berita TV9 (literally: TV9 News) brand. It is currently broadcasting two half-hour editions: a midday edition at 1:00 pm Saturday to Thursday, and its flagship nightly edition at 8:00 pm.
On New Year's Day 2010, the channel launched a new tagline, Di Hatiku (At your heart in Malay), which actually used since its 3rd anniversary along 2009.
Inclusion of home shopping blocks
Since 1 April 2016, Media Prima included home shopping block CJ Wow Shop, collaboration between them and Korean conglomerate CJ Group, to all of its channels lineup, including TV9. It currently airs on this channel from 6:00 am to 8:00 pm (with buffer periods at 1:00 pm from Saturday to Thursday to accommodate Berita TV9 Tengah Hari). Such long periods of teleshopping blocks has make this channel known as a part-time TV shopping channel. This block, however, attracted huge criticism by viewers through social media due to overtaking a large part of daytime schedule, previously running mostly reruns, religious programming and children's programming. On 4 March 2018, Friday to Sunday breakfast show Nasi Lemak Kopi O (which formerly occupied the first two-hour block of CJ WOW Shop) ended its 10-year
|
https://en.wikipedia.org/wiki/Needle-nose%20pliers
|
Needle-nose pliers, also known as long-nose pliers and snipe-nose pliers, are both cutting and holding pliers used by artisans, jewellery designers, electricians, network engineers and other tradesmen to bend, re-position and snip wire. Their namesake long nose gives excellent control while the cutting edge near the pliers' joint provides "one-tool" convenience. Because of their long shape they are useful for reaching into small areas where cables or other materials have become stuck or unreachable with fingers or other means.
Bent nose pliers, also named bent needle-nose pliers, curved nose pliers or curved needle-nose pliers, have a curved beak.
Wiring pliers, are used to cut, strip and manipulate wire during the process of terminating it.
See also
Lineman's pliers
References
Pliers
|
https://en.wikipedia.org/wiki/Eigen
|
Eigen may refer to:
Eigen (C++ library), computer programming library for matrix and linear algebra operations
Eigen, Schwyz, settlement in the municipality of Alpthal in the canton of Schwyz, Switzerland
Eigen, Thurgau, locality in the municipality of Lengwil in the canton of Thurgau, Switzerland
Manfred Eigen (1927–2019), German biophysicist
Saint Eigen, female Christian saint
, Japanese sport shooter
See also
Eigenvalue, eigenvector and eigenspace in mathematics and physics
Eigenclass, synonym to metaclass in the Ruby programming language
Eigenbehaviour, with its connection to eigenform and eigenvalue in cybernetics (relevant authors being Heinz von Foerster, Luis Rocha and Louis Kauffman)
|
https://en.wikipedia.org/wiki/Jim%20Walton%20%28journalist%29
|
Jim Walton (born 1958) is the former president of CNN Worldwide. He joined CNN in 1981, one year after the network was founded.
He graduated from the University of Maryland, College Park in 1981. He started his career at CNN as a VJ, an entry-level position. He has two sons, Jake and Max.
He took over as the president of CNN Worldwide in 2003. On July 27, 2012, Walton announced he was quitting at CNN after working there for over 30 years. He remained with the network until the end of the year after which he was replaced by Jeff Zucker, former NBCUniversal president.
References
1958 births
Living people
CNN executives
Presidents of CNN
University of Maryland, College Park alumni
|
https://en.wikipedia.org/wiki/Gordon%20Pask
|
Andrew Gordon Speedie Pask (28 June 1928 – 29 March 1996) was a British cybernetician, inventor and polymath who made during his lifetime multiple contributions to cybernetics, educational psychology, educational technology, epistemology, chemical computing, architecture, and the performing arts. During his life he gained three doctorate degrees. He was an avid writer, with more than two hundred and fifty publications which included a variety of journal articles, books, periodicals, patents, and technical reports (many of which can be found at the main Pask archive at the University of Vienna). He also worked as an academic and researcher for a variety of educational settings, research institutes, and private stakeholders including but not limited to the University of Illinois, Concordia University, the Open University, Brunel University and the Architectural Association School of Architecture. He is known for the development of conversation theory.
Biography
Early life and education: 1928-1958
Pask was born in Derby, England, on June 28, 1928, to his parents Percy and Mary Pask. His father was "a partner in Pask, Cornish and Smart, a wholesale fruit business in Covent Garden". He had two older siblings: Alfred, who trained as an engineer before becoming a Methodist minister, and Edgar, a professor of anesthetics. His family moved to the Isle of Wight shortly after his birth. He was educated at Rydal Penrhos. According to Andrew Pickering and G. M. Furtado Cardoso Lopes, school taught Pask to "be a gangster" and he was noted for having designed bombs during his time at Rydal Penrhos which was delivered to a government ministry in relation to the war effort during the second world war. He later went on to complete two diplomas in Geology and Mining Engineering from Liverpool Polytechnic and Bangor University respectively.
Pask later attended Cambridge University around 1949 to study for a bachelor's degree, where he met his future associate and business partner Robin McKinnon-Wood who was studying his undergraduate in Maths and Physics at the time. At the time, Pask was living in Jordan's Yard, Cambridge under the supervision of the scientist and engineer John Brickell. During this time, Pask was more known for his work in the arts and musical theatre rather than his later pursuits in science and education. He became interested in cybernetics and information theory in the early 1950s when Norbert Wiener was asked to give a presentation on the subject for the university.
He eventually obtained an MA in natural sciences from the university in 1952, and met his future wife Elizabeth Pask (née Poole) around this time at the birthday party of a mutual friend when she was studying at Liverpool University and he was visiting his father in Wallasey, Mersey. They married in 1956 and later had two daughters together.
Beginning of System Research Ltd: 1953-1961
In 1953, Pask formally founded alongside his wife Elizabeth and Robin McKinnon-Wood the re
|
https://en.wikipedia.org/wiki/Multiplayer%20BattleTech%3A%20EGA
|
Multiplayer BattleTech is a PC MMORPG BattleTech game developed by Kesmai and featured on the now defunct GEnie online gaming network.
Gameplay
It featured a text-based chat component for roleplaying, team development and battle planning and a 3D battle simulator component. The game engine was based on a heavily modified version of the original MechWarrior. Multiplayer BattleTech was followed by Multiplayer BattleTech: Solaris.
Reception
Computer Gaming World in 1993 stated that "Fans of MechWarrior will not want to miss this next generation of the classic simulation ... both addicting and satisfying". A 1994 survey of strategic space games set in the year 2000 and later gave the game four stars out of five, stating that "The licensed BattleTech universe is put to good use here ... the long-term satisfaction of role-playing combined with the quick-playing thrill of a simulation".
In June 1994 Multiplayer BattleTech won Computer Gaming Worlds "Online Game of the Year" award. The editors called it "a simulation that looks like Activision's classic MechWarrior, but performs significantly better with real human 'mech pilots on your flanks."
References
1991 video games
DOS games
DOS-only games
Multiplayer online games
BattleTech games
Video games based on miniatures games
Video games developed in the United States
|
https://en.wikipedia.org/wiki/Celebrity%20Blackjack
|
Celebrity Blackjack is an American television show where celebrities played tournament style blackjack for charity. The show, which ran on Game Show Network, was hosted by Matt Vasgersian (and Alex Borstein in the first season). Dave Stann was the dealer. Season 1 aired weekly from July 5, 2004, through August 9, 2004. Season 2 premiered October 12, 2004, and ran weekly through January 11, 2005.
Overview
Season 1
Five celebrities started each tournament with $100,000 in tournament chips and played 21 hands of blackjack. Minimum bets were $1,000 and maximum bets were $25,000 for the first ten hands. For hand 11-20, the minimum bet was $5,000 and there was no maximum bet. Double down for less is permitted. All bets throughout the tournament MUST be in $1,000 increments. A player cannot bet the remaining $500 which it would count as an all-in bet when the minimum bet is $5,000. However, a player may use the remaining $500 for the insurance. Insurance pays 2 to 1. Blackjack pays 3 to 2. The bets for the 21st and final hand were secret, with each player writing the bet out prior to the hand being played.
The deck included four jokers into the six decks they play with. Whatever a player is dealt with a joker card as one of the first 2 cards, a player will have a choice to replace any card on the table still in play once a player has received their first two cards (meaning, once a hand is stood on, it's no longer in-play). A player can also take the dealer's up card, if they wish.
Final table results
Caroline Rhea was the champion of Season 1, she won the title and $100,000 USD for her charities.
1 Billy Baldwin substituted for his wife, Chynna Phillips, who won her preliminary table.
Season 2
The play for the second season of Celebrity Blackjack was the same, with the following exceptions:
There were four celebrities per table instead of five.
The deck included six jokers instead of four into the six decks they play with when there's only four celebrities. Whatever a player is dealt with a joker card as one of the first 2 cards, a player will have a choice to replace any card on the table still in play once a player has received their first two cards (meaning, once a hand is stood on, it's no longer in-play). A player can also take the dealer's up card, if they wish.
The tournament featured ten preliminary rounds, two semi-final rounds, and a final table. Each preliminary table had four celebrities and each semi-final table had five players that won their preliminary round. The top two finishers from each of the two five-person semis round will move on to the Final table for a chance at winning an additional $200,000 for their charity.
The winner of the preliminary round will receive $25,000 for their charity and move on to the semis round. For the Semis Round, the top two finishers (meaning first place will win an additional $75,000 and second place will win an additional $50,000) will move on to the Final table. For the final table, first
|
https://en.wikipedia.org/wiki/World%20Series%20of%20Blackjack
|
The World Series of Blackjack is a televised blackjack tournament created and produced by the cable network GSN. It is a closed tournament; players are either invited to play or attempt to win a spot via a satellite tournament. Rounds are edited into 1-hour episodes and broadcast on GSN. Matt Vasgersian and Max Rubin provided commentary for the first two seasons. Tiki Arsenault was the dealer for Season 1 as Deanna Bacon was the dealer for Seasons 2 and 3 while Jessica Knight was the dealer for Season 4.
Season 1 premiered weekly from March 15, 2004 to April 26, 2004 with a co-host, Melana Scantlin.
Season 2 premiered weekly from January 21, 2005 to April 22, 2005 with a new co-host, Megan Riordan.
Season 3 premiered weekly from June 5, 2006 to September 4, 2006 as part of GSN's Casino Night (retooled, with High Stakes Poker, as Vegas Night) programming block, with new hosts John Fugelsang and Ben Mezrich.
Season 4 premiered on GSN from June 4, 2007 to August 27, 2007. A field of 40 players, including Celebrity Blackjack champion Caroline Rhea, baseball star Orel Hershiser and magician Penn Jillette competed for a $1 million prize pool. Vasgersian returned as a commentator.
Rules
The rules (as of season 4) are as follows:
Each player begins with $100,000 in chips ($10,000 in chips in Season 1).
The initial minimum bet is $1,000, the maximum bet is $50,000 (minimum bet is $100, the max bet is $5,000 in Season 1).
There are six decks.
Each player gets one "Burger King Power Chip" per round, which allows a player to switch one card with the next card in the shoe. If used on a double-down hand, the player may look at the double-down card and replace it if desired. The power chip was added as of season three.
There are two "knockout cards" in the shoe. Once a knockout card is drawn, the player with the lowest amount of chips after the next hand is eliminated. After the first knockout card, the minimum bet increases to $2,500, after the second, the bet increases to $5,000. The deck is shuffled after each knockout card. If there are only four players when the first is drawn and three when the second is drawn, no players are eliminated, but the minimum bet still increases. The knockout cards also appeared first in season three.
Players can split, double-down, and insure for less than their bet.
Players can double-down on anything.
Surrendering the hand is legal, which allows players to give up half their bet and concede the hand.
If a player can't make the minimum bet, they are eliminated.
Blackjack pays 3 to 2, dealer must stand on all 17s and higher (including soft hands).
After 30 hands in Season 1, the player with the most chips wins.
After 25 hands in Season 2-4, the player with the most chips wins.
Season 1 results
The World Series of Blackjack Tournament was held at Mohegan Sun Casino & Resort in Connecticut. First place will win $10,000 and move on to the Final table while Second place will win $5,000 and move on to the Wild Card table
|
https://en.wikipedia.org/wiki/Weight-balanced%20tree
|
In computer science, weight-balanced binary trees (WBTs) are a type of self-balancing binary search trees that can be used to implement dynamic sets, dictionaries (maps) and sequences. These trees were introduced by Nievergelt and Reingold in the 1970s as trees of bounded balance, or BB[α] trees. Their more common name is due to Knuth.
A well known example is a Huffman coding of a corpus.
Like other self-balancing trees, WBTs store bookkeeping information pertaining to balance in their nodes and perform rotations to restore balance when it is disturbed by insertion or deletion operations. Specifically, each node stores the size of the subtree rooted at the node, and the sizes of left and right subtrees are kept within some factor of each other. Unlike the balance information in AVL trees (using information about the height of subtrees) and red–black trees (which store a fictional "color" bit), the bookkeeping information in a WBT is an actually useful property for applications: the number of elements in a tree is equal to the size of its root, and the size information is exactly the information needed to implement the operations of an order statistic tree, viz., getting the 'th largest element in a set or determining an element's index in sorted order.
Weight-balanced trees are popular in the functional programming community and are used to implement sets and maps in MIT Scheme, SLIB and implementations of Haskell.
Description
A weight-balanced tree is a binary search tree that stores the sizes of subtrees in the nodes. That is, a node has fields
key, of any ordered type
value (optional, only for mappings)
left, right, pointer to node
size, of type integer.
By definition, the size of a leaf (typically represented by a pointer) is zero. The size of an internal node is the sum of sizes of its two children, plus one: (). Based on the size, one defines the weight to be .
Operations that modify the tree must make sure that the weight of the left and right subtrees of every node remain within some factor of each other, using the same rebalancing operations used in AVL trees: rotations and double rotations. Formally, node balance is defined as follows:
A node is -weight-balanced if and .
Here, is a numerical parameter to be determined when implementing weight balanced trees. Larger values of produce "more balanced" trees, but not all values of are appropriate; Nievergelt and Reingold proved that
is a necessary condition for the balancing algorithm to work. Later work showed a lower bound of for , although it can be made arbitrarily small if a custom (and more complicated) rebalancing algorithm is used.
Applying balancing correctly guarantees a tree of elements will have height
The number of balancing operations required in a sequence of insertions and deletions is linear in , i.e., balancing takes a constant amount of overhead in an amortized sense.
While maintaining a tree with the minimum search cost requires four kinds of do
|
https://en.wikipedia.org/wiki/Netsh
|
In computing, netsh, or network shell, is a command-line utility included in Microsoft's Windows NT line of operating systems beginning with Windows 2000. It allows local or remote configuration of network devices such as the interface.
Overview
A common use of netsh is to reset the TCP/IP stack to default, known-good parameters, a task that in Windows 98 required reinstallation of the TCP/IP adapter.
netsh, among many other things, also allows the user to change the IP address on their machine.
Starting from Windows Vista, one can also edit wireless settings (for example, SSID) using netsh.
netsh can also be used to read information from the IPv6 stack.
The command netsh winsock reset can be used to reset TCP/IP problems when communicating with a networked device.
References
Further reading
External links
Using Netsh from Microsoft TechNet
Netsh Commands for Wireless Local Area Network (WLAN) in Windows Server 2008 R2 (includes Windows 7), from Microsoft TechNet. Topic not covered in "Using netsh".
online tool to build address bind commands
netsh commands supported by Windows Vista, 7 and Server 2008 (output of "netsh ?")
Windows Server 2008 R2 and Windows Server 2008 Netsh Technical Reference (chm)
Windows communication and services
Windows administration
Windows components
|
https://en.wikipedia.org/wiki/United%20front%20%28China%29
|
The united front is a political strategy of the Chinese Communist Party (CCP) involving networks of groups and key individuals that are influenced or controlled by the CCP and used to advance its interests. It has historically been a popular front that has included eight legally-permitted political parties and people's organizations which have nominal representation in the National People's Congress and the Chinese People's Political Consultative Conference (CPPCC). Under CCP general secretary Xi Jinping, the united front and its targets of influence have expanded in size and scope.
United front organizations are managed primarily by the United Front Work Department (UFWD), but the united front strategy is not limited solely to the UFWD. CPPCC is considered to be the highest-ranking united front organization, being central to the system. Outside of China, the strategy involves numerous front organizations, which tend to obfuscate or downplay any association with the CCP.
History
The CCP organized the "National Revolution United Front" () with the Kuomintang during the Northern Expedition of 1926–1928 and then the "Workers' and Peasants' Democratic United Front" () in the Chinese Soviet Republic era of 1931–1937. Mao Zedong originally promoted the "Anti-Japanese National United Front" ().
The united front "assumed its current form" in 1946, three years before the CCP defeated the authoritarian governing party Kuomintang's Nationalist government of Chiang Kai-shek. Mao credited the united front as one of his "Three Magic Weapons" against the Kuomintang—alongside the Leninist Chinese Communist Party and the Red Army—and credited the Front with playing a part in the Chinese Communist Revolution.
Organs
The two organs historically affiliated with united Front are the United Front Work Department and the Chinese People's Political Consultative Conference (CPPCC). According to Yi-Zheng Lian, the organs "are often poorly understood outside China because there are no equivalents for them in the West". Inside China, leaders of formal united front organizations are selected by the CCP, or are themselves CCP members. In practice, united front member parties and allied people's organizations are subservient to the CCP, and must accept the CCP's "leading role" as a condition of their continued existence.
United Front Work Department
The United Front Work Department is headed by the chief of the secretariat of the CCP's Central Committee. It oversees front organizations and their affiliates in multiple countries such as the Chinese Students and Scholars Association, which helps Chinese students and academics studying or residing in the West, enjoining them to conduct "people-to-people diplomacy" on behalf of the People's Republic of China.
Activities
The united front is a political strategy that the CCP has used to influence beyond its immediate circles while downplaying direct associations with the CCP. In theory, the united front existed to give fr
|
https://en.wikipedia.org/wiki/Sk%C3%A1ldatal
|
Skáldatal (Catalogue of Poets) is a short prose work in Old Norse. It is preserved in two manuscripts: DG 11, or Codex Uppsaliensis, which is one of the four main manuscripts of the Prose Edda (first quarter of the 14th century), and AM 761 a 4to (about 1700), which also contains Skaldic poems. It lists the court poets of Scandinavian rulers from legendary times up to the late 13th century with short notes on some.
The work generally agrees with extant knowledge on court poets from other sources. Though, in some cases, more poets are known for a certain ruler than are listed in Skáldatal. In other cases, poets listed there are otherwise unknown.
Steinvör Sighvatsdóttir is the only woman listed in Skáldatal.
See also
Skald
Skaldic poetry
External links
edition of Guðni Jónsson
Page at the Skaldic Project
Skaldic poetry
|
https://en.wikipedia.org/wiki/Second%20Generation%20Multiplex
|
Second Generation Multiplex is a DNA profiling system used in the United Kingdom to set up
the UK National DNA Database in 1995. It is manufactured by ABI (Applied Biosystems).
It contains primers for the following STR (Short Tandem Repeat) loci.
VWA (HUMVWF31/A), D8 (D8S1179), D21 (D21S11), D18 (D18S51), THO (HUMTHO1), FGA (HUMFIBRA)
Also contains primers for the Amelogenin sex indicating test.
The primers are tagged with the following fluorescent dyes for detection under electrophoresis.
5-FAM
JOE
NED
Its use in the United kingdom as the DNA profiling system used by The UK National DNA Database was superseded by the Second Generation Multiplex Plus SGM+ DNA profiling system in 1998
Biometrics
DNA profiling techniques
Genetics in the United Kingdom
Law enforcement in the United Kingdom
|
https://en.wikipedia.org/wiki/Protein%20Data%20Bank%20%28file%20format%29
|
The Protein Data Bank (PDB) file format is a textual file format describing the three-dimensional structures of molecules held in the Protein Data Bank, now succeeded by the mmCIF format. The PDB format accordingly provides for description and annotation of protein and nucleic acid structures including atomic coordinates, secondary structure assignments, as well as atomic connectivity. In addition experimental metadata are stored. The PDB format is the legacy file format for the Protein Data Bank which now keeps data on biological macromolecules in the newer mmCIF file format.
History
The PDB file format was invented in 1976 as a human-readable file that would allow researchers to exchange protein coordinates through a database system. Its fixed-column width format is limited to 80 columns, which was based on the width of the computer punch cards that were previously used to exchange the coordinates. Through the years the file format has undergone many changes and revisions. , the most recent revision is 3.30.
Example
A typical PDB file describing a protein consists of hundreds to thousands of lines like the following (taken from a file describing the structure of a synthetic collagen-like peptide):
HEADER EXTRACELLULAR MATRIX 22-JAN-98 1A3I
TITLE X-RAY CRYSTALLOGRAPHIC DETERMINATION OF A COLLAGEN-LIKE
TITLE 2 PEPTIDE WITH THE REPEATING SEQUENCE (PRO-PRO-GLY)
...
EXPDTA X-RAY DIFFRACTION
AUTHOR R.Z.KRAMER,L.VITAGLIANO,J.BELLA,R.BERISIO,L.MAZZARELLA,
AUTHOR 2 B.BRODSKY,A.ZAGARI,H.M.BERMAN
...
REMARK 350 BIOMOLECULE: 1
REMARK 350 APPLY THE FOLLOWING TO CHAINS: A, B, C
REMARK 350 BIOMT1 1 1.000000 0.000000 0.000000 0.00000
REMARK 350 BIOMT2 1 0.000000 1.000000 0.000000 0.00000
...
SEQRES 1 A 9 PRO PRO GLY PRO PRO GLY PRO PRO GLY
SEQRES 1 B 6 PRO PRO GLY PRO PRO GLY
SEQRES 1 C 6 PRO PRO GLY PRO PRO GLY
...
ATOM 1 N PRO A 1 8.316 21.206 21.530 1.00 17.44 N
ATOM 2 CA PRO A 1 7.608 20.729 20.336 1.00 17.44 C
ATOM 3 C PRO A 1 8.487 20.707 19.092 1.00 17.44 C
ATOM 4 O PRO A 1 9.466 21.457 19.005 1.00 17.44 O
ATOM 5 CB PRO A 1 6.460 21.723 20.211 1.00 22.26 C
...
HETATM 130 C ACY 401 3.682 22.541 11.236 1.00 21.19 C
HETATM 131 O ACY 401 2.807 23.097 10.553 1.00 21.19 O
HETATM 132 OXT ACY 401 4.306 23.101 12.291 1.00 21.19 O
...
HEADER, TITLE and AUTHOR records provide information about the researchers who defined the structure; numerous other types of records are available to provide other types of information.
REMARK records can contain free-form annotation, but they also accommodate standardized information; for example, the REMARK 350 BIOMT records describe how to compute the coordinates of the experimentally observed multimer from those of the explic
|
https://en.wikipedia.org/wiki/Australian%20Transport%20Network
|
Australian Transport Network (ATN) was a freight railway operator in Australia that commenced operating in November 1997. The company operated narrow gauge trains in Tasmania and standard gauge trains in New South Wales and Victoria. It was formed as a joint venture with Tranz Rail owning 67% and Wisconsin Central 33%. In February 2004, ATN was sold to Pacific National.
AN Tasrail
In August 1997, ATN was announced as the successful bidder for Australian National's Tasrail operation in Tasmania with the handover occurring on 1 November 1997. In 1998, Tasrail purchased the Emu Bay Railway from Pasminco.
The president of Wisconsin Central, Ed Burkhardt dispatched Mark Rosner to Australia to take control in Tasmania. Amongst Rosner's achievements was the implementing of a new condensed Operating Rule Book, which eliminated some more complex practices in favour of vastly simplified procedures. Single car roadside freight was resumed where customers required it (discontinued under Australian National) in line with US short line practice. On sections of the main trunk line north of Hobart, moving block train spacing (5,000 metres minimum) managed over train radio replaced fixed block train order working introduced under Australian National.
ATN inherited a fleet of Alco and English Electric locomotives from Australian National and Walkers diesel-hydraulics from Emu Bay Railway. In line with Wisconsin Central's preference for Electro-Motive Diesel products, 15 DQ class locomotives that had been rebuilt at Hutt Workshops from 1960s built Queensland Rail 1460 and 1502 class locomotives were transferred from Tranz Rail in 1998/99 along with DC4588. Two rebuilt Westrail D class locomotives were also forwarded from Tranz Rail in August 2001.
In conjunction with a new train radio system, in June 1998 the entire locomotive fleet was renumbered. At this stage 31 locomotives were operated.
ATN Access
On the mainland, ATN Access was formed to bid for freight work. In 1999 a contract was awarded by the Australian Wheat Board to haul 300,000 tonnes of grain per annum from the Riverina and Dimboola regions to Port Kembla and Appleton Dock with operations commencing in June 2000.
ATN Access purchased seven L class locomotives from Westrail in July 1999 (251, 253, 254, 265, 270, 271 and 276) with four being overhauled by National Railway Equipment Company, Whyalla. In June 2000, three 830 class (833, 838 and 845) locomotives were purchased from Australian Southern Railroad. These were often supplemented by locomotives hired from Chicago Freight Car Leasing Australia and Great Northern Rail Services. ATN Access also imported 44 new grain wagons from China. These were constructed at the Qiqihar Railway Workshops in Northern China.
References
Defunct railway companies of Australia
Rail transport in Tasmania
History of transport in Tasmania
Australian companies disestablished in 2004
Australian companies established in 1997
Railway companies disestablished in 200
|
https://en.wikipedia.org/wiki/Structure%20mining
|
Structure mining or structured data mining is the process of finding and extracting useful information from semi-structured data sets. Graph mining, sequential pattern mining and molecule mining are special cases of structured data mining.
Description
The growth of the use of semi-structured data has created new opportunities for data mining, which has traditionally been concerned with tabular data sets, reflecting the strong association between data mining and relational databases. Much of the world's interesting and mineable data does not easily fold into relational databases, though a generation of software engineers have been trained to believe this was the only way to handle data, and data mining algorithms have generally been developed only to cope with tabular data.
XML, being the most frequent way of representing semi-structured data, is able to represent both tabular data and arbitrary trees. Any particular representation of data to be exchanged between two applications in XML is normally described by a schema often written in XSD. Practical examples of such schemata, for instance NewsML, are normally very sophisticated, containing multiple optional subtrees, used for representing special case data. Frequently around 90% of a schema is concerned with the definition of these optional data items and sub-trees.
Messages and data, therefore, that are transmitted or encoded using XML and that conform to the same schema are liable to contain very different data depending on what is being transmitted.
Such data presents large problems for conventional data mining. Two messages that conform to the same schema may have little data in common. Building a training set from such data means that if one were to try to format it as tabular data for conventional data mining, large sections of the tables would or could be empty.
There is a tacit assumption made in the design of most data mining algorithms that the data presented will be complete. The other necessity is that the actual mining algorithms employed, whether supervised or unsupervised, must be able to handle sparse data. Namely, machine learning algorithms perform badly with incomplete data sets where only part of the information is supplied. For instance methods based on neural networks. or Ross Quinlan's ID3 algorithm. are highly accurate with good and representative samples of the problem, but perform badly with biased data. Most of times better model presentation with more careful and unbiased representation of input and output is enough. A particularly relevant area where finding the appropriate structure and model is the key issue is text mining.
XPath is the standard mechanism used to refer to nodes and data items within XML. It has similarities to standard techniques for navigating directory hierarchies used in operating systems user interfaces. To data and structure mine XML data of any form, at least two extensions are required to conventional data mining. These are the abilit
|
https://en.wikipedia.org/wiki/Molecule%20mining
|
This page describes mining for molecules. Since molecules may be represented by molecular graphs this is strongly related to graph mining and structured data mining. The main problem is how to represent molecules while discriminating the data instances. One way to do this is chemical similarity metrics, which has a long tradition in the field of cheminformatics.
Typical approaches to calculate chemical similarities use chemical fingerprints, but this loses the underlying information about the molecule topology. Mining the molecular graphs directly
avoids this problem. So does the inverse QSAR problem which is preferable for vectorial mappings.
Coding(Moleculei,Moleculeji)
Kernel methods
Marginalized graph kernel
Optimal assignment kernel
Pharmacophore kernel
C++ (and R) implementation combining
the marginalized graph kernel between labeled graphs
extensions of the marginalized kernel
Tanimoto kernels
graph kernels based on tree patterns
kernels based on pharmacophores for 3D structure of molecules
Maximum Common Graph methods
MCS-HSCS (Highest Scoring Common Substructure (HSCS) ranking strategy for single MCS)
Small Molecule Subgraph Detector (SMSD)- is a Java-based software library for calculating Maximum Common Subgraph (MCS) between small molecules. This will help us to find similarity/distance between two molecules. MCS is also used for screening drug like compounds by hitting molecules, which share common subgraph (substructure).
Coding(Moleculei)
Molecular query methods
Warmr
AGM
PolyFARM
FSG
MolFea
MoFa/MoSS
Gaston
LAZAR
ParMol (contains MoFa, FFSM, gSpan, and Gaston)
optimized gSpan
SMIREP
DMax
SAm/AIm/RHC
AFGen
gRed
G-Hash
Methods based on special architectures of neural networks
BPZ
ChemNet
CCS
MolNet
Graph machines
See also
Molecular Query Language
Chemical graph theory
Chemical space
QSAR
ADME
partition coefficient
References
Further reading
Schölkopf, B., K. Tsuda and J. P. Vert: Kernel Methods in Computational Biology, MIT Press, Cambridge, MA, 2004.
R.O. Duda, P.E. Hart, D.G. Stork, Pattern Classification, John Wiley & Sons, 2001.
Gusfield, D., Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, 1997.
R. Todeschini, V. Consonni, Handbook of Molecular Descriptors, Wiley-VCH, 2000.
External links
Small Molecule Subgraph Detector (SMSD) - is a Java-based software library for calculating Maximum Common Subgraph (MCS) between small molecules.
5th International Workshop on Mining and Learning with Graphs, 2007
Overview for 2006
Molecule mining (basic chemical expert systems)
ParMol and master thesis documentation - Java - Open source - Distributed mining - Benchmark algorithm library
TU München - Kramer group
Molecule mining (advanced chemical expert systems)
DMax Chemistry Assistant - commercial software
AFGen - Software for generating fragment-based descriptors
Cheminformatics
Computational chemistry
Data
|
https://en.wikipedia.org/wiki/ITV%20Day
|
ITV Day was a programming block that broadcast on ITV1 from 9.25 am until 6.00 pm on weekdays and launched on 11 April 2005. The presentation was created by Bruce Dunlop Associates and said "ITV Day effectively creates a new brand, a change in programming and schedule will alter viewer perception".
The "ITV Day" brand disappeared from screens on 13 January 2006, as ITV1 presentation was relaunched, along with the entire ITV family of channels.
Branding
The package was based around a logo and colour scheme that delineated the ITV Day branding from the rest of ITV1. The scheme of yellow, orange and red represented the colour of and warmth of the sun. The ITV logo remained blue as a link to the rest of the ITV family of logos (except ITV2's which was yellow at the time).
The package was produced using an innovative combination of live action and animation. The people featured in the idents were shot in the blue screen studio, while the backgrounds and some foreground elements were created in 3D.
Versions
UTV also used the same presentation during the day, albeit replacing the "ITV" logo with their own.
Scottish TV and Grampian TV (both owned by SMG plc) decided not to use the presentation package - and continued to use their normal idents and promotions during the day.
ITV1 Wales used the ITV Day logo but with “Wales” superimposed to the bottom.
Programmes
A Brush with Fame
Baby House
Boot Sale Treasure Hunt
Cash Cab
Chef Vs Britain
Date My Daughter
Dial a Mum
Everything Must Go
Have I Been Here Before?
ITV Lunchtime News
The Jeremy Kyle Show
Kojak
Loose Women
Mum's on Strike
Nanny 911
Nigella
Now or Never
The Paul O'Grady Show
The People's Court
Perseverance
Richard Hammond's 5 O'Clock Show
Solution Street
The Springer Show
This Morning
Today with Des and Mel
Too Many Cooks
Trading Treasures
Trisha
Watching the Detectives
ITV (TV network)
|
https://en.wikipedia.org/wiki/N%C3%A1rodn%C3%AD%20t%C5%99%C3%ADda%20%28Prague%20Metro%29
|
Národní třída ("Avenue of the Nation", ) is a Prague Metro station on Line B. The station has two exits, one to Spálená street where it connects to the tram network and other to M. D. Rettigové street, using a pair of lifts. The station was opened on 2 November 1985, as part of the inaugural section of Line B between Sokolovská and Smíchovské nádraží.
The station was closed between July 2012 and June 2014 due to construction of a new shopping and business centre called Quadrio. Trains only passed through the station without stopping.
Characteristics
Národní třída is a pylon type metro station with three supports.
References
See also
Národní třída
Prague Metro stations
Railway stations opened in 1985
1985 establishments in Czechoslovakia
Railway stations in the Czech Republic opened in the 20th century
|
https://en.wikipedia.org/wiki/Mac%20Hack
|
Mac Hack is a computer chess program written by Richard D. Greenblatt. Also known as Mac Hac and The Greenblatt Chess Program, it was developed at the Massachusetts Institute of Technology. Mac Hack VI was the first chess program to play in human tournament conditions, the first to be granted a chess rating, and the first to win against a person in tournament play. A pseudocode for the program is given in Figure 11.16 of .
Its name comes from Project MAC ("Multi-Level Access Computer" or "Machine-Aided Cognition") a large sponsored research program located at MIT. The number VI refers to the PDP-6 machine for which it was written.
Development
Greenblatt was inspired to write Mac Hack upon reading MIT Artificial Intelligence Memo 41, or a similar document describing Kotok-McCarthy, which he saw while visiting Stanford University in 1965. A good chess player, he was inspired to make improvements at MIT in 1965 and 1966.
In about 2004, he had an opportunity to tell Alan Kotok that searching the 7 best moves at each of the first two plies, and limiting the search depth to two would have done better than the default widths of "4 3 2 2 1 1 1 1", attempting eight plies in Kotok-McCarthy's REPLYS subroutine which generated each player's next plausible moves.
Greenblatt added fifty heuristics that reflected his knowledge of chess. Mac Hack was written in MIDAS macro assembly language on the PDP-6 computer DEC donated to MIT (the first working PDP-6, serial number 2). Many versions may exist. During this period the program was compiled about two hundred times.
Tournament play
By the time it was published in 1969 Mac Hack had played in eighteen tournaments and hundreds of complete games. The PDP-6 became an honorary member of the Massachusetts State Chess Association and the United States Chess Federation, a requirement for playing tournaments. In 1966 the program was rated 1243 when it lost in the Massachusetts Amateur Championship. In 1967, the program played in four tournaments, winning three games, losing twelve, and drawing three. In 1967 Mac Hack VI defeated Ben Landy with a USCF rating of 1510 in game 3, tournament 2 of the Massachusetts State Championship.
Greenblatt published the program with Donald E. Eastlake III and Stephen D. Crocker in MIT Artificial Intelligence Memo 174 and recorded some games there.
Influence
Mac Hack played by teletype, was ported to the PDP-10 and was the first computer chess program to be widely distributed. Mac Hack was the first chess computer to use a transposition table, which is a vital optimization in game tree search. Greenblatt and Tom Knight went on to advance artificial intelligence and build the Lisp machine in 1973.
References
Notes
Photo: Richard Greenblatt and Thomas Knight with the CADR LISP Machine at MIT,
Chess software
History of chess
|
https://en.wikipedia.org/wiki/KM3
|
KM3 or Kernel Meta Meta Model is a neutral computer language to write metamodels and to define Domain Specific Languages. KM3 has been defined at INRIA and is available under the Eclipse platform.
References
KM3: a DSL for Metamodel Specification Jouault, F, and Bézivin, J (2006). In: Proceedings of 8th IFIP International Conference on Formal Methods for Open Object-Based Distributed Systems, LNCS 4037, Bologna, Italy, pages 171-185.
ADT Download
Eclipse GMT site
softwarefactories.com article
Softmetaware.com article
uio.no article
softmetaware.com article
trese.cs.utwente.nl présentation
bis.uni-leipzig.de présentation
Related Concepts
Model-driven architecture (MDA is an OMG Trademark),
Model Driven Engineering (MDE is not an OMG Trademark)
Domain Specific Language (DSL)
Domain-specific modelling (DSM)
Model-based testing (MBT)
Meta-modeling
ATL
XMI
OCL
MTL
MOF
Object-oriented analysis and design (OOAD)
Kermeta
External links
KM3 @ Eclipse.
Specification languages
|
https://en.wikipedia.org/wiki/List%20of%20major%20roads%20in%20rural%20Western%20Australia
|
Major roads in rural Western Australia connect regional and remote centres of Western Australia, forming the basis of the road network outside of Metropolitan Perth. Main Roads Western Australia controls and maintains these roads and highways.
Some of these roads, or portions of them, are designated and signposted as part of a road route, as they are of national or regional importance. Additionally, roads through areas of scenic or historic significance are designated as part of a Tourist Drive. Each route has a unique marker: National Highways have gold numbers on a green shield, National Routes have black numbers on a white shield, State Routes have white numbers on a blue shield, Tourist Drives have white numbers on a brown shield.
See also
List of major roads in Perth, Western Australia
List of highways in Western Australia
List of road routes in Western Australia
Major roads in the Gascoyne region of Western Australia
Major roads in the Kimberley region of Western Australia
Major roads in the Mid West region of Western Australia
Major roads in the Pilbara region of Western Australia
Major roads in the Wheatbelt region of Western Australia
References
Lists of roads in Western Australia
|
https://en.wikipedia.org/wiki/Comparison%20of%20geographic%20information%20systems%20software
|
This is a comparison of notable GIS software. To be included on this list, the software must have a linked existing article.
License, source, & operating system support
Pure server
Map servers
Map caches
Pure web client
Libraries
See also
Open Source Geospatial Foundation (OSGeo)
Geographic information system software
GIS Live DVD
References
GIS software
GIS
|
https://en.wikipedia.org/wiki/Moral%20graph
|
In graph theory, a moral graph is used to find the equivalent undirected form of a directed acyclic graph. It is a key step of the junction tree algorithm, used in belief propagation on graphical models.
The moralized counterpart of a directed acyclic graph is formed by adding edges between all pairs of non-adjacent nodes that have a common child, and then making all edges in the graph undirected. Equivalently, a moral graph of a directed acyclic graph is an undirected graph in which each node of the original is now connected to its Markov blanket. The name stems from the fact that, in a moral graph, two nodes that have a common child are required to be married by sharing an edge.
Moralization may also be applied to mixed graphs, called in this context "chain graphs". In a chain graph, a connected component of the undirected subgraph is called a chain. Moralization adds an undirected edge between any two vertices that both have outgoing edges to the same chain, and then forgets the orientation of the directed edges of the graph.
Weakly recursively simplicial
A graph is weakly recursively simplicial if it has a simplicial vertex and the subgraph after removing a simplicial vertex and some edges (possibly none) between its neighbours is weakly recursively simplicial. A graph is moral if and only if it is weakly recursively simplicial.
A chordal graph (a.k.a., recursive simplicial) is a special case of weakly recursively simplicial when no edge is removed during the elimination process. Therefore, a chordal graph is also moral. But a moral graph is not necessarily chordal.
Recognising moral graphs
Unlike chordal graphs that can be recognised in polynomial time, proved that deciding whether or not a graph is moral is NP-complete.
See also
D-separation
Tree decomposition
References
.
External links
M. Studeny: On mathematical description of probabilistic conditional independence structures
Bayesian networks
Graphical models
Graph operations
|
https://en.wikipedia.org/wiki/Junction%20tree%20algorithm
|
The junction tree algorithm (also known as 'Clique Tree') is a method used in machine learning to extract marginalization in general graphs. In essence, it entails performing belief propagation on a modified graph called a junction tree. The graph is called a tree because it branches into different sections of data; nodes of variables are the branches. The basic premise is to eliminate cycles by clustering them into single nodes. Multiple extensive classes of queries can be compiled at the same time into larger structures of data. There are different algorithms to meet specific needs and for what needs to be calculated. Inference algorithms gather new developments in the data and calculate it based on the new information provided.
Junction tree algorithm
Hugin algorithm
If the graph is directed then moralize it to make it un-directed.
Introduce the evidence.
Triangulate the graph to make it chordal.
Construct a junction tree from the triangulated graph (we will call the vertices of the junction tree "supernodes").
Propagate the probabilities along the junction tree (via belief propagation)
Note that this last step is inefficient for graphs of large treewidth. Computing the messages to pass between supernodes involves doing exact marginalization over the variables in both supernodes. Performing this algorithm for a graph with treewidth k will thus have at least one computation which takes time exponential in k. It is a message passing algorithm. The Hugin algorithm takes fewer computations to find a solution compared to Shafer-Shenoy.
Shafer-Shenoy algorithm
Computed recursively
Multiple recursions of the Shafer-Shenoy algorithm results in Hugin algorithm
Found by the message passing equation
Separator potentials are not stored
The Shafer-Shenoy algorithm is the sum product of a junction tree. It is used because it runs programs and queries more efficiently than the Hugin algorithm. The algorithm makes calculations for conditionals for belief functions possible. Joint distributions are needed to make local computations happen.
Underlying theory
The first step concerns only Bayesian networks, and is a procedure to turn a directed graph into an undirected one. We do this because it allows for the universal applicability of the algorithm, regardless of direction.
The second step is setting variables to their observed value. This is usually needed when we want to calculate conditional probabilities, so we fix the value of the random variables we condition on. Those variables are also said to be clamped to their particular value.
The third step is to ensure that graphs are made chordal if they aren't already chordal. This is the first essential step of the algorithm. It makes use of the following theorem:
Theorem: For an undirected graph, G, the following properties are equivalent:
Graph G is triangulated.
The clique graph of G has a junction tree.
There is an elimination ordering for G that does not lead to any added edges.
Thus
|
https://en.wikipedia.org/wiki/KidZone
|
KidZone is a Canadian TV show for adolescents that aired on the Knowledge Network in British Columbia from 1992 to 2001. The show is also notable for providing a start for several young stars, including Sarah Chalke, Devon Sawa, Erica Cerra, and Jai West.
Format
KidZone initially began as a series of informative skits and interviews. Following the education mandate of the broadcaster, the show managed to present anti-smoking, safety and environmental issues with funding from provincial government agencies and private companies. The entire cast of the show were children, who acted in various sketches and portrayed journalists. At the age of 12, Chalke was the program's environmental reporter.
One of the recurring sketches on KidZone was Kerrisdale V6M 1Z6, which used a style similar to Beverly Hills, 90210 and Degrassi Junior High to present youth issues. Eventually, KidZone shifted away from its journalistic style and became a docudrama about high school based on the Kerrisdale sketch. This version of the show also aired in the United States as Kerrisdale High.
KidZone Live
At the end of its broadcast run in 2001, KidZone was rebranded as KidZone Live. Much like Degrassi Talks, the show featured KidZone actors participating in sketches and call-in discussions on topics oriented toward young viewers. Among the issues covered on KidZone Live were injury prevention, road safety and eliminating racial discrimination.
External links
1992 Canadian television series debuts
2001 Canadian television series endings
1990s Canadian children's television series
2000s Canadian children's television series
Television series about teenagers
Television shows filmed in Vancouver
Canadian children's education television series
|
https://en.wikipedia.org/wiki/Stephen%20L.%20Nelson
|
Stephen L. Nelson (born 1959) is the author of more than 160 books about using personal computers, including Quicken for Dummies, QuickBooks for Dummies, MBA's Guide to Microsoft Excel, and Excel Data Analysis for Dummies. The Wall Street Journal once called him the Louis L'Amour of computer books because at the time (December 2000), he had written more computer books than any other author.
Nelson has an undergraduate degree in accounting from Central Washington University, an MBA in finance from the University of Washington, and an MS in taxation from Golden Gate University.
A Seattle CPA, Nelson often writes about the small business and personal finance applications of computers. As an adjunct tax professor at Golden Gate University's graduate tax school, he also occasionally teaches their course, "Choice of Entity: S Corporations vs. Limited Liability Companies."
He also maintains a small business accounting web site including free pdf versions of half a dozen of his books, and two websites with do-it-yourself setup kits for forming limited liability companies and S corporations in the United States.
References
"A Little Publisher That Could Remains on Track --- For Nelson's Redmond Technology, Full Throttle on Software Manuals", by Jeffrey A. Tannenbaum, The Wall Street Journal, December 5, 2000
External links
Stephen L. Nelson's official web page
Stephen L. Nelson's LLC formation explained web page
Stephen L. Nelson's S corporations explained web page
1959 births
American finance and investment writers
American technology writers
Living people
Writers from Seattle
|
https://en.wikipedia.org/wiki/List%20of%20Univision%20affiliates%20%28table%29
|
Univision is an American broadcast television television network owned by Univision Communications, which was launched on September 30, 1962 as the Spanish International Network (SIN). , the network currently has 23 owned-and-operated stations, and current affiliation agreements with 38 other television stations. Univision maintains a national cable network feed that is distributed directly to cable, satellite and IPTV providers in various media markets not listed in this article, as an alternative method of distribution in areas without either the availability or the demand for a locally based owned-and-operated or affiliate station.
This article is a listing of current, pending and former Univision-affiliated stations in the continental United States and U.S. possessions (including subchannel affiliates, satellite stations and select low-power translators), with outlets owned by network parent company Univision Communications separated from privately owned affiliates, and arranged in alphabetical order by city of license and/or Designated Market Area. There are links to and articles on each of the broadcast stations, describing their histories, local programming and technical information, such as broadcast frequencies.
The station's virtual (PSIP) channel number follows the call letters. For the table for the owned-and-operated outlets, the number in parentheses that follows is the station's actual digital channel number; the digital channel number is listed as a separate column in the list of private affiliates. The article also includes a list of its former affiliate stations, which is also based on the station's city of license or market, and denotes the years in which the station served as a Univision affiliate as well as the current status of the corresponding channel that carried the network.
Owned-and-operated stations
(**) – Indicates a station that was an original Univision-owned station from the network's inception as the Spanish International Network in 1962.
(++) – Indicates a station built and signed on by Univision.
Stations are listed alphabetically by state and city of license.
Univision-affiliated stations
Former affiliates
References
Univision
|
https://en.wikipedia.org/wiki/Affective%20design
|
Affective design describes the design of user interfaces in which emotional information is communicated to the computer from the user in a natural and comfortable way. The computer processes the emotional information and adapts or responds to try to improve the interaction in some way. The notion of affective design emerged from the field of human–computer interaction (HCI), specifically from the developing area of affective computing. Affective design serves an important role in user experience (UX) as it contributes to the improvement of the user's personal condition in relation to the computing system. The goals of affective design focus on providing users with an optimal, proactive experience. Amongst overlap with several fields, applications of affective design include ambient intelligence, human–robot interaction, and video games.
Background
Emotions are an integral part of the human experience, and thus, play a role in how users and consumers interact with interfaces and products. Donald Norman, an academic in the field of human-centered design, explored the importance of emotion in design, coining the concept of user-centered design in the 1980s. He discussed design heuristics and advocated for providing users with a pleasurable experience through the application of emotional design. Similarly, Bødker, Christensen, and Jørgensen presented a definition of affective design that emphasizes the importance of considering current social and cultural influences when relating to human emotions.
Along with the growth of human-computer interaction, the past few decades have seen an increase in the discussion of emotions in relation to design. Research in recent years has looked at what affects our emotions as well as how emotions affect our mental and physical states. Additionally, designers and researchers have explored how to elicit and map people’s emotions, ranging from positive to negative. Affective design encompasses more than the functionality of a product as it emphasizes user experience and is concerned with the dynamics of how humans interact with the world.
Affective design includes utilizing users’ emotions as data to guide technologies’ responses in addition to designing with predetermined elements intended to influence users’ emotions. The growth in the number and diversity of users carries with it the challenge to tailor interfaces and products to each individual. Affective design offers the potential to provide a unique, adaptive response to each user’s emotion. It has emerged as an intersection of functionality and pleasure, illustrating the significant influence of emotional components in technology and user experiences.
Aims
Affective computing aims to construct affective interfaces which are capable of providing certain emotional experiences for users. Affective design attempts to understand the emotional relationships between users and products as well as how products communicate affectively through their physical feat
|
https://en.wikipedia.org/wiki/C4%20Engine
|
The C4 Engine is a proprietary computer game engine developed by Terathon Software that is used to create 3D games and other types of interactive virtual simulations for PlayStation 5, PlayStation 4, PlayStation 3, Windows (XP and later), Mac OS X (versions 10.9 and later), Linux, and iOS.
Development history
Development of the C4 Engine is led by computer graphics author Eric Lengyel, who is also the founder of Terathon Software. Although in development sporadically for several years beforehand, the engine was first made available under a commercial license in May, 2005. Due to changing market conditions, the C4 Engine was retired in 2015, but an announcement has been made that it is returning in 2021.
C4 Engine version 7.0 is released on 22nd of March 2023.
Capabilities and features
The architecture of the C4 Engine is that of a layered collection of software components, in which the lowest layers interact with the computer hardware and operating system, and the higher layers provide platform-independent services to the game code. While a considerable portion of the engine is dedicated to 3D graphics, there are also large components dedicated to functionality pertaining to audio, networking, physics, input devices, and scripting. Documentation for the engine is available online through a set of API web pages and a wiki.
Graphics
The C4 Engine is based on the OpenGL library on Windows, Mac, Linux, and iOS platforms, and it uses a one-pass-per-light forward rendering model. The engine is capable of rendering with several different types of light sources and shadowing methods. The primary method for rendering dynamic shadows is shadow mapping, and a variant of cascaded shadow mapping is used for very large outdoor scenes.
Shaders are created in C4 using one of two available methods, both of which isolate the user from the shader code required by the underlying graphics library. Simple shaders can be created by specifying a set of material attributes such as a diffuse reflection color, a specular reflection color, and a group of texture maps. The engine internally generates the necessary shader code for each combination of material and light type that it encounters when rendering a scene. Material attributes can be used to produce effects such as normal mapping, parallax mapping, horizon mapping, and bumpy reflections or refractions.
C4 also includes a graphical Shader Editor that allows complex custom materials to be created using a large set of predefined operations. This method of designing materials enables greater creative freedom and functionality for expert users, but requires somewhat more work by the user. Materials created using the standard material attributes can be converted to custom shaders to serve as a starting point in the Shader Editor.
The terrain capabilities of the C4 Engine are based on a voxel technology, allowing full 3D sculpting to produce features such as overhangs, arches, and truly vertical cliffs that woul
|
https://en.wikipedia.org/wiki/The%20Shak
|
The Shak was an Australian children's television program broadcast on the Nine Network. Its four hosts, Curio (Drew Jarvis), Nitro (Beau Walker), Picasso (Kendal Nagorcka) and Eco (Jacqueline Duncan) answered viewer questions, queries, dares and challenges in an entertaining and educational manner. Each host's name relates to their personality and the type of stories they present. Viewers sent questions and suggestions to the presenters via the shows website.
Production
The series was filmed, for the main part, at a studio resembling a large shed or shack, hence the name "Shak", it decorated with all manner of objects. The characters arrived via a prop of a wave, and exited through a door on the other side of the shack. They were known as 'Shaksters', as were the viewers. Other filming was done at various attractions and locations on the Gold Coast where the Shak was set, with Dreamworld being a regular filming spot.
In 2006, the filming was done at Sea World but in early 2007, filming was moved to the WhiteWater World theme park. This was explained via an explosion made by Curio, which resulted in the Shaksters moving. and the opening titles were fully animated however in 2007 it was changed to a mix of live action and animation.
Ending
The show ended in mid-2008 so it could make way for the Sequel The Shak at Home which had Curio, Nitro and Picasso living in a share house. Picasso later left the show and was later replaced by a new character named Willow. The sequel ended on 13 January 2010
Series summaries
Series 1 - Series 1 first aired in 2006 at 4:00pm weekdays, It replaced Hot Source. The opening was entirely cartoon animated and had the whole original cast which included Eco, Curio, Nitro And Picasso. The show was not very popular, but soon gained a steady audience.
Series 2 - Series 2 aired in early 2007. This series had a lot more comedy and entertaining segments with Drew Jarvis showing his talent with his alter egos. This series had an audience boost and was better received by audiences.
Series 3 - Series 3 aired in late 2007. This added the character "Geordie" as Nitros best friend.
Series 4 - Series 4 aired in January–March 2008.
Series 5 - Series 5 was shown in 2008 with a number of guests, Such as Bert Newton as Curio's Grandfather and a number of athletes, dancers and people associated with the themes. All of the cast returned for this series.
Series 6 - Series 6 was shown in November–December 2008.
Series 7 - Series 7 was shown in early 2009 and was the last series of the original format. It was called the best series by audiences. It was the highest rating series at that time. This was Eco's last season.
'Series 8 and beyond - This season changed format into half hour scripted acting where Picasso, Nitro and Curio shared a house together, and the storylines revolved around this. It was a half hour multi cam format.
International airings
Canada
TVOntario
Papua New Guinea
EM TV
References
External links
T
|
https://en.wikipedia.org/wiki/Harold%20Koplow
|
Harold Koplow (November 21, 1940 – November 4, 2004), an American computer scientist and one of the early developers of office automation equipment, was raised in Lynn, Massachusetts. When his father developed health problems, Koplow became a pharmacy technician at his father's store, Broadway Pharmacy. After graduating from Swampscott High School, he was accepted at both MIT and the Massachusetts College of Pharmacy and Health Sciences, and opted for the latter because he hadn't received a scholarship at MIT.
He married in 1962 after graduating from pharmacy school. He then enrolled at Tufts University for a graduate degree in Physics. He briefly worked as a school teacher before joining Wang Laboratories, where he programmed calculators. One of his programs permitted a Wang calculator to interface with an IBM Selectric typewriter, which could be used to calculate and print the paperwork for auto sales.
Koplow's interface program was developed, in 1974, into the Wang 1200 Word Processor, an IBM Selectric-based text-storage device. The operator of this machine typed text on a conventional IBM typewriter; when the Return key was pressed, the line of text was stored on a cassette tape. One cassette held roughly 20 pages of text, and could be "played back" (e.g., the text retrieved) by printing the contents on continuous-form paper in the 1200 typewriter's "print" mode. The stored text could also be edited, using keys on a simple, six-key array. Basic editing functions included Insert, Delete, Skip (character, line), and so on.
The labor and cost savings of this device were immediate, and remarkable: pages of text no longer had to be retyped to correct simple errors, and projects could be worked on, stored, and then retrieved for use later on. The rudimentary Wang 1200 machine was the precursor of the Wang Office Information System (OIS), which revolutionized the way typing projects were performed in the American workplace.
When Wang acquired Philip Hankins, Inc. (PHI), Koplow met Dave Moros, with whom he would later collaborate to create the Wang Word Processing System. This and other office automation products that were created in Koplow's department were among the most successful products in Wang's history.
Koplow left Wang in 1982 because of conflicts with Fred Wang. He lived briefly in California before moving to Gainesville, Florida where he lived until he died in 2004.
1940 births
2004 deaths
American computer businesspeople
People from Gainesville, Florida
People from Lynn, Massachusetts
Massachusetts College of Pharmacy and Health Sciences alumni
|
https://en.wikipedia.org/wiki/Road%20Tasted
|
Road Tasted is a television program shown on Food Network in the USA. The show was originally hosted by Jamie Deen and Bobby Deen, the sons of the popular Food Network host Paula Deen, as they drove around the United States searching for the best in family-run food businesses. It premiered on July 11, 2006.
Road Tasted was created by Gordon Elliott, a long-time friend of Paula Deen.
One of the show's primary appeals is that the businesses featured on the show can ship many of their products directly to customers. As such, the program always includes information about how to order the items shown.
Before Food Network settled on "Road Tasted", the show had the working title Two for the Road.
The Deen brothers eventually decided that they wanted to devote more time to their family restaurant, and thus did not continue as hosts. The show has since been renamed Road Tasted with the Neelys featuring the Food Network hosts Pat and Gina Neely.
References
External links
Road Tasted at FoodNetwork.com
Food Network original programming
Food travelogue television series
2006 American television series debuts
2008 American television series endings
|
https://en.wikipedia.org/wiki/Macintosh%20Quadra%20630
|
The Macintosh Quadra 630 (also sold as the Macintosh LC 630 and Macintosh Performa 630) is a personal computer designed, manufactured and sold by Apple Computer from July 1994 to October 1995. It was introduced as the replacement for the Quadra 610, and was the least-expensive computer in the Macintosh lineup with prices starting at $1,199 USD.
While Apple's transition to PowerPC CPUs had already begun with the introduction of the Power Macintosh a few months prior, the 630 was built around the older Motorola 68040 and 68LC040 chips. Two reasons were cited for this: One, the older chips were less expensive; and two, PowerPC-native education software was almost non-existent at the time. Also, existing PowerPC software had yet to be translated to non-English languages.
The 630 was the last new Macintosh Quadra introduced, though the earlier Quadra 950 remained available longer. It was discontinued with no direct replacement; the 630's form factor was retained with the Power Macintosh 6200 introduced a few months earlier, but with an entry price of $2,300 it cost nearly twice as much. The Power Macintosh 4400 was Apple's most inexpensive Power Macintosh, but at $1,725 still cost several hundred dollars more than the 630.
Hardware
Form factor: The Quadra 630 introduced a new case design to the Macintosh family. On the front, a headphone jack and volume up/down buttons are included, a first for the Macintosh. There is an infrared receiver, intended for use with the remote included with the TV tuner card included with the Performa 637CD and 638CD models. The case's motherboard is accessible by opening a cover at the bottom rear of the case and sliding out a drawer that the motherboard was mounted on; this similar to the LC 575.
Memory: All 630 models have 4 MB of memory soldered on the logic board. Depending on which logic board is in the system, there is either one or two SIMM slots. In all cases, the first SIMM slot requires 80 ns non-parity chips, with a refresh rate of 2k or better, and 4, 8, 16 or 32 MB SIMMs will work. The second slot supports single-sided SIMM cards only, up to 16 MB in size. Maximum memory is therefore 52 MB for two-slot systems, and 36 MB for one-slot systems.
Hard drive controller: One of the big differences, when compared to some of the previous Macintosh models was the choice of the internal hard drive interface; conforming to the standards of the IBM PC compatible platform, cheaper but slower IDE drives were used instead of SCSI for the first time. An external SCSI port was still available, and the CD-ROM used SCSI internally, but the 630 used an older controller that was much slower than the ones used in higher-end Macs of the time.
Video: One external monitor is supported through a DA-15 connector. A non-upgradeable 1 MB of DRAM is soldered to the motherboard; this provides resolution of up to 640×480 with 16-bit color, and 832×624 with 8-bit color. A separate video card is required for 24-bit color or higher res
|
https://en.wikipedia.org/wiki/Delta%20Force%3A%20Urban%20Warfare
|
Delta Force: Urban Warfare is a first-person shooter by developer and publisher NovaLogic. It was re-released in 2010 on PlayStation Network for PlayStation 3 and PSP.
Gameplay
It was designed to be a military simulation loosely based on the Delta Force special operations force. The storyline spans twelve missions, including a bank robbery, hostage rescue, and an assault on an offshore oil rig.
The game features a greater emphasis on story than previous Delta Force games, as it features fully animated and voice-acted cutscenes in between missions. Its missions are also less vast and open than other titles in the franchise, focusing instead on a more scripted and linear play style, in tight urban environments.
Reception
The game received "average" reviews according to video game review aggregator Metacritic.
References
External links
2002 video games
Delta Force (video game series)
First-person shooters
PlayStation (console) games
PlayStation Network games
Rebellion Developments games
Tactical shooter video games
Video games about Delta Force
Video games developed in the United Kingdom
Video games set in Colombia
Video games set in Germany
Video games set in Mexico
Video games set in Switzerland
Video games set in the United Kingdom
Video games set in Vancouver
Video games set in Venezuela
Video games with voxel graphics
NovaLogic games
|
https://en.wikipedia.org/wiki/ALCOR
|
ALCOR (ALGOL Converter, acronym) is an early computer language definition created by the ALCOR Group, a consortium of universities, research institutions and manufacturers in Europe and the United States which was founded in 1959 and which had 60 members in 1966. The group had the aim of a common compiler specification for a subset of ALGOL 60 after the ALGOL meeting in Copenhagen in 1958.
In addition to its programming application, as the name Algol is also an astronomical reference, to the star Algol, so too, Alcor is a reference to the star Alcor. This star is the fainter companion of the 2nd magnitude star Zeta Ursae Majoris. This was sometimes ironized as being a bad omen for the future of the language.
In Europe, a high level machine architecture for ALGOL 60 was devised which was emulated on various real computers, among them the Siemens 2002 and the IBM 7090. An ALGOL manual was published which provided a detailed introduction of all features of the language with many program snippets, and four appendixes:
Revised Report on the Algorithmic Language ALGOL 60
Report on Subset ALGOL 60 (IFIP)
Report on Input-Output Procedures for ALGOL 60
An early "standard" character set for representing ALGOL 60 code on paper and paper tape. This character set introduced the characters "×", ";", "[", "]", and "⏨" into the CCITT-2 code, the first two replacing "?" and the BEL control character, the others taking unused code points.
References
Baumann, R. (1961) Baumann, R. "ALGOL Manual of the ALCOR Group, Pts. 1, 2 & 3" Elektronische Rechenanlagen No. 5 (Oct. 1961), 206–212; No. 6 (Dec. 1961), 259–265; No. 2 (Apr. 1962); (in German)
Papertape, punched card, magnetic tape coding schemes Computer Museum, University of Amsterdam, the Netherlands
External links
ALCOR in The Encyclopedia of Computer Languages
The ALCOR Project, Klaus Samelson, Friedrich L. Bauer, 1962.
Algol programming language family
Systems programming languages
Procedural programming languages
Character encoding
Character sets
Programming languages created in the 1960s
|
https://en.wikipedia.org/wiki/Herbert%20Br%C3%BCn
|
Herbert Brün (July 9, 1918 – November 6, 2000) was a composer, pioneer of electronic and computer music, and cybernetician. Born in Berlin, Germany, he taught at the University of Illinois at Urbana-Champaign from 1962 until he retired, several years before his death.
Career
Brün left Germany in 1936 to study piano and composition at the Jerusalem Conservatory (later renamed Israel Academy of Music) in (then) Palestine with Stefan Wolpe, Eli Friedman and Frank Pelleg. While in Palestine, he also worked as a jazz pianist. In 1948, he received a scholarship to further his studies at Tanglewood and Columbia University through 1950.
His work as an electronic-music composer began in Paris in the late 1950s, at the WDR studio in Cologne, and at the Siemens studio in Munich. During the 1950s, he also worked as composer and conductor of music for the theater, gave lectures and seminars emphasizing the function of music in society, and did a series of broadcasts on contemporary music.
After a lecture tour of the United States in 1962, he was invited by Lejaren Hiller to join the University of Illinois Center for Advanced Computation for 1963-64, at the conclusion of which he was asked to stay on as a member of the faculty. In Illinois, Brün began research on composition with computers, which resulted in pieces for tape and instruments, tape alone, and graphics. His compositions from this period include Futility 1964 (1964) and Non Sequitur VI (1966). Non Sequitur VI was generated using the MUSICOMP programming language developed by Hiller and Robert Baker at the Experimental Music Studios.
Brün began programming in FORTRAN in the late 1960s as he pursued an interest in designing processes. This work resulted in Infraudibles (1968) and mutatis mutandis (1968). The latter was a series of computer graphics for interpretation by composer/performers.
From 1968–74, he co-taught courses at the Biological Computer Lab with Heinz von Foerster (Professor of Electrical Engineering, Physics, and Biology) on cybernetics, heuristics, composition, cognition, and social change. In 1974, the members of the class published the book The Cybernetics of Cybernetics.
In 1972, Brün created a new synthesis technique which generated new timbres by linking and merging tiny portions of waveforms. (Efforts along similar lines are described in the article Granular synthesis.) From 1980 on, he toured and taught with the Performers' Workshop Ensemble, a group he founded.
Brün was instrumental in helping the then fledgling Computer Music Association get started in the middle 1970s, helping host conferences at the University of Illinois in 1975, and again in 1987. He was invited to give the keynote address at their annual conference in 1985.
Brün was awarded an honorary doctorate from the Goethe University Frankfurt (1999), and the Norbert Wiener medal from the American Society for Cybernetics in 1993. He helped found the School for Designing a Society in 1993 and taught there
|
https://en.wikipedia.org/wiki/Yang%20Tao
|
Yang Tao may refer to:
Tao Yang, Chinese-American computer scientist
Yang Tao (speed skater), Chinese speed skater
, a rural commune of Lắk District, Đắk Lắk Province, Vietnam
|
https://en.wikipedia.org/wiki/CompuMate
|
The CompuMate SV010 was a home computer peripheral manufactured by Spectravideo International for the Atari 2600 home video game console. It was released on 6 January 1983 at the Winter Consumer Electronics Show in Las Vegas, Nevada.
In Germany, the CompuMate was marketed by Quelle, a catalogue company, as the Universum Heimcomputer. In Brazil (circa 1985), at least two clones of CompuMate were made: the Dactar-Comp by Milmar Electronics, and the CompuGame.
Hardware
The ComputeMate consists of a membrane keyboard, output interfaces, and read-only internal storage. It connects to the console's module slot and to both controller ports. The user could optionally place the ComputeMate on top of the console—although not when used with the Atari 2600 Jr. model.
The CompuMate has a 3.5-mm phone connector in order to connect a Compact Cassette unit for non-volatile data storage. Its read-only memory is preinstalled with three computer programs.
PAL and NTSC versions of the CompuMate were manufactured.
Software
The CompuMate has three simple computer programs in its internal read-only memory:
Magic Easel, a drawing and animation program with a 40×40-pixel canvas and 10 selectable colors. It can animate up to nine frames in a repeating loop. It has two demonstration pictures: a world map and a snowman.
Music Composer, a software synthesizer with four demonstration songs: "Twinkle, Twinkle, Little Star", "Long, Long Ago", "Jingle Bells", and "My Bonnie".
Microsoft BASIC editor and interpreter
Spectravideo only published two programs for the CompuMate on Compact Cassette, PictureMate (1983) and SongMate (1983).
See also
BASIC Programming cartridge for the Atari 2600
References
External links
Spectravideo CompuMate, Oldcomputers.net
Atari 2600 VCS CompuMate, scans of instructions
The CompuMate List(Loadable programs) - Atari 2600 - AtariAge Forums
CompuMate Basic Programs
Stella -- A multi-platform Atari 2600 Emulator Supports CompuMate emulation.
z26 -- An Atari 2600 Emulator Supports CompuMate emulation.
6502-based home computers
Home computers
Atari 2600
Products introduced in 1983
BASIC programming language family
|
https://en.wikipedia.org/wiki/Hanover%20Stadtbahn
|
The Hanover Stadtbahn is a Stadtbahn (light rail) system in the city of Hanover, Lower Saxony, Germany. The Stadtbahn opened on 29 September 1975, gradually replacing the city's tramway network over the course of the following 25 years. Currently, the Hanover Stadtbahn system consists of 12 main lines (Lines 1–11 & 17; along with one weekend express night line (Line 10E) and two supplemental lines (Lines 16 & 18)), serving 196 stations (including 19 underground stations, and 119 high-platform stations), and operating on of route. The system is run by üstra, which was originally an abbreviation for . As of 2007, it transported 125 million passengers per year.
Three types of light rail cars operate on the system, the TW 6000, built from 1974 to 1993, the TW 2000 (the so-called "Silberpfeil"), built from 1997 to 1999, and the TW 3000, which was first introduced into A line service in 2015. The system is extensively used, especially during trade shows on the Hanover fairground like CeBIT or the Hannover Messe. It makes up for more than 60% of the GVH transport association's total traffic, spanning over four cities and two counties. Hanover Stadtbahn is complemented by DB-owned Hanover S-Bahn, a suburban heavy rail network which links the outlying suburbs and towns, as well as Hanover Airport, to the city centre.
Network
The main Stadtbahn networks
The Stadtbahn is a mixture of traditional tramways, of which 82% have been upgraded so far to have their own right-of-way, and an U-Bahn-like system of tunnels in the city centre.
It is owned by infra GmbH and covers nearly the whole city area. Parts of the Stadtbahn reach into the neighbouring towns of Garbsen, Isernhagen, Langenhagen, Laatzen and Ronnenberg as well as into the town of Sarstedt, which is in the borough of Hildesheim. The operator's concession is held by üstra Hannoversche Verkehrsbetriebe AG.
The system currently consists of three full Stadtbahn route networks, respectively named (with their defining tunnels in brackets):
A (Waterlooplatz – Lister Platz)
B (Vahrenwald – Döhren)
C (Königsworther Platz – Braunschweiger Platz)
A fourth tunnel, to be used for the D line (Goethestraße – Sallstraße), has been proposed but has not been realised so far due to the high costs of construction, currently estimated to be around € 1 billion. Nevertheless, the above-ground parts of the D line, most notably the D Süd, connecting the Hanover fairground to the C tunnel, have been upgraded to proper Stadtbahn standards, some preparations for interchange with the current stations, such as an empty station below the current Hauptbahnhof station, have also been built in the past.
The entire Stadtbahn network uses various colours to differentiate between the main route networks. For example, a station that serves both A and B lines has a blue and a red stripe on its station sign; stop on the D line would feature a lime stripe on the station sign, and so on. This scheme sometimes also recurs in the archite
|
https://en.wikipedia.org/wiki/Route%20availability
|
Route Availability (RA) is the system by which the permanent way and supporting works (bridges, embankments, etc.) of the railway network of Great Britain are graded. All routes are allocated an RA number between 1 and 10.
Rolling stock is also allocated an RA (again between 1 and 10) and the RA of a train is the highest RA of any of its elements. The train must have a route availability (RA) lower than or equal to the RA of a line to be allowed to use it. The RA is primarily related to the axle load of the vehicle, although axle spacing is also taken into consideration. In practice it is the locomotive which governs where trains may operate, although many high capacity 4 axle wagons have a high RA when fully loaded. (When considering the operation of trains the loading gauge must also be considered.)
The system was first devised by the London and North Eastern Railway, and perpetuated by British Rail to ascertain which locomotives can work on which lines throughout the rail network in Great Britain.
Exemptions may be obtained to allow locomotives to operate on lines from which they may otherwise be banned. An exemption might be granted by placing a speed restriction over a weak bridge, for example.
Line calculations
The route availability for a line is calculated by taking into account bridge strength, track condition, structural issues and so on. A route availability of one (RA1) is the most restricted line, open to possibly one type of locomotive specially designed for it. A route availability of 10 is the most open, usable by any locomotive that fits within the GB loading gauge that has been 'passed' for it (checked for conflicts with infrastructure such as platforms).
Vehicle calculations
Route availability for a vehicle (locomotive or wagon) is generally based upon its axle loading. That is, how much of the laden weight of the vehicle is distributed on each axle. The more weight on each axle, the higher the RA number, and the more restricted the vehicle is. For wagons it is normal to have different RAs when running empty and full.
The RA of a locomotive must not exceed the RA of the track except under strictly controlled circumstances.
Thus a locomotive with RA 1 is able to work on any line, although it will have a very light axle loading. An RA 10 locomotive could only work upon an RA 10 line, placing severe restrictions on where it can be used.
If a vehicle has wheels that require significant balance weights, often found on steam locomotives, the dynamic loading resulting in what is termed the hammer blow action may affect the RA of the vehicle.
Network Rail currently gives the allowed axle loadings as follows:
Historical notes
Before nationalisation the Big Four railway companies had their own classification systems.
GWR's system for classification featured a coloured disc painted on the locomotive cab side to indicate its route availability:
See also
Rail speed limits in the United States#Track classes
References
Ex
|
https://en.wikipedia.org/wiki/Ice%20Cream%20of%20Margie%20%28with%20the%20Light%20Blue%20Hair%29
|
"Ice Cream of Margie (with the Light Blue Hair)" is the seventh episode of the eighteenth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on November 26, 2006. In the episode, Homer gets fired from the nuclear power plant yet again and takes over an ice cream truck business, while a depressed Marge creates Popsicle-stick sculptures to keep busy. The sculptures quickly become popular, and Marge is excited to have a purpose in life until a turn of events divides the Simpsons household. It was written by Carolyn Omine, and directed by Matthew Nastuk. In its original run, the episode received 10.90 million viewers.
Plot
During a chair hockey game at the power plant with office supplies, Mr. Burns chastises Homer for behaving unprofessionally during the game. Homer gets in more trouble when an ice cream truck passes by the plant, causing him to fantasize that Mr. Burns is an ice cream cone and try to lick him, resulting in Homer being fired as he runs towards the ice cream truck. Homer uses a $100 bill to buy a 25 cent ice cream from the ice cream man, Max, who collapses and dies of a fatal heart attack while changing the bill into coins. Max's widow sells the truck to Homer, and Homer has Otto remodel it à la Pimp My Ride. Meanwhile, the television series Opal — Springfield's version of The Oprah Winfrey Show — has a show about successful women, which sends Marge into a deep depression, as she feels she has not done anything memorable with her life. Marge is inspired by all the Popsicle sticks Homer brings home, and makes sculptures out of them.
Kent Brockman sees the sculptures and interviews Marge, who says she creates them, so they will serve as a reminder of her when she is gone. Kent includes her on a news special, Kent Brockman's Kentresting People. Thanks to the publicity, Rich Texan creates an art show to showcase Marge's talent; however, it opens on Saturday, a day with high ice cream sales. Homer promises to return by 3 o'clock to see the art show. He loses track of time and hurries home, but accidentally crashes into his own lawn in the process, destroying all of Marge's sculptures. Marge says that Homer has ruined her dreams and locks herself in the bedroom.
Several days later, Homer tries to express how bad he feels by slipping pictures of himself under the door, but falls asleep. When he wakes up, Marge is gone and Grandpa is looking after Bart and Lisa, who tell him that Marge left hours ago. Marge is on top of city hall, where she declares she will show the world how she feels about Homer. She reveals the largest Popsicle sculpture she has ever made, and the subject is Homer. Marge realizes that Homer tried to keep his promise to her and make it on time, not that he did not care, much to the shock of a nearby Opal. Marge apologizes to Homer for the way that she acted, Homer apologizes for ruining her sculptures, and the two reunite. The scene shifts 200 yea
|
https://en.wikipedia.org/wiki/Macintosh%20Quadra%20610
|
The Macintosh Quadra 610, originally sold as the Macintosh Centris 610, is a personal computer designed, manufactured and sold by Apple Computer from February 1993 to July 1994. The Centris 610 was introduced alongside the larger Centris 650 as the replacement for the Macintosh IIsi, and it was intended as the start of the new midrange Centris line of computers. Later in 1993, Apple decided to follow an emerging industry trend of naming product families for their target customers Quadra for business, LC for education, and Performa for home and folded the Centris 610 into the Quadra family.
The 610 is the second Macintosh case design (after the Macintosh LC family) to use a pizza box form factor; it was later used for the Centris / Quadra 660AV and the Power Macintosh 6100. The Quadra 610 was also sold in a "DOS compatible" model with an additional 486SX processor at 25 MHz on a Processor Direct Slot card.
A server variant, the Workgroup Server 60, was introduced in July 1993 with a 20 MHz processor, which received the same 25 MHz upgrade in October. A "DOS Compatible" version was introduced in February 1994 as a way for Apple to judge whether the market would be interested in a Macintosh that could also run DOS. The product was deemed a success by Apple, selling all 25,000 units that were produced in two months.
The Quadra 610 was replaced with the Quadra 630 in July 1994, and the Workgroup Server 6150 replaced the Workgroup Server 60 as Apple's entry-level server offering.
Hardware
Standard equipment on all Centris 610 models includes onboard video (with VGA support via an adapter), two ADB and two serial ports, and an external SCSI connector. There are two SIMM slots that support 4, 8, 16, and 32 MB SIMMs, allowing for a 68 MB of RAM. Ethernet-capable models have an AAUI port. There are no NuBus slots; an optional expansion card was offered that plugs into the Processor Direct Slot and allows a single 7-inch NuBus card to be installed in a horizontal orientation. This arrangement initially precluded the use of the full 68040 processor as there was insufficient clearance for a heat sink, something the 68LC040 does not require. This was no longer an issue by the time the Quadra 610 DOS Compatible was released, which included a full 68040 CPU.
When the Centris 610 was first introduced, only a few 7-inch NuBus cards existed; most were 12 inches. The smaller size was part of an upcoming update to the NuBus standard.
System 7.1 was included as standard, with Mac OS 8.1 being the highest supported version. Versions with a full 68040 processor can also run A/UX with the appropriate Enablers.
Models
Introduced February 10, 1993:
Macintosh Centris 610: Sold in four configurations:
68LC040, 4 MB RAM (on board), 512 KB VRAM (on board), 80 MB HDD, no Ethernet
68LC040, 8 MB RAM (4 MB onboard + 4 MB SIMM), 512 KB VRAM (on board), 80 MB HDD, Ethernet
68LC040, 8 MB RAM (4 MB onboard + 4 MB SIMM), 512 KB VRAM (on board), 230 MB HDD, Ethernet
68LC04
|
https://en.wikipedia.org/wiki/NSMB%20%28mathematics%29
|
NSMB is a computer system for solving Navier–Stokes equations using the finite volume method. It supports meshes built of several blocks (multi-blocks) and supports parallelisation. The name stands for "Navier–Stokes multi-block". It was developed by a consortium of European scientific institutions and companies, between 1992 and 2003.
References
Numerical software
|
https://en.wikipedia.org/wiki/Martin%20Smith%20%28academic%29
|
Martin Smith is a former Professor of Robotics at Middlesex University in north London, UK. He is also a former President of the Cybernetics Society in the UK (1999 - 2020).
Smith was awarded Freedom of the City of London, and was awarded the Public Awareness of Physics Award by the Institute of Physics.
Television appearances
Smith has appeared on many television programmes: as a technical presenter on the BBC television programme Techno Games and as a judge on Robot Wars from the third series having previously competed in the first series. He was a judge and programme consultant on Channel 4's Scrapheap Challenge and technical presenter on Granada TV's Mutant Machines. He has also appeared on Tomorrow's World, Tomorrow's World Live at the NEC, and the Royal Institution Christmas Lectures series entitled The Rise of Robots.
Editorships
Smith is a member of the editorial boards of Kybernetes: The International Journal of Cybernetics and Systems, The International Journal of Advanced Robotic Systems, The International Journal of Applied Systemic Studies, the International Journal of General Systems, and The International Journal of Social Robotics. He is a Director of the World Organisation of Systems and Cybernetics.
Former posts
He has held posts as Visiting Research Professor in Robotics at the Open University, Professor at the University of Central England UK, (now Birmingham City University) and at the University of East London (UK) where he was founder and Head of the Mobile Robots Research Unit.
References
External links
Biography - the Cybernetics Society
Academics of the Open University
Cyberneticists
Living people
Year of birth missing (living people)
Fellows of the Institute of Physics
Fellows of the Royal Astronomical Society
|
https://en.wikipedia.org/wiki/Macintosh%20Quadra%20650
|
The Macintosh Quadra 650, originally sold as the Macintosh Centris 650, is a personal computer designed, manufactured and sold by Apple Computer from February 1993 to September 1994. The Centris 650 was introduced alongside the smaller Centris 610 as the replacement for the Macintosh IIci and Quadra 700, and it was intended as the start of the new midrange Centris line of computers. Later in 1993, Apple decided to follow an emerging industry trend of naming product families for their target customers – Quadra for business, LC for education, and Performa for home – and folded the Centris 650 into the Quadra family.
The Quadra 650 was discontinued without a direct replacement in September 1994, although the recently introduced Power Macintosh 7100, which has the same IIvx form factor as the 650, had a similar target audience and was sold in the same price range.
Models
There are two versions of the Centris 650: One with 4 MB of RAM soldered to the logic board and an FPU-less Motorola 68LC040 CPU, and one with 8 MB of logic board RAM, a full Motorola 68040, and an onboard AAUI port for Ethernet. Each can be configured with a 80 MB, 230 MB, or 500 MB 3.5-inch hard drive. Standard equipment on all Centris 650 models includes onboard video (with VGA support via an adapter), 3 NuBus slots, a Processor Direct Slot, two ADB and two serial ports, an external SCSI connector, and a 5.25-inch drive bay. There are four SIMM slots that support 4, 8, 16, and 32 MB SIMMs, allowing for a maximum of 132 or 136 MB of RAM depending on the amount of soldered memory. System 7.1 was included as standard and is the minimum required version.
The higher-end model also came with 1MB VRAM installed, enabling 16-bit color at 640x480 resolution. The availability of 16-bit color was significant, as it was the standard bit depth of Apple's then-new QuickTime video standard.
As a way to promote the use of multimedia, Apple also sold a Centris 650 "CD ROM bundle", which had 8 MB of RAM and 1 MB of video RAM, and included a microphone, an AppleCD 300i CD-ROM drive, and a System 7 install CD.
Introduced February 10, 1993:
Macintosh Centris 650: Sold in five configurations:
25 MHz 68LC040, 4 MB RAM (on board), 512 KB VRAM, 80 MB HDD, no Ethernet
25 MHz 68040, 8 MB RAM (on board), 512 KB VRAM, 80 MB HDD, Ethernet
25 MHz 68040, 8 MB RAM (on board), 512 KB VRAM, 230 MB HDD, Ethernet
25 MHz 68040, 8 MB RAM (on board), 1 MB VRAM, 230 MB HDD, Ethernet, AppleCD 300i and microphone
25 MHz 68040, 24 MB RAM (including 8 MB on board), 1 MB VRAM, 500 MB HDD, Ethernet
Introduced October 21, 1993:
Macintosh Quadra 650: 33 MHz 68040.
Timeline
References
External links
Centris 650 and Quadra 650 at apple-history.com
Centris 650 and Quadra 650 at Low End Mac
Centris 650 and Quadra 650 at EveryMac.com
650
650
Quadra 650
Quadra 650
Quadra 650
Computer-related introductions in 1993
Products and services discontinued in 1994
|
https://en.wikipedia.org/wiki/W%20%28Unix%29
|
The command w on many Unix-like operating systems provides a quick summary of every user logged into a computer, what each user is currently doing, and what load all the activity is imposing on the computer itself. The command is a one-command combination of several other Unix programs: , , and .
Example
Sample output (which may vary between systems):
$ w
11:12am up 608 day(s), 19:56, 6 users, load average: 0.36, 0.36, 0.37
User tty login@ idle what
smithj pts/5 8:52am w
jonesm pts/23 20Apr06 28 -bash
harry pts/18 9:01am 9 pine
peterb pts/19 21Apr06 emacs -nw html/index.html
janetmcq pts/8 10:12am 3days -csh
singh pts/12 16Apr06 5:29 /usr/bin/perl -w perl/test/program.pl
References
External links
Unix user management and support-related utilities
|
https://en.wikipedia.org/wiki/Andante%20ticket
|
Andante is a public transport ticketing system used in and around Porto, Portugal.
It started operation in November 2002 at Metro do Porto stations and is now a cross-network ticket used on the Porto Metro, selected bus and train routes and the Funicular dos Guindais cable railway.
Two types of card are currently in use:
Occasional or Azul (blue): This card is a rechargeable ticket intended for occasional riders, and contains a small, flexible memory card within the laminated ticket. The card has an estimated life-span of about one year.
Season or Gold: Similar to a credit card in shape and material, it has a memory chip on the surface. Gold tickets also feature the holder's name and laser-scanned photograph. It has a life-time of several years.
Occasional tickets can be bought at the terminals in stations. Ticket machines can recharge both kinds of ticket, although Gold tickets can only be purchased in Lojas Andante (Andante Shops). Tickets can also be recharged at MultiBanco ATMs. When purchasing tickets, passengers must select how many zones the card will allow travel within. The minimum Z2 (2 zone) ticket allows travel for 1 hour after validation, with allowed travel time increasing for each valid zone purchased.
Unlike others ticket zoning systems, Andante zones are not concentric. This makes the system slightly fairer, but also slightly more complicated. To travel within the same zone or up to one neighbouring zone you need Z2 ticket, the more zones you need to cross, the higher the Z ticket you need. Although with Andante Occasional you can use your tickets in any zones, with Andante Gold you must choose in advance which zones you will be travelling in.
The system uses ISO/IEC 14443 type B for communication between card readers (check-in points, automatic vending machines, vending stores and controller handsets) and the card itself. The system is entirely contactless, with validation activated by holding the ticket a short distance in front of the reader for about a second. Teams of ticket inspectors make random checks across the network with hand-held ticket readers.
From July 2021, the system was extended to allow use of contactless payment cards.
References
External links
Official website
Contactless smart cards
Fare collection systems in Portugal
Porto Metro
|
https://en.wikipedia.org/wiki/S.%20Rao%20Kosaraju
|
Sambasiva Rao Kosaraju is an Indian-American professor of computer science at Johns Hopkins University, and division director for Computing & Communication Foundations at the National Science Foundation. He has done extensive work in the design and analysis of parallel and sequential algorithms.
Education
He was born in India, and he did his bachelor's degree in engineering from Andhra University, Masters from IIT Kharagpur, and holds a PhD from University of Pennsylvania.
Career
In 1978, he wrote a paper describing a method to efficiently compute strongly connected members of a directed graph, a method later called Kosaraju's algorithm. Along with Paul Callahan, he published many articles on efficient algorithms for computing the well-separated pair decomposition of a point set. His research efforts include efficient algorithms for pattern matching, data structure simulations, universal graphs, DNA sequence assembly, derandomization and investigations of immune system responses.
In 1995, he was inducted as a Fellow of the Association for Computing Machinery. He is also a fellow of the IEEE. A common saying at Johns Hopkins University, "At some point, the learning stops and the pain begins." has been attributed to him. There used to be a shrine in the CS Undergraduate Lab in his honour.
References
External links
.
Johns Hopkins University faculty
American computer scientists
Theoretical computer scientists
Fellows of the Association for Computing Machinery
Indian emigrants to the United States
University of Pennsylvania alumni
Living people
Year of birth missing (living people)
Fellow Members of the IEEE
Andhra University alumni
IIT Kharagpur alumni
|
https://en.wikipedia.org/wiki/Avi%20Rubin
|
Aviel David "Avi" Rubin (born November 8, 1967) is an expert in systems and networking security. He is a graduate of the University of Michigan and Professor of Computer Science at Johns Hopkins University, Technical Director of the Information Security Institute at Johns Hopkins, Director of ACCURATE, and President and co-founder of Independent Security Evaluators. In 2002, he was elected to the Board of Directors of the USENIX Association for a two-year term.
Rubin is credited with bringing to light vulnerabilities in Premier Election Solutions' (formerly Diebold Election Systems) AccuVote electronic voting machines. In 2006, he published a book on his experiences since this event.
In 2012, drawing on his experience as an expert witness in high-tech litigation, Rubin founded the consultancy Harbor Labs "to provide expertise in legal cases, including testimony, reports, source code review and analysis."
As of 2015, Rubin is Director of the Health and Medical Security Lab at Johns Hopkins.
Rubin is a self-professed "poker fanatic" and has competed against professional players on the Poker Night in America television show.
Education
1994, Ph.D., Computer Science and Engineering, University of Michigan, Ann Arbor
1991, M.S.E., Computer Science and Engineering, University of Michigan, Ann Arbor
1989, B.S., Computer Science (Honors), University of Michigan, Ann Arbor
References
External links
Avi Rubin's JHU home page
Avi Rubin's research papers
Living people
Johns Hopkins University faculty
University of Michigan College of Engineering alumni
Computer security academics
Election technology people
1967 births
|
https://en.wikipedia.org/wiki/Vundo
|
The Vundo Trojan (commonly known as Vundo, Virtumonde or Virtumondo, and sometimes referred to as MS Juan) is either a Trojan horse or a computer worm that is known to cause popups and advertising for rogue antispyware programs, and sporadically other misbehavior including performance degradation and denial of service with some websites including Google and Facebook. It also is used to deliver other malware to its host computers. Later versions include rootkits and ransomware.
Infection
A Vundo infection is typically caused either by opening an e-mail attachment carrying the trojan, or through a variety of browser exploits, including vulnerabilities in popular browser plug-ins, such as Java. Many of the popups advertise fraudulent programs such as AntiSpywareMaster, WinFixer, and AntiVirus 2009.
Virtumonde.dll consists of two main components, Browser Helper Objects and Class ID. Each of these components is in the Windows Registry under HKEY LOCAL MACHINE, and the file names are dynamic. It attaches to the system using bogus Browser Helper Objects and DLL files attached to winlogon.exe, explorer.exe and more recently, lsass.exe.
Vundo inserts registry entries to suppress Windows warnings about the disabling of firewall, antivirus, and the Automatic Updates service, disables the Automatic Updates service and quickly re-disables it if manually re-enabled, and attacks Malwarebytes' Anti-Malware, Spybot Search & Destroy, Lavasoft Ad-Aware, HijackThis, and several other malware removal tools. It frequently hides itself from Vundofix and Combofix. Rather than pushing fake antivirus products, the new "ad" popups for the drive by download attacks are copies of ads by major corporations, faked so that simply closing them allows the drive-by download exploit to insert the payload into the user's computer.
Symptoms
Since there are many different varieties of Vundo trojans, symptoms of Vundo vary widely, ranging from the relatively benign to the severe. Almost all varieties of Vundo feature some sort of pop-up advertising as well as rooting themselves to make them difficult to delete.
Computers infected exhibit some or all of the following symptoms:
Vundo will cause the infected web browser to pop up advertisements, many of which claim a need for software to fix system "deterioration".
The desktop background may be changed to the image of an installation window saying there is adware on the computer.
The screensaver may be changed to the Blue Screen of Death.
In the Display Properties Control Panel, the background and screensaver tabs are missing because their "Hide" values in the Registry were changed to 1.
Both the background and screensaver are in the System32 folder, however the screensaver cannot be deleted.
Windows Automatic Updates (and other web-based services) may also be disabled and it is not possible to turn them back on.
Infected DLLs or DAT files (with randomized names such as "__c00369AB.dat" and "slmnvnk.dll") will be present in th
|
https://en.wikipedia.org/wiki/Gnits%20standards
|
The Gnits standards are a collection of standards and recommendations for programming, maintaining, and distributing software. They are published by a group of GNU project maintainers who call themselves "Gnits", which is short for "GNU nit-pickers". As such, they represent advice, not Free Software Foundation or GNU policy, but parts of the Gnits' standards have seen widespread adoption among free software programmers in general.
The Gnits standards are extensions to, refinements of, and annotations for the GNU Standards. However, they are in no way normative in GNU; GNU maintainers are not required to follow them. Nevertheless, maintainers and programmers often find in Gnits standards good ideas on the way to follow GNU Standards themselves, as well as tentative, non-official explanations about why some GNU standards were decided the way they are. There are very few discrepancies between Gnits and GNU standards, and they are always well noted as such.
The standards address aspects of software architecture, program behaviour, human–computer interaction, C programming, documentation, and software releases.
As of 2008, the Gnits standards carry a notice that they are moribund and no longer actively maintained, and points readers to the manuals of Gnulib, Autoconf, and Automake, which are said to cover many of the same topics.
See also
GNU Autotools
GNU coding standards
External links
Gnits Standards
Gnits Standards (mirror)
Effect of Gnits on automake options
Computer standards
GNU Project
Computer programming
Free software culture and documents
|
https://en.wikipedia.org/wiki/The%20Star%20of%20Christmas
|
The Star of Christmas is a 2002 American computer-animated film and is the eighteenth episode of the VeggieTales animated series and the second holiday special. It was released on October 26, 2002 and re-released on October 5, 2004, in Holiday Double Feature with its earlier episode The Toy that Saved Christmas. Like the other holiday episodes, it has no usual ”A Lesson in...” subtitle and the countertops. The film's message is that the true Star of Christmas is Jesus Christ. The movie emphasizes that the tale of Jesus Christ's birth is the epitome of real love and should, therefore, serve as society's model for how to love others.
The Star of Christmas centers on two would-be operatic composers who are based on W. S. Gilbert and Arthur Sullivan. VeggieTales has spoofed Gilbert and Sullivan's work in Lyle the Kindly Viking and (specifically The Mikado) in Sumo of the Opera. In this episode however they spoof the people, Gilbert, Sullivan and themselves.
The film was nominated for an Annie Award in 2002 in the category of Outstanding Achievement in an Animated Home Video Production, but lost to Rolie Polie Olie: The Great Defender of Fun.
Plot
The cast of VeggieTales plan a play entitled "The Princess and the Plumber". Faced with the prospect of losing their audience to the pageant, Cavis vows to make their own production greater and flashier. But they cannot compete with the Star of Christmas, and in desperation Cavis and Millward go to the church to steal the Star.With the Star and flashy lights, Cavis is certain "The Princess and the Plumber" is now a guaranteed success, but during dress rehearsal, the excessive amount of lights ignite the curtains. Edmund and his father,Reverend, arrive at the jail to release Cavis and Millward. Cavis is moved, and he expresses his desire to attend the pageant, but the pageant starts in ten minutes and there is not enough time to get there.Just then, Seymour shows up in the rocket car, trusting Millward to drive the vehicle and get them all to the church on time. It is a harrowing ride fraught with collisions and near-misses, but they do arrive just as the pageant is about to start. The pageant goes on with the Prince and Miss Pickering in attendance.
Production
The studio was on a tight schedule in early Christmas 2001 to get the film done. Most people slept in their offices trying to get The Star of Christmas finished. Towards the end/before it wrapped, Mike Nawrocki was said he would be on his Sunday drive around the time of New Year's Eve. They were at a café, the same café they used for the premiere of "Larryboy and the Rumor Weed". There was Lisa Vischer singing "O Come, O Come Emmanuel" during the "Star of Christmas" premiere.
Cast of characters
Phil Vischer as Cavis Appythart (Bob the Tomato), Seymour Schwenk (Pa Grape), Jeffrey Croke (Jimmy Gourd), Ebenezer Nezzer, Arthur Hollingshead (Archibald Asparagus), Prince Calvin Fredrick (Mr. Lunt), Benny (Percy Pea), Phillipe Pea, Frairie Peas an
|
https://en.wikipedia.org/wiki/Bob%20Whitehead
|
Robert A. Whitehead (born November 1, 1953) is an American video game designer and programmer. While working for Atari, Inc. he wrote two of the nine Atari Video Computer System launch titles: Blackjack and Star Ship. After leaving Atari, he cofounded third party video game developer Activision, then Accolade. He left the video game industry in the mid-1980s.
Career
Whitehead attended San Jose State University and received a BS in Mathematics.
Whitehead worked for Atari in the late 1970s developing games for the Atari 2600 (or VCS for video computer system). There, he developed several games, including a VCS implementation of chess, a feat many other programmers considered impossible for the system. He and his co-workers David Crane, Larry Kaplan, and Alan Miller became informally known as the "Gang of Four", a group of developers who felt inadequately compensated for their work despite being collectively responsible for 60 percent of the company's profits from VCS cartridge sales.
Whitehead is sometimes credited as co-author, together with the rest of the Gang of Four, of the operating system for the Atari 400/800 computers. It has been however clarified both by Al Miller and by Whitehead himself that he was not involved in the OS development, although he took part in developing applications for the computers.
Eventually the Gang of Four, disgruntled by the management's decline to provide more recognition and fair compensation to the developers, decided to leave Atari and start their own business. Whitehead together with Miller, Crane and Kaplan co-founded Activision, the first third-party video game developer, in October 1979.
There, with others, he created a VCS development system with an integrated debugger and minicomputer-hosted assembler. It was used for most of Activision's VCS titles. He also developed a "venetian blinds" animation technique: an algorithm that horizontally reused and vertically interlaced sprites several times while rendering each frame, to give the illusion that the system had more than the maximum number of sprites allowed by the hardware.
In 1984, he and other founders of Activision became disillusioned with their company. Their stock had dwindled in value and morale was low. They thought that diversification to the home computer market — such as with the Commodore 64 — was the key to success. He left Activision with Alan Miller (another co-founder of Activision), and they founded Accolade. Soon after, Whitehead left the video game industry for good.
Whitehead left in order to "give back to God and spend time with 'the fam'". After leaving Accolade, Whitehead says he helped with "low income families, getting non-profit religious start-ups going, [and] spending time in the garden."
In a 2005 interview, Whitehead said of the contemporary state of the industry:
Games
Atari 2600
Home Run (Atari)
Football (Atari)
Blackjack (Atari)
Casino (Atari)
Star Ship (Atari)
Video Chess (Atari)
Boxing (Activision)
S
|
https://en.wikipedia.org/wiki/CANDE
|
CANDE (Command AND Edit) is a command line shell and text editor on the MCP (Master Control Program) operating system which runs on the Unisys Clearpath series of mainframes. Originally implemented on Burroughs large systems, it has a range of features for interacting with the operating system execution environment, focused on executing, editing and compiling programs, and creating, copying, moving, renaming, and deleting files in general.
Its full name is CANDE MCS. MCS, or Message Control Subsystem is the general form of a systems program in the Burroughs architecture (other than MCP, the Master Control Program or core OS). As an MCS, CANDE is more than just an editor as it provides overall control for a network of users.
The editing capabilities of CANDE are anachronistic for casual (as opposed to scripted) editing as they predate full screen and graphical editors.
CANDE was also used on the Burroughs CMS (mini computer) range, with very similar syntax.
In contemporary MCP, CANDE is primarily used thru the ODT (Operator Display Terminal) and MARC (Menu Assisted Resource Control) on emulators of the original character oriented terminals as with other legacy mainframe interfaces such as ISPF.
Features
CANDE provides a command-line interpreter and line editor, although unlike the modern interpretation of an operating system command line interpreter, the CANDE commands are compiled into the CANDE MCS, as shell like capabilities are provided by WFL. Other notable features and functions include:
Create, edit, and maintain (copy, move, remove, print, rename) data and program files
Compile and execute programs
Access and display information about the data communication network including terminal communication lines and remote devices
Dynamically alter the communication network
Access and display job and task information
Utility functions (calculator, system utility test, etc.)
In addition to these features CANDE has an on-line help facility.
Implementation
For extra speed, CANDE implemented user context switching by swapping a block at the top of the stack. This novel method broke several assumptions built into the design of Burroughs large systems, in particular the handling of virtual memory descriptors, and meant that CANDE itself had to be written in DCALGOL with system-level privileges.
Architecturally, CANDE is split into two main sections: a primary, single-instanced main process originally supporting up to 255 simultaneous users, and one or more worker stacks. The main process is called BUMP. It receives all input messages, including input from users. Simple requests which can be executed without delay and do not involve any I/O such as disk access are handled immediately. Other requests are added to a work queue and handled by one of the worker processes. The worker process is called GRIND; there can be one or more instances at any time. Each GRIND process has by default five pseudo-threads which actually carry out the work.
|
https://en.wikipedia.org/wiki/Lspci
|
lspci is a command on Unix-like operating systems that prints ("lists") detailed information about all PCI buses and devices in the system. It is based on a common portable library libpci which offers access to the PCI configuration space on a variety of operating systems.
Example usage
Example output on a Linux system:
# lspci
00:00.0 Host bridge: Advanced Micro Devices, Inc. [AMD] Raven/Raven2 Root Complex
00:00.2 IOMMU: Advanced Micro Devices, Inc. [AMD] Raven/Raven2 IOMMU
00:01.0 Host bridge: Advanced Micro Devices, Inc. [AMD] Family 17h (Models 00h-1fh) PCIe Dummy Host Bridge
00:01.2 PCI bridge: Advanced Micro Devices, Inc. [AMD] Raven/Raven2 PCIe GPP Bridge [6:0]
00:01.7 PCI bridge: Advanced Micro Devices, Inc. [AMD] Raven/Raven2 PCIe GPP Bridge [6:0]
00:08.0 Host bridge: Advanced Micro Devices, Inc. [AMD] Family 17h (Models 00h-1fh) PCIe Dummy Host Bridge
00:08.1 PCI bridge: Advanced Micro Devices, Inc. [AMD] Raven/Raven2 Internal PCIe GPP Bridge 0 to Bus A
00:14.0 SMBus: Advanced Micro Devices, Inc. [AMD] FCH SMBus Controller (rev 61)
00:14.3 ISA bridge: Advanced Micro Devices, Inc. [AMD] FCH LPC Bridge (rev 51)
00:18.0 Host bridge: Advanced Micro Devices, Inc. [AMD] Raven/Raven2 Device 24: Function 0
00:18.1 Host bridge: Advanced Micro Devices, Inc. [AMD] Raven/Raven2 Device 24: Function 1
00:18.2 Host bridge: Advanced Micro Devices, Inc. [AMD] Raven/Raven2 Device 24: Function 2
00:18.3 Host bridge: Advanced Micro Devices, Inc. [AMD] Raven/Raven2 Device 24: Function 3
00:18.4 Host bridge: Advanced Micro Devices, Inc. [AMD] Raven/Raven2 Device 24: Function 4
00:18.5 Host bridge: Advanced Micro Devices, Inc. [AMD] Raven/Raven2 Device 24: Function 5
00:18.6 Host bridge: Advanced Micro Devices, Inc. [AMD] Raven/Raven2 Device 24: Function 6
00:18.7 Host bridge: Advanced Micro Devices, Inc. [AMD] Raven/Raven2 Device 24: Function 7
01:00.0 Network controller: Realtek Semiconductor Co., Ltd. RTL8822BE 802.11a/b/g/n/ac WiFi adapter
02:00.0 Non-Volatile memory controller: Sandisk Corp PC SN520 NVMe SSD (rev 01)
03:00.0 VGA compatible controller: Advanced Micro Devices, Inc. [AMD/ATI] Raven Ridge [Radeon Vega Series / Radeon Vega Mobile Series] (rev c3)
03:00.1 Audio device: Advanced Micro Devices, Inc. [AMD/ATI] Raven/Raven2/Fenghuang HDMI/DP Audio Controller
03:00.2 Encryption controller: Advanced Micro Devices, Inc. [AMD] Family 17h (Models 10h-1fh) Platform Security Processor
03:00.3 USB controller: Advanced Micro Devices, Inc. [AMD] Raven USB 3.1
03:00.4 USB controller: Advanced Micro Devices, Inc. [AMD] Raven USB 3.1
03:00.5 Multimedia controller: Advanced Micro Devices, Inc. [AMD] Raven/Raven2/FireFlight/Renoir Audio Processor
03:00.6 Audio device: Advanced Micro Devices, Inc. [AMD] Family 17h (Models 10h-1fh) HD Audio Controller
03:00.7 Non-VGA unclassified device: Advanced Micro Devices, Inc. [AMD] Raven/Raven2/Renoir Non-Sensor Fusion Hub KMDF driver
Using lspci -v, lspci -vv, or lspci -vvv will display increasingly verbose details f
|
https://en.wikipedia.org/wiki/Cron%20%28disambiguation%29
|
Cron is a time-based job scheduler in Unix-like computer operating systems.
CRON or cron may also refer to:
People
Emmanuel Macron, French president
Chris Cron (born 1964), American baseball manager
Claudia Cron, American actress and model
C. J. Cron (born 1990), American professional baseball player
Kevin Cron (born 1993), American professional baseball player
Other uses
CRON-diet, the Calorie Restriction with Optimal Nutrition diet
Cron, a character in the animated series Teen Titans
See also
Cronin (Old Irish crón), a surname (and a list of people with the name)
CronLab, a computer company
Crohn's disease, a type of inflammatory bowel disease
|
https://en.wikipedia.org/wiki/WFXP
|
WFXP (channel 66) is a television station in Erie, Pennsylvania, United States, affiliated with the Fox network. It is owned by Mission Broadcasting, which maintains a local marketing agreement (LMA) with Nexstar Media Group, owner of ABC affiliate WJET-TV (channel 24), for the provision of certain services. The two stations share studios on US 19/Peach Street in Summit Township (with an Erie mailing address), where WFXP's transmitter is also located.
WFXP began broadcasting in 1986 as WETG, owned by Gannon University, a Catholic university in Erie. It gradually became a more typical commercial independent in its early years of operation and affiliated with Fox in April 1990. The growth of Fox led to new affiliate requirements that saw Gannon sell the station to private owners. Nexstar has managed WFXP since 1998 and airs dedicated morning and late evening newscasts from the WJET-TV newsroom on the station.
History
Channel 66 in Erie began broadcasting September 2, 1986, as WETG, operated by a joint venture of Gannon University and the Roman Catholic Diocese of Erie. Gannon had won the permit to build the station from a pool of three applicants in 1984 and promised to broadcast religious and entertainment programs as well as telecourses. Gannon students produced programs for the station, including a televised Mass and daily talk show, and participated in station operations for credit; in 1989, 46 of the 96 students in the university's communication arts program were involved in running WETG. By that time, the station's broadcast day had expanded from eight hours a day at launch to 15 hours, and the programming had grown more typical of an independent.
In April 1990, WETG became Erie's first Fox affiliate. Gannon University continued to own the station until 1994, when the network began increasing its requirements for affiliated stations. As a result, the university sold the station to a consortium of local investors known as Erie Broadcasting. Gannon retained four hours a week of programming, including the Mass, on channel 66. Power was increased from 35,000 to 600,000 watts, and the call sign was changed to WFXP; though the studios were to move off the Gannon campus, this did not take place. Erie Broadcasters then sold the station to Jason Elkin, former founder of New Vision Television; Elkin also tried to buy NBC affiliate WICU-TV but withdrew when the Telecommunications Act of 1996 failed to authorize the creation of duopolies, common direct ownership of two stations in a market. He instead assigned his option to buy to SJL Broadcasting. WICU then filed to run WFXP under an LMA, a move delayed by an objection by WJET-TV, which had lost out on an attempt to take control of the station.
In 1998, Nexstar—the new owner of WJET-TV—entered into an agreement to maintain responsibility for WFXP's daily operations except programming, with WICU citing the fact that it looked unable to acquire channel 66 outright in the near future; Nexstar had more
|
https://en.wikipedia.org/wiki/Biovision%20Hierarchy
|
BioVision Hierarchy (BVH) is a file format used for storing motion capture data. It was developed by BioVision, a company that was later acquired by Motion Analysis Corporation. The format consists of a hierarchical structure of joints, with each joint containing rotation and translation data. BVH files are widely used in the film, gaming, and animation industries.
History and Development
BVH file format's history and development span back to the 1990s, and it was originally developed as a proprietary file format for BioVision's motion capture systems, but later it was adopted by other motion capture systems, such as Vicon and OptiTrack. In the early days, BVH files were created for specific models and needed to be reworked for different models. However, as the use of BVH grew, more standardized models were created and used across different systems.
The development of BVH file format was a significant milestone in 3D animation and motion capture. Prior to BVH, motion data was recorded with pen and paper or entered manually into a computer. BVH allowed for the automatic capture and recording of motion data, making it easier and more efficient to create realistic animations.
Today, BVH remains a widely used file format for motion capture data and is supported by many animation software packages, such as Autodesk's Maya and Blender. It has become an essential tool in the animation industry, particularly for creating realistic and lifelike animations for movies and video games.
Comparison with other file formats
Filmbox (FBX)
BVH files are often used in conjunction with software applications that support the format, including Blender, Maya, and MotionBuilder.
FBX files are compatible with a wide range of software applications, including Autodesk products, Unity, and Unreal Engine.
BVH files are limited to animation data capture and do not include other scene information.
FBX files offer a wider range of animation features, including support for animation events, several animation tracks, and curves.
BVH files are comparatively smaller in size compared to FBX files.
FBX offers more control and flexibility at the expense of additional complexity and file size.
See also
List of motion and gesture file formats
Animation software
Computer file formats
|
https://en.wikipedia.org/wiki/DUALabs
|
DUALabs (National Data Use and Access Laboratories) was the name of an American company that created and disseminated microdata and aggregate data files for the 1960 and 1970 censuses.
Overview
The DUALabs 1960 census microdata file was noteworthy because it was designed to compatible with data from the 1970 census, allowing easy analysis of economic and demographic change between 1960 and 1970. The compatible DUALabs microdata inspired the Integrated Public Use Microdata Series which provides compatible census microdata for the period since 1850.
DUALabs used a proprietary compression algorithm to compress the 1960 and 1970 census data under NSF grant 7249358 to the Center for Research Libraries. DUALabs also received funding for the project from the Ford Foundation and NICHD (Contract 72-2707). This algorithm made wide dissemination of massive census files feasible for the first time. After DUALabs declared bankruptcy in the early 1980s, however, some data became inaccessible because the decompression software was not generally available to researchers. All DUALabs census data are now recovered, however, and are available through the National Historical Geographic Information System and the Integrated Public Use Microdata Series.
The company was headed by former Census Bureau employee Jack Beresford (1931–1996), who had worked on the compilation of the 1960 census, and the company headquarters was in Rosslyn, Virginia.
Other persons associated with this project were Gary Hill who was an employee of DUALabs and subsequently an employee of Donnelly Marketing (Stamford, CT) and CACA in Rosslyn, VA. Also, private sector organizations were members of DUALabs and Spindletop Research, Inc., Lexingon, Kentucky was a member. William (Bill) Davenall, retired, Esri of Redlands, California as their Global Manager of Health and Human Services) and was a professional researcher employed at Spindletop Research (a 501(c)3 associated with the University of Kentucky and the Commonwealth of Kentucky at the inception of DualLabs. (4)2012
Footnotes
(4) William F Davenhall, Esri, Redlands, California, 2012
References
Ginda, Thomas. Old Census, New Twist; Four Area Districts, Mar 29, 1970. pg. E1
Jacobs, Sanford. "Data Analyst Sues to Save Program Priced at $8,000, Vs. U.S.'s $110 Tag", Dec 18, 1981. p. 25.
Ruggles, Steven, The Minnesota Population Center Data Integration Projects: Challenges of Harmonizing Census Microdata Across Time and Place 2005 Proceedings of the American Statistical Association, Government Statistics Section, Alexandria, VA: American Statistical Association, pp. 1405–1415
Defunct companies based in Virginia
|
https://en.wikipedia.org/wiki/Optical%20performance%20monitoring
|
Optical performance monitoring (OPM) is used for managing high capacity dense wavelength-division multiplexing (DWDM) optical transmission and switching systems in Next Generation Networks (NGN). OPM involves assessing the quality of data channel by measuring its optical characteristics without directly looking at the transmitted sequence of bits. It is a potential mechanism to improve control of transmission and physical layer fault management in optical transmission systems.
In optical communications, typical roles for optical performance monitoring include ensuring correct switching in reconfigurable optical add-drop multiplexers, setting levels for dynamic equalization of the gain of optical amplifiers, and providing system alarms and error warning for lost or out of specification optical channels.
The optical component used for this purpose in DWDM networks is known as optical performance monitor (OPM) or optical channel monitor (OCM), which measures channel power, wavelength, and optical signal-to-noise ratio (OSNR) for each channel.
References
D. C. Kilper, R. Bach, D. J. Blumenthal, D. Einstein, T. Landolsi, L. Ostar, M. Preiss, and A. E. Willner, "Optical performance monitoring," J. Lightwave Technol. 22, 294– (2004).
Journal of Optical Networking: Virtual special issue on optical performance monitoring.
Network management
Fiber-optic communications
|
https://en.wikipedia.org/wiki/Chaenostoma%20cordatum
|
Chaenostoma cordatum, also known as Sutera cordata, Bacopa cordata, Sutera diffusus, or Bacopa (not the genus Bacopa), is one of 52 species in the genus Chaenostoma (Scrophulariaceae), and is native to South Africa.
Taxonomy
Chaenostoma cordatum was first named in 1835 by Sir William Jackson Hooker. The synonym Sutera cordata originated from Otto Kuntze in 1891.
Distribution and habitat
Chaenostoma cordatum lives predominately on the southern coast of South Africa, where it had originated.
Cultivation
Chaenostoma cordatum is a short-lived evergreen perennial for zones 9-11. It grows annually in colder climates, but requires full sun to flower profusely. Other cultivars include 'Bridal Showers', 'Snowflake', 'Giant Snowflake', and 'Pink Domino'.
The Pikmin Flower
A new cultivar of Bacopa, trademarked Bacopa 'Cabana®' in a collaboration between Nintendo of America and Syngenta Seed's Flower Brand, was the subject of a marketing campaign for the 2001 video game Pikmin. The name "Pikmin Flower" was coined in this campaign, due to the resemblance of the flowers that bloom from the heads of fully matured Pikmin species in the video games. While some claims reported Bacopa 'Cabana®' as an entirely new species or subspecies created by Nintendo, the plant is actually a selectively bred cultivar of the existing species, emphasizing specific traits for ornamental purposes. Peter Main, then executive vice president of sales and marketing for Nintendo of America, said that the flower "demonstrates that at the core of Nintendo is creativity". In April 2002, seeds of the flower were released to the public.
See also
Bacopa
References
External links
Chaenostoma cordatum on Pikipedia
Scrophulariaceae
Pikmin
|
https://en.wikipedia.org/wiki/Ishar%20%28disambiguation%29
|
Ishar is a series of three role-playing computer games by Silmarils.
Ishar may also refer to:
Ishar Bindra (born 1921), Indian American investor, entrepreneur and philanthropist
Ishar Singh (1895–1963), Indian soldier and Victoria Cross recipient
Ishar Singh (poet) (1892–1966), Punjabi satirical poet
Ishar Singh (Sikh prince) (1802–1804), prince of the Sikh Empire
Ishar Singh Marhana (1878–1941), Indian activist and revolutionary
Ishtup-Ishar, king of the second Mariote kingdom who reigned c. 2400 BC
See also
Ishara (disambiguation)
Ishtar (disambiguation)
|
https://en.wikipedia.org/wiki/USB%20human%20interface%20device%20class
|
In computing, the USB human interface device class (USB HID class) is a part of the USB specification for computer peripherals: it specifies a device class (a type of computer hardware) for human interface devices such as keyboards, mice, game controllers and alphanumeric display devices.
The USB HID class is defined in a number of documents provided by the USB Implementers Forum's Device Working Group. The primary document used to describe the USB HID class is the Device Class Definition for HID 1.11.
Devices
The USB HID class describes devices used with nearly every modern computer. Many predefined functions exist in the USB HID class. These functions allow hardware manufacturers to design a product to USB HID class specifications and expect it to work with any software that also meets these specifications.
The same HID protocol is used unmodified in Bluetooth human interface devices. The Bluetooth profile specification only points readers to the USB HID documentation. In this sense those devices also belong to the USB HID class.
Keyboards
Keyboards are a common kind of USB HID class device. The USB HID class keyboard is normally designed with an IN endpoint that communicates keystrokes to the computer and an OUT endpoint that communicates the status of the keyboard's LEDs from the computer to the keyboard. The PC 97 standard requires that a computer's BIOS must detect and work with USB HID class keyboards that are designed to be used during the boot process.
Some keyboards implement the USB Boot Keyboard profile specified in the USB Device Class Definition for Human Interface Devices (HID) v1.11 and are explicitly configured to use the boot protocol. These are limited to 6-key rollover (6KRO) and will interrupt the CPU every time the keyboard is polled (even if there is no state change) unless the USB controller is programmed to tell the keyboard to respond with negative acknowledgments, which the USB controller discards in hardware without interrupting the CPU, when there are no state changes to report. This profile is intended to allow the BIOS to handle a USB keyboard in the absence of a USB-aware operating system. The recommended profile for keyboards that are not in boot mode in this specification limits keyboards to 6KRO and causes them to respond to an interrupt with a status report at least every half second (again, even if there is no state change) in order to implement typematic (repeating the scancode when the key is pressed long enough) unless the USB controller is programmed to tell the keyboard to reply with negative acknowledgments whenever there are no state changes to report. However, keyboards in non-boot mode are free to implement an alternative HID profile.
The above-mentioned behavior is in contrast to the PS/2 (not to be confused with PlayStation 2) interface, which supports n-key rollover (NKRO) for keyboards capable of supporting it.
Mouse
Computer mouse is another common USB HID class device. USB HID mice can
|
https://en.wikipedia.org/wiki/Vincent%20Square
|
Vincent Square is a grass-covered square in Westminster, London, England, covering 13 acres, lined with mature trees including London Planes. In among a network of backstreets, it chiefly provides playing fields for Westminster School, who own it absolutely; otherwise, it functions as a green lung and a view for the homes, hotel and other organisations adjoining. Nine of its adjoining buildings have been given strict statutory architectural recognition and protection.
History and use
It was appropriated in the 18th century on land originally known as Tothill Fields, by William Vincent, a former Dean of Westminster and headmaster of Westminster School who simply paid a man with a horse and plough to enclose the square with a mound and ditch. Previous uses include a death camp and cemetery for 1,200 Scottish prisoners starved to death after the Battle of Worcester in 1651, a large burial pit for victims of the Great Plague of London in 1665/6, a jail named Tothill Fields Bridewell, and a well-known bear-baiting den recorded in the reign of Queen Anne. The space, facing buildings and certain others surrounding form the Vincent Square Conservation Area.
The square contains a cricket pavilion, four football pitches, about 10 tennis courts, and the groundsman's house, and is used on school weekdays by Westminster Under School. Other buildings fronting the square include the headquarters of the Royal Horticultural Society. Outside of school bookings the courts host many fixtures of the Lords and Commons Tennis Club.
Notable buildings
Numbering is from the east corner, clockwise (3 to 87) and applies to fewer than 87 buildings, from great mergers and additional road openings. Those listed in the initial, mainstream category of statutory recognition and protection ("Grade II listed") are:
№s 3 and 4.
№s 7 and 8.
Royal Horticultural Society Old Hall (designed in 1904 by Edwin James Stubbs)
№s 84 and 85. (terraced buildings of circa (about) 1800)
№s 86 (a corner house of about 1800)
At rarer, Grade II* is:
the former Westminster College
In 1981, Westminster Under School opened in the building of the former Grosvenor Hospital for Women which had closed in 1976.
Indirect use
Vincent Square lends its name to a current electoral ward of the local authority, Westminster City Council. Its bounds are thus drawn up for approximately equal representation of the electorate. At the 2011 Census its population was 9,988.
Notable residents
Charles Hamilton Fasson
Robert Jenrick
Robert Vansittart, 1st Baron Vansittart
Richard Crossman
James Watson
Harold Wilson
Duncan Sandys
See also
List of eponymous roads in London
References
External links
LondonTown.com information
Cricket Pavilion, Vincent Square photograph on Flickr
Squares in the City of Westminster
Westminster School
|
https://en.wikipedia.org/wiki/Ninja%20Senshi%20Tobikage
|
, known as Ninja Robots outside Japan, is a Japanese anime television series, produced by Pierrot, which aired from 6 October 1985 to 13 July 1986 on the Nippon Television network. It was also broadcast to parts of Asia and Australia on Cartoon Network, but never aired in the United States.
Plot
It is the 23rd century and the earthlings have colonized Mars and the Moon. Much like the legendary convicts in Australia during the 18th and 19th century, the settlers of Mars consist mostly of convicts from Earth. The Martian colony is run by a dictatorial Commander Hazzard Pascha, who tests every settler on whether they should serve in the military or become a laborer.
Joe Maya is a 16-year-old who lives on Mars and dreams of returning to Earth. He has two friends: Mike Coil and Jenny Ai. When escaping from the Martian military police, Joe and Mike stumble upon a crashed spaceship, the Xenos 5, being attacked by huge robots. In his attempt to escape chasing robots, Joe gets into the spaceship where he encounters three human-looking aliens: the beautiful Princess Romina, her willowy attendant Jade, and a young General Icelander. A robot locates them and the three aliens hide, leaving Joe to fend for himself. Joe tries hiding in a pile of glowing metal, which turns out to be a ninja robot named Black Lion. The battle leads outside the ship where a mysterious ninja robot Cybertron suddenly appears when the Black Lion struggles. It wipes out several enemy robots before merging with Joe's robot, transforming into a mechanical lion that destroys the remaining attackers.
After the attack, Joe, Mike, and Jenny are forcibly taken to the alien spaceship. It transpires that the aliens are from the planet Ladorio (also romanized as "Radorio") in a distant galaxy (Andromeda, also "Black Star Galaxy" in the English version), and are at war with the Zaboom army who captured their planet. They came to the Milky Way seeking ninjas who could operate their three ninja robots. Joe, Mike, and Jenny agree to help them for a variety of reasons. Along the way, as they fend off the constant attacks by the Zaboom army and their allies, they make new friends and enemies, while Cybertron looms mysteriously in the background.
Characters
Humans
,
Joe is a 16-year-old boy who lives with his father (a construction worker) on Mars at the beginning of the series. He lost his mother when he was young, but often reminisces about the beauty of Earth. He is rebellious (especially against authority), quick-tempered, insensitive, and impulsive, the opposite of his father, who is calm and thoughtful. His nonattendance at the compulsory military exam leads to him and Mike being chased by the military police into the area where the spaceship crash lands.
At first, Joe attempts to leave his friends in order to go after Hazzard, but they support him when Hazzard imprisons his father and Jenny's parents. He is the first to discover and operate one of the three ninja robots: the Black Li
|
https://en.wikipedia.org/wiki/Algorithmic%20art
|
Algorithmic art or algorithm art is art, mostly visual art, in which the design is generated by an algorithm. Algorithmic artists are sometimes called algorists.
Overview
Algorithmic art, also known as computer-generated art, is a subset of generative art (generated by an autonomous system) and is related to systems art (influenced by systems theory). Fractal art is an example of algorithmic art.
For an image of reasonable size, even the simplest algorithms require too much calculation for manual execution to be practical, and they are thus executed on either a single computer or on a cluster of computers. The final output is typically displayed on a computer monitor, printed with a raster-type printer, or drawn using a plotter. Variability can be introduced by using pseudo-random numbers. There is no consensus as to whether the product of an algorithm that operates on an existing image (or on any input other than pseudo-random numbers) can still be considered computer-generated art, as opposed to computer-assisted art.
History
Roman Verostko argues that Islamic geometric patterns are constructed using algorithms, as are Italian Renaissance paintings which make use of mathematical techniques, in particular linear perspective and proportion.
Some of the earliest known examples of computer-generated algorithmic art were created by Georg Nees, Frieder Nake, A. Michael Noll, Manfred Mohr and Vera Molnár in the early 1960s. These artworks were executed by a plotter controlled by a computer, and were therefore computer-generated art but not digital art. The act of creation lay in writing the program, which specified the sequence of actions to be performed by the plotter. Sonia Landy Sheridan established Generative Systems as a program at the School of the Art Institute of Chicago in 1970 in response to social change brought about in part by the computer-robot communications revolution. Her early work with copier and telematic art focused on the differences between the human hand and the algorithm.
Aside from the ongoing work of Roman Verostko and his fellow algorists, the next known examples are fractal artworks created in the mid to late 1980s. These are important here because they use a different means of execution. Whereas the earliest algorithmic art was "drawn" by a plotter, fractal art simply creates an image in computer memory; it is therefore digital art. The native form of a fractal artwork is an image stored on a computer –this is also true of very nearly all equation art and of most recent algorithmic art in general. However, in a stricter sense "fractal art" is not considered algorithmic art, because the algorithm is not devised by the artist.
In light of such ongoing developments, pioneer algorithmic artist Ernest Edmonds has documented the continuing prophetic role of art in human affairs by tracing the early 1960s association between art and the computer up to a present time in which the algorithm is now widely recognized as a
|
https://en.wikipedia.org/wiki/DISCUS
|
DISCUS, or distributed source coding using syndromes, is a method for distributed source coding. It is a compression algorithm used to compress correlated data sources. The method is designed to achieve the Slepian–Wolf bound by using channel codes.
History
DISCUS was invented by researchers S. S. Pradhan and K. Ramachandran, and first published in their
paper "Distributed source coding using syndromes (DISCUS): design and construction",
published in the IEEE Transactions on Information Theory in 2003.
Variations
Many variations of DISCUS are presented in related literature. One such popular scheme is the Channel Code Partitioning scheme, which is an a-priori scheme, to reach the Slepian–Wolf bound. Many papers illustrate simulations and experiments on channel code partitioning using the turbo codes, Hamming codes and irregular repeat-accumulate codes.
See also
Modulo-N code is a simpler technique for compressing correlated data sources.
Distributed source coding
External links
"Distributed source coding using syndromes (DISCUS): design and construction" by Pradhan, S.S. and Ramchandran, K.
"DISCUS: Distributed Compression for Sensor Networks"
Distributed Source Coding can also be implemented using Convolutional Codes or using Turbo Codes
Information theory
Wireless sensor network
|
https://en.wikipedia.org/wiki/Fill%20character
|
In computer terminology, a fill character is a character transmitted solely for the purpose of consuming time. It does this by filling a timeslot on a data transmission line which would otherwise be forced to be idle (empty). In this way, fill characters provide a simple way of timing required idle times.
Fill characters are usually used in response to some real-world limitation. For example, mechanical computer printers such as the earliest dot matrix printers may have been able to print 30 characters per second, but when a "carriage return" character was received and the printhead began returning to the left margin, there was a noticeable delay before the printing of the next line could begin. Unlike modern printers, these early printers contained essentially no buffering, nor did they do any handshaking, so there would be no place to store the characters which would be received while the printhead was in the process of returning to the left margin, nor any way to tell the sender to temporarily stop transmitting characters. Instead, one or more fill characters would be transmitted to cover this time.
In its strictest definition, fill characters cause no action to be performed at all; they simply consume time. The ASCII "null" character is commonly used for this purpose. In actual practice with printers, though, one of the time slots that would otherwise contain a fill character was usually used to contain the "line-feed" character that caused the paper to advance by one line. For some printers (such as teleprinters), this was all the "filling" that was needed.
As described above, printers commonly required fill characters when the carriage was returned to the left margin. With other equipment, fill characters were occasionally required in other circumstances. For example the VT05 video terminal sometimes required fill characters when a "scroll up" operation was performed; the process of shuffling data in the shift register memory of the VT05 was slow.
In a similar fashion, communications protocols often require fill characters at points when processing must be performed.
Digital typography
|
https://en.wikipedia.org/wiki/Alternatives
|
Founded in 1994, Alternatives, Action and Communication Network for International Development, is a non-governmental, international solidarity organization based in Montreal, Quebec, Canada.
Alternatives works to promote justice and equality amongst individuals and communities worldwide. Active in over 35 countries, Alternatives supports local, community-based initiatives working towards the greater economic, social, and political rights of people and communities affected by poverty, discrimination, exploitation, and violence.
The organization publishes the Le Journal des Alternatives newsletter, a publication inserted every three months in Montreal's French paper Le Voir. Alternatives also publishes the Alternatives International Journal, a monthly publication in English distributed electronically.
Alternatives Montreal is the headquarters of an International Federation consisting of nine NGOs spread across the world. Alternative-Niger, Alternatives Asia (New Delhi), Alternative Information Center (Jerusalem), Forum Macrocain des Alternatives Sud, Initiative Pour un Autre Monde, Institut Alternatives Terrazul, Khanya College, and Teacher Creativity Center.
Vision
Alternatives knows that, through the development of sustainable societies, another world is possible. This belief is grounded in the engagement, experience, and values of Alternatives' members and the social movements to which they belong.
• In this world, women, men and children will live in dignity and respect, and will equitably share the power and resources they need to live and thrive.
• In this world, the diversity of peoples and persons will be respected, as will the human, civil, economic, social, and cultural rights of all of its inhabitants.
• In this world, solidarity, cooperation, respect for the environment, participatory democracy, and peace will be the pillars that hold it aloft.
• In this world, founded upon sustainable, just, and democratic social and economic development, construction has already begun at a local, national, and global level.
Mission statement
Alternatives' mission statement (2009) reads: "Strengthened by our vision and national and international experience, Alternatives is an organization that works for solidarity, justice, and equity the world over. Alternatives' aim is to help the networking, building, and promoting of innovative initiatives in popular and social movements that are fighting for economic, social, political, cultural and environmental rights."
The organization says that it wants to "strengthen citizen action and reinforce the contribution of social movements in the construction of sustainable societies."
International program
Alternatives is present in Latin America, Africa, Europe and the Middle East, as well as Central, South and Southeast Asia.
Alternatives Montreal is the headquarters of a federation consisting of nine NGOs spread across the world. Alternative-Niger, Alternatives Asia (New Delhi), Alternative Informatio
|
https://en.wikipedia.org/wiki/Regional%20sports%20network
|
A regional sports network (RSN) in the United States and Canada is a television channel that presents sports programming to a local media market or geographical region.
Some RSNs originated as premium channels. Since the 1990s, they have commonly been distributed through the expanded basic tiers of cable television and IPTV services. Direct broadcast satellite providers may require subscribers to purchase a higher programming tier or a specialized sports tier to receive local and out-of-market regional sports networks.
Overview
Viewership and advertising revenue on RSNs are highest during live broadcasts of professional and collegiate sporting events. These broadcasts are often the source content for out-of-market sports packages. During the rest of the day, these channels show news programs covering local and national sports, magazine and discussion programs relating to a team or collegiate conference, fishing and hunting programs, and in-studio video simulcasts of sports radio programs. RSNs also rerun sports events from the recent and distant past. Some RSNs air infomercials. In the United States, DirecTV offers all regional sports networks to all subscribers across the country, but live games and other selected programs are blacked out outside their home markets.
Regional sports networks are generally among the most expensive channels carried by cable television providers. A typical RSN, , carries a monthly retransmission fee of $2 to $3 per subscriber, lower than the rates providers charge to carry ESPN and premium channels but higher than the rates for other cable networks. RSNs justify these high prices by citing demand for the local sports teams they carry, particularly those in Major League Baseball, the National Basketball Association and the National Hockey League, as well as college teams that have large and loyal fanbases. Carriage disputes between distributors and RSNs are often controversial and protracted. Since 2013, television providers such as Charter Spectrum and Verizon FiOS have charged customers a "regional sports network fee" as a separate item on their bills. In response to high and increasing surcharges for RSNs and local broadcast channels, on March 22, 2023, FCC chairwoman Jessica Rosenworcel announced a proposal to require television providers to advertise only "all-in" pricing, including all programming fees.
In Canada, Sportsnet operates four regional sports networks, and the otherwise nationally distributed TSN also maintains some regional operations. This differs from the operational structure of RSNs in the United States, which are independently operated from national sports networks.
Some sports teams own some or all of their respective RSNs. For example, the New York Rangers and New York Knicks have long co-owned their RSN, MSG; they also have purchased the rights to the Rangers' local rivals, the New York Islanders and New Jersey Devils. MSG also owns the rights to the Buffalo Sabres, but the Sabres produ
|
https://en.wikipedia.org/wiki/Source%20Code%20in%20Database
|
Source Code in Database (SCID) is a technique of code manipulation where the code is parsed and stored in a database. This allows many productivity-enhancing shortcuts which were otherwise not possible.
A drawback of SCID systems is that code with syntax errors or other code that cannot be parsed, cannot be imported into a SCID system directly. One workaround for this is to comment out code that doesn't parse correctly.
visual programming tools may store programs as databases, since specialized structure editor are required to edit visual code.
Examples
IBM VisualAge Java is an example of an integrated development environment implementing SCID features. A more recent example of Source Code in Database is CodeOntology, an open source tool and RDF database of Java source code that supports advanced SPARQL queries, such as Select recursive methods or Select methods that compute the cube root of a double.
Some other examples or discussions of SCID include:
http://www.c2.com/cgi/wiki?SourceCodeInDatabase
http://mindprod.com/project/scid.html
http://martinfowler.com/bliki/ProjectionalEditing.html
Also, Eric & Mike Hewitt from PrecisionSoftware were working on a SCID in C# in 2014 .
See also
Homoiconicity
Intentional programming
References
Integrated development environments
|
https://en.wikipedia.org/wiki/K9%20%28TV%20series%29
|
K9 is a science-fiction adventure series focusing on the adventures of the robot dog K9 from the television show Doctor Who, achieved by mixing computer animation and live action. It is aimed at an audience of 11- to 15-year-olds. A single series of the programme was made in Brisbane, Australia, with co-production funding from Australia and the United Kingdom. It aired in 2009 and 2010 on Network Ten in Australia, and on Disney XD in the UK, as well as being broadcast on other Disney XD channels in Europe. Created due to a contracting loophole that allowed production companies to make deals directly with Doctor Who creators, it was cancelled after one series due to bad reviews and low ratings.
Development
K9's co-creator, Bob Baker, had long sought to produce a television series starring the character. Indeed, in 1997 Doctor Who Magazine announced that Baker and producer Paul Tams were producing a four-part pilot series provisionally called The Adventures of K9. The magazine stated that the pilot would be filmed that year "on a 'seven-figure' budget", and that the BBC had expressed interest in purchasing the broadcast rights. However, funding proved elusive, and despite persistent rumours, the series remained in "development hell" for many years.
In 2006, Jetix Europe announced that they were "teaming up" with Baker, Tams, and London-based distributor Park Entertainment to develop a 26-part series, then titled K9 Adventures and set in space. This announcement, timed to coincide with K9's return to Doctor Who in the episode "School Reunion", was picked up in the British media and Doctor Who fan press. In 2007, Park Entertainment revealed that the main setting for the series (by then retitled K-9) would be the Platte, "an old Prairie-class spacecraft" once used for asteroid colonization. In addition to K9, the characters would include Slocum, a thirty-something "space gypsy", and Djinn, "an overactive computer module in the shape of an attractive young woman". This early premise was abandoned before production began in Australia.
Production
Each episode of K-9 is approximately 25 minutes long, made for Disney XD (formerly Jetix) and Network Ten by Stewart & Wall Entertainment, in association with London-based distribution company Park Entertainment. The project is being overseen by Baker; the television series concept was developed by Australian writers Shane Krause and Shayne Armstrong, in association with Baker and Paul Tams. Krause and Armstrong are the primary writers for the series; four episodes were written by Queensland writer Jim Noble. The series is produced by Penny Wall and Richard Stewart of Stewart & Wall Entertainment Pty Ltd, and Simon Barnes of Park Entertainment. Grant Bradley of Daybreak Pacific and Jim Howell serve as executive producers. Michael Carrington, head of animation and programme acquisitions for BBC Children's, told Broadcast that the BBC had declined the opportunity to be involved in the production of a K9 series
|
https://en.wikipedia.org/wiki/Mean%2018
|
Mean 18 is a golf video game designed by Rex Bradford with graphics by George Karalias, both of Microsmiths, and released by Accolade for MS-DOS compatible operating systems in 1986. It was ported to the Amiga, Apple IIGS, Atari ST, and Macintosh. It includes an editor allowing players to create their own courses. In 1989, Atari Corporation published a port for the Atari 7800 console. An Atari 8-bit family version was in development in 1989 but was ultimately cancelled.
Gameplay
Mean 18 includes the Augusta National and Pebble Beach and St. Andrews courses. It uses a 3-click control system, where the first click starts the swing, the second sets the power, and the third sets draw or fade.
There are Beginner and Expert difficulty options. The Expert mode has more pronounced draw and fade effects, making the timing of the third click more crucial. The player can also choose between regular and professional tees. For the Beginner mode, the program automatically recommends the best club. Using the Expert mode, the program still recommends clubs, but not necessarily the best one for the shot or places the golfer in line with the pin.
Reception
Computer Gaming World cited the practice green, the computer caddy, and course editor as reasons for preferring the Amiga version of Mean 18 to the also-"outstanding" Leader Board. Info gave the Amiga version four stars out of five, stating "If you're a golfer, you'll like Mean 18" but criticizing the "blocky IBM-style graphics. Complete Amigatization would solve a lot of the problems". Compute! listed it in May 1988 as one of "Our Favorite Games", praising the graphics, sound, realism, and course editor.
David M. Wilson and Johnny L. Wilson reviewed the game for Computer Gaming World, and stated that "This may be the ultimate professional golf simulation. Outstanding graphics and sound are its hallmarks."
The game sold more than 200,000 copies.
Reviews
Games #79
References
External links
Mean 18 at Amiga Hall of Light
1986 video games
Golf video games
Accolade (company) games
Amiga games
Apple IIGS games
Atari ST games
Atari 7800 games
Cancelled Atari 8-bit family games
DOS games
Classic Mac OS games
Video games developed in the United States
Single-player video games
Microsmiths games
|
https://en.wikipedia.org/wiki/What%20the%20Dormouse%20Said
|
What the Dormouse Said: How the Sixties Counterculture Shaped the Personal Computer Industry, is a 2005 non-fiction book by John Markoff. The book details the history of the personal computer, closely tying the ideologies of the collaboration-driven, World War II-era defense research community to the embryonic cooperatives and psychedelics use of the American counterculture of the 1960s.
The book follows the history chronologically, beginning with Vannevar Bush's description of his inspirational memex machine in his 1945 article "As We May Think". Markoff describes many of the people and organizations who helped develop the ideology and technology of the computer as we know it today, including Doug Engelbart, Xerox PARC, Apple Computer and Microsoft Windows.
Markoff argues for a direct connection between the counterculture of the late 1950s and 1960s (using examples such as Kepler's Books in Menlo Park, California) and the development of the computer industry. The book also discusses the early split between the idea of commercial and free-supply computing.
The main part of the title, "What the Dormouse Said," is a reference to a line at the end of the 1967 Jefferson Airplane song "White Rabbit": "Remember what the dormouse said: feed your head." which is itself a reference to Lewis Carroll's Alice's Adventures in Wonderland.
See also
Hackers: Heroes of the Computer Revolution
Midpeninsula Free University
Homebrew Computer Club
The Soul of a New Machine
Microserfs
Steve Jobs
Fire in the Valley
References
External links
Life Outside the Mainframe (review from Peacework)
History of computing
2005 non-fiction books
Culture in the San Francisco Bay Area
Books about California
Viking Press books
|
https://en.wikipedia.org/wiki/KHTK
|
KHTK (1140 AM) is a commercial radio station licensed to Sacramento, California. KHTK broadcasts a sports radio format as "Sactown Sports 1140" and is an affiliate of the CBS Sports Radio network. It is owned by Salt Lake City–based Bonneville International, a profit-making subsidiary of the Church of Jesus Christ of Latter-day Saints. The studios and offices are on Commerce Circle in North Sacramento, just north of the American River.
KHTK is powered at 50,000 watts, the maximum for AM radio stations in the United States. Because AM 1140 is a clear channel frequency reserved for Class A XEMR in Monterrey, Mexico, and WRVA in Richmond, Virginia, KHTK must broadcast with a directional antenna at all times to avoid interference, using a five-tower array. The transmitter is on Rising Road in Wilton, California.
KHTK is the second Sacramento AM station, after KIID, to broadcast using the HD Radio hybrid format. The signal is audible as far north as Redding, as far south as Monterey and into the suburbs of San Francisco. It is also simulcast on the third HD subchannel of sister station KNCI.
Programming lineup
Weekdays begin with "The Carmichael Dave Show with Jason Ross" in morning drive time. In middays, two CBS Sports Radio nationally syndicated shows are heard: Los Angeles-based "The Jim Rome Show" followed by The Herd with Colin Cowherd. KHTK has a local afternoon drive show featuring Nick Cattles along with Ramie Makhlouf. At night and weekends, when there is no live game scheduled, KHTK carries CBS Sports Radio shows.
KHTK serves as flagship station for Sacramento Kings NBA basketball (whose team colors are the same as the station’s logos) and UC Davis Aggies football. Also heard are Oakland Athletics baseball, Las Vegas Raiders football and San Jose Sharks hockey.
History
Early years
KHTK first signed on the air on November 12, 1926. It was randomly assigned the call sign KGDM from an alphabetic list of available call letters. The station was originally owned by Hercules Broadcasting, licensed to Stockton, California, and operating at 1130 kHz with 1,000 watts of power. Initially it was a daytimer, required to go off the air from sunset to sunrise.
Following the establishment of the Federal Radio Commission (FRC), stations were initially issued a series of temporary authorizations starting on May 3, 1927. In addition, they were informed that if they wanted to continue operating, they needed to file a formal license application by January 15, 1928, as the first step in determining whether they met the new "public interest, convenience, or necessity" standard. On May 25, 1928, the FRC issued General Order 32, which notified 164 stations, including KGDM, that "From an examination of your application for future license it does not find that public interest, convenience, or necessity would be served by granting it." However, the station successfully convinced the commission that it should remain licensed.
On November 11, 1928, t
|
https://en.wikipedia.org/wiki/Dana%20Randall
|
Dana Randall is an American computer scientist. She works as the ADVANCE Professor of Computing, and adjunct professor of mathematics at the Georgia Institute of Technology. She is also an External Professor of the Santa Fe Institute. Previously she was executive director of the Georgia Tech Institute of Data Engineering and Science (IDEaS) that she co-founded, and director of the Algorithms and Randomness Center. Her research include combinatorics, computational aspects of statistical mechanics, Monte Carlo stimulation of Markov chains, and randomized algorithms.
Education
Randall was born in Queens, New York. She graduated from New York City's Stuyvesant High School in 1984. She received her A.B. in Mathematics from Harvard University in 1988 and her Ph.D. in computer science from the University of California, Berkeley in 1994 under the supervision of Alistair Sinclair.
Her sister is theoretical physicist Lisa Randall.
Research
Her primary research interest is analyzing algorithms for counting problems (e.g. counting matchings in a graph) using Markov chains. One of her important contributions to this area is a decomposition theorem for analyzing Markov chains.
Accolades
In 2012 she became a fellow of the American Mathematical Society.
She delivered her Arnold Ross Lecture on October 29, 2009, an honor previously conferred on Barry Mazur, Elwyn Berlekamp, Ken Ribet, Manjul Bhargava, David Kelly and Paul Sally.
Publications
Clustering in interfering models of binary mixtures
References
External links
Dana Randall's website
Arnold Ross Lectures details at the AMS
Year of birth missing (living people)
Living people
Georgia Tech faculty
Stuyvesant High School alumni
Harvard University alumni
University of California, Berkeley alumni
Theoretical computer scientists
American women computer scientists
American computer scientists
20th-century American scientists
20th-century American women scientists
21st-century American scientists
21st-century American women scientists
American women academics
|
https://en.wikipedia.org/wiki/Avalsj%C3%B8en
|
Avalsjøen is a lake in the municipality of Lunner in Viken county, Norway.
See also
List of lakes in Norway
References
NVE Atlas - Norwegian Water Resources and Energy Directorate - Innsjødatabase - accessed 2020-12-19
Lakes of Viken (county)
|
https://en.wikipedia.org/wiki/Parks%E2%80%93McClellan%20filter%20design%20algorithm
|
The Parks–McClellan algorithm, published by James McClellan and Thomas Parks in 1972, is an iterative algorithm for finding the optimal Chebyshev finite impulse response (FIR) filter. The Parks–McClellan algorithm is utilized to design and implement efficient and optimal FIR filters. It uses an indirect method for finding the optimal filter coefficients.
The goal of the algorithm is to minimize the error in the pass and stop bands by utilizing the Chebyshev approximation. The Parks–McClellan algorithm is a variation of the Remez exchange algorithm, with the change that it is specifically designed for FIR filters. It has become a standard method for FIR filter design.
History of optimal FIR filter design
In the 1960s, researchers within the field of analog filter design were using the Chebyshev approximation for filter design. During this time, it was well known that the best filters contain an equiripple characteristic in their frequency response magnitude and the elliptic filter (or Cauer filter) was optimal with regards to the Chebyshev approximation. When the digital filter revolution began in the 1960s, researchers used a bilinear transform to produce infinite impulse response (IIR) digital elliptic filters. They also recognized the potential for designing FIR filters to accomplish the same filtering task and soon the search was on for the optimal FIR filter using the Chebyshev approximation.
It was well known in both mathematics and engineering that the optimal response would exhibit an equiripple behavior and that the number of ripples could be counted using the Chebyshev approximation. Several attempts to produce a design program for the optimal Chebyshev FIR filter were undertaken in the period between 1962 and 1971. Despite the numerous attempts, most did not succeed, usually due to problems in the algorithmic implementation or problem formulation. Otto Herrmann, for example, proposed a method for designing equiripple filters with restricted band edges. This method obtained an equiripple frequency response with the maximum number of ripples by solving a set of nonlinear equations. Another method introduced at the time implemented an optimal Chebyshev approximation, but the algorithm was limited to the design of relatively low-order filters.
Similar to Herrmann's method, Ed Hofstetter presented an algorithm that designed FIR filters with as many ripples as possible. This has become known as the Maximal Ripple algorithm. The Maximal Ripple algorithm imposed an alternating error condition via interpolation and then solved a set of equations that the alternating solution had to satisfy. One notable limitation of the Maximal Ripple algorithm was that the band edges were not specified as inputs to the design procedure. Rather, the initial frequency set {ωi} and the desired function D(ωi) defined the pass and stop band implicitly. Unlike previous attempts to design an optimal filter, the Maximal Ripple algorithm used an exchange method tha
|
https://en.wikipedia.org/wiki/Remez%20algorithm
|
The Remez algorithm or Remez exchange algorithm, published by Evgeny Yakovlevich Remez in 1934, is an iterative algorithm used to find simple approximations to functions, specifically, approximations by functions in a Chebyshev space that are the best in the uniform norm L∞ sense. It is sometimes referred to as Remes algorithm or Reme algorithm.
A typical example of a Chebyshev space is the subspace of Chebyshev polynomials of order n in the space of real continuous functions on an interval, C[a, b]. The polynomial of best approximation within a given subspace is defined to be the one that minimizes the maximum absolute difference between the polynomial and the function. In this case, the form of the solution is precised by the equioscillation theorem.
Procedure
The Remez algorithm starts with the function to be approximated and a set of sample points in the approximation interval, usually the extrema of Chebyshev polynomial linearly mapped to the interval. The steps are:
Solve the linear system of equations
(where ),
for the unknowns and E.
Use the as coefficients to form a polynomial .
Find the set of points of local maximum error .
If the errors at every are of equal magnitude and alternate in sign, then is the minimax approximation polynomial. If not, replace with and repeat the steps above.
The result is called the polynomial of best approximation or the minimax approximation algorithm.
A review of technicalities in implementing the Remez algorithm is given by W. Fraser.
Choice of initialization
The Chebyshev nodes are a common choice for the initial approximation because of their role in the theory of polynomial interpolation. For the initialization of the optimization problem for function f by the Lagrange interpolant Ln(f), it can be shown that this initial approximation is bounded by
with the norm or Lebesgue constant of the Lagrange interpolation operator Ln of the nodes (t1, ..., tn + 1) being
T being the zeros of the Chebyshev polynomials, and the Lebesgue functions being
Theodore A. Kilgore, Carl de Boor, and Allan Pinkus proved that there exists a unique ti for each Ln, although not known explicitly for (ordinary) polynomials. Similarly, , and the optimality of a choice of nodes can be expressed as
For Chebyshev nodes, which provides a suboptimal, but analytically explicit choice, the asymptotic behavior is known as
( being the Euler–Mascheroni constant) with
for
and upper bound
Lev Brutman obtained the bound for , and being the zeros of the expanded Chebyshev polynomials:
Rüdiger Günttner obtained from a sharper estimate for
Detailed discussion
This section provides more information on the steps outlined above. In this section, the index i runs from 0 to n+1.
Step 1: Given , solve the linear system of n+2 equations
(where ),
for the unknowns and E.
It should be clear that in this equation makes sense only if the nodes are ordered, either strictly increasing or strictly decreasing. Then th
|
https://en.wikipedia.org/wiki/Minimax%20approximation%20algorithm
|
A minimax approximation algorithm (or L∞ approximation or uniform approximation) is a method to find an approximation of a mathematical function that minimizes maximum error.
For example, given a function defined on the interval and a degree bound , a minimax polynomial approximation algorithm will find a polynomial of degree at most to minimize
Polynomial approximations
The Weierstrass approximation theorem states that every continuous function defined on a closed interval [a,b] can be uniformly approximated as closely as desired by a polynomial function.
For practical work it is often desirable to minimize the maximum absolute or relative error of a polynomial fit for any given number of terms in an effort to reduce computational expense of repeated evaluation.
Polynomial expansions such as the Taylor series expansion are often convenient for theoretical work but less useful for practical applications. Truncated Chebyshev series, however, closely approximate the minimax polynomial.
One popular minimax approximation algorithm is the Remez algorithm.
References
External links
Minimax approximation algorithm at MathWorld
Numerical analysis
|
https://en.wikipedia.org/wiki/Jack%20Curry
|
Jack F. Curry is an American sports commentator. He has worked in television for the YES Network since 2010, providing analysis of New York Yankees baseball games during pregame and postgame shows. He was part of YES's Emmy Award-winning Yankee coverage in 2011. He is also a columnist for Yesnetwork.com.
Until 2009, he was a journalist, most recently as national baseball correspondent for The New York Times. Before taking over that position, he was the newspaper's beat writer covering the Yankees. He worked at The New York Times for 22 years.
Author
In 2000, Curry co-wrote a book with Derek Jeter titled The Life You Imagine: Life Lessons for Achieving Your Dreams. The book was a N.Y. Times best-seller and sold more than 150,000 copies.
In 2019, Curry co-wrote a book with David Cone titled “Full Count: The Education of a Pitcher”.
Television and radio
Before joining YES, Curry was guest on local New York sports programs such as WFAN's "Mike and the Mad Dog" radio program. He has been seen nationally on networks such as ESPN and MSNBC.
Curry currently works for the YES Network.
Personal
Curry graduated in 1982 from Hudson Catholic Regional High School in Jersey City. Curry was invited to a Hudson Catholic event on May 12 as a guest speaker. On April 23, Curry was inducted into the school's hall of fame.
Curry earned a bachelor's degree in Communications from Fordham University in 1986. Curry and his wife Pamela reside in River Vale, New Jersey.
As discussed on radio interviews and his news blog, he has competed in the New York City marathon.
References
External links
Major League Baseball broadcasters
Fordham University alumni
The New York Times sportswriters
YES Network
Living people
1964 births
People from River Vale, New Jersey
Writers from Jersey City, New Jersey
American male journalists
WFUV people
|
https://en.wikipedia.org/wiki/SGD%20%28disambiguation%29
|
SGD is the ISO 4217 code of the Singapore dollar, the currency of Singapore.
SGD or sgd can also mean:
Saccharomyces Genome Database, a yeast database
Sargodha, a Pakistani city
Secure global desktop, software by Tarantella, subsequently bought and used by Sun Microsystems and by Oracle Corporation
SG Dynamo Dresden, a German association-football club
Sliding glass door, a type of sliding door
Smart Grid Device, an electronic device for smart grids
Sønderborg Airport (IATA code SGD)
Spanish Gangster Disciples, an American gang
Speech-generating device, an electronic augmentative and alternative communication systems
Stars Go Dim, an American pop-rock band
Stochastic gradient descent, an optimization algorithm
Submarine groundwater discharge, freshwater aquifer seepage into oceans
Surigaonon language, based on its ISO 639-3 code sgd
Sustainable Development Goals, a global development framework created in 2015 by the United Nations General Assembly
|
https://en.wikipedia.org/wiki/Sound%20of%20Hope
|
Sound of Hope (SOH) is an international Chinese-language radio network. Along with New Tang Dynasty Television and The Epoch Times, it is part of a network of media organizations established by practitioners of the Falun Gong new religious movement. SOH serves the Chinese diaspora in US, Europe, Australia, Japan and South Korea via AM/FM radio and Chinese people in China via shortwave radio.
Stations and programs
SOH Network radio programs are primarily in Chinese (Mandarin and Cantonese).
SOH is headquartered in San Francisco, California, and has two main operations. One serves Chinese Americans in the U.S. via AM/FM and the other serves China via shortwave radio. Each operation produces its own content for its audience.
The US radio started from KSQQ FM 96.1, KVTO AM 1400 during afternoon and evening hours and has grown to be the largest Chinese radio in the region, adding KQEA-LP/KQEB-LP (96.9 FM, two time-shared licenses) as affiliated stations. It provides news and lifestyle talkshows relating to local expatriate Chinese, and covers issues such as elections, local policy debates, California droughts, Cupertino city redevelopment, and the COVID-19 pandemic.
The US radio also provides network programming to 14 affiliated Chinese-language FM radios.
The China radio broadcasts to mainland China through more than 100 shortwave stations. Programs of SOH can also be listened to via online streaming and mobile apps.
SOH also produces YouTube video programs. The YouTube channel “Jiangfeng Time” had more than half a million subscribers as of 2020. SOH teamed with Epoch Times editor John Nania to start the right-wing news website America Daily at americadaily.com.
Sound of Hope has launched iPhone and Android apps for users to listen to programs.
Relationship to Falun Gong
The Sound of Hope radio network was co-founded by Sean Lin and Allen Zeng. The network united local radio stations that had been founded by Falun Gong practitioners. It is one of a number of media outlets, such as The Epoch Times and NTDTV, started by Falun Gong practitioners who emigrated to the West.
Most of its initial staff were Falun Gong adherents who volunteered their time and services. It was the last of the three media to be established, beginning operations in June 2003, supported by a network of volunteers that continue to maintain the station's programming. In 2005, the San Francisco Chronicle reported that the boards, including Allen Zeng and its reporting staffs of 20, were composed of Falun Gong practitioners.
References
External links
Sound of Hope Radio Network
America Daily
Nine Commentaries
Youtube Channel
Falun Gong
Radio networks
Anti-communist organizations
|
https://en.wikipedia.org/wiki/Iran%20TV%20Network%20%28Canada%29
|
Iran TV Network (ITN) is a Canadian exempt Category B Persian language specialty channel. It is wholly owned by Ethnic Channels Group with its name and programming used under license from the American-based TV channel Iran TV Network.
ITN is a general entertainment service, it airs programming aimed at the entire family including news, dramas, reality series, music, sports and more.
History
In November 2004, Ethnic Channels Group was granted approval from the Canadian Radio-television and Telecommunications Commission (CRTC) to launch a television channel called Persian/Iranian TV, described as "a national ethnic Category 2 specialty programming undertaking devoted to providing programming primarily to the Persian-, Azeri-, Kurdish-, Armenian- and Assyrian-speaking communities."
The channel was launched in early 2006 as Iran TV Network (ITN) and featured programming from US-based channel, Iran TV Network. In early 2010, the channel was renamed Jaam-e-Jam and began featuring programming from Jaam-e-Jam International in Iran. In May 2015, the channel was renamed 'Iran TV Network' once again due to loss of programming from Jaam-e-Jam.
On August 30, 2013, the CRTC approved Ethnic Channels Group's request to convert Jaam-e-Jam from a licensed Category B specialty service to an exempted Cat. B third language service.
In 2020, both Bell Fibe TV and Telus TV, the only providers that carried the channel, dropped it from their line-ups, rendering the channel no longer available. It continues to broadcast on satellite and is available throughout North America as well as parts of Europe, North Africa, Middle East and Asia.
References
External links
Iran TV Network
Defunct television networks in Canada
Iranian-Canadian organizations
Persian-language television stations
Digital cable television networks in Canada
Middle Eastern television in Canada
Multicultural and ethnic television in Canada
|
https://en.wikipedia.org/wiki/Baselining
|
Baselining is a method for analyzing computer network performance. The method is marked by comparing current performance to a "baseline" derived from past performance. If the performance of a network switch or other network components is measured over a period of time, that performance figure can be used as a comparative baseline for configuration changes.
Uses
Baselining is useful for many performance management tasks, including:
Monitoring daily network performance
Measuring trends in network performance
Assessing whether network performance is meeting requirements laid out in a service agreement
References
Network management
|
https://en.wikipedia.org/wiki/Panel%20%28computer%20software%29
|
A panel is "a particular arrangement of information grouped together for presentation to users in a window or pop-up". In ISPF, a panel is "a predefined display image that you see on a display screen". In modern multiple-document interface software a panel refers to a particular arrangement of information grouped together and presented to users docked (by default) in the user interface rather than floating in a window, pop-up or dialog box.
A panel graphical control element is commonly packaged as part of a widget toolkit (libraries that contain a collection of graphical control elements) for a graphical user interface. See toolbar and dialog box.
References
See also
GNOME Panel
Kicker (KDE)
Layout manager
Control panel (computer)
Graphical control elements
|
https://en.wikipedia.org/wiki/VLL
|
VLL may refer to:
Virtual leased line, an Ethernet-based communication over IP/MPLS networks
Visual Light Link, a component of a Lego robotics kit
Valladolid Airport's IATA code
|
https://en.wikipedia.org/wiki/IBM%20OMEGAMON
|
OMEGAMON, later IBM Tivoli OMEGAMON XE, is a software family of performance monitors for IBM zEnterprise computer environments. These products were originally written, marketed, sold and maintained by Candle Corporation, which was acquired by IBM in 2004. The OMEGAMON product family provides analysis of IBM mainframe operating systems such as z/OS and z/VM and various sub-systems such as CICS, DB2 and IMS.
There are 9 products in the IBM Tivoli OMEGAMON family:
IBM Tivoli OMEGAMON XE for z/OS V5
IBM Tivoli OMEGAMON XE for CICS on z/OS V5
IBM Tivoli OMEGAMON XE for IMS on z/OS V5
IBM Tivoli OMEGAMON XE for DB2 Performance Monitor for z/OS V5
IBM Tivoli OMEGAMON XE for DB2 Performance Expert for z/OS V5
IBM Tivoli OMEGAMON XE for Mainframe Networks V5
IBM Tivoli OMEGAMON XE for Storage on z/OS V5
IBM Tivoli OMEGAMON XE for Messaging for z/OS V5
IBM Tivoli OMEGAMON XE for z/VM and Linux V4
Version 5 of the OMEGAMON family of products shipped in 2012 and included a new Enhanced 3270 User Interface with new user customization options and built-in problem solving scenarios.
The IBM® Tivoli OMEGAMON family of products provides a comprehensive performance and availability solution to allow IT operations to analyze and manage operating systems, databases or other environments. OMEGAMON is designed to detect mainframe performance problems across multiple subsystems, and allow computer operations personnel to quickly isolate and take action on those problems.
References
External links
http://www-01.ibm.com/software/tivoli/products/omegamonxeproductline/
IBM software
IBM mainframe software
|
https://en.wikipedia.org/wiki/TestDisk
|
TestDisk is a free and open-source data recovery utility that helps users recover lost partitions or repair corrupted filesystems. TestDisk can collect detailed information about a corrupted drive, which can then be sent to a technician for further analysis. TestDisk supports DOS, Microsoft Windows (i.e. NT 4.0, 2000, XP, Server 2003, Server 2008, Vista, Windows 7, Windows 8.1, Windows 10), Linux, FreeBSD, NetBSD, OpenBSD, SunOS, and MacOS. TestDisk handles non-partitioned and partitioned media. In particular, it recognizes the GUID Partition Table (GPT), Apple partition map, PC/Intel BIOS partition tables, Sun Solaris slice and Xbox fixed partitioning scheme. TestDisk uses a command line user interface. TestDisk can recover deleted files with 97% accuracy.
Features
TestDisk can recover deleted partitions, rebuild partition tables or rewrite the master boot record (MBR).
Partition recovery
TestDisk retrieves the LBA size and CHS geometry of attached data storage devices (i.e. hard disks, memory cards, USB flash drives, and virtual disk images) from the BIOS or the operating system. The geometry information is required for a successful recovery. TestDisk reads sectors on the storage device to determine if the partition table or filesystem on it requires repair (see next section).
TestDisk is able to recognize the following partition table formats:
Apple partition map
GUID Partition Table
Humax
PC/Intel Partition Table (master boot record)
Sun Solaris slice
Xbox fixed partitioning scheme
Non-partitioned media
TestDisk can perform deeper checks to locate partitions that have been deleted from the partition table. However, it is up to the user to look over the list of possible partitions found by TestDisk and to select those that they wish to recover.
After partitions are located, TestDisk can rebuild the partition table and rewrite the MBR.
Filesystem repair
TestDisk can deal with some specific logical filesystem corruption.
File recovery
When a file is deleted, the list of disk clusters occupied by the file is erased, marking those sectors available for use by other files created or modified thereafter. TestDisk can recover deleted files especially if the file was not fragmented and the clusters have not been reused.
There are two file recovery mechanisms in the TestDisk package:
TestDisk proper uses knowledge of the filesystem structure to perform "undelete".
PhotoRec is a "file carver". It does not need any knowledge of the file system, but instead looks for patterns of known file formats in the partition or disk image. It works best on unfragmented files and cannot recover the file name.
Digital forensics
TestDisk can be used in digital forensics to retrieve partitions that were deleted long ago. It can mount various types of disk images including the Expert Witness File Format used by EnCase. Binary disk images, such as those created with ddrescue can be read by TestDisk as though it were a storage device.
In TestDisk versi
|
https://en.wikipedia.org/wiki/SerDes
|
A Serializer/Deserializer (SerDes) is a pair of functional blocks commonly used in high speed communications to compensate for limited input/output. These blocks convert data between serial data and parallel interfaces in each direction. The term "SerDes" generically refers to interfaces used in various technologies and applications. The primary use of a SerDes is to provide data transmission over a single line or a differential pair in order to minimize the number of I/O pins and interconnects.
Generic function
The basic SerDes function is made up of two functional blocks: the Parallel In Serial Out (PISO) block (aka Parallel-to-Serial converter) and the Serial In Parallel Out (SIPO) block (aka Serial-to-Parallel converter). There are 4 different SerDes architectures: (1) Parallel clock SerDes, (2) Embedded clock SerDes, (3) 8b/10b SerDes, (4) Bit interleaved SerDes.
The PISO (Parallel Input, Serial Output) block typically has a parallel clock input, a set of data input lines, and input data latches. It may use an internal or external phase-locked loop (PLL) to multiply the incoming parallel clock up to the serial frequency. The simplest form of the PISO has a single shift register that receives the parallel data once per parallel clock, and shifts it out at the higher serial clock rate. Implementations may also make use of a double-buffered register to avoid metastability when transferring data between clock domains.
The SIPO (Serial Input, Parallel Output) block typically has a receive clock output, a set of data output lines and output data latches. The receive clock may have been recovered from the data by the serial clock recovery technique. However, SerDes which do not transmit a clock use reference clock to lock the PLL to the correct Tx frequency, avoiding low harmonic frequencies present in the data stream. The SIPO block then divides the incoming clock down to the parallel rate. Implementations typically have two registers connected as a double buffer. One register is used to clock in the serial stream, and the other is used to hold the data for the slower, parallel side.
Some types of SerDes include encoding/decoding blocks. The purpose of this encoding/decoding is typically to place at least statistical bounds on the rate of signal transitions to allow for easier clock recovery in the receiver, to provide framing, and to provide DC balance.
Source Synchronous Clocking
Parallel clock SerDes is normally used to serialize a parallel bus input along with data address & control signals. The serialized stream is sent along with a reference clock. The clock jitter tolerance at the serializer is 5–10 ps rms.
Embedded Clocking
An embedded clock SerDes serializes data and clock into a single stream. One cycle of clock signal is transmitted first, followed by the data bit stream; this creates a periodic rising edge at the start of the data bit stream. As the clock is explicitly embedded and can be recovered from the bit stream, the ser
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.