source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Alter%20Channel | Alter Channel, better known as Alter, was a private TV channel in Greece. It was launched in 1990 and owned by Eleftheri Tileorasi S.A. and was headed by Andreas Kouris. Alter's programming mainly consisted of news, current affairs shows and entertaining programs.
Alter featured news anchor Nikos Hadjinikolaou, morning show host Giorgos Aftias, and investigative reporter Makis Triantafyllopoulos. Additionally, Alter also aired the award-winning program Fos Sto Tounel, which tracked down missing individuals and solved various crimes. The show also featured a lineup of children's programming that aired daily. In early December 2011, Alter stopped broadcasting due to financial difficulties.
History
1994 (March) – The station was launched as Channel 5.
In a transitional period when it was co-owned by Altec and Kouris Media Group it was named Alter 5.
2000 – On the 29th October of this year it rebranded its name as Alter Channel.
2002 (September) – Alter moves the news programming from 6 pm Balkan-Nile (UTC+02:00) to an hour and twenty minutes later to compete with other channels such as ANT1 news.
2005 – On April 20, Alter overhauled its lineup and organised its schedule into blocks: morning, noon, afternoon and night. The morning block featured news and current affairs, as well as programming for children. The noon block had current affairs and entertainment shows. During the evening Alter broadcast serials and the main nightly newscast. At night, programming consisted mainly of entertainment and talk shows.
2005 – Alter launches Alter Globe, serving North America (Aug. 24th) on Dish Network, and Australia, Asia and Africa (December) on UBI World TV.
2007 – Alter Globe was removed from the Dish Network platform in the US on August 3st1, 2007, and debuted on the rival platform DirecTV on September 26, 2007.
2008 – Alter Globe launches in New Zealand via UBI World TV.
2010 – Alter Globe is added to Cablevision in the US then removed a short while later due to insufficient growth.
2011 (November) – Alter headquarters was occupied by its workers, who were striking in response to not having been paid in over a year.
2011 (December) – The channel stopped broadcasting.
2012 (April) – Plans to reopen the channel began, with finance believed to be by Israeli, French and Turkish investors.
Alter Channel workers' occupation (30th November 2011 – 10th February 2012)
On November 11, 2011, unpaid Alter employees occupied the station, broadcasting their demands over the transmission. Alter employees produced and transmitted their own program from January 1 until February 10th, 2012, at which point all transmissions ceased.
The programme featured interviews with unemployed Greeks, unpaid workers, striking workers of the Greek steel industry, unpaid employees of newspaper Eleftherotypia, economist Dimitris Kazakis (who referred to the imposition of new measures by the government Papademos), the chairman of power company union GENOP, Nikos Fotopoulos, and former |
https://en.wikipedia.org/wiki/Mega%20Channel | MEGA Channel, also known as MEGA TV or just MEGA, is a television network in Greece, that broadcasts a mix of foreign and Greek programming. It is the first and the oldest private television network in Greece.
History
Mega Channel (1989–2018)
Mega is the first private television station to launch in Greece on 20 November 1989 and was the trade name of Teletypos S.A. (Τηλέτυπος A.E.)
The channel regularly achieved the top ratings spot in Greece through its varied programming including comedies, dramas, news, current affairs and entertainment shows. Examples include the popular Greek comedies Sto Para Pente, Savatogenimmenes and Maria, i Aschimi.
The channel was also granted the rights to Victoria Hislop's novel The Island. This became a 26 episode drama series called To Nisi. The show was the most expensive show in Greek television history with a budget of €4 million.
Financial problems and subsequent closure
Since 2012, the parent company had been experiencing financial issues due to poor borrowing practises. In 2016, the channels debts were reported to be approximately €116 million. At the same time, reports of staff being unpaid began to emerge.
In 2016, it was reported that the company was restructuring loans in order to continue operations. This was despite the fact the company didn't proceed with a share capital increase of 15 million euros that was agreed in exchange for the banks agreeing to extend their return to 2021.
The staff of Mega Channel continued to keep the channel on air despite not being paid and being ignored by the parent company. The decision was taken to cease all news and live programming and instead focus on rebroadcasting content from their extensive program library without commercial breaks.
Mega continued broadcasting until it was removed from the platforms. The channel was removed by Digea (the company responsible for digital over-the-air broadcasting in Greece) at 02:08:36 on the morning of 28th October 2018. The channel was then also removed from pay-TV platforms on 20 November 2018. The channel did continue to broadcast via online streaming from its webpage.
Sale of assets
On 1 November 2019, the Mega Channel branding, logo and vast program library were put up for auction.
The winning bid of €33,999,999 belonged to Alter Ego Mass Media Co. S.A.
Mega Channel (2020–present)
Following the auction, plans were put in place to re-launch Mega.
On 17 February 2020, the channel relaunched with a variety of live programming, news, movies and selected programs from its program library.
The channel was using the familiar 'Mega Mou' (My Mega) on-screen branding that was originally used between 2010 and 2014 as well as the new tag line of Mega όπως πάντα! (Mega as always!).
However, on June 27, 2021, the channel retired the 'Mega Mou' branding and began to use a new ident package in which objects form the logo.
Under the ownership of Alter Ego, the channel is now located at 340 Syngrou Avenue, Kallithea, Athens, G |
https://en.wikipedia.org/wiki/List%20of%20programs%20broadcast%20by%20Mega%20Channel | This article lists programs broadcast by Mega Channel and on Mega Cosmos for international viewers from Greece:
Current programming
Note: Titles are listed according to their year of debut on the network in parentheses.
Dramas
I Gi tis Elias (2021)
Docuseries
Mega Stories with Dora Anagnostopoulou (2020)
Reality/non-scripted
Fos Sto Tounel with Aggeliki Nikolouli (1995)
Fishy with Giannis Tsimitselis (2021)
Game shows
Celebrity Game Night (2014)
The Chase with Maria Bekatorou (2021)
Talk shows
Eleni with Eleni Menegaki (2011)
Everything about our life with Michalis Kefalogiannis (2021)
Pame Danai with Danai Barka (2020)
Late night shows
Mega View with Niki Lyberaki (2021)
Specials
Spiti me to Mega (2020)
News and information
MEGA Central News (1989)
MEGA Afternoon News (1989)
MEGA Weekend (2005)
Koinonia Ora MEGA (2006)
Live News with Nikos Evagelatos (2020)
Mega Good Morning with Eleonora Meleti (2021)
Smile Again with Sissy Christidou (2021)
Sports
UEFA Champions League
Super Bala Live (2002)
Former programming
Soap operas
Series
Action/mystery
Drama
H Dipsa (Thirst) 1989-1991 - starring Giannis Voglis
Spiti gia Pente (A House for Five) 1991-1992 - starring Karmem Rougeri
Gynaikes (Women) 1992-1993 - written by Mirella Papaoikonomou
Africa 1992-1993 - starring Nikos Sergianopoulos and Stavros Zalmas
Oi Frouroi tis Achaeas (Achaea's Guards) 1992-1993 - starring Mimi Ntenisi and Stratos Tzortzoglou
Anastasia 1993-1994 - written by Mirella Papaoikonomou
Esu Apofasizeis (It's Your Decision) 1993-1996 - starring Giannis Vouros
Mi Fovasai ti Fotia (Don't Be Afraid of the Fire) 1994-1995 - written by Mirella Papaoikonomou
To Teleutaio Antio (The Last Goodbye) 1994-1995 - starring Giorgos Kimoulis and Kariofyllia Karampeti
Apon (Absent) 1995-1996 - written by Mirella Papaoikonomou, starring Yannis Bezos
Palirria (Tide) 1996-1997 - starring Nikos Sergianopoulos and Stratos Tzortzoglou
Logo Timis (Due to my Honour) - written by Mirella Papaoikonomou
Tzivaeri 1997-1998 - starring Vana Mparmpa
Psithuroi Kardias (Whispers of the Hearts) 1997-1998 - Directed by Manousos Manousakis
I Zoi Pou Den Ezisa (The Life I Didn't Lived) 1998-1999 - written by Mirella Papaoikonomou
To Simadi tou Erota (Love's Sign) 1998-1999 - starring Vana Mparmpa and Stratos Tzortzoglou
I Aithousa tou Thronou (Throne's Chamber) 1998-1999 - starring Alekos Alexandrakis
Thumata Eirinis (Victims of Peace) 1998-1999 - starring Anna-Maria Papaharalambous
O Megalos Thumos (The Big Anger) 1998-1999 - starring Gregoris Valtinos and Kariofyllia Karampeti
Vendetta 1999-2000 - starring Giannis Fertis and Koralia Karanti
Sti Skia tou Polemou (In War's Shadow) 1999-2000 - starring Mimi Ntenisi and Stratos Tzortzoglou
H Zoi mas Mia Volta (Our Life is a Walk) 1999-2000 - starring Christoforos Papakaliatis and Fylareti Komninou
Fugame (Let's Go) 1999-2000 - Directed by Nikos Koutelidakis
Aerines Siopes (Silence in the Air) 2000-2003 - starring Marios Athanasiou |
https://en.wikipedia.org/wiki/Jaron%20Lanier | Jaron Zepel Lanier (, born May 3, 1960) is an American computer scientist, visual artist, computer philosophy writer, technologist, futurist, and composer of contemporary classical music. Considered a founder of the field of virtual reality, Lanier and Thomas G. Zimmerman left Atari in 1985 to found VPL Research, Inc., the first company to sell VR goggles and wired gloves. In the late 1990s, Lanier worked on applications for Internet2, and in the 2000s, he was a visiting scholar at Silicon Graphics and various universities. In 2006 he began to work at Microsoft, and from 2009 has worked at Microsoft Research as an Interdisciplinary Scientist.
Lanier has composed contemporary classical music and is a collector of rare instruments (of which he owns one to two thousand); his acoustic album, Instruments of Change (1994) features Asian wind and string instruments such as the khene mouth organ, the suling flute, and the sitar-like esraj. Lanier teamed with Mario Grigorov to compose the soundtrack to the documentary film The Third Wave (2007).
In 2005, Foreign Policy named Lanier as one of the top 100 Public Intellectuals. In 2010, Lanier was named to the TIME 100 list of most influential people. In 2014, Prospect named Lanier one of the top 50 World Thinkers. In 2018, Wired named Lanier one of the top 25 most influential people over the last 25 years of technological history.
Early life and education
Born Jaron Zepel Lanier in New York City, Lanier was raised in Mesilla, New Mexico. Lanier's mother and father were Jewish; his mother was a Nazi concentration camp survivor from Vienna, and his father's family had emigrated from Ukraine to escape the pogroms. When he was nine years old, his mother was killed in a car accident. He lived in tents for an extended period with his father before embarking on a seven-year project to build a geodesic dome home that he helped design.
At the age of 13, Lanier convinced New Mexico State University to let him enroll. At NMSU, he took graduate-level courses; he received a grant from the National Science Foundation to study mathematical notation, which led him to learn computer programming.
From 1979 to 1980, Lanier's NSF-funded project at NMSU focused on "digital graphical simulations for learning". Lanier also attended art school in New York during this time, but returned to New Mexico and worked as an assistant to a midwife. The father of a baby he helped deliver gave him a car as a gift, which Lanier later drove to Santa Cruz.
Atari Labs, VPL Research (1983–1990)
In California, Lanier worked for Atari Inc., where he met Thomas Zimmerman, inventor of the data glove. After Atari was split into two companies in 1984, Lanier became unemployed. The free time enabled him to concentrate on his own projects, including VPL, a "post-symbolic" visual programming language. Along with Zimmerman, Lanier founded VPL Research, focusing on commercializing virtual reality technologies; the company prospered for a while, but fi |
https://en.wikipedia.org/wiki/Charting | Charting may refer to:
Chart, graphical representation of data
Nautical chart, process of building a chart of water bodies
Music chart, ordered list of music sales
See also
Chart (disambiguation) |
https://en.wikipedia.org/wiki/GBN | GBN may refer to:
Media
Global Broadcast News India
Gospel Broadcasting Network, US Christian satellite broadcaster
Global Buddhist Network, Thai digital television station
GB News, UK opinion-orientated channel
Other uses
Go-Back-N ARQ, reliable data transfer protocol
Gebrüder Bing Nuremberg, German toy company
Glenbrook North High School
Global Benchmarking Network
Gore Beyond Necropsy, a Japanese band |
https://en.wikipedia.org/wiki/David%20Bradley%20%28engineer%29 | David J. Bradley (born 4 January 1949) is one of the twelve engineers who worked on the original IBM PC, developing the computer's ROM BIOS code. Bradley is credited for implementing the "Control-Alt-Delete" (Ctrl-Alt-Del) key combination that was used to reboot the computer. Bradley joined IBM in 1975 after earning his doctorate in electrical engineering from Purdue University with a dissertation on computer architectures.
Education
Bachelors, Electrical Engineering, University of Dayton (Ohio), 1971.
Master of Science, Electrical Engineering, Purdue University, 1972.
PhD, Electrical Engineering, Purdue University, 1975.
Control-Alt-Delete
According to Bradley, Control-Alt-Delete was not intended to be used by end users, originally—it was meant to be used by people writing programs or documentation, so that they could reboot their computers without powering them down. This was useful since after a computer was powered down, it was necessary to wait a few seconds before powering it up again to avoid potential damage to the power supply and hard drive. Since software developers and technical writers would need to restart a computer many times, this key combination was a big time-saver. David Bradley and Mel Hallerman chose this key combination because it is practically impossible to accidentally press this combination of keys on a standard original IBM PC keyboard.
However, the key combination was described in IBM's technical reference documentation and thereby revealed to the general public.
At the 20th anniversary of the IBM PC on August 8, 2001 at The Tech Museum, while on a panel with Bill Gates, Bradley said, "I have to share the credit. I may have invented it [Control-Alt-Delete], but I think Bill made it famous."
Multiple-key reboot had been introduced by Exidy, Inc., in 1978, for its Sorcerer Z80 computer. It provided two Reset buttons, which must be pressed simultaneously to achieve reboot.
In March 1980, the multiple-key reboot concept had been introduced for the Apple II by Videx in its VideoTerm display card add-on, requiring Control-Reset, rather than Reset alone, to reboot the machine. The innovation was noted and well received at the time.
Other accomplishments
Bradley is the author of Assembly Language Programming for the IBM Personal Computer (Simon & Schuster, , January 1984), also released in French as Assembleur sur IBM PC (Dunod, ), Russian ("Radio" Publishing House, Moscow), and Bulgarian ("Technica" Publishing house, 1989).
Bradley holds seven U.S. patents.
Bradley has been adjunct professor of electrical and computer engineering at Florida Atlantic University and at North Carolina State University.
Much of Bradley's career has been at IBM. Bradley received a B.E.E. degree in 1971 from the University of Dayton, (Ohio). He went on to Purdue University in West Lafayette, Indiana, where he completed an M.S. degree in 1972 and Ph.D. in 1975, both in electrical engineering. Upon graduation he went to work for I |
https://en.wikipedia.org/wiki/DIF | DIF may refer to:
Computing
Data Integrity Field, to protect data from corruption
Data Interchange Format
Digital Interface Format of DV video
Other uses
DIF a bank deposit insurance fund in the Commonwealth of Massachusetts, U.S.A. The Massachusetts DIF is similar to the U.S. government's Federal Deposit Insurance Corporation (FDIC)
Dif, a settlement in Kenya
DIF (Mexibús), a BRT station in Ecatepec de Morelos, Mexico
DIF (technique) for controlling plant height
National Olympic Committee and Sports Confederation of Denmark (Danmarks Idræts-Forbund)
Desarrollo Integral de la Familia (Integral Family Development), Mexico
Differential item functioning, a statistical procedure
Differentiation-inducing factor
Djurgårdens IF, a sports club in Sweden
Dubai Investment Fund, an investment firm of Dubai
Dublin Irish Festival, an annual cultural festival held in Dublin, Ohio, USA |
https://en.wikipedia.org/wiki/List%20of%20Internet%20radio%20stations | This is a list of Internet radio stations, including traditional broadcast stations which stream programming over the Internet as well as Internet-only stations.
General
BBC
Radio France
Indian Internet Radios
Boxout.fm
RadioJoyAlukkas.com
Sarawakian Internet Radios
Radio Free Sarawak
Raidió Teilifís Éireann
RAI – Radiotelevisione Italiana
Rai Radio Uno (News/Talk)
Rai Radio Due (Adult contemporary music)
Rai Radio Tre (Classical music)
Rai Sender Bozen (in German language)
Satelradio
Yle
YleX
Yle Radio Suomi
Yle X3M
Yle Vega
Weather
AccuWeather
Current affairs
C-SPAN
Entertainment
Music
Terrestrial/satellite stations
BBC (see section above)
CBC Radio Three
Gaydar Radio
Radio Caroline
Sirius Internet Radio, the Internet radio product of Sirius Satellite Radio
XM Radio Online, the Internet radio product of XM Satellite Radio
Community/public/campus/college/university stations
Religious stations
Jewish Rock Radio
KLOVE
Mormon Channel
Vatican Radio
Vision Radio Network (Australia)
Tourist/Park information stations
CFPE
Corporate owned stations
Audacy owned stations
Internet-only
!
Internet
Radio stations |
https://en.wikipedia.org/wiki/Sosumi | Sosumi is an alert sound introduced by Jim Reekes in Apple Inc.'s Macintosh System 7 operating system in 1991. The name is derived from the phrase "so, sue me!" because of a long running court battle with Apple Corps, the similarly named music company, regarding the use of music in Apple Inc.'s computer products.
History
Sosumi is a short xylophone sample, which gained notoriety in computer folklore as a defiant pun name, in response to a long-running Apple Corps v Apple Computer trademark conflict. The sound was long included in subsequent versions of its computer OS releases. However, in 2020 it was replaced in macOS Big Sur.
During the development of System 7, the two companies concluded a settlement agreement from an earlier dispute when Apple added a sound synthesis chip to its Apple IIGS machine. As a result, Apple Computer was prohibited from using its trademark on "creative works whose principal content is music".
When new sounds for System 7 were created, the sounds were reviewed by Apple's Legal Department who objected that the new sound alert "chime" had a name that was "too musical", under a 1991 settlement. Jim Reekes, the creator of the new sound alerts for System 7, had grown frustrated with the legal scrutiny and first quipped it should be named "Let It Beep", a pun on "Let It Be". When someone remarked that that would not pass the Legal Department's approval, he remarked, "so sue me". After a brief reflection, he resubmitted the sound's name as sosumi (a homophone of "so sue me"). Careful to submit it in written form rather than spoken form to avoid pronunciation, he told the Legal Department that the name was Japanese and had nothing to do with music.
In macOS Big Sur, the original chime was replaced with a different sample, named Sonumi (presumably a homophone of "so new me", due to the change in versioning from macOS 10.15 to macOS 11). The original name was retained in the first public version of the OS, and was later changed to "Sonumi" as it appears in the System Preferences. The sound file itself in /System/Library/Sounds/ is still named Sosumi.aiff, and other alert sounds (such as "Breeze" or "Crystal") still have the same file names from the previous macOS series (Blow.aiff and Glass.aiff).
In popular culture
The term is in the poem "A Short Address to the Academy of Silence" by Jay Parini.
Jon Lech Johansen's weblog "So Sue Me" is commonly mistakenly believed to be a reference to the Apple sound.
Apple used the CSS class name "sosumi" for formatting legal fine print on Apple product web pages.
In 2006, Geek Squad used this sound in their commercial "Jet Pack", in which a woman was frustrated over her computer.
The sound can be heard prominently in the introduction to The Simpsons episode Homer's Phobia (1997). The couch gag parodies the AOL Dial-up Internet access sign-on process, parodying it "America Onlink". On a System 7-like interface, the user clicks the "Load Family" button, getting to a stalled progres |
https://en.wikipedia.org/wiki/Primitive%20data%20type | In computer science, primitive data types are a set of basic data types from which all other data types are constructed. Specifically it often refers to the limited set of data representations in use by a particular processor, which all compiled programs must use. Most processors support a similar set of primitive data types, although the specific representations vary. More generally, "primitive data types" may refer to the standard data types built into a programming language (built-in types). Data types which are not primitive are referred to as derived or composite.
Primitive types are almost always value types, but composite types may also be value types.
Common primitive data types
The most common primitive types are those used and supported by computer hardware, such as integers of various sizes, floating-point numbers, and Boolean logical values. Operations on such types are usually quite efficient. Primitive data types which are native to the processor have a one-to-one correspondence with objects in the computer's memory, and operations on these types are often the fastest possible in most cases. Integer addition, for example, can be performed as a single machine instruction, and some offer specific instructions to process sequences of characters with a single instruction. But the choice of primitive data type may affect performance, for example it is faster using SIMD operations and data types to operate on an array of floats.
Integer numbers
An integer data type represents some range of mathematical integers. Integers may be either signed (allowing negative values) or unsigned (non-negative integers only). Common ranges are:
Floating-point numbers
A floating-point number represents a limited-precision rational number that may have a fractional part. These numbers are stored internally in a format equivalent to scientific notation, typically in binary but sometimes in decimal. Because floating-point numbers have limited precision, only a subset of real or rational numbers are exactly representable; other numbers can be represented only approximately. Many languages have both a single precision (often called "float") and a double precision type (often called "double").
Booleans
A boolean type, typically denoted "bool" or "boolean", is typically a logical type that can have either the value "true" or the value "false". Although only one bit is necessary to accommodate the value set "true" and "false", programming languages typically implement boolean types as one or more bytes.
Many languages (e.g. Java, Pascal and Ada) implement booleans adhering to the concept of boolean as a distinct logical type. Some languages, though, may implicitly convert booleans to numeric types at times to give extended semantics to booleans and boolean expressions or to achieve backwards compatibility with earlier versions of the language. For example, early versions of the C programming language that followed ANSI C and its former standards did not |
https://en.wikipedia.org/wiki/Japanese%20language%20and%20computers | In relation to the Japanese language and computers many adaptation issues arise, some unique to Japanese and others common to languages which have a very large number of characters. The number of characters needed in order to write in English is quite small, and thus it is possible to use only one byte (28=256 possible values) to encode each English character. However, the number of characters in Japanese is many more than 256 and thus cannot be encoded using a single byte - Japanese is thus encoded using two or more bytes, in a so-called "double byte" or "multi-byte" encoding. Problems that arise relate to transliteration and romanization, character encoding, and input of Japanese text.
Character encodings
There are several standard methods to encode Japanese characters for use on a computer, including JIS, Shift-JIS, EUC, and Unicode. While mapping the set of kana is a simple matter, kanji has proven more difficult. Despite efforts, none of the encoding schemes have become the de facto standard, and multiple encoding standards were in use by the 2000s. As of 2017, the share of UTF-8 traffic on the Internet has expanded to over 90 % worldwide, and only 1.2% was for using Shift-JIS and EUC. Yet, a few popular websites including 2channel and kakaku.com are still using Shift-JIS.
Until 2000s, most Japanese emails were in ISO-2022-JP ("JIS encoding") and web pages in Shift-JIS and mobile phones in Japan usually used some form of Extended Unix Code. If a program fails to determine the encoding scheme employed, it can cause and thus unreadable text on computers.
The first encoding to become widely used was JIS X 0201, which is a single-byte encoding that only covers standard 7-bit ASCII characters with half-width katakana extensions. This was widely used in systems that were neither powerful enough nor had the storage to handle kanji (including old embedded equipment such as cash registers) because Kana-Kanji conversion required a complicated process, and output in kanji required much memory and high resolution. This means that only katakana, not kanji, was supported using this technique. Some embedded displays still have this limitation.
The development of kanji encodings was the beginning of the split. Shift JIS supports kanji and was developed to be completely backward compatible with JIS X 0201, and thus is in much embedded electronic equipment. However, Shift JIS has the unfortunate property that it often breaks any parser (software that reads the coded text) that is not specifically designed to handle it.
For example, some Shift-JIS characters include a backslash (0x5C "\") in the second byte, which is used as an escape character in many programming languages.
A parser lacking support for Shift JIS will recognize 0x5C 0x82 as an invalid escape sequence, and remove it. Therefore, the phrase cause mojibake.
This can happen for example in the C programming language, when having Shift-JIS in text strings. It does not happen in HTML sin |
https://en.wikipedia.org/wiki/The%20Network | The Network is an American six-piece new wave band. A secret side project of rock band Green Day, they released their debut album Money Money 2020 on Adeline Records on September 30, 2003. After a 15-year hiatus, the band became active again in 2020, releasing a follow-up album titled Money Money 2020 Part II: We Told Ya So! in December 2020.
History
Formed in the Summer of 2003, the band consisted of lead vocalist Fink, bassist Van Gough, and drummer Snoo, as well as additional members Captain Underpants and Z on keyboards and rhythm guitarist Balducci. They claimed they were "brought together by an ancient prophecy".
The band's debut album Money Money 2020 was released in September 2003 on Green Day singer Billie Joe Armstrong's record label Adeline Records. The Network concealed their identities by using accents and wearing masks. They frequently released press statements denouncing Green Day.
There is also an unsubstantiated rumor that members of the band Devo were involved, but their alleged participation has not been acknowledged by anyone in either band.
Shortly before the release of the debut album, Green Day's then in the works album Cigarettes and Valentines was reportedly stolen. Due to the timeframe of the theft and the release of this album, many people speculated that they were related, however, Billie Joe Armstrong has denied connections between the two projects in various interviews, and in fact, that album was recovered and Armstrong and Mike Dirnt stated they had plans for it.
Money Money 2020 was re-mastered and re-released by Reprise Records on November 9, 2004, with two additional tracks, "Hammer of the Gods" and a cover of The Misfits "Teenagers from Mars", which can also be heard on Tony Hawk's American Wasteland while "Roshambo" is on the NHL 2005 soundtrack. The original Money Money 2020 release came with a companion DVD with music videos directed and produced by Roy Miles of AntiDivision.
In October 2005, the group opened for Green Day for several shows. After this, they became inactive.
In October 2020, after 15 years of inactivity, the band released a teaser trailer entitled "The Prophecy". In the video's description, the band announced the release of their forthcoming album Money Money 2020 Part II: We Told Ya So!. On November 2, 2020, the band released a song entitled "Ivankkka Is a Nazi" to their YouTube page with an accompanying music video. On November 20, 2020, the band released an EP entitled Trans Am to promote their upcoming album, which is when they revealed the full title of their new album. Following music videos for the songs "Flat Earth" and "Fentanyl," the band released one-minute teaser videos for each group of songs (based upon the vinyl tracklisting) every day of the week of the album's release. On December 4, 2020, Money Money 2020 Part II: We Told Ya So! was released on streaming worldwide. On February 26, 2021, the band performed on The Tonight Show Starring Jimmy Fallon.
Identities
A |
https://en.wikipedia.org/wiki/National%20Maritime%20Museum | The National Maritime Museum (NMM) is a maritime museum in Greenwich, London. It is part of Royal Museums Greenwich, a network of museums in the Maritime Greenwich World Heritage Site. Like other publicly funded national museums in the United Kingdom, it has no general admission charge; there are admission charges for most side-gallery temporary exhibitions, usually supplemented by many loaned works from other museums.
Creation and official opening
The museum was created by the National Maritime Museum Act 1934 under a Board of Trustees, appointed by HM Treasury. It is based on the generous donations of Sir James Caird (1864–1954). King George VI formally opened the museum on 27 April 1937 when his daughter Princess Elizabeth accompanied him for the journey along the Thames from London. The first director was Sir Geoffrey Callender.
Collection
Since the earliest times Greenwich has had associations with the sea and navigation. It was a landing place for the Romans, Henry VIII lived here, the Navy has roots on the waterfront, and Charles II founded the Royal Observatory in 1675 for "finding the longitude of places". The home of Greenwich Mean Time and the Prime Meridian since 1884, Greenwich has long been a centre for astronomical study, while navigators across the world have set their clocks according to its time of day. The museum has the most important holdings in the world on the history of Britain at sea comprising more than two million items, including maritime art (both British and 17th-century Dutch), cartography, manuscripts including official public records, ship models and plans, scientific and navigational instruments, instruments for time-keeping and astronomy (based at the Observatory). Its holdings including paintings relating to Vice-Admiral Horatio Nelson and Captain James Cook.
An active loans programme ensures that items from the collection are seen in the UK and abroad.
The museum aims to achieve a greater understanding of British economic, cultural, social, political and maritime history and its consequences in the world today. The museum plays host to various exhibitions, including Ships Clocks & Stars in 2014, Samuel Pepys: Plague, Fire, Revolution in 2015 and Emma Hamilton: Seduction and Celebrity in 2016.
The collection of the National Maritime Museum also includes items taken from the German Naval Academy Mürwik after World War II, including several ship models, paintings and flags. The museum has been criticized for possessing what has been described as "looted art". The museum regards these cultural objects as "war trophies", removed under the provisions of the Potsdam Conference.
The museum awards the Caird Medal annually in honour of its major donor, Sir James Caird.
In late August 2018, several groups were vying for the right to purchase the 5,500 relics that were an asset of the bankrupt Premier Exhibitions. Eventually, the National Maritime Museum, Titanic Belfast and Titanic Foundation Limited, as well as |
https://en.wikipedia.org/wiki/List%20of%20Alberta%20provincial%20highways | The Canadian province of Alberta has a provincial highway network consisting of over of roads as of 2021-2022, of which have been paved.
All of Alberta's provincial highways are maintained by Alberta Transportation (AT), a department of the Government of Alberta. The network includes two distinct series of numbered highways:
The 1–216 series (formerly known as primary highways), making up Alberta's core highway network—typically paved and with the highest traffic volume
The 500–986 series, providing more local access, with a higher proportion of gravel surfaces
History
In 1926, Alberta discontinued its system of marking highways with different colours in favour of a numbering system. By 1928, the year a gravel road stretched from Edmonton to the United States border, Alberta's provincial highway network comprised .
Prior to 1973, the expanding highway system comprised one-digit and two-digit highways, with some numbers having letter suffixes (e.g., Highway 1X, Highway 26A). In 1973, a second highway system emerged, using three digits starting in the 500s and referred to as secondary roads, while the existing system continued to be referred to as provincial highways. In 1974, provincial highways became known as primary highways; and in 1990, secondary roads became known as secondary highways.
Secondary highways were abolished in 2000, with most becoming primary highways. The expanded primary highway system was divided into two subsets: former primary highways, which became the 1–216 series; and former secondary highways, which became the 500–986 series. In 2010, all highways became known as provincial highways, while maintaining the two numbered series. Despite this, the series are still often referred to as primary and secondary highways, respectively.
1 - 216 series
Alberta's 1 to 216 series of provincial highways are Alberta's main highways. They are numbered from 1 to 100, with the exception of the ring roads around Calgary and Edmonton, which are numbered 201 and 216 respectively. The numbers applied to these highways are derived from compounding the assigned numbers of the core north–south and east–west highways that intersect with the rings roads. In Calgary, Highway 201 is derived from the north-south Highway 2 and the east-west Highway 1. In Edmonton, Highway 216 is derived from the same north-south Highway 2 and the east-west Highway 16.
Within this series, all or portions of Highways 1, 2, 3, 4, 9, 15, 16, 28, 28A, 35, 43, 49, 63, 201 and 216 are designated core routes of Canada's National Highway System (NHS). Highway 28 from Highway 63 to Cold Lake is designated a NHS feeder route and Highway 58 between Rainbow Lake and Highway 88 is designated a NHS northern/remote route.
Highways 1, 2, 3, 4, 16, and 43 are considered Alberta's most important interprovincial and international highways and are divided highways (expressways) or freeways for much or all of their length. Speed limits are generally divided highways/freewa |
https://en.wikipedia.org/wiki/Underdog%20%28TV%20series%29 | Underdog is an American Saturday morning animated television series that ran from October 3, 1964, to March 4, 1967, starting on the NBC network until 1966, with the rest of the run on CBS, under the primary sponsorship of General Mills, for a run of 62 episodes. It is one of the early Saturday morning cartoons. The show continued in syndication until 1973.
Underdog, Shoeshine Boy's heroic alter ego, appears whenever love interest Sweet Polly Purebred is being victimized by such villains as Simon Bar Sinister or Riff Raff. Underdog nearly always speaks in rhyming couplets, as in "There's no need to fear, Underdog is here!" His voice was supplied by Wally Cox.
History
In 1959, handling the General Mills account as an account executive with the Dancer Fitzgerald Sample advertising agency in New York, W. Watts Biggers teamed with Chet Stover, Treadwell D. Covington, and artist Joe Harris in the creation of television cartoon shows to sell breakfast cereals for General Mills. The shows introduced such characters as King Leonardo, Tennessee Tuxedo, and Underdog. Biggers and Stover contributed both scripts and songs to the series. When Underdog became a success, Biggers and his partners left Dancer Fitzgerald Sample to form their own company, Total Television, with animation produced at Gamma Studios in Mexico. In 1969, Total Television folded when General Mills dropped out as the primary sponsor, but continued to retain the rights to the series until 1995 and TV distribution rights, through NBCUniversal Television Distribution, to the present day.
Abroad and in syndication
The syndicated version of The Underdog Show consists of 62 half-hour episodes. The supporting segments differ from the show's original network run. The first 26 syndicated episodes feature Tennessee Tuxedo as a supporting segment. (Tennessee Tuxedo originally aired as a separate show and also has its own syndicated adaptation.) Thereafter, for most of the balance of the package, the middle segments include Go Go Gophers and Klondike Kat for three consecutive half-hours and Tennessee Tuxedo in the fourth. Commander McBragg is featured in the majority of episodes, replaced by three segments of The Sing-A-Long Family (in shows one-three, 28–30, and 55–57). The final two syndicated Underdog half-hours feature two one-shot cartoons that were originally part of an unsold pilot for a projected 1966 series, The Champion (Cauliflower Cabbie and Gene Hattree), with Commander McBragg appearing in show 61 and Go Go Gophers in show 62.
The syndicated series, as shown in the United States, is a potpourri of segments from previously aired versions of the show. Prior to a 1994 remaster, each episode included a "teaser" at the top of the show, asking viewers to stay tuned for a clip from "today's four-part story". (This originates from a 1969–1973 NBC Saturday morning rerun version of the show.) However, never more than two parts of the Underdog stories were ever shown in any half-hour pro |
https://en.wikipedia.org/wiki/Horn%20clause | In mathematical logic and logic programming, a Horn clause is a logical formula of a particular rule-like form that gives it useful properties for use in logic programming, formal specification, universal algebra and model theory. Horn clauses are named for the logician Alfred Horn, who first pointed out their significance in 1951.
Definition
A Horn clause is a disjunctive clause (a disjunction of literals) with at most one positive, i.e. unnegated, literal.
Conversely, a disjunction of literals with at most one negated literal is called a dual-Horn clause.
A Horn clause with exactly one positive literal is a definite clause or a strict Horn clause; a definite clause with no negative literals is a unit clause, and a unit clause without variables is a fact;.
A Horn clause without a positive literal is a goal clause.
Note that the empty clause, consisting of no literals (which is equivalent to false) is a goal clause.
These three kinds of Horn clauses are illustrated in the following propositional example:
All variables in a clause are implicitly universally quantified with the scope being the entire clause. Thus, for example:
¬ human(X) ∨ mortal(X)
stands for:
∀X( ¬ human(X) ∨ mortal(X) ),
which is logically equivalent to:
∀X ( human(X) → mortal(X) ).
Significance
Horn clauses play a basic role in constructive logic and computational logic. They are important in automated theorem proving by first-order resolution, because the resolvent of two Horn clauses is itself a Horn clause, and the resolvent of a goal clause and a definite clause is a goal clause. These properties of Horn clauses can lead to greater efficiency of proving a theorem: the goal clause is the negation of this theorem; see Goal clause in the above table. Intuitively, if we wish to prove φ, we assume ¬φ (the goal) and check whether such assumption leads to a contradiction. If so, then φ must hold. This way, a mechanical proving tool needs to maintain only one set of formulas (assumptions), rather than two sets (assumptions and (sub)goals).
Propositional Horn clauses are also of interest in computational complexity. The problem of finding truth-value assignments to make a conjunction of propositional Horn clauses true is known as HORNSAT.
This problem is P-complete and solvable in linear time.
Note that the unrestricted Boolean satisfiability problem is an NP-complete problem.
In universal algebra, definite Horn clauses are generally called quasi-identities; classes of algebras definable by a set of quasi-identities
are called quasivarieties and enjoy some of the good properties of the more restrictive notion of a variety, i.e., an equational class. From the model-theoretical point of view, Horn sentences are important since they are exactly (up to logical equivalence) those sentences preserved under reduced products; in particular, they are preserved under direct products. On the other hand, there are sentences that are not Horn but are nevertheless preserved under |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Illinois | The following is a list of FCC-licensed radio stations in the U.S. state of Illinois, which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
Defunct
WAMV
WCEV
WCHI
WCLM
WENR
WGEM
WIBU
References
External links
worldradiomap.com – List of radio stations in Chicago, Illinois
Illinois
Radio |
https://en.wikipedia.org/wiki/Lists%20of%20television%20stations%20in%20North%20America |
Canada
According to the CRTC, there are 18 UHF public television networks, 11 VHF public television networks, 19 UHF commercial television networks, 43 VHF commercial television networks, 22 UHF system television networks, and 5 VHF system television networks. These lists only cover broadcast stations.
List of television stations in Alberta
List of television stations in British Columbia
List of television stations in Manitoba
List of television stations in New Brunswick
List of television stations in Newfoundland and Labrador
List of television stations in Northwest Territories
List of television stations in Nova Scotia
List of television stations in Nunavut
List of television stations in Ontario
List of television stations in Prince Edward Island
List of television stations in Quebec
List of television stations in Saskatchewan
List of television stations in Yukon
United States
According to the FCC, as of March 31, 2011, there are 1022 UHF commercial television stations, 360 VHF commercial television stations, 285 UHF educational television stations and 107 VHF educational television stations, plus 439 Class A UHF television stations, 76 Class A VHF television stations, 3043 UHF television translators, 1411 VHF television translators, 1656 UHF low-power television stations and 516 VHF low-power television stations. These lists only cover broadcast stations.
There are also many amateur television stations throughout the entire world.
List of television stations in Alabama
List of television stations in Alaska
List of television stations in Arizona
List of television stations in Arkansas
List of television stations in California
List of television stations in Colorado
List of television stations in Connecticut
List of television stations in Delaware
List of television stations in Florida
List of television stations in Georgia
List of television stations in Hawaii
List of television stations in Idaho
List of television stations in Illinois
List of television stations in Indiana
List of television stations in Iowa
List of television stations in Kansas
List of television stations in Kentucky
List of television stations in Louisiana
List of television stations in Maine
List of television stations in Maryland
List of television stations in Massachusetts
List of television stations in Michigan
List of television stations in Minnesota
List of television stations in Mississippi
List of television stations in Missouri
List of television stations in Montana
List of television stations in Nebraska
List of television stations in Nevada
List of television stations in New Hampshire
List of television stations in New Jersey
List of television stations in New Mexico
List of television stations in New York
List of television stations in North Carolina
List of television stations in North Dakota
List of television stations in Ohio
List of television stations in Oklahoma
List of television stations in Oregon
|
https://en.wikipedia.org/wiki/AX.25 | AX.25 (Amateur X.25) is a data link layer protocol originally derived from layer 2 of the X.25 protocol suite and designed for use by amateur radio operators. It is used extensively on amateur packet radio networks.
AX.25 v2.0 and later occupies the data link layer, the second layer of the OSI model. It is responsible for establishing link-layer connections, transferring data encapsulated in frames between nodes, and detecting errors introduced by the communications channel. As AX.25 is a pre-OSI-model protocol, the original specification was not written to cleanly separate into OSI layers. This was rectified with version 2.0 (1984), which assumes compliance with OSI level 2.
AX.25 v2.2 (1998) added improvements to improve efficiency, especially at higher data rates. Stations can automatically negotiate payload sizes larger than the previous limitation of 256 bytes. Extended sequence numbers (7 vs. 3 bits) allow a larger window size, the number of frames that can be sent before waiting for acknowledgement. "Selective Reject" allows only the missing frames to be resent, rather than having to wastefully resend frames that have already been received successfully. Despite all these advantages, few implementations have been updated to include these improvements published more than 20 years ago. The only known complete implementation of v2.2, at this time (2020), is the Dire Wolf software TNC.
AX.25 is commonly used as the data link layer for network layer such as IPv4, with TCP used on top of that. AX.25 supports a limited form of source routing. Although it is possible to build AX.25 switches similar to the way Ethernet switches work, this has not yet been accomplished.
Specification
AX.25 does not define a physical layer implementation. In practice 1200 baud Bell 202 tones and 9600 baud G3RUH DFSK are almost exclusively used on VHF and UHF. On HF the standard transmission mode is 300 baud Bell 103 tones. At the physical layer, AX.25 defines only a "physical layer state machine" and some timers related to transmitter and receiver switching delays.
At the link layer, AX.25 uses HDLC frame syntax and procedures. (ISO 3309) frames are transmitted with NRZI encoding. HDLC specifies the syntax, but not the semantics, of the variable-length address field of the frame. AX.25 specifies that this field is subdivided into multiple addresses: a source address, zero or more repeater addresses, and a destination address, with embedded control fields for use by the repeaters. To simplify compliance with amateur radio rules, these addresses derive from the station call signs of the source, destination and repeater stations.
Media access control follows the Carrier sense multiple access approach with collision recovery (CSMA/CR).
AX.25 supports both virtual-circuit connected and datagram-style connectionless modes of operation. The latter is used to great effect by the Automatic Packet Reporting System (APRS).
A simple source routing mechanism using |
https://en.wikipedia.org/wiki/Joseph%20Bosworth | Joseph Bosworth (1788 – 27 May 1876) was an English scholar of the Anglo-Saxon language and compiler of the first major Anglo-Saxon dictionary.
Biography
Born in Derbyshire in 1788, Bosworth was educated at Repton School as a 'Poor Scholar' but left in his early teens and did not go to university. Despite the lack of a degree he somehow gained sufficient academic standing for the Church of England to allow him to become a priest. He became a curate in Bunny, Notts in 1814 and three years later became vicar of Little Horwood, Buckinghamshire. He was proficient in many European languages and made a particular study of Anglo-Saxon. This suggests that his years between leaving Repton and becoming a priest were spent working for someone whose own interests lay in these directions and who greatly encouraged Bosworth's academic development. There is no proof as to who this was but possible candidates are Sharon Turner (1768-1847), a London solicitor turned researcher or Alexander Crombie (1762-1840), a Scottish-born philologist and proprietor of a school in London.
Bosworth was awarded an M.A. in 1822 by the University of Aberdeen on the recommendation of three other Buckinghamshire clergymen. In 1823, his Elements of Anglo-Saxon Grammar appeared, and he also matriculated at Trinity College, Cambridge as a 'ten-year man' (mature student). In July 1825 he was elected a member of the American Antiquarian Society, and in June 1829, he was elected a Fellow of the Royal Society.
In 1829, Bosworth went to the Netherlands as a chaplain, first in Amsterdam and then in Rotterdam. In 1831, the degree of Ph.D. was conferred on him by the University of Leyden. Trinity College, Cambridge granted him the degree of B.D. in 1834 and D.D. in 1839. He remained in the Netherlands until 1840, working on his A Dictionary of the Anglo-Saxon Language (1838), his best-known work. Thomas Northcote Toller later compiled a new edition of the dictionary based on Bosworth's work, both printed and in manuscript, and added a supplement (2 vols. 1898–1921). The University of Aberdeen granted him a LL.D. in 1838 on the recommendation of Alexander Crombie (see above) and Thomas Orger.
In 1858 Bosworth became Rector of Water Stratford, Buckinghamshire, and Rawlinsonian Professor of Anglo-Saxon at Oxford. He gave £10,000 to the University of Cambridge in 1867 for the establishment of the professorship of Anglo-Saxon. He died on 27 May 1876 leaving behind him a mass of annotations on the Anglo-Saxon charters and was buried on 2 June 1876 in Water Stratford churchyard. Income from his estate was left to various relatives for their lifetimes but as they died it was added to the endowment of his Oxford professorship.
Legacy
Bosworth was succeeded by John Earle (1824–1903) and Arthur Sampson Napier (1853–1916).
In 1916, the chair was renamed to Rawlinson and Bosworth Professor of Anglo-Saxon in honour of Bosworth and his endowment, the first "Rawlinson and Bosworth" professor being Si |
https://en.wikipedia.org/wiki/Tarball | Tarball may refer to:
Tarball (computing), a type of archive file
Tarball (oil), a blob of semi-solid oil found on or near the ocean |
https://en.wikipedia.org/wiki/Directory%20service | In computing, a directory service or name service maps the names of network resources to their respective network addresses. It is a shared information infrastructure for locating, managing, administering and organizing everyday items and network resources, which can include volumes, folders, files, printers, users, groups, devices, telephone numbers and other objects. A directory service is a critical component of a network operating system. A directory server or name server is a server which provides such a service. Each resource on the network is considered an object by the directory server. Information about a particular resource is stored as a collection of attributes associated with that resource or object.
A directory service defines a namespace for the network. The namespace is used to assign a name (unique identifier) to each of the objects. Directories typically have a set of rules determining how network resources are named and identified, which usually includes a requirement that the identifiers be unique and unambiguous. When using a directory service, a user does not have to remember the physical address of a network resource; providing a name locates the resource. Some directory services include access control provisions, limiting the availability of directory information to authorized users.
Comparison with relational databases
Several things distinguish a directory service from a relational database. Data can be made redundant if it aids performance (e.g. by repeating values through rows in a table instead of relating them to the contents of a different table through a key, which technique is called denormalization; another technique could be the utilization of replicas for increasing actual throughput).
Directory schemas are object classes, attributes, name bindings and knowledge (namespaces) where an object class has:
Must - attributes that each instances must have
May - attributes which can be defined for an instance but can be omitted, with the absence similar to NULL in a relational database
Attributes are sometimes multi-valued, allowing multiple naming attributes at one level (such as machine type and serial number concatenation, or multiple phone numbers for "work phone"). Attributes and object classes are usually standardized throughout the industry; for example, X.500 attributes and classes are often formally registered with the IANA for their object ID. Therefore, directory applications try to reuse standard classes and attributes to maximize the benefit of existing directory-server software.
Object instances are slotted into namespaces; each object class inherits from its parent object class (and ultimately from the root of the hierarchy), adding attributes to the must-may list. Directory services are often central to the security design of an IT system and have a correspondingly-fine granularity of access control.
Replication and distribution
Replication and distribution have distinct meanings in the design |
https://en.wikipedia.org/wiki/List%20of%20Quebec%20provincial%20highways | This is a list of highways maintained by the government of Quebec.
Autoroutes
The Autoroute system in Quebec is a network of expressways which operate under the same principle of controlled access as the Interstate Highway System in the United States or the 400-Series Highways in neighbouring Ontario.
(Montreal)
(Quebec City)
Regional routes
South of the St. Lawrence River
North of the St. Lawrence River
Trans-Canada
The Trans-Canada Highway through Quebec does not have a distinct number, but rather piggybacks over the provincial highway system, mainly autoroutes, and is signed with a numberless TCH shield next to the numbered provincial highway shield. As no single provincial highway crosses the entire province between Ontario and New Brunswick, the main Trans-Canada route follows (from east to west) Autoroutes 40, 25, 20 and 85; with A-85 being interspersed with Route 185 as construction to upgrade the latter to autoroute standards progresses.
Other significantly-long roads
Route de la Baie James (James Bay Road)
Route du Nord (North Road)
Route Transtaïga (Trans-Taiga Road)
References
External links
Transports Québec
autoroutes.info: "Ancienne numérotation du Québec" |
https://en.wikipedia.org/wiki/Graphing%20calculator | A graphing calculator (also graphics calculator or graphic display calculator) is a handheld computer that is capable of plotting graphs, solving simultaneous equations, and performing other tasks with variables. Most popular graphing calculators are programmable calculators, allowing the user to create customized programs, typically for scientific, engineering or education applications. They have large screens that display several lines of text and calculations.
History
An early graphing calculator was designed in 1921 by electrical engineer Edith Clarke. The calculator was used to solve problems with electrical power line transmission.
Casio produced the first commercially available graphing calculator in 1985. Sharp produced its first graphing calculator in 1986, with Hewlett Packard following in 1988, and Texas Instruments in 1990.
Features
Computer algebra systems
Some graphing calculators have a computer algebra system (CAS), which means that they are capable of producing symbolic results. These calculators can manipulate algebraic expressions, performing operations such as factor, expand, and simplify. In addition, they can give answers in exact form without numerical approximations. Calculators that have a computer algebra system are called symbolic or CAS calculators.
Laboratory usage
Many graphing calculators can be attached to devices like electronic thermometers, pH gauges, weather instruments, decibel and light meters, accelerometers, and other sensors and therefore function as data loggers, as well as WiFi or other communication modules for monitoring, polling and interaction with the teacher. Student laboratory exercises with data from such devices enhances learning of math, especially statistics and mechanics.
Games and utilities
Since graphing calculators are typically user-programmable, they are also widely used for utilities and calculator gaming, with a sizable body of user-created game software on most popular platforms. The ability to create games and utilities has spurred the creation of calculator application sites (e.g., Cemetech) which, in some cases, may offer programs created using calculators' assembly language. Even though handheld gaming devices fall in a similar price range, graphing calculators offer superior math programming capability for math based games. However, for developers and advanced users like researchers, analysts and gamers, third party software development involving firmware modifications, whether for powerful gaming or exploiting capabilities beyond the published data sheet and programming language, is a contentious issue with manufacturers and education authorities as it might incite unfair calculator use during standardized high school and college tests where these devices are targeted.
Graphing calculators in education
North America – high school mathematics teachers allow and even encourage their students to use graphing calculators in class. In some cases (especially in calculus |
https://en.wikipedia.org/wiki/Self-healing%20ring | A self-healing ring, or SHR, is a telecommunications term for loop network topology, a common configuration in telecommunications transmission systems. Like roadway and water distribution systems, a loop or ring is used to provide redundancy. SDH, SONET and WDM systems are often configured in self-healing rings.
Description
The system consists of a ring of bidirectional links between a set of stations, typically using optical fiber communications.
In normal use, traffic is dispatched in the direction of the shortest path towards its destination.
In the event of the loss of a link, or of an entire station, the two nearest surviving stations "loop back" their ends of the ring. In this way, traffic can still travel to all surviving parts of the ring, even if it has to travel "the long way round".
A second break in the ring may divide it into two sub-rings, but in such a case each sub-ring will remain functional.
Advantages
Self-healing rings offer high levels of resilience at low cost, since it is often geographically easy to take multiple paths across the landscape and link them up into a ring with very little extra fiber length.
Recent submarine communications cables are typically built in pairs to function as a self-healing ring. Very high resilience systems are typically built on interconnected meshes of self-healing rings.
Another example of a self-healing ring network technology is the FDDI local-area network. Resilient Packet Ring is a new technology for packet-switched self-healing ring networks.
See also
Redundancy (engineering)
Telecommunications equipment |
https://en.wikipedia.org/wiki/Memory-mapped%20I/O%20and%20port-mapped%20I/O | Memory-mapped I/O (MMIO) and port-mapped I/O (PMIO) are two complementary methods of performing input/output (I/O) between the central processing unit (CPU) and peripheral devices in a computer (often mediating access via chipset). An alternative approach is using dedicated I/O processors, commonly known as channels on mainframe computers, which execute their own instructions.
Memory-mapped I/O uses the same address space to address both main memory and I/O devices. The memory and registers of the I/O devices are mapped to (associated with) address values, so a memory address may refer to either a portion of physical RAM or to memory and registers of the I/O device. Thus, the CPU instructions used to access the memory (.e.g ) can also be used for accessing devices. Each I/O device either monitors the CPU's address bus and responds to any CPU access of an address assigned to that device, connecting the system bus to the desired device's hardware register or uses a dedicated.
To accommodate the I/O devices, some areas of the address bus used by the CPU must be reserved for I/O and must not be available for normal physical memory; the range of addresses used for I/O devices is determined by the hardware. The reservation may be permanent, or temporary (as achieved via bank switching). An example of the latter is found in the Commodore 64, which uses a form of memory mapping to cause RAM or I/O hardware to appear in the 0xD000-0xDFFF range.
Port-mapped I/O often uses a special class of CPU instructions designed specifically for performing I/O, such as the in and out instructions found on microprocessors based on the x86 architecture. Different forms of these two instructions can copy one, two or four bytes (outb, outw and outl, respectively) between the EAX register or one of that register's subdivisions on the CPU and a specified I/O port address which is assigned to an I/O device. I/O devices have a separate address space from general memory, either accomplished by an extra "I/O" pin on the CPU's physical interface, or an entire bus dedicated to I/O. Because the address space for I/O is isolated from that for main memory, this is sometimes referred to as isolated I/O.
Overview
Different CPU-to-device communication methods, such as memory mapping, do not affect the direct memory access (DMA) for a device, because, by definition, DMA is a memory-to-device communication method that bypasses the CPU.
Hardware interrupts are another communication method between the CPU and peripheral devices, however, for a number of reasons, interrupts are always treated separately. An interrupt is device-initiated, as opposed to the methods mentioned above, which are CPU-initiated. It is also unidirectional, as information flows only from device to CPU. Lastly, each interrupt line carries only one bit of information with a fixed meaning, namely "an event that requires attention has occurred in a device on this interrupt line".
I/O operations can slow memory acce |
https://en.wikipedia.org/wiki/Source-code%20compatibility | Source-code compatibility (source-compatible) means that a program can run on computers (or operating systems), independently of binary-code compatibility and that the source code is needed for portability.
The source code must be compiled before running, unless the computer used has an interpreter for the language at hand. The term is also used for assembly language compatibility, where the source is a human-readable form of machine code that must be converted into numerical (i.e. executable) machine code by an assembler. This is different from binary-code compatibility, where no recompilation (or assembly) is needed.
Source compatibility is a major issue in the developing of computer programs. For example, most Unix systems are source-compatible, as long as one uses only standard libraries. Microsoft Windows systems are source-compatible across one major family (the Windows NT family, from NT 3.1 through Windows 11, or the family that includes Windows 95, Windows 98, and Windows Me), with partial source compatibility between the two families.
See also
Backward compatibility
Source upgrade
References
Backward compatibility
Source code |
https://en.wikipedia.org/wiki/LSI | LSI may refer to:
Science and technology
Large-scale integration, integrated circuits with tens of thousands of transistors
Latent semantic indexing, a technique in natural language processing
LSI-11, an early large-scale integration computer processor that implemented the DEC PDP-11 instruction set
Langelier saturation index, a measure for water's tendency to form scale
Linear shift-invariant systems, the discrete equivalent of linear time-invariant systems
Organizations
LSI Corporation, a technology company founded in 1981 as LSI Logic Corporation
Lynch Syndrome International, non-profit organisation supporting those affected by Lynch Syndrome
Labour and Socialist International, a multinational federation of left wing political parties and trade unions active between 1923 and 1940
Socialist Movement for Integration (Lëvizja Socialiste për Integrim), a political party in Albania
Lear Siegler Incorporated, a technology company active from 1961 to 2002
Lingkaran Survei Indonesia, a survey company in Indonesia
Transportation
Lake Superior and Ishpeming Railroad, a railroad service in Michigan, United States
Sumburgh Airport (IATA airport code) in Shetland, Scotland
Music
"LSI (Love Sex Intelligence)", a single by The Shamen
Long-string instrument, a musical instrument
Other uses
Landing ship, infantry, a type of troopship or post World War II a landing craft
La Salle Institute, a college preparatory school
Linguistic Survey of India, a survey of the languages of British India directed by G.A. Grierson
Logical Sensory Introvert, a socionics type |
https://en.wikipedia.org/wiki/University%20of%20South%20Australia | The University of South Australia (UniSA) is a public research university in the Australian state of South Australia. It is a founding member of the Australian Technology Network of universities, and is the largest university in South Australia with approximately 37,000 students.
The university was founded in its current form in 1991 with the merger of the South Australian Institute of Technology (SAIT, established in 1889 as the South Australian School of Mines and Industries) and the South Australian College of Advanced Education (SACAE, established 1856). The legislation to establish and name the new University of South Australia was introduced by the Hon Mike Rann MP, then Minister of Employment and Further Education. Under the University's Act, its original mission was "to preserve, extend and disseminate knowledge through teaching, research, scholarship and consultancy, and to provide educational programs that will enhance the diverse cultural life of the wider community".
UniSA is among the world's top newer universities, ranked in the World's Top 50 Under 50 (universities which are under 50 years old) by both the Quacarelli Symonds (QS) World University Ranking (#29) and Times Higher Education (THE) (#46). It has two Adelaide city centre campuses, two Adelaide metropolitan campuses, and two South Australian regional campuses.
History
UniSA was formed in 1991 by the merger of the South Australian Institute of Technology with three South Australian College of Advanced Education campuses. To the former SACAE campuses of Magill, Salisbury, and Underdale, SAIT added its three campuses at City East, The Levels (now called Mawson Lakes) and Whyalla. The two other SACAE campuses, City (adjacent to University of Adelaide), and Sturt (in Bedford Park, adjacent to Flinders University), were later merged into their nearby universities.
School of Arts
The South Australian School of Arts can trace its history back to 1856 and the work of Charles Hill and H. P. Gill, and connected to the South Australian School of Design. As such, it can claim to be one of the oldest art schools in Australia, and the oldest public art school. The school, now within UniSA's Division of Education, Arts and Social Sciences, is also known for providing a visual arts scholarship, the Ann & Gordon Samstag Scholarship.
SACAE
The South Australian College of Advanced Education (SACAE) was formed in 1982 with the merger of five Colleges of Advanced Education (CAE). Adelaide, Hartley, Salisbury, Sturt, and Torrens CAEs became the Adelaide, Magill, Salisbury, Sturt, and Underdale campuses of the SACAE.
The CAE themselves were formed from various teachers' colleges in 1973.
Adelaide CAE developed from Adelaide Teachers' College (est. 1921), which had its roots in a training school established in 1876.
Murray Park CAE originated from Wattle Park Teachers College, which branched off from Adelaide Teachers College in 1957.
Torrens CAE had its origins in the South Australian Scho |
https://en.wikipedia.org/wiki/Open%20Society%20Foundations | Open Society Foundations (OSF), formerly the Open Society Institute, is a grantmaking network founded by business magnate George Soros. Open Society Foundations financially supports civil society groups around the world, with the stated aim of advancing justice, education, public health and independent media. The group's name was inspired by Karl Popper's 1945 book The Open Society and Its Enemies.
As of 2015, the OSF had branches in 37 countries, encompassing a group of country and regional foundations, such as the Open Society Initiative for West Africa, and the Open Society Initiative for Southern Africa; its headquarters are at 224 West 57th Street in New York City. In 2018, OSF announced it was closing its European office in Budapest and moving to Berlin, in response to legislation passed by the Hungarian government targeting the foundation's activities. As of 2021, OSF has reported expenditures in excess of $16 billion since its establishment in 1993, mostly in grants towards NGOs, aligned with the organization's mission.
History
On May 28, 1984, business magnate George Soros signed a contract between the Soros Foundation (New York City) and the Hungarian Academy of Sciences, the founding document of the Soros Foundation Budapest. This was followed by several foundations in the region to help countries move away from Real socialism in the Eastern Bloc.
In 1991, the foundation merged with the ("Foundation for European Intellectual Mutual Aid"), an affiliate of the Congress for Cultural Freedom, created in 1966 to imbue 'non-conformist' Eastern European scientists with anti-totalitarian and capitalist ideas.
In 1993, the Open Society Institute was created in the United States to support the Soros foundations in Central and Eastern Europe and Russia.
In August 2010, it started using the name Open Society Foundations (OSF) to better reflect its role as a benefactor for civil society groups in countries around the world.
In 1995, Soros stated that he believed there can be no absolute answers to political questions because the same principle of reflexivity applies as in financial markets.
In 2012, Christopher Stone joined the OSF as the second president. He replaced Aryeh Neier, who served as president from 1993 to 2012. Stone announced in September 2017 that he was stepping down as president. In January 2018, Patrick Gaspard was appointed president of the Open Society Foundations. He announced in December 2020 that he was stepping down as president. In January 2021, Mark Malloch-Brown was appointed president of the Open Society Foundations.
In 2016, the OSF was reportedly the target of a cyber security breach. Documents and information reportedly belonging to the OSF were published by a website. The cyber security breach has been described as sharing similarities with Russian-linked cyberattacks that targeted other institutions, such as the Democratic National Committee.
In 2017, Soros transferred $18 billion to the Foundation.
In 202 |
https://en.wikipedia.org/wiki/AZERTY | AZERTY ( ) is a specific layout for the characters of the Latin alphabet on typewriter keys and computer keyboards. The layout takes its name from the first six letters to appear on the first row of alphabetical keys; that is, ( ). Similar to the QWERTZ layout, it is modelled on the English QWERTY layout. It is used in France and Belgium, although each of these countries has its own national variation on the layout. Luxembourg and Switzerland use the Swiss QWERTZ keyboard. Most of the residents of Quebec, the mainly French-speaking province of Canada, use a QWERTY keyboard that has been adapted to the French language such as the Multilingual Standard keyboard CAN/CSA Z243.200-92 which is stipulated by the government of Quebec and the Government of Canada.
The competing layouts devised for French (e.g., the ZHJAY layout put forward in 1907, Claude Marsan's 1976 layout, the 2002 Dvorak-fr, and the 2005 BÉPO layout) have obtained only limited recognition, although the latter has been included in the 2019 French keyboard layout standard.
History
The AZERTY layout appeared in France in the last decade of the 19th century as a variation on American QWERTY typewriters. Its exact origin is unknown. At the start of the 20th century, the French ZHJAY layout, created by Albert Navarre, failed to break into the market partly because secretaries were already accustomed to the AZERTY layout and partly because it differed more from the QWERTY layout than the AZERTY layout did.
In France, the AZERTY layout is the de facto norm for keyboards. In 1976, a QWERTY layout adapted to the French language was put forward, as an experimental standard (NF XP E55-060) by AFNOR. This standard made provision for a temporary adaptation period during which the letters A, Q, Z and W could be positioned as in the traditional AZERTY layout.
In January 2016, the French Culture Ministry has looked to replace the industrial AZERTY layouts with one that will allow a better typing of French and other languages. A standard was published by the French national organization for standardization in 2019.
The AZERTY layout is used on Belgian keyboards, although some non-alphabetic symbols are positioned differently.
General information regarding AZERTY keyboards
There are two key details:
the Alt Gr key allows the user to type the character shown at the bottom right of any key with three characters.
the Alt key is used as a shortcut to commands affecting windows, and is also used in conjunction with ASCII codes for typing special characters.
Dead keys
A dead key serves to modify the appearance of the next character to be typed on the keyboard. Dead keys are mainly used to generate accents (or diacritics) on vowels.
Circumflex accent
A circumflex accent can be generated by first striking the key (located to the right of in most AZERTY layouts), then the vowel requiring the accent (with the exception of y). For example, pressing then produces â.
Diaeresis
A diaresis |
https://en.wikipedia.org/wiki/Audacity%20%28audio%20editor%29 | Audacity is a free and open-source digital audio editor and recording application software, available for Windows, macOS, Linux, and other Unix-like operating systems.
As of December 6, 2022, Audacity is the most popular download at FossHub, with over 114.2 million downloads since March 2015. It was previously served from Google Code and SourceForge, where it was downloaded over 200 million times.
It is licensed under GPL-2.0-or-later. Executables with VST3 support are licensed GPL-3-only to maintain license compatibility.
History
The project was started in the fall of 1999 by Dominic Mazzoni and Roger Dannenberg at Carnegie Mellon University, initially under the name CMU Visual Audio. On May 28, 2000, Audacity was released as Audacity 0.8 to the public.
Mazzoni eventually left CMU to pursue software development and in particular development of Audacity, with Dannenberg remaining at CMU and continuing development of Nyquist, a scripting language which Audacity uses for some effects.
Over the years, additional volunteer contributors emerged, including James Crook who started the fork DarkAudacity to experiment with a new look and other UX changes. Most of its changes were eventually incorporated into the mainline version and the fork ended.
In April 2021, it was announced that Muse Group (owners of MuseScore and Ultimate Guitar) would acquire the Audacity trademark and continue to develop the application, which remains free and open source.
Features and use
In addition to recording audio from multiple sources, Audacity can be used for post-processing of all types of audio, including effects such as normalization, trimming, and fading in and out. It has been used to record and mix entire albums, such as by Tune-Yards. It is currently used in the Sound Creation unit of the UK OCR National Level 2 ICT course.
Recording
Audacity can record multiple tracks at once, provided the sound card supports it. In addition to a normal mode, recordings can be scheduled ("Timer Record"), or used in a Punch in and roll fashion.
Non-destructive editing
Historically, Audacity is a destructive editor, meaning all changes are directly applied to the waveform. This comes with certain benefits but means that any change made cannot be tweaked later on without undoing all changes in-between. For a long time, non-destructive editing was exclusive to volume envelopes and playback rates, but since version 3, this has been extended to clip trimming and effects.
Importing, exporting and conversions
Audacity natively imports and exports WAV, AIFF, MP3, Ogg Vorbis, and all file formats supported by libsndfile library. Due to patent licensing concerns, the FFmpeg library necessary to import and export proprietary formats such as M4A (AAC) and WMA is not bundled with Audacity but has to be downloaded separately.
In conjunction with batch processing features, Audacity can be used to convert files from one format to another, or to digitize records, tapes or MiniDisc |
https://en.wikipedia.org/wiki/Wait%20state | A wait state is a delay experienced by a computer processor when accessing external memory or another device that is slow to respond.
Computer microprocessors generally run much faster than the computer's other subsystems, which hold the data the CPU reads and writes. Even memory, the fastest of these, cannot supply data as fast as the CPU could process it. In an example from 2011, typical PC processors like the Intel Core 2 and the AMD Athlon 64 X2 run with a clock of several GHz, which means that one clock cycle is less than 1 nanosecond (typically about 0.3 ns to 0.5 ns on modern desktop CPUs), while main memory has a latency of about 15–30 ns. Some second-level CPU caches run slower than the processor core.
When the processor needs to access external memory, it starts placing the address of the requested information on the address bus. It then must wait for the answer, that may come back tens if not hundreds of cycles later. Each of the cycles spent waiting is called a wait state.
Wait states are a pure waste of a processor's performance. Modern designs try to eliminate or hide them using a variety of techniques: CPU caches, instruction pipelines, instruction prefetch, branch prediction, simultaneous multithreading and others. No single technique is 100% successful, but together can significantly reduce the problem.
Energy conservation
Wait states can be used to reduce the energy consumption of a processor, by allowing the main processor clock to either slow down or temporarily pause during the wait state if the CPU has no other work to do. Rather than spinning uselessly in a tight loop waiting for data, sporadically reducing the clock speed in this manner helps to keep the processor core cool and to extend battery life in portable computing devices.
Alternative meaning on IBM mainframes
On IBM mainframes, the term wait state is used with a different meaning. A wait state refers to a CPU being halted, possibly due to some kind of serious error condition (such as an unrecoverable error during operating system to IPL). A wait state is indicated by bit 14 of the PSW being set to 1, with other bits of the PSW providing a wait state code giving a reason for the wait. In z/Architecture mode, the wait state code is found in bits 116-127.
See also
Bubble (computing)
Consistency model
Cache miss
Page fault
Multithreading (computer architecture)
References
Central processing unit
IBM mainframe technology |
https://en.wikipedia.org/wiki/Adaptive%20Communication%20Environment | The Adaptive Communication Environment (ACE) is an open source software framework used for network programming. It provides a set of object-oriented C++ classes designed to help address the inherent complexities and challenges in network programming by preventing common errors.
History
ACE was initially developed by Douglas C. Schmidt during his graduate work at the University of California, Irvine. Development followed him to the Washington University in St. Louis, where he was employed. ACE is open-source software released by WU's Distributed Object Computer (DOC) group. Its development continued in the Institute for Software Integrated Systems (ISIS) at Vanderbilt University.
Features
ACE provides a standardized usage for operating system/machine specific features. It provides common data types and methods to access the powerful but complex features of modern operating systems. These include: inter-process communication, thread management, efficient memory management, etc.
It was designed to be portable and provide a common framework. The same code will work on most Unixes, Windows, VxWorks, QNX, OpenVMS, etc., with minimal changes. Due to this cross-platform support, it has been widely used in the development of communication software. Some of the successful projects that have used ACE includes: Motorola Iridium satellites, Boeing Wedgetail's Australian airborne early warning & control (AEW&C) system, and others.
ACE used software design patterns.
See also
Communication software
Component-integrated ACE ORB (CIAO, a CORBA implementation)
Cross-platform support middleware
TAO (software)
References
External links
Distributed object computer (DOC) Group website
Institute for Software Integrated Systems (ISIS) website
ACE Doxygen reference
ACE github code repository
Application programming interfaces
C++ libraries
Cross-platform software |
https://en.wikipedia.org/wiki/Software%20bloat | Software bloat is a process whereby successive versions of a computer program become perceptibly slower, use more memory, disk space or processing power, or have higher hardware requirements than the previous version, while making only dubious user-perceptible improvements or suffering from feature creep. The term is not applied consistently; it is often used as a pejorative by end users (bloatware) to describe undesired user interface changes even if those changes had little or no effect on the hardware requirements. In long-lived software, perceived bloat can occur from the software servicing a large, diverse marketplace with many differing requirements. Most end users will feel they only need some limited subset of the available functions, and will regard the others as unnecessary bloat, even if end users with different requirements require those functions.
Actual (measurable) bloat can occur due to de-emphasising algorithmic efficiency in favour of other concerns like developer productivity, or possibly through the introduction of new layers of abstraction like a virtual machine or other scripting engine for the purposes of convenience when developer constraints are reduced. The perception of improved developer productivity, in the case of practising development within virtual machine environments, comes from the developers no longer taking resource constraints and usage into consideration during design and development; this allows the product to be completed faster but it results in increases to the end user's hardware requirements to compensate.
The term "bloatware" is also used to describe unwanted pre-installed software or bundled programs.
Types of bloat
Program bloat
In computer programming, code bloat refers to the presence of program code (source code or machine code) that is perceived as unnecessarily long, slow, or otherwise wasteful of resources.
Causes
Software inefficiency
Software developers involved in the industry during the 1970s had severe limitations on disk space and memory. Every byte and clock cycle was taken into account, and much work went into fitting the programs into available resources. Achieving this efficiency was one of the highest values of computer programmers, and the best programs were often called "elegant", a term used by mathematicians to describe a proof which is tidy, parsimonious and powerful.
By the 21st century, the situation had reversed. Resources were perceived as cheap, and rapidity of coding and headline features for marketing seen as priorities. In part, this is because technological advances have since increased processing capacity and storage density by orders of magnitude, while reducing the relative costs by similar orders of magnitude (see Moore's law). Additionally, the spread of computers through all levels of business and home life has produced a software industry many times larger than it was in the 1970s. Programs are now usually churned out by teams, directed by committees |
https://en.wikipedia.org/wiki/The%20Disney%20Afternoon | The Disney Afternoon (later known internally as the Disney-Kellogg Alliance when unbranded), sometimes abbreviated as TDA, was a created-for-syndication two-hour programming block of animated television series. It was produced by Walt Disney Television Animation and distributed through its syndication affiliate Buena Vista Television. Each show from the block has aired reruns on Disney Channel and Toon Disney. Disney Channel reaired four shows (Darkwing Duck, TaleSpin, DuckTales, and Chip 'n Dale: Rescue Rangers) on "Block Party," a two-hour block that aired on weekdays in the late afternoon/early evening.
The Disney Afternoon's block had four half-hour segments, each of which contained an animated series. As each season ended, the lineup would shift - the remaining three would move up a time slot and a new show would be added to the end. The Disney Afternoon itself featured unique animated segments consisting of its opening and "wrappers" around the cartoon shows.
The Disney Afternoon originally ran from September 10, 1990, to August 29, 1997. For the 1997 and 1998 television seasons, it lost its name but was known internally as Disney-Kellogg Alliance, shortened to 90 minutes, followed by its gradual replacement by Disney's One Too for UPN in 1999. Some of the shows also aired on Saturday mornings on ABC and CBS concurrently with their original syndicated runs on The Disney Afternoon.
Goof Troop is the only show to reach the 2000s, with the 2000 direct-to-video finale An Extremely Goofy Movie. The 2010s and 2020s saw revivals of some shows such as DuckTales as a reboot and Darkwing Duck as a show within the reboot on Disney Channel (and Disney XD), a reboot on Disney+ and Chip 'n Dale: Rescue Rangers with a live-action animation hybrid film on Disney+, released in 2022. Recently a reboot for TaleSpin and a live-action series for Gargoyles where reported to be in development for Disney+.
Background
The Disney Afternoon goes back to Michael Eisner becoming Disney's CEO in 1984 and his push into steady animated television production, which would be based on new characters to bring in new young fans, with a newly launched TV animation department. He set up a Sunday meeting at his house days consisting of creatives. They included Tad Stones from feature animation and Jymn Magon and Gary Kriesel from the music division. Mickey and the Space Pirates was pitched by Stones, but was turned down being that Mickey Mouse is the company symbol, thus wanting to do him right. Stones also pitched a Rescuers TV series – the sequel was already under development at the time. Eisner suggested the Gummy bear as a series, given his kids liked the candy. Disney Television Animation's first two shows, The Wuzzles and Adventures of the Gummi Bears, were sold to two networks, CBS and NBC, respectively, for their Saturday morning cartoon blocks.
History
The Disney Afternoon
DuckTales, the series which would serve as the launching pad for what would become The Disne |
https://en.wikipedia.org/wiki/Skip%20list | In computer science, a skip list (or skiplist) is a probabilistic data structure that allows average complexity for search as well as average complexity for insertion within an ordered sequence of elements. Thus it can get the best features of a sorted array (for searching) while maintaining a linked list-like structure that allows insertion, which is not possible with a static array. Fast search is made possible by maintaining a linked hierarchy of subsequences, with each successive subsequence skipping over fewer elements than the previous one (see the picture below on the right). Searching starts in the sparsest subsequence until two consecutive elements have been found, one smaller and one larger than or equal to the element searched for. Via the linked hierarchy, these two elements link to elements of the next sparsest subsequence, where searching is continued until finally searching in the full sequence. The elements that are skipped over may be chosen probabilistically or deterministically, with the former being more common.
Description
A skip list is built in layers. The bottom layer is an ordinary ordered linked list. Each higher layer acts as an "express lane" for the lists below, where an element in layer appears in layer with some fixed probability (two commonly used values for are or ). On average, each element appears in lists, and the tallest element (usually a special head element at the front of the skip list) appears in all the lists. The skip list contains (i.e. logarithm base of ) lists.
A search for a target element begins at the head element in the top list, and proceeds horizontally until the current element is greater than or equal to the target. If the current element is equal to the target, it has been found. If the current element is greater than the target, or the search reaches the end of the linked list, the procedure is repeated after returning to the previous element and dropping down vertically to the next lower list. The expected number of steps in each linked list is at most , which can be seen by tracing the search path backwards from the target until reaching an element that appears in the next higher list or reaching the beginning of the current list. Therefore, the total expected cost of a search is which is , when is a constant. By choosing different values of , it is possible to trade search costs against storage costs.
Implementation details
The elements used for a skip list can contain more than one pointer since they can participate in more than one list.
Insertions and deletions are implemented much like the corresponding linked-list operations, except that "tall" elements must be inserted into or deleted from more than one linked list.
operations, which force us to visit every node in ascending order (such as printing the entire list), provide the opportunity to perform a behind-the-scenes derandomization of the level structure of the skip-list in an optimal way, bringing |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20California | The following is a list of FCC-licensed radio stations in the U.S. state of California, which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
Defunct
KAJI-LP
KBPK
KCOD
KDBV
KDHS-FM
KDN
KDND
KESQ
KFI-FM
KFRJ
KFXM-LP
KGB (San Francisco)
KHBG-LP
KJJ
KJQ
KKHP-LP
KLSN-LP
KLYD
KMSJ-LP
KNCR
KOAD-LP
KPRO
KQPT-LP
KQQH
KSBX
KSFH
KSKD
KSUR
KTHO
KUMI
KVEN
KVQ
KVVC
KWTM
KYJ
KYY
KZKC
KZM
KZPE
KZPO
KZQT
KZY
References
California
Radio stations |
https://en.wikipedia.org/wiki/SFAI | SFAI may refer to:
San Francisco Art Institute
Società per le strade ferrate dell'Alta Italia, Upper Italian Railways
Santa Fe Associates International (SFAI), a professional services network |
https://en.wikipedia.org/wiki/Visible%20Human%20Project | The Visible Human Project is an effort to create a detailed data set of cross-sectional photographs of the human body, in order to facilitate anatomy visualization applications. It is used as a tool for the progression of medical findings, in which these findings link anatomy to its audiences. A male and a female cadaver were cut into thin slices, which were then photographed and digitized. The project is run by the U.S. National Library of Medicine (NLM) under the direction of Michael J. Ackerman. Planning began in 1986; the data set of the male was completed in November 1994 and the one of the female in November 1995. The project can be viewed today at the NLM in Bethesda, Maryland. There are currently efforts to repeat this project with higher resolution images but only with parts of the body instead of a cadaver.
Data
The male cadaver was encased and frozen in a gelatin and water mixture in order to stabilize the specimen for cutting. The specimen was then "cut" in the axial plane at 1-millimeter intervals. Each of the resulting 1,871 "slices" was photographed in both analog and digital, yielding 15 gigabytes of data. In 2000, the photos were rescanned at a higher resolution, yielding more than 65 gigabytes. The female cadaver was cut into slices at 0.33-millimeter intervals, resulting in some 40 gigabytes of data.
The term "cut" is a bit of a misnomer, yet it is used to describe the process of grinding away the top surface of a specimen at regular intervals. The term "slice", also a misnomer, refers to the revealed surface of the specimen to be photographed; the process of grinding the surface away is entirely destructive to the specimen and leaves no usable or preservable "slice" of the cadaver.
The data are supplemented by axial sections of the whole body obtained by computed tomography, axial sections of the head and neck obtained by magnetic resonance imaging (MRI), and coronal sections of the rest of the body also obtained by MRI.
The scanning, slicing, and photographing took place at the University of Colorado Anschutz Medical Campus, where additional cutting of anatomical specimens continues to take place.
Donors
The male cadaver is from Joseph Paul Jernigan, a 39-year-old Texas murderer who was executed by lethal injection on August 5, 1993. At the prompting of a prison chaplain he had agreed to donate his body for scientific research or medical use, without knowing about the Visible Human Project. Some people have voiced ethical concerns over this. One of the most notable statements came from the University of Vienna, which demanded that the images be withdrawn with reference to the point that the medical profession should have no association with executions, and that the donor's informed consent could be scrutinized.
The 59-year-old female donor remains anonymous. In the press she has been described as a Maryland housewife who died from a heart attack and whose husband requested that she be part of the project.
In 20 |
https://en.wikipedia.org/wiki/Candidate%20key | A candidate key, or simply a key, of a relational database is a minimal superkey. In other words, it is any set of columns that have a unique combination of values in each row (which makes it a superkey), with the additional constraint that removing any column could produce duplicate combinations of values (which makes it a minimal superkey). Because a candidate key is a superkey that doesn't contain a smaller one, a relation can have multiple candidate keys, each with a different number of attributes.
Specific candidate keys are sometimes called primary keys, secondary keys or alternate keys.
The columns in a candidate key are called prime attributes, and a column that does not occur in any candidate key is called a non-prime attribute.
Every relation without NULL values will have at least one candidate key: Since there cannot be duplicate rows, the set of all columns is a superkey, and if that isn't minimal, some subset of that will be minimal.
There is a functional dependency from the candidate key to all the attributes in the relation.
The superkeys of a relation are all the possible ways we can identify a row. The candidate keys are the minimal subsets of each superkey and as such, they are an important concept for the design of database schema.
Example
The definition of candidate keys can be illustrated with the following (abstract) example. Consider a relation variable (relvar) R with attributes (A, B, C, D) that has only the following two legal values r1 and r2:
Here r2 differs from r1 only in the A and D values of the last tuple.
For r1 the following sets have the uniqueness property, i.e., there are no two distinct tuples in the instance with the same attribute values in the set:
{A,B}, {A,C}, {B,C}, {A,B,C}, {A,B,D}, {A,C,D}, {B,C,D}, {A,B,C,D}
For r2 the uniqueness property holds for the following sets;
{B,C}, {B,D}, {C,D}, {A,B,C}, {A,B,D}, {A,C,D}, {B,C,D}, {A,B,C,D}
Since superkeys of a relvar are those sets of attributes that have the uniqueness property for all legal values of that relvar and because we assume that r1 and r2 are all the legal values that R can take, we can determine the set of superkeys of R by taking the intersection of the two lists:
{B,C}, {A,B,C}, {A,B,D}, {A,C,D}, {B,C,D}, {A,B,C,D}
Finally we need to select those sets for which there is no proper subset in the list, which are in this case:
{B,C}, {A,B,D}, {A,C,D}
These are indeed the candidate keys of relvar R.
We have to consider all the relations that might be assigned to a relvar to determine whether a certain set of attributes is a candidate key. For example, if we had considered only r1 then we would have concluded that {A,B} is a candidate key, which is incorrect. However, we might be able to conclude from such a relation that a certain set is not a candidate key, because that set does not have the uniqueness property (example {A,D} for r1). Note that the existence of a proper subset of a set that has the uniqueness property cannot in ge |
https://en.wikipedia.org/wiki/DBD | DBD may refer to:
Technology
Database description, a type of OSPF packet
Deep borehole disposal, a technique to dispose of nuclear waste
Defective by Design, an anti-DRM initiative
Dielectric barrier discharge, a type of electrical discharge
DNA-binding domain, a protein motif
DataBase Driver, a plug-in module for Perl DBI
dB(D), D-weighted decibel, a decibel weighting value
Donation after brain death, of beating heart cadaver organ donation
Other uses
Day by Day Christian Ministries
Death Before Dishonor (band), an American hardcore punk band
Dead by Daylight, an asymmetric survival horror video game
Death by Degrees, an action-adventure video game
Democratic Farmers' Party of Germany or Demokratische Bauernpartei Deutschlands
See also |
https://en.wikipedia.org/wiki/Lifemapper | Lifemapper is building a species diversity map of the world. It is similar to the SETI@Home client, in that it uses a volunteer computing client running primarily on home user's computers to correlate georeferenced biological samples with environmental models of the Earth. It is an experimental GIS, or Geographic Information System, that uses a special genetic algorithm to see if predicted rules about where a species lives match up with the species' observed natural settings. It is hoped that this technique will be able to both represent a current "map" of all organisms habitats on Earth as well as predict where organisms may possibly thrive or face extinction due to climate change and other ecological transformations.
See also
List of volunteer computing projects
Environmental niche modelling
External links
Lifemapper website
Volunteer computing projects |
https://en.wikipedia.org/wiki/Distributed.net | Distributed.net is a volunteer computing effort that is attempting to solve large scale problems using otherwise idle CPU or GPU time. It is governed by Distributed Computing Technologies, Incorporated (DCTI), a non-profit organization under U.S. tax code 501(c)(3).
Distributed.net is working on RC5-72 (breaking RC5 with a 72-bit key). The RC5-72 project is on pace to exhaust the keyspace in just over 44 years as of September 2023, although the project will end whenever the required key is found. RC5 has eight unsolved challenges from RSA Security, although in May 2007, RSA Security announced that they would no longer be providing prize money for a correct key to any of their secret key challenges. distributed.net has decided to sponsor the original prize offer for finding the key as a result.
In 2001, distributed.net was estimated to have a throughput of over 30 TFLOPS. , the throughput was estimated to be the same as a Cray XC40, as used in the Lonestar 5 supercomputer, or around 1.25 petaFLOPs.
History
A coordinated effort was started in February 1997 by Earle Ady and Christopher G. Stach II of Hotjobs.com and New Media Labs, as an effort to break the RC5-56 portion of the RSA Secret-Key Challenge, a 56-bit encryption algorithm that had a $10,000 USD prize available to anyone who could find the key. Unfortunately, this initial effort had to be suspended as the result of SYN flood attacks by participants upon the server.
A new independent effort, named distributed.net, was coordinated by Jeffrey A. Lawson, Adam L. Beberg, and David C. McNett along with several others who would serve on the board and operate infrastructure. By late March 1997 new proxies were released to resume RC5-56 and work began on enhanced clients. A cow head was selected as the icon of the application and the project's mascot.
The RC5-56 challenge was solved on October 19, 1997 after 250 days. The correct key was "0x532B744CC20999" and the plaintext message read "The unknown message is: It's time to move to a longer key length".
The RC5-64 challenge was solved on July 14, 2002 after 1,757 days. The correct key was "0x63DE7DC154F4D039" and the plaintext message read "The unknown message is: Some things are better left unread".
The search for Optimal Golomb Rulers (OGRs) of order 24, 25, 26, 27 and 28 were completed by distributed.net on 13 October 2004, 25 October 2008, 24 February 2009, 19 February 2014, and 23 November 2022 respectively.
Client
"DNETC" is the file name of the software application which users run to participate in any active distributed.net project. It is a command line program with an interface to configure it, available for a wide variety of platforms. distributed.net refers to the software application simply as the "client". , volunteers running 32-bit Windows with AMD FireStream enabled GPUs have contributed the most processing power to the RC5-72 project and volunteers running 64-bit Linux have contributed the most processing power to the OG |
https://en.wikipedia.org/wiki/SIGCOMM | SIGCOMM is the Association for Computing Machinery's Special Interest Group on Data Communications, which specializes in the field of communication and computer networks. It is also the name of an annual 'flagship' conference, organized by SIGCOMM, which is considered to be the leading conference in data communications and networking in the world. Known to have an extremely low acceptance rate (~10%), many of the landmark works in Networking and Communications have been published through it.
Of late, a number of workshops related to networking are also co-located with the SIGCOMM conference. These include Workshop on Challenged Networks (CHANTS), Internet Network Management (INM), Large Scale Attack Defense (LSAD) and Mining Network Data (MineNet).
SIGCOMM also produces a quarterly magazine, Computer Communication Review, with both peer-reviewed and editorial (non-peer reviewed) content, and a bi-monthly refereed journal IEEE/ACM Transactions on Networking, co-sponsored with IEEE.
SIGCOMM hands out the following awards on an annual basis
The SIGCOMM Award, for outstanding lifetime technical achievement in the fields of data and computer communications
The Rising Star Award, for a young research under the age of 35 who has made outstanding contributions during this early part of their career.
The Test of Time Award recognizes papers published 10 to 12 years in the past in a SIGCOMM sponsored or co-sponsored venue whose contents still represent a vibrant, useful contribution.
Best Paper Award and the Best Student Paper Award at that year's conference.
The SIGCOMM Doctoral Dissertation Award recognizes excellent thesis research by doctoral candidates in the field of computer networking and data communication.
The SIGCOMM Networking Systems Award recognizes the development of a networking system that has had a significant impact on the world of computer networking.
References
Association for Computing Machinery Special Interest Groups |
https://en.wikipedia.org/wiki/Neuroanatomy | Neuroanatomy is the study of the structure and organization of the nervous system. In contrast to animals with radial symmetry, whose nervous system consists of a distributed network of cells, animals with bilateral symmetry have segregated, defined nervous systems. Their neuroanatomy is therefore better understood. In vertebrates, the nervous system is segregated into the internal structure of the brain and spinal cord (together called the central nervous system, or CNS) and the series of nerves that connect the CNS to the rest of the body (known as the peripheral nervous system, or PNS). Breaking down and identifying specific parts of the nervous system has been crucial for figuring out how it operates. For example, much of what neuroscientists have learned comes from observing how damage or "lesions" to specific brain areas affects behavior or other neural functions.
For information about the composition of non-human animal nervous systems, see nervous system. For information about the typical structure of the Homo sapiens nervous system, see human brain or peripheral nervous system. This article discusses information pertinent to the study of neuroanatomy.
History
The first known written record of a study of the anatomy of the human brain is an ancient Egyptian document, the Edwin Smith Papyrus. In Ancient Greece, interest in the brain began with the work of Alcmaeon, who appeared to have dissected the eye and related the brain to vision. He also suggested that the brain, not the heart, was the organ that ruled the body (what Stoics would call the hegemonikon) and that the senses were dependent on the brain.
The debate regarding the hegemonikon persisted among ancient Greek philosophers and physicians for a very long time. Those who argued for the brain often contributed to the understanding of neuroanatomy as well. Herophilus and Erasistratus of Alexandria were perhaps the most influential with their studies involving dissecting human brains, affirming the distinction between the cerebrum and the cerebellum, and identifying the ventricles and the dura mater. The Greek physician and philosopher Galen, likewise, argued strongly for the brain as the organ responsible for sensation and voluntary motion, as evidenced by his research on the neuroanatomy of oxen, Barbary apes, and other animals.
The cultural taboo on human dissection continued for several hundred years afterward, which brought no major progress in the understanding of the anatomy of the brain or of the nervous system. However, Pope Sixtus IV effectively revitalized the study of neuroanatomy by altering the papal policy and allowing human dissection. This resulted in a flush of new activity by artists and scientists of the Renaissance, such as Mondino de Luzzi, Berengario da Carpi, and Jacques Dubois, and culminating in the work of Andreas Vesalius.
In 1664, Thomas Willis, a physician and professor at Oxford University, coined the term neurology when he published his text Cer |
https://en.wikipedia.org/wiki/PCC | PCC may refer to:
Science and technology
Pearson correlation coefficient (r), in statistics
Periodic counter-current chromatography, a type of affinity chromatography
Portable C Compiler, an early compiler for the C programming language
Precipitated calcium carbonate, a chemical compound
Proof-carrying code, a software mechanism that allows a host system to verify properties
Pyridinium chlorochromate, a yellow-orange salt
Pyrolytic chromium carbide coating, by vacuum deposition
Medicine
Pericardiocentesis, a procedure where fluid is aspirated from the pericardium
Pheochromocytoma, a neuroendocrine tumor
Posterior cingulate cortex, an anatomical brain region
Prothrombin complex concentrate, a medication
Propionyl-CoA carboxylase, catalyses the carboxylation reaction of propionyl CoA in the mitochondrial matrix
1-piperidinocyclohexanecarbonitrile, a precursor schedule II drug in the US
Organizations
C. Paul Phelps Correctional Center
Clef Club of Jazz and Performing Arts
Pacific Coast Conference, a defunct US college athletic conference
Pacific Coffee Company
Pacific Conference of Churches, the regional ecumenical organization in the Pacific region
Pakistan Christian Congress
Palmarian Catholic Church
Panama Canal Commission
PCC Community Markets, a food cooperative based in Seattle, Washington, US
PCC SE, a German company
Pentecost Convention Centre
People's Computer Company
Peoria Charter Coach Company, a bus company in Illinois, US
Plains Conservation Center
Plainfield Curling Club
Polynesian Cultural Center
Power Computing Corporation
Power Corporation of Canada
Pradesh Congress Committee, in India
Precision Castparts Corp. in Portland, Oregon, US
Presbyterian Church in Canada
Press Complaints Commission, a voluntary regulatory body for British printed newspapers and magazines
Primeiro Comando da Capital, a Brazilian prison gang-terrorist group
Printed Circuit Corporation, US
Education
Pabna Cadet College
Palmer College of Chiropractic
Pasadena City College
Penola Catholic College
Pensacola Christian College
Piedmont Community College
Pima Community College
Pitt Community College
Pobalscoil Chloich Cheannfhaola
Polk Community College, former name of Polk State College
Portland Community College
Presentation College, Chaguanas
Pueblo Community College
Punjab College of Commerce
Government and politics
Palestinian Central Council
Palestinian Conciliation Commission
Parochial church council in the Church of England
Patents County Court, former name of the Intellectual Property Enterprise Court in the United Kingdom
Philippine Competition Commission, independent quasi-judicial body of the Philippine government in charge of implementing the Philippine Competition Act
Poison control center
Police and crime commissioner, in England and Wales
Porirua City Council, New Zealand
Perth City Council, Australia
Partido Comunista Colombiano, the Colombian Communist Party
Partido Comunista d |
https://en.wikipedia.org/wiki/Object%20file | An object file is a computer file containing object code, that is, machine code output of an assembler or compiler. The object code is usually relocatable, and not usually directly executable. There are various formats for object files, and the same machine code can be packaged in different object file formats. An object file may also work like a shared library.
In addition to the object code itself, object files may contain metadata used for linking or debugging, including: information to resolve symbolic cross-references between different modules, relocation information, stack unwinding information, comments, program symbols, debugging or profiling information. Other metadata may include the date and time of compilation, the compiler name and version, and other identifying information.
The term "object program" dates from at least the 1950s:
A computer programmer generates object code with a compiler or assembler. For example, under Linux, the GNU Compiler Collection compiler will generate files with a .o extension which use the ELF format. Compilation on Windows generates files with a .obj extension which use the COFF format. A linker is then used to combine the object code into one executable program or library pulling in precompiled system libraries as needed.
Object file formats
There are many different object file formats; originally each type of computer had its own unique format, but with the advent of Unix and other portable operating systems, some formats, such as ELF and COFF, have been defined and used on different kinds of systems. It is possible for the same format to be used both as linker input and output, and thus as the library and executable file format. Some formats can contain machine code for different processors, with the correct one chosen by the operating system when the program is loaded.
Some systems make a distinction between formats which are directly executable and formats which require processing by the linker. For example, OS/360 and successors call the first format a load module and the second an object module. In this case the files have entirely different formats.
The design and/or choice of an object file format is a key part of overall system design. It affects the performance of the linker and thus programmer turnaround while a program is being developed. If the format is used for executables, the design also affects the time programs take to begin running, and thus the responsiveness for users.
Absolute files
Many early computers, or small microcomputers, support only an absolute object format. Programs are not relocatable; they need to be assembled or compiled to execute at specific, predefined addresses. The file contains no relocation or linkage information. These files can be loaded into read/write memory, or stored in read-only memory. For example, the Motorola 6800 MIKBUG monitor contains a routine to read an absolute object file (SREC Format) from paper tape. DOS COM files are a more recent |
https://en.wikipedia.org/wiki/Safety%20data%20sheet | A safety data sheet (SDS), material safety data sheet (MSDS), or product safety data sheet (PSDS) is a document that lists information relating to occupational safety and health for the use of various substances and products. SDSs are a widely used system for cataloguing information on chemicals, chemical compounds, and chemical mixtures. SDS information may include instructions for the safe use and potential hazards associated with a particular material or product, along with spill-handling procedures. The older MSDS formats could vary from source to source within a country depending on national requirements; however, the newer SDS format is internationally standardized.
An SDS for a substance is not primarily intended for use by the general consumer, focusing instead on the hazards of working with the material in an occupational setting. There is also a duty to properly label substances on the basis of physico-chemical, health, or environmental risk. Labels can include hazard symbols such as the European Union standard symbols. The same product (e.g. paints sold under identical brand names by the same company) can have different formulations in different countries. The formulation and hazards of a product using a generic name may vary between manufacturers in the same country.
Globally Harmonized System
The Globally Harmonized System of Classification and Labelling of Chemicals contains a standard specification for safety data sheets. The SDS follows a 16 section format which is internationally agreed and for substances especially, the SDS should be followed with an Annex which contains the exposure scenarios of this particular substance. The 16 sections are:
SECTION 1: Identification of the substance/mixture and of the company/undertaking
1.1. Product identifier
1.2. Relevant identified uses of the substance or mixture and uses advised against
1.3. Details of the supplier of the safety data sheet
1.4. Emergency telephone number
SECTION 2: Hazards identification
2.1. Classification of the substance or mixture
2.2. Label elements
2.3. Other hazards
SECTION 3: Composition/information on ingredients
3.1. Substances
3.2. Mixtures
SECTION 4: First aid measures
4.1. Description of first aid measures
4.2. Most important symptoms and effects, both acute and delayed
4.3. Indication of any immediate medical attention and special treatment needed
SECTION 5: Firefighting measures
5.1. Extinguishing media
5.2. Special hazards arising from the substance or mixture
5.3. Advice for firefighters
SECTION 6: Accidental release measure
6.1. Personal precautions, protective equipment and emergency procedures
6.2. Environmental precautions
6.3. Methods and material for containment and cleaning up
6.4. Reference to other sections
SECTION 7: Handling and storage
7.1. Precautions for safe handling
7.2. Conditions for safe storage, including any incompatibilities
7.3. Specific end use(s)
SECTION 8: Exposure controls/personal protection
8.1. Control parameters
|
https://en.wikipedia.org/wiki/NLM | NLM may stand for:
National Liberation Movement (disambiguation)
National Literacy Mission Programme, India, from 1988
NetWare Loadable Module, by Novell
Network Lock Manager, a Unix Network File System (NFS) protocol
NLM CityHopper, a former Dutch airline
NLM Nederlandse Luchtvaart Maatschappij, a former Dutch airline
Norwegian Lutheran Mission
United States National Library of Medicine |
https://en.wikipedia.org/wiki/Domain%20Name%20System%20Security%20Extensions | The Domain Name System Security Extensions (DNSSEC) are a suite of extension specifications by the Internet Engineering Task Force (IETF) for securing data exchanged in the Domain Name System (DNS) in Internet Protocol (IP) networks. The protocol provides cryptographic authentication of data, authenticated denial of existence, and data integrity, but not availability or confidentiality.
Overview
The original design of the Domain Name System did not include any security features. It was conceived only as a scalable distributed system. The Domain Name System Security Extensions (DNSSEC) attempt to add security, while maintaining backward compatibility. documents some of the known threats to the DNS, and their solutions in DNSSEC.
DNSSEC was designed to protect applications using DNS from accepting forged or manipulated DNS data, such as that created by DNS cache poisoning. All answers from DNSSEC protected zones are digitally signed. By checking the digital signature, a DNS resolver is able to check if the information is identical (i.e. unmodified and complete) to the information published by the zone owner and served on an authoritative DNS server. While protecting IP addresses is the immediate concern for many users, DNSSEC can protect any data published in the DNS, including text records (TXT) and mail exchange records (MX), and can be used to bootstrap other security systems that publish references to cryptographic certificates stored in the DNS such as Certificate Records (CERT records, ), SSH fingerprints (SSHFP, ), IPSec public keys (IPSECKEY, ), TLS Trust Anchors (TLSA, ), or Encrypted Client Hello (SVCB/HTTPS records for ECH ).
DNSSEC does not provide confidentiality of data; in particular, all DNSSEC responses are authenticated but not encrypted. DNSSEC does not protect against DoS attacks directly, though it indirectly provides some benefit (because signature checking allows the use of potentially untrustworthy parties).
Other standards (not DNSSEC) are used to secure bulk data (such as a DNS zone transfer) sent between DNS servers. As documented in IETF RFC 4367, some users and developers make false assumptions about DNS names, such as assuming that a company's common name plus ".com" is always its domain name. DNSSEC cannot protect against false assumptions; it can only authenticate that the data is truly from or not available from the domain owner.
The DNSSEC specifications (called DNSSEC-bis) describe the current DNSSEC protocol in great detail. See RFC 4033, RFC 4034, and RFC 4035. With the publication of these new RFCs (March 2005), an earlier RFC, RFC 2535 has become obsolete. The full set of RFCs that specify DNSSEC are collected in , which is also BCP 237.
It is widely believed that securing the DNS is critically important for securing the Internet as a whole, but deployment of DNSSEC specifically has been hampered () by several difficulties:
The need to design a backward-compatible standard that can scale to the size o |
https://en.wikipedia.org/wiki/Download%20manager | A download manager is a type of software that manages the downloading of files from the Internet, which may be built into a web browser, or as a standalone program.
Data transmission |
https://en.wikipedia.org/wiki/Composite%20data%20type | In computer science, a composite data type or compound data type is any data type which can be constructed in a program using the programming language's primitive data types and other composite types. It is sometimes called a structure or aggregate type, although the latter term may also refer to arrays, lists, etc. The act of constructing a composite type is known as composition. Composite data types are often contrasted with scalar variables.
C/C++ structures and classes
A struct is C's and C++'s notion of a composite type, a datatype that composes a fixed set of labeled fields or members. It is so called because of the struct keyword used in declaring them, which is short for structure or, more precisely, user-defined data structure.
In C++, the only difference between a struct and a class is the default access level, which is private for classes and public for structs.
Note that while classes and the class keyword were completely new in C++, the C programming language already had a raw type of structs. For all intents and purposes, C++ structs form a superset of C structs: virtually all valid C structs are valid C++ structs with the same semantics.
Declaration
A struct declaration consists of a list of fields, each of which can have any type. The total storage required for a struct object is the sum of the storage requirements of all the fields, plus any internal padding.
For example:
struct Account {
int account_number;
char *first_name;
char *last_name;
float balance;
};
defines a type, referred to as struct Account. To create a new variable of this type, we can write struct Account myAccount;
which has an integer component, accessed by myAccount.account_number, and a floating-point component, accessed by myAccount.balance, as well as the first_name and last_name components. The structure myAccount contains all four values, and all four fields may be changed independently.
Since writing struct Account repeatedly in code becomes cumbersome, it is not unusual to see a typedef statement in C code to provide a more convenient synonym for the struct. However, some programming style guides advise against this, claiming that it can obfuscate the type.
For example:
typedef struct Account_ {
int account_number;
char *first_name;
char *last_name;
float balance;
} Account;
In C++ code, the typedef is not needed because types defined using struct are already part of the regular namespace, so the type can be referred to as either struct Account or simply Account.
As another example, a three-dimensional Vector composite type that uses the floating point data type could be created with:
struct Vector {
float x;
float y;
float z;
};
A variable named velocity with a Vector composite type would be declared as Vector velocity; Members of the velocity would be accessed using a dot notation. For example, velocity.x = 5; would set the x component of velocity equal to 5.
Likewise, a color struc |
https://en.wikipedia.org/wiki/BurgerTime | originally released as in Japan, is a 1982 arcade video game developed by Data East, initially for its DECO Cassette System. The player is chef Peter Pepper, who must walk over hamburger ingredients in a maze of platforms and ladders while avoiding anthropomorphic hot dogs, fried eggs, and pickles which are in pursuit.
In the United States, Data East USA licensed BurgerTime for distribution by Bally Midway as a standard dedicated arcade game. Data East also released its own version of BurgerTime in the United States through its DECO Cassette System. The Data East and Midway versions are distinguished by the manufacturer's name on the title screen and by the marquee and cabinet artworks, as the game itself is identical. The game's original Japanese title Hamburger changed outside of Japan to BurgerTime, reportedly to avoid potential trademark issues. In addition to all releases in the Western world, BurgerTime also became the title used for the Japanese ports and sequels.
The first home port of BurgerTime was released for the Intellivision console in 1983, followed by versions for other systems. There have been multiple sequels for both the arcade and home.
When Data East went bankrupt in 2003, G-Mode bought most of Data East's intellectual properties, including BurgerTime, BurgerTime Deluxe, Super BurgerTime, and Peter Pepper's Ice Cream Factory.
Gameplay
The object of the game is to build a number of hamburgers while avoiding enemy foods. The player controls the protagonist, chef Peter Pepper, with a four-position joystick and a "pepper" button.
Each level is a maze of platforms and ladders in which giant burger ingredients (bun, meat patty, tomato, lettuce) are arranged. When Peter walks the full length of an ingredient, it falls to the level below, knocking down any ingredient that happens to be there. A burger is completed when all of its vertically aligned ingredients have been dropped out of the maze and onto a waiting plate. The player must complete all burgers to finish the board.
Three types of enemy food items wander the maze: Mr. Hot Dog, Mr. Pickle, and Mr. Egg. The player can score extra points by either crushing them under a falling ingredient or dropping an ingredient while they are on it. In the latter case, the ingredient falls two extra levels for every enemy caught on it. Crushed or dropped enemies return to the maze after a short time.
At the start of the game, the player is given a limited number of pepper shots to use against enemies. Pressing the button causes Peter to shake a cloud of pepper in the direction he is facing; any enemy touching the cloud is briefly stunned, and Peter can safely move through them. Ice cream, coffee, and French fries appear on occasion, awarding bonus points and one extra pepper shot when collected.
There are six boards of increasing difficulty, with more burgers/ingredients, more enemies, and/or layouts that make it easier for Peter to become cornered. After the player completes the |
https://en.wikipedia.org/wiki/Table%20%28information%29 | A table is an arrangement of information or data, typically in rows and columns, or possibly in a more complex structure. Tables are widely used in communication, research, and data analysis. Tables appear in print media, handwritten notes, computer software, architectural ornamentation, traffic signs, and many other places. The precise conventions and terminology for describing tables vary depending on the context. Further, tables differ significantly in variety, structure, flexibility, notation, representation and use. Information or data conveyed in table form is said to be in tabular format (adjective). In books and technical articles, tables are typically presented apart from the main text in numbered and captioned floating blocks.
Basic description
A table consists of an ordered arrangement of rows and columns. This is a simplified description of the most basic kind of table. Certain considerations follow from this simplified description:
the term row has several common synonyms (e.g., record, k-tuple, n-tuple, vector);
the term column has several common synonyms (e.g., field, parameter, property, attribute, stanchion);
a column is usually identified by a name;
a column name can consist of a word, phrase or a numerical index;
the intersection of a row and a column is called a cell.
The elements of a table may be grouped, segmented, or arranged in many different ways, and even nested recursively. Additionally, a table may include metadata, annotations, a header, a footer or other ancillary features.
Simple table
The following illustrates a simple table with three columns and nine rows. The first row is not counted, because it is only used to display the column names. This is called a "header row".
Multi-dimensional table
The concept of dimension is also a part of basic terminology. Any "simple" table can be represented as a "multi-dimensional"
table by normalizing the data values into ordered hierarchies. A common example of such a table is a multiplication table.
In multi-dimensional tables, each cell in the body of the table (and the value of that cell) relates to the values at the beginnings of the column (i.e. the header), the row, and other structures in more complex tables. This is an injective relation: each combination of the values of the headers row (row 0, for lack of a better term) and the headers column (column 0 for lack of a better term) is related to a unique cell in
the table:
Column 1 and row 1 will only correspond to cell (1,1);
Column 1 and row 2 will only correspond to cell (2,1) etc.
The first column often presents information dimension description by which the rest of the table is navigated. This column is called "stub column". Tables may contain three or multiple dimensions and can be classified by the number of dimensions. Multi-dimensional tables may have super-rows - rows that describe additional dimensions for the rows that are presented below that row and are usually grouped in a tree-like stru |
https://en.wikipedia.org/wiki/Fuzzball%20router | Fuzzball routers were the first modern routers on the Internet. They were DEC PDP-11 computers (usually LSI-11 personal workstations) loaded with the Fuzzball software written by David L. Mills (of the University of Delaware). The name "Fuzzball" was the colloquialism for Mills's routing software. The software evolved from the Distributed Computer Network (DCN) that started at the University of Maryland in 1973. It acquired the nickname sometime after it was rewritten in 1977.
Six Fuzzball routers provided the routing backbone of the first 56 kbit/s NSFNET, allowing the testing of many of the Internet's first protocols. It allowed the development of the first TCP/IP routing protocols, and the Network Time Protocol. They were the first routers to implement key refinements to TCP/IP such as variable-length subnet masks.
See also
Interface Message Processor
References
External links
The Fuzzball, with photographs
Fuzzball source code, last update in 1992, 16 megabytes
American inventions
Hardware routers
History of telecommunications |
https://en.wikipedia.org/wiki/Shifting%20nth%20root%20algorithm | The shifting nth root algorithm is an algorithm for extracting the nth root of a positive real number which proceeds iteratively by shifting in n digits of the radicand, starting with the most significant, and produces one digit of the root on each iteration, in a manner similar to long division.
Algorithm
Notation
Let be the base of the number system you are using, and be the degree of the root to be extracted. Let be the radicand processed thus far, be the root extracted thus far, and be the remainder. Let be the next digits of the radicand, and be the next digit of the root. Let be the new value of for the next iteration, be the new value of for the next iteration, and be the new value of for the next iteration. These are all integers.
Invariants
At each iteration, the invariant will hold. The invariant will hold. Thus is the largest integer less than or equal to the th root of , and is the remainder.
Initialization
The initial values of , and should be 0. The value of for the first iteration should be the most significant aligned block of digits of the radicand. An aligned block of digits means a block of digits aligned so that the decimal point falls between blocks. For example, in 123.4 the most significant aligned block of two digits is 01, the next most significant is 23, and the third most significant is 40.
Main loop
On each iteration we shift in digits of the radicand, so we have and we produce one digit of the root, so we have . The first invariant implies that . We want to choose so that the invariants described above hold. It turns out that there is always exactly one such choice, as will be proved below.
To summarize, on each iteration:
Let be the next aligned block of digits from the radicand
Let
Let be the largest such that
Let
Let
Now, note that , so the condition
is equivalent to
and
is equivalent to
Thus, we do not actually need , and since and , or , or , so by using instead of we save time and space by a factor of 1/. Also, the we subtract in the new test cancels the one in , so now the highest power of we have to evaluate is rather than .
Summary
Initialize and to 0.
Repeat until desired precision is obtained:
Let be the next aligned block of digits from the radicand.
Let be the largest such that
Let .
Let
Assign and
is the largest integer such that , and , where is the number of digits of the radicand after the decimal point that have been consumed (a negative number if the algorithm has not reached the decimal point yet).
Paper-and-pencil nth roots
As noted above, this algorithm is similar to long division, and it lends itself to the same notation:
.
——————————————————————
_ / 3.
\/ = (10×)2× +(10×)×2 +3
—
2
1 744 = (10×)2× +(10×)×2 +3
—————
256
241 984 = (10×)2× +(10×)×2 |
https://en.wikipedia.org/wiki/Null-terminated%20string | In computer programming, a null-terminated string is a character string stored as an array containing the characters and terminated with a null character (a character with an internal value of zero, called "NUL" in this article, not same as the glyph zero). Alternative names are C string, which refers to the C programming language and ASCIIZ (although C can use encodings other than ASCII).
The length of a string is found by searching for the (first) NUL. This can be slow as it takes O(n) (linear time) with respect to the string length. It also means that a string cannot contain a NUL (there is a NUL in memory, but it is after the last character, not the string).
History
Null-terminated strings were produced by the .ASCIZ directive of the PDP-11 assembly languages and the ASCIZ directive of the MACRO-10 macro assembly language for the PDP-10. These predate the development of the C programming language, but other forms of strings were often used.
At the time C (and the languages that it was derived from) was developed, memory was extremely limited, so using only one byte of overhead to store the length of a string was attractive. The only popular alternative at that time, usually called a "Pascal string" (a more modern term is "length-prefixed"), used a leading byte to store the length of the string. This allows the string to contain NUL and made finding the length need only one memory access (O(1) (constant) time), but limited string length to 255 characters. C designer Dennis Ritchie chose to follow the convention of null-termination to avoid the limitation on the length of a string and because maintaining the count seemed, in his experience, less convenient than using a terminator.
This had some influence on CPU instruction set design. Some CPUs in the 1970s and 1980s, such as the Zilog Z80 and the DEC VAX, had dedicated instructions for handling length-prefixed strings. However, as the null-terminated string gained traction, CPU designers began to take it into account, as seen for example in IBM's decision to add the "Logical String Assist" instructions to the ES/9000 520 in 1992 and the vector string instructions to the IBM z13 in 2015.
FreeBSD developer Poul-Henning Kamp, writing in ACM Queue, referred to the victory of null-terminated strings over a 2-byte (not one-byte) length as "the most expensive one-byte mistake" ever.
Limitations
While simple to implement, this representation has been prone to errors and performance problems.
Null-termination has historically created security problems. A NUL inserted into the middle of a string will truncate it unexpectedly. A common bug was to not allocate the additional space for the NUL, so it was written over adjacent memory. Another was to not write the NUL at all, which was often not detected during testing because the block of memory already contained zeros. Due to the expense of finding the length, many programs did not bother before copying a string to a fixed-size buffer, causing a |
https://en.wikipedia.org/wiki/London%20Victoria%20station | Victoria station, also known as London Victoria, is a central London railway terminus and connected London Underground station in Victoria, in the City of Westminster, managed by Network Rail. Named after the nearby Victoria Street (itself named after Queen Victoria), the main line station is a terminus of the Brighton Main Line to and and the Chatham Main Line to and Dover via . From the main lines, trains can connect to the Catford Loop Line, the Dartford Loop Line, and the Oxted line to and . Southern operates most commuter and regional services to south London, Sussex and parts of east Surrey, while Southeastern operates trains to south-east London and Kent, alongside limited services operated by Thameslink. Gatwick Express trains run direct to Gatwick. The Underground station is on the Circle and District lines between and , and the Victoria line between and . The area around the station is an important interchange for other forms of transport: a local bus station is in the forecourt and Victoria Coach Station is nearby.
Victoria was built to serve both the Brighton and Chatham Main Lines, and has always had a "split" feel of being two separate stations. The Brighton station opened in 1860 with the Chatham station following two years later. It replaced a temporary terminus at Pimlico, and construction involved building the Grosvenor Bridge over the River Thames. It became immediately popular as a London terminus, causing delays and requiring upgrades and rebuilding. It was well known for luxury Pullman train services and continental boat-train trips, and became a focal point for soldiers during World War I.
Like other London termini, steam trains were phased out of Victoria by the 1960s, to be replaced by suburban electric and diesel multiple-unit services; all services from the station are currently operated using electric multiple units. Despite the end of international services following the opening of the Channel Tunnel, Victoria still remains an important London terminal station. The connected Underground station, in particular, suffered from overcrowding, until a major upgrade was completed in the late 2010s. The Gatwick Express service provides easy access between Central London and Gatwick Airport for international travellers.
Location
The station complex is in Victoria in the City of Westminster, immediately south of the London Inner Ring Road. It is located south of Victoria Street, east of Buckingham Palace Road and west of Vauxhall Bridge Road. Several different railways lead into the station line by way of Grosvenor Bridge from the south west, south and south east. It is in Travelcard Zone 1 and is one of 19 stations managed by Network Rail. It has been a Grade II listed building since 1970.
Victoria Coach Station is about 300 metres south-west of the railway stations. It is the main London coach terminal and serves all parts of the UK and mainland Europe.
London Buses routes 2, 3, 6, 11, 13, 24, 26, 36, 38, 44, 52, 1 |
https://en.wikipedia.org/wiki/Value%20%28computer%20science%29 | In computer science and software programming, a value is the representation of some entity that can be manipulated by a program. The members of a type are the values of that type.
The "value of a variable" is given by the corresponding mapping in the environment. In languages with assignable variables, it becomes necessary to distinguish between the r-value (or contents) and the l-value (or location) of a variable.
In declarative (high-level) languages, values have to be referentially transparent. This means that the resulting value is independent of the location of the expression needed to compute the value. Only the contents of the location (the bits, whether they are 1 or 0) and their interpretation are significant.
Value category
Despite its name, in the C++ language standards this terminology is used to categorize expressions, not values.
Assignment: l-values and r-values
Some languages use the idea of l-values and r-values, deriving from the typical mode of evaluation on the left and right-hand side of an assignment statement. An l-value refers to an object that persists beyond a single expression. An r-value is a temporary value that does not persist beyond the expression that uses it.
The notion of l-values and r-values was introduced by Combined Programming Language (CPL). The notions in an expression of r-value, l-value, and r-value/l-value are analogous to the parameter modes of input parameter (has a value), output parameter (can be assigned), and input/output parameter (has a value and can be assigned), though the technical details differ between contexts and languages.
R-values and addresses
In many languages, notably the C family, l-values have storage addresses that are programmatically accessible to the running program (e.g., via some address-of operator like "&" in C/C++), meaning that they are variables or de-referenced references to a certain memory location. R-values can be l-values (see below) or non-l-values—a term only used to distinguish from l-values. Consider the C expression . When executed, the computer generates an integer value of 13, but because the program has not explicitly designated where in the computer this 13 is stored, the expression is a non l-value. On the other hand, if a C program declares a variable x and assigns the value of 13 to x, then the expression has a value of 13 and is an l-value.
In C, the term l-value originally meant something that could be assigned to (hence the name, indicating it is on the left side of the assignment operator), but since the reserved word (constant) was added to the language, the term is now 'modifiable l-value'. In C++11 a special semantic-glyph exists ( not to be confused with the && operator used for logical operations ), to denote the use/access of the expression's address for the compiler only; i.e., the address cannot be retrieved using the address-of operator during the run-time of the program (see the use of move semantics). The addition of move se |
https://en.wikipedia.org/wiki/Long%20line%20%28telecommunications%29 | In telecommunication, a long line is a transmission line in a long-distance communications network such as carrier systems, microwave radio relay links, geosynchronous satellite links, underground cables, aerial cables and open wire, and Submarine communications cables. In the United States, some of this technology was spun off into the corporate entity known as AT&T Long Distance with the breakup of AT&T in 1984. Previously, the AT&T Long Lines division of the Bell System provided maintenance and installation of long line facilities for the Bell System's long-distance service.
See also
Long-haul communications
Long-distance calling
Telephony
Communication circuits |
https://en.wikipedia.org/wiki/GLSEN | GLSEN (pronounced glisten; formerly the Gay, Lesbian & Straight Education Network) is an American education organization working to end discrimination, harassment, and bullying based on sexual orientation, gender identity and gender expression and to prompt LGBT cultural inclusion and awareness in K-12 schools. Founded in 1990 in Boston, Massachusetts, the organization is now headquartered in New York City and has an office of public policy based in Washington, D.C.
there are 39 GLSEN chapters across 26 states that train 5,000 students, educators, and school personnel each year. The chapters also support more than 4,000 registered school-based clubs—commonly known as gay–straight alliances (GSAs)--which work to address name-calling, bullying, and harassment in their schools. GLSEN also sponsors and participates in a host of annual "Days of Action", including a No Name-Calling Week every January, a Day of Silence every April, and an Ally Week every September. Guided by research such as its National School Climate Survey, GLSEN has developed resources, lesson plans, classroom materials, and professional development programs for teachers on how to support LGBTQ students.
Research shows that in response to bullying and mistreatment, many LGBTQ students avoid school altogether; this can lead to academic failure. To combat this problem, GLSEN has advocated for LGBTQ-inclusive anti-bullying laws and policies. GLSEN has also worked with the U.S. Departments of Education, Justice, and Health and Human Services to create model policies that support LGBTQ students and educators. GLSEN has considered their signature legislation to be the Safe Schools Improvement Act and has been honored by the White House as a "Champion of Change".
History
1990s
1990
Kevin Jennings, a high school history teacher in Massachusetts, and Kathy Henderson, Assistant Athletic Director at Phillips Academy, Andover leads a coalition of gay and lesbian educators to form what was then called the Gay and Lesbian Independent School Teacher Network (GLISTN).
1993
In Massachusetts, the Governor's Commission released its report, Making Schools Safe for Gay and Lesbian Youth.
1994
GLSTN became a national organization with the founding of the first chapter outside Massachusetts in St. Louis.
GLSTN launches the first LGBT History Month in October with official proclamations from the governors of Connecticut and Massachusetts.
1995
GLSTN hired its first full-time staffer, founder and Executive Director Kevin Jennings.
GLSTN accredits chapters for the first time.
1996
GLSTN started annual celebration of Day of Silence.
1997
GLSTN staged its first national conference in Salt Lake City, Utah, in response to the legislature's effort to prevent the formation of GSAs in the state by banning all student groups.
GLSTN changed its name to GLSEN (the Gay, Lesbian & Straight Education Network) in order to more reflect the importance of straight educators in shaping safe school |
https://en.wikipedia.org/wiki/Scientific%20community | The scientific community is a diverse network of interacting scientists. It includes many "sub-communities" working on particular scientific fields, and within particular institutions; interdisciplinary and cross-institutional activities are also significant. Objectivity is expected to be achieved by the scientific method. Peer review, through discussion and debate within journals and conferences, assists in this objectivity by maintaining the quality of research methodology and interpretation of results.
History of scientific communities
The eighteenth century had some societies made up of men who studied nature, also known as natural philosophers and natural historians, which included even amateurs. As such these societies were more like local clubs and groups with diverse interests than actual scientific communities, which usually had interests on specialized disciplines. Though there were a few older societies of men who studied nature such as the Royal Society of London, the concept of scientific communities emerged in the second half of the 19th century, not before, because it was in this century that the language of modern science emerged, the professionalization of science occurred, specialized institutions were created, and the specialization of scientific disciplines and fields occurred.
For instance, the term scientist was first coined by the naturalist-theologian William Whewell in 1834 and the wider acceptance of the term along with the growth of specialized societies allowed for researchers to see themselves as a part of a wider imagined community, similar to the concept of nationhood.
Membership, status and interactions
Membership in the community is generally, but not exclusively, a function of education, employment status, research activity and institutional affiliation. Status within the community is highly correlated with publication record, and also depends on the status within the institution and the status of the institution. Researchers can hold roles of different degrees of influence inside the scientific community. Researchers of a stronger influence can act as mentors for early career researchers and steer the direction of research in the community like agenda setters.
Scientists are usually trained in academia through universities. As such, degrees in the relevant scientific sub-disciplines are often considered prerequisites in the relevant community. In particular, the PhD with its research requirements functions as a marker of being an important integrator into the community, though continued membership is dependent on maintaining connections to other researchers through publication, technical contributions, and conferences. After obtaining a PhD an academic scientist may continue through being on an academic position, receiving a post-doctoral fellowships and onto professorships. Other scientists make contributions to the scientific community in alternate ways such as in industry, education, think tanks, or the |
https://en.wikipedia.org/wiki/Rational%20Software | Rational Machines is an enterprise founded by Paul Levy and Mike Devlin in 1981 to provide tools to expand the use of modern software engineering practices, particularly explicit modular architecture and iterative development. It changed its name in 1994 to Rational Software, and was sold for US$2.1 billion (equivalent to current US$) to IBM on February 20, 2003.
See also
Rational Automation Framework
Rational ClearCase
Rational DOORS
Rational Performance Tester
Rational Rhapsody
Rational Rose
Rational Software Modeler
Rational Synergy
Rational Unified Process
References
External links
Defunct software companies of the United States
IBM acquisitions |
https://en.wikipedia.org/wiki/SuperWaba | SuperWaba is a discontinued Java-like virtual machine (VM) that targets portable devices. Software developers use application programming interfaces (APIs), accessed through associated libraries (packaged as Jars) and small tools (together composing a software development kit), to create applications that can run within the VM on supported platforms.
Architecture
The SuperWaba VM and API implement a subset of the Java programming language, which allows it to run under a standard Java VM or as a Java applet. This is in contrast to the Java Micro Edition which was designed under a different Java specification than that used by the Java Standard Edition. Classes compiled for the SuperWaba VM must be compiled for Java 2, Standard Edition 1.2 compatibility.
Note that the SuperWaba VM does not conform to a particular specification. However, the SuperWaba API allows recompiling an application's classes to the Java Standard Edition. When an application is retargeted in this way, all versions of the Java Standard Edition are supported.
Despite its likeness to the Java 2 standard edition specification, SuperWaba is appropriately constrained for hardware limitations typically encountered on portable devices. Especially, the SuperWaba VM has been optimized for use on devices with small screens. Compiled code runs at 1/3 to 1/2 the speed of a pure C application on a Palm platform, and on a Windows API (Win32) platform is approximately three to four times faster than a JIT-compiled Java due partly to its integer-only implementation. Additional mathematics libraries for non-integer arithmetic are provided with the SDK.
The SuperWaba VM and API are both extensible. They are published under the GPL free software license. Also, licensees may buy an LGPL version, that lets them link it with proprietary software. Applications and libraries written for SuperWaba may be sold, but most appear to be available as free software from the main website.
History
SuperWaba evolved from the Waba project which was an independent forerunner of Java Platform, Micro Edition (Java ME). SuperWaba had initial support only for Palm OS; starting in version 3, it added support for Windows CE, as the prior Waba VM.
Since the 5.0 release, SuperWaba has used the SDL library for driving the display, which increases its portability to many other platforms.
The support for SuperWaba has ceased and its successor, TotalCross, is the primary mobile SDK. Totalcross Beta 4 was released on January 12, 2009. TotalCross, a superior solution to SuperWaba, offers greater platform stability, leaner compilation of Java code, and added ability in a smaller footprint.
Integration and support
SuperWaba applications can be developed under any JDK supporting Java 1.2 or greater, and the libraries and tools integrate with development environments such as Eclipse, JBuilder, etc. The VM runs on the following platforms:
Windows CE 2.11 and above
Pocket PC: Axim, iPAQ, others
Palm OS 2.0 and above
Palm |
https://en.wikipedia.org/wiki/Space%20complexity | The space complexity of an algorithm or a computer program is the amount of memory space required to solve an instance of the computational problem as a function of characteristics of the input. It is the memory required by an algorithm until it executes completely. This includes the memory space used by its inputs, called input space, and any other (auxiliary) memory it uses during execution, which is called auxiliary space.
Similar to time complexity, space complexity is often expressed asymptotically in big O notation, such as
etc., where is a characteristic of the input influencing space complexity.
Space complexity classes
Analogously to time complexity classes DTIME(f(n)) and NTIME(f(n)), the complexity classes DSPACE(f(n)) and NSPACE(f(n)) are the sets of languages that are decidable by deterministic (respectively, non-deterministic) Turing machines that use space. The complexity classes PSPACE and NPSPACE allow to be any polynomial, analogously to P and NP. That is,
and
Relationships between classes
The space hierarchy theorem states that, for all space-constructible functions there exists a problem that can be solved by a machine with memory space, but cannot be solved by a machine with asymptotically less than space.
The following containments between complexity classes hold.
Furthermore, Savitch's theorem gives the reverse containment that if
As a direct corollary, This result is surprising because it suggests that non-determinism can reduce the space necessary to solve a problem only by a small amount. In contrast, the exponential time hypothesis conjectures that for time complexity, there can be an exponential gap between deterministic and non-deterministic complexity.
The Immerman–Szelepcsényi theorem states that, again for is closed under complementation. This shows another qualitative difference between time and space complexity classes, as nondeterministic time complexity classes are not believed to be closed under complementation; for instance, it is conjectured that NP ≠ co-NP.
LOGSPACE
L or LOGSPACE is the set of problems that can be solved by a deterministic Turing machine using only memory space with regards to input size. Even a single counter that can index the entire -bit input requires space, so LOGSPACE algorithms can maintain only a constant number of counters or other variables of similar bit complexity.
LOGSPACE and other sub-linear space complexity is useful when processing large data that cannot fit into a computer's RAM. They are related to Streaming algorithms, but only restrict how much memory can be used, while streaming algorithms have further constraints on how the input is fed into the algorithm.
This class also sees use in the field of pseudorandomness and derandomization, where researchers consider the open problem of whether L = RL.
The corresponding nondeterministic space complexity class is NL.
Auxiliary space complexity
The term refers to space other than that consumed |
https://en.wikipedia.org/wiki/Back-side%20bus | In personal computer microprocessor architecture, a back-side bus (BSB), or backside bus, was a computer bus used on early Intel platforms to connect the CPU to CPU cache memory, usually off-die L2. If a design utilizes it along with a front-side bus (FSB), it is said to use a dual-bus architecture, or in Intel's terminology Dual Independent Bus (DIB) architecture. The back-side bus architecture evolved when newer processors like the second-generation Pentium III began to incorporate on-die L2 cache, which at the time was advertised as Advanced Transfer Cache, but Intel continued to refer to the Dual Independent Bus till the end of Pentium III.
History
BSB is an improvement over the older practice of using a single system bus, because a single bus typically became a severe bottleneck as CPUs and memory speeds increased. Due to its dedicated nature, the back-side bus can be optimized for communication with cache, thus eliminating protocol overheads and additional signals that are required on a general-purpose bus. Furthermore, since a BSB operates over a shorter distance, it can typically operate at higher clock speeds, increasing the computer's overall performance.
Cache connected with a BSB was initially external to the microprocessor die, but now is usually on-die. In the latter case, the BSB clock frequency is typically equal to the processor's, and the back-side bus can also be made much wider (256-bit, 512-bit) than either off-chip or on-chip FSB.
The dual-bus architecture was used in a number of designs, including the IBM and Freescale (formerly the semiconductor division of Motorola) PowerPC processors (certain PowerPC 604 models, the PowerPC 7xx family, and the Freescale 7xxx line), as well as the Intel Pentium Pro, Pentium II and early Pentium III processors,
which used it to access their L2 cache (earlier Intel processors accessed the L2 cache over the FSB, while later processors moved it on-chip).
See also
CPU cache
Bus (computing)
Front-side bus
References
Computer buses |
https://en.wikipedia.org/wiki/Top-down%20parsing | Top-down parsing in computer science is a parsing strategy where one first looks at the highest level of the parse tree and works down the parse tree by using the rewriting rules of a formal grammar. LL parsers are a type of parser that uses a top-down parsing strategy.
Top-down parsing is a strategy of analyzing unknown data relationships by hypothesizing general parse tree structures and then considering whether the known fundamental structures are compatible with the hypothesis. It occurs in the analysis of both natural languages and computer languages.
Top-down parsing can be viewed as an attempt to find left-most derivations of an input-stream by searching for parse-trees using a top-down expansion of the given formal grammar rules. Inclusive choice is used to accommodate ambiguity by expanding all alternative right-hand-sides of grammar rules.
Simple implementations of top-down parsing do not terminate for left-recursive grammars, and top-down parsing with backtracking may have exponential time complexity with respect to the length of the input for ambiguous CFGs. However, more sophisticated top-down parsers have been created by Frost, Hafiz, and Callaghan, which do accommodate ambiguity and left recursion in polynomial time and which generate polynomial-sized representations of the potentially exponential number of parse trees.
Programming language application
A compiler parses input from a programming language to an internal representation by matching the incoming symbols to production rules. Production rules are commonly defined using Backus–Naur form. An LL parser is a type of parser that does top-down parsing by applying each production rule to the incoming symbols, working from the left-most symbol yielded on a production rule and then proceeding to the next production rule for each non-terminal symbol encountered. In this way the parsing starts on the Left of the result side (right side) of the production rule and evaluates non-terminals from the Left first and, thus, proceeds down the parse tree for each new non-terminal before continuing to the next symbol for a production rule.
For example:
which produces the string A=acdf
would match and attempt to match next. Then would be tried. As one may expect, some languages are more ambiguous than others. For a non-ambiguous language, in which all productions for a non-terminal produce distinct strings, the string produced by one production will not start with the same symbol as the string produced by another production. A non-ambiguous language may be parsed by an LL(1) grammar where the (1) signifies the parser reads ahead one token at a time. For an ambiguous language to be parsed by an LL parser, the parser must lookahead more than 1 symbol, e.g. LL(3).
The common solution to this problem is to use an LR parser, which is a type of shift-reduce parser, and does bottom-up parsing.
Accommodating left recursion in top-down parsing
A formal grammar that contains left rec |
https://en.wikipedia.org/wiki/Pathways%20into%20Darkness | Pathways into Darkness is a first-person shooter adventure video game developed and published by Bungie in 1993, for Macintosh personal computers. Players assume the role of a Special Forces soldier who must stop a powerful, godlike being from awakening and destroying the world. Players solve puzzles and defeat enemies to unlock parts of a pyramid where the god sleeps; the game's ending changes depending on player actions.
Pathways began as a sequel to Bungie's Minotaur: The Labyrinths of Crete, before the developers created an original story. Jason Jones programmed the game, while his friend Colin Brent developed the environments and creatures. The game features three-dimensional, texture-mapped graphics and stereo sound on supported Macintosh models. Pathways was critically acclaimed and won a host of awards; it was also Bungie's first major commercial success and enabled the two-man team of Jason Jones and Alex Seropian to move into a Chicago office and begin paying staff.
Gameplay
Pathways into Darkness is a first-person shooter and adventure game. The game interface consists of four windows. The primary "World View" shows the player character's first-person perspective. Players move, dodge, fire, and use weapons and items using the computer keyboard. The "Inventory" window displays items players have acquired, the "Message" window relates events and the in-game time, and the "Player" window displays health and energy information. The game clock runs constantly during gameplay, except when in conversation; the player loses the game if the sleeping god wakes after a set period of time.
Players fight various monsters as they explore the pyramid's halls and catacombs. They may pick up weapons and ammunition left behind by others to supplement their arsenal. As additional levels are unlocked, new weapons become available, including machine guns and grenade launchers. Players can absorb a certain amount of damage, but once their health reaches zero, they must resume their progress at the last saved checkpoint. Resting in place replenishes health but saps game time and leaves the player open to attack. Scattered throughout the levels are other items players may use. Potions have different effects: rare blue potions, for example, rid the player character of poison and damage. Other items provide money, or points that increases the player character's maximum health. Crystals can be used against enemies to freeze, burn, or otherwise harm them.
Through the use of the yellow crystal, players can converse with Previously Living Sentient Beings or "PLSBs". Conversations provide players with puzzle information, strategies for defeating monsters, and story background. Rather than relying on a branching tree of conversation options, players type keywords into a dialogue box. When a certain keyword (typically found in a previous statement by the dead person in question) is entered, the dead person will give a response. The manual gives a starting point |
https://en.wikipedia.org/wiki/Value-added%20network | A value-added network (VAN) is a hosted service offering that acts as an intermediary between business partners sharing standards based on proprietary data via shared business processes. The offered service is referred to as "value-added network services".
1960s: "Timesharing" and "network" service
Following in the wake of timesharing providers, provision of leased lines between terminals and data centers proved a sustainable business which led to the establishment of dedicated business units and companies specialized in the management and marketing of such network services. See Tymshare for an example of a timeshare services company that spun off Tymnet as a data communications specialist with a complex product portfolio.
1970s: Marketisation of telecommunication
The large-scale allocation of network services by private companies was in conflict with state-controlled telecommunications sector. To be able to gain a license for telecommunication service provision to customers, a private business had to "add value" to the communications line in order to be a distinguishable service. Therefore, the notion of "value-added network services" was established to allow for operation of such private businesses as an exemption from state control.
The telecommunication operator sector was marketed in the USA in 1982 (see Modification of Final Judgment) and in the United Kingdom starting with the early 1980s (mainly due to the privatization of British Telecom under Prime Minister Margaret Thatcher). In the later 1980s, running a value-added network service required licensing in the U.K. while the term "value-added network" had merely become a functional description of a specific subset of networked data communication in the USA.
Since 1980s: International competition and standardization efforts
On a multinational scale, and due to the heterogeneous telecommunication economy and infrastructure before the market penetration of the Internet, management of a value-added network service proved a complicated task leading to the idea of user-defined networks, a concept preceding the nowadays ubiquitous availability of internet service. Standardization efforts for data networking were made by ITU-T (formerly CCIT) and included X.25 packet-switched networks and X.400 message handling systems, specifically motivated by an emerging transatlantic competition in the early 1990s.
Perspective
In the absence of state-operated telecommunication sector, value-added network services are still used, mainly as a functional description, in conjunction with dedicated leased lines for business-to-business communications (especially for EDIFACT data transfer).
Governments like South Africa still maintain explicit regulation, while others address specific services with licensing.
Traditionally, most value-added network services mainly supported general-purpose business-to-business integration capabilities focused on electronic data interchanges, but service providers ar |
https://en.wikipedia.org/wiki/Exosquad | Exosquad is an animated television series created by Universal Cartoon Studios for MCA TV's Universal Family Network syndicated programming block. The show is set in the beginning of the 22nd century and covers the interplanetary war between humanity and Neosapiens, a fictional race artificially created as workers/slaves for the Terrans. The narrative generally follows Able Squad, an elite Terran unit of exoframe pilots, on their missions all over the Solar System, although other storylines are also abundant. The series ran for two complete seasons in syndication from 1993 to 1994, and was cancelled after one third-season episode had been produced. Reruns later aired on USA Network.
Plot
The series is set in the years 2119–2121 AD, decades after humanity ("Terrans") has expanded beyond Earth, terraforming and colonizing Venus and Mars. These three planets are "the Homeworlds", the core first of the Terran interplanetary state and later of Neosapien Commonwealth. Not all Terrans are affiliated with the Homeworlds, however: there is an independent faction of Pirate Clans, descendants of Terran criminals exiled to the Outer Planets who live off looted Homeworlds' space freighters. The first episode opens with the Earth Congress dispatching the entire Exofleet, humanity's space-based military, to counter the Pirate threat.
With war with the Pirate Clans looming, an uprising begins among the Neosapiens, an artificial humanoid race coexisting with Terrans. In the back-story, the Neosapiens were used primarily as slaves during the colonization of Mars and Venus and therefore have been engineered to be physically stronger and better adapted to hostile environments than humans. Their mistreatment by Terrans led to the First Neosapien Revolt fifty years before the series' begin, which was mercilessly crushed but had brought some positive changes into their lives. Still not content with his fate, the Neosapien Governor of Mars, Phaeton, sets a new insurrection, codenamed "Operation [Neosapien] Destiny", in motion as soon as the Exofleet leaves to chase after the Pirate Clans. The absence of the Exofleet is also a part of Phaeton's plan as it enables the Neosapiens' capture of the Homeworlds without much effort.
The series follows the progress the Able Squad, an elite unit of exoframe pilots composed of J.T. Marsh, Nara Burns, Maggie Weston, Kaz Takagi, Alec DeLeon, Rita Torres, Wolf Bronsky, and Marsala. Their exploits unfold against the backdrop of the ongoing Neosapien War, as the squad participates in events often crucial to turning its tide. The show features a realistic outlook on war: many characters die in combat, military operations are carefully planned and reconnoitered in advance, and psychological effects of warfare are explored. For example, separate episodes detail Exofleet's reconnaissance of Venus prior to its recapture, the actual liberation, and the repulse of the first Neosapien reconquest attempt. Moreover, even after Venus is retak |
https://en.wikipedia.org/wiki/Symbolic%20artificial%20intelligence | In artificial intelligence, symbolic artificial intelligence is the term for the collection of all methods in artificial intelligence research that are based on high-level symbolic (human-readable) representations of problems, logic and search. Symbolic AI used tools such as logic programming, production rules, semantic nets and frames, and it developed applications such as knowledge-based systems (in particular, expert systems), symbolic mathematics, automated theorem provers, ontologies, the semantic web, and automated planning and scheduling systems. The Symbolic AI paradigm led to seminal ideas in search, symbolic programming languages, agents, multi-agent systems, the semantic web, and the strengths and limitations of formal knowledge and reasoning systems.
Symbolic AI was the dominant paradigm of AI research from the mid-1950s until the mid-1990s.
Researchers in the 1960s and the 1970s were convinced that symbolic approaches would eventually succeed in creating a machine with artificial general intelligence and considered this the ultimate goal of their field. An early boom, with early successes such as the Logic Theorist and Samuel's Checkers Playing Program, led to unrealistic expectations and promises and was followed by the First AI Winter as funding dried up. A second boom (1969–1986) occurred with the rise of expert systems, their promise of capturing corporate expertise, and an enthusiastic corporate embrace. That boom, and some early successes, e.g., with XCON at DEC, was followed again by later disappointment. Problems with difficulties in knowledge acquisition, maintaining large knowledge bases, and brittleness in handling out-of-domain problems arose. Another, second, AI Winter (1988–2011) followed. Subsequently, AI researchers focused on addressing underlying problems in handling uncertainty and in knowledge acquisition. Uncertainty was addressed with formal methods such as hidden Markov models, Bayesian reasoning, and statistical relational learning. Symbolic machine learning addressed the knowledge acquisition problem with contributions including Version Space, Valiant's PAC learning, Quinlan's ID3 decision-tree learning, case-based learning, and inductive logic programming to learn relations.
Neural networks, a subsymbolic approach, had been pursued from early days and was to reemerge strongly in 2012. Early examples are Rosenblatt's perceptron learning work, the backpropagation work of Rumelhart, Hinton and Williams, and work in convolutional neural networks by LeCun et al. in 1989. However, neural networks were not viewed as successful until about 2012: "Until Big Data became commonplace, the general consensus in the Al community was that the so-called neural-network approach was hopeless. Systems just didn't work that well, compared to other methods. ... A revolution came in 2012, when a number of people, including a team of researchers working with Hinton, worked out a way to use the power of GPUs to enormously incre |
https://en.wikipedia.org/wiki/Indy | Indy may refer to:
Computing and technology
Indy (software), used for Internet access to music
Internet Direct, or "Indy", a software library
SGI Indy, a computer workstation
Periodicals
The Indy, shorthand for newspapers that include "Independent" in their name, e.g.:
The Independent (Newfoundland), published in Newfoundland and Labrador, Canada
The Independent, a daily British newspaper
The College Hill Independent, published in Providence, Rhode Island
The Indydependent, a newspaper published by the Independent Media Center (also known as "Indymedia" or "Indy Media")
The Indianapolis Star, a newspaper published in Indianapolis, Indiana (often referred to as the IndyStar)
Sports
Indianapolis 500, also known as "Indy 500", an auto race
IndyCar, auto racing sanctioning body for North American open wheel racing
Indy Eleven, Indianapolis' United Soccer League team
Indy Fuel, Indianapolis' ECHL ice hockey team
Indy grab, a board-sport maneuver
Other uses
Indy (gene), a fruit-fly longevity gene
Indy (album), the second EP by Motograter
Independence High School (San Jose, California), also referred to as Indy, a public high school
Indiana Jones, nicknamed "Indy", a fictional adventurer and archaeologist
Indianapolis, nicknamed "Indy", the capital city of the U.S. state of Indiana and its surrounding metropolitan area
Indy Aircraft, an American aircraft manufacturer based in Independence, Iowa
IndyGo, the popular name for the bus service in Indianapolis
See also
Indi (disambiguation)
Indiana (disambiguation)
Indie (disambiguation) |
https://en.wikipedia.org/wiki/M8 | M8 or M-8 or M.08 or variant, may refer to:
Computing and electronics
M8 (cipher), an encryption algorithm
Leica M8, a digital rangefinder camera
HTC One (M8), a smartphone
Meizu M8, a smartphone
Roads and Places
Messier 8, also known as M8 or Lagoon Nebula, a giant interstellar cloud
William L. Whitehurst Field (FAA airport code M08), Bolivar, Hardeman County, Tennessee, USA
Rail stations
Meijō Kōen Station (station code M08), Kita, Nagoya, Aichi, Japan
Senri-Chūō Station (station code M08), Toyonaka, Osaka, Japan
Tatsue Station (station code M08), Komatsushima, Tokushima, Japan
Roads
M-8 (Michigan highway), also known as the Davison Freeway
M8 (East London), a Metropolitan Route in East London, South Africa
M8 (Cape Town), a Metropolitan Route in Cape Town, South Africa
M8 (Johannesburg), a Metropolitan Route in Johannesburg, South Africa
M8 (Pretoria), a Metropolitan Route in Pretoria, South Africa
M8 (Durban), a Metropolitan Route in Durban, South Africa
M8 (Port Elizabeth), a Metropolitan Route in Port Elizabeth, South Africa
M8 highway (Russia), also known as the Kholmogory Highway
M8 motorway (Hungary)
M8 motorway (Ireland)
M-8 highway (Montenegro)
M8 motorway (Pakistan)
M8 motorway (Scotland)
M8 Motorway (Sydney) in Sydney, Australia
Highway M08 (Ukraine)
Western Freeway (Victoria) in Australia, designated M8
M8 Road (Zambia)
Civilian transportation
Road transport
M8 (New York City bus), a New York City Bus route in Manhattan
BMW M8, a sports car from BMW 8 Series
Mercedes-Benz M08 engine, a straight-8 engine
Haima M8, a sedan
Rail transport
Paris Métro Line 8, a rapid transit rail line in Paris
M8 (Istanbul Metro), a rapid transit rail line in Istanbul, Turkey
M8 (railcar), a Metro-North Railroad car
Military
M8 Grenade Launcher, see M7 grenade launcher
Aircraft
Loening M-8, a 1910s American fighter monoplane
Miles M.8 Peregrine, a 1930s twin-engined light transport monoplane primarily used by the Royal Aircraft Establishment
Land vehicles
M8 Armored Gun System, a US Army light tank cancelled in 1996
M8 Greyhound, an American armored car used during World War II
M8 Tractor, an artillery tractor used by the US Army
Howitzer Motor Carriage M8, an American self-propelled howitzer vehicle developed during World War II
Rockets
M8 (rocket), an American World War II air-to-surface and surface-to-surface rocket
M-8 rocket, a variant of the RS-82 rocket used by the Soviet Union in World War II
Other uses
M8, a standard bolt and nut size in the ISO metric screw thread system
M8 Alliance, World Health Summit
M8 (magazine), a dance music magazine based in Scotland
M8, Internet slang for "mate"
M8, a difficulty grade in mixed climbing
See also
Yamaha MO8 music synthesizer
8M (disambiguation)
Mate (disambiguation) ("m8" in texting spelling)
M (disambiguation)
8 (disambiguation)
Model 8 (disambiguation) |
https://en.wikipedia.org/wiki/A57 | A57 could refer to:
Benko Gambit, Encyclopaedia of Chess Openings code
Sony Alpha 57, a DSLT camera
ARM Cortex A57, a computer microprocessor architecture
Bartini A-57, a 1957 supersonic strategic bomber project
Chrysler A57 multibank, a Second World War tank engine
Roads
A57 road, a road connecting Liverpool and Lincoln in England
A57 autoroute, a road connecting the Tunnel de Toulon to the A8 near Le Luc in France
A57 motorway, a road connecting Goch and Köln in Germany
A57 motorway, a road connecting Dolo and Quarto d'Altino in Italy
A57 highway, a road connecting the autopista AP-9 and autovía A-52 and the airport of Vigo in Spain |
https://en.wikipedia.org/wiki/Onix | Onix may refer to:
ONIX (publishing protocol), XML metadata formats for book publishers
Onix (Pokémon), a character in the Pokémon franchise
Chevrolet Onix, a subcompact car
Onix, a synonym of the legume genus Astragalus
People
Onix Cortés (born 1988), judoka from Cuba
Onix Concepción (born 1957), Puerto Rican Major League Baseball shortstop
See also
Onyx (disambiguation)
P-800 Oniks, a Russian/Soviet supersonic anti-ship cruise missile |
https://en.wikipedia.org/wiki/FGCS | FGCS may refer to:
Facial gender confirmation surgery
Female genital cosmetic surgery
Former gifted child syndrome
Fifth generation computer systems project
Forest Gate Community School a school in Newham, East London
Future Generation Computing Systems, an Elsevier scientific journal
See also
FGC (disambiguation) |
https://en.wikipedia.org/wiki/CMI | CMI may refer to:
Brands and enterprises
C-Media Electronics, Inc., Taiwanese computer hardware company
Chicago Musical Instruments (CMI), a manufacturer and distributor of musical instruments
Chimei Innolux Corporation, Taiwanese TFT-LCD panel manufacturer
Citibank Mortgage, Inc.
CMI Gold & Silver Inc., one of the oldest precious metals bullion dealers in the United States
Cockerill Maintenance & Ingénierie, Belgian engineering company
Computer Memories Inc., a defunct hard disk drive manufacturer
Continental Micronesia, Inc., ICAO code CMI, a company which was a wholly owned subsidiary of Continental Airlines
Cummins, Inc., a manufacturer of diesel engines
Fairlight CMI, the Fairlight Computer Musical Instrument, a digital synthesizer, sampler and digital audio workstation introduced in 1979 by Fairlight
Computing and technology
Coded mark inversion, a non-return-to-zero (NRZ) line code
Content Management Interface, an Open Mobile Alliance enabler that provides a standardized way for content providers to interact with service providers (network operators)
Economics and finance
Chiang Mai Initiative, a multi-lateral currency swap among ASEAN+3 countries
Credit Managers' Index, an economic indicator tracking the manufacturing and service sectors
Healthcare
Case mix index, a relative value assigned to a diagnosis-related group of patients
Cell-mediated immunity, an immune response that does not involve antibodies but rather involves the activation of phagocytes
Chronic Mental Illness
Organizations and institutes
Cambridge–MIT Institute, a partnership between the University of Cambridge in Cambridge, England, and the Massachusetts Institute of Technology in Cambridge, Massachusetts
Carmelites of Mary Immaculate, a religious institute for men in the Syro-Malabar Church, founded in India
Center for Medicare and Medicaid Innovation, an executive branch agency within Centers for Medicare and Medicaid Services
Chartered Management Institute, professional institution for management based in the United Kingdom
Chennai Mathematical Institute, a research and education institute in Chennai, India
Chinese Maritime Institute, a non-profit institute based in the Taipei City, Taiwan
Clay Mathematics Institute, a private, non-profit foundation, based in Providence, Rhode Island
College of the Marshall Islands, a community college
Committee for a Marxist International
Creation Ministries International, a non-profit young Earth creationist organisation
Crisis Management Initiative, an independent, non-governmental organisation based in Helsinki, Finland that works to resolve conflict and to build sustainable peace
Culture and Media Institute, a conservative American non-profit organization
University of Illinois Willard Airport, IATA airport code
Other uses
CMi, International Astronomical Union abbreviation for the constellation Canis Minor
901, written CMI in Roman numerals
Certified Master Inspector
The Curse of Monkey Is |
https://en.wikipedia.org/wiki/Confluence%20%28disambiguation%29 | A confluence is the meeting of two or more bodies of water.
Confluence may also refer to:
Science and technology
Confluence (abstract rewriting), a concept in computer science
Confluence (meteorology)
Confluence (software), team collaboration software from Atlassian
Confluency, a concept in cell culture biology
Places
Confluence, Kentucky, US
Confluence, Pennsylvania, US
La Confluence or simply Confluence, a district of the 2nd arrondissement of Lyon, France
Confluence (shopping mall)
Other uses
Confluence (company), an investment management software company
Confluence (convention), an annual science fiction convention
Confluence (sculpture), Indianapolis, Indiana, US
Confluence: The Journal of Graduate Liberal Studies
Confluence Project Management, consultancy firm commonly known as Confluence
Degree Confluence Project, a web-based volunteer project
See also
Confluent hypergeometric function, a mathematical function
Convergence (disambiguation) |
https://en.wikipedia.org/wiki/Le%20M%C3%A9ridien%20Cyberport%20Hotel | Le Méridien Hong Kong, Cyberport () is a 170-room hotel forming part of the Cyberport digital community development in Hong Kong's Telegraph Bay, in Southern District. It opened in 20 April 2004 and is operated by Le Méridien, a design-focused brand of Marriott International.
Le Méridien was awarded a 10-year management contract for this hotel to be built at the Cyberport complex. The hotel has been listed by British newspaper The Independent as one of the five best "hi-tech hotels".
See also
List of buildings and structures in Hong Kong
References
External links
Le Meridien Cyberport website
Hotels in Hong Kong
Telegraph Bay
Hongkong Land
Hotels established in 2004
Hotel buildings completed in 2004
Southern District, Hong Kong |
https://en.wikipedia.org/wiki/Economic%20statistics | Economic statistics is a topic in applied statistics and applied economics that concerns the collection, processing, compilation, dissemination, and analysis of economic data. It is closely related to business statistics and econometrics. It is also common to call the data themselves "economic statistics", but for this usage, "economic data" is the more common term.
Overview
The data of concern to economic statistics may include those of an economy within a region, country, or group of countries. Economic statistics may also refer to a subtopic of official statistics for data produced by official organizations (e.g. national statistical services, intergovernmental organizations such as United Nations, European Union or OECD, central banks, and ministries).
Analyses within economic statistics both make use of and provide the empirical data needed in economic research, whether descriptive or econometric. They are a key input for decision making as to economic policy. The subject includes statistical analysis of topics and problems in microeconomics, macroeconomics, business, finance, forecasting, data quality, and policy evaluation. It also includes such considerations as what data to collect in order to quantify some particular aspect of an economy and of how best to collect in any given instance.
See also
Business statistics
Econometrics
Survey of production
References
Citations
Sources
Allen, R. G. D., 1956. "Official Economic Statistics," Economica, N.S., 23(92), pp. 360-365.
Crum, W. L., 1925. An Introduction to the Methods of Economic Statistics, AW Shaw Co.
Giovanini, Enrico, 2008. Understanding Economic Statistics. OECD Publishing.
Fox, Karl A., 1968. Intermediate Economic Statistics, Wiley. Description.
Kane, Edward J., 1968. Economic Statistics and Econometrics, Harper and Row.
Morgenstern, Oskar, [1950] 1963. On the Accuracy of Economic Observations. 2nd rev. ed. ("The Accuracy of Economic Observation" ch. 16). Princeton University Press.
Mirer, Thad W., 1995. Economic Statistics and Econometrics, 3rd ed. Prentice Hall. Description.
Persons, Warren M., 1910. "The Correlation of Economic Statistics," Publications of the American Statistical Association, 12(92), pp. 287-322.
Wonnacott, Thomas H., and Ronald J. Wonnacott, 1990. Introductory Statistics for Business and Economics, 4th ed., Wiley.
Ullah, Aman, and David E. A. Giles, ed., 1998. Handbook of Applied Economic Statistics, Marcel Dekker. Description, preview, and back cover.
Zellner, Arnold, ed. 1968. Readings in Economic Statistics and Econometrics, Little, Brown & Co.
Journals
Journal of Business and Economic Statistics
Review of Economics and Statistics (from Review of Economic Statistics, 1919–47)
External links
Economic statistics section United Nations Economic Commission for Europe
Statistics from UCB Libraries GovPubs
Economic statistics: The White House pages on U.S. economic statistics
Historical Financial Statistics: Center for Fina |
https://en.wikipedia.org/wiki/RFM%20%28market%20research%29 | RFM is a method used for analyzing customer value and segmenting customers which is commonly used in database marketing and direct marketing. It has received particular attention in the retail and professional services industries.
RFM stands for the three dimensions:
Recency – How recently did the customer purchase?
Frequency – How often do they purchase?
Monetary Value – How much do they spend?
Core model
Customer purchases may be represented by a table with columns for the customer name, date of purchase and purchase value. There are many approaches to quantitatively defining RFM values, and the best approaches will be dependent on customer journey and business model. One approach to RFM is to assign a score for each dimension on a scale from 1 to 10. The maximum score represents the preferred behavior and a formula could be used to calculate the three scores for each customer. For example, a service-based business could use these calculations:
Recency = 10 – the number of months that have passed since the customer last purchased
Frequency = the maximum of "the number of purchases by the customer in the last 12 months (with a limit of 10)" and 1
Monetary = the highest value of all purchases by the customer expressed in relation to some benchmark value
For example, if the monetary benchmark allocated a score of 10 to annual spend over $500, for a customer who had made three purchases in the last year, the most recent being 3 months ago, and spent $600 in the year, their scores would be: R=7; F=3; M=10. Alternatively, categories can be defined for each attribute, e.g. recency might be broken into three categories: customers with purchases within the last 90 days; between 91 and 365 days; and longer than 365 days. Such categories may be derived from business rules or using data mining techniques to find meaningful breaks.
Once each of the attributes has appropriate categories defined, segments are created from the intersection of the values. If there were three categories for each attribute, then the resulting matrix would have twenty-seven possible combinations. One well-known commercial approach uses five bins per attributes, which yields 125 segments. Companies may also decide to collapse certain subsegments, if the gradations appear too small to be useful. The resulting segments can be ordered from most valuable (highest recency, frequency, and value) to least valuable (lowest recency, frequency, and value). Identifying the most valuable RFM segments can capitalize on chance relationships in the data used for this analysis. For this reason, it is highly recommended that another set of data be used to validate the results of the RFM segmentation process. Advocates of this technique point out that it has the virtue of simplicity: no specialized statistical software is required, and the results are readily understood by business people. In the absence of other targeting techniques, it can provide a lift in response rates for promotions.
|
https://en.wikipedia.org/wiki/Display%20Data%20Channel | The Display Data Channel, or DDC, is a collection of protocols for digital communication between a computer display and a graphics adapter that enable the display to communicate its supported display modes to the adapter and that enable the computer host to adjust monitor parameters, such as brightness and contrast.
Like modern analog VGA connectors, the DVI and DisplayPort connectors include pins for DDC, but DisplayPort only supports DDC within its optional Dual-Mode DP (DP++) feature in DVI/HDMI mode.
The standard was created by the Video Electronics Standards Association (VESA).
Overview
The DDC suite of standards aims to provide Plug and Play and DPMS power management experiences for computer displays.
DDC1 and DDC2B/Ab/B+/Bi protocols are a physical link between a monitor and a video card, which was originally carried on either two or three pins in a 15-pin analog VGA connector.
Extended display identification data (EDID) is a companion standard; it defines a compact binary file format describing the monitor's capabilities and supported graphics modes, stored in a read-only memory (EEPROM) chip programmed by the manufacturer of the monitor. The format uses a description block containing 128 bytes of data, with optional extension blocks to provide additional information. The most current version is Enhanced EDID (E-EDID) Release A, v2.0.
The first version of the DDC standard was adopted in August 1994. It included the EDID 1.0 format and specified DDC1, DDC2B and DDC2Ab physical links.
DDC version 2, introduced in April 1996, split EDID into a separate standard and introduced the DDC2B+ protocol.
DDC version 3, December 1997, introduced the DDC2Bi protocol and support for VESA Plug and Display and Flat Panel Display Interface on separate device addresses, requiring them to comply with EDID 2.0.
The DDC standard has been superseded by E-DDC in 1999.
Physical link
Prior to the DDC, the VGA standard had reserved four pins in the analog VGA connector, known as ID0, ID1, ID2 and ID3 (pins 11, 12, 4 and 15) for identification of monitor type. These ID pins, attached to resistors to pull one or more of them to ground (GND), allowed for the definition of the monitor type, with all open (n/c, not connected) meaning "no monitor".
In the most commonly documented scheme, the ID3 pin was unused and only the 3 remaining pins were defined. The ID0 was pulled to GND by color monitors, while the monochrome monitors pulled ID1 to GND. Finally, the ID2 pulled to GND signaled a monitor capable of 1024×768 resolution, such as IBM 8514. In this scheme, the input states of the ID pins would encode the monitor type as follows:
More elaborate schemes also existed that used all of the 4 ID pins while manipulating the HSync and VSync signals in order to extract 16 bits (4 ID pin values for each of the 4 combinations of HSync and VSync states) of monitor identification.
DDC changed the purpose of the ID pins to incorporate a serial link interface. However |
https://en.wikipedia.org/wiki/Prodigy%20%28online%20service%29 | Prodigy Communications Corporation was an online service from 1984 to 2001 that offered its subscribers access to a broad range of networked services. It was one of the major internet service providers of the 1990s.
The company claimed it was the first consumer online service, citing its graphical user interface and basic architecture as differentiation from CompuServe, which started in 1979 and used a command-line interface. Prodigy was described by the New York Times as "family-oriented" and one of "the Big Three information services" in 1994. By 1990, it was the second-largest online service provider with 465,000 subscribers, trailing only CompuServe's 600,000. In 1993 it was the largest.
In 2001, it was acquired by SBC Communications, which in 2005 became the present iteration of AT&T. The Mexican branch of Prodigy, however, was acquired by Telmex.
Early history
The roots of Prodigy date to 1980 when broadcaster CBS and telecommunications firm AT&T Corporation formed a joint venture named Venture One in Fair Lawn, New Jersey. The company conducted a market test of 100 homes in Ridgewood, New Jersey to gauge consumer interest in a Videotex-based TV set-top device that would allow consumers to shop at home and receive news, sports, and weather. After concluding the market test, CBS and AT&T took the data and went their separate ways in pursuit of developing and profiting from this market demand.
Prodigy was founded on February 13, 1984, as Trintex, a joint venture between CBS, computer manufacturer IBM, and retailer Sears, Roebuck and Company. The company was headed by Theodore Papes, a career IBM executive, until his retirement in 1992. CBS left the venture in 1986 when CBS CEO Tom Wyman was divesting properties outside of CBS's core broadcasting business. The company's service was launched regionally in 1988 in Atlanta, Hartford, and San Francisco under the name Prodigy. The marketing roll-out plan closely followed IBM's Systems Network Architecture (SNA) network backbone. A nationwide launch developed by ad agency J. Walter Thompson and sister company JWT Direct (New York) followed on September 6, 1990.
Initially, subscribers using personal computers accessed the Prodigy service using copper wire telephone "POTS" service or X.25 dialup. Prodigy used 1,200 bit/s modem connections for its initial roll-out. Prodigy offered low-cost 2,400 bit/s internal modems to subscribers at a discount to provide faster service and stabilize the diverse modem market. The host systems used were regionally distributed IBM Series/1 minicomputers managed by central IBM mainframes located in Yorktown Heights, New York.
Thanks to an aggressive media marketing campaign, bundling with various consumer-oriented computers such as IBM's PS/1 and PS/2, as well as various clones and Hayes modems, the Prodigy service soon had more than a million subscribers. To handle the traffic, Prodigy built a national network of POP (points of presence) sites that made loc |
https://en.wikipedia.org/wiki/Paul%20Mockapetris | Paul V. Mockapetris (born 1948 in Boston, Massachusetts, US) is an American computer scientist and Internet pioneer, who invented the Internet Domain Name System (DNS).
Education
Mockapetris graduated from the Boston Latin School in 1966, received his bachelor's degrees in physics and electrical engineering from the Massachusetts Institute of Technology in 1971 and his doctorate in information and computer science from the University of California at Irvine in 1982.
Career
In 1983, he proposed a Domain Name System architecture in RFC 882 and RFC 883. He had recognized the problem in the early Internet (then ARPAnet) of holding name to address translations in a single table on the hosts file of an operating system. Instead he proposed a distributed and dynamic DNS database: essentially DNS as it exists today.
Achievements
Mockapetris is a fellow of the IEEE and the Association for Computing Machinery. He:
joined the Information Sciences Institute (ISI) of the University of Southern California (USC) in 1978, where he:
developed the first SMTP email server,
proposed the DNS architecture in 1983,
wrote the first DNS implementation (called "Jeeves") for the TOPS-20 in 1983,
served as director of the high performance computing and communications division;
was program manager for networking at the Advanced Research Projects Agency (ARPA) of the U.S. Department of Defense from 1990 to 1993;
served as chair of the Research Working Group of the U.S. Federal Networking Council;
served as chair of the Internet Engineering Task Force (IETF) from 1994 to 1996;
was a member of the Internet Architecture Board (IAB) in 1994 and 1995;
worked for several Internet-related companies: employee number two at @Home (1995–1997), Software.com (1997–1998) (now OpenWave), Fiberlane (now Cisco), Cerent/Siara (now Redback Networks) (1998–1999), Urban Media (1999–2001), and NU Domain (from 1999);
was Chief Scientist and chairman of the Board of IP address infrastructure software provider Nominum (1999 to 2016).
is currently Chief Scientist at ThreatSTOP.
Awards
1997 John C. Dvorak Telecommunications Excellence Award "Personal Achievement - Network Engineering" for DNS design and implementation
2002 Distinguished Alumnus award from the University of California, Irvine
2003 IEEE Internet Award for his contributions to DNS
2004 ACM Fellow, for contributions to the Internet, including the development of domain and email protocols.
2005 ACM SIGCOMM Award for lifetime contribution to the field of communication networks in recognition of his foundational work in designing, developing and deploying the Domain Name System, and his sustained leadership in overall Internet architecture development
2006 ACM SIGCOMM Test of Time Paper Award for co-authoring paper "Development of the Domain Name System"
2006 National Academy of Engineering Member
2012 inducted by the Internet Society into the Internet Hall of Fame as an "innovator"
2013 Honoris Causa (honora |
https://en.wikipedia.org/wiki/WRP | WRP may refer to:
Computing
Wireless Routing Protocol, a decentralized method for computer communication
Windows Resource Protection, a feature in some Windows operating systems
Workflow Resource Planning, a class of Enterprise Resource Planning system
Political parties
Wessex Regionalist Party, a minor political party in the United Kingdom
Wildrose Party, a defunct political party in Alberta, Canada
Workers' Revolutionary Party (disambiguation), various political parties
Government programs
Witness relocation program, a US federal program for protecting witnesses
Wetlands Reserve Program, a voluntary US federal program
Workforce Recruitment Program, a US federal recruitment and referral program
Other
Waterloo Regional Police, Ontario, Canada
Warwick Parkway railway station in England
Wrestling Retribution Project, a TV program in the USA
Whitehead Research Project, a group focused on Alfred North Whitehead
Water reclamation plant, a type of facility used to treat wastewater
White Rabbit Project (TV series), a cancelled Netflix show |
https://en.wikipedia.org/wiki/Daniel%20Bernstein | Daniel Bernstein is a composer for video games and movies. Born in Leningrad in the Soviet Union (now part of Russia), he received a B.S. in computer science and an M.A. in music composition from the University of Virginia. Bernstein started in games in 1996 "working in development and sound design". He has also worked as a composer for Monolith Productions where he collaborated with Guy Whitmore on titles such as Blood and Claw. Outside of video games, he also wrote the soundtrack for short movies (Kansas in 1998 and Maid of Honor in 1999).
Changing career, he joined WildTangent as the Director of Product Strategy, and later left in 2002 to create Sandlot Games.
While still acting as Sandlot's CEO, he returned to composition with the soundtrack to The Penitent Man in 2010.
Video game credits
References
External links
Homepage
Video game composers
Monolith Productions people
American company founders
Russian emigrants to the United States
Businesspeople from Saint Petersburg
American technology chief executives
Living people
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Gyro | Gyro may refer to:
Science and technology
GYRO, a computer program for tokamak plasma simulation
Gyro Motor Company, an American aircraft engine manufacturer
Gyrodactylus salaris, a parasite in salmon
Gyroscope, an orientation-stabilizing device
Autogyro, a type of rotary-wing aircraft
Honda Gyro, a family of tilting three wheel vehicles
The casually used brand name of a detangler mechanism, part of a stunt-adapted BMX bicycle
Fictional characters
Gyro Gearloose, a comic book character from Disney's Duck universe
Gyro Zeppeli, one of the main characters of the manga Steel Ball Run
Other uses
Gyro (magazine), student magazine of Otago Polytechnic, New Zealand
Gyro International, a social fraternal organization
Gyroball, a Japanese baseball pitch
Gyro, or gyros, a greek pita wrap or the rotisserie cooked meat it contains
Johnny Gyro, American martial arts instructor and competitive karate fighter
See also
Giro (disambiguation) |
https://en.wikipedia.org/wiki/Sparse%20matrix | In numerical analysis and scientific computing, a sparse matrix or sparse array is a matrix in which most of the elements are zero. There is no strict definition regarding the proportion of zero-value elements for a matrix to qualify as sparse but a common criterion is that the number of non-zero elements is roughly equal to the number of rows or columns. By contrast, if most of the elements are non-zero, the matrix is considered dense. The number of zero-valued elements divided by the total number of elements (e.g., m × n for an m × n matrix) is sometimes referred to as the sparsity of the matrix.
Conceptually, sparsity corresponds to systems with few pairwise interactions. For example, consider a line of balls connected by springs from one to the next: this is a sparse system as only adjacent balls are coupled. By contrast, if the same line of balls were to have springs connecting each ball to all other balls, the system would correspond to a dense matrix. The concept of sparsity is useful in combinatorics and application areas such as network theory and numerical analysis, which typically have a low density of significant data or connections. Large sparse matrices often appear in scientific or engineering applications when solving partial differential equations.
When storing and manipulating sparse matrices on a computer, it is beneficial and often necessary to use specialized algorithms and data structures that take advantage of the sparse structure of the matrix. Specialized computers have been made for sparse matrices, as they are common in the machine learning field. Operations using standard dense-matrix structures and algorithms are slow and inefficient when applied to large sparse matrices as processing and memory are wasted on the zeros. Sparse data is by nature more easily compressed and thus requires significantly less storage. Some very large sparse matrices are infeasible to manipulate using standard dense-matrix algorithms.
Storing a sparse matrix
A matrix is typically stored as a two-dimensional array. Each entry in the array represents an element of the matrix and is accessed by the two indices and . Conventionally, is the row index, numbered from top to bottom, and is the column index, numbered from left to right. For an matrix, the amount of memory required to store the matrix in this format is proportional to (disregarding the fact that the dimensions of the matrix also need to be stored).
In the case of a sparse matrix, substantial memory requirement reductions can be realized by storing only the non-zero entries. Depending on the number and distribution of the non-zero entries, different data structures can be used and yield huge savings in memory when compared to the basic approach. The trade-off is that accessing the individual elements becomes more complex and additional structures are needed to be able to recover the original matrix unambiguously.
Formats can be divided into two groups:
Those that support |
https://en.wikipedia.org/wiki/Bob%20Wallace%20%28computer%20scientist%29 | Bob Wallace (May 29, 1949 – September 20, 2002) was an American software developer, programmer and the ninth Microsoft employee. He was the first popular user of the term shareware, creator of the word processing program PC-Write, founder of the software company Quicksoft and an "online drug guru" who devoted much time and money into the research of psychedelic drugs. Bob ended his Usenet posts with the phrase, "Bob Wallace (just my opinion)."
Biography
Bob Wallace was born in Arlington, Virginia. He first worked on computers as a member of an Explorer Scout troop sponsored by Control Data Corp. in Bethesda, Maryland. His father was an economist who later became Assistant Secretary of the Treasury during the administration of John F. Kennedy.
Beginning in 1967, Wallace attended Brown University, where he worked on the pioneering hypertext File Retrieval and Editing System with Andries van Dam and Ted Nelson. After attending the University of California, Santa Cruz for two years (where he briefly majored in theatre), he received his undergraduate degree (1974) and master's degree (1978) in computer science from the University of Washington.
Wallace worked at the Retail Computer Store in Seattle, where he learned about Microsoft after Bill Gates put up a sign advertising for programmers. He joined Microsoft in 1978 as the 9th employee. His first project was to connect a computer to an IBM Selectric typewriter so the company could print software manuals. He was a key developer of TI BASIC. In the late 1970s, Wallace and Gates were known for their hijinks, and one incident involved breaking into a construction site and driving bulldozers, at one point almost running over Gates's Porsche.
In 1983, Wallace left Microsoft to form Quicksoft and distribute PC-Write using the shareware concept, which he helped originate.
In 1996, Wallace and his wife, Megan Dana-Wallace, started Mind Books, a bookstore that offered publications about psychoactive plants and compounds. In 1998, they started the Promind Foundation, which helped support scientific research, public education, and harm reduction efforts related to psychedelics.
Wallace also served on the Board of Directors for the Heffter Research Institute and helped financially support the most important organizations in the field, including the Multidisciplinary Association for Psychedelic Studies (MAPS), the Heffter Research Institute, Erowid (responsible for half of Erowid's funding from 2000–2002), DanceSafe, the Center for Cognitive Liberty and Ethics, EcstasyData, Black Rock Arts Foundation, and a number of other projects.
He died unexpectedly of pneumonia in San Rafael, California at age 53. On hearing of Wallace's death, Paul Allen was quoted as saying, "I remember Bob as a gentle soul who was soft-spoken, but creative, persistent and meticulous in his programming and thinking."
Northwest Computer Society
The March 1976 issues of Byte magazine had a notice about a new computer club in Seatt |
https://en.wikipedia.org/wiki/Cybercrime | Cybercrime is a type of crime involving a computer or a computer network. The computer may have been used in committing the crime, or it may be the target. Cybercrime may harm someone's security or finances.
Internationally, both state and non-state actors engage in cybercrimes, including espionage, financial theft, and other cross-border crimes. Cybercrimes crossing international borders and involving the actions of at least one nation-state are sometimes referred to as cyberwarfare. Warren Buffett describes cybercrime as the "number one problem with mankind" and said that it "poses real risks to humanity".
A 2014 report sponsored by McAfee estimated that cybercrime had resulted in $445 billion USD in annual damage to the global economy. Approximately $1.5 billion was lost in 2012 to online credit and debit card fraud in the US. In 2018, a study by the Center for Strategic and International Studies (CSIS), in partnership with McAfee, concluded that nearly 1 percent of global gross domestic product (GDP), close to $600 billion, is lost to cybercrime each year. The World Economic Forum 2020 Global Risk Report confirmed that organized cybercrime groups are joining forces to commit criminal activities online, while estimating the likelihood of their detection and prosecution to be less than 1 percent in the US. There are also many privacy concerns surrounding cybercrime when confidential information is intercepted or disclosed, legally or otherwise.
Classifications
Computer crime encompasses a broad range of activities, including computer fraud, financial crimes, scams, cybersex trafficking, and ad fraud.
Computer fraud
Computer fraud is the act of using a computer to take or alter electronic data, or to gain unlawful use of a computer or system. If computer fraud involves the use of the internet, it can be considered Internet fraud. The legal definition of computer fraud varies by jurisdiction, but typically involves accessing a computer without permission or authorization.
Forms of computer fraud include hacking into computers to alter information, distributing malicious code such as computer worms or viruses, installing malware or spyware to steal data, phishing, and advance-fee scams.
Other forms of fraud may be committed using computer systems, including bank fraud, carding, identity theft, extortion, and theft of classified information. These types of crimes often result in the loss of personal or financial information.
Cyberterrorism
Cyberterrorism are acts of terrorism committed through the use of cyberspace or computer resources. Acts of disruption of computer networks and personal computers through viruses, worms, phishing, malicious software, hardware, or programming scripts can all be forms of cyberterrorism.
Government officials and information technology (IT) security specialists have documented a significant increase in network problems and server scams since early 2001. Within the United States, there is an increasing |
https://en.wikipedia.org/wiki/Center%20Parcs%20Europe | Center Parcs Europe N.V. (formerly Center Parcs) is a European network of holiday villages that was founded in the Netherlands in 1968, and is currently operated by Pierre & Vacances and owned by Blackstone Group.
History
Dutch entrepreneur Piet Derksen started a sporting goods shop in 1953 at Lijnbaan, Rotterdam. Its name was 'Sporthuis Centrum', 'Sport House Centre'. It succeeded and Derksen expanded into 17 outlets across the Netherlands, and then added camping articles to the range.
In 1968, Derksen purchased woodland near Reuver so staff and customers could relax in small tents. The park, , was successful, and the tents were quickly replaced by bungalows. In 1987, Center Parcs opened its first UK resort at Sherwood Forest in Nottinghamshire. This brought the company into the sights of expanding brewer Scottish and Newcastle, which later bought the group.
In 2001, the UK locations separated from the continental Europe locations and formed a separate company, Center Parcs UK.
In 2003, Scottish & Newcastle sold the Continental European sites to a joint venture of Pierre & Vacances (P&V) and DBCP, a German investment group. This was given the name Center Parcs Europe (CPE). P&V owned Europe's largest (in terms of bed-count) bungalow-vacation-supplier, Gran Dorado Resorts, a Dutch former joint venture of Vendex, Algemeen Burgerlijk Pensioenfonds, GAK and Philips Rentefonds. P&V brought Gran Dorado in the joint venture.
As CPE was based in Rotterdam, Netherlands, the Dutch and European Commercial Competition Authority did not approve of combining Gran Dorado and Center Parcs, as it would effectively control the European market. After agreeing to a reduction in beds owned, CPE sold all but six Gran Dorado Resorts to Dutch Landal GreenParks. The remaining six parks were added to CenterParcs: Loohorst (NL), Port Zelande (NL), Zandvoort (NL), Weerterbergen (NL), Hochsauerland (D) and Heilbachsee (D).
After the sale, five of the six remaining Gran Dorado Resorts parks were rebranded Sea Spirit from Center Parcs or Free Life from Center Parcs. The Weerterbergen-Resort was sold to Roompot because of the cost of bringing it to standard. All original Center Parcs resorts in the Netherlands, France, Belgium and Germany were sub-branded CP Original. Having completed the integration and rebranding exercise, Pierre & Vacances bought DBCP out of the partnership.
In January 2009, Sunparks launched alongside Center Parcs in Europe, as a low-cost brand. Many of the former Gran Dorado resorts were rebranded in this exercise, but the sub brand was dropped in 2011 and the parks were rebranded to Center Parcs.
Operations and facilities
There are now 26 resorts in the Netherlands, France, Belgium and Germany. Most villages are different, but some villages such as Bispinger Heide in Germany and Domaine Les Bois Francs in France (and many more) share the same Village Plaza design. They have the same styled Aqua Mundo and Sports Plaza. Accommodation is in villas o |
https://en.wikipedia.org/wiki/Netcom | Netcom may refer to:
Army Network Enterprise Technology Command (NETCOM), a Signal command in the U.S. Army Cyber Command
China Netcom, telecom company in mainland China
NetCom (Norway), Telia Norge, Norwegian mobile phone operator
Netcom (United States), an American Internet service provider
Netcom (Mongolia), a backbone network owner and wholesale internet provider in Mongolia |
https://en.wikipedia.org/wiki/Television%20in%20South%20Korea | In South Korea, there are a number of national television networks, the three largest of which are KBS, MBC, and SBS. Most of the major television studios are located on Yeouido and Sangam-dong, Seoul. South Korea became the fourth adopter in Asia when television broadcasting began on 12 May 1956 with the opening of HLKZ-TV, a commercially operated television station. HLKZ-TV was established by the RCA Distribution Company (KORCAD) in Seoul with 186–192 MHz, 100-watt output, and 525 scanning lines.
Important genres of television shows include serial dramas, historical dramas, variety shows, game shows, news programs, and documentaries. All three networks have produced increasingly lavish historical dramas in recent years. Some South Korean television programs are available on satellite and multicultural channels in foreign countries. South Korean television dramas have been widely popular in other East Asian, South Asian and Southeast Asian countries, and became popularized internationally at a later stage, with whole sets of videotapes or DVDs of series available with completed subtitles in different languages, online subtitle websites are also created by numerous fan clubs to cater to a global audience. Shopping channels have become quite popular in recent years as well, and the models sometimes put on entertaining acts during product pitches.
Most cable operators in South Korea were consolidated into 3 major telecommunication companies, KT, SK Telecom, and LG Uplus. They also operates Internet Protocol television services. There are approximately 14 million cable TV subscribers nationwide. The cable operator provides TPS to its subscribers. (with the exception of Arirang which is free).
History
Since the beginning of the 1950s, television was introduced to Korea by RCA to sell second-hand black & white TV sets as a marketing scheme. Some TV sets were strategically set up at Pagoda Park, others at the Seoul Station and Gwanghwamun during this time. However it was not until 1956 when South Korea began its own television broadcasting station, the HLKZ-TV, part of the KORCAD (RCA Distribution Company). The first ever Korean television drama, 천국의 문 (The Gates of Heaven) debuted the same year, planning director Choi Chang-Bong spent two and a half months continuously fixing the script, preparing sets and even the first instance of special effects, all for a drama that lasted no longer than fifteen minutes.
The early 1960s saw a phenomenal growth in television broadcasting. On 1 October 1961 the first full-scale television station, HLKA-TV (now known as KBS 1TV), was established and began operation under the Ministry of Culture and Public Information.
Following KBS was Tongyang Broadcasting Corporation's TBC-TV which was launched in 1964, and ran until merged in 1980. It was the first private television network in South Korea.
The second commercial television system, MBC-TV, made its debut in 1969. The advent of MBC-TV brought significant deve |
https://en.wikipedia.org/wiki/MBC | MBC may refer to:
Broadcasting
Major Broadcasting Cable Network, renamed to Black Family Channel
Malawi Broadcasting Corporation, a Malawian state-run radio company
Manila Broadcasting Company, in the Philippines
Mauritius Broadcasting Corporation, a public broadcaster of the Republic of Mauritius
MBC Networks, Sri Lankan media company
MBC TV (India), Oriya language broadcasting network
MBC Group, Middle Eastern media conglomerate based in the Middle East and North Africa
Missinipi Broadcasting Corporation, a radio network in Canada
Munhwa Broadcasting Corporation, a South Korean commercial broadcaster
MBC TV (South Korean TV channel), a television channel from Seoul, South Korea
Museum of Broadcast Communications, a museum located in Chicago, Illinois
Minaminihon Broadcasting, a Japanese commercial broadcaster
Education
Mary Baldwin College, in Staunton, Virginia, US
Master of Business Communication, an academic degree
Matthew Boulton College, in Birmingham, England
Minneapolis Business College, located in Roseville, Minnesota, US
Morris Brown College, in Atlanta, Georgia, US
Entertainment
Miami Boys Choir, a Jewish contemporary music choir
Monster Buster Club, a 3D animated series created by Mystery Animation and Jetix
Science and technology
4-MBC, 4-methylbenzylidene camphor
MBC-550, a personal computer produced by Sanyo
Main-belt comet
Metastatic breast cancer
Meteor burst communications
Minimum bactericidal concentration
Myoblast city, a Drosophila melanogaster gene
Sports
Manchester Baseball Club, a British baseball club
Midwest Basketball Conference, 1935–1937, changed its name to the National Basketball League
Mitteldeutscher BC, a German basketball club
Other uses
Maidstone Borough Council, the second level local authority for the Borough of Maidstone in Kent, United Kingdom
Makati Business Club, a Filipino private non-stock, non-profit business association
Manado Boulevard Carnaval, an annual fashion carnival in Manado, Indonesia
Mathieu Bock-Côté (born 1980), Canadian academic and writer
Mesoamerican Biological Corridor, an international conservation initiative for biodiversity protection across southern Mexico and Central America
Metropolitan Borough Council, the authority for a type of local government district in England
Michigan Brewing Company, in Webberville, Michigan, United States
Missouri Baptist Convention, a religious organization in the United States
Transports de la région Morges-Bière-Cossonay, a transport company in Switzerland
Mutual Benefits Corporation, an investment sales company that operated a huge ponzi scheme |
https://en.wikipedia.org/wiki/One%20Life%20to%20Live | One Life to Live (often abbreviated as OLTL) is an American soap opera broadcast on the ABC television network for more than 43 years, from July 15, 1968, to January 13, 2012, and then on the internet as a web series on Hulu and iTunes via Prospect Park from April 29 to August 19, 2013. Created by Agnes Nixon, the series was the first daytime drama to primarily feature ethnically and socioeconomically diverse characters and consistently emphasize social issues. One Life to Live was expanded from 30 minutes to 45 minutes on July 26, 1976, and then to an hour on January 16, 1978.
One Life to Live heavily focuses on the members and relationships of the Lord family. Actress Erika Slezak began portraying the series' central protagonist Victoria Lord in March 1971 and played the character continuously for the rest of the show's run on ABC Daytime, winning a record six Daytime Emmy Awards for the role. In 2002, the series won an Emmy for Outstanding Drama Series. One Life to Live was the last American daytime soap opera taped in New York City.
After nearly 43 years on the air, ABC canceled One Life to Live on April 14, 2011. On July 7, 2011, production company Prospect Park announced that it would continue the show as a web series after its run on ABC, but later suspended the project. The show taped its final scenes for ABC on November 18, 2011, and its final episode on the network aired on January 13, 2012, with a cliffhanger.
On January 7, 2013, Prospect Park resumed its plan to continue One Life to Live as a daily 30-minute web series on Hulu and iTunes via The Online Network. The relaunched series premiered on April 29, 2013. The new series was plagued with several behind-the-scenes problems, most notably a litigation between Prospect Park and ABC regarding the misuse of One Life to Live characters on General Hospital. On September 3, 2013, Prospect Park suspended production of the series until the lawsuit with ABC was resolved.
Creation
Impressed with the ratings success of NBC's Another World, ABC sought out Another World writer Nixon to create a serial for them. Though Nixon's concept for the new series was "built along the classic soap formula of a rich family and a poor family," she was "tired of the restraints imposed by the WASPy, noncontroversial nature of daytime drama." One Life to Live would emphasize "the ethnic and socioeconomic diversity" of the characters in its fictional setting. Nixon would go on to create All My Children in 1970 and Loving in 1983.
The initial main titles of the series featured the image of a roaring fireplace, a visual representation of the originally proposed title — Between Heaven and Hell — ultimately changed to One Life to Live to avoid controversy. One Life to Live first sponsor was the Colgate-Palmolive company, who also sponsored The Doctors. ABC bought the show from Nixon in December 1974 when they purchased all stock to her Creative Horizons, Inc. The show was originally a half-hour serial until |
https://en.wikipedia.org/wiki/Network%2010 | Network 10 (commonly known as the 10 Network, Channel 10 or simply 10) is an Australian commercial television network owned by Ten Network Holdings, a division of the Paramount Networks UK & Australia subsidiary of Paramount Global. One of five national free-to-air networks, 10's owned-and-operated stations can be found in the state capital cities of Sydney, Melbourne, Brisbane, Adelaide and Perth while affiliates extend the network to regional areas of the country.
Since 2022, Network 10 is usually the fourth-rated television network and primary channel in Australia, behind the Seven Network, Nine Network and ABC TV. Occasionally, SBS TV beats Ten in the ratings, pushing it into fifth position.
History
Origins
From the introduction of TV in 1956 until 1965 there were three television networks in Australia, the National Television Network (now the Nine Network), the Australian Television Network (now the Seven Network), and the public ABC National Television Service (now ABC TV). In the early 1960s, the Australian Government began canvassing the idea of licensing a third commercial television station in each capital city. This decision was seen by some as a way for the government to defuse growing public dissatisfaction with the dominance of imported overseas programming and the paucity of local content. The first of these third licences was granted to United Telecasters (a consortium of Amalgamated Wireless, Colonial Sugar Refining Company, Email, Bank of New South Wales and the NRMA) on 4 April 1963.
Structurally, the Australian television industry was closely modelled on the two-tiered system that had been in place in Australian radio since the late 1930s. One tier consisted of a network of publicly funded television stations run by the ABC, which was funded by government budget allocation and (until 1972) by fees from television viewer licences. The second tier consisted of the commercial networks and independent stations owned by private operators, whose income came from selling advertising time.
Launch
The network was launched as ATV-0 in Melbourne opened on 1 August 1964 and was owned by the Ansett Transport Industries, which at the time owned one of Australia's two domestic airlines. TEN-10 in Sydney, which opened on 5 April 1965, was originally owned by United Telecasters, which also in July that year opened TVQ-0 in Brisbane. Also opened later that month was SAS-10, serving the city of Adelaide.
The new television network was initially dubbed the Independent Television System or ITS, but in 1970 adopted the title The 0-10 Network, which reflected the channels used by the first two stations launched in the group, ATV and TEN.
Melbourne's ATV was the first station of the network to stage colour broadcasts in 1967, the broadcast was that of the horse races in Pakenham, Victoria, which was seen by network and RCA executives and invited members of the media and press. This would be the first of many test colour telecasts for the stati |
https://en.wikipedia.org/wiki/End-of-file | In computing, end-of-file (EOF) is a condition in a computer operating system where no more data can be read from a data source. The data source is usually called a file or stream.
Details
In the C standard library, the character reading functions such as getchar return a value equal to the symbolic value (macro) EOF to indicate that an end-of-file condition has occurred. The actual value of EOF is implementation-dependent and must be negative (but is commonly −1, such as in glibc). Block-reading functions return the number of bytes read, and if this is fewer than asked for, then the end of file was reached or an error occurred (checking of errno or dedicated function, such as ferror is required to determine which).
EOF character
Input from a terminal never really "ends" (unless the device is disconnected), but it is useful to enter more than one "file" into a terminal, so a key sequence is reserved to indicate end of input. In UNIX the translation of the keystroke to EOF is performed by the terminal driver, so a program does not need to distinguish terminals from other input files. By default, the driver converts a Control-D character at the start of a line into an end-of-file indicator. To insert an actual Control-D (ASCII 04) character into the input stream, the user precedes it with a "quote" command character (usually Control-V). AmigaDOS is similar but uses Control-\ instead of Control-D.
In DOS and Windows (and in CP/M and many DEC operating systems such as the PDP-6 monitor, RT-11, VMS or TOPS-10), reading from the terminal will never produce an EOF. Instead, programs recognize that the source is a terminal (or other "character device") and interpret a given reserved character or sequence as an end-of-file indicator; most commonly this is an ASCII Control-Z, code 26. Some MS-DOS programs, including parts of the Microsoft MS-DOS shell (COMMAND.COM) and operating-system utility programs (such as EDLIN), treat a Control-Z in a text file as marking the end of meaningful data, and/or append a Control-Z to the end when writing a text file. This was done for two reasons:
Backward compatibility with CP/M. The CP/M file system (and also the original 8-bit FAT implemented in Microsoft BASIC) only recorded the lengths of files in multiples of 128-byte "records", so by convention a Control-Z character was used to mark the end of meaningful data if it ended in the middle of a record. The FAT12 filesystem introduced with 86-DOS and MS-DOS has always recorded the exact byte-length of files, so this was never necessary on DOS.
It allows programs to use the same code to read input from both a terminal and a text file.
In the ANSI X3.27-1969 magnetic tape standard, the end of file was indicated by a tape mark, which consisted of a gap of approximately 3.5 inches of tape followed by a single byte containing the character 13 (hex) for nine-track tapes and 17 (octal) for seven-track tapes. The end-of-tape, commonly abbreviated as EOT, was indicated by t |
https://en.wikipedia.org/wiki/Howard%20H.%20Aiken | Howard Hathaway Aiken (March 8, 1900 – March 14, 1973) was an American physicist and a pioneer in computing, being the original conceptual designer behind IBM's Harvard Mark I computer.
Biography
Aiken studied at the University of Wisconsin–Madison and later obtained his Ph.D. in physics at Harvard University in 1939. During this time, he encountered differential equations that he could only solve numerically. Inspired by Charles Babbage's difference engine, he envisioned an electro-mechanical computing device that could do much of the tedious work for him. This computer was originally called the ASCC (Automatic Sequence Controlled Calculator) and later renamed Harvard Mark I. With engineering, construction, and funding from IBM, the machine was completed and installed at Harvard in February 1944. Richard Milton Bloch, Robert Campbell and Grace Hopper joined the project later as programmers. In 1947, Aiken completed his work on the Harvard Mark II computer. He continued his work on the Mark III and the Harvard Mark IV. The Mark III used some electronic components and the Mark IV was all-electronic. The Mark III and Mark IV used magnetic drum memory and the Mark IV also had magnetic-core memory.
Aiken accumulated honorary degrees at the University of Wisconsin, Wayne State University and Technische Hochschule, Darmstadt. He was elected a Fellow of the American Academy of Arts and Sciences in 1947. He received the University of Wisconsin–Madison College of Engineering Engineers Day Award in 1958, the Harry H. Goode Memorial Award in 1964, the Golden Plate Award of the American Academy of Achievement in 1965, the John Price Wetherill Medal in 1964, and the IEEE (Institute of Electrical and Electronics Engineers) Edison Medal in 1970 "For a meritorious career of pioneering contributions to the development and application of large-scale digital computers and important contributions to education in the digital computer field."
In addition to his work on the Mark series, another important contribution of Aiken's was the introduction of a master's program for computer science at Harvard in 1947, nearly a decade before the programs began to appear in other universities. This became a starting ground to future computer scientists, many of whom did doctoral dissertations under Aiken.
Personal life
Howard Aiken was born to Daniel Aiken and Margaret Emily Mierisch and married three times: to Louise Mancill in June 1937, then later to Agnes Montgomery, and lastly to Mary McFarland. He had two children; one with his first wife, and one with his second.
Howard Aiken was also a Commander in the United States Navy Reserve.
After he retired at age 60 to Fort Lauderdale, Florida, Aiken continued his contributions to technology. He founded Howard Aiken Industries Incorporated, which was a consulting firm that helped failing businesses recover. During his years in Florida, he joined the University of Miami as a Distinguished Professor of Information. In addition |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.