source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/America%27s%20Store | America's Store was a US shopping television network. It was the spin-off channel to the Home Shopping Network (HSN).
America's Store (AS) began in 1988 as the Home Shopping Club Overnight Service, which aired on broadcast stations around the US from midnight to 9 am and, in particular, on WWOR-TV from 3 am to 6 am in the New York City metro area. In 1989, HSN purchased a number of low-power TV stations and began operating the service 24 hours a day as Home Shopping SPREE. In 1997, the name was changed again to America's Jewelry Store to reflect a switch to exclusively selling jewelry. This incarnation met with limited success, so in 1998, the selection was expanded to include all of HSN's inventory categories, and the word jewelry was removed from the network's name. In 2003, AS was added to the DirecTV lineup.
The low-power TV stations owned by HSN with partners and affiliated companies were located in every major metropolitan market – including a transmitter atop the World Trade Center until the September 11 attacks on September 11, 2001.
Much of the merchandise presented by AS was distressed inventory from HSN, so the prices were usually dropped until liquidated or removed from air. On April 3, 2007, America's Store ceased broadcasting permanently, as part of new CEO Mindy Grossman's attempt to keep HSN relevant and profitable, which included the closure or sale of non-core operations.
Competitor QVC had a spin-off channel called "Q2", which lasted only two years, from 1994 to 1996. Following Barry Diller's exit from QVC and purchase of HSN, many former Q2 employees followed him to HSN and America's Store.
Hosts
Home shopping hosts that appeared on America's Store at the time of its closure, some of whom were HSN hosts at that time, included (in alphabetical order):
Liz Benbrook
Tina Berry
Alyce Caron (now only at HSN)
Bill Green (now only at HSN)
Rich Hollenberg
Brian Hyder
Lori Leland (now only at HSN as a guest product expert)
Diana Perkovic (later only at HSN, where she left on December 13, 2013)
Alan Skantz (later only at HSN, where he left in 2011)
Perry Slater
Marlo Smith (now only at HSN)
Shopping networks in the United States
Defunct television networks in the United States
Television channels and stations established in 1988
Television channels and stations disestablished in 2007
IAC (company)
1988 establishments in the United States
2007 disestablishments in the United States |
https://en.wikipedia.org/wiki/Homer%27s%20Barbershop%20Quartet | "Homer's Barbershop Quartet" is the first episode of the fifth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on September 30, 1993. It features the Be Sharps, a barbershop quartet founded by Homer Simpson. The band's story roughly parallels that of the Beatles. George Harrison and David Crosby guest star as themselves, and the Dapper Dans partly provide the singing voices of the Be Sharps.
The episode was written by Jeff Martin and directed by Mark Kirkland. The episode begins with the Simpson family as they attend a swap meet. There, Bart Simpson and his sister Lisa notice a picture of their father, Homer, on the cover of an old LP album. Homer explains to his family that he, Principal Skinner, Barney Gumble, and Apu Nahasapeemapetilon recorded a barbershop quartet album in 1985, which catapulted them to national fame. He narrates to his family the story of how the band formed, reached the pinnacle of success, and eventually folded. At the end of the episode, the group reunites to perform a concert on the roof of Moe's Tavern, singing their number-one hit "Baby on Board".
Throughout the episode, several references are made to the Beatles and other popular culture icons.
In its original American broadcast, "Homer's Barbershop Quartet" finished 30th in ratings, with a Nielsen rating of 12.7. It was praised for its Beatles cameo, despite being a leftover episode from the previous season. Reviews that criticized the episode's inconsistent humor blamed it on the change of writers before the episode's creation.
Plot
After Bart and Lisa notice Homer on the cover of an LP album for sale at Springfield's annual swap meet, Homer tells the story of how he, Principal Skinner, Barney, and Apu recorded a nationally famous barbershop quartet album.
In 1985, Homer, Skinner, Apu and Chief Wiggum entertain nightly at various Springfield community gigs, including Moe's Tavern. An agent named Nigel offers to represent the group, but only on the condition that they replace Wiggum; Homer then strands Wiggum in a forest. The band holds auditions for a fourth member (one auditioner is Wiggum, disguised as "Doctor Dolittle"), but have no luck until they hear Barney singing in an Irish tenor voice in the men's room. After their first show as a foursome, they decided to name themselves "The Be Sharps".
Homer has little luck as a songwriter until Marge buys a "baby on board" bumper sticker, inspiring him to write a song around the phrase. The song "Baby on Board" is the lead single from the group's debut album, Meet the Be Sharps, and becomes a hit. The Be Sharps perform at the Statue of Liberty's centennial in 1986 and win a Grammy Award for Outstanding Soul, Spoken Word, or Barbershop Album of the Year. At the after party, Homer meets former Beatle George Harrison. That night, Homer calls home to talk to Lisa and Marge and becomes disillusioned upon realizing how much they miss him. Creat |
https://en.wikipedia.org/wiki/Probit | In probability theory and statistics, the probit function is the quantile function associated with the standard normal distribution. It has applications in data analysis and machine learning, in particular exploratory statistical graphics and specialized regression modeling of binary response variables.
Mathematically, the probit is the inverse of the cumulative distribution function of the standard normal distribution, which is denoted as , so the probit is defined as
.
Largely because of the central limit theorem, the standard normal distribution plays a fundamental role in probability theory and statistics. If we consider the familiar fact that the standard normal distribution places 95% of probability between −1.96 and 1.96, and is symmetric around zero, it follows that
The probit function gives the 'inverse' computation, generating a value of a standard normal random variable, associated with specified cumulative probability. Continuing the example,
.
In general,
and
Conceptual development
The idea of the probit function was published by Chester Ittner Bliss in a 1934 article in Science on how to treat data such as the percentage of a pest killed by a pesticide. Bliss proposed transforming the percentage killed into a "probability unit" (or "probit") which was linearly related to the modern definition (he defined it arbitrarily as equal to 0 for 0.0001 and 1 for 0.9999):
He included a table to aid other researchers to convert their kill percentages to his probit, which they could then plot against the logarithm of the dose and thereby, it was hoped, obtain a more or less straight line. Such a so-called probit model is still important in toxicology, as well as other fields. The approach is justified in particular if response variation can be rationalized as a lognormal distribution of tolerances among subjects on test, where the tolerance of a particular subject is the dose just sufficient for the response of interest.
The method introduced by Bliss was carried forward in Probit Analysis, an important text on toxicological applications by D. J. Finney. Values tabled by Finney can be derived from probits as defined here by adding a value of 5. This distinction is summarized by Collett (p. 55): "The original definition of a probit [with 5 added] was primarily to avoid having to work with negative probits; ... This definition is still used in some quarters, but in the major statistical software packages for what is referred to as probit analysis, probits are defined without the addition of 5." It should be observed that probit methodology, including numerical optimization for fitting of probit functions, was introduced before widespread availability of electronic computing. When using tables, it was convenient to have probits uniformly positive. Common areas of application do not require positive probits.
Diagnosing deviation of a distribution from normality
In addition to providing a basis for important types of regression, the |
https://en.wikipedia.org/wiki/USA%20Cartoon%20Express | The USA Cartoon Express was a programming block consisting of animated children's series which aired on the USA Network from September 20, 1982 to September 15, 1996. Cartoon Express was the first structured animation block on cable television, predating Nickelodeon's Nicktoons and Cartoon Network by a decade.
History
In September 1982, USA Cartoon Express was announced by USA as one of six new shows on its fall schedule as the network began broadcasting 24 hours a day, 7 days a week. The Express originally aired during the early evening hours, replacing a prior block called Calliope which continued to air on Sunday mornings until 1993. Eventually, a "Sunday Cartoon Express" would debut that took up the full Sunday morning. Curt Chaplin served as the unseen "Cartoon Announcer", providing voice-overs for the block's opening, closing and commercial bumpers, continuing in this role until 1992.
Hanna-Barbera
The initial lineup consisted mostly of series from the Hanna-Barbera library. Well-known properties like Scooby-Doo, Huckleberry Hound, Yogi Bear, Space Ghost, The Smurfs, and Jonny Quest shared space with lesser-known properties like Wheelie and the Chopper Bunch, Inch High, Private Eye, Dynomutt, Dog Wonder, and countless others, as well as numerous spinoffs of The Flintstones such as The Pebbles and Bamm-Bamm Show.
By the end of the 1980s, more cartoons aired on the Cartoon Express, including Fat Albert and the Cosby Kids, He-Man and the Masters of the Universe, Jem, G.I. Joe, and The Real Ghostbusters.
In 1991, Cartoon Express premiered Voltron and Denver, the Last Dinosaur, two series from World Events Productions. In October, Turner Broadcasting purchased Hanna-Barbera and launched Cartoon Network one year later, thus taking a chunk of Cartoon Express programming with it. The only Hanna-Barbera shows on the Cartoon Express afterwards were The Smurfs and Scooby-Doo, which left the Express in 1993 and 1994 respectively.
Changes for 1993, the USA Action Extreme Team and the end of the Express
In the summer of 1993, Cartoon Express paired Denver, the Last Dinosaur with the new series Dinosaucers to capitalize on the popularity of Jurassic Park. In the fall, Cartoon Express introduced two original series, Itsy Bitsy Spider and Problem Child (based on the film franchise). Teenage Mutant Ninja Turtles became the new marquee series on the block, and USA also acquired the broadcast rights to Terrytoons shorts like Deputy Dawg and Mighty Mouse. From 1994 to 1995, several DIC Entertainment series were shown on Cartoon Express.
In 1995, USA Network premiered USA Action Extreme Team with the launch of shows based on the Street Fighter II video game franchise and Savage Dragon comic book franchise; it initially aired only on weekend mornings. The Cartoon Express left the station for the last time on September 15, 1996; the USA Action Extreme Team would inherit the Cartoon Expresss timeslots and continue for two more years before ending in late 19 |
https://en.wikipedia.org/wiki/C/C%2B%2B%20Users%20Journal | C/C++ Users Journal was a computer magazine dedicated to the C and C++ programming languages published in the United States from 1985 to 2006. It was one of the last printed magazines to cover specifically this topic (apart from ACCU's journals, which continue as printed magazines). It was based in Lawrence, Kansas.
History
The magazine started as a 16-page quarterly newsletter named BDS C Users' Group, and its target was users of Leor Zolman's BDS C compiler. Robert Ward was the volunteer coordinator of the C Users Group, which had some 150 members. The first issue of BDS C Users's Group was published on June 15, 1981. In December 1982, the name was changed to C User's Group Newsletter.
In April 1985, the first issue of a new quarterly magazine, The C Journal, was published by InfoPro Systems under the leadership of David Fiedler. Its editor in chief was Rex Jaeschke, a member of the ANSI X3J11 C Language Standard Committee.
In 1987/1988, the C User's Group Newsletter and The C Journal merged into one journal named C Users Journal. It was published by R & D Publications Inc. eight times a year with P.J. Plauger as editor. The journal had 6800 subscribers and 3000 newsstand readers.
In July 1994, the name was changed to C/C++ Users Journal. The magazine was published by CMP Media LLC . Its editor was P.J. Plauger.
In November 2001, the C/C++ Users Journal celebrated its 20th anniversary. It was published monthly at the time, had more than 43,000 readers worldwide, and contained a bimonthly Java supplement called "Java Solutions".
The magazine was discontinued in 2006 with the February issue carrying a cover letter from CMP Media informing readers that no subsequent issues would be published. The publishers offered to refund remaining subscriptions or to roll them over to another magazine, Dr. Dobb's Journal. The cover letter stated that Dr Dobb's Journal would now "feature expanded C and C++ coverage". In 2009, Dr Dobb's Journal was itself discontinued as a standalone publication and merged with InformationWeek magazine.
Past articles and source code archives for C/C++ Users Journal are still available through the Dr Dobb's Journal website.
References
External links
GCC, the GNU Compiler Collection front ends for C, C++, Objective-C, Fortran, Ada, Go, and D, as well as libraries
Source code archives
C programming language family
Defunct computer magazines published in the United States
Magazines established in 1981
Magazines disestablished in 2006
Magazines published in Kansas
Monthly magazines published in the United States
Quarterly magazines published in the United States |
https://en.wikipedia.org/wiki/Future%20GPX%20Cyber%20Formula | is a Japanese futuristic motorsports anime television series produced by the advertising agency Asatsu-DK, the Tokyo-based entertainment producer VAP (Video & Audio Project), and the animation studio Sunrise. The series originally aired between March 15 and December 20, 1991 on Nippon TV and was later followed by four OVA (Original Video Animation) series respectively titled: Double One, Zero, Saga, and Sin. These OVAs are collectively known as . The series has also been adapted into multiple games, art-books, toys, audio dramas, and novels.
Outside of Japan, the series has aired in the Philippines by ABS-CBN for Hero TV, and in Italy on Italia 1. An English-subtitled DVD boxset of the TV series has also been released by Bandai in 2003. Medialink licensed the full series across Asia-Pacific in 2021. Future GPX Cyber Formula anime series currently aired on Albanian Çufo TV and dubbed in Albanian since 2022.
Summary
Some time in the near future, Cyber Formula, an automobile race in a different category from Formula One, is gaining popularity. It features cars equipped with pollution-free engines such as hydrogen engines and room-temperature superconducting motors, and artificial intelligence for navigation. A young driver, Hayato Kazami, is accidentally registered as a driver of Asurada, a Cyber Formula machine developed by his father. He enters the Cyber Formula Grand Prix, and in seasons one and two, a cycle of setbacks and triumphs present obstacles.
The TV series, which aired in 1991, is set in 2015, and the sequel OVAs 11 (Double One) through SAGA is set in the years 2016–2020, mainly from the perspective of Sugo Asurada (later Sugo Grand Prix and Sugo Winners), one of the teams competing in the 10th-15th Cyber Formula World Grand Prix, with Hayato as the main character.
The OVA SIN is set in the 16th–17th Cyber Formula World Grand Prix in 2021–2022, and features Bleed Kaga (Jōtarō Kaga) as the main character in a fierce life-or-death struggle with Hayato, who has come to be known as the young emperor of the circuit.
Although non-canon, the 18th (2023) Cyber Formula tournament can be played in the game Future GPX Cyber Formula: Road to the Infinity 2 for PlayStation 2, and in Future GPX Cyber Formula: Road to the Infinity 3, in addition to the 18th tournament, the 19th (2024) tournament can be played in the Scenario Mode. Although the production staff of the original anime cooperated in the creation of these games, the publisher, Sunrise Interactive, has adopted the stance that these games are "non-canon sequels."
Production
Future GPX Cyber Formula was animated by Sunrise and produced by entertainment company VAP and advertising agency Asatsu-DK, and was aired on early Friday mornings from March 15 to December 20, 1991 on Nippon TV. The series was Mitsuo Fukuda's directorial debut. When the project was first planned, it was largely intended for children, and the style was that cars with artificial intelligence would run through strange |
https://en.wikipedia.org/wiki/Powerpuff%20Girls%20Z | is a 2006 Japanese anime television series directed by Megumu Ishiguro, co-produced by Cartoon Network Japan and Aniplex, and animated by Toei Animation. The anime is based on the 1998 American animated television series The Powerpuff Girls, created by Craig McCracken and produced by Cartoon Network.
The series featured character designs by Miho Shimogasa, who was the character designer of Cutie Honey Flash and Ultra Maniac and one of the animation directors of Sailor Moon. As production occurred in Japan, The Powerpuff Girls original series creator Craig McCracken was not actively involved with the project. Powerpuff Girls Z aired in Japan on TV Tokyo between July 2006 and June 2007. In addition to Cartoon Network Japan, the anime was also broadcast on AT-X. A manga adaptation by Shiho Komiyuno ran in Shueisha's Ribon magazine between July 2006 and June 2007.
The anime's English-language adaptation was produced in association with Ocean Productions in Canada. It was aired on Cartoon Network in the Philippines and Boomerang in Australia and New Zealand in 2008. Despite owning the IP rights to it, the anime series never aired on Cartoon Network or its sister channel Boomerang in the United States.
Plot summary
Professor Utonium, his son, Ken Kitazawa, and his toy dog, Peach, are busy working on Chemical X, a powerful chemical substance in Tokyo City (New Townsville in the English dub), when Peach accidentally drops a daifuku into a vat of Chemical X, which magically transforms it into Chemical Z. Countries around the world suddenly experience weather calamity, and Ken uses a light beam ray attached to the vat of Chemical Z to blast Chemical Z on an iceberg in the Tokyo City bay, causing black-and-white rays of light to appear in the skies above it.
Three ordinary 13-year-old girls, Momoko Akatsutsumi, Miyako Gōtokuji, and Kaoru Matsubara, are engulfed in white light, which transforms them into Hyper Blossom, Rolling Bubbles, and Powered Buttercup, the Powerpuff Girls Z. Peach is also engulfed in white light, transforming into a toy dog who can talk and call the girls to transform. Numerous rays of black light engulf people, animals, and objects to transform them into evil monsters who want to take over Tokyo City, such as Mojo Jojo, Fuzzy Lumpkins, Princess Himeko, Sedusa, the Gangreen Gang and the Amoeba Boys. The Powerpuff Girls Z must protect Tokyo City with the help from the Professor, Ken, Mayor Mayer and his assistant, Ms. Bellum, and use their respective weapons, including Blossom's yo-yo, Bubbles' bubble rod and Buttercup's hammer from evil monsters.
Episodes
Media
Music
The anime uses six pieces of theme music, two opening themes and four ending themes. In the English dub, an original song is used for the opening theme whilst the end credits used shortened versions of the six Japanese opening and ending themes. The official soundtrack was released in Japan by Aniplex on June 27, 2007. The soundtrack consists of TV size versions |
https://en.wikipedia.org/wiki/Donald%20B.%20Gillies | Donald Bruce Gillies (October 15, 1928 – July 17, 1975) was a Canadian computer scientist and mathematician who worked in the fields of computer design, game theory, and minicomputer programming environments.
Early life and education
Donald B. Gillies was born in Toronto, Ontario, Canada, to John Zachariah Gillies (a Canadian) and Anne Isabelle Douglas MacQueen (an American). He attended the University of Toronto Schools, a laboratory school originally affiliated with the university. Gillies attended the University of Toronto from 1946 to 1950, majoring in mathematics.
He began his graduate education at the University of Illinois and helped with the checkout of ORDVAC computer in the summer of 1951. After one year he transferred to Princeton to work for John von Neumann and developed the first theorems of core (game theory) in his PhD thesis.
Gillies ranked among the top ten participants in the William Lowell Putnam Mathematical Competition held in 1950.
Career
Gillies moved to England for two years to work for the National Research Development Corporation. He returned to the US in 1956, married Alice E. Dunkle, and began a job as a professor at the University of Illinois at Urbana-Champaign.
Starting in 1957, Gillies designed the three-stage pipeline control of the ILLIAC II supercomputer at the University of Illinois. The pipelined stages were named "advanced control", "delayed control", and "interplay". This work competed with the IBM 7030 Stretch computer and was in the public domain. Gillies presented a talk on ILLIAC II at the University of Michigan Engineering Summer Conference in 1962. During checkout of ILLIAC II, Gillies found three new Mersenne primes, one of which was the largest prime number known at the time.
Death and legacy
Gillies died unexpectedly at age 46 on July 17, 1975, of a rare viral myocarditis.
In 1975, the Donald B. Gillies Memorial lecture was established at the University of Illinois, with one leading researcher from computer science appearing every year. The first lecturer was Alan Perlis.
In 2006, the Donald B. Gillies Chair Professorship was established in the Department of Computer Science at the University of Illinois. Vikram Adve was invested as the second chair professor of the endowment in 2018. The Department of Computer Science awarded a Memorial Achievement Award to Gillies in 2011.
See also
History of computing
Largest known prime number
References
External links
Donald B. Gillies Memorial Lecture (UIUC CS Dept.), Donald B. Gillies Memorial Lecture (UIUC Math Dept.)
University of Illinois Computing Timeline
At the dawn of the space age (UIUC Astronomy Dept.)
Sputnik's Secret History Finally Revealed (AP via FOX News, October 1, 2007)
Mersenne Primes History, Theorems and Lists
Donald B. Gillies chair professorship at the University of Illinois at Urbana-Champaign
Five Mathematics PhDs granted by Donald B. Gillies, 1965-1973
Donald B. Gillies, Three New Mersenne Primes and a Statist |
https://en.wikipedia.org/wiki/Trivia | Trivia is information and data that are considered to be of little value. The word is derived from the Latin word triviae, meaning a place where a road split into two (thus, creating a three-way intersection). It was introduced into English as the adjective trivial in the 15th and 16th centuries.
Modern usage of the term trivia dates back to the 1960s, when college students introduced question-and-answer contests to their universities. A board game, Trivial Pursuit, was released in 1982 in the same vein as these contests. Since the beginning of its modern usage, trivia contests have been established at various academic levels as well as casual venues such as bars and restaurants.
Latin etymology
The ancient Romans used the word triviae to describe where one road split or forked into two roads. Triviae was formed from tri (three) and viae (roads) – literally meaning "three roads", and in transferred use "a public place" and hence the meaning "commonplace."
The Latin adjective triviālis in Classical Latin besides its literal meaning could have the meaning "appropriate to the street corner, commonplace, vulgar." In late Latin, it could also simply mean "triple."
In medieval Latin, the trivia (singular trivium) came to refer to the lower division of the Artes Liberales: grammar, rhetoric, and logic. These were the topics of basic education, and were foundational to the quadrivia of higher education: arithmetic, geometry, music, and astronomy.
English usage
The adjective trivial introduced into English in the 15th to 16th century was influenced by all three meanings of the Latin adjective:
A 15th century English translation of Ranulf Higden mentions the arte trivialle, referring to the trivium of the Liberal Arts.
The same work also calls a triuialle distinccion a threefold division. This is due to an application of the term by Arnobius, and was never common either in Latin or English.
The meaning "trite, commonplace, unimportant, slight" occurs from the late 16th century, notably in the works of Shakespeare.
Trivia was used as a title by Logan Pearsall Smith in 1902, followed by More Trivia and All Trivia in 1921 and 1933, respectively, collections of short "moral pieces" or aphorisms. Book II of the 1902 publication is headed with a quote from "Gay's Trivia, or New Art of Walking Streets of London.",
"Thou, Trivia, goddess, aid my song: Through spacious streets conduct thy bard along."
Modern usage
Trivialities, bits of information of little consequence was the title of a popular book by British aphorist Logan Pearsall Smith (1865–1946), first published in 1902 but popularized in 1918 (with More Trivia following in 1921 and a collected edition including both in 1933). It consisted of short essays often tied to observation of small things and commonplace moments. Trivia is the plural of trivium, "a public place." The adjectival form of this, trivialis, was hence translated by Smith as "commonplace."
In the 1918 version of his book Trivi |
https://en.wikipedia.org/wiki/Futuremark | Futuremark Oy was a Finnish software development company that produced computer benchmark applications for home, business, and press use. Futuremark was acquired by UL on 31 October 2014, and was formally merged into the company on 23 April 2018.
History
Prior to Futuremark, the founding team developed Final Reality, a benchmarking tool, at Remedy Entertainment, in cooperation with VNU European Labs. Following the tool's release, Futuremark was founded in Espoo in November 1997 and formally launched on 27 February 1998.
Soon after being founded the company altered its trading name to "MadOnion.com" until finally settling on "Futuremark Corporation" in 2002.
The 3DMark series has been the company's most popular and successful to date.
Futuremark's applications are distributed via the Internet as well as offline media. In addition to its benchmarking software, the company has also provided services such as IHV/ISV customised benchmarks, 3D demos as well as online and data services.
In March 2007, Futuremark launched a website specialising in news and reviews of PC games, called YouGamers.
In January 2008, Futuremark announced the formation of the Futuremark Games Studio. In August 2008, at the Leipzig Games Convention, Futuremark Games Studio announced details of its first game, Shattered Horizon.
In December 2009, Futuremark's mobile and embedded business unit was spun off and renamed Rightware.
In March 2012, Futuremark sold its game development division to Rovio Entertainment (developer of the Angry Birds franchise) for an undisclosed sum. The sale was intended to allow the company to focus on its benchmarking software.
On 31 October 2014, Futuremark was acquired by UL for an undisclosed sum.
On 23 April 2018, Futuremark was rebranded as UL Benchmarks. The Futuremark website was closed, and its content was moved to a new UL Benchmarks website. Despite the acquisition and rebranding, UL Benchmarks retains its headquarters and R&D operations in Espoo, Finland.
Products
PC benchmarks
3DMark
PCMark
Powermark
Servermark
VRMark
Smartphone and tablet benchmarks
3DMark
PCMark for Android
Cellphone benchmarks
3DMarkMobile
VGMark
SimulationMark
SPMark
Video games
Shattered Horizon (PC)
Hungribles (iOS)
Unstoppable Gorg (PC, Mac, iPad)
Other products
Peacekeeper, web browser benchmark
XL-R8R, based on 3DMark2000
Video2000, video performance benchmark
References
External links
UL Benchmarks
UL
Companies based in Espoo
Software companies of Finland
2014 mergers and acquisitions
Defunct video game companies of Finland |
https://en.wikipedia.org/wiki/Steve%20Chen%20%28computer%20engineer%29 | Steve Chen (; pinyin: Chén Shìqīng) (born 1944 in Taiwan) is a Taiwanese computer engineer and internet entrepreneur.
Chen was elected to the US National Academy of Engineering in 1991 for leadership in the development of super-computer architectures and their realization.
Life
Chen earned a BS from National Taiwan University in 1966. MS from Villanova University in 1971 and a PhD under David Kuck from the University of Illinois at Urbana-Champaign in 1975.
From 1975 through 1978 he worked for Burroughs Corporation on the design of the Burroughs large systems line of supercomputers.
He is best known as the principal designer of the Cray X-MP and Cray Y-MP multiprocessor supercomputers. Chen left Cray Research in September 1987 after it dropped the MP line.
With IBM's financial support, Chen founded Supercomputer Systems Incorporated (SSI) in January 1988.
SSI was devoted to development of the SS-1 supercomputer, which was nearly completed before the estimated $150 million investment ran out. The Eau Claire, Wisconsin-based company went bankrupt in early 1993, leaving more than 300 employees jobless.
An attempt to salvage the work was made by forming a new company, SuperComputer International (SCI), later that year. SCI was renamed Chen Systems in 1995. It was acquired by Sequent Computer Systems the following year. John Markoff, a technology journalist, wrote in the New York Times that Chen was considered "one of the nation's most brilliant supercomputer designers while working in this country for the technology pioneer Seymour Cray in the 1980s."
In 1999, Chen became founder and CEO of Galactic Computing, a developer of supercomputing blade systems, based in Shenzhen, China.
At Tonbu, Inc., his team designed and implemented the world's first fully scalable cloud computing system. A fully scalable dynamic process and application engine.
By 2005 he started to focus on grid computing to model a human brain instead.
By 2010, he was reported to be working on technology to use cloud computing to improve health care in rural China.
In 2011, he founded Information Supergrid Technologies USA.
See also
Taiwanese Americans
References
External links
Galactic Computing
1944 births
Living people
American computer businesspeople
American people of Chinese descent
Cray employees
Businesspeople in information technology
Computer designers
People from Nanping
Supercomputing in China
Taiwanese emigrants to the United States
Grainger College of Engineering alumni
Villanova University alumni |
https://en.wikipedia.org/wiki/Amazon%20Web%20Services | Amazon Web Services, Inc. (AWS) is a subsidiary of Amazon that provides on-demand cloud computing platforms and APIs to individuals, companies, and governments, on a metered, pay-as-you-go basis. Clients will often use this in combination with autoscaling (a process that allows a client to use more computing in times of high application usage, and then scale down to reduce costs when there is less traffic). These cloud computing web services provide various services related to networking, compute, storage, middleware, IoT and other processing capacity, as well as software tools via AWS server farms. This frees clients from managing, scaling, and patching hardware and operating systems.
One of the foundational services is Amazon Elastic Compute Cloud (EC2), which allows users to have at their disposal a virtual cluster of computers, with extremely high availability, which can be interacted with over the internet via REST APIs, a CLI or the AWS console. AWS's virtual computers emulate most of the attributes of a real computer, including hardware central processing units (CPUs) and graphics processing units (GPUs) for processing; local/RAM memory; hard-disk/SSD storage; a choice of operating systems; networking; and pre-loaded application software such as web servers, databases, and customer relationship management (CRM).
AWS services are delivered to customers via a network of AWS server farms located throughout the world. Fees are based on a combination of usage (known as a "Pay-as-you-go" model), hardware, operating system, software, or networking features chosen by the subscriber require availability, redundancy, security, and service options. Subscribers can pay for a single virtual AWS computer, a dedicated physical computer, or clusters of either. Amazon provides select portions of security for subscribers (e.g. physical security of the data centers) while other aspects of security are the responsibility of the subscriber (e.g. account management, vulnerability scanning, patching). AWS operates from many global geographical regions including seven in North America.
Amazon markets AWS to subscribers as a way of obtaining large-scale computing capacity more quickly and cheaply than building an actual physical server farm. All services are billed based on usage, but each service measures usage in varying ways. As of 2021 Q4, AWS has 33% market share for cloud infrastructure while the next two competitors Microsoft Azure and Google Cloud have 21%, and 10% respectively, according to Synergy Group.
Services
As of 2021, AWS comprises over 200 products and services including computing, storage, networking, database, analytics, application services, deployment, management, machine learning, mobile, developer tools, RobOps and tools for the Internet of Things. The most popular include Amazon Elastic Compute Cloud (EC2), Amazon Simple Storage Service (Amazon S3), Amazon Connect, and AWS Lambda (a serverless function that can perform arbitrary co |
https://en.wikipedia.org/wiki/DACS | DACS may refer to:
Data & Analysis Center for Software, United States Department of Defense information analysis center
De La Rue Automatic Cash System, early ATM
Describing Archives: A Content Standard, standard for describing collections
Design and Artists Copyright Society, UK copyright collecting society for visual art
Digital access and cross-connect system, telecommunications equipment in the United States
Digital Access Carrier System, telecommunications equipment in the United Kingdom
Distributed Access Control System, single sign-on and role-based access control system
Dax, Landes, a town in Nouvelle-Aquitaine, France, known in Occitan as Dacs
See also
DAC (disambiguation)
Daks (disambiguation)
Dack (disambiguation) |
https://en.wikipedia.org/wiki/NEW%20%28TV%20station%29 | NEW is a television station broadcasting in Perth, Western Australia, and is a member of Network 10. Out of the three commercial stations, NEW generally rates the lowest overall, but usually rates highest in its target demographic (people aged 16–49).
NEW broadcasts in digital television on VHF Channel 11 from Carmel, located in the Perth Hills. Its studios are located in Subiaco. NEW broadcasts reasonably good quality 1080i high definition digital programming, the second-highest quality in Perth. The callsign NEW-10 was chosen for promotional purposes when the station first launched.
The station's former studios in Dianella were formerly host to the facilities of the regional Western Australian television station WIN Television WA (from 1999 to 2007) until WIN Corporation bought out competitor STW-9 in June 2007 and moved all WA operations to their studios.
History
NEW was the last of the Ten stations in major metropolitan cities to go to air. The reason for the late launch (in comparison to other VHF 0/10 stations, which were 20 years before) was the smaller market size. Though this was true in the early days of television, it ceased to be the case in the 1980s, by which time the Perth market exceeded Adelaide in value so a situation existed where two stations in Perth shared a market as large as that of three stations in Adelaide. Because the demand for air time was high, advertising rates were higher than in Adelaide. The Perth market was therefore very profitable for the stations but was providing viewers with less choice than they had in other capital cities. The case for a new licence was made to ACMA, then the Australian Broadcasting Tribunal by Brian Treasure, one of the founders of Western Australia's first television station TVW-7 who was sacked by a hostile board in 1975. In April 1984, the Minister for Communications, Michael Duffy, called for applications for a third licence
Hearings ran from 1984 until 1986, with four applicants submitting bids. In the other corner were the existing stations, Seven outlet TVW and Nine Network outlet STW, attempting to defer or prevent the new licence from being granted. Seven and Nine were the only two commercial stations in Perth, and they wanted to keep it that way for as long as possible.
Treasure's West Coast Telecasters, funded by Kerry Stokes and Jack Bendat, was the successful applicant, defeating Western Television, in spite of Treasure being forced to resign as Chairman due to a dispute with the Australian Taxation Office. However, Treasure sold the company to Frank Lowy's Northern Star Holdings before they went to air. The reason for this was a change in government policy.
In 1985 the government had removed the two cities requirement, making it possible for networks to own more than two capital city stations. In 1986 it increased the audience reach limits for networks from 60% to 75%, meaning that for the first time a coast-to-coast network of owned and operated stations was feas |
https://en.wikipedia.org/wiki/Zoo%20%28file%20format%29 | zoo is a data compression program and format developed by Rahul Dhesi in the mid-1980s. The format is based on the LZW compression algorithm and compressed files are identified by the .zoo file extension. It is no longer widely used. Program source code was originally published on the comp.sources.misc Usenet newsgroup, and was compatible with a variety of Unix-like operating systems. Binaries were also published for the MS-DOS and AmigaOS user communities.
Zoo features
Zoo archives can store multiple "generations" of a file; if files are added to an archive with the same pathname yet more recent date, if generations are enabled for the archive the older version(s) will be retained (with a semicolon and version number, similar to version numbers in the VMS and RT-11 operating systems) as the new file is added. This allows files that are frequently modified to be backed up in such a way as to allow access to previous versions (up to the version limit chosen) from one archive.
External links
zoo 2.10 source
unzoo - zoo archive extractor, source included
Data compression
Archive formats |
https://en.wikipedia.org/wiki/Motoko%20Kusanagi | Major , or just "Major", is the main protagonist in Masamune Shirow's Ghost in the Shell manga and anime series. She is a synthetic "full-body prosthesis" augmented-cybernetic human employed as the field commander of Public Security Section 9, a fictional anti-cybercrime law-enforcement division of the Japanese National Public Safety Commission. A strong-willed, physically powerful, and highly intelligent cyberhero, she is well known for her skills in deduction, hacking and military tactics.
Conception and creation
Motoko Kusanagi's body was designed by the manga author and artist Masamune Shirow to be a mass production model so she would not be conspicuous. Her electrical and mechanical system within is special and features parts unavailable on the civilian market. Shirow intentionally chose this appearance so Motoko would not be harvested for those parts.
Character
In the 1995 anime film adaptation, character designer and key animator supervisor Hiroyuki Okiura made her different from her original manga counterpart, stating, "Motoko Kusanagi is a cyborg. Therefore, her body is strong and youthful. However her human mentality is considerably older than she looks. I tried to depict this maturity in her character instead of the original girl created by Masamune Shirow." In nearly all portrayals, Kusanagi is depicted as a self-made woman. She is a fiercely independent and capable leader who has proven herself under fire countless times.
Kenji Kamiyama had a difficult time identifying her and could not understand her motives during the first season of the anime series Ghost in the Shell: Stand Alone Complex. Due to this, he created an episode in the second season where he recounted her past. He was then able to describe her as a human who was chosen to gain this superhuman power; she probably believes that she has an obligation to use that ability for the benefit of others. English voice actor and director Mary Elizabeth McGlynn states she loved playing the role of Motoko Kusanagi and described her as "someone [who] was that strong, and still kind of feminine at times, but also kick-ass".
Abilities
Neurobiology, cybernetics and computer technology have advanced to such a point that most people possess "neuro-cyberbrains"—a technological "organic-synthetic" wetware computer user interface implant located in the suboccipital nerve region of the cranium; this allows their minds to seamlessly interact with mobile devices, machines or networks around them. The neuro-cyberbrain revolutionized education and has made training in any task simply a matter of uploading the proper data. The military uses the technology to train their soldiers into veterans within days. Civilians use it to become adept at their jobs and learn new hobbies. In some cases of extreme trauma, it is possible to replace large segments of the brain and body with prosthetic counterparts.
Major Motoko Kusanagi is one such person, living in a full-body prosthesic-chassis after an acci |
https://en.wikipedia.org/wiki/Tom%20Pepper | Tom Pepper (born August 24, 1975 in Des Moines, Iowa) is a computer programmer best known for his collaboration with Justin Frankel on the Gnutella peer-to-peer system. He and Frankel co-founded Nullsoft, whose most popular program is Winamp, which was sold to AOL in May 1999. He subsequently worked for AOL developing SHOUTcast, an Internet streaming audio service, with Frankel and Stephen "Tag" Loomis. After leaving AOL in 2004. he worked at RAZZ, Inc. He continues to collaborate with Frankel on independent projects like Ninjam.
See also
WASTE
Friend-to-friend (F2F)
File sharing
Peer-to-peer (P2P)
Gnutella
Nullsoft
Justin Frankel
References
Computer programmers
People from Des Moines, Iowa
Living people
1975 births
American chief technology officers
21st-century American businesspeople |
https://en.wikipedia.org/wiki/Old%20Main%20Line | Old Main Line may refer to:
BCN Old Main Line, a canal network (and historic company name) in Birmingham, England
BMT Lexington Avenue Line, he first standard elevated railway in Brooklyn, New York
Old Main Line Subdivision of CSX Transportation (and formerly of the Baltimore and Ohio Railroad) |
https://en.wikipedia.org/wiki/Region%205 | Region 5 or Region V can refer to:
One of DVD region codes
Region 5, Northwest Territories
One of health regions of Canada managed by Vitalité Health Network
Former Region 5 (Johannesburg), an administrative district in the city of Johannesburg, South Africa, from 2000 to 2006
One of Regions of Iran
Valparaíso Region, Chile
Bicol Region, Philippines
Region name disambiguation pages |
https://en.wikipedia.org/wiki/Region%206 | Region 6 or Region VI can refer to:
One of DVD region
East Berbice-Corentyne, Region 6 in Guyana
Region 6, Northwest Territories
One of health regions of Canada managed by Vitalité Health Network
Former Region 6 (Johannesburg), an administrative district in the city of Johannesburg, South Africa, from 2000 to 2006
O'Higgins Region, Chile
Western Visayas Region, Philippines
Region 6 War Room
Region name disambiguation pages |
https://en.wikipedia.org/wiki/Region%207 | Region 7 or Region VII can refer to:
One of DVD region
One of health regions of Canada managed by Horizon Health Network
Former Region 7 (Johannesburg), an administrative district in the city of Johannesburg, South Africa, from 2000 to 2006
Region 7 National Canoe Base
Maule Region, Chile
Central Visayas, Philippines
Northwestern Regional School District No. 7
Region name disambiguation pages |
https://en.wikipedia.org/wiki/SUPER-UX | SUPER-UX was a version of the Unix operating system from NEC that is used on its SX series of supercomputers.
History
The initial version of SUPER-UX was based on UNIX System V version 3.1 with features from BSD 4.3. The version for the NEC SX-9 was based on SVR4.2MP with BSD enhancements.
Features
SUPER-UX is a 64-bit UNIX operating system. It supports the Supercomputer File System (SFS).
Earth Simulator
The Earth Simulator uses a custom OS called "ESOS" (Earth Simulator Operating System) based on SUPER-UX. It has many enhanced features custom designed for the Earth Simulator which are not in the regular SUPER-UX OS.
See also
EWS-UX
References
External links
NEC Europe HPC
NEC Japan HPC
Official NEC SUPER-UX page, Archived 6 May 2008
UNIX System V
NEC supercomputers
Supercomputer operating systems |
https://en.wikipedia.org/wiki/Privilege%20%28computing%29 | In computing, privilege is defined as the delegation of authority to perform security-relevant functions on a computer system. A privilege allows a user to perform an action with security consequences. Examples of various privileges include the ability to create a new user, install software, or change kernel functions.
Users who have been delegated extra levels of control are called privileged. Users who lack most privileges are defined as unprivileged, regular, or normal users.
Theory
Privileges can either be automatic, granted, or applied for.
An automatic privilege exists when there is no requirement to have permission to perform an action. For example, on systems where people are required to log into a system to use it, logging out will not require a privilege. Systems that do not implement file protection - such as MS-DOS - essentially give unlimited privilege to perform any action on a file.
A granted privilege exists as a result of presenting some credential to the privilege granting authority. This is usually accomplished by logging on to a system with a username and password, and if the username and password supplied are correct, the user is granted additional privileges.
A privilege is applied for by either an executed program issuing a request for advanced privileges, or by running some program to apply for the additional privileges. An example of a user applying for additional privileges is provided by the sudo command to run a command as superuser (root) user, or by the Kerberos authentication system.
Modern processor architectures have multiple CPU modes that allows the OS to run at different privilege levels. Some processors have two levels (such as user and supervisor); i386+ processors have four levels (#0 with the most, #3 with the least privileges). Tasks are tagged with a privilege level. Resources (segments, pages, ports, etc.) and the privileged instructions are tagged with a demanded privilege level. When a task tries to use a resource, or execute a privileged instruction, the processor determines whether it has the permission (if not, a "protection fault" interrupt is generated). This prevents user tasks from damaging the OS or each other.
In computer programming, exceptions related to privileged instruction violations may be caused when an array has been accessed out of bounds or an invalid pointer has been dereferenced when the invalid memory location referenced is a privileged location, such as one controlling device input/output. This is particularly more likely to occur in programming languages such as C, which use pointer arithmetic or do not check array bounds automatically.
Criticism
Mark Miller has critiqued the framing of privilege as being poorly defined and hard to measure, and suggested that authority can be defined as the set of things a program can do, which is more helpful.
Unix
On Unix-like systems, the superuser (commonly known as 'root') owns all the privileges. Ordinary users are grant |
https://en.wikipedia.org/wiki/File%20hosting%20service | A file-hosting service, also known as cloud-storage service, online file-storage provider, or cyberlocker, is an internet hosting service specifically designed to host user files. These services allows users to upload files that can be accessed over the internet after providing a username and password or other authentication. Typically, file hosting services allow HTTP access, and in some cases, FTP access. Other related services include content-displaying hosting services (i.e. video and image), virtual storage, and remote backup solutions.
Uses
Personal file storage
Personal file storage services are designed for private individuals to store and access their files online. Users can upload their files and share them publicly or keep them password-protected.
Document-sharing services allow users to share and collaborate on document files. These services originally targeted files such as PDFs, word processor documents, and spreadsheets. However many remote file storage services are now aimed at allowing users to share and synchronize all types of files across all the devices they use.
File sync and sharing services
File syncing and sharing services allow users to create special folders on each of their computers or mobile devices, which are then synchronized across all devices. Files placed in this folder can be accessed through a website or mobile app and easily shared with others for viewing or collaboration.
Consumer products such as OneDrive and Google Drive have made file hosting and sharing more accessible and popular for personal and business use.
Content caching
Content providers who encounter bandwidth congestion issues may use specialized services for distributing cached or static content. This is especially common for companies with a major internet presence.
Backup and disaster recovery
Many businesses use file hosting services as part of their backup and disaster recovery strategies. By storing copies of important files offsite in a secure data center, they can quickly recover from data loss due to hardware failure, natural disasters, or other unexpected events.
Storage charges
Some online file storage services offer space on a per-gigabyte basis, and sometimes include a bandwidth cost component as well. Usually these will be charged monthly or yearly. Some companies offer the service for free, relying on advertising revenue. Some hosting services do not place any limit on how much space the user's account can consume. Non-paying users' accounts may be deleted or suspended after a predefined period of inactivity.
Some services require a software download which makes files only available on computers which have that software installed, others allow users to retrieve files through any web browser. With the increased inbox space offered by webmail services, many users have started using their webmail service as an online drive. Some sites offer free unlimited file storage but have a limit on the file size. Some sites offer a |
https://en.wikipedia.org/wiki/H2 | H2, H02, or H-2 may refer to:
Arts and media
Armenia 2 (H2), a private television company broadcasting in Armenia and Nagorno-Karabakh
H2 (A&E Networks), the rebranded name of the former channel History International
H2 (American TV channel), the American version of the channel
H2 (manga), a baseball manga by Mitsuru Adachi
Halo 2, a video game for the Xbox, created and developed by Bungie
Halloween II (2009 film), initially abbreviated to H2
Hollywood Squares, referred to as H2 informally during the 2002–2004 seasons
Computing
, level 2 heading markup for HTML Web pages, see HTML element#heading
H2 (database), an open-source Java SQL database-management system
DSC-H2, a 2006 Sony Cyber-shot H series camera
HTTP/2, major revision of HTTP, often abbreviated in discussions as h2, and identifying itself to other servers as h2 in TLS negotiation or h2c in the HTTP Upgrade header
LGA 1155 CPU socket, also known as Socket H2
Roads and transportation
Interstate H-2, a highway in Hawaii, located on the island of Oahu
London Buses route H2
Science and mathematics
Biology and medicine
ATC code H02 Corticosteroids for systemic use, a subgroup of the Anatomical Therapeutic Chemical Classification System
British NVC community H2, a heath community in the British National Vegetation Classification system
Histamine H2 receptor
Prostaglandin H2
H-2, the Major histocompatibility complex of the mouse (equivalent of the Human Leukocyte Antigens)
or , wide- or narrow-sense heritability
Chemistry
H2, the chemical formula for hydrogen gas (dihydrogen)
Deuterium (Hydrogen-2, H-2, 2H), the isotope of hydrogen with one proton, one neutron, and one electron
Other uses in science and mathematics
H II region, a region of interstellar atomic hydrogen that is ionized
, one of the three laryngeals in the reconstructed Proto-Indo-European language
The Hardy space H2
Vehicles
Air and space
H-II, a family of Japanese liquid-fueled rockets
H-IIA
H-IIB
H-II Transfer Vehicle, a Japan Aerospace Exploration Agency uncrewed spacecraft
H-2 MUPSOW, a precision-guided glide bomb manufactured by Pakistan
Landgraf H-2, an American single-seat twin-rotor helicopter produced in 1944
Standard H-2, a U.S. Army reconnaissance plane produced in 1916
Automobiles
Haval H2, a Chinese subcompact SUV
Hummer H2, an American full-size SUV
Motorcycles
Kawasaki H2 Mach IV, 1970s two-stroke motorcycle
Kawasaki Ninja H2, 2010s supercharged motorcycle
Rail
LB&SCR H2 class, a British LB&SCR locomotive
GNR Class H2, a class of British steam locomotives
LNER Class H2, a class of British steam locomotives
H02 locomotive (Germany), a high-pressure steam locomotive made in 1930
Saxon XII H2, a German steam locomotive produced in 1922
PRR H2, a model within the American PRR locomotive classification
H2, designation for METRORail Siemens S70 light rail vehicles
Sea
HMAS Success (H02), a Royal Australian Navy Admiralty S-class destroyer completed in 1918
HM |
https://en.wikipedia.org/wiki/N4 | N4, N-4, or N.4 may refer to:
Computing
N4 (NHS), the successor to the N3 NHS computer network
NASCAR Racing 4, a NASCAR sim by Papyrus and Sierra
N4, a Markup Language
Energy
N4 (nuclear reactor), a French pressurized water reactor type
Roads
N4 highway (Philippines)
N4 (Bangladesh)
N4 road (Belgium), a road connecting Brussels and Arlon
N4 road (France)
N4 road (Gabon)
N4 road (Ireland), a National Primary Route connecting Dublin, Mullingar, Longford, Carrick-on-Shannon, and Sligo
N4 road (Luxembourg)
N4 road (Senegal)
N4 road (South Africa), a road connecting the Botswana border, Pretoria, and the Mozambique border
N4 road (Spain), a National Primary Route connecting Madrid and Andalusia
N4 road (Switzerland)
Nebraska Highway 4, a state highway in the U.S. state of Nebraska
Transport
Fairey N.4, a British reconnaissance flying boat of the 1920s
LNER Class N4, a British steam locomotive class
Minerva Airlines, IATA airline designator
SP&S Class N-4, a steam locomotive class
USS N-4 (SS-56), a 1916 N-class coastal defense submarine of the United States Navy
Other
, an unstable molecule of nitrogen (tetranitrogen)
N4, a postcode district in the N postcode area of London
N4, a Drum & Bass / Hardcore record label run by Pete Cannon. Named after the N4 London postcode district
N4 (television channel), a community television channel in Akureyri, Iceland
Washburn N4, an electric guitar
The second level in the Japanese Language Proficiency Test
Nexus 4, an Android smartphone
N4, TSMC's 4 nm semiconductor process node
See also
N04 may refer to :
ATC code N04 Anti-parkinson drugs, a subgroup of the Anatomical Therapeutic Chemical Classification System
Griswold Airport FAA LID
Nephrotic syndrome ICD-10 code
N°4, a shortening for Number Four (disambiguation) |
https://en.wikipedia.org/wiki/Jaan%20Tallinn | Jaan Tallinn (born 14 February 1972) is an Estonian billionaire computer programmer and investor known for his participation in the development of Skype and file-sharing application FastTrack/Kazaa. Jaan Tallinn is a leading figure in the field of existential risk, having co-founded both the Centre for the Study of Existential Risk (CSER) at the University of Cambridge, in the United Kingdom and the Future of Life Institute in Cambridge, Massachusetts, in the United States. Tallinn was an early investor and board member at DeepMind (later acquired by Google) and various other artificial intelligence companies.
Life
Jaan Tallinn graduated from the University of Tartu in Estonia in 1996 with a BSc in theoretical physics with a thesis that considered travelling interstellar distances using warps in spacetime.
Tallinn founded Bluemoon in Estonia alongside schoolmates Ahti Heinla and Priit Kasesalu. Bluemoon's Kosmonaut became, in 1989 (SkyRoads is the 1993 remake), the first Estonian game to be sold abroad, and earned the company US$5,000 (~$ in ). By 1999, Bluemoon faced bankruptcy; its founders decided to acquire remote jobs for the Swedish Tele2 at a salary of US$330 (~$ in ) each per day. The Tele2 project, "Everyday.com", was a commercial flop. Subsequently, while working as a stay-at-home father, Tallinn developed FastTrack and Kazaa for Niklas Zennström and Janus Friis (formerly of Tele2). Kazaa's P2P technology was later repurposed to drive Skype around 2003. Tallinn sold his shares in Skype in 2005, when it was purchased by eBay.
In 2014, he invested in the reversible debugging software for app development Undo. He also made an early investment in DeepMind which was purchased by Google in 2014 for $600 million (~$ in ). Other investments include Faculty, a British AI startup focused on tracking terrorists, and Pactum, an "autonomous negotiation" startup based in California and Estonia.
According to sources cited by the Wall Street Journal, Tallinn loaned Sam Bankman-Fried about $100 million (~$ in ), and had recalled the loan by 2018.
He is married, with children.
Other tenures
Member of the Board of Sponsors of the Bulletin of the Atomic Scientists
Former member of the Estonian President's Academic Advisory Board.
Co-founder of the personalized medical research company MetaMed.
Tallinn is a participant and donator to the effective altruism movement. He donated over a million dollars to the Machine Intelligence Research Institute since 2015. His initial donation when co-founding the Centre for the Study of Existential Risk in 2012 was around $200,000 (~$ in ).
Views
Tallinn strongly promotes the study of existential risk and has given numerous talks on this topic. His main worries are related to artificial intelligence, unknowns coming from technological development, synthetic biology and nanotechnology. He believes humanity is not spending enough resources on long-term planning and mitigating threats that could wipe us out as a |
https://en.wikipedia.org/wiki/This%20I%20Believe | This I Believe was originally a five-minute program, originally hosted by journalist Edward R. Murrow from 1951 to 1955 on CBS Radio Network. The show encouraged both famous and everyday people to write short essays about their own personal motivation in life and then read them on the air. This I Believe became a cultural phenomenon that stressed individual belief rather than religious dogma. Its popularity both developed and waned within the era of U.S. Senator Joseph McCarthy and the Cold War.
Since then, a variety of revivals have been hosted on different networks. A half-hour European version of This I Believe ran from 1956 to 1958 over Radio Luxembourg. It has since been revived numerous times in recent years, first by Dan Gediman and Jay Allison on NPR from 2005 to 2009, and subsequently by Preston Manning on Canada's CBC Radio One in 2007. Essays that appear on the show are available free of charge at its website.
Since 2009, the original This I Believe programs have been syndicated as part of PRI's Bob Edwards Weekend.
History
Background
The idea for This I Believe flowed from both the WWII broadcasting experiences of Edward R. Murrow, who had spent the latter 1930s and most of the 1940s in the United Kingdom and continental Europe, and the emerging Cold War hostility with the Soviet Union.
During Murrow's stay in London he had become a friend of the World War II British Prime Minister Winston Churchill, who had an American mother and British father, and this enabled him to introduce Churchill to William S. Paley, who was his boss at CBS. During the war Paley spent much of his time in London working in the Psychological Warfare Branch of the Office of War Information (OWI), which included redirecting the transmitters of Radio Luxembourg following the liberation of the Grand Duchy, for use as a black propaganda station (Radio 1212). Meanwhile, Murrow had "covered the London air raids from the streets and rooftops ...went on 25 bombing missions over Germany and broadcast from a British minesweeper in World War II." This close relationship between Murrow, Paley, CBS and the British Establishment led to an offer after the war for Murrow to become part of the editorial diarchy at the British Broadcasting Corporation, an offer that was not endorsed by the BBC Board of Directors.
Murrow returned to the US which was in a growing Cold War with its former WWII partner, the Soviet Union. During these years of the late 1940s and early 1950s, political paranoia involving a Communist conspiracy was flowing from Washington, D.C., and it eventually came to be led by U.S. Senator Joseph McCarthy. Paley, with his CBS/OWI background, also became a firm supporter of the new Central Intelligence Agency after the war and allowed some of his part-time CBS newsmen to serve as CIA agents. His own Paley Foundation also became engaged in laundering money for the CIA and Paley allowed the creation of a CBS blacklist and Murrow was among the first to sign a CBS |
https://en.wikipedia.org/wiki/James%20Pustejovsky | James Pustejovsky (born 1956) is an American computer scientist. He is the TJX Feldberg professor of computer science at Brandeis University in Waltham, Massachusetts, United States. His expertise includes theoretical and computational modeling of language, specifically: Computational linguistics, Lexical semantics, Knowledge representation, temporal and spatial reasoning and Extraction. His main topics of research are Natural language processing generally, and in particular, the computational analysis of linguistic meaning. He holds a B.S. from MIT as well as a PhD from the University of Massachusetts, Amherst.
Pustejovsky first proposed generative lexicon theory in lexical semantics in an article published in 1991, which was further developed in his 1995 book of the same name.
His other interests include temporal reasoning, event semantics, spatial language, language annotation, computational linguistics, and machine learning.
Current research
Pustejovsky's research group's current projects include the TimeML and ISO-Space projects. The TimeML project is a standard markup language for temporal events in a document, and has recently been adopted as ISO-TImeML by the ISO. ISO-Space is an ISO-directed effort to create an expressive specification for the representation of spatial information in language. His previous work included the Medstract project, an effort to extract information from medical documents using current natural language processing technology.
References
External links
Professor Pustejovsky's website
Brandeis University Faculty Guide
Pustejovsky's book on the Generative Lexicon
The TimeML project
The Medstract project
1956 births
Living people
Brandeis University faculty
American computer scientists
Linguists from the United States
Computational linguistics researchers
Generative linguistics
Natural language processing researchers |
https://en.wikipedia.org/wiki/Attack%20of%20the%20Cybermen | Attack of the Cybermen is the first serial of the 22nd season of the British science fiction television series Doctor Who, which was first broadcast in two weekly parts on 5 and 12 January 1985. It was credited to the pseudonymous author "Paula Moore"; there are conflicting accounts concerning to whom this credit belongs. Beginning with this serial and continuing for the remainder of Season 22, episodes were 45 minutes in length (as opposed to previous episodes which were 25 minutes long); for syndication, in some markets, this serial is re-edited into four 25-minute segments.
Attack of the Cybermen has a complex plot which reiterates narratives from The Tenth Planet (1966) and The Tomb of the Cybermen (1967). Set in London in 1985 and the planet Telos in the future, in the serial the Cybermen intend to change the course of history by destroying Earth with Halley's Comet in 1985, which would prevent the destruction of the Cybermen's original home planet Mondas. In addition to its contemporary London setting, it also features several other references to the previous season's Resurrection of the Daleks, notably the return of Lytton (played by Maurice Colbourne) and his henchmen (who again masquerade as policemen), and is directed by Matthew Robinson in his second and final contribution to the series.
Plot
The Doctor, who has been trying without much success to fix the TARDIS's chameleon circuit, picks up a distress signal from Earth in the year 1985. Unbeknownst to him, the signal has been sent by Lytton, a mercenary formerly in the employ of the Daleks, who has since begun a new life as a London gangster. Lytton dupes a bunch of fellow gangsters into attempting a fake diamond heist, actually intending to hand them over to the Cybermen, who have set up a base in the city's sewers. The Doctor tries to investigate the signal, but he, Peri, and the TARDIS are captured by the Cybermen, and is forced to take them and Lytton to the Cybermen-controlled planet of Telos.
After the Doctor sabotages the TARDIS, it materialises on Telos, but in the depths of the Cyber-Tombs, which have been sabotaged by Telos's native species, the Cryons. Peri, Lytton, and his right-hand man Griffiths escape when the group is attacked by a damaged, maddened Cyberman, and the Doctor is imprisoned with the Cryon leader, Flast, who tells him that the Cybermen intend to use a time ship that they have captured to prevent the destruction of their original homeworld, Mondas.
Lytton and Griffiths make contact with the time ship's original crew, Bates and Stratton, who turn out to have been failed victims of conversion into Cybermen. The group tries to retake control of the time ship, but Lytton is captured by the Cybermen, while Griffifths, Bates and Stratton are killed by a squadron guarding the time ship. Flast helps the Doctor prepare an explosion that will destroy the Cybermen's base before assisting him with escaping, but is executed by the Cybermen when they discover that th |
https://en.wikipedia.org/wiki/TF1%20Group | TF1 Group () is a French media holding company. Its best-known property is the broadcast network TF1.
The group was formed after TF1 was privatized in April 1987. It is controlled with a 43% stake by Bouygues, and is quoted on Euronext Paris.
History
The history of TF1 traces back to 1975, when the Office de Radiodiffusion-Télévision Française (ORTF) was split into 7 successor institutions. To provide competition for Canal+, La Cinq and M6, the French government decided to privatize TF1 in April 1987. Since then, it has been controlled by the Bouygues conglomerate after its privatization.
In June 2009, TF1 Group agreed to buy the NT1 channel from AB Groupe, as well as AB's 40% stake in TMC Monte Carlo (which would take TF1's total stake to 80%). The deal was cleared by France's competition authority and subsequently by the Council of State in December 2010, dismissing an appeal by Métropole Télévision. As part of the same transaction, the group raised its stake in WB Television to 49%.
On 21 December 2012, Discovery Communications purchased a 20% stake in Eurosport from TF1 Group for €170m. Discovery has the option to increase its stake to 51% in 2014. Should Discovery exercise its option, TF1 Group would have the ability to then exercise a put option over the remaining 49% that would see Discovery take full control. On 22 July 2015, Discovery agreed to acquire TF1's remaining 49% stake in the venture. Discovery also took a 20% share in TV Breizh, Histoire, Ushuaia TV and Stylia – for €14m, with the option of increasing its shareholding to 49% in each channel in 2014. Discovery and TF1's production arm will also work together on making programmes.
TF1 Group's Newen agree to acquire a majority stake in Reel One of Montreal in July 2019. Current owner and CEO Tom Berry would retain a minority stake in the company.
In December 2017, the TF1 group finds an agreement with the Canal+ group, The MYTF1 service and thus restored on CANAL decoders and on myCanal and also the control of live (Start-Over) is possible on myCanal. A similar episode occurs in September 2022.
On 18 May 2021, TF1 Group and M6 Group announced that both companies have begun negotiations for a proposed merger. On 16 September 2022, the merger was officially abandoned due to competition concerns by the antitrust French authorities.
Operations
Newen - Paris-based TV production company
Capa Drama, French banners
Telfrance, French banners
Nimbus, Denmark
Tuvalu, Netherlands
Pupkin, Netherlands
De Mensen, Belgium
BlueSpirit, Canadian animation company
Reel One, Canadian production outfit
Streaming service
Salto, with France Télévisions and Groupe M6
MY TF1
Television
TF1 Group owns or has a direct stake in the following television channels:
Free-to-air
TF1, channel 1
TMC, channel 10
TFX (launched in 2005 as NT1), channel 11
TF1 Séries Films (launched in 2012 as HD1), channel 20
LCI - La Chaîne Info (launched in 1994), channel 26
Pay
TV Breizh (launched in 2000)
TF1 Int |
https://en.wikipedia.org/wiki/Direct%208 | Direct 8 was a national French TV channel, owned by Vincent Bolloré. It was available through digital terrestrial television network "TNT" and the Astra 1H satellite position.
As the name suggests ('direct' is French for 'live'), Direct 8 was originally intended to broadcast live shows only (except during night times and holiday seasons). This is no longer the case.
Following its purchase by Canal Group, the channel closed down on 7 October 2012 and relaunched as D8.
See also
D8 (TV channel)
References
Direct 8 devient une « vraie » concurrente
Direct 8, Nicolas, les femmes et le coup de ciseau - 20minutes.fr
Direct 8 s'offre l'équipe de France Espoirs, actualité Médias 2.0 : Le Point
Direct 8 : la chaîne du direct - télévision - la-Croix.com
Programmes TV - «Direct 8 est devenue un média de masse» - Divertissement - Le Figaro TV
External links
Official Site (broken, redirected to D8 website)
Live streaming video of Direct 8 (not available during movies)
Defunct television channels in France
Television channels and stations established in 2001
Television channels and stations established in 2005
Television channels and stations disestablished in 2012
French-language television stations
2001 establishments in France
2005 establishments in France
2012 disestablishments in France |
https://en.wikipedia.org/wiki/Today%20I%20Am%20a%20Clown | "Today I Am a Clown" is the sixth episode of the fifteenth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on December 7, 2003. The episode focuses on Krusty's religion, Judaism.
Dan Castellaneta won a Primetime Emmy Award for Outstanding Voice-Over Performance for his roles in this episode.
Plot
One morning, the family is visited by Dr. Hibbert, who says that Santa's Little Helper has impregnated his purebred poodle, Rosa Barks, and he gives the puppies to the Simpson family, making them their problem. Bart and Lisa give out the puppies to people, including Krusty the Clown, who takes his new puppy for a walk to his old neighborhood in the Jewish community of Springfield, where he sees the Jewish Walk of Fame. He finds out that he does not have a star on the sidewalk, and goes to register for one. However, when the person Krusty goes to asks for the date of his Bar Mitzvah, Krusty confesses that he never actually had a Bar Mitzvah. The person tells him that since he never had a Bar Mitzvah, he is not really Jewish. Krusty runs into Bart and Lisa outside, and he tells them of his problem. Bart and Lisa wonder how Krusty could not have had a Bar Mitzvah, especially considering that his own father is a rabbi. They go to Rabbi Hyman Krustofsky to ask why Krusty never had a Bar Mitzvah, and Hyman reveals that it was because he was afraid that Krusty would make a mockery of the whole ceremony. Lisa points out that Krusty can still have his Bar Mitzvah as an adult, as there is nothing in Judaism that forbids it. Hyman agrees to help his son reach his goal, teaching him all about Judaism. With this happening, Krusty cannot do shows on Saturdays (the Sabbath day for Jews); therefore, he must seek a replacement, and gets Homer to replace him for the day. Homer's replacement show is a talk show, which becomes a success in its own right; meanwhile, Krusty continues to learn his Jewish traditions.
In response to The Homer Simpson Shows surprising success, Krusty's show is eventually cancelled by Channel 6. Lisa suggests that Homer put his power to good use, but ratings decline and Homer's show is also cancelled thanks to Lisa's suggestion. Meanwhile, Krusty pitches his Bar Mitzvah to the Fox network. When the Bar Mitzvah ("Krusty the Klown's Wet 'n' Wild Bar Mitzvah"), featuring Mr. T as a guest, airs, it becomes a ratings smash, but the spectacle disappoints his father. Krusty feels guilty, and after the show, he holds a real Bar Mitzvah the traditional way at a Jewish temple.
Reception
In 2012, New York named "Today I Am a Clown" as one of the nine later Simpsons episodes that was as good as the show's classic era.
Joel H. Cohen was nominated for a Writers Guild of America Award for Outstanding Writing in Animation at the 57th Writers Guild of America Awards for his script to this episode.
References
External links
An article on the episode in The Jewish Journal of Great |
https://en.wikipedia.org/wiki/Turmite | In computer science, a turmite is a Turing machine which has an orientation in addition to a current state and a "tape" that consists of an infinite two-dimensional grid of cells. The terms ant and vant are also used. Langton's ant is a well-known type of turmite defined on the cells of a square grid. Paterson's worms are a type of turmite defined on the edges of an isometric grid.
It has been shown that turmites in general are exactly equivalent in power to one-dimensional Turing machines with an infinite tape, as either can simulate the other.
History
Langton's ants were invented in 1986 and declared "equivalent to Turing machines". Independently, in 1988, Allen H. Brady considered the idea of two-dimensional Turing machines with an orientation and called them "TurNing machines".
Apparently independently of both of these, Greg Turk investigated the same kind of system and wrote to A. K. Dewdney about them. A. K. Dewdney named them "tur-mites" in his "Computer Recreations" column in Scientific American in 1989. Rudy Rucker relates the story as follows:
Relative vs. absolute turmites
Turmites can be categorised as being either relative or absolute. Relative turmites, alternatively known as "Turning machines", have an internal orientation. Langton's Ant is such an example. Relative turmites are, by definition, isotropic; rotating the turmite does not affect its outcome. Relative turmites are so named because the directions are encoded relative to the current orientation, equivalent to using the words "left" or "backwards". Absolute turmites, by comparison, encode their directions in absolute terms: a particular instruction may direct the turmite to move "North". Absolute turmites are two-dimensional analogues of conventional Turing machines, so are occasionally referred to as simply "Two-dimensional Turing machines". The remainder of this article is concerned with the relative case.
Specification
The following specification is specific to turmites on a two-dimensional square grid, the most studied type of turmite. Turmites on other grids can be specified in a similar fashion.
As with Langton's ant, turmites perform the following operations each timestep:
turn on the spot (by some multiple of 90°)
change the color of the square
move forward one square.
As with Turing machines, the actions are specified by a state transition table listing the current internal state of the turmite and the color of the cell it is currently standing on. For example, the turmite shown in the image at the top of this page is specified by the following table:
The direction to turn is one of L (90° left), R (90° right), N (no turn) and U (180° U-turn).
Examples
Starting from an empty grid or other configurations, the most commonly observed behaviours are chaotic growth, spiral growth and 'highway' construction. Rare examples become periodic after a certain number of steps.
Busy Beaver game
Allen H. Brady searched for terminating turmites (the equival |
https://en.wikipedia.org/wiki/Bob%20Blumer | Bob Blumer was the creator and host of the pioneering Food Network shows The Surreal Gourmet, Glutton for Punishment, and the host of World's Weirdest Restaurants. He is also the author and illustrator of seven cookbooks, including the most recent Flavorbomb: A Rogue Guide to Making Everything Taste Better. Blumer was born and raised in Montreal, Quebec, but now resides in Los Angeles, California. Bob serves as an Ambassador to Second Harvest in Toronto spreading the word about food rescue and hunger relief. He is also an ambassador for Love Food Hate Waste, a National Canadian zero-waste initiative. He currently works as a spokesperson, does appearances, develops food-related content, and recently played a character loosely based on himself in the upcoming movie The Way to the Heart.
Biography
Blumer was born in Montreal, Quebec. .
Before cooking
In 1981, Blumer graduated from the HBA program at the Richard Ivey School of Business at the University of Western Ontario. From 1984 to 1993 he was business manager for Canadian singer-songwriter Jane Siberry.
As a writer
Books written by Blumer include:
The Surreal Gourmet: Real Food for Pretend Chefs
The Surreal Gourmet Entertains: High-fun, Low-Stress Dinner Parties for 6 – 12
Surreal Gourmet Bites:Showstoppers and Conversation Starters
Off The Eaten Path: Inspired Recipes for Adventurous Cooks Pizza on the Grill (co-written with Elizabeth Karmel)
Glutton For Pleasure: Signature Recipes, Epic Stories, and Surreal Etiquette Flavorbomb: A Rogue Guide to Making Everything Taste BetterAs an Artist
In addition to creating his signature surreal food presentations and illustrating his own cookbooks, Blumer’s illustrations and objets d’art can be found in many places:
• In 2012, he designed and fabricated the Surreal Gourmet Suite at the Gladstone Hotel in Toronto
• In 2016, he was commissioned to create a series of interactive food stations for the iconic Canadian photographer Ed Burtynsky.
• In 2020, he re-designed all of the public spaces and fabricated many pieces of sculpture for Shelter Hotel in Los Angeles.
Blumer’s artwork has also been commissioned by Emeril Lagasse, The Benziger Family Winery, the Hollywood Farmers Market, The 2019 Bonavista Biennale, and the Jessop Winery Art Gallery in Napa Valley, CA.
Guinness World Records
As part of an episode of Glutton for Punishment shot during the 2008 Calgary Stampede, Blumer set a Guinness World Record on July 10, 2008, by flipping 559 pancakes in one hour. This record has since been broken in 2009 by Steve Hamilton, who flipped a record 956.
Due to Blumer's success in Calgary, the fifth and final season of Glutton for Punishment featured attempts to break six other world records. He broke all six records he attempted.
On June 12, 2010, Blumer broke the Guinness World Record for making the largest bowl of salsa at the 26th Tomato Fest in Jacksonville, Texas. Blumer and a crew of Jacksonville volunteers made a bowl weighing in at 2,672 p |
https://en.wikipedia.org/wiki/Bobby%20Rivers | Bobby Rivers is an American television, radio personality and actor. Rivers was the host of the now-defunct Top 5 show on the Food Network, and Watch Bobby Rivers, a prime-time celebrity talk show on VH1.
Early life and career
Rivers, who grew up in South Central Los Angeles during the tumultuous 1960's, graduated from Marquette University in Wisconsin. Rivers' first television appearance was on a 1970 syndicated classic film trivia game show. He was a high school student. During those times on "The Movie Game", shot in Hollywood, he was the program's first African-American contestant and its youngest winner. After working in Milwaukee radio, he made his professional television debut in 1979 on Milwaukee's ABC affiliate, WISN-TV, as the city's first African-American film critic on TV. He did this as a contributor on Milwaukee's edition of "PM Magazine", a syndicated show that had such national hosts as Matt Lauer, Mary Hart and Leeza Gibbons. During that time, he was tapped to audition as a possible movie critic replacement when Gene Siskel and Roger Ebert left Chicago PBS for Disney syndication. In 1984, he'd moved up to co-host and associate producer of a live weekday show on WISN.
Career continued
After that show was cancelled in 1985, Rivers was offered a job as an entertainment reporter for WPIX-TV New York City. Then in 1987, he was hired as a VJ by the American cable television channel VH1. Executives there utilized his comedic and interview skills which led to his own show on the network the following year called Watch Bobby Rivers. Stephen Holden of The New York Times called him "...a master interviewer with a gift for banter." On VH1, he interviewed Paul McCartney, Kirk Douglas, Meryl Streep, Mel Gibson, Carlos Santana, Raúl Juliá, Michael Caine, Mel Blanc, Jodie Foster, Liza Minnelli, Marlo Thomas, and Norman Mailer, among others. He hosted veejay segments with the network's new addition, Rosie O'Donnell until 1990.
Rivers hosted two short-lived syndicated game shows, one called "Bedroom Buddies". In 1992, he was approached to be a lifestyles and entertainment reporter on local WNBC TV's "Weekend Today in New York" and WNYW-TV's "Good Day New York." For the latter, he was hired as a replacement for Australian personality Gordon Elliott who had left. Rivers has performed onstage, and appeared on the television show The Sopranos. In 2000, he was the Entertainment Editor on "Lifetime Live", an ABC News/Lifetime TV weekday magazine hour. He also worked on camera with its hosts, Deborah Roberts and the late Dana Reeve. After the cancellation of "Lifetime Live" he hosted Food Network's "Top 5" in 2002. Production ended in 2004 but the show aired in weekly repeats until 2008.
Whoopi Goldberg, a one-time guest on Rivers' VH1 talk show, picked him to be the weekly film critic/entertainment reporter on her national weekday morning show for Premiere Radio, "Wake Up with Whoopi". The show lasted from 2006 to 2008. Director Steven Soderber |
https://en.wikipedia.org/wiki/Independent%20station | An independent station is a broadcast station, usually a television station, not affiliated with a larger broadcast network. As such, it only broadcasts syndicated programs it has purchased; brokered programming, for which a third party pays the station for airtime; and local programs that it produces itself.
In North American and Japanese television, independent stations with general entertainment formats emerged as a distinct class of station because their lack of network affiliation led to unique strategies in program content, scheduling, and promotion, as well as different economics compared to major network affiliates. The Big Three networks in the United States — ABC, CBS, and NBC — traditionally provided a substantial number of program hours per day to their affiliates, whereas later network startups—Fox, UPN, and The WB (the latter two were succeeded by The CW and, to a lesser extent, MyNetworkTV)—provided substantially fewer shows to their affiliates. Through the early 1990s, Fox affiliates were often considered independents.
Programming
The term independent station most often is used to refer to stations with general entertainment formats. Historically, these stations specialized in children's programming, syndicated reruns or first-run shows, and sports coverage.
Some independent stations, mostly those once having been affiliated with a major network, produce substantial amounts of news and public affairs programming. The model for these stations was WSVN in Miami, an NBC affiliate that switched to Fox in January 1989 and dramatically expanded its news output. Further affiliation changes and news expansions from the 1990s onward have produced a number of additional stations, such as KTVK in Phoenix (an ABC affiliate until 1995); WJXT in Jacksonville, Florida (a CBS affiliate until 2002); and WHDH in Boston (an NBC affiliate until 2017), as well as stations such as WGN-TV in Chicago and KUSI-TV in San Diego that never held a major network affiliation.
However, in a broader sense, there are independent stations that focus on a specific genre of television programming. For instance, religious independent stations buy and schedule, or produce locally, evangelism and study programs, and ethnic independent stations purchase or produce programs in specific languages or catering to specific communities.
Overview
Early history
During the 1950s and 1960s, independent stations filled their broadcast hours with movies, sports, cartoons, filmed travelogues, and some locally produced television programs, including in some instances newscasts and children's programs. Independents that were on the air during this period would sign-on at times later than that of stations affiliated with a television network, some not doing so until the early or mid-afternoon hours. Another source of programming became available to independent stations by the mid-1960s: reruns of network programs which, after completing their initial runs, were sold into syndicati |
https://en.wikipedia.org/wiki/Global%20Network%20Navigator | The Global Network Navigator (GNN) was the first commercial web publication and the first web site to offer clickable advertisements. GNN was launched in May 1993, as a project of the technical publishing company O'Reilly Media, then known as O'Reilly & Associates. In June 1995, GNN was sold to AOL, which continued its editorial functions while converting it to a dial-up Internet Service Provider. AOL closed GNN in December 1996, moving all GNN subscribers to the AOL dial-up service.
As a web portal
History
In September 1992, O'Reilly & Associates published the Whole Internet User's Guide and Catalog. The company then created an online version using ViolaWWW, a web browser that introduced enhanced HTML features such as formatting, graphics, scripting, and embedded applets, and demonstrated a kiosk version that was deployed briefly at the Computer Literacy Bookshop in late 1992.
In February 1993, the company's CEO, Tim O'Reilly, authorized a four-person "skunkworks" team, led by Dale Dougherty and Lisa Gansky, and began planning for what would become GNN. The website was officially launched in August 1993 at Interop in San Francisco. A press release described GNN as ... a free Internet-based information center that will initially be available as a quarterly. GNN will consist of a regular news service, an online magazine, The Whole Internet Interactive Catalog, and a global marketplace containing information about products and services.
GNN was one of the pioneers of on-line advertising; it had sponsorship links by early 1994. According to Tim O'Reilly, the first advertiser was Heller, Ehrman, White and McAuliffe, a now defunct law firm with a Silicon Valley office. (GNN was not, however, the first to do rotating banner ads; that was pioneered by HotWired in October 1994.) That an online-only "magazine" would support itself by advertising, as GNN planned, was called "remarkable" in a September 1994 review of GNN.
In May 1994, at the First International Conference on the World-Wide Web, GNN was voted the "Best Commercial Site", and was among the top three in three other categories: "Best Overall Sites"; "Most Important Service Concept", and "Best Document Design". The next month, GNN presented its own awards to twelve other websites, as the sponsor of the "Best of the Net" awards at Internet World in San Jose, California. By that time, GNN was being accessed 150,000 times per week, and had more than 30,000 registered users (subscribers). By November the number had risen to 40,000.
By mid-1994, GNN had twelve staff, including sales and marketing, technical, and editorial. By July of that year, GNN had 45 companies as clients, either buying advertising or selling products online at GNN. By year-end, NCSA's "What's New" page, among the most heavily visited web page at the time, was being jointly written by NCSA and GNN, and published on both of their websites. In December, GNN recorded more than 2 million page requests from Web users.
By Apri |
https://en.wikipedia.org/wiki/Jack-Jack%20Attack | Jack-Jack Attack is a 2004 American computer-animated short film written and directed by Brad Bird and produced by Pixar Animation Studios. It is tied into and included on the DVD release of The Incredibles.
The idea for this short came from an idea for a scene originally considered for inclusion in The Incredibles; it was cut from the feature and subsequently expanded into this short. The short revolves around the situations between Jack-Jack and his babysitter Kari McKeen (who was hired by Violet and Dash to watch Jack-Jack) during the events of the main film.
Plot
Rick Dicker, a government agent assigned to aid "supers" in maintaining their anonymity, interviews Kari McKeen about the events unfolded while she was babysitting Jack-Jack Parr, the youngest of a family of supers.
Kari begins by stating that she received a call from Helen Parr, who expresses reluctance about allowing Kari to babysit. Kari attempts to reassure her that she is more than capable of taking care of Jack-Jack, but the conversation is cut off by Helen's jet being fired upon. Thinking nothing is wrong, and that they were simply cut-off, Kari turns her attention to Jack-Jack. She asks him if he is ready for some "neurological stimulation" and plays the third movement, the Rondo alla turca, of Mozart's Piano Sonata No. 11 for him, which results in Jack-Jack having an epiphany about his latent superpowers.
When Kari's back is turned, Jack-Jack disappears then reappears in the kitchen drinking a baby bottle. Finding this odd, Kari tries to call Helen again. While she is leaving a message, Jack-Jack floats onto the ceiling and spills milk onto Kari's face. Kari puts him in his playpen, flipped upside-down so that he doesn't float away, and tries calling Helen again. Jack-Jack escapes the playpen and appears on a high bookshelf. Just as he falls, Kari dives in and tries to catch him, but fails when Jack-Jack passes through the floor into the laundry room. Running down to find him, Kari sees Jack-Jack passing through the walls and floating around, babbling happily, before she finally catches him.
Kari takes Jack-Jack back upstairs, ties him to a barbell and tries to show him flashcards to calm him down. This works well until she shows him a card of a campfire, at which point he suddenly burst into flames. Horrified, Kari picks up Jack-Jack with the pair of fireplace tongs and rushes into the bathroom, where she douses him in the bathtub.
The next day, an exhausted Kari is teetering on the verge of madness, but has since learned to anticipate and counter the spontaneous outbursts of Jack-Jack's newly emerged powers. There is a knock at the door; Kari answers it and meets Syndrome, who asks if this is the Parrs' residence. Kari thinks he is the new babysitter come to relieve her, but wonders what the "S" on his costume stands for. He claims that it stands for "Sitter" because if he calls himself "Babysitter", his uniform will have to say "BS" on it, something that would make |
https://en.wikipedia.org/wiki/Intrinsic%20function | In computer software, in compiler theory, an intrinsic function (or built-in function) is a function (subroutine) available for use in a given programming language whose implementation is handled specially by the compiler. Typically, it may substitute a sequence of automatically generated instructions for the original function call, similar to an inline function. Unlike an inline function, the compiler has an intimate knowledge of an intrinsic function and can thus better integrate and optimize it for a given situation.
Compilers that implement intrinsic functions generally enable them only when a program requests optimization, otherwise falling back to a default implementation provided by the language runtime system (environment).
Intrinsic functions are often used to explicitly implement vectorization and parallelization in languages which do not address such constructs. Some application programming interfaces (API), for example, AltiVec and OpenMP, use intrinsic functions to declare, respectively, vectorizable and multiprocessing-aware operations during compiling. The compiler parses the intrinsic functions and converts them into vector math or multiprocessing object code appropriate for the target platform.
Some intrinsics are used to provide additional constraints to the optimizer, such as values a variable cannot assume.
C and C++
Compilers for C and C++, of Microsoft,
Intel, and the GNU Compiler Collection (GCC)
implement intrinsics that map directly to the x86 single instruction, multiple data (SIMD) instructions (MMX, Streaming SIMD Extensions (SSE), SSE2, SSE3, SSSE3, SSE4, AVX, AVX2, AVX512, FMA, ...). The Microsoft Visual C++ compiler of Microsoft Visual Studio does not support inline assembly for x86-64. To compensate for this, new intrinsics have been added that map to standard assembly instructions that are not normally accessible through C/C++, e.g., bit scan.
Some C and C++ compilers provide non-portable platform-specific intrinsics. Other intrinsics (such as GNU built-ins) are slightly more abstracted, approximating the abilities of several contemporary platforms, with portable fall back implementations on platforms with no appropriate instructions. It is common for C++ libraries, such as glm or Sony's vector maths libraries, to achieve portability via conditional compilation (based on platform specific compiler flags), providing fully portable high-level primitives (e.g., a four-element floating-point vector type) mapped onto the appropriate low level programming language implementations, while still benefiting from the C++ type system and inlining; hence the advantage over linking to hand-written assembly object files, using the C application binary interface (ABI).
Examples
uint64_t __rdtsc (); // return internal CPU clock counter
uint64_t __popcnt64 (uint64_t n); // count of bits set in n
uint64_t _umu |
https://en.wikipedia.org/wiki/Software%20Peter%20principle | The Software Peter principle is used in software engineering to describe a dying project which has become too complex to be understood even by its own developers.
It is well known in the industry as a silent killer of projects, but by the time the symptoms arise it is often too late to do anything about it. Good managers can avoid this disaster by establishing clear coding practices where unnecessarily complicated code and design is avoided.
The name is used in the book C++ FAQs (see below), and is derived from the Peter principle – a theory about incompetence in hierarchical organizations.
Causes
Loss of conceptual integrity
The conceptual integrity of software is a measure of how well it conforms to a single, simple set of design principles, according to The Mythical Man Month by Fred Brooks. When done properly, it provides the most functionality using the simplest idioms. It makes software easier to use by making it simple to create and learn.
Conceptual integrity is achieved when the software’s design proceeds from a small number of agreeing individuals. For software to maintain conceptual integrity, the design must be controlled by a single, small group of people who understand the code (including the nature of how all the subroutines and variables interact) in depth.
In projects without a strong software architecture team, the task of design is often combined with the task of implementation and is implicitly delegated among the individual software developers . Under these circumstances, developers are less likely to sacrifice personal interests in favor of the interests of the product. The complexity of the product grows as a result of developers adding new designs and altering earlier ones to reflect changes in fashion and individual taste.
Programmer incompetence
Good software developers understand the importance of communicating with people over communicating with the computer, according to Code Complete by Steve McConnell. On average, 85 percent of a programmer's time is spent communicating with people, while only 15 percent is spent communicating with the computer. Maintenance programmers spend 50 to 60 percent of their time trying to understand the code they have to maintain and a software program will have, on average, 10 generations of maintenance programmers in its lifetime.
Programmer inexperience
Programmers sometimes make implementation choices that work but have unintended negative consequences. The most common of these mistakes are cataloged and referred to as smells in the book Refactoring by Martin Fowler. Over time, many such implementation choices degrade the software’s design, making it increasingly difficult to understand.
See also
Anti-patterns
Death march (project management)
Greenspun's tenth rule
Project management
Software development process
Obfuscation (software)
References
C++ FAQs by Cline, Lomow, and Girou, Addison-Wesley 1999
Brooks, F., The Mythical Man-Month, Addison-Wesley Longman In |
https://en.wikipedia.org/wiki/SAN | San or SAN may refer to:
Computing
Storage area network
System area network, linking clusters of computers
Subject Alternative Name associated with a security certificate
Film
The Dream (1966 film), San in Serbian, a 1966 Yugoslav film
San, the protagonist of the 1997 film Princess Mononoke
Umbrella (film), or San, China, 2007
Languages
Spanish and Italian for "Saint"
San (letter), an archaic Greek letter (Ϻ or Ϡ), between pi and qoppa
San (Japanese honorific) suffix (-san), equivalent to Mr., Mrs. or Miss
Music
San (band), 1971, Yugoslav rock band
San (album), 2017, by Japanese band and Mighty Color
"San", a song by The Beat Fleet from Pistaccio Metallic, 2011
Organisations
South African Navy
Stigma Action Network, about HIV stigma
Places
San (river), in Poland and Ukraine
San, Burkina Faso, Pompoï Department, Balé Province
San, Mali, Ségou Region
San, Wiang Sa, a subdistrict of Wiang Sa District, Nan, Thailand
Sanitarium (healthcare), sometimes nicknamed San
Sydney Adventist Hospital, Australia
Battle Creek Sanitarium, in Michigan, US
Saň, a village and part of Višňová (Liberec District) in the Czech Republic
Transport
San, buses by Polish manufacturer Autosan
SAN Ecuador (Servicios Aéreos Nacionales, ICAO code: SAN), a defunct airline
SAN, the AAR reporting mark for the Sandersville Railroad in the US
SAN, the IATA code San Diego International Airport in California, US
SAN, the National Rail code for Sandown railway station on the Isle of Wight, UK
Société Aéronautique Normande, a defunct French aircraft manufacturer
Other
San people, indigenous people of southern Africa
Senior Advocate of Nigeria, a rank
Sinoatrial node
Standard algebraic notation, in chess
Styrene-acrylonitrile resin, a copolymer plastic
See also
Sans (disambiguation) |
https://en.wikipedia.org/wiki/Intelink | Intelink is a group of secure intranets used by the United States Intelligence Community. The first Intelink network was established in 1994 to take advantage of Internet technologies (though not connected to the public Internet) and services to promote intelligence dissemination and business workflow. Since then it has become an essential capability for the US intelligence community and its partners to share information, collaborate across agencies, and conduct business. Intelink refers to the web environment on protected top secret, secret, and unclassified networks. One of the key features of Intelink is Intellipedia, an online system for collaborative data sharing based on MediaWiki. Intelink uses WordPress as the basis of its blogging service.
Versions on different intranets
Intelink-U
Intelink-U (Intelink-SBU) is a sensitive but unclassified (SBU) variant of Intelink which was established for use by U.S. federal organizations and properly vetted state, tribal, and local officials so sensitive information and open source intelligence could be shared amongst a secure community of interest. Intelink-U was formerly known as the Open Source Information System (OSIS). Intelink-U operates on the DNI-U network.
Intelink-S
Intelink-S (Intelink-Secret or Intelink-SIPRNet) is the secret-level variant of Intelink which is primarily used by the U.S. Departments of Defense, State, and Justice. Intelink-S operates on SIPRNet.
Intelink-TS
Intelink-TS (Intelink-SCI) is the Intelligence Community's Intelink which facilitates sharing intelligence products up to the Top Secret/Sensitive Compartmented Information (SCI) level. Intelink-TS operates on JWICS.
Intelink-P
Intelink-P (Intelink-PolicyNet) is run by the Central Intelligence Agency as CIA's sole-source link to the White House and other high-level, intelligence consumers. Today, Intelink-P is more commonly referred to as CapNet.
Intelink-C
Intelink-C (Intelink-Commonwealth) links the United States, the United Kingdom, Canada, and Australia intelligence communities at the TS/SCI level. Today, Intelink-C is more commonly referred to by its network name of STONEGHOST.
Books and novels
In 1999 Fredrick Thomas Martin wrote a book about Intelink, titled How U.S. Intelligence Built INTELINK, The World's Largest, Most Secure Network. It claims to be an inside look at the U.S. intelligence community's worldwide, super-secure intranet, and the never-before-published story of Intelink.
In the novel Rogue Warrior: Task Force Blue by Richard Marcinko, the protagonist uses Intelink, during his mission countering domestic terrorism in the United States, and his assassination of a Ross Perot-like character, who is the architect of a domestic terror network.
In the novel Threat Vector by Tom Clancy, one of the characters found an exploit in the Microsoft's Remote Desktop Protocol that allowed him to penetrate the networks of a United States defense contractor and exploit that penetration to access Intel |
https://en.wikipedia.org/wiki/SMV | SMV may refer to:
People
Sir Mokshagundam Visvesvaraya, Indian engineer, politician and Diwan of Mysore
In computer science
Symbolic model verification
SMV modelling language, used in model checking by the CMU SMV and NuSMV model checkers
Places
Samedan Airport (Switzerland), IATA airport code SMV
Santa Maria Valley, an American Viticultural Area in California
TusPark (Shanghai), or "Shanghai Multimedia Valley" (SMV), or "Tsinghua University Science Park"
Medicine
Superior mesenteric vein
Other uses
Boeing X-40 Space Maneuver Vehicle
Santa Maria Valley Railroad
Selectable Mode Vocoder
SigmaTel Motion Video, a proprietary video format
Slow moving vehicle, a sign used in the United States to warn of vehicles normally operating in traffic at speeds of 25 mph (40 km/h) or less
SMV (band), a bass supergroup
smokeview, companion software to the Fire Dynamics Simulator
Standard Minute Value, a measure of labor costs in industrial engineering predetermined motion time systems
Star of Military Valour
Sexual Market Value, a colloquial expression for a person's sexual capital
Sake Meter Value, the English term for Nihonshu-do (日本酒度), a value that indicates the sugar content of a sake based on its relative density
Sony Music Video, the home video arm of Sony Music Entertainment |
https://en.wikipedia.org/wiki/Spring%20%28operating%20system%29 | Spring is a discontinued project in building an experimental microkernel-based object-oriented operating system (OS) developed at Sun Microsystems in the early 1990s. Using technology substantially similar to concepts developed in the Mach kernel, Spring concentrated on providing a richer programming environment supporting multiple inheritance and other features. Spring was also more cleanly separated from the operating systems it would host, divorcing it from its Unix roots and even allowing several OSes to be run at the same time. Development faded out in the mid-1990s, but several ideas and some code from the project was later re-used in the Java programming language libraries and the Solaris operating system.
History
Spring started in a roundabout fashion in 1987, as part of Sun and AT&T's collaboration to create a merged UNIX. Both companies decided it was also a good opportunity to "reimplement UNIX in an object-oriented fashion". However, after only a few meetings, this part of the project died.
Sun decided to keep their team together and instead explore a system on the leading edge. Along with combining Unix flavours, the new system would also be able to run almost any other system, and in a distributed fashion. The system was first running in a "complete" fashion in 1993, and produced a series of research papers. In 1994, a "research quality" release was made under a non-commercial license, but it is unclear how widely this was used. Described as a "clean slate" intended to help Sun improve its existing Unix products, the software was made available at a cost of $75, with Sun targeting universities and computer scientists. Commercial research institutions could obtain the software at a cost of $750. The team broke up and moved to other projects within Sun, using some of the Spring concepts on a variety of other projects.
Background
The Spring project began soon after the release of Mach 3. In earlier versions Mach was simply a modified version of existing BSD kernels, but in Mach 3 the Unix services were separated out and run as a user-space program like any other, a concept Mach referred to as a server. Data which would normally be private in the kernel under a traditional Unix system was now passed between the servers and user programs using an inter-process communication (IPC) system, ending in ports which both programs held. Mach implemented these ports in the kernel, using virtual memory to move data from program to program, relying on the memory management unit (MMU) and the copy on write algorithm to do so with reasonable performance.
In its ultimate development, an OS on Mach would consist of a number of such servers, each handling a specific task. Examples would include the file system or network stack. The operating system server in such a system would be quite small, providing services unique to that OS, and forwarding most other calls to other servers. Since the OS was running on top of single set of common servers, seve |
https://en.wikipedia.org/wiki/Authentication%20and%20Key%20Agreement | Authentication and Key Agreement (AKA) is a security protocol used in 3G networks. AKA is also used for one-time password generation mechanism for digest access authentication. AKA is a challenge–response based mechanism that uses symmetric cryptography.
AKA in CDMA
AKA – Authentication and Key Agreement a.k.a. 3G Authentication, Enhanced Subscriber Authorization (ESA).
The basis for the 3G authentication mechanism, defined as a successor to CAVE-based authentication, AKA provides procedures for mutual authentication of the Mobile Station (MS) and serving system. The successful execution of AKA results in the establishment of a security association (i.e., set of security data) between the MS and serving system that enables a set of security services to be provided.
Major advantages of AKA over CAVE-based authentication include:
Larger authentication keys (128-bit )
Stronger hash function (SHA-1)
Support for mutual authentication
Support for signaling message data integrity
Support for signaling information encryption
Support for user data encryption
Protection from rogue MS when dealing with R-UIM
AKA is not yet implemented in CDMA2000 networks, although it is expected to be used for IMS. To ensure interoperability with current devices and partner networks, support for AKA in CDMA networks and handsets will likely be in addition to CAVE-based authentication.
Air interface support for AKA is included in all releases following CDMA2000 Rev C.
TIA-41 MAP support for AKA was defined in TIA-945 (3GPP2 X.S0006), which has been integrated into TIA-41 (3GPP2 X.S0004).
For information on AKA in roaming, see CDG Reference Document #138.
AKA in UMTS
AKA a mechanism which performs authentication and session key distribution in Universal Mobile Telecommunications System (UMTS) networks. AKA is a challenge–response based mechanism that uses symmetric cryptography. AKA is typically run in a UMTS IP Multimedia Services Identity Module (ISIM), which is an application on a UICC (Universal Integrated Circuit Card). AKA is defined in RFC 3310.
Security
An attack against all variants of AKA has been reported, including 5G.
See also
Evil twin (wireless networks)
Cellphone surveillance
Mobile phone tracking
Stingray phone tracker
References
External links
Illustrated Master thesis of Authentication and Key Agreement (AKA) procedures and security aspects in UMTS
Cryptographic protocols
Code division multiple access |
https://en.wikipedia.org/wiki/Internet%20Streaming%20Media%20Alliance | The Internet Streaming Media Alliance (ISMA) was a non-profit corporation founded in December 2000, by Apple Computer, Cisco Systems, Kasenna, Philips, and Sun Microsystems. Its stated mission was to accelerate the market adoption of open standards for streaming and progressive download of rich media over all types of Internet Protocols (IP). It was an alliance with representatives from various points of the streaming work-flow.
At the time ISMA was created, standards already existed for audio and video codecs (e.g. MPEG) and for real time streaming transport over IP networks (e.g. RTP). ISMA worked on selecting profiles, describing payload formats, and resolving various options of these standards. ISMA specifications typically adopted existing specifications. However, when specifications did not exist, the ISMA could create them. ISMA also performed interoperability testing, allowing its members to ensure that their products conformed to ISMA standards and interoperate.
Specifications
ISMA released several specifications for the transport of rich media over IP:
ISMA 1.0 - detailing how to stream MPEG-4 Part 2 video (Simple Profile and Advanced Simple Profile) over IP networks
ISMA 2.0 - detailing how to stream H.264/MPEG-4 AVC video and HE-AAC audio over IP networks
ISMACryp - specifying an end-to-end encryption system for ISMA 1.0 and 2.0 streams
ISMA Closed Captioning - specifying how to carry closed caption (line 21) data as a third stream over an IP network
References
External links
ISMA Official Website (archived from the original on December 19, 2011)
ISMA technical specifications at MPEG industry forum
Internet protocols
Non-profit corporations
Organizations established in 2000 |
https://en.wikipedia.org/wiki/Cyworld | Cyworld () is a South Korean social network service. Cyworld was originally part of SK communication, and became an independent company in 2014. Members cultivate relationships by forming Ilchon (, Hanja: 一寸) or "friendships" with each other through their minihompy. Avatars and "mini-rooms" (small, decoratable, apartment-like spaces in an isometric projection) are features of the service, which can make for a Sims-like experience.
The "Cy" in Cyworld can mean "cyber", but is also a pun on the Korean word for relationship ( 'between').
Cyworld is a rough equivalent to MySpace of the United States, with the main difference being that revenue is generated through the sale of dotori (), or acorns, which can be used to purchase virtual goods, such as background music, pixelated furniture, and virtual appliances.
Cyworld also has operations in China and Vietnam.
History
Overview
Cyworld launched in 1999 and was purchased by SK Communications in 2003. It became one of the first companies to profit from the sale of virtual goods.
Cyworld was wildly popular in its home market, with 2005 claims that nearly every South Korean in their twenties
and 25 percent of the South Korean population were users. By 2006 its domestic user base numbered 19 million, but this dropped to 18 million by 2008.
Cyworld's reception in some overseas markets did not prove as enthusiastic, and by 2010 Cyworld had ended its operations in Germany, Japan, and the United States. As of 2009, it continues to provide service to the Chinese and Vietnamese markets where it has subscriber bases of seven million and 450,000, respectively.
Initial stages
The idea for Cyworld started in August 1999 by KAIST student organization the 'EC club', a club that took on online business projects. The club members got the idea to create a social networking website while discussing topics for a research project. Though most club members abandoned the project after graduation, Dong-Hyung Lee remained to pursue the project, taking the role of CEO from December 1999.
The word 'cy' is a Korean word meaning 'between people', underlining the networking aspect of the website and connoting a close relation between the website users. However, most misinterpret 'cy' as an abbreviation for 'cyber' due to its fortis; 'sai' corresponds to a more accurate pronunciation of a Korean word for 'between.' The original nature of the term 'cy' demonstrates Dong-Hyung Lee's vision for the site. He wanted to create an Internet community that allowed people to form close relationships, rather than a community where people merely sought information for business prospects.
Cyworld at its early stages was quite different from that of today. It was a website that showed a list of members from the same hometown or school. The address book for each member was updated automatically according to the personal information its members provided. It was not a place where people could express themselves, but rather a website th |
https://en.wikipedia.org/wiki/Marching%20cubes | Marching cubes is a computer graphics algorithm, published in the 1987 SIGGRAPH proceedings by Lorensen and Cline, for extracting a polygonal mesh of an isosurface from a three-dimensional discrete scalar field (the elements of which are sometimes called voxels). The applications of this algorithm are mainly concerned with medical visualizations such as CT and MRI scan data images, and special effects or 3-D modelling with what is usually called metaballs or other metasurfaces. The marching cubes algorithm is meant to be used for 3-D; the 2-D version of this algorithm is called the marching squares algorithm.
History
The algorithm was developed by William E. Lorensen (1946-2019) and Harvey E. Cline as a result of their research for General Electric. At General Electric they worked on a way to efficiently visualize data from CT and MRI devices.
The premise of the algorithm is to divide the input volume into a discrete set of cubes. By assuming linear reconstruction filtering, each cube, which contains a piece of a given isosurface, can easily be identified because the sample values at the cube vertices must span the target isosurface value. For each cube containing a section of the isosurface, a triangular mesh that approximates the behavior of the trilinear interpolant in the interior cube is generated.
The first published version of the algorithm exploited rotational and reflective symmetry and also sign changes to build the table with 15 unique cases. However, due to the existence of ambiguities in the trilinear interpolant behavior in the cube faces and interior, the meshes extracted by the Marching Cubes presented discontinuities and topological issues. Given a cube of the grid, a face ambiguity occurs when its face vertices have alternating signs. That is, the vertices of one diagonal on this face are positive and the vertices on the other are negative. Observe that in this case, the signs of the face vertices are insufficient to determine the correct way to triangulate the isosurface. Similarly, an interior ambiguity occurs when the signs of the cube vertices are insufficient to determine the correct surface triangulation, i.e., when multiple triangulations are possible for the same cube configuration.
The popularity of the Marching Cubes and its widespread adoption resulted in several improvements in the algorithm to deal with the ambiguities and to correctly track the behavior of the interpolant. Durst in 1988 was the first to note that the triangulation table proposed by Lorensen and Cline was incomplete, and that certain Marching Cubes cases allow multiple triangulations. Durst's 'additional reference' was to an earlier, more efficient (see de Araujo) isosurface polygonization algorithm by Wyvill, Wyvill and McPheeters. Later, Nielson and Hamann in 1991 observed the existence of ambiguities in the interpolant behavior on the face of the cube. They proposed a test called Asymptotic Decider to correctly track the interpolant on the |
https://en.wikipedia.org/wiki/Network%20Processing%20Forum | The Network Processing Forum (NPF) is an industry forum that was organized to facilitate and accelerate the development of next-generation networking and telecommunications products based on network processing technologies. The NPF was merged into the Optical Internetworking Forum in June 2006. The NPF produces Hardware, Software, and Benchmark Interoperability Agreements. These agreements enable equipment manufacturers to lower their time to market and development cost by enabling a robust, multi-vendor ecosystem. It also lowers the total cost of ownership of systems based on their interoperability agreements by enabling investments in test and verification infrastructure as well as enabling competition.
History of the NPF
The organization was formed to build on the efforts of two former industry groups, the Common Programming Interface Forum (CPIX) and the Common Switch Interface Consortium (CSIX). Chuck Sannipoli then of IBM was the first chairman of the NPF. Misha Nossik then of Solidum Systems, later acquired by Integrated Device Technology was the second chairman of the NPF. Many of the original meetings were held in the Drake Hotel in Chicago, Illinois. The NPF was later absorbed by the Optical Internetworking Forum (OIF) in June 2006.
Organizational form
The NPF is a member-managed non-profit corporation and operates as a contribution-driven, parliamentary industry forum. Russell Dietz of HiFn is the current chairman and Chuck Sannipoli representing IP Infusion is the vice-chairman. The NPF's board was composed of representatives of Ericsson, HiFn, IBM, Integrated Device Technology, Intel, IP Infusion, and PMC-Sierra.
Hardware interoperability agreements
The Look-Aside Interface (LA) is used by Network Processing Elements (NPE)s to access Network Search Elements, of which CAMs are an example.
The Streaming Interface (NPF-SI) is used by NPEs to talk to each other and to framing devices and to switching devices.
Software interoperability agreements
Service Application Programming Agreements, (SAPI)s, provide an API to configure or use a service. The following SAPIs have been approved by the NPF:
Interface Management API, IPSec Service API, HA Service API, Diffserv Services API, IPv4 Unicast Forwarding Service API, IPv6 Unicast Forwarding Service API, MPLS Forwarding Service API,
Functional APIs, (FAPI)s, are used to configure or use a low level functional block. The following FAPIs have been approved by the NPF:
IPv4 Prefix LPF and FAPI, Generic Classifier LFB and FAPI, Topology Manager FAPI, Messaging LFB,
Benchmarking interoperability agreements
The NPF has created benchmarks for IP forwarding, IPSEC performance, MPLS forwarding, and switch fabric performance.
Joint projects
The NPF specified a High Availability framework and service API in conjunction with the Service Availability Forum (SAF). The NPF has also had extensive liaison activity with the Optical Internetworking Forum. In December 2004, the NPF became a f |
https://en.wikipedia.org/wiki/Optical%20burst%20switching | Optical burst switching (OBS) is an optical networking technique that allows dynamic sub-wavelength switching of data. OBS is viewed as a compromise between the yet unfeasible full optical packet switching (OPS) and the mostly static optical circuit switching (OCS). It differs from these paradigms because OBS control information is sent separately in a reserved optical channel and in advance of the data payload. These control signals can then be processed electronically to allow the timely setup of an optical light path to transport the soon-to-arrive payload. This is known as delayed reservation.
Purpose
The purpose of optical burst switching (OBS) is to dynamically provision sub-wavelength granularity by optimally combining electronics and optics. OBS considers sets of packets with similar properties called bursts. Therefore, OBS granularity is finer than optical circuit switching (OCS). OBS provides more bandwidth flexibility than wavelength routing but requires faster switching and control technology. OBS can be used for realizing dynamic end-to-end all optical communications.
Method
In OBS, packets are aggregated into data bursts at the edge of the network to form the data payload. Various assembling schemes based on time and/or size exist (see burst switching). Edge router architectures have been proposed (see ). OBS features the separation between the control plane and the data plane. A control signal (also termed burst header or control packet) is associated to each data burst. The control signal is transmitted in optical form in a separated wavelength termed the control channel, but signaled out of band and processed electronically at each OBS router, whereas the data burst is transmitted in all optical form from one end to the other end of the network. The data burst can cut through intermediate nodes, and data buffers such as fiber delay lines may be used. In OBS data is transmitted with full transparency to the intermediate nodes in the network. After the burst has passed a router, the router can accept new reservation requests.
Advantages of OBS over OPS and OCS
Advantages over OCS
More efficient bandwidth utilization – In an OCS system, a lightpath must be set up from source to destination in the optical network. If the data transmission duration is short relative to the set up time, bandwidth may not be efficiently utilized in the OCS system. In comparison, OBS does not require end-to-end lightpath set up, and therefore may offer more efficient bandwidth utilization compared to an OCS system. This is similar to the advantage offered by packet switching over circuit switching.
Advantages over OPS
Remove throughput limitation – Optical buffer technology has not matured enough to enable low cost manufacturing and widespread use in optical networks. Core optical network nodes are likely to either be unbuffered or have limited buffers. In such networks, delayed reservation schemes such as Just Enough Time (JET) are combined with |
https://en.wikipedia.org/wiki/Optical%20Internetworking%20Forum | The Optical Internetworking Forum (OIF) is a prominent non-profit consortium that was founded in 1998. It promotes the development and deployment of interoperable computer networking products and services through implementation agreements (IAs) for optical networking products and component technologies including SerDes devices.
OIF also creates benchmarks, performs worldwide interoperability testing, builds market awareness and promotes education for optical technologies.
The Network Processing Forum merged into OIF in June 2006.
The OIF has around a hundred member companies and has four face-to-face meetings per year. It is managed by Association Management Solutions and operates using parliamentary debate rules and transparent decision making. The technical content is member-driven. The OIF operates under a RAND licensing framework. It maintains liaison relationships with many other standards-developing organizations including the ITU, IEEE 802.3, the ONF, the InfiniBand Trade Association, the TIA and the IETF.
Organization
Implementation agreements are based on requirements developed cooperatively by end users, service providers, equipment vendors and technology providers in alignment with worldwide standards, augmented as necessary. This is accomplished through industry member participation working together to develop specifications for external network element interfaces, software interfaces internal to network elements and hardware component interfaces internal to network elements.
OIF sponsors a technical committee and a market awareness and education committee. The technical committee has the following working groups:
The Architecture and Signaling Working Group develops agreements related to architecture and signaling from service provider requirements.
The Carrier Working Group assembles functional requirements and guidelines for optical networking products.
The Interoperability Working Group defines testing methodologies, carries out proofs of concept, evaluates multi-vendor interoperability and contributes technical leadership for interoperability trials. Test criteria and test methods are defined with support of the source technical working group.
The Operations, Administration, Maintenance, and Provisioning working group focuses on deployment issues.
The Physical and Link Layer Working Group develops implementation agreements related to physical and data link layer interfaces between optical internetworking elements and between their internal components.
Electrical Implementation Agreements
CEI, the Common Electrical I/O
The Common Electrical I/O (CEI) Interoperability Agreement is for 3.125, 6, 11, 25-28, 56 and 112 Gbit/s high speed electrical interfaces. The CEI specification has defined SerDes interfaces for the industry since 2006. The OIF's published CEI 5.0 family of interfaces plus its predecessors are the eighth generation and seventh doubling in rate of high speed electrical interfaces beginning with |
https://en.wikipedia.org/wiki/Archy%20%28software%29 | Archy is a software system whose user interface introduced a different approach for interacting with computers with respect to traditional graphical user interfaces. Designed by human-computer interface expert Jef Raskin, it embodies his ideas and established results about human-centered design described in his book The Humane Interface. These ideas include content persistence, modelessness, a nucleus with commands instead of applications, navigation using incremental text search, and a zooming user interface (ZUI). The system was being implemented at the Raskin Center for Humane Interfaces under Raskin's leadership. Since his death in February 2005 the project was continued by his team, which later shifted focus to the Ubiquity extension for the Firefox browser.
Archy in large part builds on Raskin's earlier work with the Apple Macintosh, Canon Cat, SwyftWare, and Ken Perlin's Pad ZUI system. It can be described as a combination of Canon Cat's text processing functions with a modern ZUI. Archy is more radically different from established systems than are Sun Microsystems' Project Looking Glass and Microsoft Research's "Task Gallery" prototype. While these systems build upon the WIMP desktop paradigm, Archy has been compared as similar to the Emacs text editor, although its design begins from a clean slate.
Archy used to be called The Humane Environment ("THE"). On January 1, 2005, Raskin announced the new name, and that Archy would be further developed by the non-profit Raskin Center for Humane Interfaces. The name "Archy" is a play on the Center's acronym, R-CHI. It is also an allusion to Don Marquis' archy and mehitabel poetry. Jef Raskin jokingly stated: "Yes, we named our software after a bug" (a cockroach), further playing with the meaning of bugs in software.
Basic concept
The stated goal of Archy is to design a software system starting from an understanding of human cognition and the needs of the user, rather than from a software, hardware, or marketing viewpoint. It aims to be usable by disabled persons, the technology-averse, as well as computer specialists. This ambitious plan to build a general purpose environment that is easy to use for anyone is based on designing for the common cognitive capabilities of all humans.
The plan includes making the interface as "modeless" as possible, to avoid mode errors and encourage habituation. In order to achieve this, modal features of current graphical user interfaces, like windows and separate software applications, are removed.
Features
Persistence
All content in Archy is persistent. This eliminates the need for, and the concept of, saving a document after editing it. The system state is preserved and safe from crashes and power outages: if the system crashes or power goes off, one simply restarts the system and takes up working where one left off when the problem occurred.
Universal undo
A detailed history of the user's interaction allows all actions to be undone since his/her ve |
https://en.wikipedia.org/wiki/Iliffe%20vector | In computer programming, an Iliffe vector, also known as a display, is a data structure used to implement multi-dimensional arrays.
Data structure
An Iliffe vector for an n-dimensional array (where n ≥ 2) consists of a vector (or 1-dimensional array) of pointers to an (n − 1)-dimensional array. They are often used to avoid the need for expensive multiplication operations when performing address calculation on an array element. They can also be used to implement jagged arrays, such as triangular arrays, triangular matrices and other kinds of irregularly shaped arrays. The data structure is named after John K. Iliffe.
Their disadvantages include the need for multiple chained pointer indirections to access an element, and the extra work required to determine the next row in an n-dimensional array to allow an optimising compiler to prefetch it. Both of these are a source of delays on systems where the CPU is significantly faster than main memory.
The Iliffe vector for a 2-dimensional array is simply a vector of pointers to vectors of data, i.e., the Iliffe vector represents the columns of an array where each column element is a pointer to a row vector.
Multidimensional arrays in languages such as Java, Python (multidimensional lists), Ruby, Visual Basic .NET, Perl, PHP, JavaScript, Objective-C (when using NSArray, not a row-major C-style array), Swift, and Atlas Autocode are implemented as Iliffe vectors. Iliffe vectors were used to implement sparse multidimensional arrays in the OLAP product Holos.
Iliffe vectors are contrasted with dope vectors in languages such as Fortran, which contain the stride factors and offset values for the subscripts in each dimension.
References
Further reading
Arrays |
https://en.wikipedia.org/wiki/Modality%20%28human%E2%80%93computer%20interaction%29 | In the context of human–computer interaction, a modality is the classification of a single independent channel of input/output between a computer and a human. Such channels may differ based on sensory nature (e.g., visual vs. auditory), or other significant differences in processing (e.g., text vs. image).
A system is designated unimodal if it has only one modality implemented, and multimodal if it has more than one. When multiple modalities are available for some tasks or aspects of a task, the system is said to have overlapping modalities. If multiple modalities are available for a task, the system is said to have redundant modalities. Multiple modalities can be used in combination to provide complementary methods that may be redundant but convey information more effectively. Modalities can be generally defined in two forms: human-computer and computer-human modalities.
Computer–Human modalities
Computers utilize a wide range of technologies to communicate and send information to humans:
Common modalities
Vision – computer graphics typically through a screen
Audition – various audio outputs
Tactition – vibrations or other movement
Uncommon modalities
Gustation (taste)
Olfaction (smell)
Thermoception (heat)
Nociception (pain)
Equilibrioception (balance)
Any human sense can be used as a computer to human modality. However, the modalities of seeing and hearing are the most commonly employed since they are capable of transmitting information at a higher speed than other modalities, 250 to 300 and 150 to 160 words per minute, respectively. Though not commonly implemented as computer-human modality, tactition can achieve an average of 125 wpm through the use of a refreshable Braille display. Other more common forms of tactition are smartphone and game controller vibrations.
Human–computer modalities
Computers can be equipped with various types of input devices and sensors to allow them to receive information from humans. Common input devices are often interchangeable if they have a standardized method of communication with the computer and afford practical adjustments to the user. Certain modalities can provide a richer interaction depending on the context, and having options for implementation allows for more robust systems.
Simple modalities
Keyboard
Pointing device
Touchscreen
Complex modalities
Computer vision
Speech recognition
Motion
Orientation
With the increasing popularity of smartphones, the general public are becoming more comfortable with the more complex modalities. Motion and orientation are commonly used in smartphone mapping applications. Speech recognition is widely used with Virtual Assistant applications. Computer Vision is now common in camera applications that are used to scan documents and QR codes.
Using multiple modalities
Having multiple modalities in a system gives more affordance to users and can contribute to a more robust system. Having more also allows for greater accessibility for users who w |
https://en.wikipedia.org/wiki/Document%21%20X | Document! X is a documentation generator which automates technical documentation production for C#/VB.NET/C++/CLI or other .NET language assemblies, Java Projects, databases, COM components, type libraries, XSD schemas and ASP.NET Ajax Javascript. Document! X consists of an authoring and documentation build environment (including HTML based Visual Authoring tools) as well as Visual Comment Editor Add-Ins for Visual Studio (2005, 2008, 2010 and 11).
See also
Comparison of documentation generators
External links
Document! X webpage
Documentation generators |
https://en.wikipedia.org/wiki/Peiter%20Zatko | Peiter C. Zatko, better known as Mudge, is an American network security expert, open source programmer, writer, and hacker. He was the most prominent member of the high-profile hacker think tank the L0pht as well as the computer and culture hacking cooperative the Cult of the Dead Cow.
While involved with the L0pht, Mudge contributed to disclosure and education on information and security vulnerabilities. In addition to pioneering buffer overflow work, the security advisories he released contained early examples of flaws in the following areas: code injection, race condition, side-channel attack, exploitation of embedded systems, and cryptanalysis of commercial systems. He was the original author of the password cracking software L0phtCrack.
In 2010, Mudge accepted a position as a program manager at DARPA where he oversaw cyber security research. In 2013, Mudge went to work for Google in their Advanced Technology & Projects division. In 2020, he was hired as head of security at Twitter. He currently works at the security consulting firm Rapid7 that develops Metasploit.
Biography
Born in December 1970, Mudge graduated from the Berklee College of Music at the top of his class and is an adept guitar player.
Mudge was responsible for early research into a type of security vulnerability known as the buffer overflow. In 1995 he published "How to Write Buffer Overflows", one of the first papers on the topic. He published some of the first security advisories and research demonstrating early vulnerabilities in Unix such as code injection, side-channel attacks, and information leaks, and was a leader in the full disclosure movement. He was the initial author of security tools L0phtCrack, AntiSniff, and l0phtwatch.
Mudge was one of the first people from the hacker community to reach out and build relationships with government and industry. In demand as a public speaker, he spoke at hacker conferences such as DEF CON and academic conferences such as USENIX. Mudge has also been a member of Cult of the Dead Cow since 1996.
He was one of the seven L0pht members who testified before a Senate committee in 1998 about the serious vulnerabilities of the Internet at that time. The L0pht became the computer security consultancy @stake in 1999, and Mudge became the vice president of research and development and later chief scientist.
In 2000, after the first crippling Internet distributed denial-of-service attacks, he was invited to meet with President Bill Clinton at a security summit alongside cabinet members and industry executives.
In 2004 he became a division scientist at government contractor BBN Technologies, where he originally worked in the 1990s, and also joined the technical advisory board of NFR Security. In 2010, it was announced that he would be project manager of a DARPA project focused on directing research in cyber security. In 2013 he announced that he would leave DARPA for a position at Google ATAP. In 2015 Zatko announced on Twitter he would |
https://en.wikipedia.org/wiki/Chris%20Wysopal | Chris Wysopal (also known as Weld Pond) is an entrepreneur, computer security expert and co-founder and CTO of Veracode. He was a member of the high-profile hacker think tank the L0pht where he was a vulnerability researcher.
Chris Wysopal was born in 1965 in New Haven, Connecticut, his mother an educator and his father an engineer. He attended Rensselaer Polytechnic Institute in Troy, New York where he received a bachelor's degree in computer and systems engineering in 1987.
Career
He was the seventh member to join the L0pht. His development projects there included Netcat and L0phtCrack for Windows. He was also webmaster/graphic designer for the L0pht website and for Hacker News Network, the first hacker blog. He researched and published security advisories on vulnerabilities in Microsoft Windows, Lotus Domino, Microsoft IIS, and ColdFusion. Weld was one of the seven L0pht members who testified before a Senate committee in 1998 that they could bring down the Internet in 30 minutes. When L0pht was acquired by @stake in 1999 he became the manager of @stake's Research Group and later @stake's Vice President of Research and Development. In 2004 when @stake was acquired by Symantec he became its Director of Development. In 2006 he founded Veracode with Christien Rioux and serves as CTO. In 2017 Veracode was acquired by CA Technology for $614M. Veracode was subsequently spun out and became independent once again by being purchased by Thoma Bravo for $950M. Wysopal continues to serve as CTO.
In 2018 Wysopal joined the Humanyze board of directors.
Wysopal was instrumental in developing industry guidelines for responsible disclosure of software vulnerabilities. He was a contributor to RFPolicy, the first vulnerability disclosure policy. Together with Steve Christey of MITRE he proposed an IETF RFC titled "Responsible Vulnerability Disclosure Process" in 2002. The process was eventually rejected by the IETF as not within their purview but the process did become the foundation for Organization for Internet Safety, an industry group bringing together software vendors and security researchers of which he was a founder. In 2001 he founded the non-profit full disclosure mailing list VulnWatch for which was moderator. In 2003 he testified before a United States House of Representatives subcommittee on the topic of vulnerability research and disclosure.
In 2008 Wysopal was recognized for his achievements in the IT industry by being named one of the 100 Most Influential People in IT by eWeek and selected as one of the InfoWorld CTO 25. In 2010 he was named a SANS Security Thought Leader. In 2012, he began serving on the Black Hat Review Board. He was named one of the Top 25 Disruptors of 2013 by Computer Reseller News. In 2014 he was named one of 5 Security Thought Leaders by SC Magazine.
Patents
U.S. Patent 10,275,600, Assessment and analysis of software security flaws
U.S. Patent 9,672,355, Automated behavioral and static analysis using an instrumente |
https://en.wikipedia.org/wiki/Homer%20Defined | "Homer Defined" is the fifth episode of the third season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on October 17, 1991. In the episode, Homer accidentally saves the Springfield Nuclear Power Plant from meltdown by arbitrarily choosing the emergency override button using a counting rhyme. Homer is honored as a hero and idolized by his daughter Lisa, but feels unworthy of praise, knowing his apparent heroism was blind luck. Meanwhile, Bart is downhearted after learning that Milhouse's mother forbids the boys to play together anymore because she thinks he is a bad influence on her son.
The episode was written by freelance writer Howard Gewirtz and directed by Mark Kirkland. Basketball player Magic Johnson of the Los Angeles Lakers made a guest appearance in the episode as himself, becoming the first professional athlete to do so on the show. He appears in two sequences, one in which he calls Homer to congratulate him on saving the plant, the second during a game sequence in which Lakers sportscaster Chick Hearn also guest stars.
The episode has received generally positive reviews from critics, particularly Johnson's appearance.
In its original airing on Fox, "Homer Defined" acquired a 12.7 Nielsen rating—the equivalent of being watched in approximately 11.69 million homes—and finished the week ranked 36th.
Plot
While eating donuts at the Springfield Nuclear Power Plant, Homer splatters jelly on the nuclear reactor core's temperature dial. The donut filling obscures the panel and the plant approaches a nuclear meltdown. Unable to remember his safety training (because he was playing with a Rubik's cube at the time), Homer chooses a button at random with a counting rhyme, which miraculously averts the meltdown. Springfield is saved and Homer is hailed as a hero.
Mr. Burns names Homer "Employee of the Month". Lisa, often embarrassed by her dim-witted dad, starts to worship him as a role model. Homer feels guilty that his so-called heroism was nothing but blind luck. His despair deepens after he receives a congratulatory phone call from Magic Johnson (who used the Lakers' last time out to call Homer personally), who tells him frauds are eventually exposed.
Burns introduces Homer to Aristotle Amadopolis, the owner of the nuclear power plant in neighboring Shelbyville. Burns forces Homer to deliver a motivational speech to the Shelbyville workers. During Homer's fumbling address, an impending meltdown threatens the Shelbyville plant. In the control room, Amadopolis asks Homer to avert the disaster. Homer repeats his rhyme and blindly presses a button. By sheer luck, he again avoids a meltdown. Amadopolis ironically "thanks" Homer for saving the plant though then berates him for his stupidity. Soon the phrase to pull a Homer, meaning "to succeed despite idiocy," becomes a widely used catchphrase; its dictionary entry is illustrated by Homer's portrait.
In the subplot, Bart is |
https://en.wikipedia.org/wiki/ThinkCentre | The ThinkCentre is a line of business-oriented desktop computers designed, developed and marketed by Lenovo, and formerly by IBM from 2003 to 2005. ThinkCentre computers typically include mid-range to high-end processors, options for discrete graphics cards, and multi-monitor support.
History
Launch
The ThinkCentre line of desktop computers was introduced by IBM in 2003. The first three models in this line were the S50, the M50, and A50p. All three desktops were equipped with Intel Pentium 4 processors. The chassis was made of steel and designed for easy component access without the use of tools. The hard disk was fixed in place by a 'caddy' without the use of screws. The caddy had rubber bumpers to reduce vibration and operational noise.
Additional updates to the desktops included greater use of ThinkVantage technologies. All desktop models were made available with ImageUltra. The three desktop models also included an 'Access IBM' button, allowing access to onboard resources, diagnostic tools, automated software, and links to online updates and services. Select models featured IBM's Embedded Security Subsystem, with an integrated security chip and IBM Client Security Software.
Acquisition by Lenovo
In 2005, after completing its acquisition of IBM's personal computing business, leading to the IBM/Lenovo partnership, IBM/Lenovo announced the ThinkCentre E Series desktops, designed specifically for small businesses. The ThinkCentre E50 was made available in tower and small form factor, with a silver and black design.
In 2005, Technology Business Research (TBR) observed an increase in the customer satisfaction rate for ThinkCentre desktops. According to TBR's "Corporate IT Buying Behavior and Customer Satisfaction Study” published in the second quarter of 2005, Lenovo was the only one of four surveyed companies that displayed a substantial increase in ratings.
In May 2005, the ThinkCentre M52 and A52 desktops were announced by Lenovo. These desktops marked the first time the ThinkCentre line incorporated dual-core processors and 64-bit technology. At the time of release, Lenovo also announced plans to incorporate Intel Active Management Technology in future products.
Product series
The ThinkCentre desktops available from IBM/Lenovo are:
ThinkCentre A Series (SFF and AIO)
ThinkCentre M Series (in tower, SFF, and USFF)
ThinkCentre Edge (in tower and AIO form factors)
Notable Models
ThinkCentre X1
The ThinkCentre X1 is a mid-range all-in-one desktop computer announced by Lenovo at the 2016 International CES. The X1 is powered by a "Skylake" Intel Core i7 processor paired with 16 gigabytes of 2,333 megahertz DDR4 RAM and a variety of storage media such as hard drives, hybrid drives, and solid state drives. The display uses 23.8-inch 1920 pixel by 1080 pixel panel with an anti-glare coating. A 1080p webcam is mounted just above the screen. Five USB 3.0 ports, DisplayPort video output, and an Ethernet port come standard. A memory card reade |
https://en.wikipedia.org/wiki/Scenes%20from%20the%20Class%20Struggle%20in%20Springfield | "Scenes from the Class Struggle in Springfield" is the fourteenth episode of the seventh season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on February 4, 1996. In this episode, Marge buys a Chanel suit and is invited to join the Springfield Country Club. Marge becomes obsessed with trying to fit in, but she decides she would rather go back to the way things were than continue to pursue high social ambitions.
The episode was written by Jennifer Crittenden and directed by Susie Dietter. It was the first time that a female writer and director were credited in the same episode. Tom Kite guest starred in the episode, and he enjoyed recording his parts for it. The episode's title is based on the 1989 film Scenes from the Class Struggle in Beverly Hills.
Since airing, the episode has received mostly positive reviews from television critics. It acquired a Nielsen rating of 8.8, and was the fifth-highest-rated show on the Fox network the week it aired.
Plot
The Simpsons travel to the Ogdenville mall to buy a new television after Grampa breaks their old one. Marge and Lisa visit a discount store, where Marge finds a $2800 Chanel suit on sale for $90. Later Marge encounters an old classmate, Evelyn, at the Kwik-E-Mart. Evelyn is impressed by Marge's fashion sense and invites her to the Springfield Country Club.
Desperately trying to fit in with Evelyn's snobby friends at the club, Marge ignores their catty remarks after she wears the same Chanel suit on each visit. Lisa enjoys horseback riding at the club, but the rest of the family is uncomfortable there. After being trained by Tom Kite, Homer plays golf on the club's greens and learns Waylon Smithers is helping Mr. Burns cheat while caddying for him. In exchange for Homer's silence, Burns agrees to help Marge join the club.
Marge tries to alter her suit for the club membership ceremony, but accidentally destroys it with her sewing machine, forcing her to buy a new Chanel evening gown. As the family walks toward the party, Marge criticizes everyone else's behavior. When Homer tells the children they should thank her for pointing out how bad they really are, Marge realizes she has changed for the worse. The family skips the party and goes to Krusty Burger instead, unaware that the club has accepted Marge's membership.
Production
The episode was written by Jennifer Crittenden and directed by Susie Dietter. It was the first time a female writer and director were credited in the same episode. The episode's title is a parody of the film Scenes from the Class Struggle in Beverly Hills. The first script of the episode was too long and it had to be cut down. Dietter remembered that it "took on a more serious tone" because they had to keep the parts that were essential to the story and cut the many "throwaway gags". Bill Oakley, the show runner of The Simpsons at the time, praised the episode for having a "terrific" story that "really |
https://en.wikipedia.org/wiki/GarageGames | GarageGames was a game technology and software developer. GarageGames was the parent company of GG Interactive, developers of educational technology in the areas of computer science, video game development and programming. In addition, the company has been a video game developer and publisher. GarageGames created several game engines targeted for indie development. Founded in Eugene, Oregon, the company had offices in Las Vegas, Nevada, United States and its headquarters in Vancouver, Washington. In 2007, GarageGames was acquired by IAC and the company was renamed TorquePowered. In 2011, the company was purchased by Graham Software Development and reverted to the original name GarageGames.
History
GarageGames was founded in Eugene, Oregon in 2000 by Jeff Tunnell, Tim Gift, Rick Overman, and Mark Frohnmayer. Working in their garage on severance checks, the founders derived the name GarageGames as a play off the term "garage band", and is meant to evoke a similar attitude in game development. The stated goal of the original founders of GarageGames was to offer licensing of game engines to virtually anyone, allowing independent game-makers more options in developing and publishing video games. In 2001, GarageGames released the Torque game engine. It was used to create the Tribes game series and was released at an initial price point to allow independent game developers access. Later the company expanded its product lines with additional tools, and more advanced engines and introduced tiered licensing. In 2005, the company introduced Enterprise licenses for large companies and educational institutions available for annual fees ranging from tens of thousands to hundreds of thousands of dollars per year. In 2006, its developer community surpassed 100,000 users. Over its history, the company launched several of its own games, including Marble Blast Ultra for Microsoft Windows and Xbox Live Arcade.
In 2006, GarageGames acquired BraveTree Technologies, developers of Think Tanks and real-time networked multiplayer physics technology. In 2007, Barry Diller and InterActive Corporation (NASD: IACI) acquired a majority interest in GarageGames for an estimated $80–100M in cash and renamed the company InstantAction. InterActive Corporation later bought out the remainder of GarageGames' equity for an undisclosed sum and on July 15, 2009, Louis Castle, notable for his Command & Conquer series, would become the CEO of GarageGames and InstantAction. The company headquarters were moved to Las Vegas and some employees relocated to Portland, Oregon. Shortly after the move, the "GarageGames" brand was retired.
On November 11, 2010 it was announced that IAC was shutting down InstantAction, and the intellectual property for the Torque game engine would be sold off. On January 20, 2011, the Torque engine and GarageGames brand was purchased and the company was re-launched, as GarageGames again, with new CEO Eric Preisz. The company moved to a new office in Las Vegas, |
https://en.wikipedia.org/wiki/Larn%20%28video%20game%29 | Larn is a roguelike computer game written by Noah Morgan in 1986 for the UNIX operating system. Morgan's original version of Larn remains part of the NetBSD games collection.
Larn is one of the shorter roguelike games. It can take many hours and tens (or even hundreds) of thousands of game turns to beat other roguelikes, such as NetHack or Ancient Domains of Mystery, but Larn can reasonably be completed in one play session.
History
Primary development of Larn halted in 1991 with version 12.3, but its open source nature has led to later variants. Developers have ported the game to such diverse operating systems as Solaris, Amiga OS, Atari TOS, and Microsoft Windows.
In October 2015, a GitHub repository was created and Larn started to be developed and maintained once again from the original source code. This makes Larn one of the oldest video games still being developed.
ULarn
In 1987, Phil Cordier modified the Larn source code to form Ultra-Larn, or more commonly, ULarn. It introduced true character classes and additional levels, weapons, etc. As with its parent, other developers have maintained and refined ULarn in the absence of its author.
Gameplay
Larn is one of the first roguelike games to feature a persistent home level - in this case, a town. In addition to the player's residence, the town offers a bank, a shop, a trading post, a school, a tax administration office, and entrances to two dungeons, one of which is a volcano.
The goal of Larn is for the player to traverse a dungeon in search of a potion that will cure his ailing daughter of 'dianthroritis'. This quest is time-limited, measured in 'mobuls'. Apart from the main dungeon's ten levels, three additional levels are located beneath a volcanic shaft. To obtain the sought-after potion, the player must first acquire adequate experience, power, and gold. Larn increases in difficulty each time it is finished, making it harder for players to perform in-game actions, such as destroying walls or statues. Larn also requires the player pay a tax in subsequent games based on the amount of money in the player's possession when the game was last won.
References
External links
The unofficial Larn game homepage with links to articles, source code, other variants of Larn, and an option to play the DOS and Amiga versions of Larn online
Josh Brandt's ULarn
Larn Blog with Strategies/Easter Eggs
NLarn, an adaptation of Larn for Linux, Mac OS X, Windows
dLarn - a free (no ads, no in-game purchases) re-implementation of uLarn for Android with graphics
XLarn, a heavily extended version of Larn
Roguelike video games
1986 video games
Video games with available source code
Video games developed in the United States |
https://en.wikipedia.org/wiki/Erick%20Wujcik | Erick A. Wujcik (January 26, 1951 – June 7, 2008) was an American designer of both pen-and-paper and computer role-playing games, and co-founder of Palladium Books.
Gaming career
Wujcik started off as head of the gaming society at Wayne State University, The Warriors and Warlocks of the Wayne Weregamers Society, also known as the Wayne State Weregamers, where he met and befriended Kevin Siembieda. By 1980 the Wayne Weregamers became known as the Detroit Gaming Center, when Wujcik, the CDM (Caucus of Dungeon Masters) and Siembieda moved the group from the Monteith House, scheduled for demolition, to an off-campus building that was being maintained by a non-profit; Wujcik became Director for the Center with Siembieda as Assistant Director. Wujcik published the science-fiction adventure Sector 57 (1980) under the banner of the Detroit Gaming Center. Wujcik worked as a computer columnist for The Detroit News where he wrote their weekly "Computer Column" from 1979 to 1981. That served to be a springboard for him to co-found Palladium Books with Kevin Siembieda and to work on developing numerous role-playing games and supplements for such settings as Palladium Fantasy Role-Playing Game, Teenage Mutant Ninja Turtles & Other Strangeness, After the Bomb, Rifts, and many others, including Amber Diceless Roleplaying Game and Paranoia.
Siembieda obtained the rights to produce a licensed roleplaying game based on the Teenage Mutant Ninja Turtles comic book, but he did not approve of the freelancer's final product so he had Wujcik redesign the game, which was done in five weeks, and it was published as Teenage Mutant Ninja Turtles & Other Strangeness (1985). Wujcik designed Revised Recon (1987), a role-playing game revision of the miniatures warfare game Recon (1982). Wujcik also designed the Ninjas & Superspies role-playing game in 1988, which benefited from his long-term interest and extensive research on Japan. Wujcik also wrote the After the Bomb role-playing for Palladium. He also did freelance work for West End Games, and wrote one of the early Clones in Space (1986) adventure for the Paranoia roleplaying game, and made contributions to the Acute Paranoia (1986) supplement for the game as well.
While working at West End Games, Wujcik learned that the company held a license from Roger Zelazny for his Amber novels, which were among the favorite novels of Wujcik, and he offered to design an Amber role-playing game even through West End would not guarantee to publish it. While playtesting the game, Wujcik found that it worked better without dice, but West End disagreed, so he acquired the role-playing game rights to Amber. He began developing the game for R. Talsorian Games in the early 1990s, but encountered creative differences there as well. Siembieda encouraged Wujcik to set up his own company to publish the game, and Wujcik founded Phage Press. Wujcik hired his cousins Lisa and Ron Seymour to run the business side of the company. Phage Press thus |
https://en.wikipedia.org/wiki/Ishiyama%20Hongan-ji%20War | The , taking place from 1570 to 1580 in Sengoku period Japan, was a ten-year campaign by lord Oda Nobunaga against a network of fortifications, temples, and communities belonging to the Ikkō-ikki, a powerful faction of Jōdo Shinshū Buddhist monks and peasants opposed to the rule of the samurai class. It centered on attempts to take down the Ikki's central base, the cathedral fortress of Ishiyama Hongan-ji, in what is today the city of Osaka. While Nobunaga and his allies led attacks on Ikki communities and fortifications in the nearby provinces, weakening the Hongan-ji's support structure, elements of his army remained camped outside the Hongan-ji, blocking supplies to the fortress and serving as scouts.
Background
The Ikkō-ikki leagues of warrior monks and commoners were among the last to stand in the way of Oda Nobunaga's bid to conquer all of Japan. Oda and Tokugawa had fought the Ikki before, crushing their armies of Mikawa Province and other areas, and by 1570, their twin fortresses of Ishiyama Hongan-ji and Nagashima were their last bastions of strength. He besieged both fortresses simultaneously, attacking Ishiyama in August 1570 and Nagashima in 1571.
Siege
In August 1570, Oda Nobunaga left Gifu Castle in Gifu with 30,000 troops, and ordered his generals to build fortresses around Ishiyama, while Nobunaga himself focused on the Sieges of Nagashima fortress and other campaigns.
On September 12, the Ikkō-ikki launched a midnight stealth attack against Nobunaga's forces at Kawaguchi and Takadono. The Ikko were reinforced by warrior monks from Negoro-ji in Kii Province and 3,000 musketeers, pushing Oda's army back.
Nobunaga's armies remained camped out, assigned to monitor the Ikki's fortress, and take it if they could.
In 1574, after destroying the Nagashima complex and reducing the threat from the Ikki's supporters, Oda attempted to starve out the fortress. This was no easy task, however, because the Ishiyama fortress sat on the coast, which was guarded by the fleet of the Mōri clan, masters of naval combat and Oda's enemies.
By early 1575, however, the fortress was already in urgent need of supplies, and the Abbot Kōsa was ready to begin peaceful overtures with Nobunaga to end the siege. But the ousted shōgun Ashikaga Yoshiaki sent a letter to Mōri Terumoto asking for his aid in supplying the cathedral fortress. Yoshiaki eventually raised some troops himself to aid the besieged.
Battle of Tennoji
In April 1576, Oda's army attacked the Hongan-ji fortress, led by Harada Naomasa, Akechi Mitsuhide, Hosokawa Fujitaka, Tsutsui Junkei, Nakagawa Kiyohide, Takayama Ukon, Araki Murashige, and Sakuma Nobuhide, but Oda forces were quickly repelled by 15,000 Ikkō-ikki defenders. Mitsuhide and Nobuhide made a request for reinforcements to Nobunaga who was staying in Kyōto. Later, Nobunaga himself personally came. He led an army of only 3,000 men to attack as many as 15,000 enemy forces, along with Niwa Nagahide, Hashiba Hideyoshi, Takigawa Kazum |
https://en.wikipedia.org/wiki/World%20Movement%20for%20Democracy | World Movement for Democracy is an international network of individuals and organizations who share the common goal of promoting democracy. The World Movement was launched in February 1999 when the National Endowment for Democracy (NED) and two nongovernmental organizations in India brought together a cross-section of democracy activists, practitioners, and scholars from over 80 countries in New Delhi for discussions of ways to advance democracy. The participants adopted a Founding Statement launching the World Movement "to strengthen democracy where it is weak, to reform and invigorate democracy even where it is longstanding, and to bolster pro-democracy groups in countries that have not yet entered into a process of democratic transition." It is intended to unite the global community of democracy advocates and practitioners; to facilitate exchanges of information, knowledge, and experiences; and to build cross-border solidarity. The World Movement is led by an international steering committee, and NED currently serves as its secretariat.
A "network of networks", the World Movement has led to the establishment of regional networks, including the African Democracy Forum (ADF), the Latin America and Caribbean Network for Democracy (LAC Network), and the World Forum for Democratization in Asia (WFDA), as well as functional global networks, including the Global Network on Local Governance (GNLG), the International Women’s Democracy Network (IWDN), the Network of Democracy Research Institutes (NDRI), and the World Youth Movement for Democracy (WYMD).
The World Movement has held five global assemblies since its founding in New Delhi in 1999: São Paulo, Brazil (2000); Durban, South Africa (2004); Istanbul, Turkey (2006); Kyiv, Ukraine (2008); and Jakarta, Indonesia (2010). It has also initiated two major projects as a result of assembly discussions: The Defending Civil Society project was launched in 2006 in collaboration with the International Center for Not-for-Profit Law (ICNL) to respond to efforts among an increasing number of governments to close down civil society space, particularly for democracy and human rights groups, through new “NGO laws” and restrictions on international funding.
References
External links
Organizations based in Washington, D.C.
National Endowment for Democracy |
https://en.wikipedia.org/wiki/Rosebud%20%28The%20Simpsons%29 | "Rosebud" is the fourth episode of the fifth season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on October 21, 1993. In the episode, Mr. Burns misses his childhood teddy bear Bobo on the eve of his birthday. After flashbacks reveal Bobo's journey through history, the bear ends up in the hands of Maggie Simpson. Burns does everything in his power to get Bobo back.
"Rosebud" was directed by Wes Archer and written by John Swartzwelder. It was the first episode to be executive-produced by David Mirkin, who was the show runner for the fifth and sixth seasons of the show. Supervising director David Silverman describes the episode as "one of the more challenging ones" to direct. The Ramones (Joey Ramone, Johnny Ramone, C. J. Ramone and Marky Ramone) guest-star in the episode as themselves. The episode is largely a parody of the 1941 film Citizen Kane and the title references Charles Foster Kane's dying word "Rosebud". The episode contains references to The Wizard of Oz, Planet of the Apes, George Burns, Charles Lindbergh, The Rolling Stones and Adolf Hitler.
Since airing, “Rosebud" has received universal acclaim from fans and television critics. In 2003, Entertainment Weekly placed the episode in second place on their list of the 25 best episodes of The Simpsons.
Plot
While he sleeps, Mr. Burns reminisces on his early childhood: he lived with his family and cherished his teddy bear Bobo, which he dropped in the snow when he left home to live with a "twisted, loveless billionaire". It is revealed that Bobo ended up being found by Charles Lindbergh, then by Adolf Hitler, after which it wound up at the North Pole. In the present, Burns becomes so obsessed with finding Bobo that he cannot enjoy the elaborate birthday celebration Smithers arranges for him. After Homer Simpson performs a loutish stand-up routine where he insults Mr. Burns and moons at the crowd, Burns has his security guards break up the party by beating the guests and orders Smithers to kill the Ramones (mistakenly calling them the Rolling Stones) after they performed a scathing punk rock rendition of "Happy Birthday to You" to Burns. After Homer is injured at the party, Bart buys a bag of ice, which was harvested in an expedition to the North Pole in 1993. Bart finds Bobo in the bag and gives him to Maggie to play with.
When Homer realizes Maggie is playing with Bobo, he negotiates a deal with Burns to exchange the bear for a million dollars and three Hawaiian islands. After Maggie refuses to give up Bobo, Homer calls off the deal. Burns is outraged and promises vengeance unless he gets Bobo back. After several failed attempts to steal the bear, Burns subjects Homer to harsh work at the nuclear power plant. Through a television broadcast, Burns explains that he is cutting off Springfield's beer supply and hijacking its television channels as a way of extorting Homer, and tells Springfield's townspeople to talk to Homer |
https://en.wikipedia.org/wiki/Base%20address | In computing, a base address is an address serving as a reference point ("base") for other addresses. Related addresses can be accessed using an addressing scheme.
Under the relative addressing scheme, to obtain an absolute address, the relevant base address is taken and an offset (aka displacement) is added to it. Under this type of scheme, the base address is the lowest numbered address within a prescribed range, to facilitate adding related positive-valued offsets.
In IBM System/360 architecture, the base address is a 24-bit value in a general register (extended in steps to 64 bits in z/Architecture), and the offset is a 12 bit value in the instruction (extended to 20 bits in z/Architecture).
See also
Index register
Rebasing
Computer memory |
https://en.wikipedia.org/wiki/Mahadev%20Satyanarayanan | Mahadev "Satya" Satyanarayanan is an Indian experimental computer scientist, an ACM and IEEE fellow, and the Carnegie Group Professor of Computer Science at Carnegie Mellon University (CMU).
He is credited with many advances in edge computing, distributed systems, mobile computing, pervasive computing, and Internet of Things. His research focus is around performance, scalability, availability, and trust challenges in computing systems from the cloud to the mobile edge.
His work on the Andrew File System (AFS) was recognized with the ACM Software System Award in 2016 and the ACM SIGOPS Hall of Fame Award in 2008 for its influence and impact. His work on disconnected operation in Coda File System received the ACM SIGOPS Hall of Fame Award in 2015 and the inaugural ACM SIGMOBILE Test-of-Time Award in 2016.
He served as the founding Program Chairman of the IEEE/ACM Symposium on Edge Computing and the HotMobile workshops, the founding Editor-in-Chief of IEEE Pervasive Computing, and the founding Area Editor for the Synthesis Series on Mobile and Pervasive Computing. In addition, he was the founding director of Intel Research Pittsburgh and an advisor to the company Maginatics, which was acquired by EMC in 2014.
Education
He has a bachelor's and master's degree from Indian Institute of Technology, Madras in 1975 and 1977, and his Ph.D. in computer science from CMU in 1983.
Andrew File System
Satya was a principal architect and implementer of the Andrew File System (AFS), the technical forerunner of modern cloud-based storage systems. AFS has been continuously deployed at CMU since 1986, at a scale of many thousands of users. From its conception in 1983 as the unifying campus-wide IT infrastructure for CMU, AFS evolved through versions AFS-1, AFS-2 and AFS-3. In mid-1989, AFS-3 was commercialized by Transarc Corporation and its evolution continued outside CMU. Transarc was acquired by IBM, and AFS became an IBM product for a number of years. In 2000, IBM released the code to the open source community as OpenAFS. Since its release as OpenAFS, the system has continued to be used in many enterprises all over the world. In the academic and research lab community, OpenAFS is in use at more than 30 sites in the United States (including CMU, MIT, and Stanford) and dozens of sites in Europe, New Zealand, and South Korea. Many global companies have used OpenAFS including Morgan Stanley, Goldman Sachs, Qualcomm, IBM, United Airlines, Pfizer, Hitachi, InfoPrint, and Pictage.
Over a 30-year period, AFS has been a seminal influence on academic research and commercial practice in distributed data storage systems for unstructured data. The design principles that were initially discovered and validated in the creation and evolution of AFS have influenced virtually all modern commercial distributed file systems, including Microsoft DFS, Google File System, Lustre File System, Ceph, and NetApp ONTAP. In addition, AFS inspired the creation of DropBox whose f |
https://en.wikipedia.org/wiki/Toronto%20streetcar%20system | The Toronto streetcar system is a network of ten streetcar routes in Toronto, Ontario, Canada, operated by the Toronto Transit Commission (TTC). It is the third busiest light-rail system in North America. The network is concentrated primarily in Downtown Toronto and in proximity to the city's waterfront. Much of the streetcar route network dates from the 19th century. Most of Toronto's streetcar routes operate on street trackage shared with vehicular traffic, and streetcars stop on demand at frequent stops like buses. Since 2019, the network has used low-floor streetcars, making it fully accessible.
Toronto's streetcars provide most of the downtown core's surface transit service. Four of the TTC's five most heavily used surface routes are streetcar routes. In , the system had a ridership of , or about per weekday as of .
History
Pre-TTC history (1861–1921)
The main predecessors of the TTC were:
Toronto Street Railway (1861–1891)
Toronto Railway Company (1891–1921)
Toronto Civic Railways (1911–1921)
In 1861, the City of Toronto issued a thirty-year transit franchise (Resolution 14, By-law 353) for a horse-drawn street railway, after the Williams Omnibus Bus Line had become heavily loaded. Alexander Easton's Toronto Street Railway (TSR) opened the first street railway line in Canada on September 11, 1861, operating from Yorkville Town Hall to the St. Lawrence Market. At the end of the TSR franchise, the City government ran the railway for eight months but ended up granting a new thirty-year franchise to the Toronto Railway Company (TRC) in 1891. The TRC was the first operator of horseless streetcars in Toronto. The first electric car ran on August 15, 1892, and the last horse car ran on August 31, 1894, to meet franchise requirements.
There came to be problems with interpretation of the franchise terms for the City. By 1912, the city limits had extended significantly, with the annexation of communities to the north (1912: North Toronto) and the east (1908: Town of East Toronto) and the west (1909: the City of West Toronto—The Junction). After many attempts to force the TRC to serve these areas, the City created its own street railway operation, the Toronto Civic Railways (TCR) to do so, and built several routes. Repeated court battles forced the TRC to build new cars, but they were of old design. When the TRC franchise ended in 1921, the Toronto Transportation Commission was created, combining the city-operated Toronto Civic Railways lines into its new network.
Early TTC history (1921–1945)
The TTC began in 1921 as solely a streetcar operation, with the bulk of the routes acquired from the private TRC and merged with the publicly operated Toronto Civic Railways. In 1923, the TTC took over the Lambton, Davenport and Weston routes of the Toronto Suburban Railway (TSR) and integrated them into the streetcar system.
In 1925, routes were operated on behalf of the Township of York (as Township of York Railway), but the TTC was contracted to |
https://en.wikipedia.org/wiki/Day%E2%80%93Stout%E2%80%93Warren%20algorithm | The Day–Stout–Warren (DSW) algorithm is a method for efficiently balancing binary search trees that is, decreasing their height to O(log n) nodes, where n is the total number of nodes. Unlike a self-balancing binary search tree, it does not do this incrementally during each operation, but periodically, so that its cost can be amortized over many operations. The algorithm was designed by Quentin F. Stout and Bette Warren in a 1986 CACM paper, based on work done by Colin Day in 1976.
The algorithm requires linear (O(n)) time and is in-place. The original algorithm by Day generates as compact a tree as possible: all levels of the tree are completely full except possibly the bottom-most. It operates in two phases. First, the tree is turned into a linked list by means of an in-order traversal, reusing the pointers in the (threaded) tree's nodes. A series of left-rotations forms the second phase.
The Stout–Warren modification generates a complete binary tree, namely one in which the bottom-most level is filled strictly from left to right. This is a useful transformation to perform if it is known that no more inserts will be done. It does not require the tree to be threaded, nor does it require more than constant space to operate. Like the original algorithm, Day–Stout–Warren operates in two phases, the first entirely new, the second a modification of Day's rotation phase.
A 2002 article by Timothy J. Rolfe brought attention back to the DSW algorithm; the naming is from the section title "6.7.1: The DSW Algorithm" in Adam Drozdek's textbook. Rolfe cites two main advantages: "in circumstances in which one generates an entire binary search tree at the beginning of processing, followed by item look-up access for the rest of processing" and "pedagogically within a course on data structures where one progresses from the binary search tree into self-adjusting trees, since it gives a first exposure to doing rotations within a binary search tree."
Pseudocode
The following is a presentation of the basic DSW algorithm in pseudocode, after the Stout–Warren paper. It consists of a main routine with three subroutines. The main routine is given by
Allocate a node, the "pseudo-root", and make the tree's actual root the right child of the pseudo-root.
Call tree-to-vine with the pseudo-root as its argument.
Call vine-to-tree on the pseudo-root and the size (number of elements) of the tree.
Make the tree's actual root equal to the pseudo-root's right child.
Dispose of the pseudo-root.
The subroutines are defined as follows:
routine tree-to-vine(root)
// Convert tree to a "vine", i.e., a sorted linked list,
// using the right pointers to point to the next node in the list
tail ← root
rest ← tail.right
while rest ≠ nil
if rest.left = nil
tail ← rest
rest ← rest.right
else
temp ← rest.left
rest.left ← temp.right
temp.right ← rest
rest ← te |
https://en.wikipedia.org/wiki/PaperWorks | PaperWorks was a computer program introduced by Xerox Corporation in 1992, which allowed a business traveler to communicate with his or her personal computer while away from the office.
PaperWorks could be used to send and retrieve documents between the fixed computer system and the business traveler, by using fax machines.
The software created special machine-readable forms, similar to the type of forms used to score standardized tests. (Related topic: OMR)
The user would then fax the form back to the central computer, commanding one of several tasks to be performed. For example:
the user could attach a document to the form which would be stored at the home office (for possible later processing), or
the user could request that a particular document, stored on the computer's hard drive, be sent to the user.
the user could request that a particular document be distributed to other users, also by fax.
The underlying technology for PaperWorks, called "DataGlyphs", was developed at Xerox PARC.
External links
Seybold Report on Desktop Publishing, May 1992
'The Risks Digest', April 1992
Xerox PARC Historical Timeline
Business software |
https://en.wikipedia.org/wiki/Networking%20hardware | Networking hardware, also known as network equipment or computer networking devices, are electronic devices that are required for communication and interaction between devices on a computer network. Specifically, they mediate data transmission in a computer network. Units which are the last receiver or generate data are called hosts, end systems or data terminal equipment.
Range
Networking devices includes a broad range of equipment which can be classified as core network components which interconnect other network components, hybrid components which can be found in the core or border of a network and hardware or software components which typically sit on the connection point of different networks.
The most common kind of networking hardware today is a copper-based Ethernet adapter which is a standard inclusion on most modern computer systems. Wireless networking has become increasingly popular, especially for portable and handheld devices.
Other networking hardware used in computers includes data center equipment (such as file servers, database servers and storage areas), network services (such as DNS, DHCP, email, etc.) as well as devices which assure content delivery.
Taking a wider view, mobile phones, tablet computers and devices associated with the internet of things may also be considered networking hardware. As technology advances and IP-based networks are integrated into building infrastructure and household utilities, network hardware will become an ambiguous term owing to the vastly increasing number of network-capable endpoints.
Specific devices
Network hardware can be classified by its location and role in the network.
Core
Core network components interconnect other network components.
Gateway: an interface providing a compatibility between networks by converting transmission speeds, protocols, codes, or security measures.
Router: a networking device that forwards data packets between computer networks. Routers perform the "traffic directing" functions on the Internet. A data packet is typically forwarded from one router to another through the networks that constitute the internetwork until it reaches its destination node. It works on OSI layer 3.
Switch: a multi-port device that connects devices together at the same or different speeds on a computer network, by using packet switching to receive, process and forward data to the destination device. Unlike less advanced network hubs, a network switch forwards data only to one or multiple devices that need to receive it, rather than broadcasting the same data out of each of its ports. It works on OSI layer 2.
Bridge: a device that connects multiple network segments. It works on OSI layers 1 and 2.
Repeater: an electronic device that receives a signal and retransmits it at a higher level or higher power, or onto the other side of an obstruction, so that the signal can cover longer distances.
Repeater hub: for connecting multiple Ethernet devices together at the same speed, making |
https://en.wikipedia.org/wiki/Z-order%20curve | In mathematical analysis and computer science, functions which are Z-order, Lebesgue curve, Morton space-filling curve, Morton order or Morton code map multidimensional data to one dimension while preserving locality of the data points. It is named in France after Henri Lebesgue, who studied it in 1904, and named in the United States after Guy Macdonald Morton, who first applied the order to file sequencing in 1966. The z-value of a point in multidimensions is simply calculated by interleaving the binary representations of its coordinate values. Once the data are sorted into this ordering, any one-dimensional data structure can be used, such as simple one dimensional arrays, binary search trees, B-trees, skip lists or (with low significant bits truncated) hash tables. The resulting ordering can equivalently be described as the order one would get from a depth-first traversal of a quadtree or octree.
Coordinate values
The figure below shows the Z-values for the two dimensional case with integer coordinates 0 ≤ x ≤ 7, 0 ≤ y ≤ 7 (shown both in decimal and binary). Interleaving the binary coordinate values (starting to the right with the x-bit (in blue) and alternating to the left with the y-bit (in red)) yields the binary z-values (tilted by 45° as shown). Connecting the z-values in their numerical order produces the recursively Z-shaped curve. Two-dimensional Z-values are also known as quadkey values.
The Z-values of the x coordinates are described as binary numbers from the Moser–de Bruijn sequence, having nonzero bits only in their even positions:
x[] = {0b000000, 0b000001, 0b000100, 0b000101, 0b010000, 0b010001, 0b010100, 0b010101}
The sum and difference of two x values are calculated by using bitwise operations:
x[i+j] = ((x[i] | 0b10101010) + x[j]) & 0b01010101
x[i−j] = ((x[i] & 0b01010101) − x[j]) & 0b01010101 if i ≥ j
This property can be used to offset a Z-value, for example in two dimensions the coordinates to the top (decreasing y), bottom (increasing y), left (decreasing x) and right (increasing x) from the current Z-value z are:
top = (((z & 0b10101010) − 1) & 0b10101010) | (z & 0b01010101)
bottom = (((z | 0b01010101) + 1) & 0b10101010) | (z & 0b01010101)
left = (((z & 0b01010101) − 1) & 0b01010101) | (z & 0b10101010)
right = (((z | 0b10101010) + 1) & 0b01010101) | (z & 0b10101010)
And in general to add two two-dimensional Z-values w and z:
sum = ((z | 0b10101010) + (w & 0b01010101) & 0b01010101) | ((z | 0b01010101) + (w & 0b10101010) & 0b10101010)
Efficiently building quadtrees and octrees
The Z-ordering can be used to efficiently build a quadtree (2D) or octree (3D) for a set of points. The basic idea is to sort the input set according to Z-order. Once sorted, the points can either be stored in a binary search tree and used directly, which is called a linear quadtree, or they can be used to build a pointer based quadtree.
The input points are usually scaled in each dimension to be positive integers, either |
https://en.wikipedia.org/wiki/Power-on%20self-test | A power-on self-test (POST) is a process performed by firmware or software routines immediately after a computer or other digital electronic device is powered on.
This article mainly deals with POSTs on personal computers, but many other embedded systems such as those in major appliances, avionics, communications, or medical equipment also have self-test routines which are automatically invoked at power-on.
The results of the POST may be displayed on a panel that is part of the device, output to an external device, or stored for future retrieval by a diagnostic tool. Since a self-test might detect that the system's usual human-readable display is non-functional, an indicator lamp or a speaker may be provided to show error codes as a sequence of flashes or beeps. In addition to running tests, the POST process may also set the initial state of the device from firmware.
In the case of a computer, the POST routines are part of a device's pre-boot sequence; if they complete successfully, the bootstrap loader code is invoked to load an operating system.
IBM-compatible PC POST
In IBM PC compatible computers, the main duties of POST are handled by the BIOS/UEFI, which may hand some of these duties to other programs designed to initialize very specific peripheral devices, notably for video and SCSI initialization. These other duty-specific programs are generally known collectively as option ROMs or individually as the video BIOS, SCSI BIOS, etc.
The principal duties of the main BIOS during POST are as follows:
verify CPU registers
verify the integrity of the BIOS code itself
verify some basic components like DMA, timer, interrupt controller
initialize, size, and verify system main memory
initialize BIOS
pass control to other specialized extension BIOSes (if installed)
identify, organize, and select which devices are available for booting
The functions above are served by the POST in all BIOS versions back to the very first. In later BIOS versions, POST will also:
initialize chipset
discover, initialize, and catalog all system buses and devices
provide a user interface for system's configuration
construct whatever system environment is required by the target operating system
(In early BIOSes, POST did not organize or select boot devices, it simply identified floppy or hard disks, which the system would try to boot in that order, always.)
The BIOS begins its POST when the CPU is reset. The first memory location the CPU tries to execute is known as the reset vector. In the case of a hard reboot, the northbridge will direct this code fetch (request) to the BIOS located on the system flash memory. For a warm boot, the BIOS will be located in the proper place in RAM and the northbridge will direct the reset vector call to the RAM. (In earlier PC systems, before chipsets were standard, the BIOS ROM would be located at an address range that included the reset vector, and BIOS ran directly out of ROM. This is why the motherboard BIOS ROM is in s |
https://en.wikipedia.org/wiki/Fox%20Sports%20%28United%20States%29 | Fox Sports, also referred to as Fox Sports Media Group and stylized in all caps as FOX Sports, is the sports programming division of the Fox Corporation that is responsible for sports broadcasts carried by the Fox broadcast network, Fox Sports 1 (FS1), Fox Sports 2 (FS2), and the Fox Sports Radio network.
The division was formed in 1994 with Fox's acquisition of broadcast rights to National Football League (NFL) games. In subsequent years, Fox has televised the National Hockey League (NHL) (1994–1999), Major League Baseball (MLB) (1996–present), NASCAR (2001–present), the Bowl Championship Series (BCS) (2007–2010), Major League Soccer (MLS) (2003–2011, 2015–present), the U.S. Open golf tournament (2015–2019), the National Hot Rod Association (NHRA) (2016–present), WWE programming (2019–present), the XFL (2020), the United States Football League (USFL) (2022–present), and the World Baseball Classic (WBC) (2023–present).
On December 14, 2017, The Walt Disney Company announced plans to acquire then-parent company 21st Century Fox for $52.4 billion, which included key assets such as the regional Fox Sports Networks (which were later sold by Disney to the Sinclair Broadcast Group), FX Networks, and Fox Sports International. Under the terms of the proposed acquisition, Fox Sports 1, Fox Sports 2, and other assets were spun off into the division's current parent company, which is independently owned by 21st Century Fox's current shareholders.
History
Establishment
When the Fox Broadcasting Company launched in October 1986, the network's management, having seen how sports programming (in particular, soccer events) played a critical role in the growth of the British satellite service BSkyB, determined that sports would be the type of programming that would ascend Fox to a major network status the quickest; as a result, Fox tried to attract a professional football package to the network. In 1987, after ABC initially hedged on renewing its contract with the National Football League (NFL) for the television rights to Monday Night Football, Fox made an offer for the package at the same price that ABC had been paying at the time – about $13 million per game. However, partly due to the fact that Fox had yet to establish itself as a major network, the NFL decided to resume negotiations with ABC, with the two parties eventually agreeing to a new contract, keeping what was the crown jewel of the league's television broadcasts on that network (where it remained until 2006, when MNF moved to sister network ESPN as part of a contract that also saw NBC gain the Sunday Night Football package).
Six years later, as the league's television contracts for both the National Football Conference and American Football Conference divisions, and for the Sunday and Monday primetime football packages were up for renewal, Fox placed a bid for $1.58 billion to obtain the broadcast rights to the National Football Conference. On December 17, 1993, the NFL selected Fox's bid and s |
https://en.wikipedia.org/wiki/SpeechFX | SpeechFX, Inc., (formerly Fonix Corporation) offers voice technology for mobile phone and wireless devices, interactive video games, toys, home appliances, computer telephony systems and vehicle telematics. SpeechFX speech solutions are based on the firm’s proprietary neural network-based automatic speech recognition (ASR) and Fonix DECtalk, a text-to-speech speech synthesis system (TTS). Fonix speech technology is user-independent, meaning no voice training is involved.
Product applications
SpeechFX works with application developers and equipment manufacturers to speech enable devices and systems, resulting in voice-based user interfaces that increase convenience and simplify functionality. SpeechFX technology supports multiple operating systems and hardware platforms and excels on embedded systems, where memory and operating power are at a premium. SpeechFX technology is optimized for noisy environments and is available in more than a dozen highly intelligible TTS languages and more than 10 speaker-independent ASR languages.
Product implementation
SpeechFX speech recognition technologies are currently available for many major products and systems, including Microsoft Xbox and Xbox 360, Sony PlayStation 2, PlayStation 3, PC, Seiko Epson semiconductor chips, Pocket PC and smartphone devices, and others. Casio and other Asian manufacturers currently offer several handheld electronic dictionaries featuring SpeechFX text-to-speech. Many mid-sized businesses use SpeechFX’s telephony product as a 24-hour speech recognition telephone attendant.
Company information
Founded in 1994, SpeechFX, Inc. is headquartered in Lindon, Utah. Before 2011, the company was named Fonix Corporation.
References
Software companies based in Utah
American companies established in 1994
Companies based in Utah
1994 establishments in Utah
Software companies of the United States |
https://en.wikipedia.org/wiki/Interactive%20programming | Interactive programming is the procedure of writing parts of a program while it is already active. This focuses on the program text as the main interface for a running process, rather than an interactive application, where the program is designed in development cycles and used thereafter (usually by a so-called "user", in distinction to the "developer"). Consequently, here, the activity of writing a program becomes part of the program itself.
It thus forms a specific instance of interactive computation as an extreme opposite to batch processing, where neither writing the program nor its use happens in an interactive way. The principle of rapid feedback in extreme programming is radicalized and becomes more explicit.
Synonyms: on-the-fly-programming, just in time programming, conversational programming
Application fields
Interactive programming techniques are especially useful in cases where no clear specification of the problem that is to be solved can be given in advance. In such situations (which are not unusual in research), the formal language provides the necessary environment for the development of an appropriate question or problem formulation.
Interactive programming has also been used in applications that need to be rewritten without stopping them, a feature which the computer language Smalltalk is famous for. Generally, dynamic programming languages provide the environment for such an interaction, so that typically prototyping and iterative and incremental development is done while other parts of the program are running.
As this feature is an apparent need in sound design and algorithmic composition, it has evolved significantly there. More recently, researchers have been using this method to develop sonification algorithms.
Using dynamic programming languages for sound and graphics, interactive programming is also used as an improvisational performance style live coding, mainly in algorithmic music and video.
Example code
Live coding of 3D graphics in ActionScript using COLT
An example of some code in the dynamic programming language SuperCollider is available here.
Another example, written in ChucK is available here
Live coding of graphics with fluxus: a screenshot
impromptu
An example of livecoding in English with Quoth
Hot-swapping in the functional reactive programming language Elm
See also
Live coding
Rapid application development
Read–eval–print loop
References
Programming paradigms |
https://en.wikipedia.org/wiki/Enterprise%20integration | Enterprise integration is a technical field of enterprise architecture, which is focused on the study of topics such as system interconnection, electronic data interchange, product data exchange and distributed computing environments.
It is a concept in enterprise engineering to provide the relevant information and thereby enable communication between people, machines and computers and their efficient co-operation and co-ordination.
Overview
Requirements and principles deal with determining the business drivers and guiding principles that help in the development of the enterprise architecture. Each functional and non-functional requirement should be traceable to one or more business drivers. Organizations are beginning to become more aware of the need for capturing and managing requirements. Use-case modeling is one of the techniques that is used for doing this.
Enterprise Integration, according to Brosey et al. (2001), "aims to connect and combines people, processes, systems, and technologies to ensure that the right people and the right processes have the right information and the right resources at the right time".
Enterprise Integration is focused on optimizing operations in a world which could be considered full of continuous and largely unpredictable change. Changes occur in single manufacturing companies just as well as in an "everchanging set of extended or virtual enterprises". It enables the actors to make "quick and accurate decisions and adaptation of operations to respond to emerging threats and opportunities".
History
Enterprise integration has been discussed since the early days of computers in industry and especially in the manufacturing industry with computer-integrated manufacturing (CIM) as the acronym for operations integration. In spite of the different understandings of the scope of integration in CIM it has always stood for information integration across at least parts of the enterprise. Information integration essentially consists of providing the right information, at the right place, at the right time.
In the 1990s enterprise integration and enterprise engineering became a focal point of discussions with active contribution of many disciplines. The state of the art in enterprise engineering and integration by the end of the 1990s has been rather confusing, according to Jim Nell and Kurt Kosanke (1997):
On one hand, it claims to provide solutions for many of the issues identified in enterprise integration.
On the other hand, the solutions seem to compete with each other, use conflicting terminology and do not provide any clues on their relations to solutions on other issues.
Workflow modelling, business process modelling, business process reengineering (BPR), and concurrent engineering all aim toward identifying and providing the information needed in the enterprise operation. In addition, numerous integrating-platforms concepts are promoted with only marginal or no recognition or support of information i |
https://en.wikipedia.org/wiki/Cognitive%20architecture | A cognitive architecture refers to both a theory about the structure of the human mind and to a computational instantiation of such a theory used in the fields of artificial intelligence (AI) and computational cognitive science. The formalized models can be used to further refine a comprehensive theory of cognition and as a useful artificial intelligence program. Successful cognitive architectures include ACT-R (Adaptive Control of Thought - Rational) and SOAR.
The research on cognitive architectures as software instantiation of cognitive theories was initiated by Allen Newell in 1990.
The Institute for Creative Technologies defines cognitive architecture as: "hypothesis about the fixed structures that provide a mind, whether in natural or artificial systems, and how they work together – in conjunction with knowledge and skills embodied within the architecture – to yield intelligent behavior in a diversity of complex environments."
History
Herbert A. Simon, one of the founders of the field of artificial intelligence, stated that the 1960 thesis by his student Ed Feigenbaum, EPAM provided a possible "architecture for cognition" because it included some commitments for how more than one fundamental aspect of the human mind worked (in EPAM's case, human memory and human learning).
John R. Anderson started research on human memory in the early 1970s and his 1973 thesis with Gordon H. Bower provided a theory of human associative memory. He included more aspects of his research on long-term memory and thinking processes into this research and eventually designed a cognitive architecture he eventually called ACT. He and his students were influenced by Allen Newell's use of the term "cognitive architecture". Anderson's lab used the term to refer to the ACT theory as embodied in a collection of papers and designs (there was not a complete implementation of ACT at the time).
In 1983 John R. Anderson published the seminal work in this area, entitled The Architecture of Cognition.'' One can distinguish between the theory of cognition and the implementation of the theory. The theory of cognition outlined the structure of the various parts of the mind and made commitments to the use of rules, associative networks, and other aspects. The cognitive architecture implements the theory on computers. The software used to implement the cognitive architectures were also "cognitive architectures". Thus, a cognitive architecture can also refer to a blueprint for intelligent agents. It proposes (artificial) computational processes that act like certain cognitive systems, most often, like a person, or acts intelligent under some definition. Cognitive architectures form a subset of general agent architectures. The term 'architecture' implies an approach that attempts to model not only behavior, but also structural properties of the modelled system.
Distinctions
Cognitive architectures can be symbolic, connectionist, or hybrid. Some cognitive architectures or mode |
https://en.wikipedia.org/wiki/Two%20of%20a%20Kind%20%28American%20TV%20series%29 | Two of a Kind is an American sitcom that aired on ABC as part of the network's TGIF line-up, starring Mary-Kate and Ashley Olsen in their first television series since Full House ended in 1995. The show aired from September 25, 1998, to July 9, 1999.
The series was produced by Griffard/Adler Productions, Dualstar Productions, and Miller-Boyett-Warren Productions, in association with Warner Bros. Television. It was the last series to be produced by Miller-Boyett Productions prior to the company's initial shutdown in 1999.
Premise
Kevin Burke (Christopher Sieber) is a college professor and widower father living in Chicago, Illinois, who believes there is a scientific explanation for everything except how to control his scheming 11, then 12-year-old daughters. Mary-Kate and Ashley Burke (Mary-Kate and Ashley Olsen) are twin sisters, who are complete opposites; Mary-Kate is a tomboy whose biggest interest is perfecting her jumpshot and curveball and whose worst subject in school is math. Ashley is a girly girl who makes straight As and dreams of a modeling career and dancing. Kevin's wife died prior to the series.
The other main character is Carrie (Sally Wheeler), a 26-year-old woman in Kevin's class, who has come late to college after exploring the world. Carrie is quirky, difficult, beautiful, and quick to speak her mind, so when she answers Kevin's ad for a part-time baby sitter for the girls, he is convinced she's nothing but trouble and is in favor of their next door neighbor Mrs. Baker baby sitting Mary-Kate and Ashley. The girls think she is a dream-sitter come true, and agree to put their differences aside to join forces to make a little chemistry between their by-the-book father and the beautiful woman who seems to drive him crazy in all the right ways.
Cast and characters
Main
Mary-Kate Olsen as Mary-Kate Burke – A 12-year-old tomboy who loves sports, horses, and modeling. She has two friends, Max and Brian. She also has a math tutor named Taylor. Mary-Kate suffers from Dyscalculia. Mary-Kate's favorite color is red.
Ashley Olsen as Ashley Burke – A 12-year-old girly girl who loves fashion, dancing, make up, cheerleading, and modeling. Ashley's a Straight A student. She's better at math than Mary-Kate. Ashley also has a first crush when Mary Kate's math tutor Taylor Donovan came over. She's friends with Nicole and the popular Jennifer Dilber. In "Carrie Moves In" Ashley joins Mary-Kate's karate class. Ashley's favorite color is green.
Christopher Sieber as Kevin Burke – The widower father of Mary-Kate and Ashley, a professor and landlord. He has been on many dates with women, but they never work. He teaches Carrie, the girls' cool babysitter. Kevin's wife Jan died when Mary-Kate and Ashley were in the 3rd grade. Kevin plays the saxophone.
Sally Wheeler as Carrie Moore – The twins' cool babysitter and student, friend, and employee of Professor Burke. She has a great sense of humor and a free-spirit. Carrie eventually moves into t |
https://en.wikipedia.org/wiki/Iowa%20Communications%20Network | The Iowa Communications Network (ICN) is a state-administered fiber optics network designed to provide equal access to citizens including Iowans with modern telecommunication resources.
Information
The Iowa Communications Network provides data, high-speed Internet connections, security, and voice (telephone) service to a variety of authorized users, which includes state and federal government agencies, K-12 schools, higher education institutions, healthcare and public libraries.
ICN sunsetted its video service in 2020.
Background
Governor Terry Branstad signed an authorizing bill in 1989. In 1991, construction began on Parts I and II of the network when one fiber optic endpoint was installed per county. In 1992 parts of the new fiber-optic system were activated. The network became operational in 1993 and by the next year the new network offered a full motion video connection to all 99 Iowa counties, its 3 state universities, public television, and state government. The Iowa Communications Network became a state agency directed by the Iowa Telecommunications and Technology Commission (ITTC) in 1994.
In 1995, the governor established a plan for Part III of the network. This four-year plan added full-motion video sites to public and private school districts, AEAs, and public libraries throughout Iowa. At the turn of the century the 700th full-motion video classroom was connected to the ICN, surpassing the original plan which only called for a maximum of 500 classrooms. One year later, ICN’s internet bandwidth was brought up to 400 Mbit/s for a faster, more efficient connection. In 2003, the network received a number of upgrades, appropriated through state legislation, which made it one of the most technologically advanced telecommunications services for state government as the time. In 2004, Danville High School was the final site to be added to the Network under Part III legislation.
In March 2005, the ICN became debt free and no longer receives general fund appropriations. To date over 231 million dollars has been invested by state and federal government in the development of the network. http://www.icn.iowa.gov/
ICN sunsetted its video service in 2020.
Capabilities and uses
Iowa Communications Network allows citizens to take advantage of Telemedicine, which makes specialty care more accessible to rural Iowans and simplifies provider education by allowing rural health practitioners to “attend” educational programs without leaving their communities.
As well, the Iowa Communications Network has been integrated into a Telejustice system, a way of using two-way interactive video to reduce the expense of expert witnesses and allows crime victims to testify at parole hearings without the inconvenience and tension associated with traveling to a meeting where an inmate was present.
Emergency
After September 2001, the ICN became an important device for the security of the state of Iowa and its inhabitants. The ICN has been a valuable tool for the |
https://en.wikipedia.org/wiki/Rensselaer%20and%20Saratoga%20Railroad | The Rensselaer and Saratoga Railroad was a railway company that operated in the states of New York and Vermont in the 19th century. At its peak it controlled a network. The Delaware and Hudson Railway leased the company in 1871 and formally merged it in 1945.
History
The Rensselaer and Saratoga Railroad was chartered on April 14, 1832. It completed between Troy and Ballston Spa on March 19, 1836.
The railroad was largely conceived and built by businessmen of Troy in response to Albany's construction of the Mohawk and Hudson Railroad and the extension to Saratoga called the Saratoga and Schenectady Railroad. Despite its name, the railroad only reached to Ballston Spa and relied on the Saratoga and Schenectady to give it access to Saratoga Springs, New York. When an agreement was not forthcoming, investors seized an opportunity to buy up Saratoga and Schenectady stock and take control of the railroad.
Later acquisitions included trackage to Whitehall, New York and a line of steamers that plied Lake Champlain, allowing tourists to travel from Troy to Canada entirely by steam conveyance for the first time. The last expansion before the merger with the Delaware and Hudson Canal Company involved building new sections of track between Green Island and Watervliet that linked Albany and Troy for the first time. All of the leases, purchases, and road construction carried out by the Rensselaer and Saratoga resulted in a little railroad empire consisting of 175 miles of track and control of the Upper Hudson and Champlain Valleys.
The Green Island Shops were built in 1871. The Delaware and Hudson Canal Company leased the line on May 1, 1871, and it was consolidated into the Delaware and Hudson Railroad effective January 30, 1945.
References
Bibliography
From the Coalfields to the Hudson: A History of the Delaware & Hudson Canal, Larry Lowenthal (2009)
Early Railroads of New York's Capital District, Timothy Starr (2011)
Interstate Commerce Commission, State of New York (1926)
Moody's Transportation Manual (1984)
External links
The Delaware and Hudson Historical Society
D & H Canal Historical Society
Railroads of New York's Capital District
City of Saratoga Springs — Official site
Early history of Troy, NY
City of Troy Homepage
Defunct New York (state) railroads
Predecessors of the Delaware and Hudson Railway
Railway companies established in 1832
Railway companies disestablished in 1945
Defunct Vermont railroads
Passenger rail transportation in New York (state)
1832 establishments in New York (state)
1945 disestablishments in New York (state)
American companies established in 1832
American companies disestablished in 1945 |
https://en.wikipedia.org/wiki/Table%20%28database%29 | A table is a collection of related data held in a table format within a database. It consists of columns and rows.
In relational databases, and flat file databases, a table is a set of data elements (values) using a model of vertical columns (identifiable by name) and horizontal rows, the cell being the unit where a row and column intersect. A table has a specified number of columns, but can have any number of rows. Each row is identified by one or more values appearing in a particular column subset. A specific choice of columns which uniquely identify rows is called the primary key.
"Table" is another term for "relation"; although there is the difference in that a table is usually a multiset (bag) of rows where a relation is a set and does not allow duplicates. Besides the actual data rows, tables generally have associated with them some metadata, such as constraints on the table or on the values within particular columns.
The data in a table does not have to be physically stored in the database. Views also function as relational tables, but their data are calculated at query time. External tables (in Informix
or Oracle,
for example) can also be thought of as views.
In many systems for computational statistics, such as R and Python's pandas, a data frame or data table is a data type supporting the table abstraction. Conceptually, it is a list of records or observations all containing the same fields or columns. The implementation consists of a list of arrays or vectors, each with a name.
Tables versus relations
In terms of the relational model of databases, a table can be considered a convenient representation of a relation, but the two are not strictly equivalent. For instance, a SQL table can potentially contain duplicate rows, whereas a true relation cannot contain duplicate rows that we call tuples. Similarly, representation as a table implies a particular ordering to the rows and columns, whereas a relation is explicitly unordered. However, the database system does not guarantee any ordering of the rows unless an ORDER BY clause is specified in the SELECT statement that queries the table.
An equally valid representation of a relation is as an n-dimensional chart, where n is the number of attributes (a table's columns). For example, a relation with two attributes and three values can be represented as a table with two columns and three rows, or as a two-dimensional graph with three points. The table and graph representations are only equivalent if the ordering of rows is not significant, and the table has no duplicate rows.
Comparisons
Hierarchical databases
In non-relational systems, hierarchical databases, the distant counterpart of a table is a structured file, representing the rows of a table in each row of the file and each column in a row. This structure implies that a row can have repeating information, generally in the child data segments. Data are stored in sequence of physical records.
Spreadsheets
Unlike a spreadsheet, |
https://en.wikipedia.org/wiki/Delete%20%28SQL%29 | In the database structured query language (SQL), the DELETE statement removes one or more records from a table. A subset may be defined for deletion using a condition, otherwise all records are removed. Some database management systems (DBMSs), like MySQL, allow deletion of rows from multiple tables with one DELETE statement (this is sometimes called multi-table DELETE).
Examples
Delete rows from table pies where column flavor equals Lemon Meringue:
DELETE FROM pies
WHERE flavor='Lemon Meringue';
Delete rows in trees, if the value of height is smaller than 80.
DELETE FROM trees
WHERE height < 80;
Delete all rows from mytable:
DELETE FROM mytable;
Delete rows from mytable using a subquery in the where condition:
DELETE FROM mytable
WHERE id IN (
SELECT id
FROM mytable2
);
Delete rows from mytable using a list of values:
DELETE FROM mytable
WHERE id IN (
value1,
value2,
value3,
value4,
value5
);
Example with related tables
Suppose there is a simple database that lists people and addresses. More than one person can live at a particular address and a person can live at more than one address (this is an example of a many-to-many relationship). The database only has three tables, person, address, and pa, with the following data:
The pa table relates the person and address tables, showing that Joe, Bob and Ann all live at 2001 Main Street, but Joe also takes up residence on Pico Boulevard.
In order to remove joe from the database, two deletes must be executed:
DELETE FROM person WHERE pid=1;
DELETE FROM pa WHERE pid=1;
To maintain referential integrity, Joe's records must be removed from both person and pa. The means by which integrity is sustained can happen differently in varying relational database management systems. It could be that beyond just having three tables, the database also has been set up with a trigger so that whenever a row is deleted from person any linked rows would be deleted from pa. Then the first statement:
DELETE FROM person WHERE pid=1;
would automatically trigger the second:
DELETE FROM pa WHERE pid=1;
Features
It is a DML (Data Manipulation Language) command, therefore the following commands are used for this command: COMMIT and ROLLBACK
Deletes all or some records from the table, you can limit the records to be deleted by using the WHERE clause
Does not free the space occupied by the data in the table (in the TABLESPACE)
Does not reset the SEQUENCE value assigned to the table
DELETE works much slower than TRUNCATE
You can undo the operation of removing records by using the ROLLBACK command
DELETE requires a shared table lock
Triggers fire
DELETE can be used in the case of: database link
DELETE returns the number of records deleted
Transaction log - DELETE needs to read records, check constraints, update block, update indexes, and generate redo / undo. All of this takes time, hence it takes time much longer than with TRUNCATE
reduces |
https://en.wikipedia.org/wiki/BBC%20Master | The BBC Master is a home computer released by Acorn Computers in early 1986. It was designed and built for the British Broadcasting Corporation (BBC) and was the successor to the BBC Micro Model B. The Master 128 remained in production until 1993.
Design
The Master series featured several improvements over earlier BBC Micro models. Rather than the MOS Technology 6502 microprocessor used by the Model B, Master series models used the slightly improved 65C12. Fabricated using CMOS technology, the 65C12 used less power than the 6502 and offered somewhat better performance, reportedly "almost as fast" as the original 3 MHz 6502 second processor for the BBC Micro. The systems had of dynamic RAM as standard, alleviating the shortage of available RAM which had previously discouraged use of the display modes offering the highest quality graphics on earlier models. Of the total 128 KB of RAM, 64 KB was provided as standard RAM, being used for applications, screen memory and system workspace. Another 64 KB was provided in the form of four 16 KB bank-switched pages of sideways RAM.
Of the 64 KB standard RAM, the lower region of 32 KB was employed in a fashion familiar from earlier models, providing workspace for languages, applications and the system, also hosting screen memory for many programs, particularly games. While the 65C12 ensured software compatibility with the Model B, it perpetuated the architectural limitations of the earlier models, with a 16-bit address bus providing direct access to only 64 KB of memory at a time, thus necessitating the use of paging mechanisms to make additional RAM available. Access to the upper 32 KB region of standard RAM was provided by one such mechanism to take over some of the demands made on the lower memory region by the system. It was divided into three separate regions, each with a codename, following Acorn's architectural traditions:
20 KB of this upper region could be assigned as shadow RAM to host the screen memory, freeing up the conventional screen memory region for applications. The remaining 12 KB was available to the system for workspace, freeing up memory that would normally be claimed by ROMs such as filing systems. The cumulative effect of enabling shadow RAM and using the upper memory for workspace made almost 29 KB available for normal programs and was said to "transform the machine" from its predecessors.
Use of the 64 KB of sideways RAM favoured the installation of ROM images into each of the 16 KB banks, with Acorn having announced a "ROM licencing scheme" to authorise the use of the company's ROM-based software in RAM. However, a version of BASIC known as BAS128, previously released for the BBC Model B+ 128, was provided on disk and was able to use the full 64 KB of sideways RAM as workspace, thus expanding the memory available to BASIC considerably. Other Acorn languages did not support this arrangement, however.
Although the extra instructions of the 65C12 permitted slightly greater code |
https://en.wikipedia.org/wiki/Jerry%20Manock | Jerrold Clifford Manock (born February 21, 1944) is an American industrial designer. He worked for Apple Computer from 1977 to 1984, contributing to housing designs for the Apple II, Apple III, and earlier compact Apple Macintosh computers. Manock is widely regarded as the "father" of the Apple Industrial Design Group. Since 1976 he is the president and principal designer of Manock Comprehensive Design, Inc., with offices in Palo Alto, California, and Burlington, Vermont.
Education and career
Manock attended Stanford University, where he earned his B.S. in mechanical engineering in 1966 and his M.S. in Mechanical Engineering–Product Design in 1968. For his master's project, he worked on a device to aid in percussion-drainage therapy for children with cystic fibrosis.
From 1968 to 1972, Manock worked as a product design engineer in the Microwave Division of Hewlett-Packard, Palo Alto, California. From 1972 to 1975 he was chief mechanical engineer at Telesensory Systems, Inc., of Palo Alto. He then worked as a freelance product design consultant; in 1977 he took on Apple Computer as a client and consulted on the product design and mechanical engineering of the Apple II personal computer.
Apple Design Team
Manock joined Apple in 1979 as corporate manager of product design. Working under the direction of Steve Jobs, Manock led the product designs of the Apple II, the Apple III, and the "Cuisinart-inspired" upright casing for the first Macintosh computer, which necessitated a detached keyboard. Manock also worked on the Disk II, Disk III, and Apple Lisa office computer.
Manock was a member of the original Apple Macintosh design team. In January 1981, when Jobs became manager of the Macintosh project, he brought in Manock and Terry Oyama to design the computer housing. According to Jason O'Grady in Apple Inc., Manock was "hand-picked" by Jef Raskin to work on the Macintosh design team. In a 1984 interview, Manock said that the initial design goal was for a computer housing with "portability", but that idea was replaced by the design goal of "minimal desk space". As a result, the design team created a keyboard that was smaller than the width of the computer. Manock himself contributed the idea of using icons on the outside of the machine rather than English words to make the Macintosh more international. This style was mirrored in the ROM, which used icons instead of English-language directions, such as a frowning face when the computer needed to reboot and a smiling face indicating booting.
Patents
Manock is the co-inventor of:
Personal computer (U.S. Patent No. D268584), 12 April 1983
Dual disk drive (U.S. Patent No. D271102), 25 October 1983
Housing for moveable cursor control for a video display (U.S. Patent No. D284284), 17 June 1986
Computer housing (U.S. Patent No. D285687), 16 September 1986
Keypad (U.S. Patent No. D286047), 7 October 1986
Disk drive housing (U.S. Patent No. D286050), 7 October 1986
Disk drive case (U.S. Patent No. D290257) |
https://en.wikipedia.org/wiki/ADFS | ADFS may refer to:
Active Directory Federation Services in Microsoft Windows server operating systems
Advanced Disc Filing System, a file system implemented in Acorn and RISC OS computers
Advanced Distributed File System, a defunct IBM file system project
Apple DOS File System, a file system for Apple II microcomputers |
https://en.wikipedia.org/wiki/Disc%20Filing%20System | The Disc Filing System (DFS) is a computer file system developed by Acorn Computers, initially as an add-on to the Eurocard-based Acorn System 2.
In 1981, the Education Departments of Western Australia and South Australia announced joint tenders calling for the supply of personal computers to their schools. Acorn's Australian computer distributor, Barson Computers, convinced Joint Managing Directors Hermann Hauser and Chris Curry to allow the soon to be released Acorn BBC Microcomputer to be offered with disk storage as part of the bundle. They agreed on condition that Barson adapted the Acorn DFS from the System 2 without assistance from Acorn as they had no resources available. This required some minor hardware and software changes to make the DFS compatible with the BBC Micro.
Barson won the tenders for both states, with the DFS fitted, a year ahead of the UK. It was this early initiative that resulted in the BBC Micro being more heavily focused on the education market in Australia, with very little penetration of the home computer market until the arrival of the Acorn Electron.
The DFS shipped as a ROM and Disk Controller Chip fitted to the BBC Micro's motherboard. The filing system was of extremely limited functionality and storage capability, using a flat directory structure. Each filename can be up to seven letters long, plus one letter for the directory in which the file is stored.
The DFS is remarkable in that unlike most filing systems, there was no single vendor or implementation. The original DFS was written by Acorn, who continued to maintain their own codebase, but various disc drive vendors wrote their own implementations. Companies who wrote their own DFS implementations included Cumana, Solidisk, Opus and Watford Electronics. The Watford Electronics implementation is notable for supporting 62 files per disc instead of the usual 31, using a non-standard disc format. Beyond that, the Solidisk implementation introduced proprietary "chained" catalogues which allowed unlimited files per disc (only constrained by the disk size). Other features in third-party implementations included being able to review free space, and built-in FORMAT and VERIFY commands, which were shipped on a utility disc with the original Acorn DFS.
Acorn followed up their original DFS series with the Acorn 1770 DFS, which used the same disc format as the earlier version but added a set of extra commands and supported the improved WD1770 floppy drive controller chip.
Physical format
DFS conventionally uses one side of a double-density 5¼" floppy disc. Discs are formatted as either 40 or 80 track, giving a capacity of 100 or 200 KB per side (ten 256-byte sectors per track, with FM encoding).
The capacity is limited by the choice of the Intel 8271 controller in the original BBC Micro, which only supports FM encoding, not the MFM encoding which was already in common use by the time of the BBC Micro's launch. FM encoding gives half the recording capacity of MFM |
https://en.wikipedia.org/wiki/Interconnection | In telecommunications, interconnection is the physical linking of a carrier's network with equipment or facilities not belonging to that network. The term may refer to a connection between a carrier's facilities and the equipment belonging to its customer, or to a connection between two or more carriers.
In United States regulatory law, interconnection is specifically defined (47 C.F.R. 51.5) as "the linking of two or more networks for the mutual exchange of traffic."
One of the primary tools used by regulators to introduce competition in telecommunications markets has been to impose interconnection requirements on dominant carriers.
History
United States
Under the Bell System monopoly (post Communications Act of 1934), the Bell System owned the phones and did not allow interconnection, either of separate phones (or other terminal equipment) or of other networks; a popular saying was "Ma Bell has you by the calls".
This began to change in the landmark case Hush-A-Phone v. United States [1956], which allowed some non-Bell owned equipment to be connected to the network, and was followed by a number of other cases, regulatory decisions, and legislation that led to the transformation of the American long distance telephone industry from a monopoly to a competitive business.
This further changed in FCC's Carterfone decision in 1968, which required the Bell System companies to permit interconnection by radio-telephone operators.
Today the standard electrical connector for interconnection in the US, and much of the world, is the registered jack family of standards, especially RJ11. This was introduced by the Bell System in the 1970s, following a 1976 FCC order. Since then, it has gained popularity worldwide, and is a de facto international standard.
Europe
Outside of the U.S., Interconnection or "Interconnect regimes" also take into account the associated commercial arrangements. As an example of the use of commercial arrangements, the focus by the EU has been on "encouraging" incumbents to offer bundles of network features that will enable competitors to provide services that compete directly with the incumbent. Further the interconnect regime decided upon by the regulator has a major impact on the development/rate of growth of market segments. According to Source8 (an EU based consultancy) two examples from the UK of this are:
The decision about revenue sharing on local rate numbers was a contributory factor in the explosive growth in dial internet.
The asynchronous reciprocity that exists between fixed and mobile termination rates.
See also
Customer-premises equipment
Demarcation point
Forced-access regulation
Registered jack
Terminal equipment
Termination rates
US regulation
:Category:United States federal communications legislation
References
Telecom Antitrust Handbook, by American Bar Association Section of Antitrust Law, section "Example: Telephone Network Interconnection", p. 381–382
US Code of Federal Regulations 47 CF |
https://en.wikipedia.org/wiki/Jeffrey%20Ullman | Jeffrey David Ullman (born November 22, 1942) is an American computer scientist and the Stanford W. Ascherman Professor of Engineering, Emeritus, at Stanford University. His textbooks on compilers (various editions are popularly known as the dragon book), theory of computation (also known as the Cinderella book), data structures, and databases are regarded as standards in their fields. He and his long-time collaborator Alfred Aho are the recipients of the 2020 Turing Award, generally recognized as the highest distinction in computer science.
Career
Ullman received a Bachelor of Science degree in engineering mathematics from Columbia University in 1963 and his PhD in electrical engineering from Princeton University in 1966. He then worked for three years at Bell Labs. In 1969, he returned to Princeton as an associate professor, and was promoted to full professor in 1974. Ullman moved to Stanford University in 1979, and served as the department chair from 1990 to 1994. He was named the Stanford W. Ascherman Professor of Computer Science in 1994, and became an Emeritus in 2003.
In 1994 Ullman was inducted as a Fellow of the Association for Computing Machinery; in 2000 he was awarded the Knuth Prize. Ullman is the co-recipient (with John Hopcroft) of the 2010 IEEE John von Neumann Medal "For laying the foundations for the fields of automata and language theory and many seminal contributions to theoretical computer science." Ullman, Hopcroft, and Alfred Aho were co-recipients of the 2017 C&C Prize awarded by NEC Corporation.
Ullman's research interests include database theory, data integration, data mining, and education using online infrastructure. He is one of the founders of the field of database theory: many of his Ph.D. students became influential in the field as well. He was the Ph.D. advisor of Sergey Brin, one of the co-founders of Google, and served on Google's technical advisory board. He is a founder of Gradiance Corporation, which provides homework grading support for college courses. He teaches courses on automata and mining massive datasets on the Stanford Online learning platform.
Ullman was elected as a member of the National Academy of Sciences in 2020. He also sits on the advisory board of TheOpenCode Foundation. On March 31, 2021, he and Aho were named recipients of 2020 Turing Award.
Controversies
In 2011, Ullman stated his opposition to assisting Iranians in becoming graduate students at Stanford, because of the anti-Israel position of the Iranian government. In response to a call by the National Iranian American Council for disciplinary action against Ullman for what they described as his "racially discriminatory and inflammatory" comments, a Stanford spokesperson stated that Ullman was expressing his own personal views and not the views of the university, and that he was uninvolved in admissions.
In April 2021, an open letter by CSForInclusion criticized the ACM and the ACM A.M. Turing Award Committee for nominating |
https://en.wikipedia.org/wiki/European%20Computer%20Trade%20Show | The European Computer Trade Show (ECTS) was an annual trade show for the European video game industry which first ran in 1988, the last event being held in 2004.
The exposition was only open to industry professionals and journalists, although it was frequently attended by members of the public who had faked credentials. Due to the wide-scale nature of this problem, many exhibitors planned stalls which appealed to both trade and public, except when alternative public shows were planned such as the Future Entertainment Show and Game Stars Live.
ECTS was always held at a London venue, usually between the end of August and the beginning of September. Its original home was the Business Design Centre in Islington. In 1995 it was relocated to the Grand Hall at Olympia in Kensington. The 2001 event took place at the ExCeL Exhibition Centre in Newham and the last three, to 2004, were at the Earls Court Exhibition Centre.
From 2001 until 2004, the Game Developers Conference Europe was held alongside ECTS. Unlike the primarily press-oriented ECTS, GDCE focused on talks and discussions about the development of games, and was aimed at the developers themselves. In 2004, however, GDCE moved locations and ran alongside the Game Stars Live event. In April 2005, organiser CMP announced that they were withdrawing from the British trade show market, marking the end of 17 years of shows.
Venues
References
Further reading
London Games Week 2004
Organiser
Defunct gaming conventions
Recurring events established in 1988 |
https://en.wikipedia.org/wiki/Nearest%20neighbor | Nearest neighbor may refer to:
Nearest neighbor search in pattern recognition and in computational geometry
Nearest-neighbor interpolation for interpolating data
Nearest neighbor graph in geometry
Nearest neighbor function in probability theory
Nearest neighbor decoding in coding theory
The k-nearest neighbor algorithm in machine learning, an application of generalized forms of nearest neighbor search and interpolation
The nearest neighbour algorithm for approximately solving the travelling salesman problem
The nearest neighbor method for determining the thermodynamics of nucleic acids
The nearest neighbor method for calculating distances between clusters in hierarchical clustering.
See also
Moore neighborhood
Von Neumann neighborhood |
https://en.wikipedia.org/wiki/MapReduce | MapReduce is a programming model and an associated implementation for processing and generating big data sets with a parallel, distributed algorithm on a cluster.
A MapReduce program is composed of a map procedure, which performs filtering and sorting (such as sorting students by first name into queues, one queue for each name), and a reduce method, which performs a summary operation (such as counting the number of students in each queue, yielding name frequencies). The "MapReduce System" (also called "infrastructure" or "framework") orchestrates the processing by marshalling the distributed servers, running the various tasks in parallel, managing all communications and data transfers between the various parts of the system, and providing for redundancy and fault tolerance.
The model is a specialization of the split-apply-combine strategy for data analysis.
It is inspired by the map and reduce functions commonly used in functional programming, although their purpose in the MapReduce framework is not the same as in their original forms. The key contributions of the MapReduce framework are not the actual map and reduce functions (which, for example, resemble the 1995 Message Passing Interface standard's reduce and scatter operations), but the scalability and fault-tolerance achieved for a variety of applications due to parallelization. As such, a single-threaded implementation of MapReduce is usually not faster than a traditional (non-MapReduce) implementation; any gains are usually only seen with multi-threaded implementations on multi-processor hardware. The use of this model is beneficial only when the optimized distributed shuffle operation (which reduces network communication cost) and fault tolerance features of the MapReduce framework come into play. Optimizing the communication cost is essential to a good MapReduce algorithm.
MapReduce libraries have been written in many programming languages, with different levels of optimization. A popular open-source implementation that has support for distributed shuffles is part of Apache Hadoop. The name MapReduce originally referred to the proprietary Google technology, but has since been genericized. By 2014, Google was no longer using MapReduce as their primary big data processing model, and development on Apache Mahout had moved on to more capable and less disk-oriented mechanisms that incorporated full map and reduce capabilities.
Overview
MapReduce is a framework for processing parallelizable problems across large datasets using a large number of computers (nodes), collectively referred to as a cluster (if all nodes are on the same local network and use similar hardware) or a grid (if the nodes are shared across geographically and administratively distributed systems, and use more heterogeneous hardware). Processing can occur on data stored either in a filesystem (unstructured) or in a database (structured). MapReduce can take advantage of the locality of data, processing it near the place |
https://en.wikipedia.org/wiki/AOpen | AOPEN (, stylized AOPEN) is a major electronics manufacturer from Taiwan that makes computers and parts for computers. AOPEN used to be the Open System Business Unit of Acer Computer Inc. which designed, manufactured and sold computer components.
It was incorporated in December 1996 as a subsidiary of Acer Group with an initial public offering (IPO) at the Taiwan stock exchange in August 2002. It is also the first subsidiary that established the entrepreneurship paradigm in the pan-Acer Group. At that time, AOPENs major shareholder was the Wistron Group. In 2018 AOPEN became a partner of the pan-Acer Group again as the business-to-business branch of the computing industry.
They are perhaps most well known for their "Mobile on Desktop" (MoDT), which implements Intel's Pentium M platform on desktop motherboards. Because the Pentium 4 and other NetBurst CPUs proved less energy efficient than the Pentium M, in late 2004 and early 2005, many manufacturers introduced desktop motherboards for the mobile Pentium M, AOPEN being one of the first.
AOPEN currently specializes in ultra small form factor (uSFF) platform applications; digital signage; and product development and designs characterized by miniaturization, standardization and modularization.
Product position and strategies
Since 2005 AOPEN has been developing energy-saving products. According to different types of customers, applications and contexts, AOPEN splits its product platforms into two major categories: media player platform and Panel PC platform, both of which have Windows, Linux, ChromeOS and Android devices.
Digital Signage Platform
There are six major parts in AOPEN's digital signage platform applications: media player, management, deployment, display, extension and software. AOPEN manufacturers the digital signage media players with operating system and pre-imaging. This also includes a remote management option.
See also
List of companies of Taiwan
References
Taiwanese companies established in 1996
Companies based in Taipei
Electronics companies established in 1996
Companies listed on the Taiwan Stock Exchange
Electronics companies of Taiwan
Motherboard companies
Taiwanese brands
External links |
https://en.wikipedia.org/wiki/Alien%20%28file%20converter%29 | Alien is a computer program that converts between different Linux package formats, created by Joey Hess and presently maintained by Kyle Barry.
Features
Alien supports conversion between Linux Standard Base (LSB), LSB-compliant .rpm packages, .deb, Stampede (), Solaris () and Slackware (.tgz, .txz, , ) packages. It is also capable of automatically installing the generated packages, and can try to convert the installation scripts included in the archive as well. The latter feature should be used with caution since Linux distributions may vary significantly from one another, and using install scripts automatically converted from an Alien format may break the system.
Usage
A sample usage of Alien:
This will convert to with the , , and scripts from the Debian package (deb) into the RPM package.
Terminal commands for Alien:
It might require Super User Privileges to run the command. If it does then proceed with the commands below
Similar applications
CheckInstall, for the source tarball (i.e. Gentoo) to .deb (Debian).
See also
Package management system
References
External links
Debian
Free software programmed in Perl
Free system software |
https://en.wikipedia.org/wiki/List%20of%20programs%20broadcast%20by%20Adult%20Swim | This is a list of television programs formerly or currently broadcast on Cartoon Network's evening network, Adult Swim in the United States. Although both entities share the same channel space, Adult Swim is classified as a separate network for the purposes of Nielsen ratings.
Current programming
Original programming
Animated
Live-action
Programming from Cartoon Network
Acquired programming
Online programming
Upcoming programming
Original programming
Former programming
Original programming
Animation
Live-action
Programming from Cartoon Network
Acquired programming
† – Denotes Toonami program that previously ran on Adult Swim Action/AcTN (2002–12)
Online programming
Stunts and cross-promotional programming
Pilots and specials
Pilots
Original specials
For special programming released under the "Infomercials" banner, please see Infomercials.
Syndicated shorts and specials
Films
See also
List of programs broadcast by Cartoon Network
List of programs broadcast by Cartoonito
List of programs broadcast by Toonami
List of programs broadcast by Boomerang
Notes
References
External links
Adult Swim
Lists of programming blocks
Cartoon Network-related lists |
https://en.wikipedia.org/wiki/Cray%20Time%20Sharing%20System | The Cray Time Sharing System, also known in the Cray user community as CTSS, was developed as an operating system for the Cray-1 or Cray X-MP line of supercomputers in 1978. CTSS was developed by the Los Alamos Scientific Laboratory (LASL now LANL) in conjunction with the Lawrence Livermore Laboratory (LLL now LLNL). CTSS was popular with Cray sites in the United States Department of Energy (DOE), but was used by several other Cray sites, such as the San Diego Supercomputing Center.
Overview
The predecessor of CTSS was the Livermore Time Sharing System (LTSS) which ran on Control Data CDC 7600 line of supercomputers. The first compiler was known as LRLTRAN, for Lawrence Radiation Laboratory forTRAN, a FORTRAN 66 programming language but with dynamic memory and other features. The Cray version, including automatic vectorization, was known as CVC, pronounced "Civic" like the Honda car of the period, for Cray Vector Compiler.
Some controversy existed at LASL with the first attempt to develop an operating system for the Cray-1 named DEIMOS, a message-passing, Unix-like operating system, by Forrest Basket. DEIMOS had initial "teething" problems common to the performance of all early operating systems. This left a bad taste for Unix-like systems at the National Laboratories and with the manufacturer, Cray Research, Inc., of the hardware who went on to develop their own batch oriented operating system, COS (Cray Operating System) and their own vectorizing Fortran compiler named "CFT" (Cray ForTran) both written in the Cray Assembly Language (CAL).
CTSS had the misfortune to have certain constants, structures, and lacking certain networking facilities (TCP/IP) which were optimized to be Cray-1 architecture-dependent without extensive rework when larger memory supercomputers like the Cray-2 and the Cray Y-MP came into use. CTSS has its final breaths running on Cray instruction-set-compatible hardware developed by Scientific Computer Systems (SCS-40 and SCS-30) and Supertek S-1, but this did not save the software.
CTSS embodied certain unique ideas such as a market-driven priorities for working/running processes.
An attempt to succeed CTSS was started by LLNL named NLTSS (New Livermore Time Sharing System) to embody advanced concepts for operating systems to better integrate communication using a new network protocol named LINCS while also keeping the best features of CTSS. NLTSS followed the development fate of many operating systems and only briefly ran on period Cray hardware of the late 1980s.
A user-level CTSS Overview from 1982 provides, in Chapter 2, a brief list of CTSS features. Other references are likely to be found in proceedings of the Cray User Group (CUG) and the ACM SOSP (Symp. on Operating Systems Proceedings). However, owing to the fact that LANL and LLNL were nuclear weapons facilities, some aspects of security are likely to doom finding out greater detail of many of these pieces of software.
See also
EOS (operating system)
Timel |
https://en.wikipedia.org/wiki/KXAS-TV | KXAS-TV (channel 5) is a television station licensed to Fort Worth, Texas, United States, serving as the NBC outlet for the Dallas–Fort Worth metroplex. It is owned and operated by the network's NBC Owned Television Stations division alongside Dallas-licensed Telemundo station KXTX-TV (channel 39). Both stations share studios at the CentrePort Business Park in eastern Fort Worth, while KXAS-TV's transmitter is located in Cedar Hill, Texas.
History
Early history under Carter Publications
Amon G. Carter, Sr.—the founding publisher of the Fort Worth Star-Telegram—first submitted an application to the Federal Communications Commission (FCC) for a license to build and operate a television station on VHF channel 5 in late October 1944, mere days after Karl Hoblitzelle, owner of Interstate Circuit Theatres, filed an application to operate a station on channel 8 on October 23, the first such license application for a television station in the Southern United States. When the FCC awarded the construction permit for Channel 5 to Carter on June 21, 1946, he originally requested to assign KCPN (for "Carter Publications News") as the station's call letters; three months before it signed on, however, Carter chose instead to assign the television station the calls that were used by the radio station that he also owned, WBAP (820 AM).
The station began test broadcasts on June 20, 1948, originally transmitting over a closed-circuit television system. Channel 5 informally signed on the air as WBAP-TV on September 27, to broadcast coverage of President Harry S. Truman's re-election campaign speech at the Texas & Pacific terminal building in downtown Fort Worth. WBAP-TV officially commenced regular programming two days later on September 29, 1948, with two 10-minute specials at 7:00 p.m. that evening, respectively featuring speeches from Carter and general manager Harold Hough and a film from NBC dedicating the station's launch. Carter owned the television and radio properties through the Star-Telegrams corporate parent, Carter Publications. It was the first television station to sign on in the state of Texas; the second to be located between Los Angeles, St. Louis and Richmond, Virginia (after NBC/DuMont affiliate KDYL-TV – now ABC affiliate KTVX – in Salt Lake City); and the 25th to sign on in the United States.
When the station made its formal debut, its first night of regular broadcasts did not go smoothly. On the date of its sign-on, the station's studio facilities were in the latter stages of construction; at one point, Amon Carter accidentally stepped into an unmarked hole in the studio floor that led to the building's basement, narrowly saved from enduring potential injury by Star-Telegram cartoonist Johnny Hay. A power outage near the transmitter facility also knocked WBAP-TV off the air for 17 minutes around 8:00 p.m. Angry viewers subsequently called into the station, blaming engineers for an outage that was beyond their control; after the power probl |
https://en.wikipedia.org/wiki/Scale%20space | Scale-space theory is a framework for multi-scale signal representation developed by the computer vision, image processing and signal processing communities with complementary motivations from physics and biological vision. It is a formal theory for handling image structures at different scales, by representing an image as a one-parameter family of smoothed images, the scale-space representation, parametrized by the size of the smoothing kernel used for suppressing fine-scale structures. The parameter in this family is referred to as the scale parameter, with the interpretation that image structures of spatial size smaller than about have largely been smoothed away in the scale-space level at scale .
The main type of scale space is the linear (Gaussian) scale space, which has wide applicability as well as the attractive property of being possible to derive from a small set of scale-space axioms. The corresponding scale-space framework encompasses a theory for Gaussian derivative operators, which can be used as a basis for expressing a large class of visual operations for computerized systems that process visual information. This framework also allows visual operations to be made scale invariant, which is necessary for dealing with the size variations that may occur in image data, because real-world objects may be of different sizes and in addition the distance between the object and the camera may be unknown and may vary depending on the circumstances.
Definition
The notion of scale space applies to signals of arbitrary numbers of variables. The most common case in the literature applies to two-dimensional images, which is what is presented here. For a given image , its linear (Gaussian) scale-space representation is a family of derived signals defined by the convolution of with the two-dimensional Gaussian kernel
such that
where the semicolon in the argument of implies that the convolution is performed only over the variables , while the scale parameter after the semicolon just indicates which scale level is being defined. This definition of works for a continuum of scales , but typically only a finite discrete set of levels in the scale-space representation would be actually considered.
The scale parameter is the variance of the Gaussian filter and as a limit for the filter becomes an impulse function such that that is, the scale-space representation at scale level is the image itself. As increases, is the result of smoothing with a larger and larger filter, thereby removing more and more of the details that the image contains. Since the standard deviation of the filter is , details that are significantly smaller than this value are to a large extent removed from the image at scale parameter , see the following figure and for graphical illustrations.
Why a Gaussian filter?
When faced with the task of generating a multi-scale representation one may ask: could any filter g of low-pass type and with a parameter t which |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.