source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Andr%C3%A9%20LaMothe | André LaMothe is a computer scientist, author, hardware engineer, and game programmer, known for writing books about game development.
Game design and programming
LaMothe is an independent game designer who was CEO of Xtreme Games and also developed video games for Microsoft Windows. In the gaming industry LaMothe has a reputation as the "Yoda of game design," encouraging and teaching other programmers. He and Alex Varanese also designed the XGameStation Micro Edition as a game development tool for hobbyists and students.
LaMothe is also the hardware evangelist for the upcoming Intellivision Amico and the founder of Nurve Networks LLC and iC0nstrux.com.
Writing career
LaMothe is an author of multiple books on computer programming and game design, including Windows Game Programming for Dummies. Other books include Tricks of the 3D Game Programming Gurus, which tackles the development of a 3D software engine across 1600 pages.
Many of his game development books were released in the 1990s and early 2000s. He has been described as having "an uncanny knack of shaping some of the most difficult and mind-bending programming concepts into a palatable form."
Selected bibliography
Game Programming for the Propeller Powered HYDRA
Game Programming Starter Kit
See also
XGameStation series
HYDRA Game Development Kit
References
Living people
People from the San Francisco Bay Area
Video game programmers
American computer scientists
San Jose State University alumni
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/UnixWare | UnixWare is a Unix operating system. It was originally released by Univel, a jointly owned venture of AT&T's Unix System Laboratories (USL) and Novell. It was then taken over by Novell. Via Santa Cruz Operation (SCO), it went on to Caldera Systems, Caldera International, and The SCO Group before it was sold to UnXis (now Xinuos). UnixWare is typically deployed as a server rather than a desktop. Binary distributions of UnixWare are available for x86 architecture computers. UnixWare is primarily marketed as a server operating system.
History
Univel (1991–1993)
After the SVR4 effort to merge SunOS and System V, AT&T's Unix System Laboratories (USL) formed the Univel partnership with Novell to develop a desktop version of Unix for i386 and i486 machines, codenamed "Destiny".
Destiny is based on the Unix System V release 4.2 kernel. The MoOLIT toolkit is used for the windowing system, allowing the user to choose between an OPEN LOOK or MOTIF-like look and feel at runtime. In order to make the system more robust on commodity desktop hardware, the Veritas VXFS journaling file system is used in place of the UFS file system used in SVR4. Networking support in UnixWare includes both TCP/IP and interoperability with Novell's NetWare protocols (IPX/SPX); the former were the standard among Unix users at the time of development, while PC networking was much more commonly based on NetWare.
Destiny was released in 1992 as UnixWare 1.0, with the intention of unifying the fragmented PC Unix market behind this single variant of the operating system. The system was earlier to reach the corporate computing market than Microsoft's Windows NT, but observers of the period remarked that UnixWare was "just another flavor of Unix", Novell's involvement being more a marketing ploy than a significant influx of technology. There two editions of Destiny: a Personal Edition, which includes Novell IPX networking but not TCP/IP, and an Advanced Server Edition with TCP/IP and other server software. The personal edition is limited to two active users, while the server edition includes an unlimited user license. Around 35,000 copies of UnixWare 1.0 were sold.
In 1992, UnixWare 1.0 Personal Edition came with DOS Merge 3.0 and Novell's DR DOS 6.0.
In 1993, Novell purchased USL from AT&T and merged USL and Univel into a new Unix Systems Group.
Novell (1993–1995)
In 1994 Novell released UnixWare 1.1, which includes TCP/IP in both the personal and advanced server editions.
The MOTIF 1.2 runtime libraries are included for COSE compliance. NUC (NetWare Unix Client) software is included for integration with Novell NetWare servers. The Advanced Merge application is installed on both the server and personal editions to allow running DOS and Windows 3.1 applications.
Novell later released bug-fix versions 1.1.1, 1.1.2, 1.1.3 and finally 1.1.4 on 19 June 1995.
UnixWare 2.0, based on the Unix System V release 4.2MP kernel, which added support for multiprocessing, began shipping |
https://en.wikipedia.org/wiki/CITV-DT | CITV-DT (channel 13) is a television station in Edmonton, Alberta, Canada, part of the Global Television Network. The station is owned and operated by network parent Corus Entertainment, and maintains studios on Allard Way Northwest in the Pleasantview neighbourhood of Edmonton; its transmitter is located just off of Highway 21, southeast of the city. CITV-DT carries the full Global network schedule, and its programming is similar to sister station CICT-DT in Calgary.
History
The station first signed on the air on September 1, 1974. CITV was originally owned by Allarcom, owned by Dr. Charles Allard, and launched under the brand "Independent Television" (ITV). Allard's proposal won out over three competing applicants for a second commercial station in Edmonton because it emphasized local programming.
Beginning in 1981, CITV became a national superstation, being offered on most cable television systems across the country through the Cancom (now Shaw Broadcast Services) service for Canadian cable television providers too distant to receive most over-the-air television signals. It is still carried on satellite television nationwide through Bell Satellite TV and Shaw Direct, as well as on several cable systems across Canada outside Alberta, including in all of Newfoundland and Labrador and some areas of Nova Scotia, New Brunswick, Saskatchewan, British Columbia and the Yukon.
From 1980 to 1982, the station's studios were used for taping episodes of the Canadian sketch comedy SCTV; since the station itself was the focus of the storylines, CITV's lobby and control room were often used for SCTV scenes. (The show had previously taped in Toronto at CIII-TV, Global's flagship station, somewhat ironically.) CITV's booth announcer, Robert Corness, also announced for SCTV, including later syndicated reruns distributed by Allarcom and WIC.
In 1987, the station launched a semi-satellite in Red Deer, Alberta, as part of a joint venture with Monarch Broadcasting (the owners of CKRD-TV). CITV-TV-1, VHF channel 10, broadcast ITV's program schedule, with separate commercials for Red Deer and Central Alberta. The rebroadcaster, along with CKRD-TV, was purchased by Allarcom in 1989. Some programs produced at CKRD-TV's studios were later added to CITV-TV-1's schedule for Central Alberta viewers, such as the noon-hour program ITV Express, and the RDTV News Crew at 5:30 p.m.
In February 1991, Allarcom's broadcast and cable assets, including CITV-TV, was purchased by WIC Western International Communications.
In July 2000, the CRTC approved the purchase of WIC's broadcast television assets, including CITV-TV, by Canwest. CITV officially joined the Canwest-owned Global Television Network on September 4, 2000, along with fellow Alberta stations CICT in Calgary, CISA-TV in Lethbridge, and CKRD-TV Red Deer; the former WIC stations in Edmonton, Calgary, and Lethbridge had been carrying Global's programming, alongside WIC-sourced programming, since 1988.
The CRTC approved |
https://en.wikipedia.org/wiki/One-key%20MAC | One-key MAC (OMAC) is a message authentication code constructed from a block cipher much like the CBC-MAC algorithm.
Officially there are two OMAC algorithms (OMAC1 and OMAC2) which are both essentially the same except for a small tweak. OMAC1 is equivalent to CMAC, which became an NIST recommendation in May 2005.
It is free for all uses: it is not covered by any patents.
In cryptography, CMAC is a block cipher-based message authentication code algorithm. It may be used to provide assurance of the authenticity and, hence, the integrity of data. This mode of operation fixes security deficiencies of CBC-MAC (CBC-MAC is secure only for fixed-length messages).
The core of the CMAC algorithm is a variation of CBC-MAC that Black and Rogaway proposed and analyzed under the name XCBC and submitted to NIST. The XCBC algorithm efficiently addresses the security deficiencies of CBC-MAC, but requires three keys. Iwata and Kurosawa proposed an improvement of XCBC and named the resulting algorithm One-Key CBC-MAC (OMAC) in their papers. They later submitted OMAC1, a refinement of OMAC, and additional security analysis. The OMAC algorithm reduces the amount of key material required for XCBC. CMAC is equivalent to OMAC1.
To generate an ℓ-bit CMAC tag (t) of a message (m) using a b-bit block cipher (E) and a secret key (k), one first generates two b-bit sub-keys (k1 and k2) using the following algorithm (this is equivalent to multiplication by x and x2 in a finite field GF(2b)). Let ≪ denote the standard left-shift operator and ⊕ denote bit-wise exclusive or:
Calculate a temporary value k0 = Ek(0).
If msb(k0) = 0, then k1 = k0 ≪ 1, else k1 = (k0 ≪ 1) ⊕ C; where C is a certain constant that depends only on b. (Specifically, C is the non-leading coefficients of the lexicographically first irreducible degree-b binary polynomial with the minimal number of ones: 0x1B for 64-bit, 0x87 for 128-bit, and 0x425 for 256-bit blocks.)
If , then , else .
Return keys (k1, k2) for the MAC generation process.
As a small example, suppose , , and . Then and .
The CMAC tag generation process is as follows:
Divide message into b-bit blocks , where m1, ..., mn−1 are complete blocks. (The empty message is treated as one incomplete block.)
If mn is a complete block then else .
Let .
For , calculate .
Output .
The verification process is as follows:
Use the above algorithm to generate the tag.
Check that the generated tag is equal to the received tag.
Implementations
Python implementation: see the usage of the AES_CMAC() function in "impacket/blob/master/tests/misc/test_crypto.py", and its definition in "impacket/blob/master/impacket/crypto.py"
Ruby implementation
References
External links
The AES-CMAC Algorithm
The AES-CMAC-96 Algorithm and Its Use with IPsec
The Advanced Encryption Standard-Cipher-based Message Authentication Code-Pseudo-Random Function-128 (AES-CMAC-PRF-128)
OMAC Online Test
More information on OMAC
Rust implementation
Message aut |
https://en.wikipedia.org/wiki/Whirlpool%20%28hash%20function%29 | In computer science and cryptography, Whirlpool (sometimes styled WHIRLPOOL) is a cryptographic hash function. It was designed by Vincent Rijmen (co-creator of the Advanced Encryption Standard) and Paulo S. L. M. Barreto, who first described it in 2000.
The hash has been recommended by the NESSIE project. It has also been adopted by the International Organization for Standardization (ISO) and the International Electrotechnical Commission (IEC) as part of the joint ISO/IEC 10118-3 international standard.
Design features
Whirlpool is a hash designed after the Square block cipher, and is considered to be in that family of block cipher functions.
Whirlpool is a Miyaguchi-Preneel construction based on a substantially modified Advanced Encryption Standard (AES).
Whirlpool takes a message of any length less than 2256 bits and returns a 512-bit message digest.
The authors have declared that
"WHIRLPOOL is not (and will never be) patented. It may be used free of charge for any purpose."
Version changes
The original Whirlpool will be called Whirlpool-0, the first revision of Whirlpool will be called Whirlpool-T and the latest version will be called Whirlpool in the following test vectors.
In the first revision in 2001, the S-box was changed from a randomly generated one with good cryptographic properties to one which has better cryptographic properties and is easier to implement in hardware.
In the second revision (2003), a flaw in the diffusion matrix was found that lowered the estimated security of the algorithm below its potential. Changing the 8x8 rotating matrix constants from (1, 1, 3, 1, 5, 8, 9, 5) to (1, 1, 4, 1, 8, 5, 2, 9) solved this issue.
Internal structure
The Whirlpool hash function is a Merkle–Damgård construction based on an AES-like block cipher W in Miyaguchi–Preneel mode.
The block cipher W consists of an 8×8 state matrix of bytes, for a total of 512 bits.
The encryption process consists of updating the state with four round functions over 10 rounds. The four round functions are SubBytes (SB), ShiftColumns (SC), MixRows (MR) and AddRoundKey (AK). During each round the new state is computed as
.
SubBytes
The SubBytes operation applies a non-linear permutation (the S-box) to each byte of the state independently. The 8-bit S-box is composed of 3 smaller 4-bit S-boxes.
ShiftColumns
The ShiftColumns operation cyclically shifts each byte in each column of the state. Column j has its bytes shifted downwards by j positions.
MixRows
The MixRows operation is a right-multiplication of each row by an 8×8 matrix over . The matrix is chosen such that the branch number (an important property when looking at resistance to differential cryptanalysis) is 9, which is maximal.
AddRoundKey
The AddRoundKey operation uses bitwise xor to add a key calculated by the key schedule to the current state. The key schedule is identical to the encryption itself, except the AddRoundKey function is replaced by an AddRoundConstant function t |
https://en.wikipedia.org/wiki/TBL | TBL or .TBL may refer to:
Entertainment
The Beautiful Life: TBL, a 2009 American television series
The Blacklist, a 2013-2024 American crime thriller television series
Computing
tbl, a UNIX preprocessor that formats tables
.TBL, a file extension for a table in List of filename extensions (S–Z)
TRANS.TBL, a file on Compact Disc computer filesystems
Sports
Tauron Basket Liga
Thailand Basketball League
The Basketball League
Turkish Basketball First League
Tampa Bay Lightning
Other uses
Transmission balise-locomotive, a Belgian train protection system
Team-based learning
Tanzania Breweries Limited, a Tanzanian brewery firm
Triple bottom line (TBL or 3BL), an accounting framework
Tboli language (ISO 639:tbl)
Tall building lawyer, a lawyer working for a law firm (often a biglaw firm) that serves large corporations and wealthy individuals
See also
Tim Berners-Lee, inventor of the World Wide Web |
https://en.wikipedia.org/wiki/Memory%20address | In computing, a memory address is a reference to a specific memory location used at various levels by software and hardware. Memory addresses are fixed-length sequences of digits conventionally displayed and manipulated as unsigned integers. Such numerical semantic bases itself upon features of CPU (such as the instruction pointer and incremental address registers), as well upon use of the memory like an array endorsed by various programming languages.
Types
Physical addresses
A digital computer's main memory consists of many memory locations. Each memory location has a physical address which is a code. The CPU (or other device) can use the code to access the corresponding memory location. Generally only system software, i.e. the BIOS, operating systems, and some specialized utility programs (e.g., memory testers), address physical memory using machine code operands or processor registers, instructing the CPU to direct a hardware device, called the memory controller, to use the memory bus or system bus, or separate control, address and data busses, to execute the program's commands. The memory controllers' bus consists of a number of parallel lines, each represented by a binary digit (bit). The width of the bus, and thus the number of addressable storage units, and the number of bits in each unit, varies among computers.
Logical addresses
A computer program uses memory addresses to execute machine code, and to store and retrieve data. In early computers logical and physical addresses corresponded, but since the introduction of virtual memory most application programs do not have a knowledge of physical addresses. Rather, they address logical addresses, or virtual addresses, using the computer's memory management unit and operating system memory mapping; see below.
Unit of address resolution
Most modern computers are byte-addressable. Each address identifies a single byte (eight bits) of storage. Data larger than a single byte may be stored in a sequence of consecutive addresses. There exist word-addressable computers, where the minimal addressable storage unit is exactly the processor's word. For example, the Data General Nova minicomputer, and the Texas Instruments TMS9900 and National Semiconductor IMP-16 microcomputers used 16 bit words, and there were many 36-bit mainframe computers (e.g., PDP-10) which used 18-bit word addressing, not byte addressing, giving an address space of 218 36-bit words, approximately 1 megabyte of storage. The efficiency of addressing of memory depends on the bit size of the bus used for addresses – the more bits used, the more addresses are available to the computer. For example, an 8-bit-byte-addressable machine with a 20-bit address bus (e.g. Intel 8086) can address 220 (1,048,576) memory locations, or one MiB of memory, while a 32-bit bus (e.g. Intel 80386) addresses 232 (4,294,967,296) locations, or a 4 GiB address space. In contrast, a 36-bit word-addressable machine with an 18-bit address bus ad |
https://en.wikipedia.org/wiki/Shis%C5%8D%20District%2C%20Hy%C5%8Dgo | was a district located in Hyōgo Prefecture, Japan.
As of April 1, 2005 (but with June 30, 2004 population data), the district had an estimated population of 5,983 and a density of 99 persons per km2. The total area was 60.30 km2.
Towns and villages
Yasutomi
Mergers
On April 1, 2005 - the towns of Chikusa, Haga, Ichinomiya and Yamasaki were merged to create the city of Shisō.
On March 27, 2006 - the town of Yasutomi, along with the towns of Ieshima and Yumesaki (both from Shikama District), and the town of Kōdera (from Kanzaki District), was merged into the expanded city of Himeji. district.
Former districts of Hyōgo Prefecture |
https://en.wikipedia.org/wiki/Simplified%20Instructional%20Computer | The Simplified Instructional Computer (abbreviated SIC) is a hypothetical computer system introduced in System Software: An Introduction to Systems Programming, by Leland Beck. Due to the fact that most modern microprocessors include subtle, complex functions for the purposes of efficiency, it can be difficult to learn systems programming using a real-world system. The Simplified Instructional Computer solves this by abstracting away these complex behaviors in favor of an architecture that is clear and accessible for those wanting to learn systems programming.
SIC Architecture
The SIC machine has basic addressing, storing most memory addresses in hexadecimal integer format. Similar to most modern computing systems, the SIC architecture stores all data in binary and uses the two's complement to represent negative values at the machine level. Memory storage in SIC consists of 8-bit bytes, and all memory addresses in SIC are byte addresses. Any three consecutive bytes form a 24-bit 'word' value, addressed by the location of the lowest numbered byte in the word value. Numeric values are stored as word values, and character values use the 8-bit ASCII system. The SIC machine does not support floating-point hardware and has at most 32,768 bytes of memory. There is also a more complicated machine built on top of SIC called the Simplified Instruction Computer with Extra Equipment (SIC/XE). The XE expansion of SIC adds a 48-bit floating point data type, an additional memory addressing mode, and extra memory (1 megabyte instead of 32,768 bytes) to the original machine. All SIC assembly code is upwards compatible with SIC/XE.
SIC machines have several registers, each 24 bits long and having both a numeric and character representation:
A (0): Used for basic arithmetic operations; known as the accumulator register.
X (1): Stores and calculates addresses; known as the index register.
L (2): Used for jumping to specific memory addresses and storing return addresses; known as the linkage register.
PC (8): Contains the address of the next instruction to execute; known as the program counter register.
SW (9): Contains a variety of information, such as carry or overflow flags; known as the status word register.
In addition to the standard SIC registers, there are also four additional general-purpose registers specific to the SIC/XE machine:
B (3): Used for addressing; known as the base register.
S (4): No special use, general purpose register.
T (5): No special use, general purpose register.
F (6): Floating point accumulator register (This register is 48-bits instead of 24).
These five/nine registers allow the SIC or SIC/XE machine to perform most simple tasks in a customized assembly language. In the System Software book, this is used with a theoretical series of operation codes to aid in the understanding of assemblers and linker-loaders required for the execution of assembly language code.
Addressing Modes for SIC and SIC/XE
The Simplified Instruct |
https://en.wikipedia.org/wiki/The%20Adventures%20of%20Rin%20Tin%20Tin | The Adventures of Rin Tin Tin is an American children's Western television series that aired 164 episodes from October 1954 to May 1959 on the ABC television network.
The show starred Lee Aaker as Rusty, a boy orphaned in an Indian raid, who was being raised by the soldiers at a US Cavalry post known as Fort Apache. Rusty and his German Shepherd dog, Rin Tin Tin, help the soldiers to establish order in the American West. James E. Brown appeared as Lieutenant Ripley "Rip" Masters. Co-stars included Joe Sawyer as Sergeant Biff O'Hara and Rand Brooks as Corporal Randy Boone.
The character of Rin Tin Tin was named after Rin Tin Tin, a legendary screen dog of the 1920s and 1930s. The character was ostensibly played by Rin Tin Tin IV, who was either a descendant or related to the original dog. However, due to Rin Tin Tin IV's poor screen performance, the character was mostly performed by an unrelated dog, Flame Jr.
Synopsis
Rusty and his dog, Rin Tin Tin (Rinty), are the only survivors of an Indian raid on their wagon train. The boy and his dog are adopted by the 101st Cavalry at Fort Apache, Arizona, where Rusty is commissioned as an honorary corporal. Throughout the series, Rusty and Rinty help the cavalry and the nearby people to establish order in the American West.
Cast
Lee Aaker - Corporal Rusty "B-Company"
James Brown - Lt. Ripley 'Rip' Masters
Rin Tin Tin IV/Flame Jr. - Rin Tin Tin
Joe Sawyer - Sgt. Biff O'Hara
Rand Brooks - Corporal Randy Boone
William Forrest - Major Swanson
Hal Hopper - Cpl. Clark
John Hoyt - Colonel Barker
Harry Strang - Sheriff
Dean Fredericks - Komawi
Mildred von Hollen - Mrs. Barrington
George Keymas - Black Billy
Ralph Moody - Silas Gunn
Tom McKee - Capt. Davis
William Fawcett - Captain Longey/Marshal George Higgins
Morris Ankrum - Chief Red Eagle
Lane Bradford - Barrows
Ernest Sarracino - Hamid Bey
Jack Littlefield - Karl
Dehl Berti - Katawa
Bill Hale - Cole Hogarth
Steven Ritch - Lone Hawk
Lee Roberts - Aaron Depew
Larry Chance - Apache Jack
Charles Stevens - Geronimo
Gordon Richards - Hubert Twombly
Pierre Watkin - The Vet
Tommy Farrell - Carpenter
Harry Hickox - John Carter
Andy Clyde - Homer Tubbs
Ed Hinton - Seth Ramsey
Patrick Whyte - McKenzie
Stanley Andrews - Ed Whitmore
Abel Fernandez - O-ye-tza
Louis Lettieri - Chief Pokiwah
Jan Arvan - Chief Running Horse
William Henry - Bill Anderson
Guest stars
Robert Fuller appeared as Stan in the 1958 episode "The Epidemic". Harry Cheshire appeared as Silas Mason in "The Misfit Marshal" (1959).
Brad Johnson (1924–1981) appeared in the role of John Quinn in the episode "The Iron Horse" (1955).
Robert Knapp was cast in the role of Allen in the 1955 episode "The Guilty One".
William Fawcett played an elderly marshal in four episodes, including the 1955 episode, "Higgins Rides Again".
Rico Alaniz appeared twice, as Big Elk in "Rin Tin Tin Meets O'Hara's Mother" and as Don Valdez in "The Invaders" (both 1956).
Other guest stars included Roscoe Ates and Dean |
https://en.wikipedia.org/wiki/John%20Langford | John Langford may refer to:
John Langford (engineer), president of Aurora Flight Sciences
John Langford (computer scientist), at Microsoft Research
John Langford (rugby union) (born 1968), Australian rugby union player
John Alfred Langford (1823–1903), English journalist, poet and antiquary
See also
Jon Langford (born 1957), musician and artist
John Langford-Holt (1916–1993), British politician |
https://en.wikipedia.org/wiki/America%3A%20A%20Tribute%20to%20Heroes | America: A Tribute to Heroes was a benefit concert created by the heads of the four major American broadcast networks; Fox, ABC, NBC and CBS. Joel Gallen was selected by them to produce and run the show. Actor George Clooney organized celebrities to perform and to staff the telephone bank.
It was broadcast live by the four major American television networks and all of the cable networks in the aftermath of the September 11 attacks on the World Trade Center and the Pentagon in 2001. Done in the style of a telethon, it featured a number of national and international entertainers performing to raise money for the victims and their families, particularly the New York City firefighters and New York City police officers. It aired September 21, 2001, uninterrupted and commercial-free, for which it won a Peabody Award. It was released on December 4, 2001, on compact disc and DVD.
On a dark stage illuminated by hundreds of candles, twenty-one artists performed songs of mourning and hope, while various actors and other celebrities delivered short spoken messages. The musical performances took place at three studios in Los Angeles (CBS Television City), New York, and London, while the celebrity messages took place in Los Angeles. Some of the musicians, including Neil Young and Eddie Vedder, were heard working the phone banks taking pledges. Over $200 million was raised and given to the United Way's September 11 Telethon Fund.
In 2004, Rolling Stone magazine selected this concert, along with the Concert for New York City, as one of the 50 moments that changed rock and roll. The show was also simulcast in Canada.
Performers
Bruce Springsteen: "My City of Ruins", a song he had performed at only a few New Jersey shows. Written before the September 11 attacks, it is actually about his home town Asbury Park, New Jersey; with a few phrases slightly modified, and introduced as "a prayer for our fallen brothers and sisters." It appeared on his The Rising album the following year.
Stevie Wonder with Take 6: "Love's in Need of Love Today", from his 1976 album Songs in the Key of Life.
U2 with Dave Stewart, Natalie Imbruglia and Morleigh Steinberg: "Peace on Earth" (intro)/"Walk On", both from their 2000 album All That You Can't Leave Behind. This performance was beamed via satellite from London.
Faith Hill: "There Will Come a Day", from her 1999 album Breathe. For this performance, Hill was joined by a gospel choir and special guest Paul Shaffer on keyboards.
Tom Petty and the Heartbreakers: "I Won't Back Down", from Petty's 1989 solo album Full Moon Fever.
Enrique Iglesias: "Hero", which had just been released as his new single.
Neil Young: John Lennon's "Imagine", which Young never recorded previously.
Alicia Keys: Donny Hathaway's "Someday We'll All Be Free", which Keys never recorded previously.
Goo Goo Dolls' John Rzeznik and Limp Bizkit's Fred Durst and Wes Borland: Pink Floyd's "Wish You Were Here", with some new lyrics written for the occasion. Ne |
https://en.wikipedia.org/wiki/Labour%20Students | Labour Students is a student organisation within the Labour Party of the United Kingdom. It is a network of affiliated college and university clubs, known as Labour Clubs, who campaign in their campuses and communities for Labour's values of equality and social justice.
Labour Students’ main activities include providing political education and training to its members, sending activists to by-elections and marginal constituencies across the country and organising politically within the National Union of Students and Student Unions.
Labour Students was disaffiliated from the Labour Party by the Party's National Executive Committee in September 2019, with the intent of replacing it with a new student organisation. Although campaigning activity continued to be organised under the Labour Students branding during the 2019 general election, the organisation subsequently ceased to exist.
A new, refounded Labour Students was passed at the 2021 Labour Party Conference. National Committee elections were held in August 2022 and Ben McGowan was elected as chair of the organisation on 2 September 2022.
History
The Labour Party's first organisation for students was the National Association of Labour Student Organisations (NALSO), which was founded in 1946 but had its recognition by the party withdrawn in 1967 after it was taken over by supporters of the Trotskyist Socialist Labour League. While the Scottish organisation continued, the Labour Party was left without a national student body.
In 1970, some Labour supporters created Students for a Labour Victory, a group intended to coordinate campaigning in the general election that year. That group then became the National Organisation of Labour Students (NOLS), which held its founding conference in 1971. Despite changing its name in the early 1990s, the current body, Labour Students, is still sometimes referred to by the acronym NOLS.
In its early years, NOLS was divided between two factions — members of the entryist Militant group and a mainstream left group, associated with the Tribune group of Labour MPs, which formed in January 1974 called Clause Four, after the central political statement of the Labour Party constitution. Militant controlled NOLS from January 1974 to December 1975. Members of NOLS in the 1970s included future parliamentarians Charles Clarke, Bill Speirs, Peter Mandelson, Sally Morgan, Mike Gapes, Mike Jackson, Nigel Stanley, Margaret Curran and Johann Lamont.
During Tony Blair's premiership, Labour Students opposed the Government's planned introduction of university "top-up" fees. Labour Students were broadly supportive of Gordon Brown's government.
In 2016, the national conference adopted a one-member-one-vote (OMOV) system for internal elections, through an amendment of its constitution. However many member clubs perceived this as being implemented incompletely and slowly, with accusations of vote-rigging in 2019. In the early 2019 Labour Students leadership election there were |
https://en.wikipedia.org/wiki/American%20Public%20Television | American Public Television (APT) is an American nonprofit organization and syndicator of programming for public television stations in the United States. It distributes public television programs nationwide for PBS member stations and independent educational stations, as well as the Create and World television networks.
History
Eastern Educational Network
APT began in 1961 when it was incorporated as the Eastern Educational Network (EEN). At first, EEN was a regional cooperative that began to exchange programs between a few of its member stations. EEN was one of the first distributors of shows such as The French Chef (with Julia Child) in 1963, Mister Rogers' Neighborhood, and Washington Week in Review on a national basis.
Another first from EEN was the distribution of Newsfront, America's first live and non-commercial daily news program, starting in 1970. EEN introduced Wall Street Week in November 1970 before PBS began distributing it nationwide in January 1972. EEN also began importing UK's BBC and Canadian CBC productions to America in 1974, with Monty Python's Flying Circus as one of them. In 1978, the EEN started the Free Library.
In 1980, Eastern Educational Network started the Syndication Service and was renamed Interregional Program Service (IPS). IPS started the Premium Service in 1989. The first program out of this arm was the series U.S. Chronicle, a collaboration of public television stations in cooperation with The Maryland Center for Public Broadcasting, hosted by Jim Lehrer. The company gained national attention when EEN's IPS subsidiary begin distributing The Nightly Business Report when it went nationwide in 1981. The organization became American Program Service (APS) in 1992.
American Public Television
American Program Service was renamed American Public Television (APT) on January 1, 2000. Also, with many fax requests from international outlets, an international division called APT Worldwide was started.
With the digital roll-out, APT became the distributor of a couple of multicast networks. In January 2006, APT started distributing Create. They later began distributing World on July 1, 2009.
Programming services
APT Exchange (originally the Free Library) was a service in which the company acts a clearing house for pre-funded programs that are offered free of charge to stations started in 1978. Rick Steves' Europe (starting in 2000), Nightly Business Report, and America's Test Kitchen are offered through this service.
APT Worldwide is the corporation's international sales division even representing some A&E and Discovery programs. Amongst its network clients are Discovery, National Geographic, Japan's NHK, UK's ITV and Italy's RAI-SAT
Premium Service provides programming for stations via outsourcing or acquisition prime time pledge drive programs particularly performance or self-help shows, which would either trigger a pledge call or a DVD purchased for the viewer's use or as a gift. One of its earliest successful show |
https://en.wikipedia.org/wiki/3AK | 3AK is the call sign of SEN 1116, and the earlier on-air name of a former Melbourne talk-back radio and music station, which, in 2003, leased its licence to sports network SEN 1116. A number of unusual events and precedents throughout the station's history make its story of unusual interest. These events include (but are not limited to):
In lieu of a "C" class licence, the granting of a "B" class licence in 1931, but with limiting conditions including: a position on the dial that could not be picked up by most contemporary radio sets; only allowed to broadcast when other Melbourne commercial stations were off the air, that is, most of the time only at night; limited power.
The founder of the station was George F. Palmer, the father of Clive Palmer.
The sharing of its wavelength with 2BS Bathurst, a station that was comparatively close geographically, thus causing interference problems.
From 1954, permitted to broadcast during daylight hours, but only when its signal was perceived not to interfere with that of 2BS.
Purchased in 1961 by Australian Consolidated Press and thus became sister station of GTV-9. Most high-profile GTV personalities also broadcast on 3AK.
When some FM licences were auctioned off to existing AM stations in 1989, 3AK became one of the two successful Melbourne bidders, but the station did not take up the offer because of ownership changes.
In 1990, purchased by Peter Corso. 3AK thus became an Italian language station for some years.
In late 2003 the 3AK license was leased to Sports Entertainment Network and from January 2004 it became a 24-hour sports station, using the on-air name SEN whilst having to retain 3AK as its official callsign.
History
Early years
3AK commenced broadcasting on 29 November 1931, the fourth commercial radio station in Melbourne after 3UZ, 3DB and 3KZ.
The station's call-sign came from the name of its operating company, the Akron Broadcasting Co. Pty Ltd (a subsidiary of the Akron Tyre Co, a company that was wound up in 2016). The owner of the Akron Tyre Co and of 3AK was George F. Palmer, the father of Clive Palmer.
At the time of its formation there were three types of broadcasters in Australia, A Class stations (most of which later evolved into the Australian Broadcasting Corporation); B Class stations, which are now known as commercial stations; amateurs. There were also government plans for a set of C class stations which were intended to be used by businesses to exclusively advertise their products. However it was decided not to proceed with this type of license before 3AK was actually granted its licence. Akron and the Postmaster-General's Department had originally discussed the issuance of such a license, but in lieu, a B Class licence with a number of restrictions, was issued to Akron.
From the outset, 3AK was only permitted to broadcast for limited hours when other Melbourne stations were off the air. 3AK originally broadcast from 11.30 pm to 2.00 am daily; 5.00 to 7.00 a |
https://en.wikipedia.org/wiki/BBC%20Local%20Radio | BBC Local Radio (also referred to as Local BBC Radio) is the BBC's local and regional radio division for England and the Channel Islands, consisting of forty stations.
As of March 2023, the network broadcasts to a combined audience of 5.2 million, with a listening share of 4.6%, according to RAJAR.
History
The popularity of pirate radio was to challenge a change within the at the time very "stiff" and blinkered management at the BBC. The most prominent concession by the BBC was the creation of BBC Radio 1 to satisfy the ever-demanding new youth culture with their thirst for new, popular music. The other, however, was that these pirate radio stations were, in some cases, local. As a result, BBC Local Radio began as an experiment.
Initially, stations had to be co-funded by the BBC and local authorities, which only some Labour-controlled areas proved willing to do. Radio Leicester was the first to launch on 8 November 1967, followed by Leeds, Stoke, Durham, Sheffield, Merseyside, Brighton, and Nottingham. By the early 1970s, the local authority funding requirement was dropped, and stations spread across the country; many city-based stations later expand their remit to cover an entire county.
There were eight stations in the initial "experiment", which lasted for two years. When this ended, it was deemed so successful that all of the stations, except BBC Radio Durham, remained on air. In addition to this, more followed in 1970 and 1971; BBC Radio Birmingham, Bristol, Blackburn, Derby, Humberside, London, Manchester, Medway, Newcastle (replacing Radio Durham), Oxford, Solent, and Teesside.
Despite the success of this, the original stations were seen as flawed, as they originally only broadcast on the FM waveband, and not on the more widely available AM waveband. This was eventually rectified a few years after the creation of these new channels.
From 1973, Independent Local Radio (ILR) launched nationally; with nineteen stations, and more to follow in subsequent years. As a result, many of the BBC Local Radio stations found themselves in direct competition with commercial competitors, who utilised many of the popular DJs from the pirate radio stations, and who gained in most cases, large audiences. Despite this, BBC Local Radio continued to flourish, with the current network in place by the early 1990s. The network has remained in its current state since.
Current operation
The radio stations are operated from locations around the country that usually share with the BBC regional TV news services, and their news gathering bureaux. The stations are operated by the region in which the station is based and are the responsibility of the BBC English Regions department, a division of BBC News.
The remit for each Local Radio station is the same: to offer a primarily speech-based service; comprising news and information complemented by music. The target audience of BBC Local Radio are listeners aged over fifty, who are not served as well as other age gr |
https://en.wikipedia.org/wiki/Program%20slicing | In computer programming, program slicing is the computation of the set of program statements, the program slice, that may affect the values at some point of interest, referred to as a slicing criterion. Program slicing can be used in debugging to locate source of errors more easily. Other applications of slicing include software maintenance, optimization, program analysis, and information flow control.
Slicing techniques have been seeing a rapid development since the original definition by Mark Weiser. At first, slicing was only static, i.e., applied on the source code with no other information than the source code. Bogdan Korel and Janusz Laski introduced dynamic slicing, which works on a specific execution of the program (for a given execution trace). Other forms of slicing exist, for instance path slicing.
Static slicing
Based on the original definition of Weiser, informally, a static program slice S consists of all statements in program P that may affect the value of variable v in a statement x. The slice is defined for a slicing criterion C=(x,v) where x is a statement in program P and v is variable in x. A static slice includes all the statements that can affect the value of variable v at statement x for any possible input. Static slices are computed by backtracking dependencies between statements. More specifically, to compute the static slice for (x,v), we first find all statements that can directly affect the value of v before statement x is encountered. Recursively, for each statement y which can affect the value of v in statement x, we compute the slices for all variables z in y that affect the value of v. The union of all those slices is the static slice for (x,v).
Example
For example, consider the C program below. Let's compute the slice for ( write(sum), sum ). The value of sum is directly affected by the statements "sum = sum + i + w" if N>1 and "int sum = 0" if N <= 1. So, slice( write(sum), sum) is the union of three slices and the "int sum = 0" statement which has no dependencies:
slice( sum = sum + i + w, sum),
slice( sum = sum + i + w, i),
slice( sum = sum + i + w, w), and
{ int sum=0 }.
It is fairly easy to see that slice( sum = sum + i + w, sum) consists of "sum = sum + i + w" and "int sum = 0" because those are the only two prior statements that can affect the value of sum at "sum = sum + i + w". Similarly, slice( sum = sum + i + w, i) only contains "for(i = 1; i < N; ++i) {" and slice( sum = sum + i + w, w) only contains the statement "int w = 7".
When we union all of those statements, we do not have executable code, so to make the slice an executable slice we merely add the end brace for the for loop and the declaration of i. The resulting static executable slice is shown below the original code below.
int i;
int sum = 0;
int product = 1;
int w = 7;
for(i = 1; i < N; ++i) {
sum = sum + i + w;
product = product * i;
}
write(sum);
write(product);
The static executable slice for criteria (w |
https://en.wikipedia.org/wiki/Localhost | In computer networking, localhost is a hostname that refers to the current computer used to access it. The name localhost is reserved for loopback purposes.
It is used to access the network services that are running on the host via the loopback network interface. Using the loopback interface bypasses any local network interface hardware.
Loopback
The local loopback mechanism may be used to run a network service on a host without requiring a physical network interface, or without making the service accessible from the networks the computer may be connected to. For example, a locally installed website may be accessed from a Web browser by the URL http://localhost to display its home page.
IPv4 network standards reserve the entire address block (more than 16 million addresses) for loopback purposes. That means any packet sent to any of those addresses is looped back. The address is the standard address for IPv4 loopback traffic; the rest are not supported by all operating systems. However, they can be used to set up multiple server applications on the host, all listening on the same port number. In the IPv6 addressing architecture there is only a single address assigned for loopback: . The standard precludes the assignment of that address to any physical interface, as well as its use as the source or destination address in any packet sent to remote hosts.
Name resolution
The name localhost normally resolves to the IPv4 loopback address , and to the IPv6 loopback address .
This resolution is normally configured by the following lines in the operating system's hosts file:
127.0.0.1 localhost
::1 localhost
The name may also be resolved by Domain Name System (DNS) servers, but there are special considerations governing the use of this name:
An IPv4 or IPv6 address query for the name localhost must always resolve to the respective loopback address.
Applications may resolve the name to a loopback address themselves, or pass it to the local name resolver mechanisms.
When a name resolver receives an address (A or AAAA) query for localhost, it should return the appropriate loopback addresses, and negative responses for any other requested record types. Queries for localhost should not be sent to caching name servers.
To avoid burdening the Domain Name System root servers with traffic, caching name servers should never request name server records for localhost, or forward resolution to authoritative name servers.
When authoritative name servers receive queries for 'localhost' in spite of the provisions mentioned above, they should resolve them appropriately.
In addition to the mapping of localhost to the loopback addresses ( and ), localhost may also be mapped to other IPv4 (loopback) addresses and it is also possible to assign other, or additional, names to any loopback address. The mapping of localhost to addresses other than the designated loopback address range in the hosts file or in DNS is not guaranteed to have the desired ef |
https://en.wikipedia.org/wiki/AIG%20%28disambiguation%29 | AIG is American International Group, a major American insurance corporation.
AIG or AiG may also refer to:
And-inverter graph, a concept in computer theory
Answers in Genesis, a young-earth creationist organization in the U.S.
Arta Industrial Group in Iran
Aigburth railway station (National Rail code) in Liverpool, England
A.I.G. or Allah Is God, a pop duo
Asian Indoor Games
See also
AIG American General, a subsidiary of AIG
Age (disambiguation) |
https://en.wikipedia.org/wiki/International%20Genealogical%20Index | The International Genealogical Index (IGI) is a database of genealogical records, compiled from several sources, and maintained by the Church of Jesus Christ of Latter-day Saints. Originally created in 1969, the index was intended to help track the performance of temple ordinances for the deceased.
The IGI contains free genealogical information, submitted from various sources including names and data for vicarious ordinances by Latter-day Saints (LDS) researchers, records obtained from contributors who are not members of the church, and data extracted from microfilmed birth or marriage records. The index contains millions of records of individuals who lived between 1500 and 1900, primarily in the United States, Canada, Latin America, and Europe. Ongoing efforts are made to compile genealogical data from other regions and peoples.
The IGI contains many duplicate names, accumulated over time from many sources, and no real effort is made to validate the information. Many IGI records contain information on the submitter and date of submission (but only with the submitter's consent). The IGI is available at FamilySearch, the LDS genealogy website.
In 1995, after a major controversy, a deal was struck between the Jewish and LDS communities to "Remove from the International Genealogical Index in the future the names of all deceased Jews who are so identified if they are known to be improperly included counter to Church policy."
In 2008 The Vatican issued a statement directing its dioceses to block access to parish records from Mormons performing genealogical research.
See also
Family History Library
Genealogy and baptism
References
External links
Search the IGI
International Genealogical Index at FamilySearch Wiki
"What is the IGI?" by Helen Schatvet Ullmann
International Genealogical Index Coverage at FamilySearch Wiki
1969 works
Genealogy publications
Scientific databases
Genealogy and the Church of Jesus Christ of Latter-day Saints
Properties of the Church of Jesus Christ of Latter-day Saints |
https://en.wikipedia.org/wiki/BBC%20G%C3%A0idhlig | BBC Gàidhlig is the department of BBC Scotland that produces Scottish Gaelic-language (Gàidhlig) programming. This includes TV programmes for BBC Alba, the BBC Radio nan Gàidheal radio station and the BBC Alba website. Its managing editor is Marion MacKinnon.
Television
The department is responsible for Gaelic programming for television from the BBC.
BBC Gàidhlig produces a number of programmes for the Gaelic-language television channel, BBC Alba, which is a joint venture between the BBC and MG Alba.
Some of BBC Gàidhlig's more notable programming includes the international issues magazine (Europe), children's programme (What Now?) and comedy sketch show (Back on the Ran Dan). Dè a-nis? won the department an award at the Celtic Media Festival in 2009.
BBC Gaidhlig also produces programming to cover the Royal National Mòd. For instance, during the National Mòd in Caithness in 2010, BBC Gaidhlig produced daily programmes to cover the event, which were aired and repeated on BBC Alba, as well as being repeated on BBC Two Scotland.
Radio
BBC Gàidhlig is also responsible for the national Scottish Gaelic radio station BBC Radio nan Gàidheal. The station broadcasts across Scotland on FM, DAB digital radio, digital television and online. When it's not broadcasting Gaelic programming, it simulcasts BBC Radio Scotland.
Online
In July 2008, the BBC Alba website launched an extended news service to tie in with the launch of the digital television channel. Programmes from BBC Alba and Radio nan Gaidheal are also available online on BBC iPlayer.
See also
Gaelic broadcasting in Scotland
List of Celtic-language media
References
External links
Television in Scotland
Scottish Gaelic mass media
BBC Scotland |
https://en.wikipedia.org/wiki/GraphicConverter | GraphicConverter is computer software that displays and edits raster graphics files. It also converts files between different formats. For example, one can convert a GIF file to a JPEG file.
The program has a long history of supporting the Apple Macintosh platform, and at times it has been bundled with new Mac purchases.
, GraphicConverter can import about 200 file types and export 80. Images can also be retouched, edited, and transformed using tools, effects and filters. The software supports most Adobe Photoshop plug-ins, including TWAIN. The application features a batch processor, slideshow mode, image preview browser, and access to metadata comments (such as XMP, Exif, and IPTC).
GraphicConverter is available in more than a dozen languages including:
Brazilian Portuguese;
Chinese (simplified);
Chinese (traditional);
English;
French;
German;
Czech; and
Spanish.
Old versions that run on classic Mac OS are available for download and include a license key. These versions are no longer supported, however.
The currently supported version runs on macOS, is available as shareware, and is maintained by LemkeSoft, a software company based in Germany.
See also
Comparison of raster graphics editors
References
External links
Lemke Software
Lemke Software
List of supported file formats
Classic Mac OS software
MacOS graphics software
Proprietary raster graphics editors
MacOS-only proprietary software |
https://en.wikipedia.org/wiki/Gateway%2C%20Inc. | Gateway, Inc., previously Gateway 2000, Inc., was an American computer company originally based in Iowa and South Dakota. Founded by Ted Waitt and Mike Hammond in 1985, the company developed, manufactured, supported, and marketed a wide range of personal computers, computer monitors, servers, and computer accessories. At its peak in the year 2000, the company employed nearly 25,000 worldwide. Following a seven-year-long slump, punctuated by the acquisition of rival computer manufacturer eMachines in 2004 and massive consolidation of the company's various divisions in an attempt to curb losses and regain market share, Gateway was acquired by Taiwanese hardware and electronics corporation Acer, in October 2007 for US$710 million.
History
1985–1990: Foundation
Gateway was founded as the TIPC Network by Ted Waitt and Mike Hammond in September 1985. Ted Waitt was the company's principal founder; he was later joined by his older brother Norman Waitt, Jr. Before founding the company, Ted Waitt lived on his family's cattle farmhouse in Sioux City, Iowa. He had dropped out of two different colleges to work on the farm before landing a job at a computer store in Des Moines, Iowa. After nine months of experience gained on the job, Ted had the idea to start his own computer reselling company that would allow him to sell to niche customers who needed systems in between the lower- and upper-ends of the personal computer market, whose systems were either too limited in terms of speed and memory or too expensive with seldom-used higher-end features. Ted also found that educated salespeople could successfully sell computers to customers completely over the telephone, impressing on him the idea that he could eliminate overhead by having a robust remote salesforce and impressive catalog.
Strapped for cash, however, Ted Waitt took out a $10,000 loan from his grandmother Mildred Smith and occupied the empty upper floor of his father's dilapidated cattle brokerage. He was joined by Mike Hammond, Ted's coworker who trained the latter to become a computer salesman at their previous job. The duo's first products were software and peripherals for Texas Instruments' TI-99/4A home computer, advertised in various computer magazines. The TI-99/4A had been discontinued in the previous year and was largely considered obsolete by 1985. TIPC Network charged their first customers with a membership fee of US$20, in order to flush the company with more start-up capital.
Owing to their products' very low costs, TIPC earned up to $100,000 in sales within the first four months, beating out many of their competitors in the TI-99/4A aftermarket segment. In early 1986, Ted's brother Norman Waitt was hired as TIPC's financial advisor in exchange for owning half of the company. That year, the company began selling their own hand-assembled computers locally on an experimental basis. By the end of 1986, TIPC changed their name to Gateway 2000, Inc., and earned $1 million in revenues—the |
https://en.wikipedia.org/wiki/SkiFree | SkiFree is a single-player skiing computer game created by Chris Pirih and released with Microsoft Entertainment Pack 3 for Windows 3.0 in October 1991. The player controls a skier on a mountain slope, avoiding obstacles while racing against time or performing stunts for points, depending on the game mode.
SkiFree was well-received upon release, with critics focusing on its simplicity and graphics. The game was ported to Macintosh and, years later, to Game Boy Color and iOS. Pirih also released a free, updated 32-bit Windows version after rediscovering his original source code. SkiFree remains popular among the gaming community and is often remembered for its Abominable Snowman, which pursues the player after they finish a full run.
In 2020, Microsoft released Surf, a game included with Microsoft Edge heavily inspired by SkiFree. A winter skin where the player skis instead of surfs and must run from the SkiFree Abominable Snowman was added to the game in 2021.
Gameplay
SkiFree is a casual single-player sports simulator wherein the player uses the keyboard or the mouse to control a skier across a white background representing snow on a mountainside. The object of the game is to ski down an endless slope and avoid the obstacles (trees, stumps, dogs, etc.). The player can also opt to partake in three modes: slalom, freestyle, and tree slalom. In slalom, players must properly ski around flags in an attempt to complete the run with the shortest time possible. Tree slalom adds obstacles to the slalom run. In freestyle, players ski downhill and jump off ramps while racking up points by performing tricks. Deductions are imposed for colliding into obstacles or failing to land properly after a stunt. When the player passes the 2,000-meter mark, the Abominable Snowman appears and starts to chase the player, eating them when it catches them.
History
While SkiFree creator Chris Pirih was a student at the University of Puget Sound, he wrote a text-based game called Ski in Fortran for the VAX/VMS operating system, inspired by Activision's Atari 2600 game Skiing. Later, as a programmer for Microsoft he was writing programming utilities used in the development of software such as Microsoft Word and Microsoft Excel. He had been focused on developing for the OS/2 operating system, but in 1991 decided to learn to write for the newly released Windows 3.0, and so created a new version of his skiing game in the programming language C, replacing the text-based environment with graphics. He called the game WinSki, and added exploitable, fanciful elements to demonstrate the new operating system's functionality, such as staining the snow yellow after crashing into numerous dogs and certain tree stumps transforming into mushrooms when skied on backwards.
Although he developed it on his home computer for his own education and entertainment, WinSki attracted the attention of a program manager for the Microsoft Entertainment Pack (MEP) when he noticed Pirih playing it |
https://en.wikipedia.org/wiki/Asbi%27a | Asbi’a () is a Libyan town located about 45 km south of Tripoli
Libya articles missing geocoordinate data
Tripoli, Libya
Baladiyat of Libya |
https://en.wikipedia.org/wiki/Position-independent%20code | In computing, position-independent code (PIC) or position-independent executable (PIE) is a body of machine code that, being placed somewhere in the primary memory, executes properly regardless of its absolute address. PIC is commonly used for shared libraries, so that the same library code can be loaded at a location in each program's address space where it does not overlap with other memory in use by, for example, other shared libraries. PIC was also used on older computer systems that lacked an MMU, so that the operating system could keep applications away from each other even within the single address space of an MMU-less system.
Position-independent code can be executed at any memory address without modification. This differs from absolute code, which must be loaded at a specific location to function correctly, and load-time locatable (LTL) code, in which a linker or program loader modifies a program before execution, so it can be run only from a particular memory location. Generating position-independent code is often the default behavior for compilers, but they may place restrictions on the use of some language features, such as disallowing use of absolute addresses (position-independent code has to use relative addressing). Instructions that refer directly to specific memory addresses sometimes execute faster, and replacing them with equivalent relative-addressing instructions may result in slightly slower execution, although modern processors make the difference practically negligible.
History
In early computers such as the IBM 701 (29 April 1952) or the UNIVAC I (31 March 1951) code was not position-independent: each program was built to load into and run from a particular address. Those early computers did not have an operating system and were not multitasking-capable. Programs were loaded into main storage (or even stored on magnetic drum for execution directly from there) and run one at a time. In such an operational context, position-independent code was not necessary.
The IBM System/360 (7 April 1964) was designed with truncated addressing similar to that of the UNIVAC III, with code position independence in mind. In truncated addressing, memory addresses are calculated from a base register and an offset. At the beginning of a program, the programmer must establish addressability by loading a base register; normally, the programmer also informs the assembler with a USING pseudo-op. The programmer can load the base register from a register known to contain the entry point address, typically R15, or can use the BALR (Branch And Link, Register form) instruction (with a R2 Value of 0) to store the next sequential instruction's address into the base register, which was then coded explicitly or implicitly in each instruction that referred to a storage location within the program. Multiple base registers could be used, for code or for data. Such instructions require less memory because they do not have to hold a full 24, 31, 32, or 6 |
https://en.wikipedia.org/wiki/TF1 | TF1 (; standing for Télévision Française 1) is a French commercial television network owned by TF1 Group, controlled by the Bouygues conglomerate. TF1's average market share of 24% makes it the most popular domestic network.
TF1 is part of the TF1 Group of mass media companies, which also includes the news channel LCI. It previously owned the satellite TV provider TPS, which was sold to Canal+ Group.
The network is a supporter of the Hybrid Broadcast Broadband TV (HBBTV) initiative promoting and establishing an open European standard for hybrid set-top boxes for the reception of terrestrial TV and broadband multimedia applications with a single user interface.
History
It was the only television channel in France for 28 years, and has changed its name numerous times since the creation of Radio-PTT Vision on 26 April 1935, making it among the oldest television stations in the world, and one of the very few prewar television stations to remain in existence to the present day. It became Radiodiffusion nationale Télévision (RN Télévision) in 1937, Fernsehsender Paris (Paris Television) during German occupation in 1943, RDF Télévision française in 1944, RTF Télévision in 1949, la Première chaîne de la RTF in 1963 following the creation of the second channel, la Première chaîne de l'ORTF in 1964 and finally, Télévision Française 1 (TF1) in 1975.
Radio-PTT Vision (1935–1937)
The first public demonstration of a 30-line mechanical television took place on April 14, 1931. The image rendering was an improvement upon Baird's thanks to the development of the "moving light point" system and the use of a camera with Weiller mirror drums by the engineer René Barthélemy, head of the radio laboratory of the Compagnie desmètres (CdC) of Montrouge. In charge of French broadcasting, the PTT administration carried out some rudimentary television experiments from December 1931 by broadcasting experimental 30 to 45 minute broadcasts at variable times from Monday to Saturday with Baird equipment from the medium wave transmitter of Radio PTT. The Barthélemy system was officially adopted in preference to that of Baird, due to the greater stability of the images, for the continuation of experimental transmissions in 1932.
The Minister of the PTT, Henri Queuille, then authorised the CdC to continue its experiments using the PTT superior school transmitter located at 103 rue de Grenelle in the 15th arrondissement of Paris and assigned the company a rudimentary studio at number 93 of the same street. Barthélemy continued his experiments there with a new disc camera from Nipkow which offered much better shooting possibilities than with the previous system. The programs were broadcast in 30 lines on Tuesday and Friday at 5:00 pm by two transmitters, the images by the medium wave transmitter of the higher school of the PTT on the wavelength of 431 meters and the sound by the transmitter of the CdC in Montrouge connected to the studio by a telephone line. These experimental |
https://en.wikipedia.org/wiki/Twixt | 'Twixt, a contraction of betwixt, an archaic term for between, could refer to:
TwixT, a 1960s board game
Twixt animation system, a 1984 3D computer animation system
Twixt (film), a 2011 horror thriller film
Twixt Love and Fire, a 1914 short comedy film featuring Fatty Arbuckle
Twixt Stakes, an American thoroughbred horse race
"'Twixt Twelve and Twenty", a song by Pat Boone, 1959
Twixt Twelve and Twenty (book), a book by Pat Boone which offered advice to teenagers
Other uses
There's many a slip 'twixt the cup and the lip, a proverb
See also
Twixteen
Twixter
Twixters (TV series) |
https://en.wikipedia.org/wiki/BBC%20Asian%20Network | BBC Asian Network is a British Asian radio station owned and operated by the BBC. The station's target audience is people "with an interest in British Asian lifestyles", especially British Asians between the ages of 18 and 34. The station has production centres at Broadcasting House in London and The Mailbox in Birmingham.
The station broadcasts mainly in English, but has retained Sunday evening shows in South Asian languages. The Asian Network covers only the Indian subcontinent, with the rest of the continent – such as Japan and China – not covered by the station.
The station's output consists largely of music and talk programmes. On Fridays at 3:00 pm, the station broadcasts The Official Asian Music Chart, compiled by the Official Charts Company and based on sales and streams across a seven-day period.
According to RAJAR, the station broadcasts to a weekly audience of 462,000 with a listening share of 0.3% as of September 2023.
History
Origins as a regional programme / station
By 1949, the BBC had introduced their first weekly Bengali language programme, Anjuman, through the efforts of Nazir Ahmed and Nurul Momen. Momen also conducted a children's programme titled Kakoli. The BBC was later joined by more Bengalis such as Fateh Lohani and Fazle Lohani. BBC television had also broadcast an Asian news programme, Nai Zindagi Naya Jeevan, since 1968 from its studios in Birmingham; this series followed a traditional news and current affairs format.
In 1976, BBC Radio Leicester, responding to the growth of the size of the South Asian population and rising racial tension in Leicester, introduced a daily community show called Six Fifteen, aimed primarily at that community in the city. By 1977, CRE research showed that the programme regularly reached 67% of the South Asian community in Leicester. BBC Radio Leicester dominated the provision of Asian programming on BBC local radio and by 1990 was producing one third of the output. In 1989, BBC WM, the BBC radio station for the Midlands, followed Radio Leicester's lead and introduced a similar daily show as part of a new Midlands Asian Network.
On 30 October 1989, The Asian Network was launched on the medium wave transmitters of BBC WM and BBC Radio Leicester, with a combined output of 57 hours per week. This was extended to 86 hours a week in 1995 and on 4 November 1996 the station became a full-time service, on air for eighteen hours a day in Leicester and Birmingham, and was relaunched as the BBC Asian Network with programming also broadcast on the MW transmitters of stations with large Asian communities (with the exception of BBC GLR which was an FM-only station).
Station goes national
In November 1999, as part of the addition of a suite of BBC and commercial radio services to the Sky Digital satellite television platform, BBC Asian Network was made available to Sky viewers alongside BBC Radio 1, BBC Radio 2, BBC Radio 3, BBC Radio 4, BBC Radio 5 Live, BBC World Service, BBC Radio Scotland, BB |
https://en.wikipedia.org/wiki/Absolute%20Radio | Absolute Radio is a British independent national radio station owned and operated by Bauer as part of the Absolute Radio Network. It broadcasts nationally across the UK via digital audio broadcasting and was on 1215 kHz MW until the closure of medium wave transmissions on 20 January 2023.
The station focuses on rock and indie music such as Red Hot Chili Peppers, Muse, U2, Oasis, Arctic Monkeys and the White Stripes.
History
1993–1997: Virgin Radio launch and early years
The Broadcasting Act 1990 allowed for the launch of independent national radio (INR) stations in the United Kingdom. The Radio Authority was mandated to award three INR licences, one of which (INR1) had to be for a "non-pop" station (which was awarded to Classic FM), and one of which had to be for a predominantly speech-based service (this would be advertised later as INR3 and would be awarded to Talk Radio). The remaining licence was to be open to "all-comers". The licences were to be awarded to the highest cash bidder, providing that the applicant met criteria set down in the Broadcasting Act.
The second national licence, INR2, would take over the 1197 kHz and 1215 kHz frequencies, which were to be relinquished by BBC Radio 3. The licence was advertised in October 1991 and five organisations bid: the Independent National Broadcasting Company of Sheffield, which bid £4,010,000 per year; a TV-am/Virgin consortium (£1,883,000); Chiltern Radio's 20/20 Radio (£1,311,000); Radio Clyde's Score Radio (£701,000); and a consortium of CLT, Harvey Goldsmith and RTÉ (£211,000). The TV-am/Virgin consortium was awarded the licence in April 1992, after the Radio Authority said that it was not satisfied that Independent National Broadcasting would be able to sustain the service. Later that year, TV-am lost its ITV franchise and its stake in the radio station was sold in March 1993 to Apax Partners, JP Morgan Investment Corporation and Sir David Frost.
The station launched as Virgin 1215 at 12:15 pm on 30 April 1993. The original line-up of DJs included Richard Skinner, Russ Williams, Jono Coleman, Mitch Johnson, Graham Dene, Nick Abbot, Wendy Lloyd, Tommy Vance, Emperor Rosko and Dave Fanning. Chris Evans was also hired to present a Saturday morning show, following his success at BBC GLR in the weekend mid-morning slot. The show, The Big Red Mug Show, was sponsored by Nescafé. The first song played was INXS' cover version of the Steppenwolf song "Born to be Wild". Richard Branson was the first voice to be heard, live from the Virgin Megastore in Manchester, with Richard Skinner the first voice back in the London studios. Skinner was also programme director, a role he shared with John Revell. John Pearson was launch sales director, a role he had previously held at LBC. Andy Mollett was launch finance director. David Campbell, previously managing director of one of Virgin's post-production television companies, was the chief executive at launch.
From before its launch on AM, Virgin Radio w |
https://en.wikipedia.org/wiki/Ferranti%20Mark%201 | The Ferranti Mark 1, also known as the Manchester Electronic Computer in its sales literature, and thus sometimes called the Manchester Ferranti, was produced by British electrical engineering firm Ferranti Ltd. It was the world's first commercially available electronic general-purpose stored program digital computer.
Although preceded as a commercial digital computer by the BINAC and the Z4, the Z4 was electromechanical and lacked software programmability, while BINAC never operated successfully after delivery
The Ferranti Mark 1 was "the tidied up and commercialised version of the Manchester Mark I". The first machine was delivered to the Victoria University of Manchester in February 1951 (publicly demonstrated in July) ahead of the UNIVAC I which was delivered to the United States Census Bureau in late December 1952, having been sold on 31 March 1951.
History and specifications
Based on the Manchester Mark 1, which was designed at the University of Manchester by Freddie Williams and Tom Kilburn, the machine was built by Ferranti of the United Kingdom. The main improvements over it were in the size of the primary and secondary storage, a faster multiplier, and additional instructions.
The Mark 1 used a 20-bit word stored as a single line of dots of electric charges settled on the surface of a Williams tube display, each cathodic tube storing 64 lines of dots. Instructions were stored in a single word, while numbers were stored in two words. The main memory consisted of eight tubes, each storing one such page of 64 words. Other tubes stored the single 80-bit accumulator (A), the 40-bit "multiplicand/quotient register" (MQ) and eight "B-lines", or index registers, which was one of the unique features of the Mark 1 design. The accumulator could also be addressed as two 40-bit words. An extra 20-bit word per tube stored an offset value into the secondary storage. Secondary storage was provided in the form of a 512-page magnetic drum, storing two pages per track, with about 30 milliseconds revolution time. The drum provided eight times the storage of the original designed at Manchester.
The instructions, like the Manchester machine, used a single address format in which operands were modified and left in the accumulator. There were about fifty instructions in total. The basic cycle time was 1.2 milliseconds, and a multiplication could be completed in the new parallel unit in about 2.16 milliseconds (about 5 times faster than the original). The multiplier used almost a quarter of the machine's 4,050 vacuum tubes. Several instructions were included to copy a word of memory from one of the Williams tubes to a paper tape machine, or read them back in. Several new instructions were added to the original Manchester design, including a random number instruction and several new instructions using the B-lines.
The original Mark 1 had to be programmed by entering alphanumeric characters representing a five-bit value that could be represented on the pa |
https://en.wikipedia.org/wiki/The%20Source%20%28online%20service%29 | The Source (Source Telecomputing Corporation) was an early online service, one of the first such services to be oriented toward and available to the general public. The Source described itself as follows:
The Source was in operation from 1978 to 1989, when it was purchased by rival CompuServe and discontinued sometime thereafter. The Source's headquarters were located at 1616 Anderson Road, McLean, Virginia, 22102.
History
The Source was founded in 1978 as Digital Broadcasting Corporation by Bill von Meister, with support from Jack R. Taub, a businessman who had been very successful publishing the Scott catalogue of postage stamps. Initially the idea was to transmit email using an unused subcarrier piggy-backed onto FM radio signals. Instead, the two hit on the idea of an "information utility," using cheap overnight excess capacity in minicomputers and data networks to make online information available to dial-up subscribers. Dialcom Inc., located in Silver Spring, MD was the backbone of The Source and supplied all of the networking, computing power and software development until the sale of The Source to The Reader's Digest Association. Robert Ryan was the President and CEO of Dialcom for fifteen years and concurrently served as the founding President of The Source and remained in that role for three years and then decided to return full-time to Dialcom. Having secured publishing rights and put in place the necessary software, the system was announced at Comdex in June 1979. At a launch in New York the following month, Isaac Asimov declared it to be "the start of the information age." Prices were initially US$100 for a subscription, then $2.75 per hour off-peak. However, the project had already run up large debts, and soon began running out of money. Taub sold an 80% controlling stake to The Reader's Digest Association to keep the company afloat. Von Meister initiated legal action, and received a $1 million pay-off. He went on to found Control Video Corporation, which ultimately evolved into AOL.
Reader's Digest had high expectations for The Source, and established for the company its own purpose-built installation of Prime minicomputers in McLean, Virginia. However, subscriber numbers were slow to build, and (unlike the leaner set-up at rival CompuServe) this facility became an expensive and under-used overhead to maintain. Losses continued to mount, and chief executives came and went. Rumors abounded of an impending sale, but eventually Control Data Corporation put up $5 million in 1983 in return for stock options, and came in as an operating partner.
As the microcomputer boom continued, subscriptions reached a peak of 80,000 members, but later fell back (compared to 500,000 at CompuServe by 1989). During much of its existence The Source charged a start-up fee of about $100 and hourly usage rates on the order of $10 per hour. In 1984, the registration fee was $49.95, and The Source charged $20.75 per hour between 7:00 a.m. and 6:00 p.m. M |
https://en.wikipedia.org/wiki/XBase | xBase is the generic term for all programming languages that derive from the original dBASE (Ashton-Tate) programming language and database formats. These are sometimes informally known as dBASE "clones". While there was a non-commercial predecessor to the Ashton-Tate product (Vulcan written by Wayne Ratliff), most clones are based on Ashton-Tate's 1986 dBASE III+ release — scripts written in the dBASE III+ dialect are most likely to run on all the clones.
History of the X
Ashton-Tate always maintained that everything relating to dBASE was proprietary, and as a result, filed lawsuits against several of the "clone" software vendors. One effect of this action was to cause the clone vendors to avoid using the term "dBASE": a trademark term held by Ashton-Tate. This gave rise to the creation of the generic term "xBase" meaning "dBASE or dBASE-like." A suggested name that narrowly failed was "*base" (pronounced "star base" and an homage to Vulcan and Star Trek), and some wanted it spelled "X-base" to further differentiate it from the trademark.
Standards effort
By 1987 there were an increasing number of "clone" software products that mimicked dBASE. Each of these products had its own unique set of supported language features and syntax. As such, it was often very difficult to move code developed with one dBASE-like product to run in another one. (This was in contrast to older programming languages such as C or COBOL where due to published official standards, carefully developed code could possibly be run in a wide range of software environments.) While there were many cries for a standard for the dBASE programming language syntax, nothing would happen as long as Ashton-Tate asserted ownership of all-things dBASE.
Once Borland acquired Ashton-Tate in mid-1991 (and was apparently required to drop the lawsuits as an antitrust related condition of the merger), such standardization efforts were given new life. An ANSI committee (ANSI/X3J19) was officially formed, and began regular meetings in 1992. Marc Schnapp was the first chairman, and the first meeting was held at the Jet Propulsion Laboratory in Pasadena, California which was essentially the birthplace of Vulcan and dBASE II. The group met on a regular basis in a variety of locations over the next few years, and representatives from most major vendors participated. But despite lip service from all the vendors on the need for a standard, no one seemed willing to change their product syntax to match that of a competitor.
Influences over time
In 1989, Microtrend Books published the first "Xbase" cross-reference book (before the term was coined), The dBASE Language Handbook, by David M. Kalman, which covered Quicksilver, Clipper, , dBASE III, dBASE III Plus, dBASE IV, and FoxBase+. At more than 1,000 pages, it compared the execution of commands and functions to enable developers to build and maintain portable applications.
In 1993, Sybex, Inc. (computer books) published the Xbase Cross Referen |
https://en.wikipedia.org/wiki/Tribe.net | tribe.net (often shortened to "tribe") was a website that hosted an online community, or tribe of friends, similar to other social networking sites. The site name was always spelled in all lower case. As of February 2017 the site content was inaccessible and the site lacked a host. As of 25 February 2023, the tribe.net domain hosts a Mastodon server.
History
Tribe was founded in early 2003 by Paul Martino, Mark Pincus, and Valerie Syme. As of March 2004, the population of tribe was skewed heavily towards people living in the San Francisco Bay Area, though the geographic distribution is gradually normalizing as people from other places join. As of September 2006 it had over 500,000 members.
In a controversial move, on December 20, 2005, tribe.net decided to prohibit sexually explicit content, partially in response to the Child Protection and Obscenity Enforcement Act. This move disappointed many users, as Tribe to that point had been notable for a permissive content policy.
On January 19, 2006, tribe.net changed its layout and user interface (UI). The management of tribe.net claimed that they received approximately 40% positive feedback during a small beta phase with 3000 users.
In April, 2006, most of the employees of Tribe.net were laid off, leaving only a skeleton group to maintain and develop the site.
On August 24, 2006, former CEO Mark Pincus announced that he was "taking back tribe." He did this through a public listing on the site. This happened due to the financial insolvency of the initial company. Mark formed a new corporation, Utah Street Networks, that bought the distressed assets of the original company, Tribe Networks.
In late 2007, at the request of many members , tribe.net announced that it would offer a premium service to members on a subscription basis, at the rate of US$5.00 per month. Prospective premium members were told that they would be able to view the website in an ad-free format. It also promised free T-shirts to annual members, a benefit that has never fully been disbursed.
A September 24, 2008 article in the San Francisco Weekly quoted Pincus as saying that the site would continue. "I feel a commitment to the community of people who have made the decision to post themselves on Tribe," the Weekly quoted Pincus. "We've kept Tribe going not because we believed it would turn into a phenomenal business success like Bebo or Facebook, but because I think it serves a really valuable role for the community."
tribe.net was taken offline in March 2017 after an article on Heavy.com about a Reddit thread described child porn activity on the network.
While development director Carolyn Anhalt told the Black Rock Beacon in 2017 that the site was “gone for good” she said the concept might be resurrected. “We have not completely given up the hope to have a sustainable social network that supports anonymity and free speech."
In February 2022, the domain name was pointed to a list of charities supporting Ukraine. In Novemb |
https://en.wikipedia.org/wiki/G4%20%28American%20TV%20network%29 | G4 (also known as G4TV) was an American pay television and digital network owned by Comcast Spectacor that primarily focused on video games.
The network was originally owned by G4 Media, a joint venture between the NBCUniversal Cable division of NBCUniversal and Dish Network, and first launched on April 24, 2002. In late 2012, G4's studio programming ceased in preparation for a planned relaunch as Esquire Network, as part of a licensing deal with Hearst Corporation, owner of Esquire magazine. Esquire Network would ultimately replace Style Network instead, on September 23, 2013. G4 announced in November 2014 that it would end all operations. The network was shut down on New Year's Eve 2014. By August 2013, it was reported that approximately 61,217,000 American households (53.61% of households with television) were receiving the network.
On July 24, 2020, a revival of the G4 brand was announced; the network relaunched on November 16, 2021. On October 16, 2022, it was announced that Comcast would soon be shutting down the network. Its final day of operation was November 18, 2022.
History
Original
Launch
G4 was launched on April 24, 2002, under the ownership of Comcast. The initial concept was to create a service similar to rival TechTV but targeted at 12-to-34-year-olds, an elusive demographic. The channel was soft launched with a week-long series of Pong matches. It was initially available to three million Comcast subscribers, and offered 13 half-hour programs.
G4 was created and originally led by Charles Hirschhorn, a former president of Walt Disney Television and Television Animation. He expected video game creators themselves to eventually produce programming for the channel. He envisioned that G4 could follow in the footsteps of MTV, which provided music video producers with a venue for non-traditional television programming. Hirschhorn intended G4 to become a vehicle for unconventional advertising. In 2002, G4 offered advertisers wide latitude to place their products on G4's programs, and even allowed their commercials to appear as if they were a part of the program. G4 offered what was called a "2 minute unit", which was an advertising package played as if it were part of a G4 program that was long enough to run an entire movie trailer. G4 offered to sell the right to have a game showcased on the show Pulse.
Merger with TechTV
On March 25, 2004, Vulcan Inc. announced that G4 Media would acquire TechTV and merge the two networks. The combined network was rebranded as G4techTV. On February 15, 2005, less than a year after the merger, the "TechTV" brand was dropped from the channel's name. A Canadian version of TechTV, originally launched on September 7, 2001, would also be relaunched under the "G4techTV" branding and would retain the brand until 2009.
In September 2005, Neal Tiles replaced Hirschhorn as the channel's president. Tiles had previously been a senior marketing executive at DirecTV, Fox Sports and ESPN. He announced that G4 |
https://en.wikipedia.org/wiki/WTVT | WTVT (channel 13) is a television station licensed to Tampa, Florida, United States, serving as the Fox network outlet for the Tampa Bay area. Owned and operated by the network's Fox Television Stations division, WTVT maintains studios on Kennedy Boulevard on Tampa's west side, and its transmitter is located in Riverview.
History
As a CBS affiliate
The station first signed on the air on April 1, 1955, becoming the third television station in Tampa Bay (after WSUN-TV—channel 38, frequency now occupied by WTTA, and WFLA-TV, channel 8), it is also currently the second-oldest surviving station in the market behind WFLA. Upon its launch, WTVT took over the CBS affiliation from WSUN-TV. WTVT was originally owned by Tampa Bay radio veteran Walter Tison and his Tampa Television Company. The Federal Communications Commission (FCC) originally awarded the construction permit to build a station on channel 13 to the now-defunct Tampa Times newspaper, which owned WDAE radio (then at 1250 AM, now at 620 AM). However, the FCC reversed its decision and awarded the license to the Tison group, which intended to open a studio facility in nearby St. Petersburg. The Times appealed the FCC's decision, but lost. Although it appears that the station's call letters stand for "Television Tampa", they actually stand for the initials of Walter Tison and his wife, Virginia. Like many other stations located on "unlucky" channel 13, WTVT used a black cat as its mascot for several years.
In 1956, the Tampa Television Company merged with the Oklahoma City-based Oklahoma Publishing Company. OPUBCO's broadcasting subsidiary, the WKY Radiophone Company, would later be known as Gaylord Broadcasting, named for the family that owned the company (Gaylord also owned what is present-day CBS O&O KTVT in Fort Worth, but the "TVT" base callsign was only a coincidence).
The station's remote broadcast facilities were chosen for network pool coverage of Alan Shepard and John Glenn's Mercury capsule splashdowns (in 1961 and 1962, respectively). The mobile unit recorded the recoveries on videotapes that were flown to the mainland.
Through its CBS affiliation, WTVT carried Super Bowl XVIII, which was hosted at Tampa Stadium, in 1984.
In 1987, Gaylord sold the station to Gillett Communications (which made it a sister station of those Gillett acquired from KKR, most of which were stations owned by Storer Broadcasting). Gillett underwent a corporate restructuring in the early 1990s, changing its name to GCI Broadcast Services, Inc. In 1993, GCI filed for bankruptcy, and its stations (including WTVT) were sold to New World Communications. By that time, WTVT was preempting CBS This Morning for a locally produced morning newscast, as well as preempting all but one hour of the network's Saturday morning cartoons and aired the weeknight edition of the CBS Evening News on a half-hour tape delay at 7 p.m. WTVT did not carry the CBS daytime dramas Capitol or The Bold and the Beautiful and instead aired |
https://en.wikipedia.org/wiki/Generator%20%28computer%20programming%29 | In computer science, a generator is a routine that can be used to control the iteration behaviour of a loop. All generators are also iterators. A generator is very similar to a function that returns an array, in that a generator has parameters, can be called, and generates a sequence of values. However, instead of building an array containing all the values and returning them all at once, a generator yields the values one at a time, which requires less memory and allows the caller to get started processing the first few values immediately. In short, a generator looks like a function but behaves like an iterator.
Generators can be implemented in terms of more expressive control flow constructs, such as coroutines or first-class continuations. Generators, also known as semicoroutines, are a special case of (and weaker than) coroutines, in that they always yield control back to the caller (when passing a value back), rather than specifying a coroutine to jump to; see comparison of coroutines with generators.
Uses
Generators are usually invoked inside loops. The first time that a generator invocation is reached in a loop, an iterator object is created that encapsulates the state of the generator routine at its beginning, with arguments bound to the corresponding parameters. The generator's body is then executed in the context of that iterator until a special yield action is encountered; at that time, the value provided with the yield action is used as the value of the invocation expression. The next time the same generator invocation is reached in a subsequent iteration, the execution of the generator's body is resumed after the yield action, until yet another yield action is encountered. In addition to the yield action, execution of the generator body can also be terminated by a finish action, at which time the innermost loop enclosing the generator invocation is terminated. In more complicated situations, a generator may be used manually outside of a loop to create an iterator, which can then be used in various ways.
Because generators compute their yielded values only on demand, they are useful for representing streams, such as sequences that would be expensive or impossible to compute at once. These include e.g. infinite sequences and live data streams.
When eager evaluation is desirable (primarily when the sequence is finite, as otherwise evaluation will never terminate), one can either convert to a list, or use a parallel construction that creates a list instead of a generator. For example, in Python a generator g can be evaluated to a list l via l = list(g), while in F# the sequence expression seq { ... } evaluates lazily (a generator or sequence) but [ ... ] evaluates eagerly (a list).
In the presence of generators, loop constructs of a language – such as for and while – can be reduced into a single loop ... end loop construct; all the usual loop constructs can then be comfortably simulated by using suitable generators in the right |
https://en.wikipedia.org/wiki/EAD | EAD may refer to:
EAD socket, an obsolete network connection socket
, a Latin term meaning "the same", abbreviated
Early afterdepolarization, a type of cardiac dysrhythmia
Earlsfield railway station in London, station code EAD
Elite athletes with a disability, a term to describe athletes taking part in disabled sports
Emergency airworthiness directive, issued when an unsafe condition exists that requires immediate action by an aircraft owner or operator
Employment authorization document, in the United States
Encoded Archival Description, an archival data standard
Engin Altan Düzyatan, a Turkish actor
Environment Agency Abu Dhabi, a government agency
Equivalent air depth, a way of approximating decompression requirements
European AIS Database, an aviation database
Exposure at default, a measure of risk used in banking regulation
Nintendo Entertainment Analysis & Development, a defunct division of Nintendo |
https://en.wikipedia.org/wiki/Epic%20Games | Epic Games, Inc. is an American video game and software developer and publisher based in Cary, North Carolina. The company was founded by Tim Sweeney as Potomac Computer Systems in 1991, originally located in his parents' house in Potomac, Maryland. Following its first commercial video game release, ZZT (1991), the company became Epic MegaGames, Inc. in early 1992 and brought on Mark Rein, who has been its vice president since. After moving the headquarters to Cary in 1999, the studio changed its name to Epic Games.
Epic Games develops Unreal Engine, a commercially available game engine which also powers their internally developed video games like Fortnite and the Unreal, Gears of War, and Infinity Blade series. In 2014, Unreal Engine was named the "most successful videogame engine" by Guinness World Records.
Epic Games owns the game developers Chair Entertainment, Psyonix, Mediatonic, and Harmonix, as well as cloud-based software developer Cloudgine, and operates studios in Seattle, England, Berlin, Yokohama and Seoul. While Sweeney remains the controlling shareholder, Tencent acquired a 48.4% outstanding stake, equating to 40% of total Epic, in the company in 2012, as part of an agreement aimed at moving Epic towards a games as a service model. Following the release of the popular Fortnite Battle Royale in 2017, the company gained additional investments that enabled it to expand its Unreal Engine offerings, establish esport events around Fortnite, and launch the Epic Games Store. As of April 2022, the company has a equity valuation.
On August 13, 2020, Epic released a version of Fortnite that included a permanent discount on V-bucks across all platforms (except iOS and Android devices) if they purchased directly through Epic, bypassing Apple and Google's storefronts. Both Apple and Google immediately delisted the game for violating the storefronts' terms of service by including their own storefront, which led Epic to file lawsuits against both companies the same day, accusing them of antitrust behavior in how they operate their app stores.
History
Potomac Computer Systems (1991–1992)
Potomac Computer Systems was founded by Tim Sweeney in 1991. At the time, Sweeney was studying mechanical engineering and living in a dorm at the University of Maryland. He frequently visited his parents, who lived in nearby Potomac, Maryland, where his personal computer, used for both work and leisure, was situated. Out of this location, Sweeney started Potomac Computer Systems as a computer consulting business but later figured that it would be too much work he would have to put into keeping the business stable, and scrapped the idea.
After finishing his game ZZT, Sweeney opted to re-use the Potomac Computer Systems name to release the game to the public in January 1991. It was only with the unexpected success of ZZT, caused in most part by the easy modifiability of the game using Sweeney's custom ZZT-oop programming language, that made Sweeney consider t |
https://en.wikipedia.org/wiki/Space%20Ghost%20Coast%20to%20Coast | Space Ghost Coast to Coast is an American adult animated comedy late-night talk show created by Mike Lazzo for Cartoon Network and hosted by a re-imagined version of the 1960s Hanna-Barbera cartoon character Space Ghost. It is the first TV show to be produced by Williams Street (formerly known as Ghost Planet Industries), the company to start up Adult Swim in the early 2000s. In contrast to the original 1960s series, Space Ghost, which aired as a standard Hanna-Barbera Saturday-morning superhero cartoon, Space Ghost Coast to Coast is a reboot and sequel of the series intended for teens and adults, reinterpreted as a surreal spoof talk show and animated using the original series' artwork. Early seasons are more of a parody of late-night talk shows, while later seasons rely more on surrealism and non-sequitur humor.
Space Ghost Coast to Coast is the first original series fully produced by Cartoon Network. It premiered on April 15, 1994, and originally ended on December 17, 1999. The series was revived on May 7, 2001, and was moved to the then-new Adult Swim late-night programming block on September 2, where new episodes premiered until April 12, 2004. Two final seasons were released exclusively on GameTap from 2006 to 2008. Over 11 seasons, 109 episodes aired. The series helped to launch the careers of animators Adam Reed, Matt Thompson, Andy Merrill, Jim Fortier, Pete Smith, Michael Ouweleen, Erik Richter, Dave Willis, and Matt Maiellaro.
Six spin-off series, Cartoon Planet, Toonami, The Brak Show, Aqua Teen Hunger Force, Perfect Hair Forever, and Harvey Birdman, Attorney at Law, are based on Space Ghost: Coast to Coast. The series has also inspired or influenced other animated series for Adult Swim, including Sealab 2021 and The Eric Andre Show.
Premise
Space Ghost Coast to Coast uses a subverted talk show format hosted by Space Ghost as he interviews live-action guest stars, whom Space Ghost believes to be fellow superheroes, appearing on a monitor beside Space Ghost's desk. In early episodes, Space Ghost begins his interviews by asking guests about their superpowers. His interactions with guests can be awkward because the guests' answers are often changed to humorously match Space Ghost's questions in post-production. Later episodes feature guests being allowed to interact directly with the characters. Although he starts out more level headed and very much resembling his super hero ways, he becomes more and more eccentric, egomaniacal and idiotic with how he manages the show and treats his guests.
Space Ghost's bandleader, an evil, talking mantis named Zorak, and his director-producer, a red-helmeted lava man named Moltar, work forced unpaid labor for Space Ghost, ostensibly as punishment for their crimes committed on the original series. Because of their history as arch rivals of Space Ghost, they never get along with him even as co-workers and often make it very clear that they hate him and disrupt the show as retaliation for their forc |
https://en.wikipedia.org/wiki/Systems%20development%20life%20cycle | In systems engineering, information systems and software engineering, the systems development life cycle (SDLC), also referred to as the application development life cycle, is a process for planning, creating, testing, and deploying an information system. The SDLC concept applies to a range of hardware and software configurations, as a system can be composed of hardware only, software only, or a combination of both. There are usually six stages in this cycle: requirement analysis, design, development and testing, implementation, documentation, and evaluation.
Overview
A systems development life cycle is composed of distinct work phases that are used by systems engineers and systems developers to deliver information systems. Like anything that is manufactured on an assembly line, an SDLC aims to produce high-quality systems that meet or exceed expectations, based on requirements, by delivering systems within scheduled time frames and cost estimates. Computer systems are complex and often link components with varying origins. Various SDLC methodologies have been created, such as waterfall, spiral, agile, rapid prototyping, incremental, and synchronize and stabilize.
SDLC methodologies fit within a flexibility spectrum ranging from agile to iterative to sequential. Agile methodologies, such as XP and Scrum, focus on lightweight processes that allow for rapid changes. Iterative methodologies, such as Rational Unified Process and dynamic systems development method, focus on stabilizing project scope and iteratively expanding or improving products. Sequential or big-design-up-front (BDUF) models, such as waterfall, focus on complete and correct planning to guide larger projects and limit risks to successful and predictable results. Anamorphic development is guided by project scope and adaptive iterations.
In project management a project can include both a project life cycle (PLC) and an SDLC, during which somewhat different activities occur. According to Taylor (2004), "the project life cycle encompasses all the activities of the project, while the systems development life cycle focuses on realizing the product requirements".
SDLC is not a methodology per se, but rather a description of the phases that a methodology should address. The list of phases is not definitive, but typically includes planning, analysis, design, build, test, implement, and maintenance/support. In the Scrum framework, for example, one could say a single user story goes through all the phases of the SDLC within a two-week sprint. By contrast the waterfall methodology, where every business requirement is translated into feature/functional descriptions which are then all implemented typically over a period of months or longer.
History
According to Elliott (2004), SDLC "originated in the 1960s, to develop large scale functional business systems in an age of large scale business conglomerates. Information systems activities revolved around heavy data processing and number crun |
https://en.wikipedia.org/wiki/Loyd%20Blankenship | Loyd Blankenship (born 1965), better known by his pseudonym The Mentor, is an American computer hacker and writer. He has been active since the 1970s, when he was a member of the hacker groups Extasyy Elite and Legion of Doom.
Writings
Hacker Manifesto
He is the author of The Conscience of a Hacker (also known as The Hacker Manifesto); the essay was written after he was arrested and was published in the ezine Phrack. Since the essay's publication in 1986, it has been the subject of numerous panels and T-shirts.
Role-playing games
Blankenship was hired by Steve Jackson Games in 1989. He authored the cyberpunk role-playing sourcebook GURPS Cyberpunk, the manuscript of which was seized in a 1990 raid of Steve Jackson Games headquarters by the U.S. Secret Service. The raid resulted in the subsequent legal case Steve Jackson Games, Inc. v. United States Secret Service.
References
External links
ElfQrin.com Interview with The Mentor (July 31, 2000)
"The Conscience of a Hacker", published in Phrack Volume 1 Issue 7
1965 births
GURPS writers
Hacking (computer security)
Legion of Doom (hacker group)
Living people |
https://en.wikipedia.org/wiki/PC-File | PC-File was a flat file database computer application most often run on DOS. It was one of the first of three widely popular software products sold via the marketing method that became known as shareware. It was originally written by Jim "Button" Knopf in late 1982, and he formed the company Buttonware to develop, market, and support it.
The program was usually distributed for the cost of diskettes by local PC user groups. There was no copy protection and a manual was distributed as a file on the same diskettes as the program. It was extremely simple to use and extremely stable. It ran on just about any PC, while competing commercial products costing hundreds of dollars were often picky and full of bugs.
Knopf originally wrote the software for his own use to manage a church mailing list, on an Apple II. Later, he ported it to CP/M, and then to DOS. Other people heard about it, and started requesting copies. Eventually, the cost of sending out update disks inspired Knopf to include a note requesting a small cash donation to offset the expenses. The response was overwhelming, and when his income from PC-File exceeded "ten times" what he was making from his job at IBM, he decided to turn Buttonware into a full-time business.
After PC-File version 3.0, Buttonware released PC-File/R, which had limited "relational" capabilities. In 1987, PC-File+ was rewritten to use the popular dBASE III file format.
PC-File for Windows v8 was published by Outlook Software / Ace Software (previously Good Software) in 1994. This version works on Windows 3.1, 95, 98, and XP, but uses the 8.3 file naming convention. PC File will not run on Windows 7 64 bit, even in the XP compatibility mode, but will run in 'XP Mode'.
Reception
In a 1984 review of databases, PC Magazine found that "quite a few ... rough edges" existed, but concluded that "on a performance/price basis, [PC-File III] may be the best money you'll ever spend".
See also
PC-Write
Bob Wallace
PC-Talk
Andrew Fluegelman
References
External links
Article about Jim "Button" Knopf, from Dr. Dobb's Journal
Shareware |
https://en.wikipedia.org/wiki/PC-Write | PC-Write was a computer word processor and was one of the first three widely popular software products sold via the marketing method that became known as shareware. It was originally written by Bob Wallace in early 1983.
Overview
PC-Write was a modeless editor, using control characters and special function keys to perform various editing operations. By default it accepted many of the same control key commands as WordStar while adding many of its own features. It could produce plain ASCII text files, but there were also features that embedded control characters in a document to support automatic section renumbering, bold and italic fonts, and other such; also, a feature that was useful in list processing (as used in Auto LISP) was its ability to find matching open and closed parenthesis "( )"; this matching operation also worked for the other paired characters: { }, [ ] and < >.
Lines beginning with particular control characters n
and/or a period (.) contained commands that were evaluated when the document was printed, e.g. to specify margin sizes, select elite or pica type, or to specify the number of lines of text that would fit on a page, such as in escape sequences.
While Quicksoft distributed copies of PC-Write for $10, the company encouraged users to make copies of the program for others in an early example of shareware. Quicksoft asked those who liked PC-Write to send it $75. The sum provided a printed manual (notable for its many pictures of cats, drawn by Megan Dana-Wallace), telephone technical support, source code, and a registration number that the user entered into his copy of the program. If anyone else paid the company $75 to purchase an already-registered copy of the software, the company paid a $25 commission back to the original registrant, and then issued a new number to the new buyer, thereby giving a financial incentive for buyers to distribute and promote the software.
A configuration file allowed customizing PC-Write, including remapping the keyboard. Later versions of the registered (paid for) version of the program included a thesaurus (which was not shareware) along with the editor. In addition, there was vocabulary available in other languages, such as in German. Utilities were also provided to convert PC-Write files to and from other file formats that were common at the time. One limitation of the software was its inability to print directly from memory - because the print function was a separate subprogram, a document must be saved to a file before it could be printed.
Bob Wallace found that running Quicksoft used so much of his time he could not improve the PC-Write software. In early 1991, he sold the firm to another Microsoft alumnus, Leo Nikora, the original product manager for Windows 1.0 (1983–1985). Wallace returned to full programming and an updated version of PC-Write was released in June 1991.
One unusual feature of PC-Write was its implementation of free form editing: it could copy and paste a block |
https://en.wikipedia.org/wiki/Flat-file%20database | A flat-file database is a database stored in a file called a flat file. Records follow a uniform format, and there are no structures for indexing or recognizing relationships between records. The file is simple. A flat file can be a plain text file (e.g. csv, txt or tsv), or a binary file. Relationships can be inferred from the data in the database, but the database format itself does not make those relationships explicit.
The term has generally implied a small database, but very large databases can also be flat.
Overview
Plain text files usually contain one record per line. There are different conventions for depicting data. In comma-separated values and delimiter-separated values files, fields can be separated by delimiters such as comma or tab characters. In other cases, each field may have a fixed length; short values may be padded with space characters. Extra formatting may be needed to avoid delimiter collision.
Using delimiters incurs some overhead in locating them every time they are processed (unlike fixed-width formatting), which may have performance implications. However, use of character delimiters (especially commas) is also a crude form of data compression which may assist overall performance by reducing data volumes — especially for data transmission purposes. Use of character delimiters which include a length component (Declarative notation) is comparatively rare but vastly reduces the overhead associated with locating the extent of each field.
Examples of flat files include /etc/passwd and /etc/group on Unix-like operating systems. Another example of a flat file is a name-and-address list with the fields Name, Address, and Phone Number.
A list of names, addresses, and phone numbers written by hand on a sheet of paper is a flat-file database. This can also be done with any typewriter or word processor. A spreadsheet or text editor program may be used to implement a flat-file database, which may then be printed or used online for improved search capabilities.
History
Herman Hollerith's work for the US Census Bureau first exercised in the 1890 United States Census, involving data tabulated via hole punches in paper cards, is sometimes considered the first computerized flat-file database, as it included no cards indexing other cards, or otherwise relating the individual cards to one another, save by their group membership.
In the 1980s, configurable flat-file database computer applications were popular on the IBM PC and the Macintosh. These programs were designed to make it easy for individuals to design and use their own databases, and were almost on par with word processors and spreadsheets in popularity. Examples of flat-file database software include early versions of FileMaker and the shareware PC-File and the popular dBase.
Flat-file databases are common and ubiquitous because they are easy to write and edit, and suit myriad purposes in an uncomplicated way.
Modern implementations
Linear stores of NoSQL data, JS |
https://en.wikipedia.org/wiki/Abstraction%20layer | In computing, an abstraction layer or abstraction level is a way of hiding the working details of a subsystem. Examples of software models that use layers of abstraction include the OSI model for network protocols, OpenGL, and other graphics libraries, which allow the separation of concerns to facilitate interoperability and platform independence. Another example is Media Transfer Protocol.
In computer science, an abstraction layer is a generalization of a conceptual model or algorithm, away from any specific implementation. These generalizations arise from broad similarities that are best encapsulated by models that express similarities present in various specific implementations. The simplification provided by a good abstraction layer allows for easy reuse by distilling a useful concept or design pattern so that situations, where it may be accurately applied, can be quickly recognized.
A layer is considered to be on top of another if it depends on it. Every layer can exist without the layers above it, and requires the layers below it to function. Frequently abstraction layers can be composed into a hierarchy of abstraction levels. The OSI model comprises seven abstraction layers. Each layer of the model encapsulates and addresses a different part of the needs of digital communications, thereby reducing the complexity of the associated engineering solutions.
A famous aphorism of David Wheeler is, "All problems in computer science can be solved by another level of indirection." This is often deliberately misquoted with "abstraction" substituted for "indirection." It is also sometimes misattributed to Butler Lampson. Kevlin Henney's corollary to this is, "...except for the problem of too many layers of indirection."
Computer architecture
In a computer architecture, a computer system is usually represented as consisting of several abstraction levels such as:
software
programmable logic
hardware
Programmable logic is often considered part of the hardware, while the logical definitions are also sometimes seen as part of a device's software or firmware. Firmware may include only low-level software, but can also include all software, including an operating system and applications. The software layers can be further divided into hardware abstraction layers, physical and logical device drivers, repositories such as filesystems, operating system kernels, middleware, applications, and others. A distinction can also be made from low-level programming languages like VHDL, machine language, assembly language to a compiled language, interpreter, and script language.
Input and output
In the Unix operating system, most types of input and output operations are considered to be streams of bytes read from a device or written to a device. This stream of bytes model is used for file I/O, socket I/O, and terminal I/O in order to provide device independence. In order to read and write to a device at the application level, the program calls a function to open t |
https://en.wikipedia.org/wiki/Mystery%20Mountain | Mystery Mountain may refer to:
Mystery Mountain (serial), a 1934 Western film serial
JumpStart Adventures 3rd Grade: Mystery Mountain, a 1996 educational computer game created by Knowledge Adventure
"Mystery Mountain", a song from the band Journey's self-titled debut album Journey |
https://en.wikipedia.org/wiki/CP24 | CP24 is a Canadian English-language specialty news channel owned by Bell Media, a subsidiary of BCE Inc. and operated alongside the Bell-owned CTV Television Network's owned-and-operated television stations CFTO-DT (CTV Toronto) and CKVR-DT (CTV 2 Barrie). The channel broadcasts from 299 Queen Street West in Downtown Toronto.
It was first originally launched on March 30, 1998, under the name CablePulse24 by its owners CHUM Limited and Sun Media. The channel was named as an extension of CITY-TV (Citytv Toronto)'s newscasts, which were then known as CityPulse. CHUM acquired Sun Media's interest in 2004 after acquiring the assets of Craig Media. In 2006, Bell Globemedia acquired CP24 and its parent CHUM Limited, but regulatory limits in media ownership forced CHUM to sell off the Citytv stations to avoid conflicts with CTV stations in the same markets. CTVglobemedia retained the ownership of CP24 and the small market A-Channel stations, but subsequently sold the Citytv stations including CITY-TV, to Rogers Media in mid-2007, which held a 20% stake until 2008.
The channel focuses on local news from the Greater Toronto Area and Southern Ontario, while also covering national and international news. It is distributed through cable in Southern Ontario and direct broadcast satellite nationally.
Ownership history
CHUM
The channel was licensed by the Canadian Radio-television and Telecommunications Commission (CRTC) in 1996 as Pulse 24, described as "a 24-hour-a-day specialty television service devoted to news and information, with a focus on southern Ontario local and regional news and information", and launched on March 30, 1998, as CablePulse 24, under the ownership of CHUM Limited, the parent company of CITY-TV and minority partner Sun Media, owner of the Toronto Sun daily newspaper. For the first 10 years after its inception, CP24's programming was anchored and featured reports from Citytv personalities, live CityPulse news broadcasts were immediately repeated on CP24 after their initial broadcast on CITY-TV (except for breaking news coverage), and special coverage was simulcast between the channel and the television station. Select programming from other CHUM stations would also be featured on the channel, including The NewMusic and Fashion Television; another program, 24Ontario, featured news stories from CHUM's NewNet stations elsewhere in the province.
Overnight broadcasts on CP24 featured vintage CityPulse news broadcasts from CITY-TV during the 1970s & 1980s branded as Rewind. The rebroadcasts were accompanied by a graphic on the top right corner of the screen that read "Rewind", supplemented with the original airdate below it.
On December 1, 2004, CHUM Limited acquired the remaining interest in CP24 (giving it 100% of its shares), when the Sun's owners sold their 29.9% share in CP24 after acquiring its independent broadcast station CKXT-TV, the same day that CHUM Limited took control of Craig Media and its assets also.
Under CHUM ownershi |
https://en.wikipedia.org/wiki/NHL%20Network%20%28Canadian%20TV%20channel%29 | NHL Network is a defunct Canadian English language Category B specialty television channel broadcasting ice hockey programming. The channel's primary focus was on the National Hockey League (NHL), although it occasionally aired games from other leagues, such as minor league and international circuits, to fill its schedule.
The channel was owned by the NHL Network Inc., a venture consisting of the National Hockey League and two of its Canadian member franchises, CTV Specialty Television Inc. (a division of Bell Media and ESPN Inc.), and Insight Sports Ltd. The network's ownership structure, which gave the league only an 11.6% interest, was due in part to foreign ownership restrictions for Canadian broadcasters, which prevented the NHL (which, during the channel's existence, was owned by 30 member franchises, of which at least 23 were based in the United States) from exercising majority ownership directly.
The network's Canadian operations were managed by Bell-owned TSN, the now-former cable rightsholder of the NHL in Canada. Following Rogers Communications' acquisition of sole national media rights to the NHL in Canada, the Bell Media staff members who operated the network were laid off in July 2015, and NHL Network was shut down entirely on September 1, 2015.
The network's U.S. version was not affected by the shutdown; its operations were migrated to the Secaucus, New Jersey facilities of MLB Network as part of a wider partnership between the league and MLB Advanced Media.
History
In November 2000, the Canadian Radio-television and Telecommunications Commission (CRTC) granted approval to former NHL executive Jim Gregory on behalf of a corporation to be incorporated (formed later as The NHL Network Inc.) to launch The Hockey Channel, described as "a national English-language Category 2 specialty television dedicated exclusively to all aspects of the game of hockey". The channel was launched on October 4, 2001 as NHL Network. Its success led the league to create a sister network in the United States in 2007 with many of the same programs.
Even as Rogers Media took over as national television rightsholder of the NHL in Canada beginning in the 2014–15 season, NHL Network remained operated from the facilities of TSN and featured some of its talent. League sources reported that due to the preparations needed for its first season as rightsholder, Rogers was unable to immediately take over the channel, but that Rogers would reconsider its role in NHL Network the following season. TSN could have, alternatively, remained the operating partner of NHL Network beyond the 2014–15 season.
On June 1, 2015, The Globe and Mail columnist David Shoalts reported that NHL Network in Canada would cease operations on September 1, 2015. Bell Media staff members who operated NHL Network on behalf of the partnership were laid off on July 1, 2015. In August 2015, the NHL announced that MLB Advanced Media would take over the U.S. NHL Network and operate it from the bro |
https://en.wikipedia.org/wiki/Instruction%20cycle | The instruction cycle (also known as the fetch–decode–execute cycle, or simply the fetch-execute cycle) is the cycle that the central processing unit (CPU) follows from boot-up until the computer has shut down in order to process instructions. It is composed of three main stages: the fetch stage, the decode stage, and the execute stage.
In simpler CPUs, the instruction cycle is executed sequentially, each instruction being processed before the next one is started. In most modern CPUs, the instruction cycles are instead executed concurrently, and often in parallel, through an instruction pipeline: the next instruction starts being processed before the previous instruction has finished, which is possible because the cycle is broken up into separate steps.
Role of components
The program counter (PC) is a special register that holds the memory address of the next instruction to be executed. During the fetch stage, the address stored in the PC is copied into the memory address register (MAR) and then the PC is incremented in order to "point" to the memory address of the next instruction to be executed. The CPU then takes the instruction at the memory address described by the MAR and copies it into the memory data register (MDR). The MDR also acts as a two-way register that holds data fetched from memory or data waiting to be stored in memory (it is also known as the memory buffer register (MBR) because of this). Eventually, the instruction in the MDR is copied into the current instruction register (CIR) which acts as a temporary holding ground for the instruction that has just been fetched from memory.
During the decode stage, the control unit (CU) will decode the instruction in the CIR. The CU then sends signals to other components within the CPU, such as the arithmetic logic unit (ALU) and the floating point unit (FPU). The ALU performs arithmetic operations such as addition and subtraction and also multiplication via repeated addition and division via repeated subtraction. It also performs logic operations such as AND, OR, NOT, and binary shifts as well. The FPU is reserved for performing floating-point operations.
Summary of stages
Each computer's CPU can have different cycles based on different instruction sets, but will be similar to the following cycle:
Fetch stage: The next instruction is fetched from the memory address that is currently stored in the program counter and stored into the instruction register. At the end of the fetch operation, the PC points to the next instruction that will be read at the next cycle.
Decode stage: During this stage, the encoded instruction presented in the instruction register is interpreted by the decoder.
Read the effective address: In the case of a memory instruction (direct or indirect), the execution phase will be during the next clock pulse. If the instruction has an indirect address, the effective address is read from main memory, and any required data is fetched from main memory to be processed |
https://en.wikipedia.org/wiki/Sky%20%28New%20Zealand%29 | Sky Network Television Limited, more commonly known as Sky, is a New Zealand broadcasting company that provides pay television services via satellite, media streaming services and broadband internet services. Sky had 1,023,378 residential television subscribers consisting of 517,003 satellite subscribers and 506,375 streaming subscribers. Additionally, Sky had 23,156 broadband customers. Despite the similarity of name, branding and services, such as Sky Go and MySky shared with its European equivalent, Sky, there is no connection between the companies.
History
The company was founded by Craig Heatley, Terry Jarvis, Trevor Farmer and Alan Gibbs in 1987 as Sky Media Limited. It was formed to investigate beaming sports programming into nightclubs and pubs using high performance 4-metre satellite dishes by Jarvis and an engineering associate Brian Green, but was redirected into pay television following successful bidding in early 1990 for four groups of UHF frequencies in the Auckland, Hamilton and Tauranga regions. Initially operating only in the Auckland region, Sky contracted Broadcast Communications (now Kordia) to provide the broadcast service and transmission from its Panorama Road studios, formerly owned by defunct broadcaster Northern Television. The first Sky subscriber was former Speaker of the New Zealand House of Representatives Jonathan Hunt, according to Helen Clark, former Prime Minister of New Zealand.
The concept of a pay television service was new to New Zealand and Sky had early problems. These included viewer acceptance of subscriber television. It faced difficulty in educating retailers and customers on the use of the original decoders. However, this problem was eased with the introduction of easier-to-use decoders that allowed greater viewer flexibility.
UHF service
Sky originally launched on 18 May 1990 as an analogue UHF service. Subscribers required a VideoCrypt decoder and a UHF aerial, both of which were supplied by when joining Sky. The signal was sent with the picture scrambled using VideoCrypt technology; the decoder was used to unscramble the picture. Sky Movies was the only channel broadcast in NICAM stereo; Sky Sport and Sky News were broadcast in mono. The original decoder didn't actually support stereo sound; if a subscriber wanted to watch Sky Movies in stereo, the subscriber had to feed the audio from another source such as a NICAM stereo capable VCR.
Free-to-air broadcasts were shown in the early morning hours on Sky News and between 5 pm and 6 pm on Sky Sport until mid-1991; however, those without a Sky subscription could view the broadcasts without a UHF decoder by tuning their TV to the Sky News or Sky Sport UHF channel, as the signals were not scrambled during those times.
The original channel lineup consisted of three channels, Sky Movies (later renamed to HBO before reverting to its original name), Sky Sport and Sky News. Sky rapidly won long term rights from US sports network ESPN (which became a 1% |
https://en.wikipedia.org/wiki/Cheminformatics | Cheminformatics (also known as chemoinformatics) refers to the use of physical chemistry theory with computer and information science techniques—so called "in silico" techniques—in application to a range of descriptive and prescriptive problems in the field of chemistry, including in its applications to biology and related molecular fields. Such in silico techniques are used, for example, by pharmaceutical companies and in academic settings to aid and inform the process of drug discovery, for instance in the design of well-defined combinatorial libraries of synthetic compounds, or to assist in structure-based drug design. The methods can also be used in chemical and allied industries, and such fields as environmental science and pharmacology, where chemical processes are involved or studied.
History
Cheminformatics has been an active field in various guises since the 1970s and earlier, with activity in academic departments and commercial pharmaceutical research and development departments. The term chemoinformatics was defined in its application to drug discovery by F.K. Brown in 1998:Chemoinformatics is the mixing of those information resources to transform data into information and information into knowledge for the intended purpose of making better decisions faster in the area of drug lead identification and optimization. Since then, both terms, cheminformatics and chemoinformatics, have been used, although, lexicographically, cheminformatics appears to be more frequently used, despite academics in Europe declaring for the variant chemoinformatics in 2006. In 2009, a prominent Springer journal in the field was founded by transatlantic executive editors named the Journal of Cheminformatics.
Background
Cheminformatics combines the scientific working fields of chemistry, computer science, and information science—for example in the areas of topology, chemical graph theory, information retrieval and data mining in the chemical space. Cheminformatics can also be applied to data analysis for various industries like paper and pulp, dyes and such allied industries.
Applications
Storage and retrieval
A primary application of cheminformatics is the storage, indexing, and search of information relating to chemical compounds. The efficient search of such stored information includes topics that are dealt with in computer science, such as data mining, information retrieval, information extraction, and machine learning. Related research topics include:
Digital libraries
Unstructured data
Structured data mining and mining of structured data
Database mining
Graph mining
Molecule mining
Sequence mining
Tree mining
File formats
The in silico representation of chemical structures uses specialized formats such as the Simplified molecular input line entry specifications (SMILES) or the XML-based Chemical Markup Language. These representations are often used for storage in large chemical databases. While some formats are suited for visual representatio |
https://en.wikipedia.org/wiki/ARN%20%28Australian%20radio%29 | ARN is a group of commercial radio stations around Australia. It includes the Pure Gold, KIIS Network, CADA, ARN Regional and iHeartRadio brands.
The company operates the ARN News service in Australia, which uses international correspondents and source news stories from AAP in Australia, CNN from the United States and Sky News and Independent Radio News from the United Kingdom. ARN has newsrooms in Sydney, Melbourne, Canberra, Brisbane and Adelaide.
Originally ARN was a joint venture of APN News & Media and iHeartMedia (formerly Clear Channel). On 19 February 2014, it was reported that APN News & Media had agreed to purchase Clear Channel's 50% stake in the ARN. As a result, ARN is now fully owned by ARN Media. The company continues to operate the Australian version of iHeartRadio.
Until 2014, ARN also included New Zealand radio networks Newstalk ZB, Classic Hits FM, ZM, Radio Sport, Radio Hauraki, Easy Mix, Flava and Coast under umbrella company The Radio Network. These are now part of the New Zealand Media and Entertainment.
In August 2021, the company removed the words 'Australian Radio Network' from its name, now being known as simply ARN. Three months later, in November 2021, Here, There & Everywhere, ARN's parent company, purchased Grant Broadcasters, who intend to integrate it with its own business by January 2022. The deal was finalised on 4 January 2022.
Having already acquired a 15% stake in Southern Cross Austereo (SCA) earlier in the year, in October 2023 ARN launched a takeover offer for SCA in partnership with Anchorage Capital Partners. To satisfy Australian Communications & Media Authority regulations that allow one party to only own two radio stations in one market, in capital cities ARN would add the Triple M network to the KIIS Network, while Anchorage Capital Partners would control the Hit and Pure Gold networks.
Assets
ARN operates 58 radio stations, targeting the 25-to-54-year-old demographic. These stations include
the top 40 (CHR), adult contemporary, and active rock-formatted KIIS Network
the classic hits and oldies-formatted Pure Gold Network
the rhythmic top 40 and urban contemporary-formatted CADA
joint venture stations Mix 106.3 and Hit104.7 in Canberra with Southern Cross Austereo
other radio stations via DAB+ digital radio and iHeartRadio
46 radio stations acquired from Grant Broadcasters
KIIS Network
A vibrant network alive with influential personalities who energise, engage and excite, immersing audiences in the best music their city has to offer.
Pure Gold Network
An iconic network making audiences feel young, positive and full of life, immersing listeners with the Pure Gold hits they know and love.
Other stations
Digital radio
ARN also broadcasts a number of digital only radio stations.
Former stations
References
ARN Media
Australian radio networks |
https://en.wikipedia.org/wiki/Austereo | Austereo was an Australian mass media company based in Melbourne. It was founded in 1980 by Paul Thompson, and operated 16 radio stations in metropolitan and regional Australia under the Today Network and Triple M brands. In 2011, the company's majority shareholder Village Roadshow sold its shareholding to Southern Cross Media Group, which began trading as Southern Cross Austereo from 21 July.
History
The company was founded by broadcaster Paul Thompson, who upon the commencement of FM broadcasting in Australia acquired the first commercial radio licence for the metropolitan Adelaide area. SAFM commenced transmission in September 1980, with the Austereo Network established in 1986 following the company's acquisition of Fox FM Melbourne.
In 1988, Austereo acquired FM104.7 and 2CA in Canberra as well as 4BK Brisbane and 6IX Perth. The company then bid to convert the BK and IX stations to the FM band. In Brisbane, the company was successful, relaunching 4BK as B105 FM in February 1990; in Perth, the company was outbid by 6KY and 6PM, and consequently sold the station to Radio West. In May 1989, the company extended its reach into Sydney with the acquisition of 2Day FM.
In 1995, Austereo purchased the Triple M network from Hoyts Media, adding a further five radio stations to the company's portfolio. The existing Austereo stations were rebranded to the Today Network. Subsequently, rival cinema chain Village Roadshow acquired control of Austereo, with Thompson departing as CEO.
On 22 January 1996, Austereo purchased KOFM and NXFM in Newcastle from Radio Newcastle Pty Ltd. Austereo would go on to sell 50% of its stake in these stations to RG Capital.
In March 1997 Austereo's managing director, Mr Peter Harvie, announced the network would be entering a joint venture with ARN to effectively amalgamate FM104.7 and Mix 106 in Canberra. Under competition laws, Austereo was required to sell 2CA, with Harvie commenting the station would be 'disposed of immediately'. At the time, Harvie stated that the deal was peculiar to the Canberra market and the company had 'no intention' of implementing similar ventures in other capitals.
In September 1997 the ACCC ruled in favour of Austereo's acquisition Perth's highest rating radio stations of PMFM and 94.5FM from Jack Bendat, selling Triple M Perth to Southern Cross Broadcasting. The ACCC required that the new owners of Triple M change the call sign, with Austereo retaining the right to rebrand either of its new stations to Triple M. This finally occurred when the 92.9 FM frequency (originally PMFM) was rebranded to Triple M Perth in December 2020.
Village Roadshow partially floated the company on the Australian Securities Exchange in 2001 under the ticker symbol AEO, increasing its share in the company to 61.8% in 2004. In January 2011, industry publication Radioinfo reported Village Roadshow were "in discussions" to sell its majority shareholding in Austereo. On 31 January, Southern Cross Media Group announ |
https://en.wikipedia.org/wiki/Connectivity | Connectivity may refer to:
Computing and technology
Connectivity (media), the ability of the social media to accumulate economic capital from the users connections and activities
Internet connectivity, the means by which individual terminals, computers, mobile devices, and local area networks connect to the global Internet
Pixel connectivity, the way in which pixels in 2-dimensional images relate to their neighbors.
Mathematics
Connectivity (graph theory), a property of a graph.
The property of being a connected space in topology.
Homotopical connectivity, a property related to the dimensions of holes in a topological space, and to its homotopy groups.
Homological connectivity, a property related to the homology groups of a topological space.
Biology
Neurobiology
Homotopic connectivity - connectivity between mirror areas of the human brain hemispheres.
Brain connectivity
Functional connectivity
Dynamic functional connectivity
Ecology
Landscape connectivity, the degree to which the landscape facilitates or impedes movement among resource patches.
Permeability (spatial and transport planning), the extent to which urban forms permit (or restrict) movement of people or vehicles in different directions.
Physics
Connectivity, a parameter describing the topology of a porous medium.
See also
Connection (disambiguation)
Prayer, connection to the Divine. |
https://en.wikipedia.org/wiki/Core%20rope%20memory | Core rope memory is a form of read-only memory (ROM) for computers, first used in the 1960s by early NASA Mars space probes and then in the Apollo Guidance Computer (AGC) and programmed by the Massachusetts Institute of Technology (MIT) Instrumentation Lab and built by Raytheon.
Software written by MIT programmers was woven into core rope memory by female workers in factories. Some programmers nicknamed the finished product LOL memory, for Little Old Lady memory.
Memory density
By the standards of the time, a relatively large amount of data could be stored in a small installed volume of core rope memory: 72 kilobytes per cubic foot, or roughly 2.5 megabytes per cubic meter. This was about 18 times the amount of magnetic-core memory (within two cubic feet).
References
External links
"Computer for Apollo" NASA/MIT film from 1965 which demonstrates how rope memory was manufactured.
Visual Introduction to the Apollo Guidance Computer, part 3: Manufacturing the Apollo Guidance Computer. – By Raytheon; hosted by the Library of the California Institute of Technology's History of Recent Science & Technology site (originally hosted by the Dibner Institute)
Computers in Spaceflight: The NASA Experience – By James Tomayko (Chapter 2, Part 5, "The Apollo guidance computer: Hardware")
Brent Hilpert's Core Rope & Woven-Wire Memory Systems page has a detailed explanation of pulse-transformer and switching-core techniques.
SV3ORA's Core rope memory: A practical guide of how to build your own gives a description, schematics and photos of a simple core rope memory board using the pulse transformer technique, including a demonstration of operation.
Software woven into wire: Core rope and the Apollo Guidance Computer, extensive blog post by computer restoration expert Ken Shirriff
Australian 'ropes' demonstrated at MIT Letter from Ramon L. Alonso to Gordon Rose, dated 10 December 1963: "We are finding the Australian ideas on ‘ropes' to be very fruitful indeed, and we are going ahead with some development work on them."
Computer memory
Non-volatile memory |
https://en.wikipedia.org/wiki/Discriminated%20union | The term discriminated union may refer to:
Disjoint union in set theory.
Tagged union in computer science.
Mathematics disambiguation pages |
https://en.wikipedia.org/wiki/Time%20%28Unix%29 | In computing, time is a command in Unix and Unix-like operating systems. It is used to determine the duration of execution of a particular command.
Overview
time(1) can exist as a standalone program (such as GNU time) or as a shell builtin in most case (e.g. in sh, bash, tcsh or in zsh).
User time vs system time
The total CPU time is the combination of the amount of time the CPU or CPUs spent performing some action for a program and the amount of time they spent performing system calls for the kernel on the program's behalf. When a program loops through an array, it is accumulating user CPU time. Conversely, when a program executes a system call such as exec or fork, it is accumulating system CPU time.
Real time vs CPU time
The term "real time" in this context refers to elapsed wall-clock time, like using a stop watch. The total CPU time (user time + sys time) may be more or less than that value. Because a program may spend some time waiting and not executing at all (whether in user mode or system mode) the real time may be greater than the total CPU time. Because a program may fork children whose CPU times (both user and sys) are added to the values reported by the time command, but on a multicore system these tasks are run in parallel, the total CPU time may be greater than the real time.
Usage
To use the command, simply precede any command by the word time, such as:
$ time ls
When the command completes, time will report how long it took to execute the ls command in terms of user CPU time, system CPU time, and real time. The output format varies between different versions of the command, and some give additional statistics, as in this example:
$ time host wikipedia.org
wikipedia.org has address 103.102.166.224
wikipedia.org mail is handled by 50 mx2001.wikimedia.org.
wikipedia.org mail is handled by 10 mx1001.wikimedia.org.
host wikipedia.org 0.04s user 0.02s system 7% cpu 0.780 total
$
(either a standalone program, or when Bash shell is running in POSIX mode AND is invoked as time -p) reports to standard error output.
time -p
Portable scripts should use time -p mode, which uses a different output format, but which is consistent with various implementations:
$ time -p sha256sum /bin/ls
12477deb0e25209768cbd79328f943a7ea8533ece70256cdea96fae0ae34d1cc /bin/ls
real 0.00
user 0.00
sys 0.00
$
Implementations
GNU time
Current versions of GNU time, report more than just a time by default:
$ /usr/bin/time sha256sum /bin/ls
12477deb0e25209768cbd79328f943a7ea8533ece70256cdea96fae0ae34d1cc /bin/ls
0.00user 0.00system 0:00.00elapsed 100%CPU (0avgtext+0avgdata 2156maxresident)k
0inputs+0outputs (0major+96minor)pagefaults 0swaps
$
Format of the output for GNU time, can be adjusted using TIME environment variable, and it can include information other than the execution time (i.e. memory usage). This behavior is not available in general POSIX-compliant time, or when executing as time -p.
Documentation of this can be usually accessed using man |
https://en.wikipedia.org/wiki/Port%20scanner | A port scanner is an application designed to probe a server or host for open ports. Such an application may be used by administrators to verify security policies of their networks and by attackers to identify network services running on a host and exploit vulnerabilities.
A port scan or portscan is a process that sends client requests to a range of server port addresses on a host, with the goal of finding an active port; this is not a nefarious process in and of itself. The majority of uses of a port scan are not attacks, but rather simple probes to determine services available on a remote machine.
To portsweep is to scan multiple hosts for a specific listening port. The latter is typically used to search for a specific service, for example, an SQL-based computer worm may portsweep looking for hosts listening on TCP port 1433.
TCP/IP basics
The design and operation of the Internet is based on the Internet Protocol Suite, commonly also called TCP/IP. In this system, network services are referenced using two components: a host address and a port number. There are 65535 distinct and usable port numbers, numbered 1..65535. (Port zero is not a usable port number.) Most services use one, or at most a limited range of, port numbers.
Some port scanners scan only the most common port numbers, or ports most commonly associated with vulnerable services, on a given host.
The result of a scan on a port is usually generalized into one of three categories:
Open or Accepted: The host sent a reply indicating that a service is listening on the port.
Closed or Denied or Not Listening: The host sent a reply indicating that connections will be denied to the port.
Filtered, Dropped or Blocked: There was no reply from the host.
Open ports present two vulnerabilities of which administrators must be wary:
Security and stability concerns associated with the program responsible for delivering the service - Open ports.
Security and stability concerns associated with the operating system that is running on the host - Open or Closed ports.
Filtered ports do not tend to present vulnerabilities.
Assumptions
All forms of port scanning rely on the assumption that the targeted host is compliant with RFC. Although this is the case most of the time, there is still a chance a host might send back strange packets or even generate false positives when the TCP/IP stack of the host is non-RFC-compliant or has been altered. This is especially true for less common scan techniques that are OS-dependent (FIN scanning, for example). The TCP/IP stack fingerprinting method also relies on these types of different network responses from a specific stimulus to guess the type of the operating system the host is running.
Types of scans
TCP scanning
The simplest port scanners use the operating system's network functions and are generally the next option to go to when SYN is not a feasible option (described next). Nmap calls this mode connect scan, named after the Unix connect() system |
https://en.wikipedia.org/wiki/Congruence%20of%20squares | In number theory, a congruence of squares is a congruence commonly used in integer factorization algorithms.
Derivation
Given a positive integer n, Fermat's factorization method relies on finding numbers x and y satisfying the equality
We can then factor n = x2 − y2 = (x + y)(x − y). This algorithm is slow in practice because we need to search many such numbers, and only a few satisfy the equation. However, n may also be factored if we can satisfy the weaker congruence of squares condition:
From here we easily deduce
This means that n divides the product (x + y)(x − y). Thus (x + y) and (x − y) each contain factors of n, but those factors can be trivial. In this case we need to find another x and y. Computing the greatest common divisors of (x + y, n) and of (x − y, n) will give us these factors; this can be done quickly using the Euclidean algorithm.
Congruences of squares are extremely useful in integer factorization algorithms and are extensively used in, for example, the quadratic sieve, general number field sieve, continued fraction factorization, and Dixon's factorization. Conversely, because finding square roots modulo a composite number turns out to be probabilistic polynomial-time equivalent to factoring that number, any integer factorization algorithm can be used efficiently to identify a congruence of squares.
Further generalizations
It is also possible to use factor bases to help find congruences of squares more quickly. Instead of looking for from the outset, we find many where the y have small prime factors, and try to multiply a few of these together to get a square on the right-hand side.
Examples
Factorize 35
We take n = 35 and find that
.
We thus factor as
Factorize 1649
Using n = 1649, as an example of finding a congruence of squares built up from the products of non-squares (see Dixon's factorization method), first we obtain several congruences
of these, two have only small primes as factors
and a combination of these has an even power of each small prime, and is therefore a square
yielding the congruence of squares
So using the values of 80 and 114 as our x and y gives factors
See also
Congruence relation
Equivalence (mathematics)
Integer factorization algorithms
Modular arithmetic
Squares in number theory |
https://en.wikipedia.org/wiki/Binary%20decision%20diagram | In computer science, a binary decision diagram (BDD) or branching program is a data structure that is used to represent a Boolean function. On a more abstract level, BDDs can be considered as a compressed representation of sets or relations. Unlike other compressed representations, operations are performed directly on the compressed representation, i.e. without decompression.
Similar data structures include negation normal form (NNF), Zhegalkin polynomials, and propositional directed acyclic graphs (PDAG).
Definition
A Boolean function can be represented as a rooted, directed, acyclic graph, which consists of several (decision) nodes and two terminal nodes. The two terminal nodes are labeled 0 (FALSE) and 1 (TRUE). Each (decision) node is labeled by a Boolean variable and has two child nodes called low child and high child. The edge from node to a low (or high) child represents an assignment of the value FALSE (or TRUE, respectively) to variable . Such a BDD is called 'ordered' if different variables appear in the same order on all paths from the root. A BDD is said to be 'reduced' if the following two rules have been applied to its graph:
Merge any isomorphic subgraphs.
Eliminate any node whose two children are isomorphic.
In popular usage, the term BDD almost always refers to Reduced Ordered Binary Decision Diagram (ROBDD in the literature, used when the ordering and reduction aspects need to be emphasized). The advantage of an ROBDD is that it is canonical (unique) for a particular function and variable order. This property makes it useful in functional equivalence checking and other operations like functional technology mapping.
A path from the root node to the 1-terminal represents a (possibly partial) variable assignment for which the represented Boolean function is true. As the path descends to a low (or high) child from a node, then that node's variable is assigned to 0 (respectively 1).
Example
The left figure below shows a binary decision tree (the reduction rules are not applied), and a truth table, each representing the function . In the tree on the left, the value of the function can be determined for a given variable assignment by following a path down the graph to a terminal. In the figures below, dotted lines represent edges to a low child, while solid lines represent edges to a high child. Therefore, to find , begin at x1, traverse down the dotted line to x2 (since x1 has an assignment to 0), then down two solid lines (since x2 and x3 each have an assignment to one). This leads to the terminal 1, which is the value of .
The binary decision tree of the left figure can be transformed into a binary decision diagram by maximally reducing it according to the two reduction rules. The resulting BDD is shown in the right figure.
Another notation for writing this Boolean function is .
Complemented edges
An ROBDD can be represented even more compactly, using complemented edges. Complemented edges are formed by annotating l |
https://en.wikipedia.org/wiki/Hello%20Cheeky | Hello Cheeky is a comedy series starring Barry Cryer, John Junkin and Tim Brooke-Taylor, broadcast on BBC Radio 2 between 1973 and 1979, and also broadcast on television - on the ITV network - in 1976. The format was short comedy sketches, often as short as one line, with occasional longer sketches.
The BBC radio show was broadcast weekly in a half-hour timeslot, usually on Saturday or Sunday lunchtime. Its three stars were normally the only performers who appeared, although the show's musical director, Denis King, was often given a small speaking role in one or two of the shorter items.
The radio series featured music by the Denis King Trio, and was produced initially by David Hatch, then by Richard Willcox, and thereafter by Bob Oliver Rogers.
Radio
The series ran on BBC Radio 2 from 1973 to 1979. There were also three Christmas specials: Hello Cheeky Hello Christmas in December 1973, Hello Christmas in December 1974, and the pantomime-style Cheeky Whittington and his Magic Ballpoint in 1976. There was also a Summer Special in 1974.
Initially, the scripts were written by all three of the show's stars. Later in the run, as Tim Brooke-Taylor's time became increasingly absorbed by his television work on The Goodies, the scripts were written solely by Barry Cryer and John Junkin.
During the first two series in 1973-74 it was ordinarily produced by David Hatch, but occasional editions were produced by Richard Willcox (with both men credited on the 1974 summer special, Hello Summer) From series 3, in 1975, it was produced by Bob Oliver Rogers (with David Hatch returning briefly to produce some editions of the final series, aired in 1979, due to Bob's unexpected death).
The initial experiment of broadcasting it at lunchtime on Saturdays lasted for one series only. From series 2 it was transmitted at lunchtime on Sundays, a more natural home for comedy shows, which had traditionally occupied that spot in the station's schedules since the heyday of the old BBC Light Programme in the early 1960s.
To describe it as a sketch show, while technically correct, would also be misleading. It was typically more a succession of quick-fire gags and one-liners, rather than actual sketches. So many of the items were one-line, that co-writer Barry Cryer was moved to comment publicly that "a minute was a long sketch on Hello Cheeky". One consequence of this was that the show lacked anything resembling a regular structure.
Some items did reappear each week, but not in any kind of regular order: these included quickfire "meanwhile"s, "would you believe it?"s, "home hints for the handyman", "the Encyclopedia of the Air", comic songs, spoof phone calls (one cast member would pretend to be a listener or celebrity, phoning to complain about the previous item), spoof news flashes, and "Hello Cheeky's personal column" (a spoof advice forum). A number of the items that were used had previously been recorded by Marty Feldman (who John Junkin and Tim Brooke-Taylor had kn |
https://en.wikipedia.org/wiki/Decision%20tree%20learning | Decision tree learning is a supervised learning approach used in statistics, data mining and machine learning. In this formalism, a classification or regression decision tree is used as a predictive model to draw conclusions about a set of observations.
Tree models where the target variable can take a discrete set of values are called classification trees; in these tree structures, leaves represent class labels and branches represent conjunctions of features that lead to those class labels. Decision trees where the target variable can take continuous values (typically real numbers) are called regression trees. More generally, the concept of regression tree can be extended to any kind of object equipped with pairwise dissimilarities such as categorical sequences.
Decision trees are among the most popular machine learning algorithms given their intelligibility and simplicity.
In decision analysis, a decision tree can be used to visually and explicitly represent decisions and decision making. In data mining, a decision tree describes data (but the resulting classification tree can be an input for decision making).
General
Decision tree learning is a method commonly used in data mining. The goal is to create a model that predicts the value of a target variable based on several input variables.
A decision tree is a simple representation for classifying examples. For this section, assume that all of the input features have finite discrete domains, and there is a single target feature called the "classification". Each element of the domain of the classification is called a class.
A decision tree or a classification tree is a tree in which each internal (non-leaf) node is labeled with an input feature. The arcs coming from a node labeled with an input feature are labeled with each of the possible values of the target feature or the arc leads to a subordinate decision node on a different input feature. Each leaf of the tree is labeled with a class or a probability distribution over the classes, signifying that the data set has been classified by the tree into either a specific class, or into a particular probability distribution (which, if the decision tree is well-constructed, is skewed towards certain subsets of classes).
A tree is built by splitting the source set, constituting the root node of the tree, into subsets—which constitute the successor children. The splitting is based on a set of splitting rules based on classification features. This process is repeated on each derived subset in a recursive manner called recursive partitioning.
The recursion is completed when the subset at a node has all the same values of the target variable, or when splitting no longer adds value to the predictions. This process of top-down induction of decision trees (TDIDT) is an example of a greedy algorithm, and it is by far the most common strategy for learning decision trees from data.
In data mining, decision trees can be described also as the combination |
https://en.wikipedia.org/wiki/Association%20rule%20learning | Association rule learning is a rule-based machine learning method for discovering interesting relations between variables in large databases. It is intended to identify strong rules discovered in databases using some measures of interestingness. In any given transaction with a variety of items, association rules are meant to discover the rules that determine how or why certain items are connected.
Based on the concept of strong rules, Rakesh Agrawal, Tomasz Imieliński and Arun Swami introduced association rules for discovering regularities between products in large-scale transaction data recorded by point-of-sale (POS) systems in supermarkets. For example, the rule found in the sales data of a supermarket would indicate that if a customer buys onions and potatoes together, they are likely to also buy hamburger meat. Such information can be used as the basis for decisions about marketing activities such as, e.g., promotional pricing or product placements.
In addition to the above example from market basket analysis, association rules are employed today in many application areas including Web usage mining, intrusion detection, continuous production, and bioinformatics. In contrast with sequence mining, association rule learning typically does not consider the order of items either within a transaction or across transactions.
The association rule algorithm itself consists of various parameters that can make it difficult for those without some expertise in data mining to execute, with many rules that are arduous to understand.
Definition
Following the original definition by Agrawal, Imieliński, Swami the problem of association rule mining is defined as:
Let be a set of binary attributes called items.
Let be a set of transactions called the database.
Each transaction in has a unique transaction ID and contains a subset of the items in .
A rule is defined as an implication of the form:
, where .
In Agrawal, Imieliński, Swami a rule is defined only between a set and a single item, for .
Every rule is composed by two different sets of items, also known as itemsets, and , where is called antecedent or left-hand-side (LHS) and consequent or right-hand-side (RHS). The antecedent is that item that can be found in the data while the consequent is the item found when combined with the antecedent. The statement is often read as if then , where the antecedent ( ) is the if and the consequent () is the then. This simply implies that, in theory, whenever occurs in a dataset, then will as well.
Process
Association rules are made by searching data for frequent if-then patterns and by using a certain criterion under Support and Confidence to define what the most important relationships are. Support is the evidence of how frequent an item appears in the data given, as Confidence is defined by how many times the if-then statements are found true. However, there is a third criteria that can be used, it is called Lift and it can be used to com |
https://en.wikipedia.org/wiki/GPSS | General Purpose Simulation System (GPSS) is a discrete time simulation general-purpose programming language, where a simulation clock advances in discrete steps. A system is modelled as transactions enter the system and are passed from one service (represented by blocks) to another. It is used primarily as a process flow oriented simulation language; this is particularly well-suited for problems such as a factory.
History
GPSS was developed by IBM's Geoffrey Gordon at the beginning of the 1960s. He named it Gordon's Programmable Simulation System. The name was changed when IBM decided to release it as a product.
GPSS was influenced by Gordon's experience simulating with analog computers. The "General Purpose" part of the new name was to create a standard in waiting-line simulations.
The original releases were for IBM's 7044 & 7090 mainframes. Subsequently,
there were releases for IBM 360,
Univac 1108 and CDC.
Over time, other implementations, in other languages and targeted at different size systems, were developed, including DEC's VAX, a specialized APL version for large-scale Univac systems, and Macintosh, among others.
JGPSS
GPSS (Java General Purpose Simulation System) is a Java-based tool that was developed to teach the GPSS simulation language.
Language description
GPSS resembles a LEGO structure where blocks are chosen by the modeller for specific functions to imitate a particular system.
The language is neither procedural, object-oriented or functional programming. The world is simulated with entities moving through the model. These entities, called Transactions, are envisioned as moving from Block to Block, where a Block is a line of code and represents unit actions that affects the Transaction itself or other entities.
Blocks can be facility-oriented (such as machines in a job shop) or transaction-oriented (such parts of work-in-process, signals in electronic components or documents in a bureaucratic procedure). GPSS automatically keep track of statistics which brings in fixed form at the end of a simulation as standard report. GPSS is one of the oldest language candidate of first object-oriented approach because while transactions are truly instances of model objects, blocks are methods in the modern concept of OOP.
Entities can be broadly classified in Resources, Computational entities and Statistical entities. Resources, like Facilities and Storages represent limited capacity resources. Computational entities, like Ampervariables (variables), Functions and random generators are used to represent the state of Transactions or elements of their environment. Statistical entities, like Queues or Tables (histograms) collect statistical information of interest.
Sample code
The following example, taken from Simulation using GPSS, is the "Hello world!" of GPSS and will illustrate the main concepts.
The aim is to simulate one day of operation of a barber shop. Customers arrive in a random constant flow, enter the shop, queue if |
https://en.wikipedia.org/wiki/Quadtree | A quadtree is a tree data structure in which each internal node has exactly four children. Quadtrees are the two-dimensional analog of octrees and are most often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions. The data associated with a leaf cell varies by application, but the leaf cell represents a "unit of interesting spatial information".
The subdivided regions may be square or rectangular, or may have arbitrary shapes. This data structure was named a quadtree by Raphael Finkel and J.L. Bentley in 1974. A similar partitioning is also known as a Q-tree.
All forms of quadtrees share some common features:
They decompose space into adaptable cells.
Each cell (or bucket) has a maximum capacity. When maximum capacity is reached, the bucket splits.
The tree directory follows the spatial decomposition of the quadtree.
A tree-pyramid (T-pyramid) is a "complete" tree; every node of the T-pyramid has four child nodes except leaf nodes; all leaves are on the same level, the level that corresponds to individual pixels in the image. The data in a tree-pyramid can be stored compactly in an array as an implicit data structure similar to the way a complete binary tree can be stored compactly in an array.
Types
Quadtrees may be classified according to the type of data they represent, including areas, points, lines and curves. Quadtrees may also be classified by whether the shape of the tree is independent of the order in which data is processed. The following are common types of quadtrees.
Region quadtree
The region quadtree represents a partition of space in two dimensions by decomposing the region into four equal quadrants, subquadrants, and so on with each leaf node containing data corresponding to a specific subregion. Each node in the tree either has exactly four children, or has no children (a leaf node). The height of quadtrees that follow this decomposition strategy (i.e. subdividing subquadrants as long as there is interesting data in the subquadrant for which more refinement is desired) is sensitive to and dependent on the spatial distribution of interesting areas in the space being decomposed. The region quadtree is a type of trie.
A region quadtree with a depth of n may be used to represent an image consisting of 2n × 2n pixels, where each pixel value is 0 or 1. The root node represents the entire image region. If the pixels in any region are not entirely 0s or 1s, it is subdivided. In this application, each leaf node represents a block of pixels that are all 0s or all 1s. Note the potential savings in terms of space when these trees are used for storing images; images often have many regions of considerable size that have the same colour value throughout. Rather than store a big 2-D array of every pixel in the image, a quadtree can capture the same information potentially many divisive levels higher than the pixel-resolution sized cells that we would otherwise require. The tree resol |
https://en.wikipedia.org/wiki/Sistema%20Brasileiro%20de%20Televis%C3%A3o | The Sistema Brasileiro de Televisão (; SBT ; "Brazilian Television System") is a Brazilian television network founded on Wednesday, 19 August 1981, by the businessman and television personality Silvio Santos. The company was established after a public tender by the Brazilian Federal Government to form two new networks, created from revoked concessions of the defunct Tupi and Excelsior networks. The SBT was founded on the same day that the concession agreement was signed, and that the act was broadcast live by the network, so that this was his first program aired. Before acquiring the concessions of the four station that were to form the SBT, Grupo Silvio Santos had since 1976 the concession of Rio de Janeiro's channel 11, known as TVS Rio de Janeiro (now SBT Rio), which was a fundamental step to give life to the SBT.
In April 2018, the SBT was the second-most watched television network in Brazil, behind Globo. Throughout its existence, the network always occupied the space in the audience ranking, except between 2007 and 2014, when the Record network took its place. The SBT has a total of 114 broadcast television stations (O&Os and affiliates) throughout the Brazilian territory, and is also available through pay television operators (cable and satellite), free-to-air signal on satellite receivers and also through streaming media in their mobile application (Android, iOS and Windows), applications for smart TVs and its website. Also on their website, its programming is available in video on demand for free, also available from the video-sharing site YouTube since 2010. In March 2017, the 43 channels of the SBT on YouTube accumulated 20 million subscribers and 70 billion minutes watched.
The SBT broadcasts their programming a wide variety of television genres, whereas its own material generally stand adjacent to the entertainment. Foreign programming, mainly the telenovelas produced by the networks owned by the Mexican conglomerate Televisa, are part of their program schedule. It is the only commercial television broadcaster in Brazil which airs children's programming, even arranging a partnership with The Walt Disney Company, in which the company provides two hours of daily programming for the network. The network also possess times for the television news, producing in all three daily newscasts, a weekly news program and a weekly newscast.
The network owns the CDT da Anhanguera, a television complex located at the kilometer 18 of the Rodovia Anhanguera, in Osasco, São Paulo, occupying an area of 231 thousand square meters. This is the third largest television complex in size installed in Latin America, being smaller only that the studios of TV Azteca, in Mexico, and the Estúdios Globo.
History
Before the SBT
Rede Tupi, the channel 4 in São Paulo, began operations in 1950. In 1962 (when he began his first TV program), Silvio Santos produced his own programs on Tupi, TV Paulista and on Rede Globo beginning in 1965. Soon enough, he started plan |
https://en.wikipedia.org/wiki/Cal%20%28command%29 | is a command-line utility on a number of computer operating systems including Unix, Plan 9, Inferno and Unix-like operating systems such as Linux that prints an ASCII calendar of the given month or year. If the user does not specify any command-line options, cal will print a calendar of the current month. The command is a standard program on Unix and specified in the Single UNIX Specification.
Implementations
The cal command was present in 1st Edition Unix. A cal command is also part of ASCII's MSX-DOS2 Tools for MSX-DOS version 2. It is also available for FreeDOS. This implementation only supports the Gregorian calendar (New Style) and may be distributed freely, with or without source. The FreeDOS version was developed by Charles Dye.
Examples
$ cal
March 1984
Su Mo Tu We Th Fr Sa
1 2 3
4 5 6 7 8 9 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
25 26 27 28 29 30 31
$ cal -3 (shows the previous, current and next month)
June 2022 July 2022 August 2022
Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa
1 2 3 4 1 2 1 2 3 4 5 6
5 6 7 8 9 10 11 3 4 5 6 7 8 9 7 8 9 10 11 12 13
12 13 14 15 16 17 18 10 11 12 13 14 15 16 14 15 16 17 18 19 20
19 20 21 22 23 24 25 17 18 19 20 21 22 23 21 22 23 24 25 26 27
26 27 28 29 30 24 25 26 27 28 29 30 28 29 30 31
$ cal 2023
2023
January February March
Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa
1 2 3 4 5 6 7 1 2 3 4 1 2 3 4
8 9 10 11 12 13 14 5 6 7 8 9 10 11 5 6 7 8 9 10 11
15 16 17 18 19 20 21 12 13 14 15 16 17 18 12 13 14 15 16 17 18
22 23 24 25 26 27 28 19 20 21 22 23 24 25 19 20 21 22 23 24 25
29 30 31 26 27 28 26 27 28 29 30 31
April May June
Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa
1 1 2 3 4 5 6 1 2 3
2 3 4 5 6 7 8 7 8 9 10 11 12 13 4 5 6 7 8 9 10
9 10 11 12 13 14 15 14 15 16 17 18 19 20 11 12 13 14 15 16 17
16 17 18 19 20 21 22 21 22 23 24 25 26 27 18 19 20 21 22 23 24
23 24 25 26 27 28 29 28 29 30 31 25 26 27 28 29 30
30
July August September
Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa
1 1 2 3 4 5 1 2
2 3 4 5 6 7 8 6 7 8 9 10 11 12 3 4 5 6 7 8 9
9 10 11 12 13 14 15 13 14 15 16 17 18 19 10 11 12 13 14 15 16
16 17 18 19 20 21 22 20 21 22 23 24 25 26 17 18 19 20 21 22 23
23 24 25 26 27 28 29 27 28 29 30 31 |
https://en.wikipedia.org/wiki/Triple%20M | Triple M is an Australian commercial radio network owned and operated by Southern Cross Austereo. The network consists of 40 radio stations broadcasting a mainstream rock music format and 5 digital radio stations.
The network dates back to the launch of Triple M Sydney in 1980. On 15 December 2016, the network was amalgamated with the LocalWorks network of regional radio stations.
History
The first Triple M station was Triple M Sydney, which commenced broadcasting to Sydney on 2 August 1980. Triple M Sydney and then-rival 2Day FM were the first commercial FM radio stations in Sydney. Throughout the 1980s, Triple M was one of the highest-rating radio stations in Sydney, spearheaded by its morning show presented by Doug Mulray and featuring the writing of and occasional appearances by Andrew Denton. For all of this period and into the 1990s, Triple M's promotional campaign featured the character "Dr Dan", a guitar-playing satyr with wings, inspired by artwork by legendary Australian cartoonist Peter Ledger, and a theme song that was an extended reworking of the Mike Batt track "Introduction (The Journey of a Fool)", from his 1979 album Tarot Suite.
In 1988, Melbourne radio station EON FM (3EON), 92.3 was taken over by Triple M and changed its callsign to Triple M and moved to 105.1 MHz in November 1988. EON FM was Australia's first commercial FM radio station, commencing broadcasting on 11 July 1980.
Brisbane radio station Triple M Brisbane was launched in 1980 and took on the FM104 identity soon after. It returned to the Triple M identity in early 1990. Its callsign has remained 4MMM since its 1980 launch. Triple M Brisbane started broadcasting on 104.1FM, then late in the 1980s changed to its present frequency of 104.5-FM.
Adelaide radio station 5KA converted from 1197 kHz to 104.7 MHz on 1 January 1990 and was renamed KAFM (5KKA). The station was taken over by Village Roadshow, who then owned Triple M, and they successfully negotiated the purchase of the 5MMM callsign from a community radio station in 1993. That station is now known as Three D Radio (5DDD), and the 5MMM callsign is now used by Triple M Adelaide (104.7)
Perth radio station 96FM (6NOW) also carried the Triple M identity and 6MMM callsign in the early 1990s but was then sold to Southern Cross Broadcasting who changed the station's identity back to its original name. Mix 94.5 until December 2020 was "considered" to be a part of the Triple M network in Perth utilising local programming (as opposed to airing networked Triple M programmes) and Mix 94.5 didn’t carry the Triple M brand, logo or call letters.
In Auckland, New Zealand, a Triple M station existed between 1984 and 1988 when 89 Stereo FM became part of Triple M. The station previously used the call sign 1ROQ and changed to 1MMM when becoming part of Triple M. New Zealand no longer uses radio station call signs. This station later reverted to 89FM in 1988 and eventually closed down in 1994.
While many of the comedy a |
https://en.wikipedia.org/wiki/Mobitex | Mobitex is an OSI based open standard, national public access wireless packet-switched data network. Mobitex puts great emphasis on safety and reliability with its use by military, police, firefighters and ambulance services. It was developed in the beginning of the 1980s by the Swedish Televerket Radio. From 1988, the development took place in Eritel, a joint-venture between Ericsson and Televerket, later on as an Ericsson subsidiary. Mobitex became operational in Sweden in 1986.
In the mid-1990s, Mobitex gained consumer popularity by providing two-way paging network services. It was the first wireless network to provide always on, wireless push email services such as RadioMail and Inter@ctive Paging. It is also used by the first model of Research in Motion's BlackBerry, and PDAs such as the Palm VII. During 9/11 and the 2005 hurricane rescue and clean-up operations, Mobitex proved itself to be a very reliable and useful system for first responders.
Mobitex is a packet-switched, narrowband, data-only technology mainly for short burst data. Mobitex channels are 12.5 kHz wide. In North America, Mobitex ran at , while in Europe it uses . The modulation scheme used is GMSK with a slotted aloha protocol at , although user throughput is typically around half of that.
The network provided the first public access wireless data communication services in North America. Subscriber services included electronic messaging with Cc capabilities to multiple recipients, combined with the ability to log on to any wireless or fixed terminal and receive stored mailbox messages.
Mobitex was offered on over 30 networks on five continents. European Mobitex networks almost completely withered in the shadow of the overwhelming success of GSM there in the early 1990s. In Canada, it was first introduced in 1990 by Rogers Cantel, and in 1991 by carrier RAM Mobile Data. In earlier days Mobitex networks in the US were marketed under several names, including RAM Mobile Data, BellSouth Wireless Data, Cingular Wireless and Velocita Wireless following several acquisitions and divestments. Since 2013 the network is operated by American Messaging Services, LLC (AMS) and remains operational.
Mobitex in the UK was marketed by RAM Mobile Data, the UK part of which was purchased from BellSouth (USA) by Twenty First Century Ltd (John Camilleri and Adrian Nicolle) in 2000, that became Transcomm and was then purchased by BT (British Telecom) in 2004. The uses of Mobitex in the United Kingdom were all emergencies (blue light) services, couriers, vehicle telematics (logistics), vending (parking) and vehicle breakdown services (RAC, AA, Green Flag).
All UK ambulance services used the network to dispatch crews and track progress. The London Metropolitan Police used Mobitex to access the police criminal record database whilst in field and in real time, revolutionary at the time. During the 7/7 terrorist attacks in London, the Transcomm Network was the only wireless network which ke |
https://en.wikipedia.org/wiki/David%20S.%20Johnson | David Stifler Johnson (December 9, 1945 – March 8, 2016) was an American computer scientist specializing in algorithms and optimization. He was the head of the Algorithms and Optimization Department of AT&T Labs Research from 1988 to 2013, and was a visiting professor at Columbia University from 2014 to 2016. He was awarded the 2010 Knuth Prize.
Johnson was born in 1945 in Washington, D.C. He graduated summa cum laude from Amherst College in 1967, then earned his S.M. from MIT in 1968 and his Ph.D. from MIT in 1973. All three of his degrees are in mathematics. He was inducted as a Fellow of the Association for Computing Machinery in 1995, and as a member of the National Academy of Engineering in 2016.
He was the coauthor of Computers and Intractability: A Guide to the Theory of NP-Completeness () along with Michael Garey. As of March 9, 2016, his publications have been cited over 96,000 times, and he has an h-index of 78. Johnson died on March 8, 2016, at the age of 70.
See also
NP-completeness
List of computer scientists
List of important publications in computer science
References
External links
David S. Johnson: David S. Johnson, On-Line Encyclopedia of Integer Sequences
1945 births
2016 deaths
American computer scientists
Fellows of the Association for Computing Machinery
Amherst College alumni
Massachusetts Institute of Technology alumni
Theoretical computer scientists
Fellows of the Society for Industrial and Applied Mathematics
Columbia University faculty
Columbia School of Engineering and Applied Science faculty
Knuth Prize laureates
Scientists at Bell Labs
Members of the United States National Academy of Engineering |
https://en.wikipedia.org/wiki/Key%20exchange | Key exchange (also key establishment) is a method in cryptography by which cryptographic keys are exchanged between two parties, allowing use of a cryptographic algorithm.
If the sender and receiver wish to exchange encrypted messages, each must be equipped to encrypt messages to be sent and decrypt messages received. The nature of the equipping they require depends on the encryption technique they might use. If they use a code, both will require a copy of the same codebook. If they use a cipher, they will need appropriate keys. If the cipher is a symmetric key cipher, both will need a copy of the same key. If it is an asymmetric key cipher with the public/private key property, both will need the other's public key.
Channel of exchange
Key exchange is done either in-band or out-of-band.
The key exchange problem
The key exchange problem describes ways to exchange whatever keys or other information are needed for establishing a secure communication channel so that no one else can obtain a copy. Historically, before the invention of public-key cryptography (asymmetrical cryptography), symmetric-key cryptography utilized a single key to encrypt and decrypt messages. For two parties to communicate confidentially, they must first exchange the secret key so that each party is able to encrypt messages before sending, and decrypt received ones. This process is known as the key exchange.
The overarching problem with symmetrical cryptography, or single-key cryptography, is that it requires a secret key to be communicated through trusted couriers, diplomatic bags, or any other secure communication channel. If two parties cannot establish a secure initial key exchange, they won't be able to communicate securely without the risk of messages being intercepted and decrypted by a third party who acquired the key during the initial key exchange.
Public-key cryptography uses a two-key system, consisting of the public and the private keys, where messages are encrypted with one key and decrypted with another. It depends on the selected cryptographic algorithm which key—public or private—is used for encrypting messages, and which for decrypting. For example, in RSA, the private key is used for decrypting messages, while in the Digital Signature Algorithm (DSA), the private key is used for authenticating them. The public key can be sent over non-secure channels or shared in public; the private key is only available to its owner.
Known as the Diffie-Hellman key exchange, the encryption key can be openly communicated as it poses no risk to the confidentiality of encrypted messages. One party exchanges the keys to another party where they can then encrypt messages using the key and send back the cipher text. Only the decryption key—in this case, it's the private key—can decrypt that message. At no time during the Diffie-Hellman key exchange is any sensitive information at risk of compromise, as opposed to symmetrical key exchange.
Identification
In principle, the o |
https://en.wikipedia.org/wiki/MD4 | The MD4 Message-Digest Algorithm is a cryptographic hash function developed by Ronald Rivest in 1990. The digest length is 128 bits. The algorithm has influenced later designs, such as the MD5, SHA-1 and RIPEMD algorithms. The initialism "MD" stands for "Message Digest".
The security of MD4 has been severely compromised. The first full collision attack against MD4 was published in 1995, and several newer attacks have been published since then. As of 2007, an attack can generate collisions in less than 2 MD4 hash operations. A theoretical preimage attack also exists.
A variant of MD4 is used in the ed2k URI scheme to provide a unique identifier for a file in the popular eDonkey2000 / eMule P2P networks. MD4 was also used by the rsync protocol (prior to version 3.0.0).
MD4 is used to compute NTLM password-derived key digests on Microsoft Windows NT, XP, Vista, 7, 8, 10 and 11.
Security
Weaknesses in MD4 were demonstrated by Den Boer and Bosselaers in a paper published in 1991. The first full-round MD4 collision attack was found by Hans Dobbertin in 1995, which took only seconds to carry out at that time. In August 2004, Wang et al. found a very efficient collision attack, alongside attacks on later hash function designs in the MD4/MD5/SHA-1/RIPEMD family. This result was improved later by Sasaki et al., and generating a collision is now as cheap as verifying it (a few microseconds).
In 2008, the preimage resistance of MD4 was also broken by Gaëtan Leurent, with a 2102 attack. In 2010 Guo et al published a 299.7 attack.
In 2011, RFC 6150 stated that RFC 1320 (MD4) is historic (obsolete).
MD4 hashes
The 128-bit (16-byte) MD4 hashes (also termed message digests) are typically represented as 32-digit hexadecimal numbers. The following demonstrates a 43-byte ASCII input and the corresponding MD4 hash:
MD4("The quick brown fox jumps over the lazy og")
= 1bee69a46ba811185c194762abaeae90
Even a small change in the message will (with overwhelming probability) result in a completely different hash, e.g. changing d to c:
MD4("The quick brown fox jumps over the lazy og")
= b86e130ce7028da59e672d56ad0113df
The hash of the zero-length string is:
MD4("") = 31d6cfe0d16ae931b73c59d7e0c089c0
MD4 test vectors
The following test vectors are defined in RFC 1320 (The MD4 Message-Digest Algorithm)
MD4 ("") = 31d6cfe0d16ae931b73c59d7e0c089c0
MD4 ("a") = bde52cb31de33e46245e05fbdbd6fb24
MD4 ("abc") = a448017aaf21d8525fc10ae87aa6729d
MD4 ("message digest") = d9130a8164549fe818874806e1c7014b
MD4 ("abcdefghijklmnopqrstuvwxyz") = d79e1c308aa5bbcdeea8ed63df412da9
MD4 ("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789") = 043f8582f241db351ce627e153e7f0e4
MD4 ("12345678901234567890123456789012345678901234567890123456789012345678901234567890") = e33b4ddc9c38f2199c3e7b164fcc0536
MD4 collision example
Let:
k1 = 839c7a4d7a92cb678a5d59eea5a7573c8a74deb366c3dc20a083b69f5d2a3bb3719dc69891e9f95e809fd7e8b23ba6318ed45e51fe39708bf9427e9c3e8b9
k2 |
https://en.wikipedia.org/wiki/SAF | SAF, S.A.F or saf might refer to:
Companies
SAF Tehnika, a producer of digital microwave data transmission equipment
Strip Art Features, a comic book publishing house
Svenska Automobilfabriken, a Swedish auto manufacturer
Computing
Service Availability Forum, (SAF or SA Forum), highly available systems model
Storage Access Framework
Law enforcement
Special Action Force, of the Philippine National Police
Locations
Santa Fe Regional Airport, IATA code SAF
South Africa, UNDP country code SAF
Military
Secretary of the Air Force
Singapore Armed Forces
Slovenian Armed Forces
Somali Air Force
Somali Armed Forces
Spanish Air Force
Spanish Armed Forces
Sudanese Air Force
Sudanese Armed Forces
Swedish Air Force
Swedish Armed Forces
Soviet Air Force
Swiss Air Force
Organizations
Second Amendment Foundation, a US gun rights organization
Škola Animiranog Filma (ŠAF), a Croatian school of animation
Société astronomique de France, astronomical society
Society of American Foresters
Students for Academic Freedom, hosted by the David Horowitz Freedom Center
Swedish Employers Association ()
Other
Sociedade Anônima do Futebol, a type of public limited company in Brazil
System access fee, a Canadian telephone surcharge
Sustainable aviation fuel
Sir Alex Ferguson, a Scottish former football manager
Salfords railway station, a railway station in Surrey, England |
https://en.wikipedia.org/wiki/Loop%20invariant | In computer science, a loop invariant is a property of a program loop that is true before (and after) each iteration. It is a logical assertion, sometimes checked with a code assertion. Knowing its invariant(s) is essential in understanding the effect of a loop.
In formal program verification, particularly the Floyd-Hoare approach, loop invariants are expressed by formal predicate logic and used to prove properties of loops and by extension algorithms that employ loops (usually correctness properties).
The loop invariants will be true on entry into a loop and following each iteration, so that on exit from the loop both the loop invariants and the loop termination condition can be guaranteed.
From a programming methodology viewpoint, the loop invariant can be viewed as a more abstract specification of the loop, which characterizes the deeper purpose of the loop beyond the details of this implementation. A survey article covers fundamental algorithms from many areas of computer science (searching, sorting, optimization, arithmetic etc.), characterizing each of them from the viewpoint of its invariant.
Because of the similarity of loops and recursive programs, proving partial correctness of loops with invariants is very similar to proving the correctness of recursive programs via induction. In fact, the loop invariant is often the same as the inductive hypothesis to be proved for a recursive program equivalent to a given loop.
Informal example
The following C subroutine max() returns the maximum value in its argument array a[], provided its length n is at least 1.
Comments are provided at lines 3, 6, 9, 11, and 13. Each comment makes an assertion about the values of one or more variables at that stage of the function.
The highlighted assertions within the loop body, at the beginning and end of the loop (lines 6 and 11), are exactly the same. They thus describe an invariant property of the loop.
When line 13 is reached, this invariant still holds, and it is known that the loop condition i!=n from line 5 has become false. Both properties together imply that m equals the maximum value in a[0...n-1], that is, that the correct value is returned from line 14.
int max(int n, const int a[]) {
int m = a[0];
// m equals the maximum value in a[0...0]
int i = 1;
while (i != n) {
// m equals the maximum value in a[0...i-1]
if (m < a[i])
m = a[i];
// m equals the maximum value in a[0...i]
++i;
// m equals the maximum value in a[0...i-1]
}
// m equals the maximum value in a[0...i-1], and i==n
return m;
}
Following a defensive programming paradigm, the loop condition i!=n in line 5 should better be modified to i<n, in order to avoid endless looping for illegitimate negative values of n. While this change in code intuitively shouldn't make a difference, the reasoning leading to its correctness becomes somewhat more complicated, since then only i>=n is known in line 13. In order to |
https://en.wikipedia.org/wiki/Class%20invariant | In computer programming, specifically object-oriented programming, a class invariant (or type invariant) is an invariant used for constraining objects of a class. Methods of the class should preserve the invariant. The class invariant constrains the state stored in the object.
Class invariants are established during construction and constantly maintained between calls to public methods. Code within functions may break invariants as long as the invariants are restored before a public function ends. With concurrency, maintaining the invariant in methods typically requires a critical section to be established by locking the state using a mutex.
An object invariant, or representation invariant, is a computer programming construct consisting of a set of invariant properties that remain uncompromised regardless of the state of the object. This ensures that the object will always meet predefined conditions, and that methods may, therefore, always reference the object without the risk of making inaccurate presumptions. Defining class invariants can help programmers and testers to catch more bugs during software testing.
Class invariants and inheritance
The useful effect of class invariants in object-oriented software is enhanced in the presence of inheritance. Class invariants are inherited, that is, "the invariants of all the parents of a class apply to the class itself."
Inheritance can allow descendant classes to alter implementation data of parent classes, so it would be possible for a descendant class to change the state of instances in a way that made them invalid from the viewpoint of the parent class. The concern for this type of misbehaving descendant is one reason object-oriented software designers give for favoring composition over inheritance (i.e., inheritance breaks encapsulation).
However, because class invariants are inherited, the class invariant for any particular class consists of any invariant assertions coded immediately on that class in conjunction with all the invariant clauses inherited from the class's parents. This means that even though descendant classes may have access to the implementation data of their parents, the class invariant can prevent them from manipulating those data in any way that produces an invalid instance at runtime.
Programming language support
Assertions
Common programming languages like Python, PHP, JavaScript, C++ and Java support assertions by default, which can be used to define class invariants. A common pattern to implement invariants in classes is for the constructor of the class to throw an exception if the invariant is not satisfied. Since methods preserve the invariants, they can assume the validity of the invariant and need not explicitly check for it.
Native support
The class invariant is an essential component of design by contract. So, programming languages that provide full native support for design by contract, such as Eiffel, Ada, and D, will also provide full support for class i |
https://en.wikipedia.org/wiki/Addition%20chain | In mathematics, an addition chain for computing a positive integer can be given by a sequence of natural numbers starting with 1 and ending with , such that each number in the sequence is the sum of two previous numbers. The length of an addition chain is the number of sums needed to express all its numbers, which is one less than the cardinality of the sequence of numbers.
Examples
As an example: (1,2,3,6,12,24,30,31) is an addition chain for 31 of length 7, since
2 = 1 + 1
3 = 2 + 1
6 = 3 + 3
12 = 6 + 6
24 = 12 + 12
30 = 24 + 6
31 = 30 + 1
Addition chains can be used for addition-chain exponentiation. This method allows exponentiation with integer exponents to be performed using a number of multiplications equal to the length of an addition chain for the exponent. For instance, the addition chain for 31 leads to a method for computing the 31st power of any number using only seven multiplications, instead of the 30 multiplications that one would get from repeated multiplication, and eight multiplications with exponentiation by squaring:
2 = ×
3 = 2 ×
6 = 3 × 3
12 = 6 × 6
24 = 12 × 12
30 = 24 × 6
31 = 30 ×
Methods for computing addition chains
Calculating an addition chain of minimal length is not easy; a generalized version of the problem, in which one must find a chain that simultaneously forms each of a sequence of values, is NP-complete. There is no known algorithm which can calculate a minimal addition chain for a given number with any guarantees of reasonable timing or small memory usage. However, several techniques are known to calculate relatively short chains that are not always optimal.
One very well known technique to calculate relatively short addition chains is the binary method, similar to exponentiation by squaring. In this method, an addition chain for the number is obtained recursively, from an addition chain for . If is even, it can be obtained in a single additional sum, as . If is odd, this method uses two sums to obtain it, by computing and then adding one.
The factor method for finding addition chains is based on the prime factorization of the number to be represented. If has a number as one of its prime factors, then an addition chain for can be obtained by starting with a chain for , and then concatenating onto it a chain for , modified by multiplying each of its numbers by . The ideas of the factor method and binary method can be combined into Brauer's m-ary method by choosing any number (regardless of whether it divides ), recursively constructing a chain for , concatenating a chain for (modified in the same way as above) to obtain , and then adding the remainder. Additional refinements of these ideas lead to a family of methods called sliding window methods.
Chain length
Let denote the smallest so that there exists an addition chain
of length which computes .
It is known that
,
where is the Hamming weight (the number of ones) of the binary expansion of .
One can obtain an addition chain for fr |
https://en.wikipedia.org/wiki/DKE | DKE may refer to:
DKE Records, a record label associated with Hall & Oates
Data & Knowledge Engineering, an academic journal
Delta Kappa Epsilon, an American student organization
German Commission for Electrotechnical, Electronic & Information Technologies of DIN and VDE, a German standards organization
Dresden-Kemnitz station (DS100 code), a railway station in Dresden, Germany
, a brand of early , a type of radio
Department of Data Science and Knowledge Engineering, at Maastricht University, Netherlands
Dihakho Station (station code), a railway station in Assam, India
Jubilee Airways (ICAO code), a British airline |
https://en.wikipedia.org/wiki/Transition-minimized%20differential%20signaling | Transition-minimized differential signaling (TMDS) is a technology for transmitting high-speed serial data used by the DVI and HDMI video interfaces, as well as by other digital communication interfaces.
The transmitter incorporates an advanced coding algorithm which reduces electromagnetic interference over copper cables and enables robust clock recovery at the receiver to achieve high skew tolerance for driving longer cables as well as shorter low-cost cables.
Coding
The method is a form of 8b/10b encoding but using a code-set that differs from the original IBM form. A two-stage process converts an input of 8 bits into a 10 bit code with particular desirable properties. In the first stage, the first bit is untransformed and each subsequent bit is either XOR or XNOR transformed against the previous bit. The encoder chooses between XOR and XNOR by determining which will result in the fewest transitions; the ninth bit encodes which operation was used. In the second stage, the first eight bits are optionally inverted to even out the balance of ones and zeros and therefore the sustained average DC level; the tenth bit encodes whether this inversion took place.
The 10-bit TMDS symbol can represent either an 8-bit data value during normal data transmission, or 2 bits of control signals during screen blanking. Of the 1,024 possible combinations of the 10 transmitted bits:
460 combinations are used to represent an 8-bit data value, as most of the 256 possible values have two encoded variants (some values have only one),
4 combinations are used to represent 2 bits of control signals (C0 and C1 in the table below); unlike the data symbols these have such properties that they can be reliably recognized even if sync is lost and are therefore also used for synchronizing the decoder,
2 combinations are used as a guard band before HDMI data,
558 remaining combinations are reserved and forbidden.
Control data is encoded using the values in the table below. Control data characters are designed to have a large number (7) of transitions to help the receiver synchronize its clock with the transmitter clock.
On Channel 0 the C0 and C1 bits encode the Horizontal synchronization (HSync) and Vertical synchronization (VSync) signals. On the other channels they encode the CTL0 through CTL3 signals which are unused by DVI but in the case of HDMI are used as a preamble indicating the type of data about to be transferred (Video Data or Data Island), the HDCP status and so on.
TMDS was developed by Silicon Image Inc. as a member of the Digital Display Working Group.
TMDS is similar to low-voltage differential signaling (LVDS) in that it uses differential signaling to reduce electromagnetic interference (EMI) which allows faster signal transfers with increased accuracy. TMDS also uses a twisted pair for noise reduction, rather than coaxial cable that is conventional for carrying video signals. Like LVDS, the data is transmitted serially over the data link. When |
https://en.wikipedia.org/wiki/Pollard%27s%20p%20%E2%88%92%201%20algorithm | Pollard's p − 1 algorithm is a number theoretic integer factorization algorithm, invented by John Pollard in 1974. It is a special-purpose algorithm, meaning that it is only suitable for integers with specific types of factors; it is the simplest example of an algebraic-group factorisation algorithm.
The factors it finds are ones for which the number preceding the factor, p − 1, is powersmooth; the essential observation is that, by working in the multiplicative group modulo a composite number N, we are also working in the multiplicative groups modulo all of Ns factors.
The existence of this algorithm leads to the concept of safe primes, being primes for which p − 1 is two times a Sophie Germain prime q and thus minimally smooth. These primes are sometimes construed as "safe for cryptographic purposes", but they might be unsafe — in current recommendations for cryptographic strong primes (e.g. ANSI X9.31), it is necessary but not sufficient that p − 1 has at least one large prime factor. Most sufficiently large primes are strong; if a prime used for cryptographic purposes turns out to be non-strong, it is much more likely to be through malice than through an accident of random number generation. This terminology is considered obsolete by the cryptography industry: the ECM factorization method is more efficient that Pollard's algorithm and finds safe prime factors just as quickly as it finds non-safe prime factors of similar size, thus the size of p is the key security parameter, not the smoothness of p-1.
Base concepts
Let n be a composite integer with prime factor p. By Fermat's little theorem, we know that for all integers a coprime to p and for all positive integers K:
If a number x is congruent to 1 modulo a factor of n, then the will be divisible by that factor.
The idea is to make the exponent a large multiple of p − 1 by making it a number with very many prime factors; generally, we take the product of all prime powers less than some limit B. Start with a random x, and repeatedly replace it by as w runs through those prime powers. Check at each stage, or once at the end if you prefer, whether is not equal to 1.
Multiple factors
It is possible that for all the prime factors p of n, p − 1 is divisible by small primes, at which point the Pollard p − 1 algorithm simply returns n.
Algorithm and running time
The basic algorithm can be written as follows:Inputs: n: a composite numberOutput''': a nontrivial factor of n or failure
select a smoothness bound B define (note: explicitly evaluating M may not be necessary)
randomly pick a coprime to n (note: we can actually fix a, e.g. if n is odd, then we can always select a = 2, random selection here is not imperative)
compute (note: exponentiation can be done modulo n)
if then return g if then select a larger B and go to step 2 or return failure
if then select a smaller B and go to step 2 or return failure
If in step 6, this indicates there are no prime factors p for which |
https://en.wikipedia.org/wiki/Monad%20%28functional%20programming%29 | In functional programming, a monad is a structure that combines program fragments (functions) and wraps their return values in a type with additional computation. In addition to defining a wrapping monadic type, monads define two operators: one to wrap a value in the monad type, and another to compose together functions that output values of the monad type (these are known as monadic functions). General-purpose languages use monads to reduce boilerplate code needed for common operations (such as dealing with undefined values or fallible functions, or encapsulating bookkeeping code). Functional languages use monads to turn complicated sequences of functions into succinct pipelines that abstract away control flow, and side-effects.
Both the concept of a monad and the term originally come from category theory, where a monad is defined as a functor with additional structure. Research beginning in the late 1980s and early 1990s established that monads could bring seemingly disparate computer-science problems under a unified, functional model. Category theory also provides a few formal requirements, known as the monad laws, which should be satisfied by any monad and can be used to verify monadic code.
Since monads make semantics explicit for a kind of computation, they can also be used to implement convenient language features. Some languages, such as Haskell, even offer pre-built definitions in their core libraries for the general monad structure and common instances.
Overview
"For a monad m, a value of type m a represents having access to a value of type a within the context of the monad." —C. A. McCann
More exactly, a monad can be used where unrestricted access to a value is inappropriate for reasons specific to the scenario. In the case of the Maybe monad, it is because the value may not exist. In the case of the IO monad, it is because the value may not be known yet, such as when the monad represents user input that will only be provided after a prompt is displayed. In all cases the scenarios in which access makes sense are captured by the bind operation defined for the monad; for the Maybe monad a value is bound only if it exists, and for the IO monad a value is bound only after the previous operations in the sequence have been performed.
A monad can be created by defining a type constructor M and two operations:
return :: a -> M a (often also called unit), which receives a value of type a and wraps it into a monadic value of type M a, and
bind :: (M a) -> (a -> M b) -> (M b) (typically represented as >>=), which receives a function f over type a and can transform monadic values M a applying f to the unwrapped value a, returning a monadic value M b.
(An alternative but equivalent construct using the join function instead of the bind operator can be found in the later section .)
With these elements, the programmer composes a sequence of function calls (a "pipeline") with several bind operators chained together in an expression. Each fu |
https://en.wikipedia.org/wiki/Radio%20Mirchi | Radio Mirchi ("Mirchi" in Hindi meaning red chilli), also known as 98.3 Mirchi, is a nationwide network of private FM radio stations in India. It is owned by the EntertainmentNetwork India Ltd (ENIL), which is one of the subsidiaries of The Times Group. The tagline of Radio Mirchi is "Mirchi Sunnewaale Always Khush!" ("Mirchi Listeners are Always Happy!"). It is the first privately owned radio station in India.
Radio Mirchi maintains weekly music charts, or record charts, for India. The most followed charts are Mirchi Top 20 (Bollywood Songs, now celebrities select their favourites) and Indie Pop 10 (Independent Music). Both of these charts are a ranking of recorded music according to popularity. These charts are published on a weekly basis in the Indian English-language daily newspaper, The Times of India, and on Radio Mirchi's official website.
Mirchi has its stations in India and also in GCC countries: UAE, Qatar, and Bahrain.
As per the latest IRS data released in 2017, Radio Mirchi has emerged as the number one FM broadcaster in Delhi and Mumbai, as well as in the top 8 metros taken together.
History
The original avatar of Radio Mirchi was Times FM. Radio Mirchi began operations in 1993 in Indore, Madhya Pradesh. Until 1993, All India Radio or AIR, a government undertaking, was the only radio broadcaster in India. The government then took the initiative to privatize the radio broadcasting sector. It sold airtime blocks on its FM channels in Indore, Hyderabad, Mumbai, Delhi, Kolkata, Varanasi, Visakhapatnam and Goa to private operators, who developed their own program content. The Times Group operated its brand, Times FM, till June 1998. After that, the government decided not to renew contracts given to private operators.
First round of licenses
In 2000, the government announced the auction of 108 FM frequencies across India. ENIL won the largest number of frequencies, and thus started its operations under the brand name Radio Mirchi.
Second round of licences
In January 2006, Radio Mirchi purchased 25 frequencies in the second wave of licences that were issued by the Government of India. This pushes the Radio Mirchi presence in 32 centres. In the first wave of launches, Indore was the first city in India having grade of first private radio channel. Times decided to start radio channel to address the mass audience as advertisers can be attracted by showing a low cost per thousand.
Third round of licenses
Radio Mirchi invested above Rs.339 crore during phase III auctions and purchased 17 new channels in new cities such as Chandigarh, Kochi, Kozhikode, Jammu, Srinagar, Guwahati and Shillong, as well as in existing cities such as Bangalore, Hyderabad, Ahmedabad, Pune, Kanpur, Lucknow, Jaipur, Nagpur and Surat. This pushes Radio Mirchi presence in 49 centres.
GCC countries expansion
Radio Mirchi started operations across UAE, streaming across three frequencies : 97.3FM in Abu Dhabi, 88.8FM in Dubai and the Northern Emirates and 95.6FM in |
https://en.wikipedia.org/wiki/Radio%20Print%20Handicapped%20Network | RPH Australia is the national peak representative organisation for a unique Australian network of radio reading services designed to meet the daily information needs of people who, for any reason, are unable to access printed material. It is estimated that 22% of the Australian population has a print disability (over 5 million).
History
Historically, RPH stood for "Radio for the Print Handicapped", and these services began in Australia in 1975 on Melbourne's 3ZZ.
On 23 July 1978, the Minister for Post and Telecommunications announced, "The establishment of a special radio communications service for the blind and other people with reading difficulties."
The federal government began its direct funding of the service with a $250,000 grant in the 1981–82 budget.
Initially using marine band (today's extended AM broadcast band) frequencies, stations in Hobart, Melbourne, and Sydney began operating. 7RPH Hobart went to air in June 1982. 3RPH Melbourne was officially opened in December the same year.
By 1984–85, RPH services were also operating in Brisbane and Canberra. After another review, the specialised stations of the service transferred to normal broadcast band frequencies in 1990 and 1991.
Material from the network is heard on a small number of non-network community stations in Australia and on the Radio Reading Service of New Zealand.
In December 2013, all RPH Australia network stations joined the new VAST satellite platform.
RPH Australia Radio Reading Network Stations
Radio 1RPH
Canberra: 1125 kHz AM and DAB+
Wagga Wagga: 89.5 MHz FM
Junee: 99.5 FM (retransmission by Junee Shire Council)
Internet stream:
Australia: Viewer Access Satellite Television, radio channel 632
2RPH
Sydney: 1224 kHz AM and DAB+
Sydney Eastern Suburbs: 100.5 MHz FM and DAB+
Newcastle: 100.5 MHz FM
Wollongong: 93.3 MHz FM
Australia: Viewer Access Satellite Television, radio channel 632
4RPH
Brisbane: 1296 kHz AM and DAB+
Australia: Viewer Access Satellite Television, radio channel 632
Vision Australia Radio (3RPH)
Albury: 2APH 101.7 MHz FM
Bendigo: 3BPH 88.7 MHz FM
Darwin, Northern Territory: 3RPH DAB+
Geelong: 3GPH 99.5 kHz FM
Melbourne: 3RPH 1179 kHz AM and DAB+
Mildura: 3MPH 107.5 MHz FM
Shepparton: 3SPH 100.1 MHz FM
Warragul: 3RPH 93.5 MHz FM
Warrnambool: 3RPH 882 kHz AM
Australia & New Zealand: Optus Aurora, radio channel 12 (Melbourne feed)?? VAST
Australia: Viewer Access Satellite Television, radio channel 632
5RPH
Adelaide: 1197 kHz AM and DAB+
Australia: Viewer Access Satellite Television, radio channel 632
990 Vision Australia Radio, Perth (6RPH)
Perth: 990 kHz AM and DAB+
Australia: Viewer Access Satellite Television, radio channel 632
Print Radio Tasmania (7RPH)
Hobart: 864 kHz AM and DAB+
Launceston: 106.9 MHz FM
Devonport: 96.1 MHz FM
Australia: Viewer Access Satellite Television, radio channel 632
NDIS
In February 2016, funding from the National Disability Insurance Scheme (NDIS) was called into question after July 2016, with 1RPH being |
https://en.wikipedia.org/wiki/Levinthal%27s%20paradox | Levinthal's paradox is a thought experiment in the field of computational protein structure prediction where an algorithmic search for a minimum energy configuration is vastly slower than the actual process by which stable configurations are reached in protein folding.
History
In 1969, Cyrus Levinthal noted that, because of the very large number of degrees of freedom in an unfolded polypeptide chain, the molecule has an astronomical number of possible conformations. An estimate of 10300 was made in one of his papers (often incorrectly cited as the 1968 paper). For example, a polypeptide of 100 residues will have 99 peptide bonds, and therefore 198 different phi and psi bond angles. If each of these bond angles can be in one of three stable conformations, the protein may misfold into a maximum of 3198 different conformations (including any possible folding redundancy). Therefore, if a protein were to attain its correctly folded configuration by sequentially sampling all the possible conformations, it would require a time longer than the age of the universe to arrive at its correct native conformation. This is true even if conformations are sampled at rapid (nanosecond or picosecond) rates. The "paradox" is that most small proteins fold spontaneously on a millisecond or even microsecond time scale. The solution to this paradox has been established by computational approaches to protein structure prediction.
Levinthal himself was aware that proteins fold spontaneously and on short timescales. He suggested that the paradox can be resolved if "protein folding is sped up and guided by the rapid formation of local interactions which then determine the further folding of the peptide; this suggests local amino acid sequences which form stable interactions and serve as nucleation points in the folding process". Indeed, the protein folding intermediates and the partially folded transition states were experimentally detected, which explains the fast protein folding. This is also described as protein folding directed within funnel-like energy landscapes. Some computational approaches to protein structure prediction have sought to identify and simulate the mechanism of protein folding.
Levinthal also suggested that the native structure might have a higher energy, if the lowest energy was not kinetically accessible. An analogy is a rock tumbling down a hillside that lodges in a gully rather than reaching the base.
Suggested explanations
According to Edward Trifonov and Igor Berezovsky, the proteins fold by subunits (modules) of the size of 25–30 amino acids.
See also
Chaperone proteins that assist other proteins in folding or unfolding
Folding funnel
Anfinsen's dogma
References
External links
http://www-wales.ch.cam.ac.uk/~mark/levinthal/levinthal.html
https://www.wired.com/wired/archive/9.07/blue_pr.html
https://web.archive.org/web/20041011182039/http://www.sdsc.edu/~nair/levinthal.html
Protein structure
Physical paradoxes
Thought experiments |
https://en.wikipedia.org/wiki/Sinclair%20QDOS | QDOS is the multitasking operating system found on the Sinclair QL personal computer and its clones. It was designed by Tony Tebby whilst working at Sinclair Research, as an in-house alternative to 68K/OS, which was later cancelled by Sinclair, but released by original authors GST Computer Systems. Its name is not regarded as an acronym and sometimes written as Qdos in official literature (see also the identically pronounced word kudos).
QDOS was implemented in Motorola 68000 assembly language, and on the QL, resided in 48 KB of ROM, consisting of either three 16 KB EPROM chips or one 32 KB and one 16 KB ROM chip. These ROMs also held the SuperBASIC interpreter, an advanced variant of BASIC programming language with structured programming additions. This also acted as the QDOS command-line interpreter.
Facilities provided by QDOS included management of processes (or "jobs" in QDOS terminology), memory allocation, and an extensible "redirectable I/O system", providing a generic framework for filesystems and device drivers. Very basic screen window functionality was also provided. This, and several other features, were never fully implemented in the released versions of QDOS, but were improved in later extensions to the operating system produced by Tebby's own company, QJUMP.
Rewritten, enhanced versions of QDOS were also developed, including Laurence Reeves' Minerva and Tebby's SMS2 and SMSQ/E. The last is the most modern variant and is still being improved.
Versions
QDOS versions were identified by numerical version numbers. However, the QL firmware ROMs as a whole (including SuperBASIC) were given two- or three-letter alphabetic identifiers (returned by the SuperBASIC function VER$).
The following version of QDOS were released (dates are estimated first customer shipments):
0.08: the last pre-production version.
1.00: corresponded to the FB version QL ROMs, released in April 1984.
1.01: corresponded to the PM version ROMs. This was faster and had improved Microdrive support.
1.02: corresponded to the AH ROM version released in June 1984. This fixed many bugs and was the first ROM version to be produced in quantity.
1.03: included in ROM versions JM and TB; a minor bug-fix release issued in late 1984.
1.10: corresponded to the JS and JSU (US export version) ROMs, released in early 1985. This was the last version used in QLs manufactured for the UK market.
1.13: corresponding to the MGx series of ROM versions for European export markets. Included a significant number of bug fixes. The following localised versions of the MG firmware are known to exist:
MGE: Spanish
MGF: French
MGG: German
MGI: Italian
MGS: Swedish
The localised versions of QDOS were identified by the "." in the version number being replaced by the ROM version suffix letter used to identify the territory, e.g. the MGE ROMs contained QDOS version 1E13. All MG firmware versions shared the same bottom 32 KB ROM chip. Qdos 1.13 was also reported to be included in |
https://en.wikipedia.org/wiki/Hawk-Eye | Hawk-Eye is a computer vision system used in numerous sports such as cricket, tennis, Gaelic football, badminton, hurling, rugby union, association football and volleyball, to visually track the trajectory of the ball and display a profile of its statistically most likely path as a moving image. The onscreen representation of the trajectory results is called Shot Spot.
The Sony-owned Hawk-Eye system was developed in the United Kingdom by Paul Hawkins. The system was originally implemented in 2000 for television purposes in cricket. The system works via six (sometimes seven) high-performance cameras, normally positioned on the underside of the stadium roof, which track the ball from different angles. The video from the six cameras is then triangulated and combined to create a three-dimensional representation of the ball's trajectory. Hawk-Eye is not infallible, but is advertised to be accurate to within 3.6 millimetres and generally trusted as an impartial second opinion in sports. It has been accepted by governing bodies in tennis, cricket and association football as a means of adjudication with different number of cameras depending on the sport. Hawk-Eye is used for the Challenge System since 2006 in tennis and Decision Review System in cricket since 2009. The system was rolled out for the 2013–14 Premier League season as a means of goal-line technology. In December 2014, it was also adopted for the 2015–16 Bundesliga season.
Method of operation
All Hawk-Eye systems are based on the principles of triangulation using visual images and timing data provided by a number of high-speed video cameras located at different locations and angles around the area of play. For tennis there are 10 cameras. The system rapidly processes the video feeds from the cameras and ball tracker. A data store contains a predefined model of the playing area and includes data on the rules of the game.
In each frame sent from each camera, the system identifies the group of pixels which corresponds to the image of the ball. It then calculates for each frame the position of the ball by comparing its position on at least two of the physically separate cameras at the same instant in time. A succession of frames builds up a record of the path along which the ball has travelled. It also "predicts" the future flight path of the ball and where it will interact with any of the playing area features already programmed into the database. The system can also interpret these interactions to decide infringements of the rules of the game.
The system generates a graphic image of the ball path and playing area, which means that information can be provided to judges, television viewers or coaching staff in near real-time.
The tracking system is combined with a back-end database and archiving capabilities so that it is possible to extract and analyse trends and statistics about individual players, games, ball-to-ball comparisons, etc.
History
Hawk-Eye was developed in 2000 by engineers a |
https://en.wikipedia.org/wiki/Data%20center | A data center (American English) or data centre (Commonwealth English) is a building, a dedicated space within a building, or a group of buildings used to house computer systems and associated components, such as telecommunications and storage systems.
Since IT operations are crucial for business continuity, it generally includes redundant or backup components and infrastructure for power supply, data communication connections, environmental controls (e.g., air conditioning, fire suppression), and various security devices. A large data center is an industrial-scale operation using as much electricity as a small town. Estimated global data center electricity consumption in 2022 was 240-340 TWh, or roughly 1-1.3% of global electricity demand. This excludes energy used for cryptocurrency mining, which was estimated to be around 110 TWh in 2022, or another 0.4% of global electricity demand.
Data centers can vary widely in terms of size, power requirements, redundancy, and overall structure. Four common categories used to segment types of data centers are onsite data centers, colocation facilities, hyperscale data centers, and edge data centers.
History
Data centers have their roots in the huge computer rooms of the 1940s, typified by ENIAC, one of the earliest examples of a data center. Early computer systems, complex to operate and maintain, required a special environment in which to operate. Many cables were necessary to connect all the components, and methods to accommodate and organize these were devised such as standard racks to mount equipment, raised floors, and cable trays (installed overhead or under the elevated floor). A single mainframe required a great deal of power and had to be cooled to avoid overheating. Security became important – computers were expensive, and were often used for military purposes. Basic design guidelines for controlling access to the computer room were therefore devised.
During the boom of the microcomputer industry, and especially during the 1980s, users started to deploy computers everywhere, in many cases with little or no care about operating requirements. However, as information technology (IT) operations started to grow in complexity, organizations grew aware of the need to control IT resources. The availability of inexpensive networking equipment, coupled with new standards for the network structured cabling, made it possible to use a hierarchical design that put the servers in a specific room inside the company. The use of the term data center, as applied to specially designed computer rooms, started to gain popular recognition about this time.
The boom of data centers came during the dot-com bubble of 1997–2000. Companies needed fast Internet connectivity and non-stop operation to deploy systems and to establish a presence on the Internet. Installing such equipment was not viable for many smaller companies. Many companies started building very large facilities, called internet data centers (IDCs), w |
https://en.wikipedia.org/wiki/Computer%20room | Computer room may refer to:
Computer lab
Data center, a facility used to house computer systems
Internet cafe, a public place where people can access Internet
Server room, a room that houses computer servers
Telecentre, a public place in developing countries where people can access Internet
or, a room in a building (especially, a house or apartment) set-up around the use of a personal computer; an office. |
https://en.wikipedia.org/wiki/Dimensionality%20reduction | Dimensionality reduction, or dimension reduction, is the transformation of data from a high-dimensional space into a low-dimensional space so that the low-dimensional representation retains some meaningful properties of the original data, ideally close to its intrinsic dimension. Working in high-dimensional spaces can be undesirable for many reasons; raw data are often sparse as a consequence of the curse of dimensionality, and analyzing the data is usually computationally intractable (hard to control or deal with). Dimensionality reduction is common in fields that deal with large numbers of observations and/or large numbers of variables, such as signal processing, speech recognition, neuroinformatics, and bioinformatics.
Methods are commonly divided into linear and nonlinear approaches. Approaches can also be divided into feature selection and feature extraction. Dimensionality reduction can be used for noise reduction, data visualization, cluster analysis, or as an intermediate step to facilitate other analyses.
Feature selection
Feature selection approaches try to find a subset of the input variables (also called features or attributes). The three strategies are: the filter strategy (e.g. information gain), the wrapper strategy (e.g. search guided by accuracy), and the embedded strategy (selected features are added or removed while building the model based on prediction errors).
Data analysis such as regression or classification can be done in the reduced space more accurately than in the original space.
Feature projection
Feature projection (also called feature extraction) transforms the data from the high-dimensional space to a space of fewer dimensions. The data transformation may be linear, as in principal component analysis (PCA), but many nonlinear dimensionality reduction techniques also exist. For multidimensional data, tensor representation can be used in dimensionality reduction through multilinear subspace learning.
Principal component analysis (PCA)
The main linear technique for dimensionality reduction, principal component analysis, performs a linear mapping of the data to a lower-dimensional space in such a way that the variance of the data in the low-dimensional representation is maximized. In practice, the covariance (and sometimes the correlation) matrix of the data is constructed and the eigenvectors on this matrix are computed. The eigenvectors that correspond to the largest eigenvalues (the principal components) can now be used to reconstruct a large fraction of the variance of the original data. Moreover, the first few eigenvectors can often be interpreted in terms of the large-scale physical behavior of the system, because they often contribute the vast majority of the system's energy, especially in low-dimensional systems. Still, this must be proven on a case-by-case basis as not all systems exhibit this behavior. The original space (with dimension of the number of points) has been reduced (with data loss, but ho |
https://en.wikipedia.org/wiki/Bart%20of%20Darkness | "Bart of Darkness" is the first episode of the sixth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on September 4, 1994. In the episode, Bart breaks his leg and becomes increasingly isolated in his room. Spying on Ned Flanders from his room, Bart suspects that Ned has murdered his wife. The episode was produced during the 1994 Northridge earthquake, which delayed production by a month, and is largely a parody of the Alfred Hitchcock film Rear Window.
The episode was written by Dan McGrath, and directed by Jim Reardon.
Plot
Bart and Lisa persuade Homer to buy a swimming pool for their house during a heatwave. During a pool party, Bart breaks his leg attempting to dive in the pool from the tree house. After a hospital visit, Bart is ordered to spend the rest of the Summer wearing a full cast over his broken leg, leaving him unable to swim in the pool or socialize with any of the other children. To cheer him up, Lisa gets Bart a telescope, which he uses to spy on other town residents. Bart becomes gradually more concerned about his next door neighbor Ned Flanders after he first hears a womanly scream from his house and later witnesses Ned digging a grave in the backyard, expressing remorse that he's become a "murderer". The next day, Bart overhears Ned telling his sons Rod and Todd that their mother is "with God" and they will soon join her. All of this leads Bart to believe that Ned has secretly murdered his wife Maude and is now planning to do the same to their children.
Meanwhile, Lisa revels in her newfound popularity with the schoolkids as a direct result of the swimming pool, which proves to be short-lived when the other children abandon her in favor of Martin Prince, whose family now has an even bigger backyard pool than the Simpsons, although the pool breaks when Martin overestimates its capacity.
Without the attention from the other kids, Lisa soon notices Bart's fears of what Ned might be up to, and she reluctantly agrees to help him investigate by sneaking into the Flanders house while Ned is away. Ned unexpectedly comes home early and Lisa hides in the attic. Bart follows Ned to the attic, and accuses him of killing Maude; Ned faints from the shock.
After the police arrive to question Ned, they discover that Maude is alive and well, having just returned from her time "with God" at a Bible camp in the countryside. Bart presses Ned about the grave he dug in the backyard, forcing Ned to tearfully confess that the grave was for Maude's favorite ficus benjamina, which he had accidentally overwatered. When Ned sees the police have unearthed the dead plant from his backyard, he lets out a high-pitched scream which sounds like a woman's voice, and Bart recognizes this as the scream he originally heard.
Production
For season six, Fox moved The Simpsons back to its original Sunday night time of 8 pm, having aired on Thursdays for the previous four seasons. It has r |
https://en.wikipedia.org/wiki/Inode | The inode (index node) is a data structure in a Unix-style file system that describes a file-system object such as a file or a directory. Each inode stores the attributes and disk block locations of the object's data. File-system object attributes may include metadata (times of last change, access, modification), as well as owner and permission data.
A directory is a list of inodes with their assigned names. The list includes an entry for itself, its parent, and each of its children.
Etymology
There has been uncertainty on the Linux kernel mailing list about the reason for the "i" in "inode". In 2002, the question was brought to Unix pioneer Dennis Ritchie, who replied:
A 1978 paper by Ritchie and Ken Thompson bolsters the notion of "index" being the etymological origin of inodes. They wrote: Additionally, Maurice J. Bach wrote that the word inode "is a contraction of the term index node and is commonly used in literature on the UNIX system".
Details
A file system relies on data structures about the files, as opposed to the contents of that file. The former are called metadata—data that describes data. Each file is associated with an inode, which is identified by an integer, often referred to as an i-number or inode number.
Inodes store information about files and directories (folders), such as file ownership, access mode (read, write, execute permissions), and file type. The data may be called stat data, in reference to the stat system call that provides the data to programs.
The inode number indexes a table of inodes on the file system. From the inode number, the kernel's file system driver can access the inode contents, including the location of the file, thereby allowing access to the file. A file's inode number can be found using the ls -i command. The ls -i command prints the inode number in the first column of the report.
On many older file systems, inodes are stored in one or more fixed-size areas that are set up at file system creation time, so the maximum number of inodes is fixed at file system creation, limiting the maximum number of files the file system can hold. A typical allocation heuristic for inodes in a file system is one inode for every 2K bytes contained in the filesystem.
Some Unix-style file systems such as JFS, XFS, ZFS, OpenZFS, ReiserFS, btrfs, and APFS omit a fixed-size inode table, but must store equivalent data in order to provide equivalent capabilities. Common alternatives to the fixed-size table include B-trees and the derived B+ trees.
File names and directory implications:
Inodes do not contain their hard link names, only other file metadata.
Unix directories are lists of association structures, each of which contains one filename and one inode number.
The file system driver must search a directory for a particular filename and then convert the filename to the correct corresponding inode number.
The operating system kernel's in-memory representation of this data is called struct inode in Linux |
https://en.wikipedia.org/wiki/Practical%20effect | A practical effect is a special effect produced physically, without computer-generated imagery or other post-production techniques. In some contexts, "special effect" is used as a synonym of "practical effect", in contrast to "visual effects" which are created in post-production through photographic manipulation or computer generation.
Many of the staples of action movies are practical effects. Gunfire, bullet wounds, rain, wind, fire, and explosions can all be produced on a movie set by someone skilled in practical effects. Non-human characters and creatures produced with make-up, prosthetics, masks, and in contrast to computer-generated are also examples of practical effects.
Practical effect techniques
The use of prosthetic makeup, animatronics, puppetry, or creature suits to create the appearance of living creatures.
Miniature effects, which is the use of scale models which are photographed in a way that they appear full sized.
Mechanical effects, such as aerial rigging to simulate flight, stage mounted gimbals to make the ground move, or other mechanical devices to physically manipulate the environment.
Pyrotechnics for the appearance of fire and explosions.
Weather effects such as sprinkler systems to create rain and fog machines to create smoke.
Squibs to create the illusion of gunshot wounds.
See also
Special effects
Computer-generated imagery
Visual effects
Optics: Visual effects
References
Special effects |
https://en.wikipedia.org/wiki/AJL | AJL may refer to:
Ahmedabad Janamrg Limited
Algorithmic Justice League, an organization that looks at the social implications of artificial intelligence
Anugerah Juara Lagu
Association of Jewish Libraries
Associated Journals Limited |
https://en.wikipedia.org/wiki/Pollard%27s%20rho%20algorithm | Pollard's rho algorithm is an algorithm for integer factorization. It was invented by John Pollard in 1975. It uses only a small amount of space, and its expected running time is proportional to the square root of the smallest prime factor of the composite number being factorized.
Core ideas
The algorithm is used to factorize a number , where is a non-trivial factor. A polynomial modulo , called (e.g., ), is used to generate a pseudorandom sequence. It is important to note that must be a polynomial. A starting value, say 2, is chosen, and the sequence continues as , , , etc. The sequence is related to another sequence . Since is not known beforehand, this sequence cannot be explicitly computed in the algorithm. Yet, in it lies the core idea of the algorithm.
Because the number of possible values for these sequences is finite, both the sequence, which is mod , and sequence will eventually repeat, even though these values are unknown. If the sequences were to behave like random numbers, the birthday paradox implies that the number of before a repetition occurs would be expected to be , where is the number of possible values. So the sequence will likely repeat much earlier than the sequence . When one has found a such that but , the number is a multiple of , so has been found.
Once a sequence has a repeated value, the sequence will cycle, because each value depends only on the one before it. This structure of eventual cycling gives rise to the name "rho algorithm", owing to similarity to the shape of the Greek letter ρ when the values , , etc. are represented as nodes in a directed graph.
This is detected by Floyd's cycle-finding algorithm: two nodes and (i.e., and ) are kept. In each step, one moves to the next node in the sequence and the other moves forward by two nodes. After that, it is checked whether . If it is not 1, then this implies that there is a repetition in the sequence (i.e. . This works because if the is the same as , the difference between and is necessarily a multiple of . Although this always happens eventually, the resulting greatest common divisor (GCD) is a divisor of other than 1. This may be itself, since the two sequences might repeat at the same time. In this (uncommon) case the algorithm fails, and can be repeated with a different parameter.
Algorithm
The algorithm takes as its inputs , the integer to be factored; and , a polynomial in computed modulo . In the original algorithm, , but nowadays it is more common to use . The output is either a non-trivial factor of , or failure. It performs the following steps:
Pseudocode for Pollard's rho algorithm
x ← 2 // starting value
y ← x
d ← 1
while d = 1:
x ← g(x)
y ← g(g(y))
d ← gcd(|x - y|, n)
if d = n:
return failure
else:
return d
Here and corresponds to and in the previous section. Note that this algorithm may fail to find a nontrivial factor even when is comp |
https://en.wikipedia.org/wiki/Presence%20information | In computer and telecommunications networks, presence information is a status indicator that conveys ability and willingness of a potential communication partner—for example a user—to communicate. A user's client provides presence information (presence state) via a network connection to a presence service, which is stored in what constitutes his personal availability record (called a presentity) and can be made available for distribution to other users (called watchers) to convey their availability for communication. Presence information has wide application in many communication services and is one of the innovations driving the popularity of instant messaging or recent implementations of voice over IP clients.
Presence state
A user client may publish a presence state to indicate its current communication status. This published state informs others that wish to contact the user of his availability and willingness to communicate. The most common use of presence today is to display an indicator icon on instant messaging clients, typically from a choice of graphic symbols with easy-to-convey meanings, and a list of corresponding text descriptions of each of the states. Even when technically not the same, the "on-hook" or "off-hook" state of called telephone is an analogy, as long as the caller receives a distinctive tone indicating unavailability or availability.
Common states on the user's availability are "free for chat", "busy", "away", "do not disturb", "out to lunch". Such states exist in many variations across different modern instant messaging clients. Current standards support a rich choice of additional presence attributes that can be used for presence information, such as user mood, location, or free text status.
The analogy with free/busy tone on PSTN is inexact, as the "on-hook" telephone status reflects the ability of the network to reach the recipient after the requester has initiated the conversation. The requester must commit to the connection method before discovering the recipient's availability state. Conversely, Presence shows the availability state before a conversation is initiated. A similar comparison might be the requester needing to know if the recipient is at work. The most straightforward way of checking if the recipient is available is to walk to the desk, which requires the commitment of the walk regardless of the outcome and usually requires some interaction if the recipient is at the desk. The requester can call first to save the walk, but now must commit to an interaction via phone. Presence gives the state of the recipient to the requester and the requester has the choice to interact with the recipient or use that information for non-interactive purposes (such as taking roll).
MPOP and presence by observation
Presence becomes interesting for communication systems when it spans a number of different communication channels. The idea that multiple communication devices can combine state, to provide an aggregated v |
https://en.wikipedia.org/wiki/Hardwar%20%28video%20game%29 | Hardwar (sometimes stylized HardW[a]r or given the full name Hardwar: The Future Is Greedy) is a 1998 science fiction flight simulation computer game developed by The Software Refinery and published by Gremlin Interactive. In the US, the game was distributed by Interplay under license. The box artwork and styling for game was created by The Designers Republic, who also worked on the Wipeout series. The soundtrack was provided by artists signed to the Warp Records label. Funbox Media digitally re-released Hardwar via ZOOM-Platform.com on September 17, 2021. Funbox Media and Jordan Freeman Group, the aforementioned ZOOM-Platform.com, would team up again to release a Steam (service) version on February 15, 2023. The Steam (service) edition remained DRM-Free.
The game's plot involves warring power groups on Titan, and the player character's eventual escape. The world is set inside craters on the moon's surface, joined together by a network of tunnels.
Story
Hardwar places the player in the role of a freelance "Moth" pilot in the city of Misplaced Optimism, a space colony located on Saturn's moon, Titan. The colony was once a profitable mining outpost, but the major corporations backed out, leaving the inhabitants without the capability of space travel and a slowly but steadily crumbling infrastructure. During two hundred years of isolation, the remaining corporations became effectively organised crime gangs, with the corrupt and inefficient police force maintaining little law and order.
Things change when an unidentified, apparently alien, ship crash lands in the defunct Port district, causing the two largest corporations - Klamp-G and Lazarus - to rush to take advantage. The player finds themself thrust in to the situation, eventually managing to outrace both corporations to help the aliens repair their ship in return for passage off Titan, to an uncertain, but hopefully better, future.
Gameplay
It is at the discretion of the players as to how they will earn their living on Titan. They can trade honestly, having to be wary of pirates. They can choose to hunt Titan's outlaws, collecting bounties from the various police stations. Players may also be lowly scavengers like many artificial intelligence (AI) moths, picking at the dropped cargo of panicked traders, or players can become pirates themselves.
Many AI moths flit about with valuable cargo, should the players decide to take this path; however, stolen cargo in the players' hands can be confiscated by the police, or they could become the target of other outlaws now that they are carrying valuable cargo. Players may attract the unwelcome attention of one of the main factions in the game due to their piracy.
Players are able to buy many of the available hangars around Titan, making storage of goods and repairs much simpler. This also allows them to store extra "Moths" safely in one location, to set up trade facilities in different craters, and purchase and install Clones, to ensure the players |
https://en.wikipedia.org/wiki/Martin%20Newell | Martin Newell may refer to:
Martin Newell (computer scientist), British computer scientist, creator of the Utah teapot
Martin Newell (musician) (born 1953), British singer-songwriter, poet and author
Martin Newell (priest) (born 1967), English priest
Martin L. Newell (born 1939), Irish mathematician and Gaelic footballer
Martin J. Newell (1910–1985), Irish mathematician and educationalist, who served as President of University College Galway from 1960 to 1975 |
https://en.wikipedia.org/wiki/Comal | Comal may refer to:
COMAL, a computer programming language
Comal (cookware), a type of griddle
Places
Comal River (Indonesia)
Comal County, Texas, U.S.
Comal River, Texas, U.S.
Comal Springs (Texas), U.S.
See also |
https://en.wikipedia.org/wiki/2CH | 2CH was a commercial radio station in Sydney, Australia. It was owned by Pacific Star Network. The station changed formats on 10 June 2022 to sports.
History
2CH commenced broadcasting on 15 February 1932 on 1210 kHz. It moved to its final AM frequency of 1170 kHz in 1935.
Ownership
The CH stands for "churches". In 1944, the NSW Council of Churches sub-let the licence to Amalgamated Wireless (Australasia) who provided program content for six days per week, with the Council of Churches being responsible for programming on Sundays. The NSW Council of Churches was its licence holder until it was sold to John Singleton in April 1994 becoming part of the Macquarie Radio Network.
In January 2017, 2CH was sold to a consortium of Oceania Capital Partners, Glenn Wheatley and John Williams for $5.6 million. The station had to be sold to comply with an undertaking given to the Australian Communications and Media Authority following the merger of the Macquarie Radio Network and Fairfax Media (owners of 2GB and 2UE respectively) to comply with legislation allowing one party to only control two radio stations in a market.
The station posted a loss of $1.9 million on revenue of $2.4 million for the year to March 2019 In June 2020, it was sold for $11 million to Pacific Star Network.
Church Thanksgiving
On 18 February 2007, a thanksgiving service to celebrate 2CH's 75 years of broadcasting was held at St Andrew's Anglican Cathedral, Sydney Square, commencing at 2 pm. The Reverend Peter Jensen, the Anglican Archbishop of Sydney presided with Rev. Dr. Ross Clifford preaching.
Transition to 'DAB+ only' radio station and final end
In August 2020 after the station was purchased by Pacific Star, it was announced that 2CH would be switching to only broadcasting on digital radio. 2CH was heard on DAB+ radio until 10 June 2022, after briefly simulcasting on DAB+ and 1170 kHz in the AM broadcast band. The station used be live-streamed over the internet until the station demise.
Although not the first 'DAB+ only' radio station in Australia, 2CH was probably the first to transition by relinquishing its AM radio frequency allocation.
Trevor Sinclair broadcast his final show on the AM broadcast band from Midday-7pm on 22 October 2020. Chris Kearns broadcast his show on both AM and DAB+ until Midnight 22 October 2020, when the AM frequency 1170 kHz was taken over by 1170 SEN, carrying a dedicated sports broadcasting network, known as the Sports Entertainment Network. At 6pm on 10 June 2022, 2CH left the airwaves for the final time with Jane Nield as the last live announcer. This follows an 18 month legacy after the Sports Entertainment Network purchased the station in 2020, and an unsuccessful DAB+ trial.
Announcers
Previous Line-up
Weekdays:
Non Stop Classic Hits (12:00am – 6:00am)
Tim Webster (6:00am – 12:00pm)
Jane Nield (12:00pm – 6:00pm)
Nay Pearce (6:00pm – 12:00am)
Saturdays:
Non Stop Classic Hits (12:00am – 6:00am)
Matt Pardy (6:00am – 10:00am)
|
https://en.wikipedia.org/wiki/BDO | BDO may refer to:
BDO Global, the world's fifth-largest accountancy network
Banco de Oro, one of the largest banks in the Philippines
Barton, Durstine & Osborn, the former name of advertising agency BBDO
Behavior Detection Officer, part of the Transportation Security Administration
Big Day Out, an annual music festival held in Australia and New Zealand
Big Dumb Object, a term used in science fiction
Black Desert Online, an MMORPG
Block Development Officer, the official in charge of an administrative division (block) of some South Asian countries
British Darts Organisation (now defunct), former governing body of British darts
Business Depot Ogden, the former Defense Depot Ogden Utah converted into a business park
Butanediol, especially 1,4-Butanediol, an organic chemical compound
Husein Sastranegara International Airport, the IATA code served in Bandung, Indonesia
League of German Officers (), an association of German prisoners of war in the Soviet Union
Computers
, an HTML element for bi-directional override, see |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.