source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Flicker%20%28screen%29 | Flicker is a visible change in brightness between cycles displayed on video displays. It applies to the refresh interval on cathode ray tube (CRT) televisions and computer monitors, as well as plasma computer displays and televisions.
Occurrence
Flicker occurs on CRTs when they are driven at a low refresh rate, allowing the brightness to drop for time intervals sufficiently long to be noticed by a human eye – see persistence of vision and flicker fusion threshold. For most devices, the screen's phosphors quickly lose their excitation between sweeps of the electron gun, and the afterglow is unable to fill such gaps – see phosphor persistence. A refresh rate of 60 Hz on most screens will produce a visible "flickering" effect. Most people find that refresh rates of 70–90 Hz and above enable flicker-free viewing on CRTs. Use of refresh rates above 120 Hz is uncommon, as they provide little noticeable flicker reduction and limit available resolution.
Flatscreen plasma displays have a similar effect. The plasma pixels fade in brightness between refreshes.
In LCD screens, the LCD itself does not flicker, it preserves its opacity unchanged until updated for the next frame. However, in order to prevent accumulated damage LCDs quickly alternate the voltage between positive and negative for each pixel, which is called 'polarity inversion'. Ideally, this wouldn't be noticeable because every pixel has the same brightness whether a positive or a negative voltage is applied. In practice, there is a small difference, which means that every pixel flickers at about 30 Hz. Screens that use opposite polarity per-line or per-pixel can reduce this effect compared to when the entire screen is at the same polarity, sometimes the type of screen is detectable by using patterns designed to maximize the effect.
More of a concern is the LCD backlight. Earlier LCDs used fluorescent lamps which flickered at 100–120 Hz; newer fluorescently backlit LCDs use an electronic ballast that flickers at 25–60 kHz which is far outside the human perceptible range, and LED backlights have no inherent need to flicker at all. On top of any inherent backlight flicker, most fluorescent and LED backlight designs use digital PWM for some or all of their dimming range by switching on and off at rates from several kHz to as little as 180 Hz, though some flicker-free designs using true analog DC dimming exist.
Flicker is necessary for a film-based movie projector to block the light as the film is moved from one frame to the next. The standard framerate of 24 fps produces very obvious flicker, so even very early movie projectors added additional vanes to the rotating shutter to block light even when the film was not moving. Most common is 3 vanes raising the rate to 72 Hz. Home film movie projectors (and early theater projectors) often have four vanes, to raise the 18 fps used by silent film to 72 Hz. Video projectors typically use either LCDs which operate similarly to their desktop counterpar |
https://en.wikipedia.org/wiki/Generic%20Routing%20Encapsulation | Generic Routing Encapsulation (GRE) is a tunneling protocol developed by Cisco Systems that can encapsulate a wide variety of network layer protocols inside virtual point-to-point links or point-to-multipoint links over an Internet Protocol network.
Example uses
In conjunction with PPTP to create VPNs.
In conjunction with IPsec VPNs to allow passing of routing information between connected networks.
In mobility management protocols.
In A8/A10 interfaces to encapsulate IP data to/from Packet Control Function (PCF).
Linux and BSD can establish ad-hoc IP over GRE tunnels which are interoperable with Cisco equipment.
Distributed denial of service (DDoS) protected appliance to an unprotected endpoint.
Example protocol stack
Based on the principles of protocol layering in OSI, protocol encapsulation, not specifically GRE, breaks the layering order. It may be viewed as a separator between two different protocol stacks, one acting as a carrier for another.
Delivery protocols
GRE packets that are encapsulated within IP directly, use IP protocol type 47 in the IPv4 header's Protocol field or the IPv6 header's Next Header field.
For performance reasons, GRE can also be encapsulated in UDP packets. Better throughput may be achieved by using Equal-cost multi-path routing.
Packet header
Extended GRE packet header (RFC 2890)
The extended version of the GRE packet header is represented below:
{| class="wikitable" style="text-align: center"
|+Extended GRE header format
|-
!style="border-bottom:none; border-right:none;"|Offsets
!style="border-left:none;"|Octet
!colspan="8"|0
!colspan="8"|1
!colspan="8"|2
!colspan="8"|3
|-
!style="border-top: none"|Octet
!Bit
!style="width:2.75%;"|0
!style="width:2.75%;"|1
!style="width:2.75%;"|2
!style="width:2.75%;"|3
!style="width:2.75%;"|4
!style="width:2.75%;"|5
!style="width:2.75%;"|6
!style="width:2.75%;"|7
!style="width:2.75%;"|8
!style="width:2.75%;"|9
!style="width:2.75%;"|10
!style="width:2.75%;"|11
!style="width:2.75%;"|12
!style="width:2.75%;"|13
!style="width:2.75%;"|14
!style="width:2.75%;"|15
!style="width:2.75%;"|16
!style="width:2.75%;"|17
!style="width:2.75%;"|18
!style="width:2.75%;"|19
!style="width:2.75%;"|20
!style="width:2.75%;"|21
!style="width:2.75%;"|22
!style="width:2.75%;"|23
!style="width:2.75%;"|24
!style="width:2.75%;"|25
!style="width:2.75%;"|26
!style="width:2.75%;"|27
!style="width:2.75%;"|28
!style="width:2.75%;"|29
!style="width:2.75%;"|30
!style="width:2.75%;"|31
|-
!0
!0
|C
|
|K
|S
|colspan="9"|Reserved 0
|colspan="3"|Version
|colspan="16"|Protocol Type
|-
!4
!32
|colspan="16"|Checksum (optional)
|colspan="16"|Reserved 1 (optional)
|-
!8
!64
|colspan="32"|Key (optional)
|-
!12
!96
|colspan="32"|Sequence Number (optional)
|}
C (1 bit) Checksum bit. Set to 1 if a checksum is present.
K (1 bit) Key bit. Set to 1 if a key is present.
S (1 bit) Sequence number bit. Set to 1 if a sequence number is present.
Reserved 0 (9 bits) Reserved bits; set to 0.
Version (3 bits) GRE Versio |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20South%20Dakota | The following is a list of FCC-licensed radio stations in the U.S. state of South Dakota, which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
Defunct
KABR
KAWK
References
South Dakota |
https://en.wikipedia.org/wiki/List%20of%20programs%20broadcast%20by%20Global%20Television%20Network | This is a list of television programs currently, formerly, and soon to be broadcast by the Global Television Network, a national broadcast network owned by Corus Entertainment.
Current programming
Original series
Drama series
Departure (2020)
Family Law (2021)
Robyn Hood (2023)
Reality/documentary series
Big Brother Canada (2015)
Crime Beat
Crime Beat: Most Wanted (2023)
Driving Television (2003)
The Fish'n Canada Show
Fishful Thinking
Powerboat Television
News programming
Global News Morning (2001)
Global National (2001)
The Morning Show (2013)
The New Reality (2020)
The West Block (2011)
Canadian content reruns
Big Food Bucket List
Border Security: Canada's Front Line (2016)
Buying and Selling (2023)
Carnival Eats
Disaster DIY
Donut Showdown
Fire Masters (2020–21; 2023)
Great Chocolate Showdown
Holmes Makes It Right
Income Property (2020)
Island of Bryan
Masters of Flip
Private Eyes (2016)
Property Brothers
Property Brothers: Forever Home (2023)
Ransom (2017)
Rust Valley Restorers (2020–21; 2023)
Salvage Kings
Save My Reno (2020)
Trading Up With Mandy Rennehan
Worst to First
American series
Upcoming programming
Comedies
Poppa's House (TBA)
Game shows
Raid the Cage (October 13, 2023)
Formerly broadcast by Global
News programming
16x9 (November 30, 2008 – June 28, 2016)
20/20 (1978–2003)
60 Minutes More (1999–2000)
A Current Affair (1993–1996)
Canada Tonight (2001)
Entertainment Desk
Entertainment Tonight Canada (2005–2023)
Global Sunday (2001–2005)
Science International/What Will They Think of Next! (1976—1979)
Talk shows
100 Huntley Street (1977–2018)
The Arsenio Hall Show (1993–1994)
Context with Lorna Dueck
The Doctors (2010–2019)
The Great Debate (1974–1975)
Hot Ones (2019–2022)
The Jerry Springer Show
Karamo (2022–2023)
The Late Late Show with Craig Ferguson
The Late Late Show With Craig Kilborn (September 2000 to August 2004, transferred to CH system at a later point)
Late Night with Conan O'Brien (1993)
Late Night with David Letterman (1985–1993)
Leeza
A Little Late with Lilly Singh (2019–21)
The Meredith Vieira Show
The Mike Bullard Show
The Queen Latifah Show (September 16, 2013-September 5, 2014)
Rachael Ray (2014–2023)
Sneaker Shopping (2019–2022)
The Test (Sept 2013-May 2014)
The Tonight Show Starring Johnny Carson
The Tonight Show with Jay Leno
TV's Bloopers & Practical Jokes
Witness to Yesterday (1974)
Comedy programming
Canadian programs
Bob and Margaret
The Jane Show
Shhh It's The News (1974)
Second City TV (1976-1980)
Super Dave (1988–1994)
Foreign programs
3rd Rock from the Sun (1996–2001)
A to Z (December 9, 2015–January 22, 2015)
Abby's (2019)
About a Boy (February 22, 2014–February 20, 2015)
Alice
Allen Gregory (2011)
America 2-Night (1978–1980)
American Dad! (2005-2018)
Angel from Hell
Any Day Now (1999–2000)
A.P. Bio (2018–2019)
Are You Being Served?
Are You There, Chelsea? (2012)
Arrested Development (2003–2006)
Ba |
https://en.wikipedia.org/wiki/GFA%20BASIC | GFA BASIC is a dialect of the BASIC programming language, by Frank Ostrowski. The name is derived from the company ("GFA Systemtechnik GmbH"), which distributed the software. In the mid-1980s to the 1990s it enjoyed popularity as an advanced BASIC dialect, but has been mostly superseded by several other programming languages. Official support ended in the early 2000s.
History
GFA BASIC was developed by Frank Ostrowski at "GFA Systemtechnik GmbH" (later "GFA Software"), a German company in Kiel and Düsseldorf, as a proprietary version of his free BASIC implementation, Turbo-Basic XL. GFA is an acronym for "Gesellschaft für Automatisierung" ("Company for Automation"), which gave name to the software. The first GFA BASIC version was released in 1986. In the mid and late 1980s it became very popular for the Atari ST home computer range, since the Atari ST BASIC shipped with them was more primitive. Later, ports for the Commodore Amiga, DOS and Windows were marketed. Version 2.0 was the most popular release of GFA BASIC as it offered then many more advanced features compared to alternatives. GFA BASIC 3.0 included further improvements like support for user-defined structures and other agglomerated data types. The final released version was 3.6. Around 2002 GFA software ceased all GFA BASIC activities and shut down the mailinglist and website in 2005. Due to missing official support and availability of GFA BASIC the user community took over the support and an installed an own communication infrastructure.
Features and functionality
As of version 2.0, the most popular release, GFA BASIC was a very modern programming language for its time. Line numbers were not used and one line was equivalent to one command. To greatly simplify maintenance of long listings, the IDE later even allowed for code folding. It had a reasonable range of structured programming commands — procedures with local variables and parameter passing by value or reference, loop constructs, etc. Modularization was only rudimentary, making GFA BASIC 2.0 best suited for small and medium-sized projects.
The GFA BASIC interpreter is compact and reasonably fast, and was shipped with a runtime that could be distributed freely with one's programs. When a compiler was made available, execution speed could be increased by approximately a factor of 2. GFA BASIC allowed extreme optimisations for execution speed, supporting some direct assembler-level calls, and even the ability to embed sections of assembler code directly within the BASIC source code. GFA BASIC integrated neatly into GEM and TOS, the Atari ST's operating system, providing menus, dialog boxes, and mouse control. (See WIMP interface.)
Although the source code was usually stored in a tokenized version to save room on disk, pieces of code could also be saved in ASCII form, and as such made it possible to set up reusable libraries. The tokenized source files were a benefit in other ways too — for instance, GFA BASIC allowed users |
https://en.wikipedia.org/wiki/Shell%20account | A shell account is a user account on a remote server, traditionally running under the Unix operating system, which gives access to a shell via a command-line interface protocol such as telnet, SSH, or over a modem using a terminal emulator.
Shell accounts were made first accessible to interested members of the public by Internet Service Providers (such as Netcom (USA), Panix, The World and Digex), although in rare instances individuals had access to shell accounts through their employer or university. They were used for file storage, web space, email accounts, newsgroup access and software development. Before the late 1990s, shell accounts were often much less expensive than full net access through SLIP or PPP, which was required to access the then-new World Wide Web. Most personal computer operating systems also lacked TCP/IP stacks by default before the mid-1990s. Products such as The Internet Adapter were devised that could work as a proxy server, allowing users to run a web browser for the price of a shell account.
Shell providers are often found to offer shell accounts at low-cost or free. These shell accounts generally provide users with access to various software and services including compilers, IRC clients, background processes, FTP, text editors (such as nano) and email clients (such as pine). Some shell providers may also allow tunneling of traffic to bypass corporate firewalls.
See also
Bulletin board system
FreeBSD jail
Free-net
SDF Public Access Unix System, one of the oldest and largest non-profit public access UNIX systems on the Internet.
Slirp, a free software application similar to The Internet Adapter
SSH tunneling
The Big Electric Cat was a public access computer system in New York City in the late 1980s, known on Usenet as node dasys1.
The Internet Adapter, a graphical application front end for internet access using shell accounts allowing TCP/IP-based applications such as Netscape to run over the shell account.
The WELL, best known for its Internet forums, but also provides email, shell accounts, and web pages.
References
External links
Shell providers list
Internet hosting
Unix |
https://en.wikipedia.org/wiki/Toshiba%20Libretto | The Libretto (Italian for "booklet") is a line of subnotebook computers that was designed and produced by Toshiba. The line was distinguished by its combination of functionality and small size, squeezing a full Windows PC into a device the size of a paperback book. The first Libretto model, the Libretto 20, was released on April 17, 1996 (in Japan only), with a volume of and weighing just , making it by far, the world's smallest commercially available Windows PC at the time, and a trend the Libretto Range continued for many years. The original Libretto line was discontinued in Europe and the U.S. in 1999, but the production continued in Japan with the SS, FF and then the L series until 2002. The first L series Libretto (The L1) was released on 18 May 2001 (in Japan only) and the last (The L5) just 11 Months later on 24 April 2002. Production of all Librettos ceased from 2002 until the release of the Libretto U100 in 2005.
It was a further five years before the Libretto returned again in 2010 with the limited-edition W100 model, a dual-screen tablet.
Models
There were many different models. The first Libretto models, the L20 & L30 used 486 processors from Advanced Micro Devices (AMD) and were only available in Japan (although the L30 was also assembled and marketed in South Korea under the Comos Brand name). Beginning with the Libretto 50, Toshiba used the Intel Pentium and later Pentium MMX processors. With the introduction of the L series in 2001, a move was made to the Transmeta Crusoe processor. The U100 of 2005 saw a return to Intel with the use of the Pentium M processor.
The following models were available:
In 2001, Toshiba released the L series range of Librettos. This was the first major change of footprint since the range was first introduced and represented a significant improvement in performance over the previous models, however it also represented a significant increase in overall size. The L series had moved the Libretto range away from what was a UMPC, to that of an early Netbook.
The L1 had built-in USB and IEEE1394 Firewire. The L2 dropped the IEEE1394 in favor of an Ethernet port. The L5 was optionally available with built-in Wifi 802.11b. All models featured a widescreen display with the unusual resolution of 1280×600 pixels.
Like the majority of Librettos models produced, the L series were not officially available outside Japan.
In 2005, Toshiba announced a new model, the Libretto U100:
All three of the above were essentially the same machine but with different options. The U100 was available in Europe in these variants:
30 GB HDD (with Win XP Home)
60 GB HDD (with XP Pro), both versions included the DVD dock
In Japan the clock speed was only 1.1 GHz
In some markets the DVD dock was an optional or bundled accessory
In 2010, Toshiba announced a new Tablet Libretto model, the W100:
The W100 was released in August 2010, as a limited-edition model and was only available for a short time. It was available in both E |
https://en.wikipedia.org/wiki/GenBank | The GenBank sequence database is an open access, annotated collection of all publicly available nucleotide sequences and their protein translations. It is produced and maintained by the National Center for Biotechnology Information (NCBI; a part of the National Institutes of Health in the United States) as part of the International Nucleotide Sequence Database Collaboration (INSDC).
GenBank and its collaborators receive sequences produced in laboratories throughout the world from more than 500,000 formally described species. The database started in 1982 by Walter Goad and Los Alamos National Laboratory. GenBank has become an important database for research in biological fields and has grown in recent years at an exponential rate by doubling roughly every 18 months.
Release 250.0, published in June 2022, contained over 17 trillion nucleotide bases in more than 2,45 billion sequences. GenBank is built by direct submissions from individual laboratories, as well as from bulk submissions from large-scale sequencing centers.
Submissions
Only original sequences can be submitted to GenBank. Direct submissions are made to GenBank using BankIt, which is a Web-based form, or the stand-alone submission program, Sequin. Upon receipt of a sequence submission, the GenBank staff examines the originality of the data and assigns an accession number to the sequence and performs quality assurance checks. The submissions are then released to the public database, where the entries are retrievable by Entrez or downloadable by FTP. Bulk submissions of Expressed Sequence Tag (EST), Sequence-tagged site (STS), Genome Survey Sequence (GSS), and High-Throughput Genome Sequence (HTGS) data are most often submitted by large-scale sequencing centers. The GenBank direct submissions group also processes complete microbial genome sequences.
History
Walter Goad of the Theoretical Biology and Biophysics Group at Los Alamos National Laboratory (LANL) and others established the Los Alamos Sequence Database in 1979, which culminated in 1982 with the creation of the public GenBank. Funding was provided by the National Institutes of Health, the National Science Foundation, the Department of Energy, and the Department of Defense. LANL collaborated on GenBank with the firm Bolt, Beranek, and Newman, and by the end of 1983 more than 2,000 sequences were stored in it.
In the mid 1980s, the Intelligenetics bioinformatics company at Stanford University managed the GenBank project in collaboration with LANL. As one of the earliest bioinformatics community projects on the Internet, the GenBank project started BIOSCI/Bionet news groups for promoting open access communications among bioscientists. During 1989 to 1992, the GenBank project transitioned to the newly created National Center for Biotechnology Information (NCBI).
Growth
The GenBank release notes for release 250.0 (June 2022) state that "from 1982 to the present, the number of bases in GenBank has doubled approximately every 18 |
https://en.wikipedia.org/wiki/Accession%20number | Accession number may refer to:
Accession number (bioinformatics), a unique identifier given to a biological polymer sequence (DNA, protein) when it is submitted to a sequence database
Accession number (cultural property), a unique identifier assigned to each acquisition of a library or museum |
https://en.wikipedia.org/wiki/List%20of%20movie%20television%20channels | Movie channels are television specialty channels that present film content.
Popular movie channels:
AMC Networks
AMC
Europa Europa (Latin America)
Film & Arts (Latin America)
IFC (United States and Canada)
SundanceTV (United States)
Legend (United Kingdom) part of the CBS-AMC Networks UK Channels Partnership
Aruj TV (Pakistan)
Aflam TV (Morocco)
Al Hayat Cinema (Egypt)
Al Bait Baitak Cinema (Egypt)
Al Masraweya Cinema (Egypt)
Al Nahar Movies (Egypt)
Al Nahar Cinema (Egypt)
Amazon/MGM
MGM HD (United States)
MGM+ (United States)
This TV (United States)
ART
ART Aflam 1 (MENA)
ART Aflam 2 (MENA)
ART Cinema (MENA)
ART Movies (North America, Asia-Pacific and Australia)
Astro Malaysia Holdings
Astro Citra (Malaysia & Brunei)
Astro Premier (Malaysia & Brunei)
Astro Vellithirai (Malaysia & Brunei)
Cima (Egypt)
beIN Media Group
beIN MOVIES Premium HD (MENA)
beIN MOVIES Action HD (MENA)
beIN MOVIES Drama HD (MENA)
beIN MOVIES Family HD (MENA)
BRTV Film (China)
Bioskop Indonesia (Indonesian)
Canal+ Group
Canal+ Box Office (France)
Canal+ Cinéma(s) (France & Africa)
Canal+ Film (Poland)
Canal+ Grand Écran (France)
Canal+ Zat Lenn (Myanmar)
Ciné+ (France & Africa)
Canal Hollywood (Portugal and Spain)
CBS Europa
CBH Cinema (Egypt)
CCTV-6 (China)
CME
bTV Cinema (Bulgaria)
Nova Cinema (Czech Republic)
Pro Cinema (Romania)
Cine34 (Italy)
CINE.AR (Argentina)
Cine Mo! (Philippines)
Cinelatino (United States)
Cinema1 (Pakistan)
Cinema One (Philippines)
Cairo Cinema (Egypt)
Cinema 1 (MENA)
Cinema 2 (MENA)
Cinema Pro (Egypt)
CinemaWorld (Singapore, Taiwan, Malaysia, Indonesia, Philippines, Vietnam, China and Sri Lanka)
Citra Bioskop (Indonesian)
Cosmote Cinema (Greece)
Comcast/Sky
Sky Cinema (Italy)
Sky Cinema (United Kingdom)
Sky Cinema (Germany)
Sky Showtime (Scandinavian)
Culver Max Entertainment
Sony Max (India)
Sony Max 2 (India)
Sony Pix (India)
Sony Wah (India)
De Película (various countries)
DM Dhoom (Pakistan)
Darbaka Aflam (Egypt)
Darbaka Cinema (Egypt)
Diema (Bulgaria)
Disney
Fox Movies
MENA
Portugal
FXM (United States)
LMN (United States)
STAR Movies (Philippines, MENA, China, Vietnam and India)
UTV (India)
UTV Action (India)
UTV Movies (India)
DTV Cinéma (Algeria)
Emax (Pakistan)
El Sobki Cinema (Egypt)
Escape (United States)
Falak TV (Pakistan)
Film+ (Hungary)
Film1 (Netherlands)
Film4
Hungary
United Kingdom
Filmcafe
Film Mánia
Filmazia (Pakistan)
Film Now (Romania)
FilmBox (European & United States)
Filmbox (MENA)
Film World (Pakistan)
For you (Italy)
Fox Corporation
Movies! (United States)
FLiK (Indonesian)
Foxtel Movies (Australia)
Go3 Films (Baltics)
Grit (United States)
Hallmark Movies & Mysteries (United States)
HunanTV Movie Channel (China)
HDNet Movies (United States)
I Heart Movies (Philippines)
IFilm (Iran)
IRIB Namayesh (Iran)
Iris (Italy)
J&T Enterprise
CS Film (Czech Republic & Slovakia)
CS Horor (Czech Republic & Slovakia)
JOJ Cinema (Czech Republic & Slov |
https://en.wikipedia.org/wiki/Men%27s%20interest%20channel | A men's interest channel generally refers to either a television station, network or specialty channel that targets men as its main demographic; offering programs that appeal to the male population.
There are two types of male interest channels: general interest and niche interest.
General interest
General interest men's channels are television channels that contain programming from diverse genres and categories that will appeal to the male population including films, lifestyle series, dramatic and action series, reality series, talk shows and more on varying topics including but unlimited to cooking, travel, cars, sex, sports and more.
Examples of general interest male channels
5Action (UK, rebranded by Channel 5 to take on the Paramount-owned Paramount Network name)
6'eren (Denmark)
7mate (Australia)
9Rush (Australia)
10 Bold (Australia)-owned by Paramount
Bravo (UK, defunct)
BTV (Lithuania)
bTV Action (Bulgaria)
Cine Mo! (Philippines)
DMAX (EMEA)-owned by WBD
Duo 5 (Estonia)
EGO (Israel, defunct)
Energy (Spain)
FX (Latin America)
Grit (United States)
Heroes & Icons (United States)
His TV (Hong Kong, defunct)
Italia 2 (Italy)
ITV4 (UK)
Jack City (Philippines, defunct)
Kanal 9 (Sweden)
Kutonen (Finland)
Play6 (Belgium)
JOJ PLUS (Slovakia)
Rock Action (Southeast Asia, South Africa)
Rush (New Zealand)
Markíza Dajto (Slovakia)
MAVTV (United States)
MAX (Norway)
Maxxx (Philippines, defunct)
MBC Action (MENA)
Mega (Spain)
MTV Max (Finland)
Nitro (Germany)
Nitro (Spain, defunct)
Nova Action (Czech Republic)
Spike (United States, rebranded with the Paramount-owned Paramount Network name)
Polsat Play (Poland)
ProSieben Maxx (Germany)
RTL 7 (Netherlands)
Tuff TV (United States, defunct)
TV3+ (Norway)
TV3 Max (Denmark)
TV6 (Swedish)-owned by Viaplay Group
TV6 (Lithuania, Latvia, Estonia)
TVNZ Duke (New Zealand)
XtvN (South Korea, defunct)
Veronica (Netherlands)
VTM 4 (Belgium)
Niche interest
Niche interest men's channels are television channels that contain programming with a specific genre, mainly that involving motoring, adult entertainment, and styling, though they are also subject to channel drift if their specific audience does not rate well to encompass a general audience that includes women.
Examples of men's interest niche channels
Esquire Network (United States, defunct)
MenTV - (Canada, now H2)
Male (Indonesian, defunct)
Men & Motors (UK, defunct)
Nuts TV (UK, defunct)
Playboy TV (United States)
Prima Cool (Czech Republic)
Pro Arena (Romania)
RMC Découverte (France)
References
Interest channel |
https://en.wikipedia.org/wiki/Women%27s%20interest%20channel | A women's interest channel generally refers to either a television station, network or specialty channel that targets women as its main demographic; offering programs that will appeal to the female population.
There are two types of female interest channels: general interest and niche interest.
General interest
General interest women's channels are television channels that contain programming from diverse genres and categories that will appeal to the female population including films, lifestyle series, dramatic series, reality series, and talk shows on varying topics including cooking, travel, cars, sexism, and sports.
Examples of general interest female channels
9Gem (Australia)
10 Peach (Australia)-owned by Paramount
bTV Lady (Bulgaria)
Colours (Philippines)
Cosmopolitan TV (Canada, defunct)
Diva Universal (Asia)-owned by NBCUniversal
Divinity (Spain)
Doma TV (Croatia)
Duo 4 (Estonia)
Ion Mystery (United States)-owned by Scripps
ITVBe (UK)
Start TV (United States)-owned by Weigel Broadcasting
Eve (Southeast Asia)
FEM (Norway)
FEM3 (Hungary)
Frii (Finland)
JOJ WAU (Slovakia)
Kanal 11 (Sweden)
KBS Story (South Korea)
La5 (Italy)
Liv (Finland)
Lifestyle (Philippines, defunct)
Lifetime (United States and Canada)-owned by A&E Networks
Magna Channel (Indonesia)
Markíza Doma (Slovakia)
MOI&cie (Canada)
Metro Channel (Philippines)
MTV ava (Finland)
Mya (Italy, defunct)
MYTV (Indonesia, defunct)
NET5. (Netherlands)
Nova (Spain)
Nova Lady (Czech Republic)
Nova Life (Greece)
OWN (United States and Canada)-owned by WBD
Oxygen (United States)-owned by NBCUniversal
Play7 (Belgium)
RTL 8 (Netherlands)
RTL Passion (Germany, Croatia)
RTL UP (Germany)
SIC Mulher (Portugal)
Sixx (Germany)
Slice (Canada)
SolarFlix (Philippines)
Sony Channel (Southeast Asia)
STAR World (Asia, defunct)
Sjuan (Sweden)
Téva (France)
TLC (United States)-owned by WBD
Twist TV (Canada, defunct)
TV3 Life (Latvia, Estonia)
TV6 (Norway)-owned by Viaplay Group
TV8 (Sweden)-owned by Viaplay Group
TV8 (Lithuania)
tvN Story (South Korea)
TVP Kobieta (Poland)
VH1 (United States)-owned by Paramount
W Network (Canada)
WE tv (United States)-owned by A&E Networks
Her TV (Hong Kong)
Velvet (Philippines, defunct)
Niche interest
Niche interest women's channels are television channels that contain programming with a specific television genre such as film channels, and lifestyle channels.
Examples of women's interest niche channels
Acasă (Romania)
Acasă Gold (Romania)
BBC Lifestyle (MENA, South Africa, Southeast Asia, Romania, Poland)
GMA Life TV (MENA, defunct)
Jelita (Indonesian, defunct)
Happy (Romania)
Kanal 7+ (Baltics)
Lifetime (Poland)-owned by A&E Networks
Living (New Zealand)
LMN (United States)-owned by A&E Networks
MAK TV (Greece)
Național 24 Plus (Romania)
Okezone TV (Indonesia)
Polsat Café (Poland)
Prima Love (Czech Republic)
Real Time (Italy)
RTL Living (Germany, Croatia)
RTL Lounge (Netherlands)
Sat |
https://en.wikipedia.org/wiki/Sequential%20consistency | Sequential consistency is a consistency model used in the domain of concurrent computing (e.g. in distributed shared memory, distributed transactions, etc.).
It is the property that "... the result of any execution is the same as if the operations of all the processors were executed in some sequential order, and the operations of each individual processor appear in this sequence in the order specified by its program."
That is, the execution order of a program in the same processor (or thread) is the same as the program order, while the execution order of a program on different processors (or threads) is undefined. In an example like this:
execution order between A1, B1 and C1 is preserved, that is, A1 runs before B1, and B1 before C1. The same for A2 and B2. But, as execution order between processors is undefined, B2 might run before or after C1 (B2 might physically run before C1, but the effect of B2 might be seen after that of C1, which is the same as "B2 run after C1")
Conceptually, there is single global memory and a "switch" that connects an arbitrary processor to memory at any time step. Each processor issues memory operations in program order and the switch provides the global serialization among all memory operations
The sequential consistency is weaker than strict consistency, which requires a read from a location to return the value of the last write to that location; strict consistency demands that operations be seen in the order in which they were actually issued.
See also
Concurrent data structure
Linearizability
Serializability
References
Consistency models |
https://en.wikipedia.org/wiki/Children%27s%20interest%20channel | Children's interest channels are television specialty channels that present children's interest content.
List
Worldwide
BabyTV
BabyFirstTV
Boomerang
Middle East
UK
Cartoon Network
Cartoon Network Arabic (Middle East)
Central and Eastern Europe
Cartoon Network Hindi (Middle East)
Middle East and Africa
Cartoonito
Middle East block
Central and Eastern Europe
Italy
France
UK
American programming block (United States)
CBeebies (Worldwide, only defunct in Latin America)
Disney Channel (Only defunct in some countries like United Kingdom and Italy.)
Disney Junior (Only defunct in some countries like United Kingdom and Italy.)
Disney XD (Only defunct in some countries like United Kingdom and Italy.)
Duck TV
KidsCo (EMEA & Asia-Pacific)
Moonbug Kids
Nickelodeon
Nick 2 (Latin America)
Nickelodeon Sonic (India)
Australia
Middle East and North Africa
Central and Eastern Europe
Nicktoons (worldwide)
European
Nick at nite (worldwide)
Nick Jr. (worldwide)
Middle East and North Africa
Nick Jr. Too (UK)
Nick Music
TeenNick
ZooMoo (UK, Asia)
Americas
BBC Kids (Canada)
Canal 5 (Mexico)
Discovery Family (US)
Discovery Kids (Latin America)
Family (Canada)
Family Jr. (Canada)
Gloob (Brazil)
Kids Street (US)
Nat Geo Kids (Latin America And Brazil)
NTV (Chile)
Once Niños (Mexico)
PakaPaka (Argentina)
PBS Kids (US)
Primo TV (US)
Semillitas (US)
Smile (US)
Teletoon & Télétoon (Canada)
Treehouse TV (Canada)
Universal Kids (US)
Vme Kids (US)
Vrak (Canada, defunct)
WildBrainTV (Canada)
Yoopa (Canada)
YTV (Canada)
Asia
ARB Günəş (Azerbaijan)
Animax (Japan, Southeast Asia, India)
Astro AEC (Malaysia, Astro Xiao Tai Yang only)
Astro Ceria (Malaysia)
Balapan (Kazakhstan)
Canal+ Cha Tate (Myanmar)
Canal+ Pu Tu Tue (Myanmar)
Channel 5 (Singapore, Okto only)
Channel 8 (Singapore, Okto only)
CCTV-14 (China)
BRTV-10 Kaku (China)
SMG Toonmax (China)
HunanTV Aniworld (China)
Chutti TV (South India)
DreamWorks Channel (Southeast Asia)
Dunia Anak (Indonesia)
Duronto TV (Bangladesh)
EBS Kids (South Korea)
Hungama TV (India)
HTV3 (Vietnam)
JSBC Youman (China)
K+ KIDS (Vietnam)
KBS Kids (South Korea)
Kids Station (Japan)
Kids TV (Indonesia)
Kids Zone (Pakistan)
KiZmom (South Korea, defunct)
Mentari TV (Indonesia)
NHK E (Japan)
ON Bibi (Vietnam)
ON Kids (Vietnam)
Pop (Pakistan)
RTV (Indonesia, majority of programming)
SCTV3 (Vietnam)
SZTV-7 Teenager Channel (China)
Sony YAY! (India)
Super Hungama (India)
TJTV-8 Children Channel (China)
Tooniverse (South Korea)
TV3 (Malaysia, Bananana! only)
TV9 (Malaysia, Jaguh Kartun only)
VTV6 (Vietnam)
VTV7 (Vietnam)
Yey! (Philippines)
ZTV-8 Children Channel (China)
Europe
Bang Bang (Albania)
Biggs (Portugal)
Boing (Italy, Spain)
Canal+ Kids (France)
Canal J (France)
Canal Panda (Portugal, formerly Iberia)
Canal Super3 (Catalonia, Spain)
Carousel (Russia)
CBBC (UK)
Channel 5 (UK, Milkshake! and Shake! only)
Clan (Spain)
Cúla 4 (I |
https://en.wikipedia.org/wiki/Hybrid%20fiber-coaxial | Hybrid fiber-coaxial (HFC) is a broadband telecommunications network that combines optical fiber and coaxial cable. It has been commonly employed globally by cable television operators since the early 1990s.
In a hybrid fiber-coaxial cable system, television channels are sent from the cable system's distribution facility, the headend, to local communities through optical fiber subscriber lines. At the local community, an optical node translates the signal from a light beam to radio frequency (RF), and sends it over coaxial cable lines for distribution to subscriber residences. The fiberoptic trunk lines provide enough bandwidth to allow additional bandwidth-intensive services such as cable internet access through DOCSIS.
Description
The fiber optic network extends from the cable operators' master headend, sometimes to regional headends, and out to a neighborhood's hubsite, and finally to an optical to coaxial cable node which typically serves 25 to 2000 homes. A master headend will usually have satellite dishes for reception of distant video signals as well as IP aggregation routers. Some master headends also house telephony equipment (such as automatic telephone exchanges) for providing telecommunications services to the community.
A regional or area headend/hub will receive the video signal from the master headend and add to it the public, educational, and government access (PEG) cable TV channels as required by local franchising authorities or insert targeted advertising that would appeal to a local area, along with internet from a CMTS, or a CCAP which provides both internet and video.
Separate Edge QAMs can be used to provide QAM modulated video, suitable for transmission, from digital video sources, and they can also be connected to a CMTS to also provide internet data, in a modular CMTS architecture. Video can be encoded according to standards such as DVB-C and data according to DOCSIS, modulated with edge QAMs for video and/or data, at the CMTS for data, or at the CCAP for video and data, and upconverted onto RF carriers.
The various services from CMTSs, CCAPs and Edge QAMs are combined onto a single electrical signal using headend RF management modules such as splitters and combiners and inserted into a broadband optical transmitter which in practice is a transmitter module in an "optics platform" or headend platform such as an Arris CH3000 or Cisco Prisma II. The exact kinds of equipment used depend on the company that operates the equipment, however, CCAPs aim to replace the conventional, integrated CMTS and Edge QAMs as separate pieces of equipment.
This optical transmitter converts the electrical signal to a downstream optically modulated signal that is sent to the nodes. Fiber optic cables connect the headend or hub to the optical nodes in a point-to-point or star topology, or in some cases, in a protected ring topology.
Fiber optic nodes
A fiber optic node has a broadband optical receiver, which converts the downstream o |
https://en.wikipedia.org/wiki/Release%20consistency | Release consistency is one of the synchronization-based consistency models used in concurrent programming (e.g. in distributed shared memory, distributed transactions etc.).
Introduction
In modern parallel computing systems, memory consistency must be maintained to avoid undesirable outcomes. Strict consistency models like sequential consistency are intuitively composed but can be quite restrictive in terms of performance as they would disable instruction level parallelism which is widely applied in sequential programming. To achieve better performance, some relaxed models are explored and release consistency is an aggressive relaxing attempt.
Release consistency vs. sequential consistency
Hardware structure and program-level effort
Sequential consistency can be achieved simply by hardware implementation, while release consistency is also based on an observation that most of the parallel programs are properly synchronized. In programming level, synchronization is applied to clearly schedule a certain memory access in one thread to occur after another. When a synchronized variable is accessed, hardware would make sure that all writes local to a processor have been propagated to all other processors and all writes from other processors are seen and gathered. In release consistency model, the action of entering and leaving a critical section are classified as acquire and release and for either case, explicit code should be put in the program showing when to do these operations.
Conditions for sequential consistent result
In general, a distributed shared memory is release consistent if it obeys the following rules:
1. Before an access to a shared variable is performed, all previous acquires by this processor must have completed.
2. Before a release is performed, all previous reads and writes by this process must have completed.
3. The acquire and release accesses must be processor consistent.
If the conditions above are met and the program is properly synchronized (i.e., processors implement acquire and release properly), the results of any execution will be exactly the same as they would have been executed following sequential consistency. In effect, accesses to shared variables are separated into atomic operation blocks by the acquire and release primitives so that races and interleaving between blocks will be prevented.
Implementations
Lock release
A lock release can be considered as a type of release synchronization. Assume a loop operation is performed using the code shown to the right. Two threads intend to enter a critical section and read the most recent value of , then exit the critical section. The code shows that thread 0 first acquires the lock and enters the critical section. In order to execute correctly, P1 must read the latest value of written by P0. In that case, only one thread can be in the critical section at a time. Therefore, the synchronization itself has ensured that the successful lock acquisition at P1 occurs |
https://en.wikipedia.org/wiki/BASIC-PLUS | BASIC-PLUS is an extended dialect of the BASIC programming language that was developed by Digital Equipment Corporation (DEC) for use on its RSTS/E time-sharing operating system for the PDP-11 series of 16-bit minicomputers in the early 1970s through the 1980s.
BASIC-PLUS was based on BASIC-8 for the TSS/8, itself based very closely on the original Dartmouth BASIC. BASIC-PLUS added a number of new structures, as well as features from JOSS concerning conditional statements and formatting. In turn, BASIC-PLUS was the version on which the original Microsoft BASIC was patterned.
Notable among the additions made to BASIC-PLUS was the introduction of string functions like and , in addition to Dartmouth's original all-purpose command. In future versions of the language, notably Microsoft's, was removed and BASIC-PLUS's string functions became the only ways to perform these sorts of operations. Most BASICs to this day follow this convention.
The language was later rewritten as a true compiler as BASIC-Plus-2, and was ported to the VAX-11 platform as that machine's native BASIC implementation. This version survived several platform changes, and is today known as VSI BASIC for OpenVMS.
Operation
Users would sit at a terminal and type in programming language statements. The statements could either be entered into the system's command interpreter directly, or entered into a text editor, saved to a file, and loaded into the command interpreter from the file. Errors in source code were reported to the user immediately after the line was typed.
As a smart terminal with cursor control could not be guaranteed, BASIC-PLUS used the common system of prefixing all source code with a line number. The code was edited by typing in the number and then changing the contents of the following code. A line of code could be removed by typing in its line number and nothing else, thereby setting it to an empty line.
The virtual address space of an RSTS/E user was limited to a little less than 64KB of space. Using BASIC-PLUS, about half of this virtual address space was used by the combined command interpreter and run-time library (named the Run Time System on RSTS/E). This limited user programs to about 32 kB of memory.
Large programs were broken into separate executable pieces by use of the statement, and programs could chain to specific line numbers in a secondary program to indicate that a program should begin execution at a different point from its first line. This feature of chaining to a certain line number allowed programs to signal to each other that they were being called from another program. The use of a shared memory section called core common also allowed programs to pass data to each other as needed. Disk files could also be used but were slower.
To conserve memory, the system included a garbage collecting memory manager, used for both string data and byte-code.
A running program could be interrupted, have variables examined and modified, and then be |
https://en.wikipedia.org/wiki/XNU | XNU (X is Not Unix) is the computer operating system (OS) kernel developed at Apple Inc. since December 1996 for use in the Mac OS X (now macOS) operating system and released as free and open-source software as part of the Darwin OS, which in addition to macOS is also the basis for the Apple TV Software, iOS, iPadOS, watchOS, visionOS, and tvOS OSes. XNU is an abbreviation of X is Not Unix.
Originally developed by NeXT for the NeXTSTEP operating system, XNU was a hybrid kernel derived from version 2.5 of the Mach kernel developed at Carnegie Mellon University, which incorporated the bulk of the 4.3BSD kernel modified to run atop Mach primitives, along with an application programming interface (API) in Objective-C for writing drivers named Driver Kit.
After Apple acquired NeXT, the kernel was updated with code derived from OSFMK 7.3 from OSF, and the FreeBSD project, and the Driver Kit was replaced with new API on a restricted subset of C++ (based on Embedded C++) named I/O Kit.
Kernel design
XNU is a hybrid kernel, containing features of both monolithic kernels and microkernels, attempting to make the best use of both technologies, such as the message passing ability of microkernels enabling greater modularity and larger portions of the OS to benefit from memory protection, and retaining the speed of monolithic kernels for some critical tasks.
, XNU runs on ARM64 and x86-64 processors, both one processor and symmetric multiprocessing (SMP) models. PowerPC support was removed as of the version in Mac OS X Snow Leopard. Support for IA-32 was removed as of the version in Mac OS X Lion; support for 32-bit ARM was removed as of the version in .
Mach
The basis of the XNU kernel is a heavily modified (hybrid) Open Software Foundation Mach kernel (OSFMK) 7.3. OSFMK 7.3 is a microkernel that includes applicable code from the University of Utah Mach 4 kernel and from the many Mach 3.0 variants forked from the original Carnegie Mellon University Mach 3.0 microkernel.
OSFMK 7.3 is able to run the core of an operating system as separated processes, which allows a great flexibility (it could run several operating systems in parallel above the Mach core), but this often reduces performance because of time-consuming kernel/user mode context switches and overhead stemming from mapping or copying messages between the address spaces of the kernel and that of the service daemons.
Apple licensed OSFMK 7.3 from the OSF, and attempted to streamline some tasks by building BSD functions into the kernel along with the Mach code. The result is a heavily modified (hybrid) OSFMK 7.3 kernel.
BSD
The Berkeley Software Distribution (BSD) part of the kernel provides the Portable Operating System Interface (POSIX) application programming interface (API, BSD system calls), the Unix process model atop Mach tasks, basic security policies, user and group ids, permissions, the network protocol stack (protocols), the virtual file system code (including a file system independe |
https://en.wikipedia.org/wiki/GNU%20toolchain | The GNU toolchain is a broad collection of programming tools produced by the GNU Project. These tools form a toolchain (a suite of tools used in a serial manner) used for developing software applications and operating systems.
The GNU toolchain plays a vital role in development of Linux, some BSD systems, and software for embedded systems. Parts of the GNU toolchain are also directly used with or ported to other platforms such as Solaris, macOS, Microsoft Windows (via Cygwin and MinGW/MSYS), Sony PlayStation Portable (used by PSP modding scene) and Sony PlayStation 3.
Components
Projects included in the GNU toolchain are:
GNU make: an automation tool for compilation and build
GNU Compiler Collection (GCC): a suite of compilers for several programming languages
GNU C Library (glibc): core C library including headers, libraries, and dynamic loader
GNU Binutils: a suite of tools including linker, assembler and other tools
GNU Bison: a parser generator, often used with the Flex lexical analyser
GNU m4: an m4 macro processor
GNU Debugger (GDB): a code debugging tool
GNU Autotools (GNU Build System): Autoconf, Automake and Libtool
See also
GNU Classpath
GNU Core Utilities
CVS and Git
MinGW and Cygwin
Cross compiler
LLVM
References
External links
GCC, the GNU Compiler Collection
Building and Installing under Linux
Prebuilt Win32 GNU Toolchains for various embedded platforms
Programming tools
toolchain |
https://en.wikipedia.org/wiki/Satellite%20phone | A satellite telephone, satellite phone or satphone is a type of mobile phone that connects to other phones or the telephone network by radio link through satellites orbiting the Earth instead of terrestrial cell sites, as cellphones do. Therefore, they can work in most geographic locations on the Earth's surface, as long as open sky and the line-of-sight between the phone and the satellite are provided. Depending on the architecture of a particular system, coverage may include the entire Earth or only specific regions. Satellite phones provide similar functionality to terrestrial mobile telephones; voice calling, text messaging, and low-bandwidth Internet access are supported through most systems. The advantage of a satellite phone is that it can be used in such regions where local terrestrial communication infrastructures, such as landline and cellular networks, are not available.
Satellite phones are popular on expeditions into remote locations where there is no reliable cellular service, such as recreational hiking, hunting, fishing, and boating trips, as well as for business purposes, such as mining locations and maritime shipping. Satellite phones rarely get disrupted by natural disasters on Earth or human actions such as war, so they have proven to be dependable communication tools in emergency and humanitarian situations, when the local communications system have been compromised.
The mobile equipment, also known as a terminal, varies widely. Early satellite phone handsets had a size and weight comparable to that of a late-1980s or early-1990s mobile phone, but usually with a large retractable antenna. More recent satellite phones are similar in size to a regular mobile phone while some prototype satellite phones have no distinguishable difference from an ordinary smartphone.
A fixed installation, such as one used aboard a ship, may include large, rugged, rack-mounted electronics, and a steerable microwave antenna on the mast that automatically tracks the overhead satellites. Smaller installations using VoIP over a two-way satellite broadband service such as BGAN or VSAT bring the costs within the reach of leisure vessel owners. Internet service satellite phones have notoriously poor reception indoors, though it may be possible to get a consistent signal near a window or in the top floor of a building if the roof is sufficiently thin. The phones have connectors for external antennas that can be installed in vehicles and buildings. The systems also allow for the use of repeaters, much like terrestrial mobile phone systems.
In the early 2020s, various conventional mobile phones began to integrate satellite messaging connectivity and satellite emergency services for use in remote regions, where there is no reliable terrestrial network.
Integration into conventional mobile phones
In the early 2020s, manufacturers began to integrate satellite connectivity into smartphone devices for use in remote areas, out of the cellular network ran |
https://en.wikipedia.org/wiki/Resource%20Reservation%20Protocol | The Resource Reservation Protocol (RSVP) is a transport layer protocol designed to reserve resources across a network using the integrated services model. RSVP operates over an IPv4 or IPv6 and provides receiver-initiated setup of resource reservations for multicast or unicast data flows. It does not transport application data but is similar to a control protocol, like Internet Control Message Protocol (ICMP) or Internet Group Management Protocol (IGMP). RSVP is described in .
RSVP can be used by hosts and routers to request or deliver specific levels of quality of service (QoS) for application data streams. RSVP defines how applications place reservations and how they can relinquish the reserved resources once no longer required. RSVP operations will generally result in resources being reserved in each node along a path. RSVP is not a routing protocol but was designed to interoperate with current and future routing protocols.
RSVP by itself is rarely deployed in telecommunications networks. In 2003, development effort was shifted from RSVP to RSVP-TE for teletraffic engineering. Next Steps in Signaling (NSIS) was a proposed replacement for RSVP.
Main attributes
RSVP requests resources for simplex flows: a traffic stream in only one direction from sender to one or more receivers.
RSVP is not a routing protocol but works with current and future routing protocols.
RSVP is receiver oriented in that the receiver of a data flow initiates and maintains the resource reservation for that flow.
RSVP maintains soft state (the reservation at each node needs a periodic refresh) of the host and routers' resource reservations, hence supporting dynamic automatic adaptation to network changes.
RSVP provides several reservation styles (a set of reservation options) and allows for future styles to be added in protocol revisions to fit varied applications.
RSVP transports and maintains traffic and policy control parameters that are opaque to RSVP.
History and related standards
The basic concepts of RSVP were originally proposed in 1993.
RSVP is described in a series of RFC documents from the IETF:
: The version 1 functional specification was described in RFC 2205 (Sept. 1997) by IETF. Version 1 describes the interface to admission (traffic) control that is based "only" on resource availability. Later RFC2750 extended the admission control support.
defines the use of RSVP with controlled-load RFC 2211 and guaranteed RFC 2212 QoS control services. More details in Integrated Services. Also defines the usage and data format of the data objects (that carry resource reservation information) defined by RSVP in RFC 2205.
specifies the network element behavior required to deliver Controlled-Load services.
specifies the network element behavior required to deliver guaranteed QoS services.
describes a proposed extension for supporting generic policy based admission control in RSVP. The extension included a specification of policy objects and a description on h |
https://en.wikipedia.org/wiki/.net | The domain name net is a generic top-level domain (gTLD) used in the Domain Name System of the Internet. The name is derived from the word network, indicating it was originally intended for organizations involved in networking technologies, such as Internet service providers and other infrastructure companies. However, there are no official restrictions and the domain is now a general-purpose namespace. It is still popular with network operators and the advertising sector, and it is often treated as an alternative to .
History
is one of the original top-level domains (the other six being , , , , , and ) despite not being mentioned in RFC 920, having been created in January 1985.
Verisign, the operator of after acquiring Network Solutions, held an operations contract that expired on 30 June 2005. ICANN, the organization responsible for domain management, sought proposals from organizations to operate the domain upon expiration of the contract. Verisign regained the contract bid and secured its control over the registry for another six years.
On 30 June 2011, the contract with Verisign was automatically renewed for another six years. This is because of a resolution approved by the ICANN board, which states that renewal will be automatic as long as Verisign meets certain ICANN requirements. As of May 2022, Verisign continues to manage .net.
Registration
Registrations are processed via accredited registrars and internationalized domain names are also accepted.
The first created .net domain name is nordu.net. It was created on 1 January 1985 according to the public records, and NORDUnet has used this domain name since 1985.
Net extension is the most preferred gTLD just after com. Total registered domain names with net extension are 13.4 million according to the Domain Name Industry Report published in March 2020, which publishes every quarter.
As of 2015, it is the fifth most popular top-level domain, after , , and .
References
External links
List of accredited registrars
Generic top-level domains
Council of European National Top Level Domain Registries members
Computer-related introductions in 1985 |
https://en.wikipedia.org/wiki/Computational%20group%20theory | In mathematics, computational group theory is the study of
groups by means of computers. It is concerned
with designing and analysing algorithms and
data structures to compute information about groups. The subject
has attracted interest because for many interesting groups
(including most of the sporadic groups) it is impractical
to perform calculations by hand.
Important algorithms in computational group theory include:
the Schreier–Sims algorithm for finding the order of a permutation group
the Todd–Coxeter algorithm and Knuth–Bendix algorithm for coset enumeration
the product-replacement algorithm for finding random elements of a group
Two important computer algebra systems (CAS) used for group theory are
GAP and Magma. Historically, other systems such as CAS (for character theory) and Cayley (a predecessor of Magma) were important.
Some achievements of the field include:
complete enumeration of all finite groups of order less than 2000
computation of representations for all the sporadic groups
See also
Black box group
References
A survey of the subject by Ákos Seress from Ohio State University, expanded from an article that appeared in the Notices of the American Mathematical Society is available online. There is also a survey by Charles Sims from Rutgers University and an older survey by Joachim Neubüser from RWTH Aachen.
There are three books covering various parts of the subject:
Derek F. Holt, Bettina Eick, Eamonn A. O'Brien, "Handbook of computational group theory", Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton, Florida, 2005.
Charles C. Sims, "Computation with Finitely-presented Groups", Encyclopedia of Mathematics and its Applications, vol 48, Cambridge University Press, Cambridge, 1994.
Ákos Seress, "Permutation group algorithms", Cambridge Tracts in Mathematics, vol. 152, Cambridge University Press, Cambridge, 2003. .
Computational fields of study |
https://en.wikipedia.org/wiki/Mike%20Lazaridis | Mihal "Mike" Lazaridis (born March 14, 1961) is a Canadian businessman, investor in quantum computing technologies, and founder of BlackBerry, which created and manufactured the BlackBerry wireless handheld device. With an estimated net worth of US$800 million (as of June 2011), Lazaridis was ranked by Forbes as the 17th wealthiest Canadian and 651st in the world.
Lazaridis served in various positions including co-chairman and co-CEO of BlackBerry from 1984 to 2012 and Board Vice Chair and Chair of the Innovation Committee from 2012 to 2013. As an advocate for the power of basic science to improve and transform the world, he co-founded Quantum Valley Investments in March 2013 with childhood friend and BlackBerry co-founder Douglas Fregin to provide financial and intellectual capital for the further development and commercialization of breakthroughs in quantum information science. In 1999 he founded the Perimeter Institute for Theoretical Physics, where he also serves as board chair. In 2002, he founded the Institute for Quantum Computing. He is also a former chancellor of the University of Waterloo, and an Officer of the Order of Canada (OC).
Personal, education, and career history
Lazaridis was born in Istanbul, Turkey, to Pontic Greek parents, Nick and Dorothy Lazaridis with original lineage to the island of Chios. He was five years old when his family moved to Canada in 1966, settling in Windsor, Ontario. At age 12, he won a prize at the Windsor Public Library for reading every science book in the library.
In 1979, he enrolled at the University of Waterloo in electrical engineering with an option in computer science. In 1984, Lazaridis responded to a request for proposal from General Motors (GM) to develop a network computer control display system. GM awarded him a contract. He dropped out of university that year, just two months before he was scheduled to graduate. The GM contract, a small government grant, and a loan from Lazaridis's parents enabled Lazaridis, Mike Barnstijn, and Douglas Fregin to launch Research In Motion. One of the company's first achievements was the development of barcode technology for film. RIM plowed the profits from that into wireless data transmission research, eventually leading to the introduction of the BlackBerry wireless mobile device in 1999, and its better-known version in 2002.
Lazaridis and his wife Ophelia have also been noted for their philanthropic work in the Waterloo area.
Philanthropy
In 2000, Lazaridis founded and donated more than $170 million to the Perimeter Institute for Theoretical Physics. He and his wife Ophelia founded and donated more than $100 million to the Institute for Quantum Computing at the University of Waterloo in 2002. In 2015, Lazaridis donated $20 million to Wilfrid Laurier University for a new technology-focused management institute at the business school, which was renamed in his honour as the Lazaridis School of Business & Economics.
Awards and honours
On October 21 |
https://en.wikipedia.org/wiki/Scorpion%20%28disambiguation%29 | A scorpion is a predatory arthropod animal.
Scorpion may also refer to:
Computing and technology
Scorpion (computer), a Russian ZX Spectrum clone computer
Scorpion (CPU), a Qualcomm CPU used in smart phones
Film and television
Scorpion (2007 film), a French film
Scorpion (2018 film), an Uzbek film
The Scorpion (film), a 1990 Egyptian drama film
Scorpion (TV series), an American drama series broadcast on CBS from 2014 to 2018
"Scorpion" (Star Trek: Voyager), a 1997 episode of Star Trek: Voyager
Gaming
Scorpion (solitaire), a card game
Scorpion (video game), a 1989 video game
Scorpion: Disfigured, a 2009 German computer game
Scorpion (Mortal Kombat), a video game character
Scorpion, a wrestler in the video game Saturday Night Slam Masters
Literature
Scorpion (publishing house), an early-1900s Russian book publisher
The Scorpion, a title used for one issue in 1939 by the pulp magazine The Western Raider
The Scorpion (novel), a 1982 novel by Zayd Mutee' Dammaj
Scorpion (novel), a 1985 spy thriller by Andrew Kaplan
Scorpions (novel), a 1988 novel by Walter Dean Myers
Comics
Scorpion (Marvel Comics), a number of Marvel Comics comics characters including:
Mac Gargan, a supervillain and frequent enemy of Spider-Man, the third Venom and a member of the Dark Avengers as the Black Spider-Man, but is back to "being" Scorpion.
Scorpion (Carmilla Black)/Thanasee Rappaccini, first appeared in Amazing Fantasy vol. 2 #7 and was created by Fred Van Lente and Leonard Kirk.
Silver Scorpion (Elizabeth Barstow) first appeared in Daring Mystery Comics #7 (April 1941).
Kron Stone, an enemy of Spider-Man 2099, in the Timestorm 2009–2099 alternate reality.
Scorpion (Atlas/Seaboard Comics), a character from former Marvel Comics publisher Martin Goodman's Atlas/Seaboard Comics
Scorpion, a Fawcett Comics character from Earth-S who appeared in Captain Marvel
Le Scorpion, a Belgian comic set in 18th-century Vatican, by Stephen Desberg and Enrico Marini
Scarlet Scorpion, an AC Comics character
Music
Scorpions (band), a German hard rock band
The Scorpions, a 1976 re-issue of their 1972 debut album Lonesome Crow
The Scorpions (Manchester band), a British beat group
The Scorpions, an English rock band later renamed Status Quo
The Scorpion (album), an album by Lou Donaldson
Scorpion (Drake album), a 2018 double album
Scorpion (Eve album) (2001)
"The Scorpion", a song by Megadeth from The System Has Failed
People
Scorpion I, Egyptian pharaoh
Scorpion II, Egyptian pharaoh
Military/paramilitary
Combat units
Scorpions (Iraq), a paramilitary Iraqi force organized by the CIA
Scorpions (paramilitary), a paramilitary group involved in the 1995 Srebrenica massacre
Scorpions (South Africa), a multidisciplinary agency that investigated and prosecuted organised crime and corruption
VAQ-132 or the Scorpions, a U.S. Navy aircraft squadron
Vessels
CSS Scorpion, a Confederate Navy boat
HMS Scorpion (1746), a 14-gun Merlin-class sloop
HMS Scorpi |
https://en.wikipedia.org/wiki/Distributed%20transaction | A distributed transaction is a database transaction in which two or more network hosts are involved. Usually, hosts provide transactional resources, while a transaction manager creates and manages a global transaction that encompasses all operations against such resources. Distributed transactions, as any other transactions, must have all four ACID (atomicity, consistency, isolation, durability) properties, where atomicity guarantees all-or-nothing outcomes for the unit of work (operations bundle).
The Open Group, a vendor consortium, proposed the X/Open Distributed Transaction Processing Model (X/Open XA), which became a de facto standard for the behavior of transaction model components.
Databases are common transactional resources and, often, transactions span a couple of such databases. In this case, a distributed transaction can be seen as a database transaction that must be synchronized (or provide ACID properties) among multiple participating databases which are distributed among different physical locations. The isolation property (the I of ACID) poses a special challenge for multi database transactions, since the (global) serializability property could be violated, even if each database provides it (see also global serializability). In practice most commercial database systems use strong strict two phase locking (SS2PL) for concurrency control, which ensures global serializability, if all the participating databases employ it. (see also commitment ordering for multidatabases.)
A common algorithm for ensuring correct completion of a distributed transaction is the two-phase commit (2PC). This algorithm is usually applied for updates able to commit in a short period of time, ranging from couple of milliseconds to couple of minutes.
There are also long-lived distributed transactions, for example a transaction to book a trip, which consists of booking a flight, a rental car and a hotel. Since booking the flight might take up to a day to get a confirmation, two-phase commit is not applicable here, it will lock the resources for this long. In this case more sophisticated techniques that involve multiple undo levels are used. The way you can undo the hotel booking by calling a desk and cancelling the reservation, a system can be designed to undo certain operations (unless they are irreversibly finished).
In practice, long-lived distributed transactions are implemented in systems based on web services. Usually these transactions utilize principles of compensating transactions, Optimism and Isolation Without Locking. The X/Open standard does not cover long-lived distributed transactions.
Several technologies, including Jakarta Enterprise Beans and Microsoft Transaction Server fully support distributed transaction standards.
See also
Java Transaction API
Enduro/X open-source X/Open XA and XATMI implementation
References
Further reading
Gerhard Weikum, Gottfried Vossen, Transactional information systems: theory, algorithms, and the practi |
https://en.wikipedia.org/wiki/Single-serving%20visitor%20pattern | In computer programming, the single-serving visitor pattern is a design pattern. Its intent is to optimise the implementation of a visitor that is allocated, used only once, and then deleted (which is the case of most visitors).
Applicability
The single-serving visitor pattern should be used when visitors do not need to remain in memory. This is often the case when visiting a hierarchy of objects (such as when the visitor pattern is used together with the composite pattern) to perform a single task on it, for example counting the number of cameras in a 3D scene.
The regular visitor pattern should be used when the visitor must remain in memory. This occurs when the visitor is configured with a number of parameters that must be kept in memory for a later use of the visitor (for example, for storing the rendering options of a 3D scene renderer).
However, if there should be only one instance of such a visitor in a whole program, it can be a good idea to implement it both as a single-serving visitor and as a singleton. In doing so, it is ensured that the single-serving visitor can be called later with its parameters unchanged (in this particular case "single-serving visitor" is an abuse of language since the visitor can be used several times).
Usage examples
The single-serving visitor is called through the intermediate of static methods.
Without parameters: Element* elem;
SingleServingVisitor::apply_to(elem);
With parameters: Element* elem;
TYPE param1, param2;
SingleServingVisitor::apply_to(elem, param1, param2);
Implementation as a singleton: Element* elem;
TYPE param1, param2;
SingleServingVisitor::set_param1(param1);
SingleServingVisitor::set_param2(param2);
SingleServingVisitor::apply_to(elem);
Consequences
Pros
No "zombie" objects. With a single-serving visitor, it is ensured that visitors are allocated when needed and destroyed once useless.
A simpler interface than visitor. The visitor is created, used and free by the sole call of the apply_to static method.
Cons
Repeated allocation. At each call of the apply_to method, a single-serving visitor is created then discarded, which is time-consuming. In contrast, the singleton only performs one allocation.
Implementation (in C++)
Basic implementation (without parameters)
// Declaration
class Element;
class ElementA;
class ElementB;
class SingleServingVisitor;
... // Same as with the [[visitor pattern]].
// Definition
class SingleServingVisitor {
protected:
SingleServingVisitor();
public:
~SingleServingVisitor();
static void apply_to(Element*);
virtual void visit_ElementA(ElementA*) = 0;
virtual void visit_ElementB(ElementB*) = 0;
}
// Implementation
void SingleServingVisitor::apply_to(Element* elem)
{
SingleServingVisitor ssv;
elem.accept(ssv);
}
Passing parameters
If the single-serving visitor has to be initialised, the parameters have to be passed through the static method:
void SingleServingVisitor::apply_to(Element* elem, TYPE para |
https://en.wikipedia.org/wiki/Pegasus%20Mail | Pegasus Mail is a proprietary email client for Microsoft Windows. It was originally released in 1990 on NetWare networks with MS-DOS and later Apple Macintosh clients, before being ported to Windows which is now the only platform actively supported. Since its inception it has been developed by David Harris and is donationware after having previously been freeware.
The software has been described as "one of the web's oldest and most respected email clients". It is supported by an official community-driven forum.
History
Pegasus Mail (also shortened to Pmail) was originally launched as ComNet Mail for Novell NetWare MS-DOS workstations in February 1990, a text-mode application for networks. Harris designed it first at the University of Otago's NetWare network. He soon afterwards started developing the Mercury Mail Transport System.
Pegasus Mail pioneered many features now taken for granted with other email clients, such as filtering and simultaneous access to multiple POP3 and IMAP4 accounts. Its extensive array of features coupled with a simple user interface provided an ideal mix for most users' needs. However, the free distribution of Microsoft Outlook Express or later email client as a standard part of Microsoft Windows since Windows 98, and the distribution of Microsoft Outlook, initially free of charge with PC magazines and then as an integral part of Microsoft Office, from 1997 dealt a significant blow to the market share of Pegasus Mail for Windows and other email clients, from which many never fully recovered.
Pegasus Mail for Microsoft Windows was first released in 1993. The development of versions for DOS (MS-DOS and PC DOS 5.0 and higher), Apple Macintosh and 16-bit Windows (Windows 3.1 and higher) stopped in or before 2000.
Move to donationware
Until 2006 all versions of Pegasus Mail were supplied free of charge, and printed user manuals were available for purchase. In January 2007 it was announced that distribution and development of Pegasus Mail had ceased due to inadequate financial support from the sale of the manuals. Harris stated:
Later in the month, due to an "avalanche" of support from the user community, it was announced that development would resume. However, Pegasus Mail would change from freeware to donationware and Mercury would change to a licence for fee for configurations with more than a certain number of email boxes.
In 2009, Pegasus Mail launched its own Wiki (WikiPmail), used as an online knowledge and documentation resource. A few years later it crashed and has not been restored, but the WikiPmail remains accessible at the Internet Archive.
Features
Pegasus Mail is suitable for single or multiple users on stand-alone computers and for internal and Internet mail on local area networks. Since Pegasus Mail does not make changes to the Windows registry or the system directory, it is suitable as a portable application for USB drives.
A significant feature of Pegasus Mail in Windows is that users have the ch |
https://en.wikipedia.org/wiki/DES-X | In cryptography, DES-X (or DESX) is a variant on the DES (Data Encryption Standard) symmetric-key block cipher intended to increase the complexity of a brute-force attack. The technique used to increase the complexity is called key whitening.
The original DES algorithm was specified in 1976 with a 56-bit key size: 256 possibilities for the key. There was criticism that an exhaustive search might be within the capabilities of large governments, particularly the United States' National Security Agency (NSA). One scheme to increase the key size of DES without substantially altering the algorithm was DES-X, proposed by Ron Rivest in May 1984.
The algorithm has been included in RSA Security's BSAFE cryptographic library since the late 1980s.
DES-X augments DES by XORing an extra 64 bits of key (K1) to the plaintext before applying DES, and then XORing another 64 bits of key (K2) after the encryption:
The key size is thereby increased to 56 + (2 × 64) = 184 bits.
However, the effective key size (security) is only increased to 56+64−1−lb(M) = 119 − lb(M) = ~119 bits, where M is the number of chosen plaintext/ciphertext pairs the adversary can obtain, and lb denotes the binary logarithm. Moreover, key size drops to 88 bits given 232.5 known plaintext and using advanced slide attack.
DES-X also increases the strength of DES against differential cryptanalysis and linear cryptanalysis, although the improvement is much smaller than in the case of brute force attacks. It is estimated that differential cryptanalysis would require 261 chosen plaintexts (vs. 247 for DES), while linear cryptanalysis would require 260 known plaintexts (vs. 243 for DES or 261 for DES with independent subkeys.) Note that with 264 plaintexts (known or chosen being the same in this case), DES (or indeed any other block cipher with a 64 bit block size) is totally broken as the whole cipher's codebook becomes available.
Although the differential and linear attacks, currently best attack on DES-X is a known-plaintext slide attack
discovered by Biryukov-Wagner which has complexity of 232.5 known plaintexts and 287.5 time of analysis. Moreover the attack is easily converted into a ciphertext-only attack with the same data complexity and 295 offline time complexity.
See also
G-DES
Meet-in-the-middle attack
Triple DES
Xor–encrypt–xor
References
Joe Kilian and Phillip Rogaway, How to protect DES against exhaustive key search(PDF), Advances in Cryptology – Crypto '96, Springer-Verlag (1996), pp. 252–267.
P. Rogaway, The security of DESX (PostScript), CryptoBytes 2(2) (Summer 1996).
External links
RSA FAQ Entry
Broken block ciphers
Data Encryption Standard |
https://en.wikipedia.org/wiki/IBM%20TopView | TopView is the first object-oriented, multitasking, and windowing, personal computer operating environment for PC DOS developed by IBM, announced in August 1984 and shipped in March 1985. TopView provided a text-mode (although it also ran in graphics mode) operating environment that allowed users to run more than one application at the same time on a PC. IBM demonstrated an early version of the product to key customers before making it generally available, around the time they shipped their new PC AT computer.
History
When Microsoft announced Windows 1.0 in November 1983, International Business Machines (IBM), Microsoft's important partner in popularizing MS-DOS for the IBM PC, notably did not announce support for the forthcoming window environment. IBM determined that the microcomputer market needed a multitasking environment. When it released TopView in 1985, the press speculated that the software was the start of IBM's plan to increase its control over the IBM PC (even though IBM published the specifications publicly) by creating a proprietary operating system for it, similar to what IBM had offered for years on its larger computers. TopView also allowed IBM to serve customers who were surprised that the new IBM AT did not come with an operating system able to use the hardware multitasking and protected mode features of the new 80286 CPU, as DOS and most applications were still running in 8086/8088 real mode.
Even given TopView's virtual memory management capabilities, hardware limitations still held the new environment back—a base AT with 256 KB of RAM only had room for 80 KB of application code and data in RAM once DOS and TopView had loaded up. 512-640 KB was recommended to load up two typical application programs of the time. This was the maximum the earlier IBM XT could have installed. Once loaded, TopView took back much of the memory consumed by DOS, but still not enough to satisfy industry critics. TopView ran in real mode on any x86 processor and could run well behaved DOS programs (i.e. programs that did not write directly to the screen but used BIOS int 10h and DOS int 21h, such as the IBM Assistant Series of productivity programs) in an arrangement of windows. Well behaved applications would use standard DOS and BIOS function calls to access system services and hardware. Misbehaving programs (i.e. such as programs that did write directly to the screen) such as Lotus 1-2-3, WordStar and dBase III would still run in the TopView environment, but would consume the entire screen. Object-oriented applications were written using the TopView API. TopView was developed to run on the 8088 (and required what IBM referred to as a fixed disk) and later the 80286. TopView was not updated to make use of the virtual 8086 mode added in the Intel 80386 processors that allowed better virtualization.
Initially, compatibility with the extended features was limited mainly to IBM applications, along with a few third-party products like WordPerfect a |
https://en.wikipedia.org/wiki/Peter%20J.%20Weinberger | Peter Jay Weinberger (born August 6, 1942) is a computer scientist best known for his early work at Bell Labs. He now works at Google.
Weinberger was an undergraduate at Swarthmore College, graduating in 1964. He received his PhD in mathematics (number theory) in 1969 from the University of California, Berkeley under Derrick Henry Lehmer for a thesis entitled "Proof of a Conjecture of Gauss on Class Number Two". After holding a position in the Department of Mathematics at the University of Michigan, Ann Arbor, where he continued his work in analytic number theory, he moved to AT&T Bell Labs.
At Bell Labs, Weinberger contributed to the design of the AWK programming language (he is the "W" in AWK), and the Fortran compiler f77. A detailed explanation of his contributions to AWK and other Unix tools is found in an interview transcript at Princeton University.
Another interview sheds some light on his work at Google.
When Peter Weinberger was promoted to head of Computer Science Research at Bell Labs, his picture was merged with the AT&T "death star" logo of the mid-80s, creating the PJW Face image that has appeared in innumerable locations, including T-shirts, coffee mugs, CDs, and at least one water tower. The sole remaining PJW Face at Bell Labs is somewhat in disarray, but there are plans afoot to repair it.
Prior to joining Google, Weinberger was chief technology officer at Renaissance Technologies. Weinberger has been a member of the JASON defense advisory group since 1990. He has an Erdos Number of 2.
Writings
The book's webpage includes downloads of the current implementation of Awk and links to others.
References
External links
Web site dedicated to PJW's face
Living people
American computer scientists
Scientists at Bell Labs
Google employees
Programming language designers
Swarthmore College alumni
1942 births
American chief technology officers
University of Michigan faculty
Members of JASON (advisory group)
20th-century American Jews
21st-century American Jews |
https://en.wikipedia.org/wiki/List%20of%20text-based%20computer%20games | The following list of text-based games is not to be considered an authoritative, comprehensive listing of all such games; rather, it is intended to represent a wide range of game styles and genres presented using the text mode display and their evolution across a long period.
On mainframe computers
Years listed are those in which early mainframe games and others are believed to have originally appeared. Often these games were continually modified and played as a succession of versions for years after their initial posting. (For purposes of this list, minicomputers are considered mainframes, in contrast to microcomputers, which are not.)
On personal computers
Commercial text adventure games
These are commercial interactive fiction games played offline.
Miscellaneous games
Online games
Play-by-email games
These are play-by-email games played online.
BBS door games
These are BBS door games played online.
MUDs
Text-Based Browser Multiplayer Games
These games are played in a web browser and involve multiplayer components: based mainly around text but may have limited graphical user interfaces.
See also
List of graphic adventure games
References
Text-based
Multi-user dungeon |
https://en.wikipedia.org/wiki/Text%20mode | Text mode is a computer display mode in which content is internally represented on a computer screen in terms of characters rather than individual pixels. Typically, the screen consists of a uniform rectangular grid of character cells, each of which contains one of the characters of a character set; at the same time, contrasted to graphics mode or other kinds of computer graphics modes.
Text mode applications communicate with the user by using command-line interfaces and text user interfaces. Many character sets used in text mode applications also contain a limited set of predefined semi-graphical characters usable for drawing boxes and other rudimentary graphics, which can be used to highlight the content or to simulate widget or control interface objects found in GUI programs. A typical example is the IBM code page 437 character set.
An important characteristic of text mode programs is that they assume monospaced fonts, where every character has the same width on screen, which allows them to easily maintain the vertical alignment when displaying semi-graphical characters. This was an analogy of early mechanical printers which had fixed pitch. This way, the output seen on the screen could be sent directly to the printer maintaining the same format.
Depending on the environment, the screen buffer can be directly addressable. Programs that display output on remote video terminals must issue special control sequences to manipulate the screen buffer. The most popular standards for such control sequences are ANSI and VT100.
Programs accessing the screen buffer through control sequences may lose synchronization with the actual display so that many text mode programs have a redisplay everything command, often associated with the key combination.
History
Text mode video rendering came to prominence in the early 1970s, when video-oriented text terminals started to replace teleprinters in the interactive use of computers.
Benefits
The advantages of text modes as compared to graphics modes include lower memory consumption and faster screen manipulation. At the time text terminals were beginning to replace teleprinters in the 1970s, the extremely high cost of random-access memory in that period made it exorbitantly expensive to install enough memory for a computer to simultaneously store the current value of every pixel on a screen, to form what would now be called a framebuffer. Early framebuffers were standalone devices which cost tens of thousands of dollars, in addition to the expense of the advanced high-resolution displays to which they were connected. For applications that required simple line graphics but for which the expense of a framebuffer could not be justified, vector displays were a popular workaround. But there were many computer applications (e.g., data entry into a database) for which all that was required was the ability to render ordinary text in a quick and cost-effective fashion to a cathode-ray tube.
Text mode avoids th |
https://en.wikipedia.org/wiki/Interface%20%28computing%29 | In computing, an interface is a shared boundary across which two or more separate components of a computer system exchange information. The exchange can be between software, computer hardware, peripheral devices, humans, and combinations of these. Some computer hardware devices, such as a touchscreen, can both send and receive data through the interface, while others such as a mouse or microphone may only provide an interface to send data to a given system.
Hardware interfaces
Hardware interfaces exist in many components, such as the various buses, storage devices, other I/O devices, etc. A hardware interface is described by the mechanical, electrical, and logical signals at the interface and the protocol for sequencing them (sometimes called signaling). A standard interface, such as SCSI, decouples the design and introduction of computing hardware, such as I/O devices, from the design and introduction of other components of a computing system, thereby allowing users and manufacturers great flexibility in the implementation of computing systems. Hardware interfaces can be parallel with several electrical connections carrying parts of the data simultaneously or serial where data are sent one bit at a time.
Software interfaces
A software interface may refer to a wide range of different types of interface at different "levels". For example, an operating system may interface with pieces of hardware. Applications or programs running on the operating system may need to interact via data streams, filters, and pipelines. In object oriented programs, objects within an application may need to interact via methods.
In practice
A key principle of design is to prohibit access to all resources by default, allowing access only through well-defined entry points, i.e., interfaces. Software interfaces provide access to computer resources (such as memory, CPU, storage, etc.) of the underlying computer system; direct access (i.e., not through well-designed interfaces) to such resources by software can have major ramifications—sometimes disastrous ones—for functionality and stability.
Interfaces between software components can provide constants, data types, types of procedures, exception specifications, and method signatures. Sometimes, public variables are also defined as part of an interface.
The interface of a software module A is deliberately defined separately from the implementation of that module. The latter contains the actual code of the procedures and methods described in the interface, as well as other "private" variables, procedures, etc. Another software module B, for example the client to A, that interacts with A is forced to do so only through the published interface. One practical advantage of this arrangement is that replacing the implementation of A with another implementation of the same interface should not cause B to fail—how A internally meets the requirements of the interface is not relevant to B, which is only concerned with the spec |
https://en.wikipedia.org/wiki/Family%20Plots | Family Plots is an American reality series that followed the ongoing events and employees at the family-run Poway Bernardo Mortuary in Poway, California. It ran for four seasons on the A&E Network.
Overview
The show centered on the relationships between the employees, for instance Chuck Wissmiller and his three daughters – all of whom worked together at the mortuary during the show's run. Each episode featured one or two funerals with families who shared their grief while celebrating the life and contributions of their loved ones. The departed themselves were seen from time to time on the show, but care was taken by the crew to portray their memory respectfully. While the work done in the preparation room was also shown, the more graphic portions of mortuary work were depicted deferentially.
The show was also aired on the Seven Network in Australia, in Canada, and Europe.
See also
Six Feet Under – an HBO series about a fictional funeral home
List of reality television programs
Lloyd M. Bucher – a US Navy commander whose funeral was handled from Poway Bernardo Mortuary, and whose funeral was the focus of an episode on the series
References
External links
The Poway Bernardo Mortuary web site
A&E (TV network) original programming
2000s American reality television series
2004 American television series debuts
2005 American television series endings
English-language television shows
Television shows about death
Television shows set in San Diego |
https://en.wikipedia.org/wiki/Priority%20inheritance | In real-time computing, priority inheritance is a method for eliminating unbounded priority inversion. Using this programming method, a process scheduling algorithm increases the priority of a process (A) to the maximum priority of any other process waiting for any resource on which A has a resource lock (if it is higher than the original priority of A).
The basic idea of the priority inheritance protocol is that when a job blocks one or more high-priority jobs, it ignores its original priority assignment and executes its critical section at an elevated priority level. After executing its critical section and releasing its locks, the process returns to its original priority level.
Example
Consider three jobs:
Suppose that both H and L require some shared resource. If L acquires this shared resource (entering a critical section), and H subsequently requires it, H will block until L releases it (leaving its critical section). Without priority inheritance, process M could preempt process L during the critical section and delay its completion, in effect causing the lower-priority process M to indirectly preempt the high-priority process H. This is a priority inversion bug.
With priority inheritance, L will execute its critical section at H's high priority whenever H is blocked on the shared resource. As a result, M will be unable to preempt L and will be blocked. That is, the higher-priority job M must wait for the critical section of the lower priority job L to be executed, because L has inherited H's priority. When L exits its critical section, it regains its original (low) priority and awakens H (which was blocked by L). H, having high priority, preempts L and runs to completion. This enables M and L to resume in succession and run to completion without priority inversion.
Operating systems supporting priority inheritance
FreeRTOS
Microsoft Azure RTOS, formerly Express Logic's ThreadX
Linux
VxWorks
See also
Priority ceiling protocol
References
External links
"Priority Inheritance: The Real Story" by Doug Locke
"Against Priority Inheritance" by Victor Yodaiken
"Implementing Concurrency Control With Priority Inheritance in Real-Time CORBA" by Steven Wohlever, Victor Fay Wolfe and Russell Johnston
"Priority Inheritance Spin Locks for Multiprocessor Real-Time Systems" by Cai-Dong Wang, Hiroaki Takada and Ken Sakamura
"Hardware Support for Priority Inheritance" by Bilge E. S. Akgul, Vincent J. Mooney, Henrik Thane and Pramote Kuacharoen
Real-time computing
Concurrency control |
https://en.wikipedia.org/wiki/Train%20simulator | A train simulator (also railroad simulator or railway simulator) is a computer based simulation of rail transport operations. They are generally large complicated software packages modeling a 3D virtual reality world implemented both as commercial trainers, and consumer computer game software with 'play modes' which lets the user interact by stepping inside the virtual world. Because of the near view modeling, often at speed, train simulator software is generally far more complicated software to write and implement than flight simulator programs.
Industrial train simulations
Like flight simulators, train simulators have been produced for railway training purposes. Driver simulators include those produced by:
Avansim, based in the UK and Germany
Transurb Simulation, a Belgian-based company
FAAC (the training division of Arotech Corporation) in the United States
Ongakukan in Japan
EADS in Germany
Bentley Systems in the UK
Lander Simulation & Training Solutions, Spain
CORYS, a French company with offices in Grenoble, France and Jacksonville, FL, USA
Krauss-Maffei Wegmann GmbH & Co KG (KMW), a German company based in Munich
Oktal Sydac in Australia, France, India and the UK
SMART Simulatation - part of the Neokon Baltija group from Lithuania with offices in the UK and Russia.
New York Air Brake, an American company based in Watertown, NY.
PS Technology, an American company based in Boulder, CO.
Signaller training simulators have been developed by Funkwerk in Germany, The Railway Engineering Company (TRE) in the UK, OpenTrack Railway Technology in Switzerland, and PS Technology in the US.
Types of train simulators
There are various types of train driving simulators that are adapted to varying training needs and can be combined to meet operators' training needs in the most efficient way.
Full-cabin simulators
Similarly to flight simulators, train simulators can be a replica of a full driving cabin, on a one-to-one scale. This type of simulator is opted for when a train operator needs an immersive training tool for particularly effective training sessions.
Intermediate, more compact simulators
Certain simulators can uphold a certain level of immersion while optimising the space of a training room. When a certain balance between immersion and scalability is needed, this type of simulator is chosen by instructors.
Portable simulators
When a train operator has various training centres, it is sometimes easier and more logical to invest in smaller simulators that can be transported from one centre to another. The company Transurb Simulation was the first to propose such a tool, which has now been adopted by many operators around the world and is becoming of a growing interest for smaller operators.
Consumer train simulation
Many consumer train simulations have been produced, often focusing on different aspects of real-life railways.
Driving simulation
Train driving simulation games usually allow a user to have a "driver's view" fr |
https://en.wikipedia.org/wiki/Anisotropic%20filtering | In 3D computer graphics, anisotropic filtering (abbreviated AF) is a method of enhancing the image quality of textures on surfaces of computer graphics that are at oblique viewing angles with respect to the camera where the projection of the texture (not the polygon or other primitive on which it is rendered) appears to be non-orthogonal (thus the origin of the word: "an" for not, "iso" for same, and "tropic" from tropism, relating to direction; anisotropic filtering does not filter the same in every direction).
Like bilinear and trilinear filtering, anisotropic filtering eliminates aliasing effects, but improves on these other techniques by reducing blur and preserving detail at extreme viewing angles.
Anisotropic filtering is relatively intensive (primarily memory bandwidth and to some degree computationally, though the standard space–time tradeoff rules apply) and only became a standard feature of consumer-level graphics cards in the late 1990s. Anisotropic filtering is now common in modern graphics hardware (and video driver software) and is enabled either by users through driver settings or by graphics applications and video games through programming interfaces.
An improvement on isotropic MIP mapping
From this point forth, it is assumed the reader is familiar with MIP mapping.
If we were to explore a more approximate anisotropic algorithm, RIP mapping, as an extension from MIP mapping, we can understand how anisotropic filtering gains so much texture mapping quality. If we need to texture a horizontal plane which is at an oblique angle to the camera, traditional MIP map minification would give us insufficient horizontal resolution due to the reduction of image frequency in the vertical axis. This is because in MIP mapping each MIP level is isotropic, so a 256 × 256 texture is downsized to a 128 × 128 image, then a 64 × 64 image and so on, so resolution halves on each axis simultaneously, so a MIP map texture probe to an image will always sample an image that is of equal frequency in each axis. Thus, when sampling to avoid aliasing on a high-frequency axis, the other texture axes will be similarly downsampled and therefore potentially blurred.
With MIP map anisotropic filtering, in addition to downsampling to 128 × 128, images are also sampled to 256 × 128 and 32 × 128 etc. These anisotropically downsampled images can be probed when the texture-mapped image frequency is different for each texture axis. Therefore, one axis need not blur due to the screen frequency of another axis, and aliasing is still avoided. Unlike more general anisotropic filtering, the MIP mapping described for illustration is limited by only supporting anisotropic probes that are axis-aligned in texture space, so diagonal anisotropy still presents a problem, even though real-use cases of anisotropic texture commonly have such screenspace mappings.
Although implementations are free to vary their methods, MIP mapping and the associated axis aligned constraints mea |
https://en.wikipedia.org/wiki/List%20of%20computer%20graphics%20and%20descriptive%20geometry%20topics | This is a list of computer graphics and descriptive geometry topics, by article name.
2D computer graphics
2D geometric model
3D computer graphics
3D projection
Alpha compositing
Anisotropic filtering
Anti-aliasing
Axis-aligned bounding box
Axonometric projection
Bézier curve
Bézier surface
Bicubic interpolation
Bilinear interpolation
Binary space partitioning
Bitmap graphics editor
Bounding volume
Bresenham's line algorithm
Bump mapping
Collision detection
Color space
Colour banding
Computational geometry
Computer animation
Computer-generated art
Computer painting
Convex hull
Curvilinear perspective
Cylindrical perspective
Data compression
Digital raster graphic
Dimetric projection
Distance fog
Dithering
Elevation
Engineering drawing
Flat shading
Flood fill
Geometric model
Geometric primitive
Global illumination
Gouraud shading
Graphical projection
Graphics suite
Heightfield
Hidden face removal
Hidden line removal
High-dynamic-range rendering
Isometric projection
Lathe (graphics)
Line drawing algorithm
Linear perspective
Mesh generation
Motion blur
Orthographic projection
Orthographic projection (geometry)
Orthogonal projection
Perspective (graphical)
Phong reflection model
Phong shading
Pixel shaders
Polygon (computer graphics)
Procedural surface
Projection
Projective geometry
Quadtree
Radiosity
Raster graphics
Raytracing
Rendering (computer graphics)
Reverse perspective
Scan line rendering
Scrolling
Technical drawing
Texture mapping
Trimetric projection
Vanishing point
Vector graphics
Vector graphics editor
Vertex shaders
Volume rendering
Voxel
See also
List of geometry topics
List of graphical methods
Computing-related lists
Mathematics-related lists |
https://en.wikipedia.org/wiki/Enum | ENUM or enum may refer to:
E.164 Number Mapping, a suite of protocols to unify the telephone system with the Internet
An enumerated type, a data type consisting of a set of named values |
https://en.wikipedia.org/wiki/Hosts%20%28file%29 | The computer file hosts is an operating system file that maps hostnames to IP addresses. It is a plain text file. Originally a file named HOSTS.TXT was manually maintained and made available via file sharing by Stanford Research Institute for the ARPANET membership, containing the hostnames and address of hosts as contributed for inclusion by member organizations. The Domain Name System, first described in 1983 and implemented in 1984, automated the publication process and provided instantaneous and dynamic hostname resolution in the rapidly growing network. In modern operating systems, the hosts file remains an alternative name resolution mechanism, configurable often as part of facilities such as the Name Service Switch as either the primary method or as a fallback method.
Purpose
The hosts file is one of several system facilities that assists in addressing network nodes in a computer network. It is a common part of an operating system's Internet Protocol (IP) implementation, and serves the function of translating human-friendly hostnames into numeric protocol addresses, called IP addresses, that identify and locate a host in an IP network.
In some operating systems, the contents of the hosts file is used preferentially to other name resolution methods, such as the Domain Name System (DNS), but many systems implement name service switches, e.g., nsswitch.conf for Linux and Unix, to provide customization. Unlike remote DNS resolvers, the hosts file is under the direct control of the local computer's administrator.
File content
The hosts file contains lines of text consisting of an IP address in the first text field followed by one or more host names. The host names map to the IPs, not vice versa. Each field is separated by white space – tabs are often preferred for historical reasons, but spaces are also used. Comment lines may be included; they are indicated by an octothorpe (#) in the first position of such lines. Entirely blank lines in the file are ignored. For example, a typical hosts file may contain the following:
127.0.0.1 localhost loopback
::1 localhost
This example only contains entries for the loopback addresses of the system and their host names, a typical default content of the hosts file. The example illustrates that an IP address may have multiple host names (localhost and loopback), and that a host name may be mapped to both IPv4 and IPv6 IP addresses, as shown on the first and second lines respectively.
Location in the file system
The location of the hosts file in the file system hierarchy varies by operating system. It is usually named hosts, without an extension.
History
The ARPANET, the predecessor of the Internet, had no distributed host name database. Each network node maintained its own map of the network nodes as needed and assigned them names that were memorable to the users of the system. There was no method for ensuring that all references to a given node in a network were using the same name, nor was |
https://en.wikipedia.org/wiki/Carl%20J.%20Meade | Carl Joseph Meade (born November 16, 1950) is a former NASA astronaut.
Personal data
Born November 16, 1950, at Chanute Air Force Base, Illinois. Married. Two sons. Resides in Canyon Country, California. He enjoys woodworking, home-built aircraft construction, racquetball, jogging, and snow skiing. His parents were John Migliorini (later changed to Meade) and Esther Josephine Compitiello.
He graduated in 1968 from Randolph High School, on Randolph Air Force Base, in Texas. In 1973 he received a Bachelor of Science degree (with honors) in Electronics Engineering from The University of Texas and in 1975 completed a Master of Science degree in Electronics Engineering from California Institute of Technology. He currently works for Northrop Grumman Integrated Systems as an engineering manager on the Crew Exploration Vehicle project.
Experience
Prior to entering active duty in the United States Air Force, Meade was a Hughes Fellow at the California Institute of Technology and an electronics design engineer at Hughes Aircraft Company in Culver City, California. He entered the U.S. Air Force at Laughlin Air Force Base, Texas, where he was a distinguished graduate of Undergraduate Pilot Training. In 1977, Meade was assigned to the 363rd Tactical Reconnaissance Wing at Shaw Air Force Base, South Carolina, where he flew the RF-4C. He was then selected as a member of the USAF Test Pilot School Class 80B. Upon graduation he received the Liethen-Tittle Award as the Outstanding Test Pilot and was assigned to the 6510th Test Wing at Edwards Air Force Base, California. In 1985, he was reassigned to the USAF Test Pilot School as a test pilot instructor in the F-4, A-7 Corsair II, A-37, and various gliders, teaching performance, stability/control, departure/spins, and radar flight test techniques. He was also the departure/spin lead instructor and avionics systems test training aircraft program manager.
He has logged over 4,800 hours of jet time in 27 different aircraft.
NASA experience
Selected by NASA in June 1985, Meade became an astronaut in July 1986. He has held a variety of technical assignments including verification testing of flight software in the Shuttle Avionics Integration Laboratory (SAIL), crew escape flight tests, Orbiter ground egress tests and launch support duties, both at the Kennedy Space Center and at the Vandenberg Launch Site. Prior to STS-38 and after STS-50, Meade was the Astronaut Office representative to the Solid Rocket Booster Program and the Space Shuttle Main Engine Program at the Marshall Space Flight Center. He also served as a spacecraft communicator (CAPCOM) in Mission Control and the lead astronaut for Rendezvous and Docking Operations during the two years following STS-50.
A veteran of three space flights, Meade has logged over 712 hours in space. He served as a mission specialist on STS-38 in 1990, STS-50 in 1992, and STS-64 in 1994.
STS-38 launched at night from the Kennedy Space Center, Florida, on November 15, 1990 |
https://en.wikipedia.org/wiki/Lee%20Morin | Lee Miller Emile Morin (born September 9, 1952) is a United States Navy Captain and NASA astronaut. He flew on STS-110 in 2002.
Personal data
Born in Manchester, New Hampshire, Morin is married with two children and three grandchildren. An amateur machinist, he enjoys math and jogging.
Education
1970: Graduated from the Western Reserve Academy, Hudson, Ohio
1974: Received a Bachelor of Science degree in Mathematical/Electrical science from the University of New Hampshire
1978: Received a Master of Science degree in Biochemistry from New York University
1981: Received a Doctorate of Medicine degree from New York University School of Medicine
1982: Received a Doctorate of Microbiology degree from New York University
1988: Received a Master of Public Health degree from the University of Alabama at Birmingham
2008: Received a Master in Science degree in Physics from the University of Houston Clear Lake
Organizations
Aerospace Medical Association
Force Recon Association
Undersea and Hyperbaric Medical Society
Society of United States Naval Flight Surgeons.
Awards
Meritorious Service Medal
Navy Commendation Medal
Navy Achievement Medal
Navy Unit Commendation
Meritorious Unit Commendation (two awards)
Overseas Service Ribbon
National Defense Service Medal
Kuwait Liberation Medal (Kuwait)
Southwest Asia Service Medal
Expert Pistol Medal
Expert Rifle Medal
Badges
Captain Morin has been awarded the following US Navy Badges:
US Navy Astronaut Wings aboard STS-110
US Navy Flight Medical Office's Wings while at Naval Aerospace Medical Institute in Pensacola, Florida
US Navy Diving Officer's Badge and US Navy Submarine Medical Officer's Badge while serving aboard the USS Henry M. Jackson (SSBN-730)
Special honors
Recipient of the 1994 Chairman of the Joint Chiefs of Staff Award for Excellence in Military Medicine (also known as the Fisher Award)
Finalist of the 1995 Innovations in American Government Award from the John F. Kennedy School of Government at Harvard University and the Ford Foundation
Received the 1996 Sustaining Membership Lecture Award for the Association of Military Surgeons of the United States.
Experience
After graduating from the University of New Hampshire in 1974, Morin worked at the Massachusetts Institute of Technology in the laboratory now known as the Media Lab. Morin matriculated at New York University School of Medicine in 1974, received a Master of Science in Biochemistry in 1978, an M.D. in 1981, and a Ph.D. in Microbiology in 1982. He then completed two years of residency training in General Surgery at the Bronx Municipal Hospital Center and at Montefiore Medical Center in The Bronx, New York City.
In 1982, Morin received a Direct Commission in the U.S. Naval Reserve. In 1983, he entered active duty and attended the Naval Undersea Medical Institute in Groton, Connecticut. He was designated as an Undersea Medical Officer in 1983. He joined the crew of the submarine at the Electric Boat Company Shipyards in Groton. He remain |
https://en.wikipedia.org/wiki/Joe%20job | A Joe job is a spamming technique that sends out unsolicited e-mails using spoofed sender data. Early Joe jobs aimed at tarnishing the reputation of the apparent sender or inducing the recipients to take action against them (see also email spoofing), but they are now typically used by commercial spammers to conceal the true origin of their messages and to trick recipients into opening emails apparently coming from a trusted source.
Origin and motivation
The name "Joe job" originated from such a spam attack on Joe Doll, webmaster of joes.com, in early 1997. One user's joes.com account was removed because of advertising through spam. In retaliation, the user sent new spam with headers forged to make it appear that Joe Doll was responsible. Besides prompting angry replies, it also caused joes.com to fall prey to denial-of-service attacks, from anti-spam vigilantes who thought he had sent the mail, which temporarily took the site down.
Some e-mail Joe jobs are acts of revenge like the original, whether by individuals or by organizations that also use spam for other purposes. Spammers use the technique to cycle through domains and to try to get around spam filters and blocks.
Joe-jobbers could also be businesses trying to defame a competitor or a spammer trying to harm the reputation of an anti-spam group or filtering service. Joe job attacks in other media are often motivated politically or through personal enmity.
Form
Joe jobs usually look like normal spam, although they might also disguise themselves as other types of scams or even as legitimate (but misdirected) messages.
Joe jobbing (or "joeing") can take different forms, but most incidents involve either e-mail or Usenet. They are sometimes seen on instant messaging systems as well. In general, joe jobbing is seen only on messaging systems with weak or no sender authentication, or where most users will assume the purported sender to be the actual one.
If the Joe-jobber is imitating a normal spam, it will simply advertise the victim's product, business or website. It may also claim that the victim is selling illegal or offensive items such as illegal drugs, automatic weapons or child pornography to increase the likelihood that the recipient will take action against the victim.
When imitating a scam, such as a Nigerian scam, or phishing scheme, the e-mail will still feature links to the victim's website or include contact information. In these instances, the joe-jobber is hoping that the recipient will notice the e-mail is fake, but mistakenly think the victim is behind the "scam".
When imitating a legitimate e-mail, the joe job will usually pose as an order confirmation. These "confirmations" may ask for credit card information, in which event the attack differs from phishing only in intent, not methodology, or simply imply that the recipient has already bought something from the store (leading the recipient to fear their credit card has already been charged). Like the "normal spam" jobs |
https://en.wikipedia.org/wiki/Kazehakase | Kazehakase (Japanese: ) was a web browser for Unix-like operating systems that uses the GTK+ libraries. Kazehakase embeds the Gecko layout engine as well as GTK+ WebKit.
The browser is named after the short story "Kazehakase" by the Japanese author Ango Sakaguchi; its literal meaning is "Dr. Wind" (a PhD rather than a medical doctor).
Features
Notable features include:
Support for RSS as well as its Japanese variants LIRS and HINA-DI
Drag-and-drop of browser tabs
Mouse gestures
Import of bookmarks from Mozilla Firefox, Mozilla Application Suite, Netscape Browser, Galeon, Konqueror, and w3m; shared bookmarks (with XBEL)
"Smart Bookmarks" programmable with regular expressions
Full text search in browser history
References
External links
Kazehakase project on OSDN
Review (unspecified date) of version 0.3
Review (March 2007) of unspecified version
Review (April 2007) of version 0.4.5
Gopher clients
POSIX web browsers
Free web browsers
Discontinued web browsers
Gecko-based software
News aggregator software
Web browsers that use GTK |
https://en.wikipedia.org/wiki/Temporary%20file | A temporary file is a file created to store information temporarily, either for a program's intermediate use or for transfer to a permanent file when complete. It may be created by computer programs for a variety of purposes, such as when a program cannot allocate enough memory for its tasks, when the program is working on data bigger than the architecture's address space, or as a primitive form of inter-process communication.
Auxiliary memory
Modern operating systems employ virtual memory, however programs that use large amounts of data (e.g. video editing) may need to create temporary file(s).
Inter-process communication
Most operating systems offer primitives such as pipes, sockets or shared memory to pass data among programs, but often the simplest way (especially for programs that follow the Unix philosophy) is to write data into a temporary file and inform the receiving program of the location of the temporary file.
Creation
Operating systems and programming languages typically provide functions for obtaining unique temporary file names.
On POSIX systems, temporary files can be safely created with the mkstemp or library functions. Some systems provide the former POSIX (now removed) program. These files are typically located in the standard temporary directory, /tmp on Unix machines or %TEMP% (which is log-in specific) on Windows machines.
A temporary file created with is deleted automatically when the program exits or the file is closed. To generate a temporary file name that will survive past the lifespan of the creating program, (POSIX) or GetTempFileName(...) (Windows) can be used.
Issues
Some programs create temporary files and then leave them behind - they do not delete them. This can happen because the program crashed or the developer of the program simply forgot to add the code needed to delete the temporary files after the program is done with them. The temporary files left behind can accumulate over time and consume a lot of disk space.
Temporary files may be deleted manually. Operating systems may clear out the temporary directory on a reboot, and they may have "cleaner" scripts that remove files if they have not been accessed in a certain amount of time. Also, memory-based filesystems, such as tmpfs, inherently do not preserve files across a reboot.
See also
Temp File Cleaner
Temporary folder
Temporary filesystem
Temporary variable
References
Computer file systems |
https://en.wikipedia.org/wiki/CNNNN | CNNNN (Chaser NoN-stop News Network) is a Logie Award winning Australian television program, satirising American news channels CNN and Fox News. It was produced and hosted by comedy team The Chaser.
CNNNN'''s slogan was "We Report, You Believe.", a parody of Fox News' slogan "We Report, You Decide."
In April 2004, CNNNN won a Logie Award for Most Outstanding Comedy Program, an award that was shared with Kath & Kim.
Overview
The program was presented as a "live" feed from a fictional 24-hour news channel, anchored by Craig Reucassel and Chris Taylor. Each episode had a theme which carried through the episode, examples (from the DVD) included:
Lunchgate: A businessman accidentally leaves his lunch at home and is pursued by police and the media in an O. J. Simpson style chase and becomes a suspected terrorist.
Cadman for PM: CNNNN beats up a comment by minor Australian politician Alan Cadman as a leadership challenge against Prime Minister John Howard.
Shush For Bush: US President George W. Bush is visiting Australia for 20 hours, and is believed to want to sleep the entire visit. CNNNN exhorts Australia to be quiet so the President can sleep properly.
Animal Farm: The Chaser "reality show" Animal Farm is a send-up of Big Brother. CNNNN covers the controversy when one of the contestants dies, but is not removed from the house.
Packer Health Crisis: Live updates on the health of Australian businessman Kerry Packer.
Tilt Australia: CNNNN aims to reduce the water-shortage crisis in inland Australia by tilting the entire continent to drain the water from the Eastern seaboard. Radio announcer Alan Jones was duped by the Chaser team live on air for believing this concept.
Season 1
Season 2
Cast members
The roles of other members of the Chaser team included:
Charles Firth: played a hard-hitting reporter with highly-controversial opinions presented in segments called The Firth Factor, The Firth Report and Firth and Friends in which he abuses his guests, doing such things as gagging them and yelling in their face. The character could be interpreted as a parody of Bill O'Reilly, who hosts a program on Fox News Channel called the O'Reilly Factor, as well as Fox and Friends. An example of his hard hitting style, "100% of kids who smoke and have their brain removed, end up DEAD!"
Andrew Hansen: the leader of the CNNNN "newsband", which would play musical commentary for some stories, and occasionally lyrically interact with the other members of the cast as if actually talking to them. He was also Rudi J Blass, the director of Newstainment, who would create game shows and entertainment pieces based around big news stories: "They say comedy equals tragedy plus time, well I say game show equals tragedy plus now'." Rudi J Blass often appeared in a studio very similar to that of Larry King Live and would commentate on news stories. Hansen was also Simon Target, a reporter with a thick English accent. In season one, the show started at the end of one of Simo |
https://en.wikipedia.org/wiki/Navigational%20database | A navigational database is a type of database in which records or objects are found primarily by following references from other objects. The term was popularized by the title of Charles Bachman's 1973 Turing Award paper, The Programmer as Navigator. This paper emphasized the fact that the new disk-based database systems allowed the programmer to choose arbitrary navigational routes following relationships from record to record, contrasting this with the constraints of earlier magnetic-tape and punched card systems where data access was strictly sequential.
One of the earliest navigational databases was Integrated Data Store (IDS), which was developed by Bachman for General Electric in the 1960s. IDS became the basis for the CODASYL database model in 1969.
Although Bachman described the concept of navigation in abstract terms, the idea of navigational access came to be associated strongly with the procedural design of the CODASYL Data Manipulation Language. Writing in 1982, for example, Tsichritzis and Lochovsky state that "The notion of currency is central to the concept of navigation." By the notion of currency, they refer to the idea that a program maintains (explicitly or implicitly) a current position in any sequence of records that it is processing, and that operations such as GET NEXT and GET PRIOR retrieve records relative to this current position, while also changing the current position to the record that is retrieved.
Navigational database programming thus came to be seen as intrinsically procedural; and moreover to depend on the maintenance of an implicit set of global variables (currency indicators) holding the current state. As such, the approach was seen as diametrically opposed to the declarative programming style used by the relational model. The declarative nature of relational languages such as SQL offered better programmer productivity and a higher level of data independence (that is, the ability of programs to continue working as the database structure evolves.) Navigational interfaces, as a result, were gradually eclipsed during the 1980s by declarative query languages.
During the 1990s it started becoming clear that for certain applications handling complex data (for example, spatial databases and engineering databases), the relational calculus had limitations. At that time, a reappraisal of the entire database market began, with several companies describing the new systems using the marketing term NoSQL. Many of these systems introduced data manipulation languages which, while far removed from the CODASYL DML with its currency indicators, could be understood as implementing Bachman's "navigational" vision. Some of these languages are procedural; others (such as XPath) are entirely declarative. Offshoots of the navigational concept, such as the graph database, found new uses in modern transaction processing workloads.
Description
Navigational access is traditionally associated with the network model and hierarchical m |
https://en.wikipedia.org/wiki/OpenSSI | OpenSSI is an open-source single-system image clustering system. It allows a collection of computers to be treated as one large system, allowing applications running on any one machine access to the resources of all the machines in the cluster.
OpenSSI is based on the Linux operating system and was released as an open source project by Compaq in 2001.
It is the final stage of a long process of development, stretching back to LOCUS, developed in the early 1980s.
Description
OpenSSI allows a cluster of individual computers (nodes) to be treated as one large system. Processes run on any node have full access to the resources of all nodes. Processes can be migrated from node to node automatically to balance system utilization. Inbound network connections can be directed to the least loaded node available.
OpenSSI is designed to be used for both high performance and high availability clusters. It is possible to create an OpenSSI cluster with no single point of failure, for example the file system can be mirrored between two nodes, so if one node crashes the process accessing the file will fail over to the other node. Alternatively the cluster can be designed in such a manner that every node has direct access to the file system.
Features
Single process space
OpenSSI provides a single process space – every process is visible from every node, and can be managed from any node using the normal Linux commands (ps, kill, renice and so on). The Linux /proc virtual filesystem shows all running processes on all nodes.
The implementation of the single process space is accomplished using the VPROC abstraction invented by Locus for the OSF/1 AD operating system.
Migration
OpenSSI allows migration of running processes between nodes. When running processes are migrated they continue to have access to any open files, IPC objects or network connections.
Processes can be manually migrated, either by the process calling the special OpenSSI migrate(2) system call, or by writing a node number to a special file in the processes /proc directory.
Processes may also, if the user wants, be automatically migrated in order to balance load across the cluster. OpenSSI uses an algorithm developed by the MOSIX project for determining the load on each node.
Single root
OpenSSI provides a single root for the cluster - from any node the same files and directories are available. OpenSSI uses several mechanisms to provide the single root – CFS (the OpenSSI Cluster File System), SAN cluster filesystems and parallel mounts of network file systems.
OpenSSI uses the context dependent symbolic link (CDSL) feature, inspired by HP's TruCluster system, to allow access to node-specific files in a manner transparent to non cluster-aware applications. A CDSL may point to different files on each node in the cluster.
CFS
CFS, the OpenSSI Cluster File System provides transparent inter-node access to an underlying real file system on one node.
CFS is stacked on top of the real fil |
https://en.wikipedia.org/wiki/Single%20system%20image | In distributed computing, a single system image (SSI) cluster is a cluster of machines that appears to be one single system. The concept is often considered synonymous with that of a distributed operating system, but a single image may be presented for more limited purposes, just job scheduling for instance, which may be achieved by means of an additional layer of software over conventional operating system images running on each node. The interest in SSI clusters is based on the perception that they may be simpler to use and administer than more specialized clusters.
Different SSI systems may provide a more or less complete illusion of a single system.
Features of SSI clustering systems
Different SSI systems may, depending on their intended usage, provide some subset of these features.
Process migration
Many SSI systems provide process migration.
Processes may start on one node and be moved to another node, possibly for resource balancing or administrative reasons. As processes are moved from one node to another, other associated resources (for example IPC resources) may be moved with them.
Process checkpointing
Some SSI systems allow checkpointing of running processes, allowing their current state to be saved and reloaded at a later date.
Checkpointing can be seen as related to migration, as migrating a process from one node to another can be implemented by first checkpointing the process, then restarting it on another node. Alternatively checkpointing can be considered as migration to disk.
Single process space
Some SSI systems provide the illusion that all processes are running on the same machine - the process management tools (e.g. "ps", "kill" on Unix like systems) operate on all processes in the cluster.
Single root
Most SSI systems provide a single view of the file system. This may be achieved by a simple NFS server, shared disk devices or even file replication.
The advantage of a single root view is that processes may be run on any available node and access needed files with no special precautions. If the cluster implements process migration a single root view enables direct accesses to the files from the node where the process is currently running.
Some SSI systems provide a way of "breaking the illusion", having some node-specific files even in a single root. HP TruCluster provides a "context dependent symbolic link" (CDSL) which points to different files depending on the node that accesses it. HP VMScluster provides a search list logical name with node specific files occluding cluster shared files where necessary. This capability may be necessary to deal with heterogeneous clusters, where not all nodes have the same configuration. In more complex configurations such as multiple nodes of multiple architectures over multiple sites, several local disks may combine to form the logical single root.
Single I/O space
Some SSI systems allow all nodes to access the I/O devices (e.g. tapes, disks, serial lines and so on) of othe |
https://en.wikipedia.org/wiki/Cousin%20problems | In mathematics, the Cousin problems are two questions in several complex variables, concerning the existence of meromorphic functions that are specified in terms of local data. They were introduced in special cases by Pierre Cousin in 1895. They are now posed, and solved, for any complex manifold M, in terms of conditions on M.
For both problems, an open cover of M by sets Ui is given, along with a meromorphic function fi on each Ui.
First Cousin problem
The first Cousin problem or additive Cousin problem assumes that each difference
is a holomorphic function, where it is defined. It asks for a meromorphic function f on M such that
is holomorphic on Ui; in other words, that f shares the singular behaviour of the given local function. The given condition on the is evidently necessary for this; so the problem amounts to asking if it is sufficient. The case of one variable is the Mittag-Leffler theorem on prescribing poles, when M is an open subset of the complex plane. Riemann surface theory shows that some restriction on M will be required. The problem can always be solved on a Stein manifold.
The first Cousin problem may be understood in terms of sheaf cohomology as follows. Let K be the sheaf of meromorphic functions and O the sheaf of holomorphic functions on M. A global section of K passes to a global section of the quotient sheaf K/O. The converse question is the first Cousin problem: given a global section of K/O, is there a global section of K from which it arises? The problem is thus to characterize the image of the map
By the long exact cohomology sequence,
is exact, and so the first Cousin problem is always solvable provided that the first cohomology group H1(M,O) vanishes. In particular, by Cartan's theorem B, the Cousin problem is always solvable if M is a Stein manifold.
Second Cousin problem
The second Cousin problem or multiplicative Cousin problem assumes that each ratio
is a non-vanishing holomorphic function, where it is defined. It asks for a meromorphic function f on M such that
is holomorphic and non-vanishing. The second Cousin problem is a multi-dimensional generalization of the Weierstrass theorem on the existence of a holomorphic function of one variable with prescribed zeros.
The attack on this problem by means of taking logarithms, to reduce it to the additive problem, meets an obstruction in the form of the first Chern class (see also exponential sheaf sequence). In terms of sheaf theory, let be the sheaf of holomorphic functions that vanish nowhere, and the sheaf of meromorphic functions that are not identically zero. These are both then sheaves of abelian groups, and the quotient sheaf is well-defined. The multiplicative Cousin problem then seeks to identify the image of quotient map
The long exact sheaf cohomology sequence associated to the quotient is
so the second Cousin problem is solvable in all cases provided that The quotient sheaf is the sheaf of germs of Cartier divisors on M. The quest |
https://en.wikipedia.org/wiki/Trusted%20operating%20system | Trusted Operating System (TOS) generally refers to an operating system that provides sufficient support for multilevel security and evidence of correctness to meet a particular set of government requirements.
The most common set of criteria for trusted operating system design is the Common Criteria combined with the Security Functional Requirements (SFRs) for Labeled Security Protection Profile (LSPP) and mandatory access control (MAC). The Common Criteria is the result of a multi-year effort by the governments of the U.S., Canada, United Kingdom, France, Germany, the Netherlands and other countries to develop a harmonized security criteria for IT products.
Examples
Examples of certified trusted operating systems are:
Apple Mac OS X 10.6 (Rated EAL 3+)
HP-UX 11i v3 (Rated EAL 4+)
Some Linux distributions (Rated up to EAL 4+)
Microsoft Windows 7 and Microsoft Server 2008 R2 (Rated EAL 4+)
AIX 5L with PitBull Foundation (Rated EAL 4+)
Trusted Solaris
Trusted UNICOS 8.0 (Rated B1)
XTS-400 (Rated EAL5+)
IBM VM (SP, BSE, HPO, XA, ESA, etc.) with RACF
Examples of operating systems that might be certifiable are:
FreeBSD with the TrustedBSD extensions
SELinux (see FAQ)
Companies that have created trusted operating systems include:
Addamax (BSD, SVR3, SVR4, HP/UX)
Argus Systems Group (Solaris, AIX, Linux)
AT&T (System V)
BAE Systems (XTS Unix)
Bull (AIX)
Data General (DG/UX)
Digital Equipment Corporation (Ultrix)
Forcepoint (Hardened SELinux)
Gemini Computers (GEMSOS)
General Dynamics C4 Systems (Linux)
Harris Corporation (SVR3, SVR4)
Hewlett-Packard (HP/UX)
Honeywell (Multics)
IBM (OS/390, AIX)
SCO (SCO Unix)
Secure Computing Corporation (LOCK, Mach, BSD)
SecureWare (Apple A/UX, HP/UX, SCO)
Sequent Computer Systems (Dynix/ptx)
Silicon Graphics (IRIX)
Sun Microsystems (SunOS, Solaris)
Trusted Information Systems (Xenix, Mach)
See also
Common Criteria
Comparison of operating systems
Security-evaluated operating system
Security-focused operating system
References
External links
Common Criteria Portal - certified products
NSA FAQ on SELinux
Argus Systems
Operating system security |
https://en.wikipedia.org/wiki/Compile%20farm | A compile farm is a server farm, a collection of one or more servers, which has been set up to compile computer programs remotely for various reasons. Uses of a compile farm include:
Cross-platform development: When writing software that runs on multiple processor architectures and operating systems, it can be infeasible for each developer to have their own machine for each architecture — for example, one platform might have an expensive or obscure type of CPU. In this scenario, a compile farm is useful as a tool for developers to build and test their software on a shared server running the target operating system and CPU. Compile farms may be preferable to cross-compilation as cross compilers are often complicated to configure, and in some cases compilation is only possible on the target, making cross-compilation impossible.
Cross-platform continuous integration testing: in this scenario, each server has a different processor architecture or runs a different operating system; scripts automatically build the latest version of a source tree from a version control repository. One of the difficulties of cross-platform development is that a programmer may unintentionally introduce an error that causes the software to stop functioning on a different CPU/OS platform from the one they are using. By using a cross-platform compile farm, such errors can be identified and fixed.
Distributed compilation: Building software packages typically requires operations that can be run in parallel (for example, compiling individual source code files). By using a compile farm, these operations can be run in parallel on separate machines. An example of a program which can be used to do this is distcc.
One example of a compile farm was the service provided by SourceForge until 2006. The SourceForge compile farm was composed of twelve machines of various computer architectures running a variety of operating systems, and was intended to allow developers to test and use their programs on a variety of platforms before releasing them to the public. After a power spike destroyed several of the machines it became non-operational some time in 2006, and was officially discontinued in February 2007.
Other examples are:
GCC Compile Farm https://gcc.gnu.org/wiki/CompileFarm
OpenSUSE Build Service
FreeBSD reports service which lets package maintainers test their own changes on a variety of versions and architectures.
Launchpad Build Farm https://launchpad.net/builders
Mozilla has a build farm, but it is not public https://wiki.mozilla.org/ReleaseEngineering
Debian has a build farm https://buildd.debian.org/
OpenCSW build farm for Solaris x86 and Sparc
References
Cluster computing
Servers (computing) |
https://en.wikipedia.org/wiki/Foreach%20loop | In computer programming, foreach loop (or for-each loop) is a control flow statement for traversing items in a collection. is usually used in place of a standard loop statement. Unlike other loop constructs, however, loops usually maintain no explicit counter: they essentially say "do this to everything in this set", rather than "do this times". This avoids potential off-by-one errors and makes code simpler to read. In object-oriented languages, an iterator, even if implicit, is often used as the means of traversal.
The statement in some languages has some defined order, processing each item in the collection from the first to the last.
The statement in many other languages, especially array programming languages, does not have any particular order. This simplifies loop optimization in general and in particular allows vector processing of items in the collection concurrently.
Syntax
Syntax varies among languages. Most use the simple word for, roughly as follows:
for each item in collection:
do something to item
Language support
Programming languages which support foreach loops include ABC, ActionScript, Ada, C++11, C#, ColdFusion Markup Language (CFML), Cobra, D, Daplex (query language), Delphi, ECMAScript, Erlang, Java (since 1.5), JavaScript, Lua, Objective-C (since 2.0), ParaSail, Perl, PHP, Prolog, Python, R, REALbasic, Rebol, Red, Ruby, Scala, Smalltalk, Swift, Tcl, tcsh, Unix shells, Visual Basic .NET, and Windows PowerShell. Notable languages without foreach are C, and C++ pre-C++11.
ActionScript 3.0
ActionScript supports the ECMAScript 4.0 Standard for for each .. in which pulls the value at each index.
var foo:Object = {
"apple":1,
"orange":2
};
for each (var value:int in foo) {
trace(value);
}
// returns "1" then "2"
It also supports for .. in which pulls the key at each index.
for (var key:String in foo) {
trace(key);
}
// returns "apple" then "orange"
Ada
Ada supports foreach loops as part of the normal for loop. Say X is an array:
for I in X'Range loop
X (I) := Get_Next_Element;
end loop;
This syntax is used on mostly arrays, but will also work with other types when a full iteration is needed.
Ada 2012 has generalized loops to foreach loops on any kind of container (array, lists, maps...):
for Obj of X loop
-- Work on Obj
end loop;
C
The C language does not have collections or a foreach construct. However, it has several standard data structures that can be used as collections, and foreach can be made easily with a macro.
However, two obvious problems occur:
The macro is unhygienic: it declares a new variable in the existing scope which remains after the loop.
One foreach macro cannot be defined that works with different collection types (e.g., array and linked list) or that is extensible to user types.
C string as a collection of char
#include <stdio.h>
/* foreach macro viewing a string as a collection of char values */
#define foreach(ptrvar, strvar) \
char* ptrvar; \
for (ptrv |
https://en.wikipedia.org/wiki/Robotic%20mapping | Robotic mapping is a discipline related to computer vision and cartography. The goal for an autonomous robot is to be able to construct (or use) a map (outdoor use) or floor plan (indoor use) and to localize itself and its recharging bases or beacons in it. Robotic mapping is that branch which deals with the study and application of ability to localize itself in a map / plan and sometimes to
construct the map or floor plan by the autonomous robot.
Evolutionarily shaped blind action may suffice to keep some animals alive. For some insects for example, the environment is not interpreted as a map, and they survive only with a triggered response. A slightly more elaborated navigation strategy dramatically enhances the capabilities of the robot. Cognitive maps enable planning capacities and use of current perceptions, memorized events, and expected consequences.
Operation
The robot has two sources of information: the idiothetic and the allothetic sources. When in motion, a robot can use dead reckoning methods such as tracking the number of revolutions of its wheels; this corresponds to the idiothetic source and can give the absolute position of the robot, but it is subject to cumulative error which can grow quickly.
The allothetic source corresponds the sensors of the robot, like a camera, a microphone, laser, lidar or sonar. The problem here is "perceptual aliasing". This means that two different places can be perceived as the same. For example, in a building, it is nearly impossible to determine a location solely with the visual information, because all the corridors may look the same. 3-dimensional models of a robot's environment can be generated using range imaging sensors or 3D scanners.
Map representation
The internal representation of the map can be "metric" or "topological":
The metric framework is the most common for humans and considers a two-dimensional space in which it places the objects. The objects are placed with precise coordinates. This representation is very useful, but is sensitive to noise and it is difficult to calculate the distances precisely.
The topological framework only considers places and relations between them. Often, the distances between places are stored. The map is then a graph, in which the nodes corresponds to places and arcs correspond to the paths.
Many techniques use probabilistic representations of the map, in order to handle uncertainty.
There are three main methods of map representations, i.e., free space maps, object maps, and composite maps. These employ the notion of a grid, but permit the resolution of the grid to vary so that it can become finer where more accuracy is needed and more coarse where the map is uniform.
Map learning
Map learning cannot be separated from the localization process, and a difficulty arises when errors in localization are incorporated into the map. This problem is commonly referred to as Simultaneous localization and mapping (SLAM).
An important additional problem |
https://en.wikipedia.org/wiki/Steel%20Panthers | Steel Panthers is a series of computer wargames, developed and published by several different companies, with various games simulating war battles from 1930 to 2025. The first Steel Panthers game was released in 1995, and the most recent update was released in 2018 and is still updated regularly (yearly).
Players control individual tanks and vehicles from a top-down perspective, on a map with a hexagonal overlay. Infantry are mostly in squad/section (8-12 men) sized units, but some units, like snipers, can be controlled individually. The whole force under a players control would typically be Battalion sized, but may be as small as a Platoon or Company, or as large as a Regiment/Brigade.
The games are turn-based and are played against the AI or other humans via email or hotseat.
Gameplay
As with other tactical turn-based wargames, the game features realistic military control, with the smallest common units being squads, up to a brigade sized force. The player takes control of nearly every aspects of warfare around his soldiers, from simple ammunition usage, to the morale, disposition, and command-chain of his troops.
The game features: packed single-battle scenarios and campaigns (either branched or linear), single battle generator, campaign generator, and long campaign generator.
All of the games in the series are quite similar in features and appearance. However, the third part in the original series is clearly distinct in that it offers platoon-size formations instead of the scale of individual tanks and squads of the other installments.
The games offer various modes of play: human vs. human (hotseat or online), human vs. AI and PBEM (play by email). The players receive historical military units at the beginning of a scenario and have the option to buy reinforcements with points earned in different ways. The units are then moved on a hexagon grid map similar to a large number of board and computerized wargames. In addition to ready-made battles and campaigns, players can customize single scenarios or create their own campaigns.
Series history
The Steel Panthers series includes the following titles:
1995 Steel Panthers by Strategic Simulations
1996 Steel Panthers: Campaign Disk by Strategic Simulations
1997 Steel Panthers: Campaign Disk #2 by Strategic Simulations
1996 Steel Panthers II: Modern Battles by Strategic Simulations
1996 Steel Panthers II: Modern Battles - Campaign Disk by Strategic Simulations
1997 Steel Panthers III: Brigade Command: 1939-1999 by Strategic Simulations
1998 SP2WW2 (Steel Panthers II: World War 2) by Camo Workshop
1999 SPWW2 by Camo Workshop
2006 WinSPWW2 by Camo Workshop, Distributed by Shrapnel Games
2000 Steel Panthers: World at War by Matrix Games
2002 SPMBT (Steel Panthers: Main Battle Tank) by Camo Workshop
2005 WinSPMBT by Camo Workshop, Distributed by Shrapnel Games
Rights to the game and source code were acquired by both Matrix Games and the Camo Workshop.
Matrix Games developed and released as a |
https://en.wikipedia.org/wiki/Carol%20Kolb | Carol Kolb is an American comedy writer. She was a writer for and editor-in-chief of The Onion, and a former head writer for the Onion News Network. She served as a writer on Kroll Show, and later worked as a staff writer on the television series Community, Review, and Brooklyn Nine-Nine.
Kolb was the founder of the now defunct Madison Museum of Bathroom Tissue.
References
American comedy writers
American television writers
The Onion people
Year of birth missing (living people)
Living people
Place of birth missing (living people)
American women television writers
People from Spencer, Wisconsin
Screenwriters from Wisconsin
21st-century American women |
https://en.wikipedia.org/wiki/North%20Clyde%20Line | The North Clyde Line (defined by Network Rail as the Glasgow North Electric Suburban line) is a suburban railway in West Central Scotland. The route is operated by ScotRail Trains. As a result of the incorporation of the Airdrie–Bathgate rail link and the Edinburgh–Bathgate line, this route has become the fourth rail link between Glasgow and Edinburgh.
Route
The North Clyde Line (known as Dunbartonshire - Glasgow, Cumbernauld and Falkirk Grahamston in timetables), electrified by British Rail in 1960, ran east–west through the Greater Glasgow conurbation, linking northern Lanarkshire with western Dunbartonshire, by way of the city centre. Fifty years later, in 2010, the line was extended by Network Rail east from Airdrie, by way of re-opening the line to Bathgate meeting up with the line re-opened by British Rail from Edinburgh.
The main core of the route runs from to via and Glasgow Queen Street (Low Level). To the east of the Glasgow city centre, there is a short branch to , while to the west there are two routes between and (via and via ), as well as branches to and .
The lines from to Dalmuir and Milngavie are also used by Argyle Line services, whilst West Highland Line services share the line between and . In the east, the line between Newbridge Junction and is shared with the Glasgow to Edinburgh via Falkirk Line and the Edinburgh to Dunblane Line. In addition to the interchange with services from Glasgow Queen Street (High Level) and Edinburgh Waverley, there are interchanges with the Cumbernauld Line at Springburn, with the Maryhill Line at , and with the Glasgow Subway at Partick. Some sections of the North Clyde Line are also traversed by freight trains.
The line runs through central Glasgow, and the principal station on the line is Glasgow Queen Street (Low Level). The section through the city centre largely runs in tunnels between High Street and the former Finnieston station (west of Charing Cross at the intersection of Argyle Street and Kent Road). This is the oldest stretch of underground railway in Glasgow, opened as the Glasgow City & District Railway in 1886 and predating the Glasgow Subway by some ten years.
History
Lists of Openings, Closures, and Re-openings
Constituents
Like most of Glasgow's suburban railways, the North Clyde Lines as they are known today were built piecemeal from a patchwork of routes from various Victorian-era railway companies. In addition to the extension east of Airdrie, these are listed below:
1842 - Haymarket to Newbridge Junction opened by Edinburgh and Glasgow Railway;
1846 - Edinburgh Waverley to Haymarket opened by Edinburgh and Glasgow Railway;
1849 - Newbridge Junction to Polkemmet Junction opened by Edinburgh and Bathgate Railway;
1850 - Dumbarton Central to Balloch Pier opened by Caledonian and Dunbartonshire Junction Railway;
1858 - Cowlairs to Bowling and Dalreoch to Helensburgh Central opened by Glasgow, Dumbarton and Helensburgh Railway;
1862 - Polkemmet Junction |
https://en.wikipedia.org/wiki/Sublanguage | A sublanguage is a subset of a language. Sublanguages occur in natural language, computer programming language, and relational databases.
In natural language
In informatics, natural language processing, and machine translation, a sublanguage is the language of a restricted domain, particularly a technical domain. In mathematical terms, "a subset of the sentences of a language forms a sublanguage of that language if it is closed under some operations of the language: e.g., if when two members of a subset are operated on, as by and or because, the resultant is also a member of that subset". This is a specific term for what in most linguistic study is referred to a language variety or register.
In computer languages
The term sublanguage has also sometimes been used to denote a computer language that is a subset of another language. A sublanguage may be restricted syntactically (it accepts a subgrammar of the original language), and/or semantically (the set of possible outcomes for any given program is a subset of the possible outcomes in the original language).
Examples
For instance, ALGOL 68S was a subset of ALGOL 68 designed to make it possible to write a single-pass compiler for this sublanguage.
SQL (Structured Query Language) statements are classified in various ways, which can be grouped into sublanguages, commonly: a data query language (DQL), a data definition language (DDL), a data control language (DCL), and a data manipulation language (DML).
In relational database theory
In relational database theory, the term "sublanguage", first used for this purpose by E. F. Codd in 1970, refers to a computer language used to define or manipulate the structure and contents of a relational database management system (RDBMS). Typical sublanguages associated with modern RDBMS's are QBE (Query by Example) and SQL (Structured Query Language). In 1985, Codd encapsulated his thinking in twelve rules which every database must satisfy in order to be truly relational. The fifth rule is known as the Comprehensive data sublanguage rule, and states:
A relational system may support several languages and various modes of terminal use (for example, the fill-in-the-blanks mode). However, there must be at least one language whose statements are expressible, per some well-defined syntax, as character strings, and that is comprehensive in supporting all of the following items:
Data definition
View definition
Data manipulation (interactive and by program)
Integrity constraints
Authorization
Transaction boundaries (begin, commit, and rollback)
References
Relational model
Language |
https://en.wikipedia.org/wiki/XPAK | XPAK may refer to:
Expansion pack, for a game console
XPAK, a smaller version of the XENPAK computer network pluggable transceiver |
https://en.wikipedia.org/wiki/Britain%20J.%20Williams | Britain J. Williams III is a Professor Emeritus of computer science at Kennesaw State University in Georgia, and is consultant with the school's Center For Election Systems. He has bachelor's and master's degrees in mathematics from the University of Georgia, and a PhD is in Statistics
from the University of Georgia in 1965. He joined the faculty of (then) Kennesaw State College in 1990.
He was a consultant to the Federal Election Commission during the development of their Voting System Standards in 1990 and again in 2002. He is currently a member of the National Association of State Election Directors Voting Systems Board and Chair of the Board's Technical Committee. He serves as a consultant to the states of Georgia, Maryland, Pennsylvania and Virginia, where he has certified electronic voting systems. In 2003, he wrote a defense of the Georgia electronic voting system in response to criticism of Diebold Election Systems (now Premier Election Solutions) systems levied by Bev Harris, author of Black Box Voting.
Williams appeared at a United States Election Assistance Commission (EAC) Public Hearing on the Use, Security and Reliability of Electronic Voting Systems in Washington, DC on 5 May 2004. Other technology panelists included
Dr. Avi Rubin, Johns Hopkins University, Information Security Institute; Stephen Berger, IEEE; and Dr. Ted Selker, MIT.
Williams is a recognized expert on electronic voting systems; he is a consultant to DES, the FEC, and four states. Williams reportedly has held a key position at the IEEE.
References
External links
Kennesaw State's Center for Election Systems
Britain Williams Curriculum Vita
Williams, Britain
Kennesaw State University faculty
University of Georgia alumni
Williams, Britain
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Computer-mediated%20reality | Computer-mediated reality refers to the ability to add to, subtract information from, or otherwise manipulate one's perception of reality through the use of a wearable computer or hand-held device such as a smartphone.
Mediated reality is a proper superset of mixed reality, augmented reality, and virtual reality, as it also includes, for example, diminished reality.
Typically, it is the user's visual perception of the environment that is mediated. This is done through the use of some kind of electronic device, such as an EyeTap device or smart phone, which can act as a visual filter between the real world and what the user perceives. Computer-mediated reality has been used to enhance visual perception as an aid to the visually impaired. This example achieves a mediated reality by altering a video input stream light that would have normally reached the user's eyes, and computationally altering it to filter it into a more useful form. It has also been used for interactive computer interfaces.
The use of computer-mediated reality to diminish perception, by the removal or masking of visual data, has been used for architectural applications, and is an area of ongoing research.
The long-term effects of altering perceived reality have not been thoroughly studied, and negative side effects of long-term exposure might be possible. Short term effects have been demonstrated with the eyestrain caused by computers.
As a seeing aid
In the 1970s and 1980s, Steve Mann introduced the Generation-1 and Generation-2 "Digital Eye Glass", initially as a vision aid to help people see better, as a welding helmet, and as a general-purpose seeing aid for everyday life as outlined in IEEE Technology & Society 31(3) and the supplemental material entitled "GlassEyes".
In this sense, mediated reality is a proper superset of mixed reality, augmented reality, and virtual reality, as it also includes, for example, diminished reality.
Window managers
One common window manager in mediated reality is the "Reality Window Manager".
Wireless mediated reality
With wireless communications, mediated reality can also become a communications medium among different communities. For example, Bluetooth devices are often used with mediated reality. With the use of EyeTap, such interaction is called "seeing eye-to-eye".
Applications
Applications of mediated reality include devices that help people see better, as well as devices for gaming and equipment repair, telemedicine, remote expert advice interfaces, and wayfinding. Mediated reality is also used in robotics and drawing applications such as the "Loose and Sketchy" drawing package.
One key application of computer-mediated reality is healthcare and medicine, which has become a popular research area, specifically beginning in the 1990s with the field growing larger over time. Common research topics include applications of computer-mediated reality in surgery, diagnosing diseases generally, and aiding care of neurodegenerative disea |
https://en.wikipedia.org/wiki/Brain%E2%80%93computer%20interface | A brain–computer interface (BCI), sometimes called a brain–machine interface (BMI) or smartbrain, is a direct communication pathway between the brain's electrical activity and an external device, most commonly a computer or robotic limb. BCIs are often directed at researching, mapping, assisting, augmenting, or repairing human cognitive or sensory-motor functions. They are often conceptualized as a human–machine interface that skips the intermediary component of the physical movement of body parts, although they also raise the possibility of the erasure of the discreteness of brain and machine. Implementations of BCIs range from non-invasive (EEG, MEG, MRI) and partially invasive (ECoG and endovascular) to invasive (microelectrode array), based on how close electrodes get to brain tissue.
Research on BCIs began in the 1970s by Jacques Vidal at the University of California, Los Angeles (UCLA) under a grant from the National Science Foundation, followed by a contract from DARPA. Vidal's 1973 paper marks the first appearance of the expression brain–computer interface in scientific literature.
Due to the cortical plasticity of the brain, signals from implanted prostheses can, after adaptation, be handled by the brain like natural sensor or effector channels. Following years of animal experimentation, the first neuroprosthetic devices implanted in humans appeared in the mid-1990s.
Recently, studies in human-computer interaction via the application of machine learning to statistical temporal features extracted from the frontal lobe (EEG brainwave) data has had high levels of success in classifying mental states (Relaxed, Neutral, Concentrating), mental emotional states (Negative, Neutral, Positive), and thalamocortical dysrhythmia.
History
The history of brain–computer interfaces (BCIs) starts with Hans Berger's discovery of the electrical activity of the human brain and the development of electroencephalography (EEG). In 1924 Berger was the first to record human brain activity by means of EEG. Berger was able to identify oscillatory activity, such as Berger's wave or the alpha wave (8–13 Hz), by analyzing EEG traces.
Berger's first recording device was very rudimentary and was a harpsichord. He inserted silver wires under the scalps of his patients. These were later replaced by silver foils attached to the patient's head by rubber bandages. Berger connected these sensors to a Lippmann capillary electrometer, with disappointing results. However, more sophisticated measuring devices, such as the Siemens double-coil recording galvanometer, which displayed electric voltages as small as one ten thousandth of a volt, led to success.
Berger analyzed the interrelation of alternations in his EEG wave diagrams with brain diseases. EEGs permitted completely new possibilities for the research of human brain activities.
Although the term had not yet been coined, one of the earliest examples of a working brain-machine interface was the piece Music for Solo P |
https://en.wikipedia.org/wiki/Database%20right | A database right is a sui generis property right, comparable to but distinct from copyright, that exists to recognise the investment that is made in compiling a database, even when this does not involve the "creative" aspect that is reflected by copyright. Such rights are often referred to in the plural: database rights.
The TRIPS Agreement requires that copyright protection extends to databases and other compilations if they constitute intellectual creation by virtue of the selection or arrangement of their contents, even if some or all of the contents do not themselves constitute materials protected by copyright. Many countries act in accordance with this requirement, as databases are protected by copyright if this condition is met, and there is no separate intellectual property right protecting databases (or any aspects of them) that do not meet the condition for copyright protection. The database right extends protection over databases which does not depend on the condition required for copyright protection, and is recognised only in a small number of jurisdictions, most notably the European Union.
Countries that recognise database rights
Australia
Section 10(1) of the Copyright Act 1968 defines "literary work" to include (a) a compilation expressed in words, figures or symbols; and (b) a computer program or compilation of computer programs. The courts have considered copyright infringement claims relating to "compilations" consisting of electronic databases in Telstra v Desktop Marketing Systems (2001) and IceTV Pty Ltd v Nine Network Australia Pty Ltd (2009).
European Union
In European Union law, database rights are specifically coded (i.e. sui generis) laws on the copying and dissemination of information in computer databases. These rights were first introduced in 1996. On 11 March 1996 the Council of the European Union passed Directive 96/9/EC of 11 March 1996 on the legal protection of databases, giving specific and separate legal rights (and limitations) to certain computer records. The law calls these database rights. Rights afforded to manual records under EU database rights laws are similar in format, but not identical, to those afforded artistic works.
Database rights last for 15 years. Each time a database is substantially modified, however, a new set of rights are created for that database. An owner has the right to object to the copying of substantial parts of their database, even if data is extracted and reconstructed piecemeal. Database rights under the EU are created automatically, vested in the employers of creators (when the action of creation was part of employment), and do not have to be registered to have effect.
Database rights are independent of copyright: The arrangement, selection, and presentation of the data may be protected by copyright, while the database as a whole can be protected by database right.
United Kingdom
On 1 January 1998, The Copyright and Rights in Databases Regulations 1997 came into force, |
https://en.wikipedia.org/wiki/Environmental%20impact%20of%20electricity%20generation | Electric power systems consist of generation plants of different energy sources, transmission networks, and distribution lines. Each of these components can have environmental impacts at multiple stages of their development and use including in their construction, during the generation of electricity, and in their decommissioning and disposal. These impacts can be split into operational impacts (fuel sourcing, global atmospheric and localized pollution) and construction impacts (manufacturing, installation, decommissioning, and disposal). All forms of electricity generation have some form of environmental impact, but coal-fired power is the dirtiest. This page is organized by energy source and includes impacts such as water usage, emissions, local pollution, and wildlife displacement.
Greenhouse gas emissions
Water usage
Water usage is one of the main environmental impacts of electricity generation. All thermal power plants (coal, natural gas, nuclear, geothermal, and biomass) use water as a cooling fluid to drive the thermodynamic cycles that allow electricity to be extracted from heat energy. Solar uses water for cleaning equipment, while hydroelectricity has water usage from evaporation from the reservoirs. The amount of water usage is often of great concern for electricity generating systems as populations increase and droughts become a concern. In addition, changes in water resources may impact the reliability of electricity generation.
Discussions of water usage of electricity generation distinguish between water withdrawal and water consumption. According to the United States Geological Survey, "withdrawal" is defined as the amount of water removed from the ground or diverted from a water source for use, while "consumption" refers to the amount of water that is evaporated, transpired, incorporated into products or crops, or otherwise removed from the immediate water environment. Both water withdrawal and consumption are important environmental impacts to evaluate.
General numbers for fresh water usage of different power sources are shown below.
Steam-cycle plants (nuclear, coal, NG, solar thermal) require a great deal of water for cooling, to remove the heat at the steam condensers. The amount of water needed relative to plant output will be reduced with increasing boiler temperatures. Coal- and gas-fired boilers can produce high steam temperatures and so are more efficient, and require less cooling water relative to output. Nuclear boilers are limited in steam temperature by material constraints, and solar thermal is limited by concentration of the energy source.
Thermal cycle plants near the ocean have the option of using seawater. Such a site will not have cooling towers and will be much less limited by environmental concerns of the discharge temperature since dumping heat will have very little effect on water temperatures. This will also not deplete the water available for other uses. Nuclear power in Japan for instance, uses |
https://en.wikipedia.org/wiki/Etoh | Etoh may refer to:
EtOH, shorthand often used for ethanol (e.g., EtOH withdrawal)
"Etoh", a song by The Avalanches from their 2001 album Since I Left You
The ETOH database, an Alcohol and Alcohol Problems Science database, produced by the NIAAA (National Institute on Alcohol Abuse and Alcoholism) |
https://en.wikipedia.org/wiki/Eval | In some programming languages, eval , short for the English evaluate, is a function which evaluates a string as though it were an expression in the language, and returns a result; in others, it executes multiple lines of code as though they had been included instead of the line including the eval. The input to eval is not necessarily a string; it may be structured representation of code, such as an abstract syntax tree (like Lisp forms), or of special type such as code (as in Python). The analog for a statement is exec, which executes a string (or code in other format) as if it were a statement; in some languages, such as Python, both are present, while in other languages only one of either eval or exec is.
Eval and apply are instances of meta-circular evaluators, interpreters of a language that can be invoked within the language itself.
Security risks
Using eval with data from an untrusted source may introduce security vulnerabilities. For instance, assuming that the get_data() function gets data from the Internet, this Python code is insecure:
session['authenticated'] = False
data = get_data()
foo = eval(data)
An attacker could supply the program with the string "session.update(authenticated=True)" as data, which would update the session dictionary to set an authenticated key to be True. To remedy this, all data which will be used with eval must be escaped, or it must be run without access to potentially harmful functions.
Implementation
In interpreted languages, eval is almost always implemented with the same interpreter as normal code. In compiled languages, the same compiler used to compile programs may be embedded in programs using the eval function; separate interpreters are sometimes used, though this results in code duplication.
Programming languages
ECMAScript
JavaScript
In JavaScript, eval is something of a hybrid between an expression evaluator and a statement executor. It returns the result of the last expression evaluated.
Example as an expression evaluator:
foo = 2;
alert(eval('foo + 2'));
Example as a statement executor:
foo = 2;
eval('foo = foo + 2;alert(foo);');
One use of JavaScript's eval is to parse JSON text, perhaps as part of an Ajax framework. However, modern browsers provide JSON.parse as a more secure alternative for this task.
ActionScript
In ActionScript (Flash's programming language), eval cannot be used to evaluate arbitrary expressions. According to the Flash 8 documentation, its usage is limited to expressions which represent "the name of a variable, property, object, or movie clip to retrieve. This parameter can be either a String or a direct reference to the object instance."
ActionScript 3 does not support eval.
The ActionScript 3 Eval Library and the D.eval API were development projects to create equivalents to eval in ActionScript 3. Both have ended, as Adobe Flash Player has reached its end-of-life.
Lisp
Lisp was the original language to make use of an eval function in 1958. In fact, de |
https://en.wikipedia.org/wiki/CHNM-DT | CHNM-DT (channel 42) is a multicultural television station licensed to Vancouver, British Columbia, Canada, part of the Omni Television network. It is owned and operated by Rogers Sports & Media alongside Citytv station CKVU-DT (channel 10). Both stations share studios at the corner of West 2nd Avenue and Columbia Street (near False Creek) in the Mount Pleasant neighbourhood of Vancouver, while CHNM-DT's transmitter is located atop Mount Seymour in the district municipality of North Vancouver.
History
Rogers Communications had made several attempts to launch a multicultural station in Vancouver similar to its successful CFMT in Toronto. Unsuccessful applications to the Canadian Radio-television and Telecommunications Commission (CRTC) were made in 1996 and again in 1999.
Asked by the federal cabinet to pursue the matter further, in 2002, the commission asked for new applications for a Vancouver multicultural station and received two – from Rogers and Multivan Broadcast, a newly formed consortium of local investors. The licence went to Multivan, with the CRTC citing its local ownership as one of the reasons for the decision. The station first signed on the air on June 27, 2003; branded on-air as "channel m," CHNM originally operated from studio facilities located at the intersection of Pender and Columbia Streets in Vancouver's Chinatown. In the mid-2000s, CHNM previously produced several station IDs and program promos using a diversity theme to capitalize on the station's former slogan "Diversity Lives Here," these including spots featuring Chinese lion dancers that emerge from their lion costume with their faces painted in orange and white, the colours of the BC Lions franchise of the Canadian Football League, along with slogans supporting the team; a South Asian dancer who performs her routine to the Channel M jingle, then breaks into a country and western dance; and a leather-clad Sikh motorcyclist who boards his bike to the Channel M jingle, arranged and performed in a style mixing ZZ Top-style blues rock with East Indian music.
Following a failed 2007 bid for the multicultural licences in Calgary and Edmonton, which were awarded to Rogers, Multivan announced an agreement to sell CHNM to Rogers in July of that year. The sale was approved by the CRTC on March 31, 2008, and was finalized on April 30, 2008. With Rogers' recent acquisition of Citytv station CKVU-TV (channel 10) and the resulting sale of religious station CHNU-TV (channel 66, formerly branded as "Omni.10") to S-VOX, the Omni Television brand moved to CHNM on September 1, 2008.
CHNM migrated its operations into sister station CKVU's studio facilities at 180 West 2nd Avenue (near the Vancouver Olympic Village) on September 7, 2010. That same year, CHNM won its first-ever Jack Webster Foundation Award for Excellence in Chinese Language Reporting, for a multi-part feature on the topic of earthquake preparedness.
Programming
Along with carrying local newscasts, CHNM broadcasts pr |
https://en.wikipedia.org/wiki/Animal%20Planet%20%28Canadian%20TV%20channel%29 | Animal Planet is a Canadian English language discretionary specialty television channel. Animal Planet broadcasts a variety of programming featuring animals.
The channel is owned by the Animal Planet Canada Company, which is a consortium consisting of CTV Speciality Television Inc. which owns 80% of the company (CTV Speciality Television Inc. is a division of Bell Media who owns 70% and ESPN owning 30%), and Canadian AP Ventures Company who owns 20% (Canadian AP Ventures Company is owned by BBC Studios at 50% and Warner Bros. Discovery at 50%). Through this ownership structure, this effectively gives Bell Media 56% ownership and control, with ESPN 24%, BBC Studios 10%, and Warner Bros. Discovery 10% ownership.
History
In November 2000, CTV Inc. was granted approval by the Canadian Radio-television and Telecommunications Commission (CRTC) to launch Animal Planet, a service described as being "broadly based on family entertainment that will combine high-quality Canadian programming and attractive series and documentaries from Animal Planet in the United States."
The channel was launched under its current ownership structure (with the exception of Bell Media, wherein Bell Globemedia, later renamed CTVglobemedia, owned its shares at the time) on September 7, 2001.
On June 30, 2008, Animal Planet unveiled a new on-air appearance, including a new logo and graphics, to align itself with the American service which had updated its appearance earlier that year.
On September 10, 2010, BCE (a minority shareholder in CTVglobemedia) announced that it planned to acquire 100% interest in CTVglobemedia for a total debt and equity transaction cost of $3.2 billion CAD. The deal which required CRTC approval, was approved on March 7, 2011 and closed on April 1 of that year, on which CTVglobemedia was rebranded Bell Media.
Animal Planet HD
On June 17, 2011, Bell Media announced that it would launch Animal Planet HD, a high definition (HD) simulcast of the standard definition feed, by the end of 2011. The channel launched on December 15, 2011, initially on Bell Fibe TV and Shaw Cable and launched at a later date on Telus TV. About six years later, Shaw Direct added it and 5 other HD channels (Business News Network, Cooking Channel, Crime & Investigation, OWN, and Travel + Escape) to the channel listing on September 21, 2017.
Logos
References
External links
Digital cable television networks in Canada
Bell Media networks
Warner Bros. Discovery Americas
English-language television stations in Canada
Television channels and stations established in 2001
2001 establishments in Canada |
https://en.wikipedia.org/wiki/BookTelevision | BookTelevision was a Canadian English language specialty channel owned by Bell Media.
The channel was originally established in 2001 by CHUM Limited, airing programming relating to books, literature, and various media. The network later shifted primarily to airing Bell Media library programming with little relevance to its original format. Amid declining investments in the channel, BookTelevision was shut down on February 21, 2021.
History
In November 2000, Learning and Skills Television of Alberta, a company majority owned by CHUM Limited (60%), was awarded a category 1 television broadcasting licence by the Canadian Radio-television and Telecommunications Commission (CRTC) called BookTelevision - The Channel, described as "a national English-language Category 1 specialty television service that will feature magazines and talk shows, dramas and documentaries that are exclusively based upon printed and published works, and offered with additional programming that provides an educational context and promotes reading."
The channel was launched on September 7, 2001. Although, shortly after the channel's launch, "The Channel" was dropped from its name and logo, resulting in a name change to simply BookTelevision.
On February 15, 2005, CHUM completed the purchase of the remaining interest in LSTA, bringing its ownership to 100 percent. A year later, in July 2006, Bell Globemedia (later renamed CTVglobemedia) announced that it would purchase CHUM for an estimated $1.7 billion CAD, included in the sale was LSTA and its interest in BookTelevision. The sale was subject to CRTC approval and was approved in June 2007, with the transaction completed on June 22, 2007. In 2008, LSTA (then known as Access Media Group) was wound up into CTV Limited (the renamed CHUM Limited).
On September 10, 2010, BCE (a minority shareholder in CTVglobemedia) announced that it planned to acquire 100% interest in CTVglobemedia for a total debt and equity transaction cost of $3.2 billion CAD. The deal which required CRTC approval, was approved on March 7, 2011 and closed on April 1 of that year, on which CTVglobemedia was rebranded Bell Media.
Along with Fashion Television, the channel later abandoned its original format, and began to primarily air reruns of library programming from other Bell Media networks, and after CRTC category restrictions were repealed in 2015, reruns of dramas such as JAG and Matlock, properties that had no literary inspiration. The channel ceased investments in original Canadian programming, and was rarely promoted by Bell. In January 2021, the CRTC approved a request by Bell to revoke BookTelevision and Fashion Television's licenses, stating that it planned to shut both channels down on February 21.
References
External links
Original CRTC Broadcast Decision
Defunct television networks in Canada
2001 establishments in Canada
2021 disestablishments in Canada
Digital cable television networks in Canada
Television channels and stations establish |
https://en.wikipedia.org/wiki/CTV%20Comedy%20Channel | CTV Comedy Channel (often shortened to CTV Comedy and formerly known as The Comedy Network) is a Canadian English-language discretionary specialty channel owned by Bell Media which focuses primarily on comedy programming. The channel first launched on October 17, 1997, and operates two time-shifted feeds, running on Eastern and Pacific Time Zone schedules.
History
In September 1996, 1155636 Ontario Inc. (a company majority controlled by Baton Broadcasting, with the remaining interests held by Shaw Cable and Astral Broadcasting.) was granted a television broadcasting licence by the Canadian Radio-television and Telecommunications Commission (CRTC). The channel launched on October 17, 1997 as The Comedy Network, and used the slogan "Time well wasted", a parody of the slogan of U.S. channel A&E's at the time, "Time well spent".
Through various acquisitions over the years, Shaw, Astral and Les Films Rozon sold their interest in the service to Baton, which became Bell Globemedia in 2001, renamed CTVglobemedia in 2007. BCE gained control of The Comedy Network on April 1, 2011, through its takeover of CTVglobemedia, in effective changing the company's name to Bell Media.
Over the years, the channel has gone through multiple rebrands; from 2000 to 2005, the logo was given a "crudely drawn" look; the logo's colors were removed, leaving the logo black. In 2005, the channel's logo was changed from 2D to 3D; the logo's colors were brought back. On November 1, 2011, The Comedy Network was relaunched with a new look, consisting a new simplified logo and revamped on-air presentation. Their longtime slogan was also retired on this date.
On July 12, 2012, The Comedy Network launched a high-definition simulcast feed available through all major TV providers.
In August 2013, the CRTC denied an amendment to The Comedy Network's license, which would have reduced the amount of Canadian-produced content the network would have been required to air monthly, increase the amount of animated programming it could air from 10% of its lineup per day to 20% per month, and allow it to air films that were not Canadian-made. Bell argued that the network was at a disadvantage against BiteTV and Teletoon, because Comedy was unable to give its animated acquisitions a larger amount of exposure (such as marathons) due to the restriction. The CRTC rejected its arguments in response to complaints by the two networks cited and other unions, due to their differing natures of service and because Bell's proposed changes were intended primarily to decrease the amount of Canadian content it airs in favour of more U.S.-originated programming. Subsequently, a number of acquired Comedy Network programs were moved to its sister channel Much in the fall of 2013.
Further changes to The Comedy Network's schedule occurred in the 2017–18 season, with the network aligning its primetime lineup with reruns of sitcoms (such as Friends) to target a wider range of viewers (including women), and provide |
https://en.wikipedia.org/wiki/Investigation%20Discovery%20%28Canadian%20TV%20channel%29 | Investigation Discovery is a Canadian Discretionary service owned by Bell Media. Based on the U.S cable network of the same name, the channel focuses on true crime programming.
Originally launching as a Canadian version of Court TV, it was relaunched on August 30, 2010 under its current branding as part of a licensing arrangement with Warner Bros. Discovery.
History
As CourtTV Canada
In November 2000, Learning and Skills Television of Alberta, a company majority owned by CHUM Limited (60%) and owners of Access, was granted permission by the Canadian Radio-television and Telecommunications Commission (CRTC) to launch a television channel called "The Law & Order Channel", described as "a national English-language Category 2 specialty television service that will feature entertainment programming about police, law, the courts, emergency and medical response teams, disaster and relief operations featuring people and organizations that uphold law and order in our society."
The channel was launched on September 7, 2001 as Court TV Canada. The channel replaced the U.S. Court TV service, which was available on many television service providers throughout Canada as an eligible foreign service.
On February 15, 2005, CHUM completed the purchase of the remaining interest in LSTA, bringing its ownership to 100%. A year later, in July 2006, Bell Globemedia (later renamed CTVglobemedia) announced that it would purchase CHUM for an estimated CAD$1.7 billion, included in the sale was LSTA and its interest in CourtTV Canada. The sale and was approved by the CRTC in June 2007, and the transaction was completed on June 22, 2007. In 2008, LSTA (then known as Access Media Group) was wound up into CTV Limited (the renamed CHUM Limited).
As Investigation Discovery
The original CourtTV was relaunched as TruTV in 2008, though the Canadian version continued to use the CourtTV branding. On August 30, 2010, CTV announced a new licensing agreement with Discovery Communications, under which Court TV Canada would be rebranded as a Canadian version of Discovery's true crime brand Investigation Discovery. It is the only Discovery-branded channel operated by Bell Media that neither Discovery, nor ESPN Inc. (via CTV Specialty Television, Inc.), holds an ownership stake in.
On September 10, 2010, Bell Canada (a minority shareholder in CTVglobemedia) announced that it planned to acquire 100% interest in CTVglobemedia for a total debt and equity transaction cost of CAD$3.2 billion. The deal was approved by the CRTC on March 7, 2011, and was finalized on April 1 of that year, on which CTVglobemedia was rebranded Bell Media.
On June 17, 2011, Bell Media announced plans to launch a high definition simulcast feed of Investigation Discovery, titled Investigation Discovery HD, by the end of the year. The HD feed was launched on December 15, 2011 on Bell Fibe TV and later on Telus Optik TV; The HD feed later began to be carried on Bell Satellite TV on December 13, 2012, then Bell A |
https://en.wikipedia.org/wiki/Asian%20Highway%20Network | The Asian Highway Network (AH), also known as the Great Asian Highway, is a cooperative project among countries in Asia and the United Nations Economic and Social Commission for Asia and the Pacific (ESCAP) to improve their connectivity via highway systems. It is one of the three pillars of the Asian Land Transport Infrastructure Development (ALTID) project, endorsed by the ESCAP commission at its 48th session in 1992, comprising Asian Highway, Trans-Asian Railway (TAR) and facilitation of land transport projects.
Agreements have been signed by 32 countries to allow the highway to cross the continent and also reach to Europe. Some of the countries taking part in the highway project are India (Look-East connectivity projects), Sri Lanka, Pakistan, China, Iran, Japan, South Korea, Nepal and Bangladesh. Most of the funding comes from the larger, more advanced Asian nations such as China, South Korea and Singapore as well as international agencies such as the Asian Development Bank (ADB) and the Asian Infrastructure Investment Bank (AIIB).
The project aims to make maximum use of the continent's existing highways to avoid the construction of newer ones, except in cases where missing routes necessitate their construction. Project Monitor, an Asian infrastructure news website, has commented that "early beneficiaries of the Asian Highway project are the planners within the national land transport department of the participating countries [since] it assists them in planning the most cost-effective and efficient routes to promote domestic and international trade. Non-coastal areas, which are often negligible, are the other beneficiaries."
However, in the mid-2000s some transportation experts were skeptical about the viability of the project given the economic and political climate in both South and Southeast Asia.
History
The AH project was initiated by the United Nations in 1959 with the aim of promoting the development of international road transport in the region. During the first phase of the project (1960–1970) considerable progress was achieved, however, progress slowed down when financial assistance was suspended in 1975.
ESCAP has conducted several projects in cooperation with AH member countries step by step after the endorsement of ALTID in 1992.
The Intergovernmental Agreement on the Asian Highway Network (IGA) was adopted on November 18, 2003, by the Intergovernmental Meeting; the IGA includes Annex I, which identifies 55 AH routes among 32 member countries totalling approximately 140,000 km (87,500 miles), and Annex II "Classification and Design Standards". During the 60th session of the ESCAP Commission at Shanghai, China, in April 2004, the IGA treaty was signed by 23 countries. By 2013, 29 countries had ratified the agreement.
Implications
The advanced highway network would provide for greater trade and social interactions between Asian countries, including personal contacts, project capitalizations, connections of major container te |
https://en.wikipedia.org/wiki/Michael%20Ely | Michael Ely is the writer of the trilogy of books surrounding the events in the computer game Sid Meier's Alpha Centauri.
Works
Centauri Dawn -
Dragon Sun -
Twilight of the Mind -
See also
List of novels based on video games
References
External links
Science fiction writers
Living people
Year of birth missing (living people)
Place of birth missing (living people) |
https://en.wikipedia.org/wiki/Al%20Iraqiya | Al Iraqiya (, al-ʿIrāqiyyä) is a satellite and terrestrial public broadcaster and television network in Iraq that was set up after the fall of Saddam Hussein. It is an Arabic language network that serves upwards of 85% of Iraq's population, and is viewed by a significant percentage (about 40%).
The channel began under the name IMN as part of the Iraqi Media Network (or Shabeket al-Elam Iraqi in Arabic) project undertaken. The Science Applications International Corporation (SAIC) was the contractor for this Defense Department project.
Included in the programming is the very aggressive Political Actuality program "Burning Issues" that tackles the very sensitive subject of terrorism in Iraq, hosting both the victims and the arrested/convicted perpetrators.
Harris Corporation took over the project from SAIC and completed—on time and in budget—two TV channels, a national newspaper, and radio stations.
On May 31, 2006, Ali Jaafar, a sports anchorman for Iraqi state television, was gunned down in Baghdad.
See also
Television in Iraq
External links
References
Television stations in Iraq
Arab mass media
Arabic-language television stations
International broadcasters
Television channels and stations established in 2003
2003 establishments in Iraq |
https://en.wikipedia.org/wiki/GR%20footpath | The GR footpaths are a network of long-distance walking trails in Europe, mostly in France, Belgium, the Netherlands and Spain. They go by the following names: , , , , – generally meaning "long trail" or more literally "great route". The trails in France alone cover approximately . Trails are blazed with characteristic marks consisting of a white stripe above a red stripe. These appear regularly along the route, especially at places such as forks or crossroads.
The network is maintained in France by the Fédération Française de la Randonnée Pédestre (French Hiking Federation), and in Spain by the Federación Española de Deportes de Montaña y Escalada (Spanish Mountain Sports Federation). Many GR routes make up part of the longer European walking routes which cross several countries.
Markings
The GR trails are marked using a system of blazes that are visible in both directions:
France, Belgium, Netherlands, and Spain: red and white bars; 3 subtypes
Luxembourg: yellow rectangles or circles
Switzerland: red and white bars or yellow diamonds
Red and white was chosen as the most visible colour combination in natural surroundings. Waymarks are often painted, but may take the form of metal signs in city centers.
GR routes
France: Grande Randonnée
Routes 1 to 25
Routes 26 to 40
Routes 41 to 50
Routes 51 to 75
Routes 76 to 100
Routes 101 and above
Routes with special codes
Spain: Gran Recorrido
All routes
Andorra
GRP (Grande Randonee Pays), a circuit of Andorra
GRT, a route from Spain to Andorra with two variants
HRP (High Route Pyrenees), combining elements of the GRP and GRT
GR 7 passes through Spain, France, and Andorra's Madriu-Perafita-Claror Valley
GR 11 (Spain) passes through Spain, France, and Andorra's Madriu-Perafita-Claror Valley
Portugal: Percursos Pedestres de Grande Rota
GR 5 Fojos circular, , Vieira do Minho / Minho
GR 11-E9 Caminho de Santiago, international, linear
GR 12-E7 international, linear
GR 13-E4 Via Algarviana, international, linear,
GR 14 Rota dos Vinhos da Europa, international, linear,
GR 17 Travessia do Alto Coura, circular,
GR 22 Rota das Aldeias Históricas, circular,
GR 23 Serra do Caldeirão, circular,
GR 26 Terras de Sicó, circular, 9 stages,
GR 28 Por Montes e Vales de Arouca, circular,
GR 29 Rota dos Veados, circular,
GR 30 Grande Rota das Linhas de Torres, circular, , Lisboan and Vale do Tejo
GR 45 Grande Rota do Côa, linear
GR 117 Geira Romana, international, linear
Travessia do Alvão, circular,
Travessia da Ribeira Minho, linear,
Soajo Peneda, circular,
Belgium: Grote Routepaden or Grande Randonnée
Netherlands: Langeafstandswandelpaden
See also
European long-distance paths
Metropolitan trail
References
External links
List of grande randonnée hiking trails in France and Belgium
List of multi-day GR itineraries in France (mostly in French)
Fédération Française de la Randonnée Pédestre
Website with Belgian GR routes
Federacion espanola de deportes de montaña y escalada FEDME |
https://en.wikipedia.org/wiki/On%20the%20Cruelty%20of%20Really%20Teaching%20Computer%20Science | "On the Cruelty of Really Teaching Computing Science" is a 1988 scholarly article by E. W. Dijkstra which argues that computer programming should be understood as a branch of mathematics, and that the formal provability of a program is a major criterion for correctness.
Despite the title, most of the article is on Dijkstra’s attempt to put computer science into a wider perspective within science, teaching being addressed as a corollary at the end.
Specifically, Dijkstra made a “proposal for an introductory programming course for freshmen” that
consisted of Hoare logic as an uninterpreted formal system.
Debate over feasibility
Since the term "software engineering" was coined, formal verification has almost always been considered too resource-intensive to be feasible. In complex applications, the difficulty of correctly specifying what the program should do in the first place is also a common source of error. Other methods of software testing are generally employed to try to eliminate bugs and many other factors are considered in the measurement of software quality.
Until the end of his life, Dijkstra maintained that the central challenges of computing hadn't been met to his satisfaction, due to an insufficient emphasis on program correctness (though not obviating other requirements, such as maintainability and efficiency).
Pedagogical legacy
Computer science as taught today does not follow of Dijkstra's advice. The curricula generally emphasize techniques for managing complexity and preparing for future changes, following Dijkstra's earlier writings. These include abstraction, programming by contract, and design patterns. Programming techniques to avoid bugs and conventional software testing methods are taught as basic requirements, and students are exposed to certain mathematical tools, but formal verification methods are not included in the curriculum except perhaps as an advanced topic. So in some ways, Dijkstra's ideas have been adhered to; however, the ideas he felt most strongly about have not been.
Newly formed curricula in software engineering have adopted Dijkstra's recommendations. The focus of these programs is the formal specification of software requirements and design in order to facilitate the formal validation of system correctness. In Canada, they are often accredited engineering degrees with similar core competencies in physics-based engineering.
References
1988 documents
Computer science papers
Computer science education
Works by Edsger Dijkstra |
https://en.wikipedia.org/wiki/Children%20of%20the%20Stones | Children of the Stones is a British television fantasy drama serial for children, produced by HTV in 1976 and broadcast on the United Kingdom's ITV network in January and February 1977. The serial was produced by Peter Graham Scott, with Patrick Dromgoole as executive producer. A novelisation by the serial's writers, Jeremy Burnham and Trevor Ray, also appeared in 1977. In the United States, it was broadcast on the Nickelodeon television channel in the early 1980s as part of the series The Third Eye.
The series is today considered a landmark in quality children's drama.
Overview
The series follows the adventures of astrophysicist Adam Brake and his teenage son Matthew after they arrive in the small village of Milbury, which is built in the midst of a megalithic stone circle.
Filmed at Avebury, Wiltshire during the hot summer of 1976, with interior scenes filmed at HTV's Bristol studios, it has sinister, discordant wailing voices heightening the tension in the incidental music. The music was composed by Sidney Sager who used the Ambrosian Singers to chant in accordance with the megalithic rituals referred to in the story. Director Peter Graham Scott was surprised on seeing the script that the series was intended for children's airtime due to the complexities of the plot and the disturbing nature of the series.
Cast as the leader of the village, Hendrick, was Iain Cuthbertson, while the leading role of Adam Brake was filled by Gareth Thomas. Cuthbertson and Thomas had previously worked together on the TV series Sutherland's Law. Veronica Strong (the wife of series co-writer Jeremy Burnham) played Margaret Smythe, the curator of the local museum, who partners with Brake to solve the mystery. The child actors Peter Demin (aged 17 at the time of filming) and Katharine Levy played the teenage leads, Matthew (Brake's son) and Sandra (Smythe's daughter). Freddie Jones and John Woodnutt were cast as poacher Dai and butler Link.
Episodes
Into the Circle (TX: 10 January 1977)
Circle of Fear (TX: 17 January 1977)
Serpent in the Circle (TX: 24 January 1977)
Narrowing Circle (TX: 31 January 1977)
Charmed Circle (TX: 7 February 1977)
Squaring the Circle (TX: 14 February 1977)
Full Circle (TX: 21 February 1977)
Episodes were broadcast at 4:45 p.m. each Monday.
The series was repeated by ITV from 21 July 1978 to 1 September 1978, at 4:15 p.m. Since then the show has not been broadcast in its entirety on UK television, either terrestrial or satellite.
Plot outline
The village within the stone circle exists in a time rift, in which the same actions are played out (with minor variations) over and over again, the end result being that the power of the circle will eventually be released to the outside world. Whenever this is faulted, however, the time circle resets and the same events attempt again to unfold. However, since time is passing in the outside world in a normal way, time within the time circle must also progress, matching the time period of |
https://en.wikipedia.org/wiki/Monte%20Carlo%20algorithm | In computing, a Monte Carlo algorithm is a randomized algorithm whose output may be incorrect with a certain (typically small) probability. Two examples of such algorithms are the Karger–Stein algorithm and the Monte Carlo algorithm for minimum feedback arc set.
The name refers to the Monte Carlo casino in the Principality of Monaco, which is well-known around the world as an icon of gambling. The term "Monte Carlo" was first introduced in 1947 by Nicholas Metropolis.
Las Vegas algorithms are a dual of Monte Carlo algorithms and never return an incorrect answer. However, they may make random choices as part of their work. As a result, the time taken might vary between runs, even with the same input.
If there is a procedure for verifying whether the answer given by a Monte Carlo algorithm is correct, and the probability of a correct answer is bounded above zero, then with probability one, running the algorithm repeatedly while testing the answers will eventually give a correct answer. Whether this process is a Las Vegas algorithm depends on whether halting with probability one is considered to satisfy the definition.
One-sided vs two-sided error
While the answer returned by a deterministic algorithm is always expected to be correct, this is not the case for Monte Carlo algorithms. For decision problems, these algorithms are generally classified as either false-biased or true-biased. A false-biased Monte Carlo algorithm is always correct when it returns false; a true-biased algorithm is always correct when it returns true. While this describes algorithms with one-sided errors, others might have no bias; these are said to have two-sided errors. The answer they provide (either true or false) will be incorrect, or correct, with some bounded probability.
For instance, the Solovay–Strassen primality test is used to determine whether a given number is a prime number. It always answers true for prime number inputs; for composite inputs, it answers false with probability at least and true with probability less than . Thus, false answers from the algorithm are certain to be correct, whereas the true answers remain uncertain; this is said to be a -correct false-biased algorithm.
Amplification
For a Monte Carlo algorithm with one-sided errors, the failure probability can be reduced (and the success probability amplified) by running the algorithm k times. Consider again the Solovay–Strassen algorithm which is -correct false-biased. One may run this algorithm multiple times returning a false answer if it reaches a false response within k iterations, and otherwise returning true. Thus, if the number is prime then the answer is always correct, and if the number is composite then the answer is correct with probability at least 1−(1−)k = 1−2−k.
For Monte Carlo decision algorithms with two-sided error, the failure probability may again be reduced by running the algorithm k times and returning the majority function of the answers.
Complexity classes
The comp |
https://en.wikipedia.org/wiki/GNU%20Aspell | GNU Aspell, usually called just Aspell, is a free software spell checker designed to replace Ispell. It is the standard spell checker for the GNU operating system. It also compiles for other Unix-like operating systems and Windows. The main program is licensed under the GNU Lesser General Public License (GNU LGPL), the documentation under the GNU Free Documentation License (GNU FDL). Dictionaries for it are available for about 70 languages. The primary maintainer is Kevin Atkinson.
Comparison to Ispell
Unlike Ispell, Aspell can easily check UTF-8 documents without having to use a special dictionary. But the mechanism behind is still 8-bit. Aspell will also do its best to respect the current locale setting. Other advantages over Ispell include support for using multiple dictionaries at once and intelligently handling personal dictionaries when more than one Aspell process is open at once. However, Ispell follows the Unix convention of being a command applied to a file, e.g., , whereas Aspell requires other command-line options, and the "" option is more comprehensive. Sample uses include:
Interactively run through the checking the spelling ().
Allow typing a word (followed by newline and ) to find words that sound the same ().
Windows ports
, the latest official Windows port of GNU Aspell was still 32-bit version 0.50.3 (Dec 2002), with dictionaries of similar age. The developer says he has "no time and very little interest in maintaining a Windows port", and has been looking for somebody to maintain it. However, the LyX project maintains a separate fork of Aspell for Windows and dictionaries, and says "the LyX project has long solved the Windows packaging problem by forking Aspell." LyX is being maintained and the latest version is 2.3.7, dated 7 January 2023.
The regularly updated Cygwin port of aspell can also be used in Windows and it latest version.
Integration
Aspell has been integrated into software such as Gajim, LyX, Notepad++, Claws Mail and previously Pidgin, Opera, gedit and AbiWord.
See also
Enchant
Hunspell
Ispell
MySpell
Pspell
Virastyar
Notes and references
External links
Aspell Homepage
Aspell Spell Helper
Test Results of Aspell Compared to Other Spell Checkers
The GNU Aspell documentation under the GNU Free Documentation License
GNU Aspell download page (FTP link)
LyXWinInstaller (includes Aspell for Windows)
Aspell and UTF-8/Unicode
GNU Aspell summary page at Savannah
Mac OS X interface for Aspell
Original Unix spell (1978-81), on which Aspell is based
GNU Project software
Spell checkers
Free software programmed in C++
Free spelling checking programs
Language software for Linux
Language software for macOS
Language software for Windows |
https://en.wikipedia.org/wiki/Charlotte%20Moore%20Sitterly | Charlotte Emma Moore Sitterly (September 24, 1898 – March 3, 1990) was an American astronomer. She is known for her extensive spectroscopic studies of the Sun and chemical elements. Her tables of data are known for their reliability and are still used regularly.
Early life and education
Charlotte Moore was born to George W. and Elizabeth Walton Moore in Ercildoun, Pennsylvania, a small village near Coatesville. Her father was the Superintendent of Schools for Chester County and her mother was a schoolteacher. Her parents were Quakers and Charlotte was a lifelong member of Fallowfield Friends Meeting.
She attended Swarthmore College, where she participated in many extracurricular activities such as ice hockey, student government, glee club, and tutoring. In order to pay her tuition, Moore was a substitute teacher, one of the few ways she thought she could work her way through college. She wanted to pursue a career outside teaching because "I did not enjoy the teaching that I did from first grade through high school. I succeeded at it, but I didn’t like it; it was too wearing."
Moore graduated from Swarthmore in 1920 with a Bachelor of Arts degree in mathematics and went on to Princeton to work as a human computer.
Career
On the recommendation of her mathematics professor at Swarthmore, John. Miller, Moore obtained a job at the Princeton University Observatory working for Professor Henry Norris Russell as a human computer carrying out calculations needed to use photographic plates in determining the position of the Moon. While working for Russel, Moore initially felt nervous about her inexperience, but over time her interest in astrophysics began to blossom. Russell and Moore researched binary stars and stellar mass, and published extensively on the subject over the years of their collaboration. Her research included an effort to classify 2500 stars based on their spectra.
Although she spent five years at Princeton working under Russell, he refused to consider her a PhD, an unexceptional fact since there were no women in any of Princeton's graduate programs until 1961. Moore said “I was used to prejudice against women because Princeton was a man's stronghold, and a woman was really out of step there.” Though in 1926, Russell left his own name off a paper they worked on together and used hers alone.
After five years at Princeton, Moore took a leave of absence due to ill health and she moved to the Mount Wilson Observatory as part of an ongoing collaboration between Russell and research groups there. While at Mount Wilson she worked extensively on solar spectroscopy, analyzing the spectral lines of the Sun and thereby identifying the chemical elements in the Sun. With her collaborators, she analyzed the spectra of sunspots. Moore was able to deduce the temperature of sunspots to be about 4,700 kelvins. Her pictures from the Mount Wilson Observatory helped redetermine the new International Angstrom scale.
She earned a Ph.D. in astronomy in |
https://en.wikipedia.org/wiki/PhpGedView | PhpGedView is a free PHP-based web application for working with genealogy data on the Internet. The project was founded and is headed by John Finlay. It is licensed under the GPL-2.0-or-later license.
PhpGedView is hosted on SourceForge, where it was Project of the Month in December 2003. It is a widely used interactive online genealogy application, with over 1600 registered sites as of November, 2008. On June 26, 2006, the PhpGedView site announced that PhpGedView was the most active project at Sourceforge. It was also second most active in July, 2006.
In early 2010, a majority of active PhpGedView developers stopped development on PhpGedView and created a fork. The new, forked program is called webtrees.
Features
PhpGedView is a multi-user, platform-independent system, allowing for distributed work on a family tree. Users can view, contribute and approve others' contributions, depending on their status. PhpGedView has several modes for protecting the privacy of data, such as protecting all data from unregistered users, or protecting data on living people from unregistered users.
Several types of reports and diagrams can be produced, which can be exported as PDF files for viewing, storing, and printing. Maps can be generated that show all the locations mentioned for a person.
PhpGedView is installed on a web server. The user can either import a GEDCOM file to populate it or build a GEDCOM in place. An external genealogy program can be used to create, edit and upload the GEDCOM. GEDCOMs can also be edited directly in PhpGedView by multiple users registered via the web interface. For each individual in the GEDCOM, a range of data can be recorded, from standard genealogical information, such as dates and places, to employment, education, religion, photos, videos, sources of data, and more. Through version 3 it worked in both MySQL and a non-database index mode. From version 4 on, it works only with a database.
PhpGedView (version 4.1 and up) supports output to GRAMPS XML file format.
PhpGedView can be extended using modules. Several modules are available: interfaces to Gallery 2, phpBB, Lightbox (JavaScript), and Google Maps. PhpGedView previously had an integration module for Joomla which has since been discontinued.
See also
webtrees, a fork of PhpGedView
References
External links
Community Wiki
Free genealogy software
PHP software |
https://en.wikipedia.org/wiki/ECX | ECX may refer to:
European Climate Exchange
Ethiopia Commodity Exchange
Embedded Compact Extended, a small form factor Single Board Computer specification
ECX register, an x86 general purpose register that is used by the CPU to store the loop counter
ECX screwdriver |
https://en.wikipedia.org/wiki/Michel%20Drucker | Michel Drucker, OQ (born 12 September 1942 in Vire) is a popular French journalist and TV host. He has been on screen for so long on various shows and different networks, both public and private, that he once said that some people joked that he was included in the price of their TV sets.
Career
He started a journalistic career in 1965 at the ORTF as sports reporter and commentator. Although he kept doing live coverage of major soccer matches until 1986, he soon turned to hosting variety shows, such as Champs-Élysées on Antenne 2 in the 1980s, then Stars 90 on TF1 in the 1990s, then finally Vivement dimanche on France 2 every Sunday afternoon since 1998.
Drucker is known for his polite, toned-down attitude towards show-business stars, and is best known outside France for the incident between Serge Gainsbourg and American singer Whitney Houston on the television programme, Champs-Élysées.
Personal life
Drucker is Jewish. His father, Abraham Drucker, was a Jewish immigrant who arrived in France in 1925 to study medicine. Drucker's younger brother, Jacques, is a doctor, and his older brother, Jean, was a television executive.
Drucker is married to French actress Dany Saval and is an uncle of Léa Drucker, an actress, and Marie Drucker, a telejournalist on France 2.
Filmography
Honours
National honours
:
Officer of the National Order of the Legion of Honour (1994)
Knight of the Ordre des Arts et des Lettres (1984)
Foreign honours
:
: Knight (2001), now Officer (2010) of the National Order of Quebec
References
External links
Vivement Dimanche
Michel Drucker on the website on France 2 TV
Michel Drucker biographie (in French)
1942 births
Living people
People from Vire
20th-century French Jews
20th-century French journalists
French television presenters
Knights of the Legion of Honour
Officers of the National Order of Quebec
Knights of the National Order of Quebec
French male non-fiction writers
Helicopter pilots
Eurovision commentators |
https://en.wikipedia.org/wiki/M4%20%28computer%20language%29 | m4 is a general-purpose macro processor included in most Unix-like operating systems, and is a component of the POSIX standard.
The language was designed by Brian Kernighan and Dennis Ritchie for the original versions of UNIX. It is an extension of an earlier macro processor, m3, written by Ritchie for an unknown AP-3 minicomputer.
The macro preprocessor operates as a text-replacement tool. It is employed to re-use text templates, typically in computer programming applications, but also in text editing and text-processing applications. Most users require m4 as a dependency of GNU autoconf.
History
Macro processors became popular when programmers commonly used assembly language. In those early days of programming, programmers noted that much of their programs consisted of repeated text, and they invented simple means for reusing this text. Programmers soon discovered the advantages not only of reusing entire blocks of text, but also of substituting different values for similar parameters. This defined the usage range of macro processors.
In the 1960s, an early general-purpose macro processor, M6, was in use at AT&T Bell Laboratories, which was developed by Douglas McIlroy, Robert Morris and Andrew Hall.
Kernighan and Ritchie developed m4 in 1977, basing it on the ideas of Christopher Strachey. The distinguishing features of this style of macro preprocessing included:
free-form syntax (not line-based like a typical macro preprocessor designed for assembly-language processing)
the high degree of re-expansion (a macro's arguments get expanded twice: once during scanning and once at interpretation time)
The implementation of Rational Fortran used m4 as its macro engine from the beginning, and most Unix variants ship with it.
many applications continue to use m4 as part of the GNU Project's autoconf. It also appears in the configuration process of sendmail (a widespread mail transfer agent) and for generating footprints in the gEDA toolsuite. The SELinux Reference Policy relies heavily on the m4 macro processor.
m4 has many uses in code generation, but (as with any macro processor) problems can be hard to debug.
Features
m4 offers these facilities:
a free-form syntax, rather than line-based syntax
a high degree of macro expansion (arguments get expanded during scan and again during interpretation)
text replacement
parameter substitution
file inclusion
string manipulation
conditional evaluation
arithmetic expressions
system interface
programmer diagnostics
programming language independent
human language independent
provides programming language capabilities
Unlike most earlier macro processors, m4 does not target any particular computer or human language; historically, however, its development originated for supporting the Ratfor dialect of Fortran. Unlike some other macro processors, m4 is Turing-complete as well as a practical programming language.
Unquoted identifiers which match defined macros are replaced with their defi |
https://en.wikipedia.org/wiki/Leisha%20Hailey | Leisha Hailey (born July 11, 1971) is an American actress and musician known for playing Alice Pieszecki in the Showtime Networks series The L Word and The L Word: Generation Q. Hailey first came to the public's attention as a musician in the pop duo The Murmurs and has continued her music career as part of the band Uh Huh Her.
Currently, Hailey appears as Alice in The L Word: Generation Q and hosts podcast PANTS with fellow L Word star and close friend, Kate Moennig.
Early life
Born in Okinawa, USCAR (now Japan) to American parents, Hailey grew up in Bellevue, Nebraska.
At 17, she came out as lesbian before moving to New York City to attend the American Academy of Dramatic Arts.
Career
Music
With her Academy classmate Heather Grody, she formed the pop duo The Murmurs in 1991. In the 1990s, they released several albums and toured on the Lilith Fair. In 2001, Hailey and Grody changed their name to Gush. The group disbanded when Hailey was cast in The L Word. In 2005, Hailey founded Marfa Records.
In July 2007, Uh Huh Her, an electropop duo consisting of Hailey and Camila Grey, released an EP entitled I See Red; over a year later they released their first album Common Reaction.
Hailey also co-wrote the Shakira hit song "Don't Bother" for her 2005 hit album Oral Fixation Vol. 2.
Acting
Hailey's television debut was in 1996 when she played a struggling musician on an episode of Boy Meets World. Her first major film role was in the 1997 movie All Over Me.
From 2004 to 2009, she starred as Alice Pieszecki, a journalist, television, and radio show host, on The L Word. At the beginning of the series, Hailey's character identified as bisexual. By the end of the series, specifically in season 5, her character dated mostly women.
In September 2008, Showtime announced Hailey would star in The Farm, a "pilot presentation spinoff" of The L Word, to be written and produced by Ilene Chaiken, creator and executive producer of The L Word. It was announced in April 2009 that the show would not be picked up by Showtime.
Hailey's award-winning indie film La Cucina premiered on Showtime in December 2009, where she plays a straight pregnant newlywed.
Hailey has appeared in several Yoplait yogurt commercials as well as a BMW commercial. In April 2008, Hailey was named spokesperson for Olivia Cruises, a travel company which sells cruises and resort vacations marketed towards lesbian customers. She also stars in the psychological thriller Fertile Ground.
In 2015, Hailey appeared in an episode of long-running The CW show Supernatural as Amelia Novak, the estranged wife of Jimmy Novak (human vessel of the angel Castiel, played by Misha Collins.)
In 2007, Hailey was named the sexiest woman in the AfterEllen Hot 100 list compiled by AfterEllen.com.
Personal life
Hailey dated k.d. lang for nearly five years until breaking up in 2001. She also had a relationship with Nina Garduno from 2004 to 2010. From 2011 to 2016, she dated her bandmate Camila Grey. In 2011, t |
https://en.wikipedia.org/wiki/JavaOS | JavaOS is a discontinued operating system based on a Java virtual machine. It was originally developed by Sun Microsystems. Unlike Windows, macOS, Unix, or Unix-like systems which are primarily written in the C programming language, JavaOS is primarily written in Java. It is now considered a legacy system.
History
The Java programming language was introduced by Sun in May 1995. Jim Mitchell and Peter Madany at JavaSoft designed a new operating system, codenamed Kona, written completely in Java. In March 1996, Tom Saulpaugh joined the now seven-person Kona team to design an input/output (I/O) architecture, having come from Apple as Macintosh system software engineer since June 1985 and co-architect of Copland.
JavaOS was first evangelized in a Byte article. In 1996, JavaSoft's official product announcement described the compact OS designed to run "in anything from net computers to pagers". In early 1997, JavaSoft transferred JavaOS to SunSoft. In late 1997, Bob Rodriguez led the team to collaborate with IBM who then marketed the platform, accelerated development, and made significant key architectural contributions to the next release of JavaOS, eventually renamed JavaOS for Business. IBM indicated its focus was more on network computer thin clients, specifically to replace traditional IBM 3270 "green screen" and Unix X terminals, and to implement single application clients.
The Chorus distributed real-time operating system was used for its microkernel technology. This began with Chorus Systèmes SA, a French company, licensing JavaOS from Sun and replacing the earlier JavaOS hardware abstraction layer with the Chorus microkernel, thereby creating the Chorus/Jazz product, which was intended to allow Java applications to run in a distributed, real-time embedded system environment. Then in September 1997, it was announced that Sun Microsystems was acquiring Chorus Systèmes SA.
In 1999, Sun and IBM announced the discontinuation of the JavaOS product. As early as 2003, Sun materials referred to JavaOS as a "legacy technology", recommending migration to Java ME, leaving the choice of specific OS and Java environment to the implementer.
Design
JavaOS is based on a hardware architecture native microkernel, running on platforms including ARM, PowerPC, SPARC, StrongARM, and IA-32 (x86). The Java virtual machine runs on the microkernel. All device drivers are written in Java and executed by the virtual machine. A graphics and windowing system implementing the Abstract Window Toolkit (AWT) application programming interface (API) is also written in Java.
JavaOS was designed to run on embedded systems and has applications in devices such as set-top boxes, computer networking infrastructure, and automated teller machines (ATMs). It comes with the JavaStation.
Licensing
JavaSoft granted licenses to more than 25 manufacturers, including Oracle, Acer, Xerox, Toshiba, and Nokia. IBM and Sun announced the cooperation for JavaOS for Business at the end of |
https://en.wikipedia.org/wiki/France%203 | France 3 () is a French free-to-air public television channel and part of the France Télévisions group, which also includes France 2, France 4, France 5 and France Info.
It is made up of a network of regional television services providing daily news programming and around ten hours of entertainment and cultural programming produced for and about the regions each week (like ITV1). The channel also broadcasts various national programming and national and international news from Paris. The channel was known as France Régions 3 (FR3) until its official replacement by France 3 in September 1992.
Prior to the establishment of RFO, now Outre-Mer 1ère, it also broadcast to the various French overseas departments and territories.
History
La Troisième Chaîne Couleur (1972–1974)
On 22 March 1969, the government mentioned a plan to create a third national television channel. Jean-Louis Guillaud, attached to the Office of the President of the Republic, coordinated the preparatory studies for its launch from November 1969. This new national channel of the French Television Broadcasting Office (ORTF) was to be launched directly in color and to allow better exposure of the regional offices of the ORTF through many opt-outs and through the decentralized production of the channel's programmes. The ORTF implemented this project throughout 1972 in the form of a national and interregional channel in color, without advertising or continuity announcers (although out-of-vision announcers were later introduced), offering shorter evenings at different times compared to the other two channels, with a majority of cultural programs, and relying largely on the technical and editorial relays of its regional stations. To accomplish this, the Board is setting up several heavy production centers within its main regional stations to produce programming for the new channel. The most important are those of Télé Marseille-Provence, Télé-Lille and Télé-Lyon. The third channel thus responds to the main concern of reform law no. 72-5534 3 July 1972, on the status of the ORTF, which aims to introduce the decentralization of production and the devolution of decisions on programs the Office.
The third color channel (La Troisième Chaîne Couleur) of the ORTF started its operations on 31 December 1972, at 7 pm with its start-up theme, which was followed by the CEO of the ORTF, Arthur Conte, and the general manager of the channel, Jean-Louis Guillaud, who present their wishes to the French for this new channel and for the year to come, calling on the ORTF's regional television services and aspiring young staff to join the new network, and then followed by Jean Amadou welcoming the viewers to briefly explain to them what will distinguish this new channel from the two others, in particular in its colorful, dynamic design and the introduction of genre credits before each programme, to replace the announcers, and which are all the work of stylist Catherine Chaillet. Then, the first program, |
https://en.wikipedia.org/wiki/Ctime | in computer programming languages CTime or ctime may refer to:
ctime(), a function in the ISO C standard library defined in the time.h standard header
<ctime> is a standard header file for C++, equivalent to the C standard library header, <time.h>
st_ctime, a member of the stat structure specifying the last inode change time of a file in a Unix-like filesystem
CTime, a Microsoft ATL/MFC class for handling dates and times
CTime, a datatype in the Haskell programming language corresponding to the C time_t type
Time::CTime, a Perl module for interfacing with POSIX asctime |
https://en.wikipedia.org/wiki/Burning%20Chrome%20%28short%20story%20collection%29 | Burning Chrome (1986) is a collection of short stories written by William Gibson. Most of the stories take place in Gibson's Sprawl, a shared setting for most of his early cyberpunk work. Many of the ideas and themes explored in the short stories were later revisited in Gibson's popular Sprawl trilogy.
Contents
Burning Chrome includes:
Reception
J. Michael Caparula reviewed Burning Chrome in Space Gamer/Fantasy Gamer No. 82. Caparula commented that "This is vital reading; harsh, gritty, complex, visionary."
References
Sprawl trilogy
1986 short story collections
Science fiction short story collections
Cyberpunk short stories
American short story collections
Arbor House books |
https://en.wikipedia.org/wiki/Lites | Lites is a discontinued Unix-like operating system, based on 4.4BSD and the Mach microkernel. Specifically, Lites is a multi-threaded server and emulation library that provided unix functions to a Mach-based system. At the time of its release, Lites provided binary compatibility with 4.4BSD, NetBSD, FreeBSD, 386BSD, UX (4.3BSD), and Linux.
Lites was originally written by Johannes Helander at Helsinki University of Technology, and was further developed by the Flux Research Group at the University of Utah.
See also
HPBSD
References
External links
, Utah Lites
Berkeley Software Distribution
Mach (kernel)
Microkernel-based operating systems
Microkernels |
https://en.wikipedia.org/wiki/DOS/360%20and%20successors | Disk Operating System/360, also DOS/360, or simply DOS, is the discontinued first member of a sequence of operating systems for IBM System/360, System/370 and later mainframes. It was announced by IBM on the last day of 1964, and it was first delivered in June 1966. In its time, DOS/360 was the most widely used operating system in the world.
DOS versions
BOS/360
The Basic Operating System(BOS) was an early version of DOS and TOS which could provide usable functionality on a system with as little as 8 KB of main storage and one 2311 disk drive.
TOS/360
TOS/360 (Tape Operating System/360, not a DOS as such and not so called) was an IBM operating system for the System/360, used in the early days around 1965 to support the System/360 Model 30 and similar platforms.
TOS, as per the "Tape" in the name, required a tape drive. It shared most of the code base and some manuals with IBM's DOS/360.
TOS went through 14 releases, and was discontinued when disks such as the IBM 2311 and IBM 2314 became more affordable at the time of System/360, whereas they had been an expensive luxury on the IBM 7090.
DOS/360
DOS/360 was the primary operating system for most small to midsize S/360 installations.
DOS/VS
DOS/VS was released in 1972. The first DOS/VS release was numbered "Release 28" to signify an incremental upgrade from DOS/360. It added virtual memory in support of the new System/370 series hardware. It used a fixed page table which mapped a single address space of up to 16 megabytes for all partitions combined.
DOS/VS increased the number of partitions (separate simultaneous programs) from three (named Background, Foreground 1 and Foreground 2) to five (BG and F1 through F4) and allowed a system wide total of fifteen subtasks.
DOS/VS was succeeded by DOS/VSE through z/VSE.
DOS/VSE
DOS/VSE was introduced in 1979 as an "extended" version of DOS/VS to support the new 4300 processors.
The 4300 systems included a feature called ECPS:VSE that provided a single-level storage for both the processor and the I/O channels. DOS/VSE provided support for ECPS:VSE, but could also run on a System/370 without that feature. VSE was the last free version of DOS.
VSE/AF
VSE/Advanced Functions (VSE/AF) is a product that adds new device support and functionality to DOS/VSE. Many installations installed VSE/AF using products such as VSE System Installation Productivity Option/Extended (VSE System IPO/E), which combines DOS/VSE, VSE/AF and various other products.
SSX/VSE
SSX/VSE ("Small System Executive") was an attempt by IBM to simplify purchase and installation of VSE by providing a pre-generated system containing the OS and the most popular products. SSX was released in 1982, and later replaced by VSE/SP. SSX was sold by IBM as a bundle of 14 component products (Advanced Functions/VSE, VSE/POWER, ACF/VTAME, VSE/VSAM, CICS/DOS/VS, DOS/VS, Sort/Merge, VSE/ICCF, VSE/OCCF, VSE/IPCS, DOS/COBOL, Back Up/Restore, Space Management, VSE/DITTO), and originally would o |
https://en.wikipedia.org/wiki/Jean-Claude%20Risset | Jean-Claude Raoul Olivier Risset (; 13 March 1938 – 21 November 2016) was a French composer, best known for his pioneering contributions to computer music. He was a former student of André Jolivet and former co-worker of Max Mathews at Bell Labs.
Biography
Risset was born in Le Puy-en-Velay, France. Arriving at Bell Labs, New Jersey in 1964, he used Max Mathews' MUSIC IV software to digitally recreate the sounds of brass instruments. He made digital recordings of trumpets and studied their timbral composition using "pitch-synchronous" spectrum analysis tools, revealing that the amplitude and frequency of the harmonics (more correctly, partials) of these instruments would differ depending on frequency, duration and amplitude. He is also credited with performing the first experiments on a range of synthesis techniques including FM synthesis and waveshaping.
After the discrete Shepard scale Risset created a version of the scale where the steps between each tone are continuous, and it is appropriately called the continuous Risset scale or Shepard-Risset glissando.
Risset also created a similar effect with rhythm in which tempo seems to increase or decrease endlessly.
Risset was the head of the Computer Department at IRCAM (1975–1979). At MIT Media Labs, he composed the first Duet for one pianist (1989). For his work in computer music and his 70 compositions, he received the first Golden Nica (Ars Electronica Prize, 1987), the Giga-Hertz Grand Prize 2009, and the highest French awards in both music (Grand Prix National de la Musique, 1990) and science (Gold Medal, Centre National de la Recherche Scientifique, 1999). and in art (René Dumesnil Prize from the French Academy of Fine Arts, 2011).
Risset died in Marseille on 21 November 2016.
Selected works
Vocal music
Dérives, for choir and magnetic tape (1985) 15'
Inharmonique, for soprano and tape (1977) 15'
Orchestral music
Escalas, for large orchestra (2001) 17'
Mirages, for 16 musicians and tape (1978) 24'
Chamber music
Profils, for 7 instruments and tape (1983) 18'
Mutations II for ensemble and electronics (1973) 17'
Solo music
Trois études en duo, for pianist (bidirectional MIDI piano with computer interaction) (1991) 10'
Huit esquisses en duo, for pianist (bidirectional MIDI piano with computer interaction) (1989) 17'
Voilements, for saxophone and tape (1987) 14'
Passages for flute and tape (1982) 14'
Variants for violin and digital processing (1995) 8'
Music for solo tape
Invisible Irène (1995) 12'
Sud (1985) 24'
Songes (1979) 10'
Trois mouvements newtoniens, for tape (1978) 13'
Mutations (1969) 10'
Computer Suite from Little Boy (1968) 13'
References
Further reading
Baudouin, Olivier, Pionniers de la musique numérique, Sampzon, Delatour, 2012.
Portrait polychrome n°2 : Jean-Claude Risset, INA/CDMC Publisher, 2001 ()
External links
Jean Claude Risset, Ressources.IRCAM
Mode Records profile: Jean-Claude Risset
The Living Composers Project: Jean-Claude Risset
1938 births
2016 deaths
|
https://en.wikipedia.org/wiki/Doomsday%20rule | The Doomsday rule, Doomsday algorithm or Doomsday method is an algorithm of determination of the day of the week for a given date. It provides a perpetual calendar because the Gregorian calendar moves in cycles of 400 years. The algorithm for mental calculation was devised by John Conway in 1973, drawing inspiration from Lewis Carroll's perpetual calendar algorithm. It takes advantage of each year having a certain day of the week upon which certain easy-to-remember dates, called the doomsdays, fall; for example, the last day of February, 4/4, 6/6, 8/8, 10/10, and 12/12 all occur on the same day of the week in any year.
Applying the Doomsday algorithm involves three steps: Determination of the anchor day for the century, calculation of the anchor day for the year from the one for the century, and selection of the closest date out of those that always fall on the doomsday, e.g., 4/4 and 6/6, and count of the number of days (modulo 7) between that date and the date in question to arrive at the day of the week. The technique applies to both the Gregorian calendar and the Julian calendar, although their doomsdays are usually different days of the week.
The algorithm is simple enough that it can be computed mentally. Conway could usually give the correct answer in under two seconds. To improve his speed, he practiced his calendrical calculations on his computer, which was programmed to quiz him with random dates every time he logged on.
Anchor days for some contemporary years
Doomsday's anchor day for the current year in the Gregorian calendar (2023) is Tuesday. For some other contemporary years:
The table is filled in horizontally, skipping one column for each leap year. This table cycles every 28 years, except in the Gregorian calendar on years that are a multiple of 100 (such as 1900 and 2100 which are not leap years) that are not also a multiple of 400 (like 2000 which is still a leap year). The full cycle is 28 years (1,461 weeks) in the Julian calendar, 400 years (20,871 weeks) in the Gregorian calendar.
Memorable dates that always land on Doomsday
One can find the day of the week of a given calendar date by using a nearby doomsday as a reference point. To help with this, the following is a list of easy-to-remember dates for each month that always land on the doomsday.
The last day of February is always a doomsday. For January, January 3 is a doomsday during common years and January 4 a doomsday during leap years, which can be remembered as "the 3rd during 3 years in 4, and the 4th in the 4th year". For March, one can remember either Pi Day or "March 0", the latter referring to the day before March 1, i.e. the last day of February.
For the months April through December, the even numbered months are covered by the double dates 4/4, 6/6, 8/8, 10/10, and 12/12, all of which fall on the doomsday. The odd numbered months can be remembered with the mnemonic "I work from 9 to 5 at the 7-11", i.e., 9/5, 7/11, and also 5/9 and 11/7, are all doomsda |
https://en.wikipedia.org/wiki/Matunga%20Road%20railway%20station | Matunga Road ([maːʈuŋɡaː] station code:MRU) is the name of a railway station on the Western Line of the Mumbai Suburban Railway network. It offers access to Matunga and Shivaji Park areas of Mumbai. It should not be confused with the nearby Matunga railway station, which is on the Central Line just to the east. Matunga Road is one of the smallest railway halt in Mumbai in terms of number of passengers and number of platforms. The Ruparel College is the nearest college to this station. Fast local trains between Churchgate and Virar do not stop at Matunga Road station. It has been documented as the first suburban station on Western Railway to be run by all-women staff.
Events
Western Railway on International Women's Day 2018, stepped in to make one of its railway station Matunga Road to be run by all women staff. Western Railway posted a total of 31 women staffers as frontline staff, comprising Commercial, Operating and Security departments. It includes 13 Commercial clerks and 3 Ticket checking staff to undertake commercial activities, whereas 11 Operating staff (Station Master and Points person) and 4 Railway Protection Force personnel. These handle overall operations of Matunga Road station round the clock as of 2018. In addition to this, Western Railway also collaborated with Rotary Club of Bombay Queen for beautification of Matunga Road station in 2018. The theme-based painting work depicting the diversified role and emergence of women in the Society has been planned across the Booking offices, Station Superintendent office and Foot over Bridges. With this, Matunga Road became the first such station on the Western Railway and the second suburban railway station in Mumbai to be operated only by women.
Incidents
At 1.40pm on 29 October 1993 a "crude bomb with lots of nails" exploded under the seat of a second-class compartment in a train at Matunga Road station. 2 people died and 40 were injured.
Matunga Road was one of the stations affected by 11 July 2006 Mumbai train bombings. Just before 18.15, a bomb exploded in the first-class general compartment of the 17.57 Churchgate-Virar fast train as the train was passing Matunga Road station on the fast line. There was no damage to the station. A memorial plaque stands at the north end of the station today.
Notes and references
Railway stations in India opened in 1867
Mumbai WR railway division
Railway stations in Mumbai City district
Mumbai Suburban Railway stations |
https://en.wikipedia.org/wiki/Khar%20Road%20railway%20station | Khar Road ([kʰaːɾ]; station code: KHAR) is a railway station on the Western Line and the Harbour Line of the Mumbai Suburban Railway network, in the Khar suburb. It is close to the Bandra Terminus for upcountry trains.
The name of the station is derived from the name of the Koli village Khar-Danda, near the Arabian Sea. Danda is a home to fishermen. Now a link will connect from Khar Danda to Bandra–Versova Sea Link.
On 11 July 2006, Khar Road was affected by the Mumbai train bombings.
References
Railway stations in Mumbai Suburban district
Mumbai Suburban Railway stations
Mumbai WR railway division |
https://en.wikipedia.org/wiki/TV%20tuner%20card | A TV tuner card is a kind of television tuner that allows television signals to be received by a computer. Most TV tuners also function as video capture cards, allowing them to record television programs onto a hard disk much like the digital video recorder (DVR) does.
The interfaces for TV tuner cards are most commonly either PCI bus expansion card or the newer PCI Express (PCIe) bus for many modern cards, but PCMCIA, ExpressCard, or USB devices also exist. In addition, some video cards double as TV tuners, notably the ATI All-In-Wonder series. The card contains a tuner and an analog-to-digital converter (collectively known as the analog front end) along with demodulation and interface logic. Some lower-end cards lack an onboard processor and, like a Winmodem, rely on the system's CPU for demodulation.
Types
There are many types of tuner cards.
Analog tuners
Analog television cards output a raw video stream, suitable for real-time viewing but ideally requiring some sort of video compression if it is to be recorded.
Some cards also have analog input (composite video or S-Video) and many also provide a radio tuner.
An early example was the Aapps Corp. MicroTV for Apple Macintosh II, which debuted in 1989.
More-advanced TV tuners encode the signal to Motion JPEG or MPEG, relieving the main CPU of this load.
Hybrid tuners
A hybrid tuner has one tuner that can be configured to act as an analog tuner or a digital tuner. Switching between the systems is fairly easy, but cannot be done immediately. The card operates as a digital tuner or an analog tuner until reconfigured.
Combo tuners
This is similar to a hybrid tuner, except there are two separate tuners on the card. One can watch analog while recording digital, or vice versa. The card operates as an analog tuner and a digital tuner simultaneously. The advantages over two separate cards are cost and utilization of expansion slots in the computer. As many regions around the world convert from analog to digital broadcasts, these tuners are gaining popularity.
Like the analog cards, the Hybrid and Combo tuners can have specialized chips on the tuner card to perform the encoding, or leave this task to the CPU. The tuner cards with this 'hardware encoding' are generally thought of as being higher quality. Small USB tuner sticks have become more popular in 2006 and 2007 and are expected to increase in popularity. These small tuners generally do not have hardware encoding due to size and heat constraints.
While most TV tuners are limited to the radio frequencies and video formats used in the country of sale, many TV tuners used in computers use DSP, so a firmware upgrade is often all that's necessary to change the supported video format. Many newer TV tuners have flash memory big enough to hold the firmware sets for decoding several different video formats, making it possible to use the tuner in many countries without having to flash the firmware. However, while it is generally possible to flash |
https://en.wikipedia.org/wiki/Electronic%20signature | An electronic signature, or e-signature, is data that is logically associated with other data and which is used by the signatory to sign the associated data. This type of signature has the same legal standing as a handwritten signature as long as it adheres to the requirements of the specific regulation under which it was created (e.g., eIDAS in the European Union, NIST-DSS in the USA or ZertES in Switzerland).
Electronic signatures are a legal concept distinct from digital signatures, a cryptographic mechanism often used to implement electronic signatures. While an electronic signature can be as simple as a name entered in an electronic document, digital signatures are increasingly used in e-commerce and in regulatory filings to implement electronic signatures in a cryptographically protected way. Standardization agencies like NIST or ETSI provide standards for their implementation (e.g., NIST-DSS, XAdES or PAdES). The concept itself is not new, with common law jurisdictions having recognized telegraph signatures as far back as the mid-19th century and faxed signatures since the 1980s.
Description
An electronic signature is intended to provide a secure and accurate identification method for the signatory during a transaction.
Definitions of electronic signatures vary depending on the applicable jurisdiction. A common denominator in most countries is the level of an advanced electronic signature requiring that:
The signatory can be uniquely identified and linked to the signature
The signatory must have sole control of the private key that was used to create the electronic signature
The signature must be capable of identifying if its accompanying data has been tampered with after the message was signed
In the event that the accompanying data has been changed, the signature must be invalidated
Electronic signatures may be created with increasing levels of security, with each having its own set of requirements and means of creation on various levels that prove the validity of the signature. To provide an even stronger probative value than the above described advanced electronic signature, some countries like member states of the European Union or Switzerland introduced the qualified electronic signature. It is difficult to challenge the authorship of a statement signed with a qualified electronic signature - the statement is non-repudiable. Technically, a qualified electronic signature is implemented through an advanced electronic signature that utilizes a digital certificate, which has been encrypted through a security signature-creating device and which has been authenticated by a qualified trust service provider.
In contract law
Since well before the American Civil War began in 1861, morse code was used to send messages electrically via the telegraph. Some of these messages were agreements to terms that were intended as enforceable contracts. An early acceptance of the enforceability of telegraphic messages as electronic signatures came |
https://en.wikipedia.org/wiki/Computer-aided%20software%20engineering | Computer-aided software engineering (CASE) was a domain of software tools used to design and implement applications. CASE tools were similar to and were partly inspired by Computer-Aided Design (CAD) tools used for designing hardware products. CASE tools were intended to help develop high-quality, defect-free, and maintainable software. CASE software was often associated with methods for the development of information systems together with automated tools that could be used in the software development process.<ref>P. Loucopoulos and V. Karakostas (1995). System Requirements Engineerinuality software which will perform effectively.</ref>
History
The Information System Design and Optimization System (ISDOS) project, started in 1968 at the University of Michigan, initiated a great deal of interest in the whole concept of using computer systems to help analysts in the very difficult process of analysing requirements and developing systems. Several papers by Daniel Teichroew fired a whole generation of enthusiasts with the potential of automated systems development. His Problem Statement Language / Problem Statement Analyzer (PSL/PSA) tool was a CASE tool although it predated the term.
Another major thread emerged as a logical extension to the data dictionary of a database. By extending the range of metadata held, the attributes of an application could be held within a dictionary and used at runtime. This "active dictionary" became the precursor to the more modern model-driven engineering capability. However, the active dictionary did not provide a graphical representation of any of the metadata. It was the linking of the concept of a dictionary holding analysts' metadata, as derived from the use of an integrated set of techniques, together with the graphical representation of such data that gave rise to the earlier versions of CASE.
The next entrant into the market was Excelerator from Index Technology in Cambridge, Mass. While DesignAid ran on Convergent Technologies and later Burroughs Ngen networked microcomputers, Index launched Excelerator on the IBM PC/AT platform. While, at the time of launch, and for several years, the IBM platform did not support networking or a centralized database as did the Convergent Technologies or Burroughs machines, the allure of IBM was strong, and Excelerator came to prominence. Hot on the heels of Excelerator were a rash of offerings from companies such as Knowledgeware (James Martin, Fran Tarkenton and Don Addington), Texas Instrument's CA Gen and Andersen Consulting's FOUNDATION toolset (DESIGN/1, INSTALL/1, FCP).
CASE tools were at their peak in the early 1990s. According to the PC Magazine of January 1990, over 100 companies were offering nearly 200 different CASE tools. At the time IBM had proposed AD/Cycle, which was an alliance of software vendors centered on IBM's Software repository using IBM DB2 in mainframe and OS/2:The application development tools can be from several sources: from IBM, from v |
https://en.wikipedia.org/wiki/Null%20modem | Null modem is a communication method to directly connect two DTEs (computer, terminal, printer, etc.) using an RS-232 serial cable. The name stems from the historical use of RS-232 cables to connect two teleprinter devices or two modems in order to communicate with one another; null modem communication refers to using a crossed-over RS-232 cable to connect the teleprinters directly to one another without the modems.
It is also used to serially connect a computer to a printer, since both are DTE, and is known as a Printer Cable.
The RS-232 standard is asymmetric as to the definitions of the two ends of the communications link, assuming that one end is a DTE and the other is a DCE, e.g. a modem. With a null modem connection the transmit and receive lines are crosslinked. Depending on the purpose, sometimes also one or more handshake lines are crosslinked. Several wiring layouts are in use because the null modem connection is not covered by the RS-232 standard.
Origins
Originally, the RS-232 standard was developed and used for teleprinter machines which could communicate with each other over phone lines. Each teleprinter would be physically connected to its modem via an RS-232 connection and the modems could call each other to establish a remote connection between the teleprinters. If a user wished to connect two teleprinters directly without modems (null modem) then they would crosslink the connections. The term null modem may also refer to the cable or adapter itself as well as the connection method. Null modem cables were a popular method for transferring data between the early personal computers from the 1980s to the early 1990s.
Cables and adapters
A null modem cable is a RS-232 serial cable where the transmit and receive lines are crosslinked. In some cables there are also handshake lines crosslinked. In many situations a straight-through serial cable is used, together with a null modem adapter. The adapter contains the necessary crosslinks between the signals.
Wiring diagrams
Below is a very common wiring diagram for a null modem cable to interconnect two DTEs (e.g. two PCs) providing full handshaking, which works with software relying on proper assertion of the Data Carrier Detect (DCD) signal:
Applications
The original application of a null modem was to connect two teleprinter terminals directly without using modems. As the RS-232 standard was adopted by other types of equipment, designers needed to decide whether their devices would have DTE-like or DCE-like interfaces. When an application required that two DTEs (or two DCEs) needed to communicate with each other, then a null modem was necessary.
Null modems were commonly used for file transfer between computers, or remote operation. Under the Microsoft Windows operating system, the direct cable connection can be used over a null modem connection. The later versions of MS-DOS were shipped with the InterLnk program. Both pieces of software allow the mapping of a hard disk on on |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.