source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Quoted-printable | Quoted-Printable, or QP encoding, is a binary-to-text encoding system using printable ASCII characters (alphanumeric and the equals sign =) to transmit 8-bit data over a 7-bit data path or, generally, over a medium which is not 8-bit clean. Historically, because of the wide range of systems and protocols that could be used to transfer messages, e-mail was often assumed to be non-8-bit-clean – however, modern SMTP servers are in most cases 8-bit clean and support 8BITMIME extension. It can also be used with data that contains non-permitted octets or line lengths exceeding SMTP limits. It is defined as a MIME content transfer encoding for use in e-mail.
QP works by using the equals sign = as an escape character. It also limits line length to 76, as some software has limits on line length.
Introduction
MIME defines mechanisms for sending other kinds of information in e-mail, including text in languages other than English, using character encodings other than ASCII. However, these encodings often use byte values outside the ASCII range so they need to be encoded further before they are suitable for use in a non-8-bit-clean environment. Quoted-Printable encoding is one method used for mapping arbitrary bytes into sequences of ASCII characters. So, Quoted-Printable is not a character encoding scheme itself, but a data coding layer to be used under some byte-oriented character encoding. QP encoding is reversible, meaning the original bytes and hence the non-ASCII characters they represent can be identically recovered.
Quoted-Printable and Base64 are the two MIME content transfer encodings, if the trivial "7bit" and "8bit" encoding are not counted. If the text to be encoded does not contain many non-ASCII characters, then Quoted-Printable results in a fairly readable and compact encoded result. On the other hand, if the input has many 8-bit characters, then Quoted-Printable becomes both unreadable and extremely inefficient. Base64 is not human-readable, but has a uniform overhead for all data and is the more sensible choice for binary formats or text in a script other than the Latin script.
Quoted-printable encoding
Any 8-bit byte value may be encoded with 3 characters: an = followed by two hexadecimal digits (0–9 or A–F) representing the byte's numeric value. For example, an ASCII form feed character (decimal value 12) can be represented by =0C, and an ASCII equal sign (decimal value 61) must be represented by =3D. All characters except printable ASCII characters or end of line characters (but also =) must be encoded in this fashion.
All printable ASCII characters (decimal values between 33 and 126) may be represented by themselves, except = (decimal 61, hexadecimal 3D, therefore =3D).
ASCII tab and space characters, decimal values 9 and 32, may be represented by themselves, except if these characters would appear at the end of the encoded line. In that case, they would need to be escaped as =09 (tab) or =20 (space), or be followed by a = (soft |
https://en.wikipedia.org/wiki/King%27s%20Bounty | King's Bounty is a turn-based fantasy video game designed by Jon Van Caneghem and published by New World Computing in 1990. The game follows the player's character, a hero of King Maximus, appointed with the job of retrieving the Sceptre of Order from the forces of chaos, led by Arech Dragonbreath. King's Bounty is notably considered the forerunner of the Heroes of Might and Magic series of games.
A Sega Genesis port was developed and released in North America on February 21, 1991, with a multitude of graphical changes. The gameplay was also modified to incorporate real time overworld exploration.
In 2008, a spiritual sequel titled King's Bounty: The Legend was released. This was followed by additional sequels including King's Bounty: Armored Princess, King's Bounty: Crossworlds, King's Bounty: Warriors of the North, and King's Bounty: Dark Side.
Gameplay
The player leads the hero and his army across the four continents, acquiring up to 25 pieces of a map revealing the hidden location to the Sceptre of Order before King Maximus dies. Various details of this task are left to player's discretion, allowing for flexible gameplay. For instance, not all the scattered map sections are required; if the player is able to correctly determine the location of the sceptre's burial spot before acquiring all 25 map pieces, the game is won. If the sceptre is not recovered before King Maximus dies (the time varies depending on difficulty setting), the game ends in defeat. The location of the sceptre, the artifacts and which castles the villains inhabit are all randomized each game, adding to its replayability.
The hero is given a weekly commission from the king to track down 17 villains across the 4 continents. With each defeat of the progressively stronger villain's army, the character claims (along with the reward money for the "King's Bounty" on that villain) another piece of the map revealing the sceptre's burial location. Along the way, numerous treasure chests are encountered scattered across the map. Some of these chests represent various events that increase the hero's inherent abilities, such as magical strength or weekly income; others may contain one of eight artifacts, which themselves provide a piece of the map, in addition to conferring their own unique powers.
As the player explores, he encounters various types of creatures native to the different continents, some of which are able to be recruited. Most of these creatures are significant upgrades from the normal human forces available to the player at the King's castle, and are required to defeat the tougher villain armies. However, as their strength increases, so does the amount of gold required to retain them, which must be paid weekly. Although the player's commission can be raised in a variety of ways, such as maintaining a garrison of forces at a captured castle. If their costs exceed their income, they run out of money, their army will abandon them. Furthermore, each of the various army |
https://en.wikipedia.org/wiki/IBM%20Airline%20Control%20Program | IBM Airline Control Program, or ACP, is a discontinued operating system developed by IBM beginning about 1965. In contrast to previous airline transaction processing systems, the most notable aspect of ACP is that it was designed to run on most models of the IBM System/360 mainframe computer family. This departed from the earlier model in which each airline had a different, machine-specific transaction system.
Overview
Development began with SABRE (Semi-Automatic Business Research Environment), Deltamatic, and PANAMAC. From these, the Programmed Airline Reservations System (PARS) was developed. In 1969 the control program, ACP, was separated from PARS. PARS kept the functions for processing airline reservations and related data.
In December 1979, ACP became known as ACP/TPF and then just TPF (Transaction Processing Facility). The transaction operating system became more widely implemented by businesses other than the major airlines, such as online credit card processing, hotel and rental car reservations, police emergency response systems, and package delivery systems.
The last "free" release of ACP, 9.2.1, was intended for use in bank card and similar applications. It was shipped on a "mini-reel" which contained a complete ACP system and its libraries for restoration to IBM 3340 disk drives. From that complete system one could easily create derivative works. A hypervisor was included, which allowed OS/370 VS1 or VS2 (SVS or MVS) to be run as a "guest" OS under ACP itself. The end-user documentation, which was shipped with the tape, took almost 60 linear inches of shelf space.
See also IBM Airline Control System (ALCS), a variant of TPF specially designed to provide all the benefits of TPF (very high speed, high volume, high availability transaction processing) but with the advantages such as easier integration into the data center offered by running on a standard IBM operating system platform.
See also
Timeline of operating systems
References
Further reading
External links
Official IBM TPF website
Airline Control Program/Transaction Processing Facility (ACP /TPF) General Information Manual (1979)
20th-century aviation
Airline Control Program
1968 software |
https://en.wikipedia.org/wiki/W.%20Richard%20Stevens | William Richard (Rich) Stevens (February 5, 1951September 1, 1999) was a Northern Rhodesia–born American author of computer science books, in particular books on Unix and TCP/IP.
Biography
Richard Stevens was born in 1951 in Luanshya, Northern Rhodesia (now Zambia), where his father worked for the copper industry. The family later moved to Salt Lake City, Utah, Hurley, New Mexico, Washington, D.C., and Phalaborwa, South Africa. Stevens attended Fishburne Military School in Waynesboro, Virginia. He received a bachelor's degree in aerospace engineering from the University of Michigan in 1973 and both a master's degree (in 1978) and PhD (in 1982) in systems engineering from the University of Arizona. He moved to Tucson in 1975 where he was employed at Kitt Peak National Observatory as a computer programmer until 1982. From 1982 until 1990 he was Vice President of Computing Services at Health Systems International in New Haven, Connecticut. Stevens moved back to Tucson in 1990 where he pursued his career as an author and consultant. He was also an avid pilot and a part-time flight instructor during the 1970s.
Stevens died in 1999, at the age of 48. In 2000, he was posthumously awarded the USENIX Lifetime Achievement Award.
Books
1990 – UNIX Network Programming –
1992 – Advanced Programming in the UNIX Environment –
1994 – TCP/IP Illustrated, Volume 1: The Protocols –
1995 – TCP/IP Illustrated, Volume 2: The Implementation (with Gary R. Wright) –
1996 – TCP/IP Illustrated, Volume 3: TCP for Transactions, HTTP, NNTP, and the UNIX Domain Protocols –
1998 – UNIX Network Programming, Volume 1, Second Edition: Networking APIs: Sockets and XTI –
1999 – UNIX Network Programming, Volume 2, Second Edition: Interprocess Communications –
2003 – UNIX Network Programming Volume 1, Third Edition: The Sockets Networking API – (with Bill Fenner, and Andrew M. Rudoff)
2005 – Advanced Programming in the UNIX Environment, Second Edition – (with Stephen A. Rago)
2011 – TCP/IP Illustrated, Volume 1: The Protocols (2nd Edition) – (with Kevin R. Fall)
2013 – Advanced Programming in the UNIX Environment, Third Edition – (with Stephen A. Rago)
RFCs
Stevens also co-authored several Request for Comments (RFC) documents for the Internet Engineering Task Force, the process by which the Internet's "technical and organizational notes" are disseminated. Stevens' RFCs covered updates to the Berkeley sockets API for IPv6, as well as a standard method of congestion control for TCP sessions.
Stevens, W. R., and Thomas, M. 1998. "Advanced Sockets API for IPv6," RFC 2292
Gilligan, R. E., Thomson, S., Bound, J., and Stevens, W. R. 1999. "Basic Socket Interface Extensions for IPv6," RFC 2553
Allman, M., Paxson, V., Stevens, W. R. 1999. "TCP Congestion Control," RFC 2581
References
External links
Stevens' former homepage
Guru of the Unix gurus by Rachel Chalmers (September 1, 2000) at Salon.com
Prentice Hall interview with Rich Stevens, author of Unix Pro |
https://en.wikipedia.org/wiki/Buzz%20%28TV%20series%29 | Buzz was a 2000-2005 Canadian comedy television series that aired on The Comedy Network. The show was hosted by "Mista Mo" (Morgan Oliver Smith) and Daryn Jones. The show originally aired in the mid-90s as a community channel show on Rogers Television before getting a network deal in 1999. In 2001, the show won a Gemini Award in the "Best Writing in a Comedy or Variety Program or Series" category. The 2003 season saw them take the show to New York, London, Amsterdam and Frankfurt. The show ended in 2005.
Created in Toronto, the show found a place on the Comedy Network when The Tom Green Show left to MTV. The show uses sketch comedy, non-sequiturs and guerrilla comedy. The two hosts, Daryn Jones, a geeky theatre major, and Mista Mo, an "almost real rapper" often riff on the racial tensions between them.
Recurring sketches and characters
Annual Fat Pride Parade
Selling Parked Cars
Break Stuff - end-segment, where either hosts break items (TV's, eggs) or pedestrians battle each other
The BuzzCops - Daryn and Mo, dressed as policemen, dole out misguided justice to Toronto's citizens.
The BuzzNews - The Buzz's take on fake news (The Daily Show, Weekend Update)
The Cable Access Painter - Daryn parodies PBS painter Bob Ross, with homosexual overtones.
Captain Harassment - Features Daryn's left hand, clad in a rubber glove with a Canadian flag cape, sneaking up behind women, and pinching their asses.
Country Mo Dee - Music videos of Mista Mo's alter-ego, a country hip-hop sensation.
Thug Steel - Music videos of Mista Mo's alter-alter-ego, a gospel gangsta rap sensation.
Fluff E. the Hip-Hop Bunny - Series regular Jean Paul dresses up as a giant pink bunny, to the glee of young children. But Fluff E. is more interested in their mothers.
German Dinner Theatre - faux accents, poetry, keyboard and a mustache. Daryn, with Wesley Snipes (Mista Mo) and Big E (Eric Harze), insult the fashions of passers-by.
Phone Sex Nursery Rhymes - Daryn and Mo dress up in animal costumes and make out with each other to nursery rhymes read by a phone sex operator.
Shaboobala - making pedestrians uncomfortable by answering their relationship problems and then asking if he can marry them for a green card.
Star Talk - usually unsuccessful attempts to speak with/insult celebrities
Jesus: Caught on Tape - Amateur video of Jesus Christ committing various crimes, e.g. auto theft.
Forgotten Black Superheroes - low-budget film trailers about black heroes like "Bootyman" and "The Bionic Slave" taking revenge on "crackas"
"Ya Heard Me" - Mista Mo rants, Rick Mercer-style, about any ridiculous topic that comes to mind.
Time of the Month Awards - end-segment, where Daryn and Mo hand out dubious awards, including "Best Bra in a Supporting Role" and "Best Ass in a Pair of Jeans" to female pedestrians.
The Petitioners - Daryn and Mo get people to sign bogus petitions to change the names of things. They successfully changed popular hooker hang-out Jarvis St. to "Stan Khoe Ave.", the no |
https://en.wikipedia.org/wiki/Quark%20%28kernel%29 | In computing, Quark is an operating system kernel used in MorphOS. It is a microkernel designed to run fully virtualized computers, called boxes (see sandbox). , only one box is available, the ABox, that lets users run extant AmigaOS software compiled for Motorola 68000 series (MC680x0 or 68k) and PowerPC central processing units (CPUs).
Design goals
The Quark microkernel is not a member of the L4 microkernel family, but borrows concepts from it, including: the clan (group of tasks), ID concept, and recursive address mapping. Quark also has an asynchronous/synchronous message interface similar to Amiga's Exec kernel but adapted to an environment with memory protection.
Other Quark features include:
High super/usermode switch speed
Low interrupt latency
Interrupt threads (IntThreads) and Int P-code abstraction
Symmetric multiprocessing (SMP)
Models task/thread and clan/chief
Resource tracking
Virtual memory (optional)
Distributed computing
No access to kernel structures
Clean design with an elegant application programming interface (API)
Micro/pico kernel mix
For this new kernel, a hardware abstraction layer is used which provides the needed hardware resource information like scanning all Amiga Zorro II bus boards, Peripheral Component Interconnect (PCI) boards, and local hardware resources.
Functions
SYS_AddLinkMessage
SYS_AttemptSemaphore
SYS_AttemptSemaphoreShared
SYS_CopyCPUHalConfig
SYS_CreateMemList
SYS_CreateTask
SYS_DeletePort
SYS_DeleteSemaphore
SYS_DumpMemHeader
SYS_FindFreeMemArea
SYS_FindSkipSize
SYS_GetLinkMessage
SYS_GetMessageAttr
SYS_GetNextCPU
SYS_Init
SYS_InsideClan
SYS_IsClanMember
SYS_MMUAddPage
SYS_MMUGetEntry
SYS_MoveRomModuleToMemoryEnd
SYS_ObtainPort
SYS_ObtainSemaphore
SYS_ObtainSemaphoreShared
SYS_ReleaseSemaphore
SYS_ReplyMessage
SYS_SendMessage
SYS_SetMessageAttr
SYS_SetupPageTable
SYS_ShowExceptionThreads
SYS_ShowForbidThreads
SYS_ShowIntThreads
SYS_ShowQuarkState
SYS_ShowReadyThreads
SYS_ShowRunThreads
SYS_ShowThreads
SYS_ShowWaitIntThreads
SYS_ShowWaitThreads
SYS_Start
SYS_StartNextThread
SYS_StartThread
SYS_WaitPort
Trance JIT
Trance JIT is a MorphOS just-in-time (JIT) compiler, or code translator, for running 68k applications within the MorphOS environment. It has been part of the MorphOS operating system since MorphOS 1.4.
MorphOS has a fully integrated 68k emulator to run many Amiga applications, which were almost exclusively compiled for the 68k processor, though MorphOS runs on PowerPC. Trance supplements this function by adding JIT compiling, increasing the speed of the emulation. It does not interfere with the full integration of 68k and PowerPC tasks MorphOS provides.
Trance exists in the form of an executable, run during boot, and a shared library. Although it is not technically part of the kernel, and MorphOS can be run without it, Trance is considered a fundamental part of MorphOS and one of its most powerful features.
Compatibility of Trance i |
https://en.wikipedia.org/wiki/Tin%20Toy | Tin Toy is a 1988 American computer-animated short film produced by Pixar and directed by John Lasseter. The short film, which runs five minutes, stars Tinny, a tin one-man band toy, attempting to escape from Billy, an infant. The third short film produced by the company's small animation division, it was a risky investment: due to the low revenue produced by Pixar's main product, the Pixar Image Computer, the company was under financial constraints.
Lasseter pitched the concept for Tin Toy by storyboard to Pixar owner Steve Jobs, who agreed to finance the short despite the company's struggles, which he kept alive with annual investment. The film was officially a test of the PhotoRealistic RenderMan software and proved new challenges to the animation team, namely the difficult task of realistically animating Billy. Tin Toy later gained attention from Disney, who sealed an agreement to create Toy Story starring Tom Hanks and Tim Allen, which was primarily inspired by elements from Tin Toy.
The short film premiered in a partially completed edit at the SIGGRAPH convention in August 1988 to a standing ovation from scientists and engineers. The film went on to claim Pixar's first Oscar with the 1988 Academy Award for Best Animated Short Film, becoming the first CGI film to win an Oscar. With the award, Tin Toy went far to establish computer animation as a legitimate artistic medium outside SIGGRAPH and the animation-festival film circuit. In 2003, Tin Toy was selected for preservation in the United States National Film Registry by the Library of Congress as being "culturally, historically, or aesthetically significant".
Plot
The film takes place in one room and stars the toy of the title, a mechanical one-man band player named Tinny, who looks around, and sees an infant named Billy, who approaches him, because a Luxo lamp is at the top-right after the title plays. At first, Tinny is delighted at the prospect of being played with by Billy until he sees how destructive the infant can be, including sucking on his Rock-a-Stack and thumping his beads. When Tinny tries to walk out of Billy's reach, the musical instruments on the former's back begin to play, attracting Billy's attention. Tinny begins to run, but is chased by Billy. During a chase with the excited Billy pursuing him, Tinny soon finds cover under a couch, there finding a collection of toys in hiding, similarly terrified of Billy, because they have gone through the same experience. Unaware of this, Billy suddenly trips, but falls over however, and lies silently on the hardwood surface floor face first while searching for Tinny, and begins to cry. Feeling sorry for the baby, Tinny sees this, and leaves his couch sanctuary, and begins to play near Billy to calm him down. Upon seeing this, Billy stops crying and picks up Tinny to play with, the latter fearing the worst. However, Billy soon lets go of the toy, more interested in his packaging, but ignores Tinny, and then plays with his box, whic |
https://en.wikipedia.org/wiki/Parchive | Parchive (a portmanteau of parity archive, and formally known as Parity Volume Set Specification) is an erasure code system that produces par files for checksum verification of data integrity, with the capability to perform data recovery operations that can repair or regenerate corrupted or missing data.
Parchive was originally written to solve the problem of reliable file sharing on Usenet, but it can be used for protecting any kind of data from data corruption, disc rot, bit rot, and accidental or malicious damage. Despite the name, Parchive uses more advanced techniques (specifically error correction codes) than simplistic parity methods of error detection.
As of 2014, PAR1 is obsolete, PAR2 is mature for widespread use, and PAR3 is a discontinued experimental version developed by MultiPar author Yutaka Sawada. The original SourceForge Parchive project has been inactive since April 30, 2015. A new PAR3 specification has been worked on since April 28, 2019 by PAR2 specification author Michael Nahas. An alpha version of the PAR3 specification has been published on January 29, 2022 while the program itself is being developed.
History
Parchive was intended to increase the reliability of transferring files via Usenet newsgroups. Usenet was originally designed for informal conversations, and the underlying protocol, NNTP was not designed to transmit arbitrary binary data. Another limitation, which was acceptable for conversations but not for files, was that messages were normally fairly short in length and limited to 7-bit ASCII text.
Various techniques were devised to send files over Usenet, such as uuencoding and Base64. Later Usenet software allowed 8 bit Extended ASCII, which permitted new techniques like yEnc. Large files were broken up to reduce the effect of a corrupted download, but the unreliable nature of Usenet remained.
With the introduction of Parchive, parity files could be created that were then uploaded along with the original data files. If any of the data files were damaged or lost while being propagated between Usenet servers, users could download parity files and use them to reconstruct the damaged or missing files. Parchive included the construction of small index files (*.par in version 1 and *.par2 in version 2) that do not contain any recovery data. These indexes contain file hashes that can be used to quickly identify the target files and verify their integrity.
Because the index files were so small, they minimized the amount of extra data that had to be downloaded from Usenet to verify that the data files were all present and undamaged, or to determine how many parity volumes were required to repair any damage or reconstruct any missing files. They were most useful in version 1 where the parity volumes were much larger than the short index files. These larger parity volumes contain the actual recovery data along with a duplicate copy of the information in the index files (which allows them to be used on their own |
https://en.wikipedia.org/wiki/STS-70 | STS-70 was the 21st flight of the Space Shuttle Discovery, and the last of 7 shuttle missions to carry a Tracking and Data Relay Satellite (TDRS). This was the first shuttle mission controlled from the new mission control center room at the Johnson Space Center in Houston.
STS-70 was also the first flight of the new Block 1 orbiter main engine, designed to improve both engine performance and safety. The mission was launched from Kennedy Space Center in Florida on July 13, 1995, only six days after the landing of sister ship Atlantis, marking the fastest turnaround between flights in the history of the program.
Crew
Preparations and launch
STS-70 had originally moved ahead of STS-71 because of a delay in the launch of the Russian Spektr laboratory module to the Russian space station Mir. However, on May 31, 1995, shuttle managers assessed damage to the External Tank of STS-70 caused by nesting flicker woodpeckers. The damage consisted of about 71 holes (ranging in size from 4 inches in diameter to 1/2 inch in diameter) in the ETs thermal protection foam insulation. Technicians installed safeguards against additional damage. On June 2, NASA managers decided to delay the launch of Discovery in order to make repairs to the insulation, and STS-71 was moved ahead of STS-70. Discovery was rolled back to the VAB on June 8, and was returned to the pad on June 15.
Launch occurred on July 13, 1995, at 9:41:55.078 a.m. EDT. The launch window was 2 hours 30 min. The hatch was closed at 8:13am EDT and the count proceeded smoothly until T-31 sec. The count was held for 55 seconds at T-31 sec by the Booster Range Safety Engineer (CBRS) Tod Gracom at the LCC C-5 Console due to fluctuations seen on the external tank automatic gain control (AGC) ET range safety system receiver. Launch Commit Criteria contingency procedures were worked and the count then proceeded on schedule. STS-70 marked the maiden flight of the new Block 1 orbiter main engine. Engine number 2036 featured the new high-pressure liquid oxygen turbopump, a two-duct powerhead, baffleless main injector, single-coil heat exchanger and start sequence modifications. The Block I engine flew in the number one position on Discovery. The other two engines were of the existing Phase II design.
Mission highlights
The primary mission was the launch and deployment of the 7th Tracking and Data Relay Satellite (TDRS-G) by means of the two-stage Inertial Upper Stage (IUS) solid rocket. It was built by TRW and weighs about . The satellite was ejected from Discovery's cargo bay exactly on time at 2:55 p.m. CDT, approximately six hours into the flight. The release of the satellite was overseen by Mission Specialists Donald Thomas and Mary Ellen Weber.
About 15 minutes later, Discovery's Commander Tom Henricks fired the shuttle's engines to raise the orbit and move away from the vicinity of the satellite and the IUS. At about 3:55 p.m., the IUS fired the first of two burns that would put TDRS-G into its pro |
https://en.wikipedia.org/wiki/APTN | APTN may stand for:
Aboriginal Peoples Television Network, Canadian broadcast and cable television network
Asia-Pacific Telecentre Network, collaborative initiative of the United Nations
Associated Press Television News, global video news agency |
https://en.wikipedia.org/wiki/SQL%20injection | In computing, SQL injection is a code injection technique used to attack data-driven applications, in which malicious SQL statements are inserted into an entry field for execution (e.g. to dump the database contents to the attacker). SQL injection must exploit a security vulnerability in an application's software, for example, when user input is either incorrectly filtered for string literal escape characters embedded in SQL statements or user input is not strongly typed and unexpectedly executed. SQL injection is mostly known as an attack vector for websites but can be used to attack any type of SQL database.
SQL injection attacks allow attackers to spoof identity, tamper with existing data, cause repudiation issues such as voiding transactions or changing balances, allow the complete disclosure of all data on the system, destroy the data or make it otherwise unavailable, and become administrators of the database server. Document-oriented NoSQL databases can also be affected by this security vulnerability.
In a 2012 study, it was observed that the average web application received four attack campaigns per month, and retailers received twice as many attacks as other industries.
History
The first public discussions of SQL injection started appearing around 1998; for example, a 1998 article in Phrack Magazine.
Form
SQL injection (SQLI) was considered one of the top 10 web application vulnerabilities of 2007 and 2010 by the Open Web Application Security Project. In 2013, SQLI was rated the number one attack on the OWASP top ten. There are four main sub-classes of SQL injection:
Classic SQLI
Blind or Inference SQL injection
Database management system-specific SQLI
Compounded SQLI
SQL injection + insufficient authentication
SQL injection + DDoS attacks
SQL injection + DNS hijacking
SQL injection + XSS
The Storm Worm is one representation of Compounded SQLI.
This classification represents the state of SQLI, respecting its evolution until 2010—further refinement is underway.
Technical implementations
Incorrectly constructed SQL statements
This form of injection relies on the fact that SQL statements consist of both data used by the SQL statement and commands that control how the SQL statement is executed. For example, in the SQL statement select * from person where name = 'susan' and age = 2 the string 'susan' is data and the fragment and age = 2 is an example of a command (the value 2 is also data in this example).
SQL injection occurs when specially crafted user input is processed by the receiving program in a way that allows the input to exit a data context and enter a command context. This allows the attacker to alter the structure of the SQL statement which is executed.
As a simple example, imagine that the data 'susan' in the above statement was provided by user input. The user entered the string 'susan' (without the apostrophes) in a web form text entry field, and the program used string concatenation statements to form the a |
https://en.wikipedia.org/wiki/Chamber | Chamber or The Chamber may refer to:
Organizations and government
Chamber of commerce, a form of business network
Legislative chamber, a deliberative assembly within a legislature
Debate chamber, a room for people to discuss and debate
Arts and entertainment
Chamber (character), in Marvel comics
The Chamber (game show), an American TV show
The Chamber (novel), by John Grisham, 1994
The Chamber (1996 film), based on the novel
The Chamber (2016 film), a survival film
, a German musical ensemble
Other uses
Chamber (firearms), part of a weapon
Combustion chamber, part of an engine in which fuel is burned
Environmental chamber, used in testing environmental conditions
Execution chamber, where capital punishment is carried out
Gas chamber, apparatus for killing humans or animals
Chambar, or Chamber, a town in Pakistan
See also
Chambers (disambiguation)
Chamber music (disambiguation)
Great chamber, in an English castle or manor house
Chambre (disambiguation), French for chamber
Room |
https://en.wikipedia.org/wiki/WIN%20Television | WIN Television is an Australian television network owned by WIN Corporation that is based in Wollongong, New South Wales. WIN commenced transmissions on 18 March 1962 as a single television station covering the Wollongong region. The WIN Network has since grown to cover much of regional Australia. The network's name, WIN, originates from its first station, Wollongong's WIN-4. WIN has a programme supply agreement with metropolitan broadcaster Nine Network, covering its stations in Regional Queensland, Southern and Western New South Wales, Griffith, Regional Victoria, Mildura, Tasmania, Eastern South Australia, and Regional Western Australia. WIN also has a programme supply agreement with third-placed metropolitan broadcaster Network 10 for its Northern New South Wales station. WIN also produces and broadcasts weeknight half-hour local news bulletins across its Queensland, southern New South Wales, Victoria, and Tasmania markets as WIN News.
Regional services
Through its many television broadcast licences, WIN re-broadcasts metropolitan network content into regional Australian markets, as follows:
History
Early years in Wollongong
Television Wollongong Transmission Limited (TWT) was incorporated on 4 October 1955 by a group of local businessmen. Five years later, it was awarded a licence by the Postmaster-General's Department over a number of other groups aligned to Sydney-based stations ATN-7 and TCN-9 to broadcast to the Illawarra and South Coast regions. The new station was to broadcast on the VHF-4 frequency, using the callsign WIN (which stood for Wollongong Illawarra New South Wales), in line with other Australian call signs.
1980–1999: aggregation and expansion
During this period, WIN expanded through the purchase of stations in Victoria, Queensland, and New South Wales. In 1984, WIN became the first regional television station to transmit stereophonic sound. Close links between WIN Television and the Nine Network ensured the Nine Network affiliation for southern New South Wales when aggregation occurred in March 1989. The changes meant that WIN expanded into the rest of southern New South Wales, launching new stations in Canberra, Orange, Bathurst, Dubbo, and Wagga Wagga, with new buildings and studios built in Orange, Wagga, and Canberra. Aggregation also provided the network with two additional competitors, The Prime Network and Capital Television.
In 1990, WIN purchased Queensland station Star TV, with stations in Rockhampton (RTQ) and the Darling Downs (DDQ and SDQ), just weeks before aggregation was to occur in regional Queensland. The station had already been set to become a Network 10 affiliate under its previous owners; however, WIN's links with the Nine Network enabled it to clinch the Nine Network affiliation away from QTV, which was then forced to affiliate with third-placed Network Ten with just days to go.
ENT Limited, a Launceston-based company that owned a number of television and radio stations in regional Victoria a |
https://en.wikipedia.org/wiki/Flowchart | A flowchart is a type of diagram that represents a workflow or process. A flowchart can also be defined as a diagrammatic representation of an algorithm, a step-by-step approach to solving a task.
The flowchart shows the steps as boxes of various kinds, and their order by connecting the boxes with arrows. This diagrammatic representation illustrates a solution model to a given problem. Flowcharts are used in analyzing, designing, documenting or managing a process or program in various fields.
Overview
Flowcharts are used to design and document simple processes or programs. Like other types of diagrams, they help visualize the process. Two of the many benefits are flaws and bottlenecks may become apparent. Flowcharts typically use the following main symbols:
A process step, usually called an activity, is denoted by a rectangular box.
A decision is usually denoted by a diamond.
A flowchart is described as "cross-functional" when the chart is divided into different vertical or horizontal parts, to describe the control of different organizational units. A symbol appearing in a particular part is within the control of that organizational unit. A cross-functional flowchart allows the author to correctly locate the responsibility for performing an action or making a decision, and to show the responsibility of each organizational unit for different parts of a single process.
Flowcharts represent certain aspects of processes and are usually complemented by other types of diagram. For instance, Kaoru Ishikawa defined the flowchart as one of the seven basic tools of quality control, next to the histogram, Pareto chart, check sheet, control chart, cause-and-effect diagram, and the scatter diagram. Similarly, in UML, a standard concept-modeling notation used in software development, the activity diagram, which is a type of flowchart, is just one of many different diagram types.
Nassi-Shneiderman diagrams and Drakon-charts are an alternative notation for process flow.
Common alternative names include: flow chart, process flowchart, functional flowchart, process map, process chart, functional process chart, business process model, process model, process flow diagram, work flow diagram, business flow diagram. The terms "flowchart" and "flow chart" are used interchangeably.
The underlying graph structure of a flowchart is a flow graph, which abstracts away node types, their contents and other ancillary information.
History
The first structured method for documenting process flow, the "flow process chart", was introduced by Frank and Lillian Gilbreth in the presentation "Process Charts: First Steps in Finding the One Best Way to do Work", to members of the American Society of Mechanical Engineers (ASME) in 1921. The Gilbreths' tools quickly found their way into industrial engineering curricula. In the early 1930s, an industrial engineer, Allan H. Mogensen began to train business people in the use of some of the tools of industrial engineering at hi |
https://en.wikipedia.org/wiki/Workgroup | Workgroup may refer to:
Courtroom Workgroup, an informal arrangement between a criminal prosecutor, criminal defense attorney, and the judicial officer
Workgroup (computer networking), a peer-to-peer computer network
Working group, a group of people working together toward a common goal
Work Group, American record label |
https://en.wikipedia.org/wiki/Chess%20engine | In computer chess, a chess engine is a computer program that analyzes chess or chess variant positions, and generates a move or list of moves that it regards as strongest.
A chess engine is usually a back end with a command-line interface with no graphics or windowing. Engines are usually used with a front end, a windowed graphical user interface such as Chessbase or WinBoard that the user can interact with via a keyboard, mouse or touchscreen. This allows the user to play against multiple engines without learning a new user interface for each, and allows different engines to play against each other.
Many chess engines are now available for mobile phones and tablets, making them even more accessible.
History
The meaning of the term "chess engine" has evolved over time. In 1986, Linda and Tony Scherzer entered their program Bebe into the 4th World Computer Chess Championship, running it on "Chess Engine," their brand name for the chess computer hardware made, and marketed by their company Sys-10, Inc. By 1990 the developers of Deep Blue, Feng-hsiung Hsu and Murray Campbell, were writing of giving their program a 'searching engine,' apparently referring to the software rather than the hardware. In December 1991, Computer-schach & Spiele referred to Chessbase's recently released Fritz as a 'Schach-motor,' the German translation for 'chess engine. By early 1993, Marty Hirsch was drawing a distinction between commercial chess programs such as Chessmaster 3000 or Battle Chess on the one hand, and 'chess engines' such as ChessGenius or his own MChess Pro on the other. In his characterization, commercial chess programs were low in price, had fancy graphics, but did not place high on the SSDF (Swedish Chess Computer Association) rating lists while engines were more expensive, and did have high ratings.
In 1994, Shay Bushinsky was working on an early version of his Junior program. He wanted to focus on the chess playing part rather than the graphics, and so asked Tim Mann how he could get Junior to communicate with Winboard. Tim's answer formed the basis for what became known as the Chess Engine Communication Protocol or Winboard engines, originally a subset of the GNU Chess command line interface.
Also in 1994, Stephen J. Edwards released the Portable Game Notation (PGN) specification. It mentions PGN reading programs not needing to have a "full chess engine." It also mentions three "graphical user interfaces" (GUI): XBoard, pgnRead and Slappy the database.
By the mid-2000s, engines had become so strong that they were able to beat even the best human players. In 2005, Michael Adams, a world top 10 player at the time, was comprehensively beaten 5½ - ½ by Hydra, drawing only one of the six games. Except for entertainment purposes, especially using engines with limited strength, matches between humans and engines are now rare; engines are increasingly regarded as tools for analysis rather than as opponents.
Interface protocol
Common Winboa |
https://en.wikipedia.org/wiki/ChipTest | ChipTest was a 1985 chess playing computer built by Feng-hsiung Hsu, Thomas Anantharaman and Murray Campbell at Carnegie Mellon University. It is the predecessor of Deep Thought which in turn evolved into Deep Blue.
ChipTest was based on a special VLSI-technology move generator chip developed by Hsu. ChipTest was controlled by a Sun-3/160 workstation and capable of searching approximately 50,000 moves per second. Hsu and Anantharaman entered ChipTest in the 1986 North American Computer Chess Championship, and it was only partially tested when the tournament began. It lost its first two rounds, but finished with an even score.
In August 1987 ChipTest was overhauled and renamed ChipTest-M, M standing for microcode. The new version had eliminated ChipTest's bugs and was ten times faster, searching 500,000 moves per second and running on a Sun-4 workstation. ChipTest-M won the North American Computer Chess Championship in 1987 with a 4–0 sweep.
ChipTest was invited to play in the 1987 American Open, but the team did not enter due to an objection by the HiTech team, also from Carnegie Mellon University. HiTech and ChipTest shared some code, and Hitech was already playing in the tournament. The two teams became rivals.
Designing and implementing ChipTest revealed many possibilities for improvement, so the designers started on a new machine. Deep Thought 0.01 was created in May 1988 and the version 0.02 in November the same year. This new version had two customized VLSI chess processors and it was able to search 720,000 moves per second. With the "0.02" dropped from its name, Deep Thought won the World Computer Chess Championship with a perfect 5–0 score in 1989.
See also
Computer chess
Deep Thought, the second in the line of chess computers developed by Feng-hsiung Hsu
Deep Blue (chess computer), another chess computer developed by Feng-hsiung Hsu, being the first computer to win a chess match against the world champion
References
External links
The making of Deep Blue, overview, IBM Research
Chess computers
One-of-a-kind computers
Carnegie Mellon University |
https://en.wikipedia.org/wiki/Hubble%20Ultra-Deep%20Field | The Hubble Ultra-Deep Field (HUDF) is a deep-field image of a small region of space in the constellation Fornax, containing an estimated 10,000 galaxies. The original data for the image was collected by the Hubble Space Telescope from September 2003 to January 2004. It includes light from galaxies that existed about 13 billion years ago, some 400 to 800 million years after the Big Bang.
The HUDF image was taken in a section of the sky with a low density of bright stars in the near-field, allowing much better viewing of dimmer, more distant objects. Located southwest of Orion in the southern-hemisphere constellation Fornax, the rectangular image is 2.4 arcminutes to an edge, or 3.4 arcminutes diagonally. This is about one-tenth of the angular diameter of a full moon viewed from Earth (less than 34 arcminutes), smaller than a 1 mm2 piece of paper held 1 m away, and equal to roughly one twenty-six-millionth of the total area of the sky. The image is oriented so that the upper left corner points toward north (−46.4°) on the celestial sphere.
In August and September 2009, the HUDF field was observed at longer wavelengths (1.0 to 1.6 µm) using the infrared channel of the recently fitted Wide Field Camera 3 (WFC3). This additional data enabled astronomers to identify a new list of potentially very distant galaxies.
On September 25, 2012, NASA released a new version of the Ultra-Deep Field dubbed the eXtreme Deep Field (XDF). The XDF reveals galaxies from 13.2 billion years ago, including one thought to have formed only 450 million years after the Big Bang.
On June 3, 2014, NASA released the Hubble Ultra Deep Field 2014 image, the first HUDF image to use the full range of ultraviolet to near-infrared light. A composite of separate exposures taken in 2002 to 2012 with Hubble's Advanced Camera for Surveys and Wide Field Camera 3, it shows some 10,000 galaxies.
On January 23, 2019, the Instituto de Astrofísica de Canarias released an even deeper version of the infrared images of the Hubble Ultra Deep Field obtained with the WFC3 instrument, named the ABYSS Hubble Ultra Deep Field. The new images improve the previous reduction of the WFC3/IR images, including careful sky background subtraction around the largest galaxies on the field of view. After this update, some galaxies were found to be almost twice as big as previously measured.
Planning
In the years since the original Hubble Deep Field, the Hubble Deep Field South and the GOODS sample were analyzed, providing increased statistics at the high redshifts probed by the HDF. When the Advanced Camera for Surveys (ACS) detector was installed on the HST, it was realized that an ultra-deep field could observe galaxy formation out to even higher redshifts than had currently been observed, as well as providing more information about galaxy formation at intermediate redshifts (z~2). A workshop on how to best carry out surveys with the ACS was held at STScI in late 2002. At the workshop Massimo Stiavelli adv |
https://en.wikipedia.org/wiki/Shredder%20%28software%29 | Shredder is a commercial chess engine and graphical user interface (GUI) developed in Germany by Stefan Meyer-Kahlen in 1993. Shredder won the World Microcomputer Chess Championship in 1996 and 2000, the World Computer Chess Championship in 1999 and 2003, the World Computer Speed Chess Championship in 2002, 2003, 2004, 2005, and 2007, and the World Chess Software Championship in 2010.
The Shredder engine version 10.0 was released in June 2006. Version 11.0 was released in October 2007. Version 12 was released in January 2010. The "Deep" version takes advantage of multiple CPUs or multiple core CPUs. Version 13 was released on 30 October 2016. Version 13 is about 300 Elo better than Version 12.
Shredder is one of the few commercial chess programs which is available not only for Windows and Mac OS, but also for Linux. Shredder is also available on the iPhone, the iPad and Android. GNOME Chess is used as the graphical front-end for Shredder.
Competition results
Shredder has participated in a number of computer chess tournaments since its inception. The following events are the tournaments in which Shredder has won.
See also
Computer chess
Fischer random chess
Universal Chess Interface
World Computer Chess Championship
Top Chess Engine Championship
References
External links
Chess engines
1993 software
Video game companies of Germany |
https://en.wikipedia.org/wiki/Prediction%20by%20partial%20matching | Prediction by partial matching (PPM) is an adaptive statistical data compression technique based on context modeling and prediction. PPM models use a set of previous symbols in the uncompressed symbol stream to predict the next symbol in the stream. PPM algorithms can also be used to cluster data into predicted groupings in cluster analysis.
Theory
Predictions are usually reduced to symbol rankings.
Each symbol (a letter, bit or any other amount of data) is ranked before it is compressed, and the ranking system determines the corresponding codeword (and therefore the compression rate).
In many compression algorithms, the ranking is equivalent to probability mass function estimation. Given the previous letters (or given a context), each symbol is assigned with a probability.
For instance, in arithmetic coding the symbols are ranked by their probabilities to appear after previous symbols, and the whole sequence is compressed into a single fraction that is computed according to these probabilities.
The number of previous symbols, n, determines the order of the PPM model which is denoted as PPM(n). Unbounded variants where the context has no length limitations also exist and are denoted as PPM*. If no prediction can be made based on all n context symbols, a prediction is attempted with n − 1 symbols. This process is repeated until a match is found or no more symbols remain in context. At that point a fixed prediction is made.
Much of the work in optimizing a PPM model is handling inputs that have not already occurred in the input stream. The obvious way to handle them is to create a "never-seen" symbol which triggers the escape sequence. But what probability should be assigned to a symbol that has never been seen? This is called the zero-frequency problem. One variant uses the Laplace estimator, which assigns the "never-seen" symbol a fixed pseudocount of one. A variant called PPMd increments the pseudocount of the "never-seen" symbol every time the "never-seen" symbol is used. (In other words, PPMd estimates the probability of a new symbol as the ratio of the number of unique symbols to the total number of symbols observed).
Implementation
PPM compression implementations vary greatly in other details. The actual symbol selection is usually recorded using arithmetic coding, though it is also possible to use Huffman encoding or even some type of dictionary coding technique. The underlying model used in most PPM algorithms can also be extended to predict multiple symbols. It is also possible to use non-Markov modeling to either replace or supplement Markov modeling. The symbol size is usually static, typically a single byte, which makes generic handling of any file format easy.
Published research on this family of algorithms can be found as far back as the mid-1980s. Software implementations were not popular until the early 1990s because PPM algorithms require a significant amount of RAM. Recent PPM implementations are among the best-perfo |
https://en.wikipedia.org/wiki/Cecil%20%28programming%20language%29 | Cecil is a pure object-oriented programming language that was developed by Craig Chambers at the University of Washington in 1992 to be part of the Vortex project there. Cecil has many similarities to other object-oriented languages, most notably Objective-C, Modula-3, and Self. The main goals of the project were extensibility, orthogonality, efficiency, and ease-of-use.
The language supports multiple dispatch and multimethods, dynamic inheritance, and optional static type checking. Unlike most other OOP systems, Cecil allows subtyping and code inheritance to be used separately, allowing run-time or external extension of object classes or instances. Like Objective-C, all object services in Cecil are invoked by message passing, and the language supports run-time class identification. These features allow Cecil to support dynamic, exploratory programming styles. Parameterized types and methods (generics, polymorphism), garbage collection, and delegation are also supported. Cecil also supports a module mechanism for isolating independent libraries or packages. Cecil does not presently support threads or any other form of concurrency. A standard library for Cecil is also available and includes various collection, utility, system, I/O, and GUI classes.
The Diesel language was the successor of Cecil.
References
External links
UW Cecil Group: Home Official webpage
Cecil language features
Dynamically typed programming languages
Object-oriented programming languages
Prototype-based programming languages |
https://en.wikipedia.org/wiki/Playing%20It%20Straight | Playing It Straight is an American reality television series broadcast by the Fox Broadcasting Company (Fox). The series premiered on March 12, 2004, although it was abruptly cancelled by the network following the broadcast of its third episode on March 26, 2004. Filmed in Elko, Nevada, at the Sizzling Saddle Ranch, the series followed Jackie Thomas, a 21-year-old college student, as she was pursued by a group of fourteen men. Upon arrival to the ranch, it was revealed to Thomas that the group consisted of both straight and gay men. Through a series of individual and group dates, Thomas was required to eliminate men from the competition who she believed identified as gay. If Thomas ultimately selected a straight man, then the two split a reward of $1,000,000. However, if Thomas selected a gay man, he alone won the reward. The series was hosted by American television presenter Daphne Brogdon.
Playing It Straight was a part of Fox's intent to capitalize on a rising interest in LGBT-themed reality television shows. The series was conceived by producers as a version of the The Bachelor with an LGBT-related twist. Playing It Straight, however, was met with criticism from many television critics who believed that it reinforced stereotypes and promoted a negative portrayal of gay men. Playing It Straight premiered to modest ratings, which declined with the broadcast of its subsequent episodes. The series' mid-season cancellation impacted other LGBT-themed reality television shows, as it prompted some network executives to believe that the genre was unprofitable. On January 17, 2005, Fox released the full series on their website on a pay-per-view basis. Playing It Straight spawned adaptations in Australia, the United Kingdom, and the Netherlands.
Format
Set in Elko, Nevada, at the Sizzling Saddle Ranch, the series followed Jackie Thomas, a 21-year-old college student from Wisconsin, as she was pursued by a group of fourteen men. Upon arrival to the ranch, Thomas learned that the group was composed of both straight and gay men; all of the gay men attempted to pass as straight throughout the course of the competition. Thomas was required to discern which of the men identified as gay; she made her determinations based on observations from a series of individual and group dates. These dates included activities such as shopping trips and swimsuit competitions. At the end of each week, Jackie was required to eliminate two men from the competition who she believed to be gay. Following their elimination, each man had the opportunity to disclose their sexual orientation and explain their reason for participating in the series. If Thomas ultimately selected a straight man at the end of the competition, then the two split a reward of $1,000,000. Conversely, if Thomas selected a gay man at the end of the competition, then he alone won the reward. The series was hosted by American television presenter Daphne Brogdon.
Production
Production for Playing It Straight |
https://en.wikipedia.org/wiki/FADEC | A full authority digital engine (or electronics) control (FADEC) is a system consisting of a digital computer, called an "electronic engine controller" (EEC) or "engine control unit" (ECU), and its related accessories that control all aspects of aircraft engine performance. FADECs have been produced for both piston engines and jet engines.
History
The goal of any engine control system is to allow the engine to perform at maximum efficiency for a given condition. Originally, engine control systems consisted of simple mechanical linkages connected physically to the engine. By moving these levers the pilot or the flight engineer could control fuel flow, power output, and many other engine parameters. The mechanical/hydraulic engine control unit for Germany's BMW 801 piston aviation radial engine of World War II was just one notable example of this in its later stages of development. This mechanical engine control was progressively replaced first by analog electronic engine control and, later, digital engine control.
Analog electronic control varies an electrical signal to communicate the desired engine settings. The system was an evident improvement over mechanical control but had its drawbacks, including common electronic noise interference and reliability issues. Full authority analogue control was used in the 1960s and introduced as a component of the Rolls-Royce/Snecma Olympus 593 engine of the supersonic transport aircraft Concorde. However, the more critical inlet control was digital on the production aircraft.
Digital electronic control followed. In 1968, Rolls-Royce and Elliott Automation, in conjunction with the National Gas Turbine Establishment, worked on a digital engine control system that completed several hundred hours of operation on a Rolls-Royce Olympus Mk 320. In the 1970s, NASA and Pratt and Whitney experimented with their first experimental FADEC, first flown on an F-111 fitted with a highly modified Pratt & Whitney TF30 left engine. The experiments led to Pratt & Whitney F100 and Pratt & Whitney PW2000 being the first military and civil engines, respectively, fitted with FADEC, and later the Pratt & Whitney PW4000 as the first commercial "dual FADEC" engine. The first FADEC in service was the Rolls-Royce Pegasus engine developed for the Harrier II by Dowty and Smiths Industries Controls.
Function
True full authority digital engine controls have no form of manual override nor manual controls available, placing full authority over all of the operating parameters of the engine in the hands of the computer. If a total FADEC failure occurs, the engine fails. If the engine is controlled digitally and electronically but allows for manual override, it is considered to be an EEC or ECU. An EEC, though a component of a FADEC, is not by itself FADEC. When standing alone, the EEC makes all of the decisions until the pilot wishes to intervene. The term FADEC is often misused for partial digital engine controls, such as those on |
https://en.wikipedia.org/wiki/E%21 | E! Entertainment Television is an American basic cable television network. It is owned by the NBCUniversal Media Group division of Comcast's NBCUniversal. The channel focuses primarily on pop culture, celebrity based reality shows and movies.
As of January 2016, E! is available to 92.4 million households in the United States.
History
Movietime
E! was originally launched on July 31, 1987, as Movietime, a service that aired movie trailers, entertainment news, event and awards coverage, and interviews as an early example of a national barker channel. The channel was founded by Larry Namer and Alan Mruvka. Early Movietime hosts included Greg Kinnear, Katie Wagner, Julie Moran, Suzanne Kay (daughter of Diahann Carroll), Mark DeCarlo, Sam Rubin and Richard Blade.
E!
Controlling ownership was originally held by a consortium of five cable television providers (Comcast, Continental Cablevision, Cox Cable, TCI, and Warner Cable), HBO/Warner Communications, and various founding shareholders, with HBO directly programming and managing the network. In 1989, after Time Inc. bought Warner Communications to fend off a takeover bid by Paramount, the new Time Warner company held four of the eight major ownership positions and took over management control of Movietime and renamed the network as E!: Entertainment Television on June 1, 1990 based in Los Angeles; this name change was made to emphasize its widening coverage of the celebrity–industrial complex, contemporary film, television and music, daily Hollywood gossip, and fashion.
In 1997, Comcast, one of the minority partners, teamed up with Disney/ABC Cable Networks to buy the channel after Time Warner had exercised their put agreement. Comcast increased the ownership stakes in the network through mergers with forerunners of TCI and Continental under various circumstances. In November 2006, Comcast acquired Disney's 39.5% share of E! for $1.23 billion to gain full ownership of the network as part of a broader programming carriage agreement between Disney/ABC and Comcast.
In January 2011, Comcast Entertainment Group, the company's television unit, became a division of the NBCUniversal Television Group, after Comcast acquired a 51% majority stake in NBCUniversal from General Electric. E!'s only sister networks prior to the NBC Universal merger were the now-defunct channels Style Network (then Esquire Network), PBS Kids Sprout and G4, along with Comcast's sports networks: Versus, Comcast SportsNet and Golf Channel. In the case of Versus, E! staff produced that network's Sports Soup and G4's Web Soup, while the Orlando-based Golf Channel featured no crossovers with E! at all due to incompatible audiences and operations. Versus and Golf Channel were taken under the direct control of the NBC Sports division, with the former being renamed NBC Sports Network in January 2012, and are no longer connected to their former sister networks beyond advertising and in-house operations.
On July 9, 2012, the channel intro |
https://en.wikipedia.org/wiki/Esquire%20Network | Esquire Network was an American pay television network that was a 50/50 joint venture between NBCUniversal and the Hearst Corporation. The network carried programs aimed at a metrosexual audience centering on travel, cooking, sports and fashion, along with reruns of popular sitcoms and dramas.
History
Style Network
The channel was originally launched as the Style Network (although on-air promotions typically referred to it as simply "Style") on October 1, 1998, serving as a spin-off of E!. It was intended to leverage E!'s coverage of fashion and to provide an expanded venue for shows such as Fashion Emergency. The network focused on fashion, design, interior decoration and urban lifestyle-related programming. Style provided coverage of events like New York Fashion Week and showcased various designers. Early programming included: The Look for Less, Shabby Chic with Rachel Ashwell, Glow: The Beauty Show, Vogue Takes..., Stylemaker, Model, Runway, Dining with Style, and Homes with Style. Around 2003, the channel began airing a variety of "makeover" shows. The home makeover show Clean House lasted for ten seasons on the network; How Do I Look? lasted eight seasons.
Starting around 2008, Style shifted its focus to personality-based reality programing such as Jerseylicious, Tia & Tamera, and Big Rich Texas, along with a female-focused spin-off of The Soup known as The Dish. On June 25, 2012, the Style Network was rebranded with a revised logo and a new slogan: "Work it. Love it. Style it." In 2013, the channel launched two real estate related shows: Hot Listings: Miami and Built, which featured male models remodeling houses.
Esquire Network transition
In December 2012, NBCUniversal signed a brand licensing deal with the Hearst Corporation, owner of Esquire magazine, to relaunch G4 into Esquire Network, which would air shows aimed at a metrosexual audience about travel, cooking, fashion and other male-targeted programming that is not sports related, including the addition of acquired and archived program content from the NBCUniversal library such as Party Down, Parks and Recreation and week-delayed episodes of Late Night with Jimmy Fallon.
The rebranding was scheduled to take place on April 22, 2013, but was moved to an unspecified date in the summer on April 15, 2013, as network general manager Adam Stotsky stated the rebranding was pushed back in order to have a broader slate of original series to launch than would have been available for the April launch. In May 2013, the launch date was pushed to September 23, 2013, with its first program being an 80th anniversary special on Esquire which was rebroadcast later in primetime.
On September 9, 2013, NBCUniversal announced that it would replace Style Network with Esquire Network, leaving G4 "as is for the foreseeable future, though it's highly unlikely the company will invest in more original programming" according to The Hollywood Reporter. One of the factors was likely Style's distribution on Di |
https://en.wikipedia.org/wiki/Perl%20module | A Perl module is a discrete component of software for the Perl programming language. Technically, it is a particular set of conventions for using Perl's package mechanism that has become universally adopted.
A module defines its source code to be in a package (much like a Java package), the Perl mechanism for defining namespaces, e.g. CGI or Net::FTP or XML::Parser; the file structure mirrors the namespace structure (e.g. the source code for Net::FTP is in Net/FTP.pm). Furthermore, a module is the Perl equivalent of the class when object-oriented programming is employed.
A collection of modules, with accompanying documentation, build scripts, and usually a test suite, composes a distribution. The Perl community has a sizable library of distributions available for search and download via CPAN.
Perl is a language allowing many different styles of programming. A developer is as likely to find a module written in a procedural style (for example, Test::Simple) as object-oriented (e.g. XML::Parser), both are considered equally valid according to what the module needs to do. Modules might also be used to mixin methods (DBIx::Class) or be a pragma (strict.pm) which has an effect immediately upon being loaded. Modules can even be used to alter the syntax of the language. The effect of Perl modules are usually limited to the current scope in which it was loaded.
It is common for Perl modules to have embedded documentation in Perl's Plain Old Documentation format. POD imposes little structure on the author. It is flexible enough to be used to write articles, web pages and even entire books such as Programming Perl. Contrast with javadoc which is specialized to documenting Java classes. By convention, module documentation typically follows the structure of a Unix man page.
The language of Perl is defined by the single implementation (referred to as "perl") and is added to (and in rare occasions taken away from) each new release. For this reason it is important for a module author to be aware what features they're making use of and what the minimum required version of perl is. The code on this page requires perl 5.6.0 which is considered rather old by now.
Examples
What follows are examples of "Hello, World" implemented in different styles of modules. It must be understood that a module is not necessary in Perl; functions and code can be defined and used anywhere. This is just for example purposes. Contrast with Java where a class is always necessary. A real "Hello, World" function would be written like so:
sub hello { "Hello, world!\n" }
print hello();
or simply printed in one line:
print "Hello, world!\n";
Procedural example
Here is "Hello, World" implemented as a procedural module with a customizable target for the greeting, just to make things interesting. Also included is a short script to illustrate the module's use.
hello_world.pl
#!/usr/bin/perl
# Loads the module and imports any functions into our namespace
# (defaults to "m |
https://en.wikipedia.org/wiki/ISDN%20User%20Part | The ISDN (Integrated Services Digital Network) User Part or ISUP is part of Signaling System No. 7 (SS7), which is used to set up telephone calls in the public switched telephone network (PSTN). It is specified by the ITU-T as part of the Q.76x series.
When a telephone call is set up from one subscriber to another, several telephone exchanges could be involved, possibly across international boundaries. To allow a call to be set up correctly, where ISUP is supported, a switch will signal call-related information like called party number to the next switch in the network using ISUP messages.
The telephone exchanges may be connected via T1 or E1 trunks which transport the speech from the calls. These trunks are divided into 64 kbit/s timeslots, and one timeslot can carry exactly one call. Regardless of what facilities are used to interconnect switches, each circuit between two switches is uniquely identified by a circuit identification code (CIC) that is included in the ISUP messages. The exchange uses this information along with the received signaling information (especially the called party number) to determine which inbound and outbound circuits should be connected together to provide an end to end speech path.
In addition to call related information, ISUP is also used to exchange status information for, and permit management of, the available circuits. In the case of no outbound circuit being available on a particular exchange, a release message is sent back to the preceding switches in the chain.
ISUP variants
Different ISUP variants exist. ITU-T specifies the variant used in the international network. In Europe ETSI releases its own ISUP specification which is close that of the ITU-T. ITU-T ISUP is used for international connections and is the base for some national ISUP variants. Most countries have their own variation of ISUP to cover national requirements. ANSI specifies variations of ISUP utilized under the North American Numbering Plan; however, some countries under the NANP differ in their support of some procedures (for example, LATA is meaningless within Canada. Also, RBOCs support Telcordia procedures not fully specified by ANSI.) Some countries outside the NANP support ANSI-based variants (e.g. Mexico).
While these variations of ISUP differ in subtle ways, the vast majority of ISUP message type, parameter type, and parameter field code-points, and related fundamental call processing procedures, agree across all variants.
ITU-T specification versions
1980 – ISUP Yellow Book
1984 – ISUP Red Book
1988 – ISUP Blue Book
1991 – ISUP Q.767
1992 – ISUP'92 White Book (segmentation, compatibility, new supplementary services)
1997 – ISUP'97 (new procedures, IN CS1, new supplementary services)
According to ITU-T Q.761 section 2.4.1 ISUP interworking ISUP'92 is backwards compatible with ISUP Blue Book and Q.767 for basic call procedures and supplementary services except for some procedures (e.g. number portability). Additional |
https://en.wikipedia.org/wiki/Tiny%20Encryption%20Algorithm | In cryptography, the Tiny Encryption Algorithm (TEA) is a block cipher notable for its simplicity of description and implementation, typically a few lines of code. It was designed by David Wheeler and Roger Needham of the Cambridge Computer Laboratory; it was first presented at the Fast Software Encryption workshop in Leuven in 1994, and first published in the proceedings of that workshop.
The cipher is not subject to any patents.
Note that this cipher is unrelated to the TETRA Encryption Algorithm.
Properties
TEA operates on two 32-bit unsigned integers (could be derived from a 64-bit data block) and uses a 128-bit key. It has a Feistel structure with a suggested 64 rounds, typically implemented in pairs termed cycles. It has an extremely simple key schedule, mixing all of the key material in exactly the same way for each cycle. Different multiples of a magic constant are used to prevent simple attacks based on the symmetry of the rounds. The magic constant, 2654435769 or 0x9E3779B9 is chosen to be , where is the golden ratio (as a nothing-up-my-sleeve number).
TEA has a few weaknesses. Most notably, it suffers from equivalent keys—each key is equivalent to three others, which means that the effective key size is only 126 bits. As a result, TEA is especially bad as a cryptographic hash function. This weakness led to a method for hacking Microsoft's Xbox game console, where the cipher was used as a hash function. TEA is also susceptible to a related-key attack which requires 223 chosen plaintexts under a related-key pair, with 232 time complexity. Because of these weaknesses, the XTEA cipher was designed.
Versions
The first published version of TEA was supplemented by a second version that incorporated extensions to make it more secure. Block TEA (which was specified along with XTEA) operates on arbitrary-size blocks in place of the 64-bit blocks of the original.
A third version (XXTEA), published in 1998, described further improvements for enhancing the security of the Block TEA algorithm.
Reference code
Following is an adaptation of the reference encryption and decryption routines in C, released into the public domain by David Wheeler and Roger Needham:
#include <stdint.h>
void encrypt (uint32_t v[2], const uint32_t k[4]) {
uint32_t v0=v[0], v1=v[1], sum=0, i; /* set up */
uint32_t delta=0x9E3779B9; /* a key schedule constant */
uint32_t k0=k[0], k1=k[1], k2=k[2], k3=k[3]; /* cache key */
for (i=0; i<32; i++) { /* basic cycle start */
sum += delta;
v0 += ((v1<<4) + k0) ^ (v1 + sum) ^ ((v1>>5) + k1);
v1 += ((v0<<4) + k2) ^ (v0 + sum) ^ ((v0>>5) + k3);
} /* end cycle */
v[0]=v0; v[1]=v1;
}
void decrypt (uint32_t v[2], const uint32_t k[4]) {
uint32_t v0=v[0], v1=v[1], sum=0xC6EF3720, i; /* set up; sum is (delta << 5) & 0xFFFFFFFF */
uint32_t delta=0x9E3779B9; |
https://en.wikipedia.org/wiki/Qt%20Extended | Qt Extended (named Qtopia before September 30, 2008) is an application platform for embedded Linux-based mobile computing devices such as personal digital assistants, video projectors and mobile phones. It was initially developed by The Qt Company, at the time known as Qt Software and a subsidiary of Nokia. When they cancelled the project the free software portion of it was forked by the community and given the name Qt Extended Improved. The QtMoko Debian-based distribution is the natural successor to these projects as continued by the efforts of the Openmoko community.
Features
Qt Extended features:
Windowing system
Synchronization framework
Integrated development environment
Internationalization and localization support
Games and multimedia
Personal information manager applications
Full screen handwriting
Input methods
Personalization options
Productivity applications
Internet applications
Java integration
Wireless support
Qt Extended is dual licensed under the GNU General Public License (GPL) and proprietary licenses.
Devices and deployment
As of 2006, Qtopia was running on several million devices, including 11 mobile phone models and 30 other handheld devices.
Models included the Sharp Corporation Zaurus line of Linux handhelds, the Sony mylo, the Archos Portable Media Assistant (PMA430) (a multimedia device), the GamePark Holdings GP2X, Greenphone (an open phone initiative), Pocket PC, FIC Openmoko phones: Neo 1973 and FreeRunner. An unofficial hack allows its use on the Archos wifi series of portable media players (PMP) 604, 605, 705, and also on several Motorola phones such as E2, Z6 and A1200. The U980 of ZTE is the last phone running it.
Software development
Native applications could be developed and compiled using C++. Managed applications could be developed in Java.
Discontinuation
On March 3, 2009, Qt Software announced the discontinuation of Qt Extended as a standalone product, with some features integrated on the Qt Framework.
Qt Extended Improved
The Openmoko community has forked the final stable release into Qt Extended Improved (later renamed to QtMoko) which, like its predecessor, is an application platform for embedded Linux-based mobile computing devices such as personal digital assistants, video projectors and mobile phones dual licensed under the GNU General Public License (GPL) and proprietary licenses.
Qt Extended Improved can run on several mobile devices, most notably the Openmoko phones: Neo 1973 and FreeRunner.
Other mobile operating systems
Access Linux Platform
Android
iOS
MeeGo
Nucleus RTOS
Openmoko Linux
Palm webOS
Symbian
Tizen
Windows Mobile
References
External links
Qt Extended Whitepaper from Qt Software
Embedded Linux
Mobile Linux
Mobile software
Openmoko
Personal digital assistant software
Software forks
Software that uses Qt |
https://en.wikipedia.org/wiki/Definition%20%28disambiguation%29 | A definition is a statement of the meaning of a term.
Definition may also refer to:
Science, mathematics and computing
In computer programming languages, a declaration that reserves memory for a variable or gives the body of a subroutine
Defining equation (physical chemistry), physico-chemical quantities defined in terms of others, in the form of an equation
Dynamical system (definition), description of a mathematical model, determined by a system of coupled differential equations
Circular definition, lexicographic, linguistic and logical aspects
Mathematics:
Intensional definition
Elementary definition
Algebraic definition
Recursive definition
Field of definition
A continuous function
A well-defined function
Music and TV
High-definition television, a television format with higher resolution
Definition (album), a 1992 studio album by American crossover thrash band Dirty Rotten Imbeciles
Definition (TV series), a long-running Canadian game show of the 1970s and 1980s
Definition (Jersey EP), 2001
Definition (Diaura EP), 2019
"Definition" (song), a 1998 song by Black Star
"Definition", a song by Mabel from About Last Night..., 2022
"Definitions" (How I Met Your Mother), a 2009 television episode
Other
#define, a macro in the C programming language
Defined (album), a 2005 operatic pop album
Definitions (Plato), a dictionary of about 185 philosophical terms sometimes included in the corpus of Plato's works
Dogmatic definition, the pronunciation of religious doctrine by a Pope or an ecumenical council |
https://en.wikipedia.org/wiki/EKB | EKB may refer to:
East Kentucky Broadcasting, an American television network
Egyptian Knowledge Bank, an Egyptian educational database
Ekibastuz Airport, in Kazakhstan
Eskbank railway station, in Scotland
National Housing Authority (Albania) (Albanian: )
Yekaterinburg, a city in Russia |
https://en.wikipedia.org/wiki/Dominions%20II%3A%20The%20Ascension%20Wars | Dominions II: The Ascension Wars is a 4X turn-based, computer strategy game. It was developed by Illwinter Game Design and published by Shrapnel Games. The game was released on November 14, 2003 in North America for Microsoft Windows, Mac OS X and Linux.
Dominions II: The Ascension Wars was the sequel to Dominions: Priests, Prophets and Pretenders. It was followed by Dominions 3: The Awakening in 2006.
Gameplay
Dominions II: The Ascension Wars is a 4X turn-based, computer strategy game. The players play the role of the god of one out of 17 different nations and battle each other for the dominance of a fantasy world. At the most basic level, Dominions II is similar to Risk. It is also similar to Civilization. The world is divided into many provinces that change hands after a tactical battle. The players use armies of men and monsters to fight these battles.
Game planning and startup
The players and game host (who may also play) find each other through out-of-game channels and decide on game setup. These decisions include:
which player will play which nation
the map which will be used
the game patch version and any modifications (mods)
settings of adjustable game parameters, such as strength of independent forces, difficulty of magical research, and frequency of random events and magic sites
how frequently players will expect turns to be played
any house rules for the game
Each player then designs their god. Each god-type costs design points which can be spent on the god's dominion properties, his/her magical abilities, or on the national castle type. The god's initial magic levels also determine the effect of the god's blessing, a special ability which enhances certain types of sacred troops. A god who wields powerful fire magic will enhance the attack skill of such troops and even set their weapons ablaze, whereas a god who focuses on nature magic will instead allow them to go berserk. It is possible to make a god who excels at magic and magical research but is physically weak, as well as a near-unkillable warrior-god with barely any magical powers at all. Dominion effects are adjusted by using design points to 'tilt' 6 scales (graphically 6 balance scales), which represent the nature of the god which becomes manifest in territory under his dominion. The 6 scales are Order/Turmoil, Productivity/Sloth, Heat/Cold, Growth/Death, Luck/Misfortune, and Magic/Drain.
Players each send the file with their pretender design to the host, who starts the game.
Game phases
Each turn of the game is split into two phases:
The planning phase
Each player's turn is a process of assessing the apparent opportunities and risks, and acting to advance their plans for world domination. Recruiting new units, sending messages to other players, reviewing the provinces' tax and unrest levels, and directing magic research are all ways of directing the nation overall.
Players also give specific orders to each of their commanders at the strategic level, such as |
https://en.wikipedia.org/wiki/Steve%20Furber | Stephen Byram Furber (born 21 March 1953) is a British computer scientist, mathematician and hardware engineer, currently the ICL Professor of Computer Engineering in the Department of Computer Science at the University of Manchester, UK. After completing his education at the University of Cambridge (BA, MMath, PhD), he spent the 1980s at Acorn Computers, where he was a principal designer of the BBC Micro and the ARM 32-bit RISC microprocessor. , over 100 billion copies of the ARM processor have been manufactured, powering much of the world's mobile computing and embedded systems.
In 1990, he moved to Manchester to lead research into asynchronous systems, low-power electronics and neural engineering, where the Spiking Neural Network Architecture (SpiNNaker) project is delivering a computer incorporating a million ARM processors optimised for computational neuroscience.
Education
Furber was educated at Manchester Grammar School and represented the UK in the International Mathematical Olympiad in Hungary in 1970 winning a bronze medal. He went on to study the Mathematical Tripos as an undergraduate student of St John's College, Cambridge, receiving a Bachelor of Arts (BA) and Master of Mathematics (MMath - Part III of the Mathematical Tripos) degrees. In 1978, he was appointed a Rolls-Royce research fellow in aerodynamics at Emmanuel College, Cambridge and was awarded a PhD in 1980 for research on the fluid dynamics of the Weis-Fogh principle supervised by John Ffowcs Williams. During his PhD in the late 1970s, Furber worked on a voluntary basis for Hermann Hauser and Chris Curry within the fledging Acorn Computers (originally the Cambridge Processor Unit), on a number of projects; notably a microprocessor based fruit machine controller, and the Proton - the initial prototype version of what was to become the BBC Micro, in support of Acorn's tender for the BBC Computer Literacy Project.
Career and research
In 1981, following the completion of his PhD and the award of the BBC contract to Acorn computers, Furber joined Acorn where he was a Hardware Designer and then Design Manager. He was involved in the final design and production of the BBC Micro and later, the Acorn Electron, and the ARM microprocessor. In August 1990 he moved to the University of Manchester to become the International Computers Limited (ICL) Professor of Computer Engineering and established the AMULET microprocessor research group.
Furber's main research interests are in neural networks, networks on chip and microprocessors. In 2003, Furber was a member of the EPSRC research cluster in biologically-inspired novel computation. On 16 September 2004, he gave a speech on Hardware Implementations of Large-scale Neural Networks as part of the initiation activities of the Alan Turing Institute.
Furber's most recent project SpiNNaker, is an attempt to build a new kind of computer that directly mimics the workings of the human brain. Spinnaker is an artificial neural network realise |
https://en.wikipedia.org/wiki/Department%20of%20Computer%20Science%2C%20University%20of%20Manchester | The Department of Computer Science at the University of Manchester is the longest established department of Computer Science in the United Kingdom and one of the largest. It is located in the Kilburn Building on the Oxford Road and currently has over 800 students taking a wide range of undergraduate and postgraduate courses and 60 full-time academic staff.
Teaching and study
Undergraduate
The Department currently offers a wide range of undergraduate courses from Bachelor of Science (BSc), Bachelor of Engineering (BEng) and Master of Engineering (MEng). These are available as single honours or as joint honours degrees within the themes of Artificial Intelligence, Computer Science, Computer systems engineering, Software engineering, Mathematics, Internet Computing, Business applications and Management. Industrial placements are offered with all undergraduate courses.
Postgraduate
At postgraduate level the department offers taught Master of Science (MSc) degrees, at an advanced level and also through a foundation route. Research degrees, Doctor of Philosophy (PhD) and Master of Philosophy (MPhil) are available as three and four year programmes through the Doctoral Training Centre in Computer Science, the first of its kind in the UK.
Notable academic staff
Notable academic staff include:
Andy Brass
Jack Dongarra
Steve Furber
Carole Goble
Toby Howard
Norman Paton
Steve Pettifer
Ulrike Sattler
Robert Stevens
Andrei Voronkov
The School is organised into nine different research groups, which received funding from a wide range of sources including the European Union, Engineering and Physical Sciences Research Council and Biotechnology and Biological Sciences Research Council.
Advanced Processor Technologies
The Advanced Processor Technologies (APT) group researches advanced and novel approaches to processing and computation and is led by Professor Steve Furber. New projects include SpiNNaker, Transactional Memory, and TERAFLUX. Academic staff in the group include Dr Jim Garside, Dr David Lester, Dr , Dr John V Woods, Dr Javier Navaridas, Dr Vasilis Pavlidis, Dr Dirk Koch and Fellow Barry Cheetham. Past research projects include Jamaica, AMULET microprocessor, Network On Chip, Asynchronous Digital signal processors and System on a chip.
Bio-Health Informatics
The Bio-Health Informatics Group (BHIG) conducts research in Bioinformatics and Health informatics ranging from the applications in molecular biology through to clinical e-science and healthcare applications. Academic staff in the group include Professor Andy Brass and Robert Stevens.
Formal Methods
The Formal Methods group has a very broad span of interests, ranging from developing the new mathematics of computational behaviour, to the study and development of system design and verification methods. There is a large group dedicated to the automation of logic including world-champion Vampire. The group is led by Professor and includes Professor Peter Aczel, Professor Andrei V |
https://en.wikipedia.org/wiki/TOPS-10 | TOPS-10 System (Timesharing / Total Operating System-10) is a discontinued operating system from Digital Equipment Corporation (DEC) for the PDP-10 (or DECsystem-10) mainframe computer family. Launched in 1967, TOPS-10 evolved from the earlier "Monitor" software for the PDP-6 and PDP-10 computers; this was renamed to TOPS-10 in 1970.
Overview
TOPS-10 supported shared memory and allowed the development of one of the first true multiplayer computer games. The game, called DECWAR, was a text-oriented Star Trek-type game. Users at terminals typed in commands and fought each other in real time. TOPS-10 was also the home of the original Multi User Dungeon, MUD, the forerunner to today's MMORPGs.
Another groundbreaking application was called FORUM. This application was perhaps the first so-called CB Simulator that allowed users to converse with one another in what is now known as a chat room. This application showed the potential of multi-user communication and led to the development of CompuServe's chat application.
TOPS-10 had a very robust application programming interface (API) that used a mechanism called a UUO or Unimplemented User Operation. UUOs implemented operating system calls in a way that made them look like machine instructions. The Monitor Call API was very much ahead of its time, like most of the operating system, and made system programming on DECsystem-10s simple and powerful.
The TOPS-10 scheduler supported prioritized run queues, and appended a process onto a queue depending on its priority. The system also included User file and Device independence.
Commands
The following list of commands are supported by TOPS-10.
ASSIGN
ATTACH
BACKSPACE
BACKUP
CCONTINUE
COMPILE
CONTINUE
COPY
CORE
CPUNCH
CREATE
CREDIR
CREF
CSTART
D(eposit)
DAYTIME
DCORE
DDT
DEASSIGN
DEBUG
DELETE
DETACH
DIRECTORY
DISABLE
DISMOUNT
DSK
DUMP
E(xamine)
EDIT
ENABLE
EOF
EXECUTE
FILCOM
FILE
FINISH
FUDGE
GET
GLOB
HALT
HELP
INITIA
JCONTINUE
KJOB
LABEL
LIST
LOAD
LOCATE
LOGIN
MAKE
MERGE
MIC
MOUNT
NETWORK
NODE
NSAVE
NSSAVE
OPSER
PJOB
PLEASE
PLOT
PRESERVE
PRINT
PROTECT
PUNCH
QUEUE
QUOLST
R
REASSIGN
REATTACH
REENTER
RENAME
RESOURCES
REWIND
RUN
SAVE
SSAVE
SCHED
SEND
SET
SKIP
START
SUBMIT
SYSTAT
TECO
TIME
TPUNCH
TYPE
UNLOAD
USESTAT
VERSION
WHERE
ZERO
History
Release history
The PDP-6 Monitor software was first released in 1964. Support for the PDP-10's KA10 processor was added to the Monitor in release 2.18 in 1967. The TOPS-10 name was first used in 1970 for release 5.01. Release 6.01 (May 1974) was the first TOPS-10 to implement virtual memory (demand paging), enabling programs larger than physical memory to be run. From release 7.00 onwards, symmetrical multiprocessing was available (as opposed to the master/slave arrangement used before). The final release of TOPS-10 was 7.04 in 1988.
TOPS-10 today
Hobbyists are now entitled to set up and use TOPS-10 under a Hobbyist's Lice |
https://en.wikipedia.org/wiki/System%20Management%20Bus | The System Management Bus (abbreviated to SMBus or SMB) is a single-ended simple two-wire bus for the purpose of lightweight communication. Most commonly it is found in chipsets of computer motherboards for communication with the power source for ON/OFF instructions. The exact functionality and hardware interfaces vary with vendors.
It is derived from I²C for communication with low-bandwidth devices on a motherboard, especially power related chips such as a laptop's rechargeable battery subsystem (see Smart Battery System and ACPI). Other devices might include external master hosts, temperature sensor, fan or voltage sensors, lid switches, clock generator, and RGB lighting. PCI add-in cards may connect to an SMBus segment.
A device can provide manufacturer information, indicate its model/part number, save its state for a suspend event, report different types of errors, accept control parameters, return status over SMBus, and poll chipset registers. The SMBus is generally not user configurable or accessible. Although SMBus devices usually can't identify their functionality, a new PMBus coalition has extended SMBus to include conventions allowing that.
The SMBus was defined by Intel and Duracell in 1994. It carries clock, data, and instructions and is based on Philips' I²C serial bus protocol. Its clock frequency range is 10 kHz to 100 kHz. (PMBus extends this to 400 kHz.) Its voltage levels and timings are more strictly defined than those of I²C, but devices belonging to the two systems are often successfully mixed on the same bus.
SMBus is used as an interconnect in several platform management standards including: ASF, DASH, IPMI.
SMBus is used to access DRAM configuration information as part of serial presence detect. SMBus has grown into a wide variety of system enumeration use cases other than power management.
SMBus/I²C Interoperability
While SMBus is derived from I²C, there are several major differences between the specifications of the two busses in the areas of electricals, timing, protocols and operating modes.
Electrical
Input Voltage (VIL and VIH)
When mixing devices, the I²C specification defines the input levels to be 30% and 70% of the supply voltage VDD, which may be 5 V, 3.3 V, or some other value. Instead of relating the bus input levels to VDD, SMBus defines them to be fixed at 0.8 and 2.1 V. SMBus 2.0 supports VDD ranging from 3 to 5 V.
SMBus 3.0 supports VDD ranging from 1.8 to 5 V and VIH = 1.35 V.
Sink Current (IOL)
SMBus 2.0 defines a ‘High Power’ class that includes a 4 mA sink current that cannot be driven by I²C chips unless the pull-up resistor is sized to I²C-bus levels.
NXP devices have a higher power set of electrical characteristics than SMBus 1.0. The main difference is the current sink capability with VOL = 0.4 V.
SMBus low power = 350 μA
SMBus high power = 4 mA
I²C-bus = 3 mA
SMBus ‘high power’ devices and I²C-bus devices will work together if the pull-up resistor is sized for 3 mA.
Frequency (FMAX and |
https://en.wikipedia.org/wiki/University%20of%20Bamberg | The University of Bamberg () in Bamberg, Germany, specializes in the humanities, cultural studies, social sciences, economics, and applied computer science.
Campus
The university is partly housed in historical buildings in Bamberg's Old Town. These include the former Jesuit college (Theology), the former Hochzeitshaus (History), the old slaughterhouse (Earth Science), and the former fire station (Oriental Studies). The departments of Languages and Literature are partly housed in buildings which once belonged to the Kaiser-Heinrich High School.
The Social Sciences and Economics department, which accommodates a large proportion of the students, are in Feldkirchenstrasse. The former ERBA cotton mill, on an island in the Regnitz, has been acquired to create student apartments in the red-brick building, as well as in an adjoining new 14,000m2 building.
Organization
The university today has four faculties:
Faculty of Humanities
Faculty of Social Sciences, Economics and Business Administration
Faculty of Human Sciences and Education
Faculty of Information Systems and Applied Computer Science
An agreement between Bavaria and the Vatican saw the faculty of Catholic Theology restructured as an institute which places a greater emphasis on teacher training. In 2005, the Social Work course transferred to Coburg University of Applied Sciences.
Academics
Disciplines
Language-based area studies, including Oriental Studies and Slavonic Studies
Medieval Studies; Archaeology (Prehistoric, Roman Provinces, Medieval); Cultural Heritage Conservation
Behavioural sciences: Sociology, Political Science, Psychology
Economics and Business Administration, with an emphasis on European Economics
Applied Computer Science
The main areas of curricular focus, to which subjects across faculties contribute, are:
Education and Life Planning
The Individual and Society
Languages and Cultures
Business and Markets
Rankings and reputation
In the 2012 Wirtschaftswoche ranking, the Faculty of Social Sciences, Economics, and Business Administration is ranked 20th in business administration (Betriebswirtschaftslehre) and 11th in economics (Volkswirtschaftslehre).
Partner universities
The University of Bamberg currently has cooperation agreements with approximately 300 academic institutions in more than 60 countries (March 2018).
The European network includes the University of Cambridge and the University of Oxford. The University holds partnerships in Australia with the University of Sydney, in the US with Harvard University, as well as in Asia with the Chinese Xi'an Jiaotong University, the Korea University, and the Japanese Sophia University.
Johann Baptist von Spix International Professorship
The University of Bamberg created the Johann Baptist von Spix professorship in 2015. The professorship is named for an alumnus of the university and eminent biologist and ethnographer. The professorship was created in an effort to increase the institution's international scholarly co |
https://en.wikipedia.org/wiki/XTEA | In cryptography, XTEA (eXtended TEA) is a block cipher designed to correct weaknesses in TEA. The cipher's designers were David Wheeler and Roger Needham of the Cambridge Computer Laboratory, and the algorithm was presented in an unpublished technical report in 1997 (Needham and Wheeler, 1997). It is not subject to any patents.
Like TEA, XTEA is a 64-bit block Feistel cipher with a 128-bit key and a suggested 64 rounds. Several differences from TEA are apparent, including a somewhat more complex key-schedule and a rearrangement of the shifts, XORs, and additions.
Implementations
This standard C source code, adapted from the reference code released into the public domain by David Wheeler and Roger Needham, encrypts and decrypts using XTEA:
#include <stdint.h>
/* take 64 bits of data in v[0] and v[1] and 128 bits of key[0] - key[3] */
void encipher(unsigned int num_rounds, uint32_t v[2], uint32_t const key[4]) {
unsigned int i;
uint32_t v0=v[0], v1=v[1], sum=0, delta=0x9E3779B9;
for (i=0; i < num_rounds; i++) {
v0 += (((v1 << 4) ^ (v1 >> 5)) + v1) ^ (sum + key[sum & 3]);
sum += delta;
v1 += (((v0 << 4) ^ (v0 >> 5)) + v0) ^ (sum + key[(sum>>11) & 3]);
}
v[0]=v0; v[1]=v1;
}
void decipher(unsigned int num_rounds, uint32_t v[2], uint32_t const key[4]) {
unsigned int i;
uint32_t v0=v[0], v1=v[1], delta=0x9E3779B9, sum=delta*num_rounds;
for (i=0; i < num_rounds; i++) {
v1 -= (((v0 << 4) ^ (v0 >> 5)) + v0) ^ (sum + key[(sum>>11) & 3]);
sum -= delta;
v0 -= (((v1 << 4) ^ (v1 >> 5)) + v1) ^ (sum + key[sum & 3]);
}
v[0]=v0; v[1]=v1;
}
The changes from the reference source code are minor:
The reference source code used the unsigned long type rather than the 64-bit clean uint32_t.
The reference source code did not use const types.
The reference source code omitted redundant parentheses, using C precedence to write the round function as e.g. v1 += (v0<<4 ^ v0>>5) + v0 ^ sum + k[sum>>11 & 3];
The recommended value for the "num_rounds" parameter is 32, not 64, as each iteration of the loop does two Feistel-cipher rounds. To additionally improve speed, the loop can be unrolled by pre-computing the values of sum+key[].
Cryptanalysis
In 2004, Ko et al. presented a related-key differential attack on 27 out of 64 rounds of XTEA, requiring 220.5 chosen plaintexts and a time complexity of 2115.15.
In 2009, Lu presented a related-key rectangle attack on 36 rounds of XTEA, breaking more rounds than any previously published cryptanalytic results for XTEA. The paper presents two attacks, one without and with a weak key assumption, which corresponds to 264.98 bytes of data and 2126.44 operations, and 263.83 bytes of data and 2104.33 operations respectively.
Block TEA
Presented along with XTEA was a variable-width block cipher termed Block TEA, which uses the XTEA round function, but Block TEA applies it cyclically across an entire message for several iterations. Because it oper |
https://en.wikipedia.org/wiki/Horst%20Feistel | Horst Feistel (January 30, 1915 – November 14, 1990) was a German-American cryptographer who worked on the design of ciphers at IBM, initiating research that culminated in the development of the Data Encryption Standard (DES) in the 1970s. The structure used in DES, called a Feistel network, is commonly used in many block ciphers.
Life and work
Feistel was born in Berlin, Germany in 1915, and moved to the United States in 1934. During World War II, he was placed under house arrest, but gained US citizenship on 31 January 1944. The following day he was granted a security clearance and began work for the US Air Force Cambridge Research Center (AFCRC) on Identification Friend or Foe (IFF) devices until the 1950s. He was subsequently employed at MIT's Lincoln Laboratory, then the MITRE corporation. Finally, he moved to IBM, where he received an award for his cryptographic work. His research at IBM led to the development of the Lucifer and Data Encryption Standard (DES) ciphers. Feistel was one of the earliest non-government researchers to study the design and theory of block ciphers.
Feistel lent his name to the Feistel network construction, a common method for constructing block ciphers (for example DES).
Feistel obtained a bachelor's degree at MIT, and his master's at Harvard, both in physics. He married Leona (Gage) in 1945, with whom he had a daughter, Peggy.
Notes
References
Whitfield Diffie, Susan Landau (1998). Privacy on the Line: The Politics of Wiretapping and Encryption.
Horst Feistel, "Cryptography and Computer Privacy." Scientific American, Vol. 228, No. 5, 1973. (JPEG format scanned)
Horst Feistel, H, W. Notz, J. Lynn Smith. "Some cryptographic techniques for machine-to-machine data communications." IEEE Proceedings, 63(11), 1545–1554, 1975.
Levy, Steven. Crypto: How the Code Rebels Beat the Government—Saving Privacy in the Digital Age, 2001.
External links
1915 births
1990 deaths
People from Berlin
Emigrants from Nazi Germany to the United States
Massachusetts Institute of Technology School of Science alumni
Harvard Graduate School of Arts and Sciences alumni
Modern cryptographers
IBM employees
IBM Research computer scientists
German computer scientists
Mitre Corporation people
MIT Lincoln Laboratory people |
https://en.wikipedia.org/wiki/Linux%20Mark%20Institute | The Linux Mark Institute (LMI, fully "LMI Oregon, LLC") is an organization which administers the "Linux" trademark on behalf of Linus Torvalds for computer software which includes the Linux kernel, computer hardware utilizing Linux-based software, and for services associated with the implementation and documentation of Linux-based products.
Trademark
The Linux trademark is owned by Linus Torvalds in the U.S., Germany, the E.U., and Japan for "Computer operating system software to facilitate computer use and operation". The assignment of the trademark to Torvalds occurred after a lawsuit against attorney William R. Della Croce, Jr., of Boston, who had registered the trademark in the US in September 1995 and began in 1996 to send letters to various Linux distributors, demanding ten percent of royalties from sales of Linux products. A petition against Della Croce's practices was started, and in early 1997, WorkGroup Solutions, Yggdrasil, Linux Journal, Linux International, and Torvalds appealed the original trademark assignment as "fraudulent and obtained under false pretenses". By November, the case was settled and Torvalds owned the trademark.
History
LMI originally charged a nominal sublicensing fee for use of the Linux name as part of trademarks, but later changed this in favor of offering a free, perpetual worldwide sublicense.
LMI was headquartered in Monterey, California until at least 2005. Since at least 2009 it was headquartered in Beaverton, Oregon.
References
External links
Linux organizations
Trademark law organizations
Organizations based in Oregon
Organizations based in California
Mass media companies |
https://en.wikipedia.org/wiki/Barcelona%20Metro | The Barcelona Metro (Catalan and Spanish: ) is a network of rapid transit electrified railway lines that run mostly underground in central Barcelona and into the city's suburbs. It is part of the larger public transport system of Barcelona, the capital of Catalonia, Spain, with unified fares under the (ATM) scheme. As of 2014, the network is operated by two separate companies: (TMB) and (FGC). It is made up of 12 lines, combining the lines owned by the two companies. Two lines, L9 and L10, are being built at present, with both lines having different sections of each opened between 2009 and 2018. They are due to be fully completed in 2026. Three lines on the network have opened as automatic train operation/driverless vehicle systems since 2009: Line 11 being converted to driverless first, and then Lines 9 and 10, opening up driverless.
It is one of only two metros worldwide to operate on three different track gauges, being on line 8, older Iberian gauge on line 1, and and the remaining lines; the other metro with three gauges being the Toei Subway in Tokyo, which uses two narrow gauges and standard gauge. It is the only metro worldwide to operate on both narrow and broad gauge tracks.
The network length is , with 183 stations, as of November 2021.
History
The first rapid transit railway service in Barcelona was founded in 1863 by the private company Ferrocarril de Barcelona a Sarrià ("Railway from Barcelona to Sarrià", after 1916 Sarrià joined the municipality of Barcelona). Later this line evolved in what now is basically the current L6 metro service. This railway system, now part of the Ferrocarrils de la Generalitat de Catalunya company, was later inspired by the London Underground naming style having long names for the lines ("Sarrià line", "Balmes line"...).
Much later, in the 1920s, a second and a third rapid transit railway systems were founded with the construction of the Gran Metro between Lesseps and the Plaça de Catalunya (part of the modern L3) and, two years later, the Metro Transversal (now part of L1). This third one was built between the Plaça de Catalunya and la Bordeta to link the city centre with the Plaça d'Espanya and Montjuïc, the site of the 1929 Barcelona International Exposition. These two later rapid transit companies contrasted with the first one in being inspired by the Métropolitain de Paris (from where the word "metro" comes).
As of 2022, the network consists of 12 lines managed by 2 different operators: Transports Metropolitans de Barcelona (TMB) and Ferrocarrils de la Generalitat de Catalunya (FGC, or Catalan Government Railways). Fares and nomenclature are controlled by the Autoritat del Transport Metropolità, a citywide system that also includes local and regional buses, tramways and some commuter and regional train services.
Network
Since early 2020, the total length of the network is long and 189 stations, including the TMB+FGC+Montjuïc funicular.
The major network, operated by TMB, consists of |
https://en.wikipedia.org/wiki/Programmed%20Airline%20Reservations%20System | Programmed Airline Reservations System (PARS) is an IBM proprietary large scale airline reservation application, a computer reservations system, executing under the control of IBM Airline Control Program (ACP) (and later its successor, Transaction Processing Facility (TPF)). Its international version was known as IPARS.
By the 1960s, with the American Airlines SABRE reservations system up and running, IBM offered its expertise to other airlines, and soon developed Deltamatic for Delta Air Lines on the IBM 7074, and PANAMAC for Pan American World Airways using an IBM 7080. By 1967/8 IBM generalized its airline reservations work into the PARS system, which ran on the larger members of the IBM System/360 family and which could support the largest airlines' needs at that time (e.g. United Airlines ran about 3000 reservations terminals online in the 1972 timeframe). In the early 1970s IBM modified its PARS reservations system so it could accommodate the smaller regional airlines on smaller members of the 370 systems family. The high performance PARS operating system evolved from ACP (Airlines Control Program) to TPF (Transaction Processing Facility).
In the early days of automated reservations systems in the 1960s and 1970s the combination of ACP and PARS provided unprecedented scale and performance from an on-line real-time system, and for a considerable period ranked among the largest networks and systems of the era. In the early 1970s major US banks were developing major on-line teleprocessing applications systems and were in urgent need of ACP's high performance capabilities. ACP was made available by IBM to the banking industry in the mid-1970s. This system was used by the great majority of large airlines in the US and internationally; and its smaller 1970's version was used by many smaller regional airlines. PARS (and IPARS) was extremely successful, and it massively improved and revolutionized the efficiency of airlines passenger operations and their profitability.
Along with many other major and regional US airlines, the PARS system was later used by TWA and Northwest Airlines. In this context PARS was also used as a marketing name by TWA when selling their system to travel agencies.
Swiss International Air Lines and Brussels Airlines discontinued using PARS beginning of 2016. IranAir, the Iranian National Airline, discontinued using IBM-ACP/IPARS at the beginning of 2000 due to Year 2000 (Y2K) problem.
CPARS (Compact Programmed Airlines Reservations) was used by smaller airlines (e.g. Icelandair). Among other limitations (compared to PARS) was a shorter booking horizon of 90 days.
References
Further reading
Winston, Clifford, "The Evolution of the Airline Industry", Brookings Institution Press, 1995. . Cf. p. 62.
IBM software
Travel technology
IBM mainframe software |
https://en.wikipedia.org/wiki/Smurf%20Amplifier%20Registry | The Smurf Amplifier Registry is a blacklist of networks on the Internet which have been misconfigured in such a way that they can be used as smurf amplifiers for smurf denial of service attacks.
It can probe networks for vulnerability to smurf amplification, and then will either add them to its database, or remove them from the database, depending on the result of the test.
External links
The Smurf Amplifier Registry
Denial-of-service attacks |
https://en.wikipedia.org/wiki/SWIG | The Simplified Wrapper and Interface Generator (SWIG) is an open-source software tool used to connect computer programs or libraries written in C or C++ with scripting languages such as Lua, Perl, PHP, Python, R, Ruby, Tcl, and other languages like C#, Java, JavaScript, Go, D, OCaml, Octave, Scilab and Scheme. Output can also be in the form of XML.
Function
The aim is to allow the calling of native functions (that were written in C or C++) by other programming languages, passing complex data types to those functions, keeping memory from being inappropriately freed, inheriting object classes across languages, etc. The programmer writes an interface file containing a list of C/C++ functions to be made visible to an interpreter. SWIG will compile the interface file and generate code in regular C/C++ and the target programming language. SWIG will generate conversion code for functions with simple arguments; conversion code for complex types of arguments must be written by the programmer. The SWIG tool creates source code that provides the glue between C/C++ and the target language. Depending on the language, this glue comes in two forms:
a shared library that an extant interpreter can link to as some form of extension module, or
a shared library that can be linked to other programs compiled in the target language (for example, using Java Native Interface (JNI) in Java).
SWIG is not used for calling interpreted functions by native code; this must be done by the programmer manually.
Example
SWIG wraps simple C declarations by creating an interface that closely matches the way in which the declarations would be used in a C program. For example, consider the following interface file:
%module example
%inline %{
extern double sin(double x);
extern int strcmp(const char *, const char *);
extern int Foo;
%}
#define STATUS 50
#define VERSION "1.1"
In this file, there are two functions and , a global variable , and two constants and . When SWIG creates an extension module, these declarations are accessible as scripting language functions, variables, and constants respectively. In Python:
>>> example.sin(3)
0.141120008
>>> example.strcmp('Dave','Mike')
-1
>>> print(example.cvar.Foo)
42
>>> print(example.STATUS)
50
>>> print(example.VERSION)
1.1
Purpose
There are two main reasons to embed a scripting engine in an existing C/C++ program:
The program can then be customized far faster, via a scripting language instead of C/C++. The scripting engine may even be exposed to the end-user, so that they can automate common tasks by writing scripts.
Even if the final product is not to contain the scripting engine, it may nevertheless be very useful for writing test scripts.
There are several reasons to create dynamic libraries that can be loaded into extant interpreters, including:
Provide access to a C/C++ library which has no equivalent in the scripting language.
Write the whole program in the scripting language first, and after profiling, rewrite performance- |
https://en.wikipedia.org/wiki/Zombie%20%28computing%29 | In computing, a zombie is a computer connected to the Internet that has been compromised by a hacker via a computer virus, computer worm, or trojan horse program and can be used to perform malicious tasks under the remote direction of the hacker. Zombie computers often coordinate together in a botnet controlled by the hacker, and are used for activities such as spreading e-mail spam and launching distributed denial-of-service attacks (DDoS attacks) against web servers. Most victims are unaware that their computers have become zombies. The concept is similar to the zombie of Haitian Voodoo folklore, which refers to a corpse resurrected by a sorcerer via magic and enslaved to the sorcerer's commands, having no free will of its own. A coordinated DDoS attack by multiple botnet machines also resembles a "zombie horde attack", as depicted in fictional zombie films.
Advertising
Zombie computers have been used extensively to send e-mail spam; as of 2005, an estimated 50–80% of all spam worldwide was sent by zombie computers. This allows spammers to avoid detection and presumably reduces their bandwidth costs, since the owners of zombies pay for their own bandwidth. This spam also greatly increases the spread of Trojan horses, as Trojans are not self-replicating. They rely on the movement of e-mails or spam to grow, whereas worms can spread by other means. For similar reasons, zombies are also used to commit click fraud against sites displaying pay-per-click advertising. Others can host phishing or money mule recruiting websites.
Distributed denial-of-service attacks
Zombies can be used to conduct distributed denial-of-service (DDoS) attacks, a term which refers to the orchestrated flooding of target websites by large numbers of computers at once. The large number of Internet users making simultaneous requests of a website's server is intended to result in crashing and the prevention of legitimate users from accessing the site. A variant of this type of flooding is known as distributed degradation-of-service. Committed by "pulsing" zombies, distributed degradation-of-service is the moderated and periodical flooding of websites intended to slow down rather than crash a victim site. The effectiveness of this tactic springs from the fact that intense flooding can be quickly detected and remedied, but pulsing zombie attacks and the resulting slow-down in website access can go unnoticed for months and even years.
The computing facilitated by Internet of Things (IoT) has been productive for modern day usage but it has played a significant role in the increase in such web attacks. The potential of IoT enables every device to communicate efficiently but this increases the need of policy enforcement regarding the security threats. Through these devices, the most prominent attacking behaviors is the DDoS. Research has been conducted to study the impact of such attacks on IoT networks and their compensating provisions for defense.
Notable incidents of di |
https://en.wikipedia.org/wiki/3D%20Movie%20Maker | 3D Movie Maker (commonly shortened to 3DMM) is a children's computer program developed by Microsoft Home's Microsoft Kids subsidiary released in 1995. Using the program, users can make films by placing 3D characters and props into pre-rendered environments, as well as adding actions, sound effects, music, text, speech and special effects. Movies are then saved in the .3mm file format.
The program features two helper characters to guide users through the various features of the program: The character McZee (voiced by Michael Shapiro), shared from other Microsoft Kids products like Creative Writer, provides help throughout the studio while his assistant Melanie provides other various tutorials. In Nickelodeon 3D Movie Maker, the user is instead guided by Stick Stickly.
Developed in accordance with Microsoft's broader ambitions towards multimedia software in conjunction with the release of its then-new Windows 95 home computer operating system, 3D Movie Maker is built on BRender, a software rasterized 3D graphics engine created by Argonaut Software. The models and backgrounds were made by Illumin8 Digital Pictures (a now-defunct graphics studio) using Softimage modeling software, while the cinematic introduction and help sequences were made by Productions Jarnigoine, a now-inactive production company founded by Jean-Jacques Tremblay. In 1998, a user named Space Goat created the website 3dmm.com that allows users to upload movies and mods for 3DMM. 3dmm.com is still used today by many 3DMM enthusiasts.
Following the open-sourcing of the licensed BRender engine prior in similar fashion, Microsoft released the source code of the program under the MIT License in May 2022, following a request by Foone Turing on Twitter a month earlier.
Overview
Filmmaking in 3D Movie Maker is a straightforward process, allowing users to create various kinds of movies with ease. By default, 40 actors/actresses are available (each with 4 different costumes and a number of actions), as well as 20 different props. Twelve different scenes are available to the user, each containing several different static camera angles. While the actors and props are rendered as polygonal meshes with affine texture mapping and basic shading, the scene backgrounds instead are pre-rendered images with an associated depth buffer that is compared against the runtime-rendered meshes so that aspects of the scene at hand can appear to occlude the meshes once a character or prop is placed behind a static object from the background. Many sample voice and MIDI music clips are included, but original voices can be recorded using a microphone while external .wav and .MIDI files can be imported.
In 3DMM, movies are recorded from frames in quick succession, featuring a destructive editing paradigm. Whilst pre-created animations (such as walking or dancing) can be applied to actors and made to run over a number of frames in sequence, unlike conventional animation software, the interface explicitly does |
https://en.wikipedia.org/wiki/Manchester%20Baby | The Manchester Baby, also called the Small-Scale Experimental Machine (SSEM), was the first electronic stored-program computer. It was built at the University of Manchester by Frederic C. Williams, Tom Kilburn, and Geoff Tootill, and ran its first program on 21 June 1948.
The Baby was not intended to be a practical computing engine, but was instead designed as a testbed for the Williams tube, the first truly random-access memory. Described as "small and primitive" 50 years after its creation, it was the first working machine to contain all the elements essential to a modern electronic digital computer. As soon as the Baby had demonstrated the feasibility of its design, a project was initiated at the university to develop it into a full scale operational machine, the . The Mark 1 in turn quickly became the prototype for the Ferranti Mark 1, the world's first commercially available general-purpose computer.
The Baby had a 32-bit word length and a memory of 32 words (1 kibibit, 1,024 bits). As it was designed to be the simplest possible stored-program computer, the only arithmetic operations implemented in hardware were subtraction and negation; other arithmetic operations were implemented in software. The first of three programs written for the machine calculated the highest proper divisor of 218 (262,144), by testing every integer from 218 downwards. This algorithm would take a long time to execute—and so prove the computer's reliability, as division was implemented by repeated subtraction of the divisor. The program consisted of 17 instructions and ran for about 52 minutes before reaching the correct answer of 131,072, after the Baby had performed about 3.5 million operations (for an effective CPU speed of about 1100 instructions per second).
Background
The first design for a program-controlled computer was Charles Babbage's Analytical Engine in the 1830s, with Ada Lovelace conceiving the idea of the first theoretical program to calculate Bernoulli numbers. A century later, in 1936, mathematician Alan Turing published his description of what became known as a Turing machine, a theoretical concept intended to explore the limits of mechanical computation. Turing was not imagining a physical machine, but a person he called a "computer", who acted according to the instructions provided by a tape on which symbols could be read and written sequentially as the tape moved under a tape head. Turing proved that if an algorithm can be written to solve a mathematical problem, then a Turing machine can execute that algorithm.
Konrad Zuse's Z3 was the world's first working programmable, fully automatic computer, with binary digital arithmetic logic, but it lacked the conditional branching of a Turing machine. On 12 May 1941, the Z3 was successfully presented to an audience of scientists of the Deutsche Versuchsanstalt für Luftfahrt ("German Laboratory for Aviation") in Berlin. The Z3 stored its program on an external tape, but it was electromechanical ra |
https://en.wikipedia.org/wiki/Department%20of%20Computer%20Science%20and%20Technology%2C%20University%20of%20Cambridge | The Department of Computer Science and Technology, formerly the Computer Laboratory, is the computer science department of the University of Cambridge. it employed 56 faculty members, 45 support staff, 105 research staff, and about 205 research students. The current Head of Department is Professor Ann Copestake.
History
The department was founded as the Mathematical Laboratory under the leadership of John Lennard-Jones on 14 May 1937, though it did not get properly established until after World War II. The new laboratory was housed in the North Wing of the former Anatomy School, on the New Museums Site. Upon its foundation, it was intended "to provide a computing service for general use, and to be a centre for the development of computational techniques in the University". The Cambridge Diploma in Computer Science was the world's first postgraduate taught course in computing, starting in 1953.
In October 1946, work began under Maurice Wilkes on EDSAC (Electronic Delay Storage Automatic Calculator), which subsequently became the world's first fully operational and practical stored program computer when it ran its first program on 6 May 1949. It inspired the world's first business computer, LEO. It was replaced by EDSAC 2, the first microcoded and bitsliced computer, in 1958.
In 1961, David Hartley developed Autocode, one of the first high-level programming languages, for EDSAC 2. Also in that year, proposals for Titan, based on the Ferranti Atlas machine, were developed. Titan became fully operational in 1964 and EDSAC 2 was retired the following year. In 1967, a full ('24/7') multi-user time-shared service for up to 64 users was inaugurated on Titan.
In 1970, the Mathematical Laboratory was renamed the Computer Laboratory, with separate departments for Teaching and Research and the Computing Service, providing computing services to the university and its colleges. The two did not fully separate until 2001, when the Computer Laboratory moved out to the new William Gates building in West Cambridge, off Madingley Road, leaving behind an independent Computing Service.
In 2002, the Computer Laboratory launched the Cambridge Computer Lab Ring, a graduate society named after the Cambridge Ring network.
Current
On 30 June 2017, the Cambridge University Reporter announced that the Computer Laboratory would change its name to the Department of Computer Science and Technology from 1 October 2017, to reflect the broadened scope of its purpose and activities.
The department currently offers a 3-year undergraduate course and a 1-year masters course (with a large selection of specialised courses in various research areas). Recent research has focused on virtualisation, security, usability, formal verification, formal semantics of programming languages, computer architecture, natural language processing, mobile computing, wireless networking, biometric identification, robotics, routing, positioning systems and sustainability ("Computing for the future |
https://en.wikipedia.org/wiki/Software%20Engineering%202004 | The Software Engineering 2004 (SE2004) —formerly known as Computing Curriculum Software Engineering (CCSE)— is a document that provides recommendations for undergraduate education in software engineering. SE2004 was initially developed by a steering committee between 2001 and 2004. Its development was sponsored by the Association for Computing Machinery and the IEEE Computer Society. Important components of SE2004 include the Software Engineering Education Knowledge, a list of topics that all graduates should know, as well as a set of guidelines for implementing curricula and a set of proposed courses.
External links
SE2004 Home Page
Software engineering papers
Computer science education |
https://en.wikipedia.org/wiki/University%20of%20Cambridge%20Computing%20Service | The University of Cambridge Computing Service provided computing facilities across the University of Cambridge between 1970 and 2014. It was located primarily on the New Museums Site, Free School Lane, in the centre of Cambridge, England but, in September 2013 moved to the Roger Needham Building on the West Cambridge site.
The Computing Service shares a common ancestry with the University of Cambridge Computer Laboratory. Founded on 14 May 1937 to provide a computing service for general use, and to be a centre for the development of computational techniques in the University as the Mathematical Laboratory (under the leadership of John Lennard-Jones), it was not until 2001 that the provision of computing services across the University and Colleges was fully separated from computing research and teaching.
On 30 March 2014, the Computing Service merged with the Management Information Services Division (MISD) of the Unified Administrative Service (UAS) to create the University Information Services department.
Landmark projects and services
EDSAC computer, 1949 - a pioneering stored-program computer
EDSAC 2 computer, 1965 - first computer to have a microprogrammed CPU
Titan computer, 1966 - timeshared computer developed jointly with Ferranti subsequently marketed as the commercial Atlas 2
Phoenix computer, 1973 - an IBM 370/165 running an IBM OS modified for improved interactive timesharing
Exim mail transfer agent, 1995 - in continued open-source development and in very widespread use
Raven authentication service, 2004 - a web-based authentication framework particularly suited to the widespread adoption across many federated institutions as at Cambridge. Extended subsequently to integrate with inter-organisational Shibboleth authentication and provide lifetime credentials known as Raven-for-life.
Lapwing Federated Wireless platform, 2006 - provides local management via web console/APIs to 200 institutions while retaining a single network appearance with common authentication and reporting.
my.phone user/telephony federated administration system, 2010 - providing a usable federated administrative interface to the VoIP platform to 17,000 users and 200 institutions.
IBIS master reference data / identity management service, 2011 - provides a central common data repository with LDAP and Web service API's for 300,000 members of 250 institutions, with a sophisticated federated access control model.
Directors of the University of Cambridge Computing Service
Maurice Wilkes 1945–1980 (as head of the University of Cambridge Computer Laboratory)
David Hartley 1970–1994 (first head of the dedicated University Computing Service)
Mike Sayers 1994–2004
Ian Lewis 2005–2014 (final Director before the merger with MISD to create the UIS)
See also
University of Cambridge Computer Laboratory
Oxford University Computing Services
External links
University of Cambridge Computing Service
University of Cambridge Computer Laboratory
Organizations establ |
https://en.wikipedia.org/wiki/King%20of%20the%20Ring | King of the Ring was a professional wrestling pay-per-view (PPV) and WWE Network event produced by WWE, a Connecticut-based professional wrestling promotion. The PPV event was held annually in June and was established in 1993 when the promotion was still called the World Wrestling Federation (WWF, renamed WWE in 2002). It centered on the King of the Ring tournament, which had been held annually as a non-televised house show from 1985 to 1991, with the exception of 1990.
During the event's run as a PPV, it was considered one of the promotion's five biggest events of the year, along with the Royal Rumble, WrestleMania, SummerSlam, and Survivor Series, dubbed the "Big Five." The 2002 event was the final King of the Ring produced as a PPV. To coincide with the brand extension introduced earlier that same year, the 2002 event featured wrestlers from both the Raw and SmackDown! brand divisions. In 2003, the event's PPV slot was replaced by Bad Blood.
The tournament endured a four-year hiatus until its return in 2006 as an exclusive tournament for wrestlers of the SmackDown! brand. Instead of a dedicated PPV, however, this tournament concluded at that year's Judgment Day. While the tournament has since been held periodically as a non-PPV event and included WWE's other brands, the conclusion to the 2015 tournament aired exclusively as an event on the WWE Network and also occurred when a brand extension was not in effect. It has thus far been the last tournament to air as a separate event from WWE's other programs. While tournaments have been held since, the event itself was to be revived in 2023 and rebranded as "King and Queen of the Ring" to incorporate the women's Queen's Crown tournament; however, these plans were scrapped as WWE instead decided to revive Night of Champions.
History
The King of the Ring tournament is a single-elimination tournament in which the winner is crowned the "King of the Ring." The tournament was established in 1985 by the then-World Wrestling Federation (WWF) and was held annually until 1991, with the exception of 1990. These early tournaments were held as special non-televised house shows in an effort to boost attendance at these events.
In 1993, the WWF began to produce an annual June pay-per-view (PPV) titled King of the Ring. The inaugural PPV took place on June 13, 1993, at the Nutter Center in Dayton, Ohio. Unlike the previous non-televised events, the PPV did not feature all of the tournament's matches. Instead, several of the qualifying matches preceded the event with the final few matches then taking place at the pay-per-view. There were also other matches that took place at the event as it was a traditional three-hour pay-per-view. The King of the Ring pay-per-view was considered one of the promotion's "Big Five" PPVs of the year, along with the Royal Rumble, WrestleMania, SummerSlam, and Survivor Series, up until its disestablishment after the 2002 event—it was the only event of the five to never be hosted at |
https://en.wikipedia.org/wiki/Desert%20fox | Desert fox may refer to:
Animals
Fennec fox (Vulpes zerda), the world's smallest canid
White-footed fox (Vulpes vulpes pusilla), also known as the desert fox
Games
Desert Fox (computer game), a 1985 game for the Commodore 64
The Desert Fox, a 1981 board wargame published in Strategy & Tactics magazine
Other uses
Nickname of World War II German field marshal Erwin Rommel
Rommel: The Desert Fox, a 1950 biography of Erwin Rommel by Desmond Young
The Desert Fox: The Story of Rommel, a 1951 movie about Erwin Rommel
The Desert Foxes, nickname for the Algeria national football team
Operation Desert Fox, the 1998 bombing of Iraq by the United States and United Kingdom
Animal common name disambiguation pages |
https://en.wikipedia.org/wiki/HLL | HLL can have several meanings:
High-level programming language, abbreviated to High-level Language.
HLL Lifecare Limited (formerly Hindustan Latex Limited), an Indian Public Sector Undertaking
Horo Records hll jazz series, e.g. hll 101-4
Horizontal Life Line, used for fall arrest
HyperLogLog, algorithm for the count-distinct problem
Hell Let Loose, multiplayer WWII first-person shooter video game |
https://en.wikipedia.org/wiki/Topcoder | Topcoder (formerly TopCoder) is a crowdsourcing company with an open global community of designers, developers, data scientists, and competitive programmers. Topcoder pays community members for their work on the projects and sells community services to corporate, mid-size, and small-business clients. Topcoder also organizes the annual Topcoder Open tournament and a series of smaller regional events.
History
Topcoder was founded in 2001 by Jack Hughes, Chairman and Founder of the Tallan company. The name was formerly spelt as "TopCoder" until 2013. Topcoder ran regular competitive programming challenges, known as Single Round Matches or "SRMs," where each SRM was a timed 1.5-hour algorithm competition and contestants would compete against each other to solve the same set of problems. The contestants were students from different secondary schools or universities. Cash prizes ranging from $5,000 to $10,000 per match were secured from corporate sponsors and awarded to tournament winners to generate interest from the student community.
As the community of designers, developers, data scientists, and competitive programmers involved in Topcoder grew, the company started to offer software development services to 3rd party clients, contracting individual community members to work on specific tasks. Most of the revenue, though, still came from consulting services provided to clients by Topcoder employees. From 2006 onwards, Topcoder held design competitions, thus offering design services to their clients. In 2006 Topcoder also started to organize Marathon Matches (MM) – one week long algorithmic contests.
In an attempt to optimize expenses, Topcoder introduced new competition tracks in 2007-2008 and delegated more work from its employees to the community. By 2009, the size of Topcoder's staff had been reduced to 16 project managers servicing 35 clients, while the community did most of the actual work via crowdsourcing. Topcoder representatives claim that at this point their community had about 170k registered members, and the company's annual revenue was approximately $19 million.
In 2013, Topcoder was acquired by Appirio, and the Topcoder community (of around 500 thousand at the time), was merged, under the Topcoder brand, with the 75k member crowdsourcing community Cloudspokes, created and managed by Appirio.
In 2016, Topcoder, along with Appirio, was acquired by Wipro as a part of a $500 million deal and continued to operate as a separate company under its brand.
Since the end of 2017, Topcoder has continued to offer its enterprise clients the Hybrid Crowd platform, as a way to protect intellectual property in crowdsourcing projects. In addition to the public Topcoder community, the Hybrid Crowd platform allows for the creation of certified and private crowdsourcing communities. Its certified communities include members of public Topcoder communities who are vetted for a customer's specific requirements, such as signing an additional NDA, completi |
https://en.wikipedia.org/wiki/Sedna | Sedna may refer to:
Sedna (mythology), the Inuit goddess of the sea
90377 Sedna, a trans-Neptunian dwarf planet
Sedna (beverage), a tonic wine, formerly made in Belfast
Sedna (database), a native XML database
Doriprismatica sedna, a species of nudibranch
Sedna Finance, a structured investment vehicle
Sedna Planitia, a landform on the planet Venus
Sedna pirata, a species of solifuge, and its monotypic genus Sedna
See also
Sedna IV (vessel) a modern sailing ship
Sétna (disambiguation) |
https://en.wikipedia.org/wiki/DIGITAL%20Command%20Language | DIGITAL Command Language (DCL) is the standard command language adopted by many of the operating systems created by Digital Equipment Corporation. DCL had its roots in IAS, TOPS-20, and RT-11 and was implemented as a standard across most of Digital's operating systems, notably RSX-11 and RSTS/E, but took its most powerful form in VAX/VMS (later OpenVMS). DCL continues to be developed by VSI as part of OpenVMS.
Written when the programming language Fortran was in heavy use, DCL is a scripting language supporting several data types, including strings, integers, bit arrays, arrays and booleans, but not floating point numbers. Access to OpenVMS system services (kernel API) is through lexical functions, which perform the same as their compiled language counterparts and allow scripts to get information on system state. DCL includes IF-THEN-ELSE, access to all the Record Management Services (RMS) file types including stream, indexed, and sequential, but lacks a DO-WHILE or other looping construct, requiring users to make do with IF and GOTO-label statements instead.
DCL is available for other operating systems as well, including
VCL and VX/DCL for Unix,
VCL for MS-DOS, OS/2 and Windows,
PC-DCL and Open DCL for Windows/Linux
and Accelr8 DCL Lite for Windows.
DCL is the basis of the XLNT language, implemented on Windows by an interpreter-IDE-WSH engine combination with CGI capabilities distributed by Advanced System Concepts Inc. from 1997.
Command line parser
For the OpenVMS implementation, the command line parser is a runtime library () that can be compiled into user applications and therefore gives a consistent command line interface for both OS supplied commands and user written commands. The command line must start with a verb and is then followed by up to 8 parameters (arguments) and/or qualifiers (switches in Unix terminology) which begin with a '/' character. Unlike Unix (but similar to DOS), a space is not required before the '/'. Qualifiers can be position independent (occurring anywhere on the command line) or position dependent, in which case the qualifier affects the parameter it appears after. Most qualifiers are position independent. Qualifiers may also be assigned values or a series of values. Only the first most significant part of the verb and qualifier name is required. Parameters can be integers or alphanumeric text.
An example OS command may look like:
set audit /alarm /enable=(authorization, breakin=all)
show device /files $1$DGA1424:
The second show command could also be typed as:
sho dev $1$DGA1424:/fil
While DCL documentation usually shows all DCL commands in uppercase, DCL commands are case-insensitive and may be typed in upper-, lower-, or mixed-case.
Some implementations such as OpenVMS and RSX used a minimum uniqueness scheme in allowing commands to be shortened.
Unlike other systems which use paths for locating commands, DCL requires commands to be defined explicitly, either via CLD (Command Lang |
https://en.wikipedia.org/wiki/David%20Wheeler%20%28computer%20scientist%29 | David John Wheeler FRS (9 February 1927 – 13 December 2004) was a computer scientist and professor of computer science at the University of Cambridge.
Education
Wheeler was born in Birmingham, England, the second of the three children of (Agnes) Marjorie, née Gudgeon, and Arthur Wheeler, a press tool maker, engineer, and proprietor of a small shopfitting firm. He was educated at a local primary school in Birmingham and then went on to King Edward VI Camp Hill School after winning a scholarship in 1938. His education was disrupted by World War II, and he completed his sixth form studies at Hanley High School. In 1945 he gained a scholarship to study the Cambridge Mathematical Tripos at Trinity College, Cambridge, graduating in 1948. He was awarded the world's first PhD in computer science in 1951.
Career
Wheeler's contributions to the field included work on the Electronic Delay Storage Automatic Calculator (EDSAC) in the 1950s and the Burrows–Wheeler transform (published 1994). Along with Maurice Wilkes and Stanley Gill, he is credited with the invention around 1951 of the subroutine (which they referred to as the closed subroutine), and gave the first explanation of how to design software libraries; as a result, the jump to subroutine instruction was often called a Wheeler Jump. Wilkes published a paper in 1953 discussing relative addressing to facilitate the use of subroutines. (However, Turing had discussed subroutines in a paper of 1945 on design proposals for the NPL ACE, going so far as to invent the concept of a return address stack.)
He was responsible for the implementation of the CAP computer, the first to be based on security capabilities. In cryptography, he was the designer of WAKE and the co-designer of the TEA and XTEA encryption algorithms together with Roger Needham. In 1950, with Maurice Wilkes, he used EDSAC to solve a differential equation relating to gene frequencies in a paper by Ronald Fisher. This represents the first use of a computer for a problem in the field of biology.
He became a Fellow of Darwin College, Cambridge in 1964 and formally retired in 1994, although he continued to be an active member of the University of Cambridge Computer Laboratory until his death.
Personal life
On 24 August 1957 Wheeler married astrophysics research student Joyce Margaret Blackler, who had used EDSAC for her own mathematical investigations as a research student from 1955. Together they had two daughters and a son.
Wheeler died of a heart attack on 13 December 2004 while cycling home from the Computer Laboratory.
Recognition and legacy
Wheeler:
In 1981 was elected a fellow of the Royal Society
In 1985 received a Computer Pioneer Award for his contributions to assembly language programming
In 1994 was inducted as a Fellow of the Association for Computing Machinery
In 2003 was named a Computer History Museum Fellow Award recipient "for his invention of the closed subroutine, and for his architectural contributions to ILLIAC, |
https://en.wikipedia.org/wiki/Copland%20%28operating%20system%29 | Copland is an operating system developed by Apple for Macintosh computers between 1994 and 1996 but never commercially released. It was intended to be released as System 8, and later, Mac OS 8. Planned as a modern successor to the aging System 7, Copland introduced protected memory, preemptive multitasking, and several new underlying operating system features, while retaining compatibility with existing Mac applications. Copland's tentatively planned successor, codenamed Gershwin, was intended to add more advanced features such as application-level multithreading.
Development officially began in March 1994. Over the next several years, previews of Copland garnered much press, introducing the Mac audience to operating system concepts such as object orientation, crash-proofing, and multitasking. In May 1996, Gil Amelio stated that Copland was the primary focus of the company, aiming for a late-year release. Internally, however, the development effort was beset with problems due to dysfunctional corporate personnel and project management. Development milestones and developer release dates were missed repeatedly.
Ellen Hancock was hired to get the project back on track, but quickly concluded it would never ship. In August 1996, it was announced that Copland was canceled and Apple would look outside the company for a new operating system. Among many choices, they selected NeXTSTEP and purchased NeXT in 1997 to obtain it. In the interim period, while NeXTSTEP was ported to the Mac, Apple released a much more legacy-oriented Mac OS 8 in 1997, followed by Mac OS 9 in 1999. Mac OS X became Apple's next-generation operating system with its release in 2001. All of these releases bear functional or cosmetic influence from Copland.
The Copland development effort has been described as an example of feature creep. In 2008, PC World included Copland on a list of the biggest project failures in information technology (IT) history.
Design
Mac OS legacy
The prehistory of Copland begins with an understanding of the Mac OS legacy, and its architectural problems to be solved.
Launched in 1984, the Macintosh and its operating system were designed from the start as a single-user, single-tasking system, which allowed the hardware development to be greatly simplified. As a side effect of this single application model, the original Mac developers were able to take advantage of several compromising simplifications that allowed great improvements in performance, running even faster than the much more expensive Lisa. But this design also led to several problems for future expansion.
By assuming only one program would be running at a time, the engineers were able to ignore the concept of reentrancy, which is the ability for a program (or code library) to be stopped at any point, asked to do something else, and then return to the original task. To be reentrant, any local data and state has to be stored out when another program calls the code, and if one does not require |
https://en.wikipedia.org/wiki/Similarity | Similarity may refer to:
In mathematics and computing
Similarity (geometry), the property of sharing the same shape
Matrix similarity, a relation between matrices
Similarity measure, a function that quantifies the similarity of two objects
Cosine similarity, which uses the angle between vectors
String metric, also called string similarity
Semantic similarity, in computational linguistics
In linguistics
Lexical similarity
Semantic similarity
In signal processing
Similarity between two different signals is also important in the field of signal processing. Below are some common methods for calculating similarity.
For instance, let's consider two signals represented as and , where and .
Maximum error (ME)
Measuring the maximum magnitude of the difference between two signals. Maximum error is useful for assessing the worst-case scenario of prediction accuracy
Mean squared error (MSE)
Measuring the average squared difference between two signals. Unlike the maximum error, mean squared error takes into account the overall magnitude and spread of errors, offering a comprehensive assessment of the difference between the two signals.
Normalized mean square error (NMSE)
NMSE is an extension of MSE. It is calculated by normalizing the MSE with the signal power, enabling fair comparisons across different datasets and scales.
Root-mean-square deviation (RMSE)
RMSE is derived from MSE by taking the square root of the MSE. It downscale the MSE, providing a more interpretable and comparable measure for better understanding for outcome.
Normalized root-mean-square error (NRMSE)
An extension of RMSE, which allows for signal comparisons between different datasets and models with varying scales.
Signal-to-noise ratio (SNR)
In signal processing, SNR is calculated as the ratio of signal power to noise power, typically expressed in decibels.
A high SNR indicates a clear signal, while a low SNR suggests that the signal is corrupted by noise. In this context, the signal MSE can be considered as noise, and the similarity between two signals can be viewed as the equation below:
Peak signal-to-noise ratio (PSNR)
A metric used to measure the maximum power of a signal to the noise. It is commonly used in image signals because the pixel intensity in an image does not directly represent the actual signal value. Instead, the pixel intensity corresponds to color values, such as white being represented as 255 and black as 0
Gray scale image:
Color image:
-Norm
A mathematical concept used to measure the distance between two vectors. In signal processing, the L-norm is employed to quantify the difference between two signals. The L1-norm corresponds to the Manhattan distance, while the L2-norm corresponds to the Euclidean distance .
Structural similarity (SSIM)
SSIM is a similarity metric specifically designed for measuring the similarity between two image signals. Unlike other similarity measures, SSIM leverages the strong interdependencies between |
https://en.wikipedia.org/wiki/Sheila%20Greibach | Sheila Adele Greibach (born 6 October 1939 in New York City) is a researcher in formal languages in computing, automata, compiler theory and computer science. She is an Emeritus Professor of Computer Science at the University of California, Los Angeles, and notable work include working with Seymour Ginsburg and Michael A. Harrison in context-sensitive parsing using the stack automaton model.
Besides establishing the normal form (Greibach normal form) for context-free grammars, in 1965, she also investigated properties
of W-grammars, pushdown automata, and decidability problems.
Early career
Greibach earned an A.B. degree (summa cum laude) in Linguistics and Applied Mathematics from Radcliffe College in 1960, and two years after achieved an A.M. degree. In 1963, she was awarded a PhD at Harvard University, advised by Anthony Oettinger with a PhD thesis entitled "Inverses of Phrase Structure Generators".
She continued to work at Harvard at the Division of Engineering and Applied Physics until 1969 when she moved to UCLA, where she has been a professor until present (as of March 2014).
Work and contributions
Among her students were Ronald V. Book and Michael J. Fischer.
The following list indicates some of her work. The top portion of the list is from the ACM Digital Library and the remainder from the FOCS Bibliography by David M. Jones.
From ACM Digital Library
"Jump PDA's, deterministic context-free languages, principal AFDLs and polynomial time recognition (Extended Abstract)," Proceedings of the fifth annual ACM symposium on Theory of Computing, April 1973
Every deterministic context-free language can be accepted by a deterministic finite delay pda with jumps. Increasing the number of types or occurrences of jumps increases the family of languages accepted with finite delay. Hence the family of deterministic context-free language is a principal AFDL; there is a context-free language such that every context-free language is an inverse gsm image of or .
"Some restrictions on W-grammars"
Proceedings of the sixth annual ACM symposium on Theory of computing, April 1974
The effect of some restrictions on W-grammars (the formalization of the syntax of ALGOL 68) are explored. Two incomparable families examined at length are WRB (languages generated by normal regular-based W-grammars) and WS (languages generated by simple W-grammars). Both properly contain the context-free languages and are properly contained in the family of quasirealtime languages. In addition, WRB is closed under nested iterate ...
"An Infinite Hierarchy of Context-Free Languages," Journal of the ACM, Volume 16 Issue 1, January 1969
"A New Normal-Form Theorem for Context-Free Phrase Structure Grammars," JACM, Volume 12 Issue 1, January 1965
"The Unsolvability of the Recognition of Linear Context-Free Languages," JACM, Volume 13 Issue 4, October 1966
The problem of whether a given context-free language is linear is shown to be recursively undecidable.
Co-authored wo |
https://en.wikipedia.org/wiki/Kademlia | Kademlia is a distributed hash table for decentralized peer-to-peer computer networks designed by Petar Maymounkov and David Mazières in 2002. It specifies the structure of the network and the exchange of information through node lookups. Kademlia nodes communicate among themselves using UDP. A virtual or overlay network is formed by the participant nodes. Each node is identified by a number or node ID. The node ID serves not only as identification, but the Kademlia algorithm uses the node ID to locate values (usually file hashes or keywords).
In order to look up the value associated with a given key, the algorithm explores the network in several steps. Each step will find nodes that are closer to the key until the contacted node returns the value or no more closer nodes are found. This is very efficient: like many other s, Kademlia contacts only nodes during the search out of a total of nodes in the system.
Further advantages are found particularly in the decentralized structure, which increases the resistance against a denial-of-service attack. Even if a whole set of nodes is flooded, this will have limited effect on network availability, since the network will recover itself by knitting the network around these "holes".
I2P's implementation of Kademlia is modified to mitigate Kademlia's vulnerabilities, such as Sybil attacks.
System details
Peer-to-peer networks are made of nodes, by design. The protocols that these nodes use to communicate, and locate information, have become more efficient over time. The first generation peer-to-peer file sharing networks, such as Napster, relied on a central database to co-ordinate lookups on the network. Second generation peer-to-peer networks, such as Gnutella, used flooding to locate files, searching every node on the network. Third generation peer-to-peer networks, such as Bittorrent, use distributed hash tables to look up files in the network. Distributed hash tables store resource locations throughout the network.
Kademlia uses a "distance" calculation between two nodes. This distance is computed as the exclusive or (XOR) of the two node IDs, taking the result as an unsigned integer number. Keys and node IDs have the same format and length, so distance can be calculated among them in exactly the same way. The node ID is typically a large random number that is chosen with the goal of being unique for a particular node (see UUID). It can and does happen that geographically far nodes – from Germany and Australia, for instance – can be "neighbors" if they have chosen similar random node IDs.
XOR was chosen because it acts as a distance function between all the node IDs. Specifically:
the distance between a node and itself is zero
it is symmetric: the "distances" calculated from A to B and from B to A are the same
it follows the triangle inequality: given A, B and C are vertices (points) of a triangle, then the distance from A to B is shorter than (or equal to) the sum of both the distance from |
https://en.wikipedia.org/wiki/Atari%20Falcon | The Atari Falcon030 (usually shortened to Atari Falcon), released in 1992, is the final personal computer from Atari Corporation. A high-end model of the Atari ST line, the machine is based on a Motorola 68030 CPU and a Motorola 56001 digital signal processor, which distinguishes it from most other microcomputers of the era. It includes a new VIDEL programmable graphics system which greatly improves graphics capabilities.
Shortly after release, Atari bundled the MultiTOS operating system in addition to TOS. TOS remained in ROM, and MultiTOS was supplied on floppy disk and could be installed to boot from hard disk.
The Falcon was discontinued in late 1993–a year after its introduction–as Atari restructured itself to focus completely on the release and support of the Jaguar video game console. The Falcon sold in relatively small numbers, mainly to hobbyists.
Hardware
The heart of the system is the 32-bit Motorola 68030 clocked at 16 MHz. It runs at about 4 MIPS while displaying video modes with the fewest colors. Despite its 32-bit CPU, the Falcon does not have 32-bit architecture throughout its design, as it has a 16-bit data bus and a 24-bit address bus. This reduces the 68030's performance when not operating inside its tiny cache and limits the maximum system memory to ≈14 MB.
The microprocessor is optionally supported by a Motorola 56001 DSP clocked at 32 MHz and performing 16 million instructions per second. Although it is oriented to sound processing (it is directly connected to the RAM and codec via an interconnection matrix), it is also capable of graphics processing (for example, calculation of fractals, deformations, 3D projections, and JPEG decompression). It can even, jointly with the 68030, play MP3 files in real time.
Another innovation (for its time) is the VIDEL video controller. The possibilities offered by the graphics processor are limited only by its frequency (25/32 MHz core, adjustable to 50 MHz with a hardware accelerator) and the slowness of the RAM, as the graphics memory is shared with system memory which can degrade performance significantly when using high resolutions or video modes requiring many bit planes. The parameters are numerous; each timing of a video line (start, end, number of pixels, etc.) is adjustable, the image may be interlaced or not, and the vertical frequency can go down to 50 Hz interlaced to display on a television. The number of colors is also adjustable when VIDEL operates in bit plane mode. This mode is available for compatibility with the previous generation, but is quite complex to manage. There is also a true color 16-bit mode in which bits defining each pixel are grouped together to display 65,536 colors simultaneously, though CPU performance is degraded while displaying this mode.
In addition, Atari adopted the IDE bus in addition to the SCSI bus for connecting hard drives and CD-ROM drives. This allows for less expensive disk and CD-ROM devices, as SCSI interfaced devices remained re |
https://en.wikipedia.org/wiki/GURPS%20Cyberpunk | GURPS Cyberpunk is a genre toolkit for cyberpunk-themed role-playing games set in a near-future dystopia, such as that envisioned by William Gibson in his influential novel Neuromancer. It was published in 1990 after a significant delay caused by the original draft being a primary piece of evidence in Steve Jackson Games, Inc. v. United States Secret Service.
In 1993, GURPS Cyberpunk Adventures — a collection of three RPG scenarios in the GURPS Cyberpunk line — won the Origins Award for Best Roleplaying Adventure of 1992.
Unlike most commercially successful books from the third edition of the game, there is currently no Cyberpunk sourcebook for its fourth edition, as of 2023. Similar rules for advanced technology can be found in GURPS Ultra-Tech, from gadgets to cyberwear, but there aren't, for example, rules for netrunning which are essential for such games.
Contents
Besides the main chapters detailed below, GURPS Cyberpunk contains a glossary of common cyberpunk terms, an index, and a bibliography of relevant media.
Characters This chapter describes some of the most common character archetypes (netrunner, corp(orate), cop, celebrity, etc.) and their typical skills, advantages, and disadvantages. It also provides a guideline about how much money a given job might bring or cost.
Cyberwear Rules for and descriptions of bionic enhancements.
Technology & Equipment Lists many sorts of near-future gadgets.
Netrunning The longest in the book, it details rules for realistic computer networks as well as fantastic cyberspaces accessible only through a neural interface. It describes what types of system can be found in the Net and how the characters can act (and fight) there.
World Design Gives guidelines for designing your own cyberpunk world.
Campaigning Helps the Gamemaster in running a longer series of adventures.
U.S. Secret Service seizure
Loyd Blankenship, who was hired by Steve Jackson Games in 1989, was nearly finished with GURPS Cyberpunk later that year, which was intended both to introduce the company into the popular cyberpunk genre, and to help the company get over its financial difficulties.
GURPS Cyberpunk received notoriety when the Austin headquarters of Steve Jackson Games was raided by the U.S. Secret Service in 1990. The authorities seized the manuscript for the sourcebook, which was under development at the time, asserting that it was a "handbook for computer crime". The book was reconstructed and rewritten from older drafts when the manuscript was not returned. The seizure delayed publication for six weeks. This raid is often wrongly attributed to Operation Sundevil, a nationwide crackdown on illegal computer hacking activities that was occurring about this time.
GURPS Cyberpunk was ultimately published in 1990, joining the already-released cyberpunk role-playing games Cyberpunk 2013 (1988) from R. Talsorian, Cyberspace (1989) from ICE, and Shadowrun (1989) from FASA.
Publication history
The main sourcebook for th |
https://en.wikipedia.org/wiki/FreeSBIE | FreeSBIE is a live CD, an operating system that is able to load directly from a bootable CD with no installation process or hard disk. It is based on the FreeBSD operating system. Its name is a pun on frisbee. Currently, FreeSBIE uses Xfce and Fluxbox.
FreeSBIE 1.0 was based on FreeBSD 5.2.1 and released on February 27, 2004. The first version of FreeSBIE 2 was developed during the summer of 2005, thanks to the Google Summer of Code. FreeSBIE 2.0.1, which is a complete rewrite of the so-called toolkit, is based on FreeBSD 6.2 and was released on February 10, 2007. According to DistroWatch the FreeSBIE project is discontinued.
Goals
The goals of the FreeSBIE project are:
To develop a suite of programs to be used to create one's own CD, with all the personalizations desired
To make various ISO images available, each with its different goals and possible uses
See also
Comparison of BSD operating systems
References
External links
historic FreeSBIE project homepage (archive.org)
An interview with a FreeSBIE developer
FreeBSD
Live CD |
https://en.wikipedia.org/wiki/Sony%20Sports%20Network | Sony Sports Network, formerly known as Sony Pictures Sports Network and also known as Sony TEN, is a group of Indian pay television sports channels owned by Culver Max Entertainment.
The original TEN Sports channel was first established on 1 April 2002 by Abdul Rahman Bukhatir. It was acquired by Essel Group in 2010, and was added to Essel's existing Zee Sports channel, launched in 2005. After the acquisition, Zee launched two new channels, TEN Cricket and TEN Golf, and rebranded Zee Sports as TEN Action.
In August 2016, Sony Pictures Networks India acquired all of the sports channels under Zee from Essel. In 2017, the networks were formally merged with Sony's existing Sony ESPN and Sony Six channels as Sony Pictures Sports Network, with the TEN channels rebranded as Sony TEN. The channels were then rebranded as Sony Sports Network in October 2022, with all five channels now carrying the "Sony Sports Ten" prefix.
History
In January 2001, Taj Television Ltd. was formed in Dubai with Abdul Rahman Bukhatir as a backer. Bukhatir had various business interests and was known for transforming Sharjah as a major international cricket venue. The company launched the channel as TEN Sports (as part of its Taj Entertainment Network) on 1 April 2002. As of March 2004, the company was headed by Chris McDonald as CEO and had 100 employees.
In June 2005, Zee Telefilms Limited launched Zee Sports, reportedly India's first private sports channel. Zee Telefilms acquired a 50% stake in TEN Sports for 800 crore rupees (₹) in 2006, and eventually acquired the remainder of its Indian operations in 2010. The sale did not include its Pakistani operations, which were retained by Essel Group via the subsidiary Tower Sports.
In 2010, Zee rebranded Zee Sports as Ten Action which featured adventure sports and non-cricket content. In 2011 Zee launched a new channel called Ten Cricket, exclusively for cricket matches. In March 2016, all channels in the Zee network were rebranded as Ten 1, Ten 2, and Ten 3 respectively.
In August 2016, Sony Pictures Networks India announced its intent to acquire Zee's sports networks for US$385 million; the first phase of the sale, which included equity stakes in the holding companies Taj Television (India) Pvt. Ltd. and part of Taj TV Limited Mauritius, was completed in February 2017 for US$350 million. On 18 July 2017, all of Sony's sports channels in India were rebranded as Sony TEN, and high-definition feeds of Sony TEN 2 and 3 were also launched. The remainder of the sale was completed in September 2017.
The networks, along with new sisters Sony Six and Sony ESPN, were branded under the umbrella name Sony Pictures Sports Network, and began to phase in a rebranding as Sony Sports in 2020. Sony ESPN was shut down on 30 March 2020.
In June 2021, Sony launched Sony TEN 4, which broadcasts in the Telugu and Tamil languages. Actor Rana Daggubati served as a promotional ambassador for the network's launch.
On 24 October 2022, the Sony Pi |
https://en.wikipedia.org/wiki/TrueSpace | TrueSpace (styled as trueSpace) was a commercial 3D computer graphics and animation software developed by Caligari Corporation, bought-out by Microsoft. As of May 2009, it was officially discontinued, but with some 'unofficial support' up to February 2010.
History
The company was founded in 1985 by Roman Ormandy. A prototype 3D video animation package for the Amiga Computer led to the incorporation of Octree Software in 1986. From 1988 to 1992, Octree released several software packages including Caligari1, Caligari2, Caligari Broadcast, and Caligari 24. Caligari wanted to provide inexpensive yet professional, industrial video and corporate presentation software. In 1993 Octree Software moved from New York to California and became known as Caligari Corporation.
In 1994 trueSpace 1.0 was introduced on the Windows platform. In 1998 an employee inadvertently left a copy of the trueSpace 4.0 sourcecode on the company website's public FTP server. The source code was released to the internet by the piracy release group REVOLT.
In early 2008, the company was acquired by Microsoft and trueSpace 7.6 was released for free.
End of Life
As of May 19, 2009, Ormandy announced that TrueSpace had been discontinued:
Elsewhere he thanks everyone, urges people to download all the free software as soon as possible. It may currently (as of 2023) be downloaded from a fan site along with various plugins.
After 2010, many of the developers helped develop Microsoft's 3D Builder application available for free in the Windows Store. There are many similarities between 3D Builder and the original TrueSpace product.
Overview
TrueSpace was a modeling/animation/rendering package. It featured a plug-in architecture that allowed the user to create tools to enhance the core package. TrueSpace was at the last release version 7 (also known to its users as tS7). Point upgrades had brought it up to version Rosetta Beta 7.61 and had added new modeling features. It also had an interface that beginners found easy to learn.
Caligari had enhanced the modeling, surfacing and rendering capabilities of TrueSpace, and the latest version TrueSpace7 allowed all aspects of real-time design, modeling and animation within a virtual 3D space shared by remote participants over the broadband internet. The TrueSpace7 collaboration server enables multiple participants to connect to a shared 3D space to create and manipulate shared content in real-time.
Features
One of the most distinctive features of trueSpace is its interface, using mainly 3D widgets for most common editing operations. trueSpace can also be scripted, using Python for creating custom scripts, tools and plugins. trueSpace7 introduces the use of VBScript and JScript as scripting tools for developing plugins and interactive scenes. trueSpace is also known for its icon-heavy interface which was drastically overhauled for version 7 onwards. While staff at Caligari had originally made them 'inhouse' during the creation process of |
https://en.wikipedia.org/wiki/NFN | NFN may refer to:
National Froebel Network, set up by the National Froebel Foundation
"Normal for Norfolk", an example of medical slang
Nafferton railway station (National Rail station code), England
, a nudist federation in the Netherlands; see International Naturist Federation
Nepal Federatie Nederland, an advocacy organization for the relations between Nepal and the Netherlands |
https://en.wikipedia.org/wiki/Guinea%20Pig%20Club | The Guinea Pig Club, established in 1941, was a social club and mutual support network for British and allied aircrew injured during World War II. Its membership was made up of patients of Archibald McIndoe in Ward III at Queen Victoria Hospital, East Grinstead, Sussex, who had undergone experimental reconstructive plastic surgery, including facial reconstruction, generally after receiving burns injuries in aircraft. The club remained active after the end of the war, and its annual reunion meetings continued until 2007.
Name
The name "Guinea Pig" – the rodent species commonly used as a laboratory test subject – was chosen to reflect the experimental nature of the techniques and equipment used for reconstructive work at East Grinstead. The treatment of burns by surgery was in its infancy, and many casualties were suffering from injuries which, only a few years earlier, would have led to certain death. The hospital was nicknamed "the Sty".
Origins
The club was established informally in June 1941 with 39 patients, primarily as a drinking club, and rapidly won McIndoe's endorsement. The members were aircrew patients in Ward III and the surgeons and anaesthetists who treated them. Aircrew members had to be serving airmen who had gone through at least two surgical procedures. By the end of the war the club had 649 members. (643 names are listed on the "Roll of Honour" memorial at Queen Victoria Hospital.)
The original members were Royal Air Force (RAF) aircrew who had severe burns, generally to the face or hands. Most were British but other significant minorities included Canadians, Australians, New Zealanders and by the end of the war Americans, French, Russians, Czechs and Poles. In 1943, a dedicated Canadian wing was built at the hospital, on the initiative of the Royal Canadian Air Force and at Canadian expense. During the Battle of Britain, most of the patients at East Grinstead were fighter pilots, but by the end of the war around 80% of the members were from bomber crews of RAF Bomber Command. A minority of members had suffered non-burns-related injuries (for example, maxillofacial damage incurred in crashes); while another small minority came from army or navy rather than air force backgrounds. A few members even joined the club after the war's end, through injuries sustained in peacetime accidents, as Ward III remained operational until 1948.
Before the war the RAF had made preparations by setting up burns units in several hospitals to treat the expected casualties. At East Grinstead, McIndoe and his colleagues, including Albert Ross Tilley, developed and improved many techniques for treating and reconstructing burns victims. They had to deal with very severe injuries: one man, Air Gunner Les Wilkins, lost his face and hands and McIndoe recreated his fingers by making incisions between his knuckles.
Aware that many patients would have to stay in hospital for several years and undergo many reconstructive operations, MacIndoe set out to ma |
https://en.wikipedia.org/wiki/HSN | HSN, an initialism of its former name Home Shopping Network, is an American free-to-air television network owned by the Qurate Retail Group, which also owns catalog company Cornerstone Brands. It is based in the Gateway area of St. Petersburg, Florida, United States.
History
The forerunner of HSN was launched by Lowell Paxson (who later established PAX-TV, which is now Ion Television) and Roy Speer in 1982 as the Home Shopping Club, a local cable channel seen on Vision Cable and Group W Cable in Pinellas County, Florida. It expanded into the first national shopping network three years later on July 1, 1985, changing its name to the Home Shopping Network, and pioneering the concept of a televised sales pitch for consumer goods and services. Its competitor and future owner QVC was launched the following year.
In 1986, HSN began a second network that broadcast free-to-air on a number of television stations it had acquired under the name Silver King Broadcasting. In 1992, HSN spun off from Silver King Broadcasting, and afterwards saw Liberty Media acquire stock in the network. In 1996, the station group was sold back to Silver King Broadcasting, which was now owned by Barry Diller, and changed its name to "HSN Inc." after its merger with Silver King was completed. Under Diller's leadership, the HSN also acquired the USA Network, Sci-Fi Channel and Universal Television in October 1997. This resulted in HSN Inc. being changed to USA Network Inc. The purchase was finalized in February 1998.
In September 2000, Home Shopping Network changed its name to HSN.
Mindy Grossman became CEO of HSN in 2006, and aggressively reinvented and relaunched the brand. She took HSN public in 2008, and has overseen its multibillion-dollar retail portfolio and multimedia expansion. Grossman left HSNi in May 2017 to helm Weight Watchers.
In April 2017, HSN CEO Mindy Grossman stepped down to assume the CEO position at Weight Watchers. On July 6, 2017, Liberty Interactive announced it would buy the remaining 62% of HSN stock it did not already own in order to acquire the company for its QVC Group. QVC CEO Mike George would be CEO of the combined company.
In September 2018, HSN had partnered with Pickler & Ben for a "shop the show" feature that allows viewers to buy featured items from HSN via the show's website and HSN.com.
In May 2023, HSN's parent Qurate Retail Group's stock was facing a delisting from the Nasdaq if share prices are unable to rebound, as their stock has declined over 80% over the past year. In October 2023, CreditRiskMonitor reported that Qurate Retail Group was nearing a potential Chapter 11 bankruptcy filing.
Sister channels
HSN2, launched on August 1, 2010, acts as a timeshift channel carrying tape-delayed presentations of products and programming. Dish Network has carried it since launch.
America's Store, formerly the Home Shopping Club Overnight Service, was HSN's secondary service that was on the air from 1988 until April 2007.
Operations
HSN's |
https://en.wikipedia.org/wiki/Gnome%20%28disambiguation%29 | A gnome is a diminutive spirit in Renaissance magic and alchemy.
Gnome or GNOME may also refer to:
Computing
GNOME, a desktop environment for computers running Unix-like operating systems
GNO/ME (GNO Multitasking Environment), an environment for the Apple IIGS computer
Gnome sort, a sorting algorithm
Fictional races
Gnome (Dungeons & Dragons), a race in the Dungeons & Dragons role-playing game
Gnome (Dragonlance)
Gnomes (Warcraft), a race in World of Warcraft
Film and television
Gnomes (film), a 1980 film based on the 1977 book
"Gnomes" (South Park), a 1998 episode of South Park
Gnomes, characters in Gravity Falls
Literature
"The Gnome" (fairy tale), a German fairy tale collected by the Brothers Grimm
Gnomes (book), a 1977 book by Wil Huygen and illustrated by Rien Poortvliet
Lord Gnome, the fictional proprietor of the British satirical magazine Private Eye
Gnome, a villain appearing in the Marvel Comics series Nightmask
Other uses
Gnome (rhetoric), saying or maxim providing instruction in compact form
Gnome (car), a cyclecar made in London between 1925 and 1926
"The Gnome", a song by Pink Floyd
G-Nome, a video game released in 1997
Gnome Press, a 1948–1962 small-press publishing company
Garden gnome, a figurine used as a lawn ornament
Project Gnome, a nuclear test in 1961
Rolls-Royce Gnome, an aircraft engine
Sky Gnome, a device for accessing radio channels and digital television
Ramón Mercader (1913–1978), a foreign agent of the USSR codenamed GNOME
See also
Big Ears (character), a gnome featured in the Noddy series of children's books by Enid Blyton
Gnome et Rhône, a defunct aircraft engine manufacturer
A Gnome Named Gnorm, a 1990 fantasy comedy film
Gnomes of Zurich, disparaging term for Swiss bankers notably used by British Prime Minister Harold Wilson in 1964
"The Laughing Gnome", a novelty song by David Bowie
Noldor, one of the tribes of elves in J. R. R. Tolkien's fictional Middle-earth
Nome (disambiguation)
Gnomefish |
https://en.wikipedia.org/wiki/Backup | In information technology, a backup, or data backup is a copy of computer data taken and stored elsewhere so that it may be used to restore the original after a data loss event. The verb form, referring to the process of doing so, is "back up", whereas the noun and adjective form is "backup". Backups can be used to recover data after its loss from data deletion or corruption, or to recover data from an earlier time. Backups provide a simple form of disaster recovery; however not all backup systems are able to reconstitute a computer system or other complex configuration such as a computer cluster, active directory server, or database server.
A backup system contains at least one copy of all data considered worth saving. The data storage requirements can be large. An information repository model may be used to provide structure to this storage. There are different types of data storage devices used for copying backups of data that is already in secondary storage onto archive files. There are also different ways these devices can be arranged to provide geographic dispersion, data security, and portability.
Data is selected, extracted, and manipulated for storage. The process can include methods for dealing with live data, including open files, as well as compression, encryption, and de-duplication. Additional techniques apply to enterprise client-server backup. Backup schemes may include dry runs that validate the reliability of the data being backed up. There are limitations and human factors involved in any backup scheme.
Storage
A backup strategy requires an information repository, "a secondary storage space for data" that aggregates backups of data "sources". The repository could be as simple as a list of all backup media (DVDs, etc.) and the dates produced, or could include a computerized index, catalog, or relational database.
The backup data needs to be stored, requiring a backup rotation scheme, which is a system of backing up data to computer media that limits the number of backups of different dates retained separately, by appropriate re-use of the data storage media by overwriting of backups no longer needed. The scheme determines how and when each piece of removable storage is used for a backup operation and how long it is retained once it has backup data stored on it. The 3-2-1 rule can aid in the backup process. It states that there should be at least 3 copies of the data, stored on 2 different types of storage media, and one copy should be kept offsite, in a remote location (this can include cloud storage). 2 or more different media should be used to eliminate data loss due to similar reasons (for example, optical discs may tolerate being underwater while LTO tapes may not, and SSDs cannot fail due to head crashes or damaged spindle motors since they do not have any moving parts, unlike hard drives). An offsite copy protects against fire, theft of physical media (such as tapes or discs) and natural disasters like floods and earth |
https://en.wikipedia.org/wiki/Association%20for%20the%20Advancement%20of%20Artificial%20Intelligence | The Association for the Advancement of Artificial Intelligence (AAAI) is an international scientific society devoted to promote research in, and responsible use of, artificial intelligence. AAAI also aims to increase public understanding of artificial intelligence (AI), improve the teaching and training of AI practitioners, and provide guidance for research planners and funders concerning the importance and potential of current AI developments and future directions.
History
The organization was founded in 1979 under the name "American Association for Artificial Intelligence" and changed its name in 2007 to "Association for the Advancement of Artificial Intelligence". It has in excess of 4,000 members worldwide. In its early history, the organization was presided over by notable figures in computer science such as Allen Newell, Edward Feigenbaum, Marvin Minsky and John McCarthy. Since July 2022, Francesca Rossi has been serving as president. She will serve as president until July 2024 when president-elect Stephen Smith will begin his term.
Conferences and publications
The AAAI provides many services to the Artificial Intelligence community. The AAAI sponsors many conferences and symposia each year as well as providing support to 14 journals in the field of artificial intelligence. AAAI produces a quarterly publication, AI Magazine, which seeks to publish significant new research and literature across the entire field of artificial intelligence and to help members to keep abreast of research outside their immediate specialties. The magazine has been published continuously since 1980.
AAAI organises the "AAAI Conference on Artificial Intelligence", which is considered to be one of the top conferences in the field of artificial intelligence.
Awards
In addition to AAAI Fellowship, the AAAI grants several other awards:
ACM-AAAI Allen Newell Award
The ACM-AAAI Allen Newell Award is presented to an individual selected for career contributions that have breadth within computer science, or that bridge computer science and other disciplines. This endowed award is accompanied by a prize of $10,000, and is supported by the Association for the Advancement of Artificial Intelligence (AAAI), Association for Computing Machinery (ACM), and by individual contributions.
Past recipients:
Fred Brooks (1994)
Joshua Lederberg (1995)
Carver Mead (1997)
Saul Amarel (1998)
Nancy Leveson (1999)
Lotfi A. Zadeh (2000)
Ruzena Bajcsy (2001)
Peter Chen (2002)
David Haussler and Judea Pearl (2003)
Richard P. Gabriel (2004)
Jack Minker (2005)
Karen Spärck Jones (2006)
Leonidas Guibas (2007)
Barbara J. Grosz and Joseph Halpern (2008)
Michael I. Jordan (2009)
Takeo Kanade (2010)
Stephanie Forrest (2011)
Moshe Tennenholtz and Yoav Shoham (2012)
Jon Kleinberg (2014)
Eric Horvitz (2015)
Jitendra Malik (2016)
Margaret A. Boden (2017)
Henry Kautz (2018)
Lydia Kavraki and Daphne Koller (2019)
Moshe Y. Vardi and Hector J. Levesque (2020)
Carla Gomes (2021 |
https://en.wikipedia.org/wiki/Software%20engineering%20demographics | Software engineers form part of the workforce around the world. There are an estimated 26.9 million professional software engineers in the world as of 2022, up from 21 million in 2016.
By Country
United States
In 2022, there were an estimated 4.4 million professional software engineers in North America. There are 152 million people employed in the US workforce, making software engineers 2.54% of the total workforce. The total above is an increase compared to around 3.87 million software engineers employed in 2016.
Summary
Based on data from the U.S. Bureau of Labor Statistics from 2002, about 612,000 software engineers worked in the U.S. about one out of every 200 workers. There were 55% to 60% as many software engineers as all traditional engineers. This comparison holds whether one compares the number of practitioners, managers, educators, or technicians/programmers. Software engineering had 612,000 practitioners; 264,790 managers, 16,495 educators, and 457,320 programmers.
Software Engineers Vs. Traditional Engineers
The following two tables compare the number of software engineers (611,900 in 2002) versus the number of traditional engineers (1,157,020 in 2002).
There are another 1,500,000 people in system analysis, system administration, and computer support, many of whom might be called software engineers. Many systems analysts manage software development teams and analysis is an important software engineering role, so many of them might be considered software engineers in the near future. This means that the number of software engineers may actually be much higher.
It's important to note that the number of software engineers declined by 5-to-10 percent from 2000 to 2002.
Computer Managers Versus Construction and Engineering Managers
Computer and information system managers (264,790) manage software projects, as well as computer operations. Similarly, Construction and engineering managers (413,750) oversee engineering projects, manufacturing plants, and construction sites. Computer management is 64% the size of construction and engineering management.
Software Engineering Educators Versus Engineering Educators
Until now, computer science has been the main degree to acquire, whether for making software systems (software engineering) or studying the theoretical and mathematical facts of software systems (computer science). The data shows that the number of chemistry and physics educators (29,610) nearly equals the number of engineering educators (29,310). It is estimated that similarly, of computer science educators emphasize the practical (software engineering) (16,495) and of computer science educators emphasize the theoretical (computer science) (16,495). This means that software engineering education is 56% the size of traditional engineering education. Computer science is larger than software engineering, and larger than physics and chemistry.
Other Software and Engineering Roles
Relation to IT demographics
Software e |
https://en.wikipedia.org/wiki/Zhe | Zhe may refer to:
Zhe (Cyrillic), a letter of the Cyrillic alphabet
Zhe, a proposed gender-neutral pronoun (with: zhim, zhers, zhimself)
Maclura tridiydcuspidata (or zhè), a tree native to East Asia
Že, a letter of the Perso-Arabic alphabet
Zhejiang, a province of China
Qiantang River, the river after which Zhejiang Province was named
Schools
Zhe school (guqin), a school of musicians for the guqin
Zhe school (painting), painters of Southern School, which thrived during Ming dynasty of China
People
Viceroy of Min-Zhe, title of government official of China
Su Zhe (1039-1112), a politician and essayist from Meishan, China
Zou Zhe (1636-c.1708), noted Chinese painter during Qing Dynasty
Jiao Zhe, a Chinese footballer
Feng Zhe (1987- ), a male Chinese gymnast
Chen Zhe (1993- ), a professional snooker player from Shanxi, China
Li Zhe (disambiguation), various people
Shi Zhe (1905-1998), a Chinese interpreter
Song Zhe, a diplomat, ambassador of the People's Republic of China |
https://en.wikipedia.org/wiki/Real-time%20clock | A real-time clock (RTC) is an electronic device (most often in the form of an integrated circuit) that measures the passage of time.
Although the term often refers to the devices in personal computers, servers and embedded systems, RTCs are present in almost any electronic device which needs to keep accurate time of day.
Terminology
The term real-time clock is used to avoid confusion with ordinary hardware clocks which are only signals that govern digital electronics, and do not count time in human units. RTC should not be confused with real-time computing, which shares its three-letter acronym but does not directly relate to time of day.
Purpose
Although keeping time can be done without an RTC, using one has benefits:
Low power consumption (important when running from alternate power)
Frees the main system for time-critical tasks
Sometimes more accurate than other methods
A GPS receiver can shorten its startup time by comparing the current time, according to its RTC, with the time at which it last had a valid signal. If it has been less than a few hours, then the previous ephemeris is still usable.
Some motherboards are made without real time clocks. The real time clock is omitted either out of the desire to save money.
Power source
RTCs often have an alternate source of power, so they can continue to keep time while the primary source of power is off or unavailable. This alternate source of power is normally a lithium battery in older systems, but some newer systems use a supercapacitor, because they are rechargeable and can be soldered. The alternate power source can also supply power to battery backed RAM.
Timing
Most RTCs use a crystal oscillator, but some have the option of using the power line frequency. The crystal frequency is usually 32.768 kHz, the same frequency used in quartz clocks and watches. Being exactly 215 cycles per second, it is a convenient rate to use with simple binary counter circuits. The low frequency saves power, while remaining above human hearing range. The quartz tuning fork of these crystals does not change size much from temperature, so temperature does not change its frequency much.
Some RTCs use a micromechanical resonator on the silicon chip of the RTC. This reduces the size and cost of an RTC by reducing its parts count. Micromechanical resonators are much more sensitive to temperature than quartz resonators. So, these compensate for temperature changes using an electronic thermometer and electronic logic.
Typical crystal RTC accuracy specifications are from ±100 to ±20 parts per million (8.6 to 1.7 seconds per day), but temperature-compensated RTC ICs are available accurate to less than 5 parts per million. In practical terms, this is good enough to perform celestial navigation, the classic task of a chronometer. In 2011, chip-scale atomic clocks became available. Although vastly more expensive and power-hungry (120 mW vs. <1 μW), they keep time within 50 parts per trillion ().
Examples
Many |
https://en.wikipedia.org/wiki/David%20L.%20Mills | David L. Mills (born June 3, 1938) is an American computer engineer and Internet pioneer.
Education
Mills earned his PhD in Computer and Communication Sciences from the University of Michigan in 1971. While at Michigan he worked on the ARPA sponsored Conversational Use of Computers (CONCOMP) project and developed DEC PDP-8 based hardware and software to allow terminals to be connected over phone lines to an IBM 360 mainframe.
Career
In 1977, Mills began working at COMSAT. There he worked on synchronizing the clocks of computers connected to ARPANET, inventing the Network Time Protocol. He told The New Yorker in 2022 that he enjoyed working on synchronized time because no one else was working on it, giving him his own "little fief". In the mid-2000s, Mills turned over full control of the NTP reference implementation to Harlan Stenn.
Mills was the chairman of the Gateway Algorithms and Data Structures Task Force (GADS) and the first chairman of the Internet Architecture Task Force. He invented the DEC LSI-11 based Fuzzball router that was used for the 56 kbit/s NSFNET (1985), inspired the author of ping for BSD (1983), and had the first FTP implementation. He has authored numerous RFCs.
In 1999 he was inducted as a Fellow of the Association for Computing Machinery, and in 2002, he was inducted as a Fellow of the Institute of Electrical and Electronics Engineers (IEEE) for contributions to network protocols and network timekeeping in the development of the Internet. In 2008, Mills was elected a member of the National Academy of Engineering (NAE) for contributions to Internet timekeeping and the development of the Network Time Protocol. In 2013 he received the IEEE Internet Award "For significant leadership and sustained contributions in the research, development, standardization, and deployment of quality time synchronization capabilities for the Internet."
Mills is an emeritus professor at the University of Delaware, where he was a full professor from 1986 to 2008. He also holds an adjunct appointment at Delaware so that he can continue to teach.
Personal life
Mills is an amateur radio operator, callsign W3HCF.
Mills has glaucoma, but a surgeon saved some of the vision in his left eye when he was a child. He attended a school in San Mateo, California, for the visually impaired. His vision began worsening around 2012, and by 2022 he was fully blind.
References
External links
A Maze of Twisty, Turney Passages - Routing in the Internet Swamp. Lecture by David L. Mills at the University of Delaware. Given on May 26, 2005.
Oral history interview with David L. Mills, Charles Babbage Institute, University of Minnesota. Interview covers Mills' invention of Network Time Protocol, his chairing the Internet Architecture Task Force, and interactions with colleagues including Vinton Cerf, David D. Clark, Jon Postel, Peter Kirstein, and David Farber.
The Thorny Problem of Keeping the Internet’s Time, New Yorker article by Nate Hopper. Popular arti |
https://en.wikipedia.org/wiki/Diskworld | Diskworld () was a disk magazine for the Apple Macintosh computer system, published by Softdisk beginning in 1988. It was a sister publication of Softdisk for the Apple II, Loadstar for the Commodore 64, and Big Blue Disk for the IBM PC. Diskworld ceased publication in 1998.
Overview
Diskworld was originally designed and created by Sean Golden (Managing Editor), Jeff Billings (Senior Programmer) and Lynda Fowler (Junior Programmer). Sean Golden wrote the original Diskworld "shell" program which provided access to the monthly disk contents. He also wrote most of the editorial content each month. Jeff Billings and Lynda Fowler developed monthly productivity, utility or game programs which were published on the disk. Jeff and Lynda also provided some editorial content, and Sean also contributed programs. Freelance programmers also provided content for a fee. The product was broken down into editorials, articles, reviews, artwork and software, all presented with the custom "shell" program which allowed users to run the disk without having to swap out system disks on the original Macintosh. The early issues were published on 400K disks, but moved to 800K disks when the 400K disks become obsolete.
Eventually it was possible to produce a version of the "shell" program that did not carry a duplicate version of the Mac OS when hard drives became commonplace. That allowed for more content to be published on each disk. Jeff Billings left the company and Lynda Fowler became Senior Programmer. When Sean Golden was promoted to Softdisk Publishing, Inc. Publisher, Lynda Fowler became Managing Editor of Diskworld.
Later, Diskworld was renamed Softdisk for Mac, but it ceased publication in 1998 along with the other disk magazines published by Softdisk (other than Loadstar, which broke off as an independent company and continued into the 2000s) as the company moved more into Internet development.
References
Disk magazines
Defunct computer magazines published in the United States
Magazines established in 1988
Magazines disestablished in 1998
Softdisk |
https://en.wikipedia.org/wiki/IBM%201440 | The IBM 1440 computer was announced by IBM October 11, 1962. This member of the IBM 1400 series was described many years later as "essentially a lower-cost version of the 1401", and programs for the 1440 could easily be adapted to run on the IBM 1401.
Despite what IBM described as "special features ... to meet immediate data processing requirements and ... to absorb increased demands," the 1440 did not quite attain the same commercial success as the 1401, and it was withdrawn on February 8, 1971.
Author Emerson Pugh wrote that the 1440 "did poorly in the marketplace because it was initially offered without the ability to attach magnetic tape units as well." (referring to offering both tape and disk).
System configuration
The IBM 1441 processing unit (CPU) contained arithmetic and logic circuits and up to 16,000 alphanumeric storage positions.
The console was either a Model 1 or, when an electric typewriter was added, a Model 2, of the IBM 1447 operator's console.
Peripherals
The following peripherals were available:
IBM 1442 card reader/punch
Model 1 read up to 300 cards a minute and punched up to 80 columns a second
Model 2 read up to 400 cards a minute and punched up to 160 columns a second
Model 4, a read-only unit, read up to 400 cards/minute.
An IBM 1440 could be configured with a choice of:
Model 4 (lowest cost)
Model 4, for reading, and a Model 1 or 2 as a second unit
IBM 1443 flying typebar printer
Basic rate of 150 lines a minute and up to 430 lines a minute, depending on typebar
Interchangeable typebars having character sets of 13, 39, 52, and 63 characters
IBM 1311 disk drive
Capacity for 2 million characters in each removable pack
With optional "Move Track Record" feature, capacity is increased to 2,980,000 characters in each pack
Each pack weighed less than 10 lb (5 kg).
Up to five 1311 drives
Tape drives
The IBM 7335 tape drive, available for use with the 1440, was introduced by IBM on October 10, 1963.
Software
IBM 1440 Autocoder was the assembly language provided by IBM. An IOCS was also provided, as was a collection of "Disk File Organization Routines".
Pricing
The cost and rental rate were:
Purchase price: $90,000 and up, depending on system configuration.
Rental rate: $1,500 and up, monthly rental, depending on system configuration.
Installations
Notable installations included a high-end 1440 at the Chicago Police Department installed by reformist superintendent Orlando Winfield Wilson in the early 1960s.
In the 1960s, Polish ZOWAR (ZETO Warszawa) was officially the first customer for IBM in Poland after WWII, despite the Iron Curtain.
In 2012, the TechWorks! Prototype Workshop of the Center for Technology & Innovation (CT&I) in Binghamton, New York successfully resurrected a 1440 system including a CPU and console, a 1311 disk drive, and a 1442 card reader/punch.
An example of a more fully configured 1440 was:
five disk drives
two magnetic tape drives
two card reader-punches
one high-speed |
https://en.wikipedia.org/wiki/Metal%20Gear%202%3A%20Solid%20Snake | Metal Gear 2: Solid Snake is a 1990 action-adventure stealth video game developed and published by Konami for the MSX2 computer platform. It serves as a direct sequel to the MSX2 version of the original Metal Gear, written and designed by series's creator Hideo Kojima, who conceived the game in response to Snake's Revenge, a separately-produced sequel that was being developed at the time for the NES specifically for the North American and European markets. The MSX2 version of Solid Snake was only released in Japan, although Kojima would later direct another sequel titled Metal Gear Solid, which was released worldwide for the PlayStation in 1998 to critical acclaim. This later led to Solid Snake being re-released alongside the original Metal Gear as additional content in the Subsistence version of Metal Gear Solid 3 for the PlayStation 2 in 2005. It was also included in the HD remastered ports of Metal Gear Solid 3 released for PlayStation 3, PlayStation Vita, and Xbox 360, and was given a stand-alone re-release in Japan as a downloadable game for mobile phones and the Wii Virtual Console.
Set in 1999, a few years after the events of the original game, Solid Snake must infiltrate a heavily defended territory known as Zanzibar Land to rescue a kidnapped scientist and destroy the revised "Metal Gear D". The game significantly evolved the stealth-based game system of its predecessor "in almost every way", introduced a complex storyline dealing with themes such as the nature of warfare and nuclear proliferation, and is considered "one of the best 8 bit games ever made."
Gameplay
Solid Snake builds upon the stealth-based gameplay system of its predecessor. As in the original Metal Gear, the player's objective is to infiltrate the enemy's stronghold, while avoiding detection from soldiers, cameras, infrared sensors and other surveillance devices. The biggest change in the game was done to the enemy's abilities. Instead of remaining stationed in one screen like in the first game, enemy soldiers can now patrol different screens across a single map. Moreover, guards now have an expanded field of vision of 45 degrees, along with the ability to turn their heads left or right to see diagonally. The enemy can also detect sounds, with the enemy able to hear any noise made by the player, such as a punch to the wall and gunshots made without a suppressor, and will investigate the source of the sound once it is made. They can also detect sounds made from the player walking on certain surfaces, which means players need to be careful about what surfaces they walk on. If the player is discovered by the enemy, then a counter will be displayed on the upper right side of the screen that will go down after the enemy has lost track of the player. When the counter reaches zero, the alert phase will go off and the game will return to normal.
The player is given a variety of new maneuvers and tools to help them remain undetected and complete the game. For example, the pl |
https://en.wikipedia.org/wiki/Captive%20portal | A captive portal is a web page accessed with a web browser that is displayed to newly connected users of a Wi-Fi or wired network before they are granted broader access to network resources. Captive portals are commonly used to present a landing or log-in page which may require authentication, payment, acceptance of an end-user license agreement, acceptable use policy, survey completion, or other valid credentials that both the host and user agree to adhere by. Captive portals are used for a broad range of mobile and pedestrian broadband services – including cable and commercially provided Wi-Fi and home hotspots. A captive portal can also be used to provide access to enterprise or residential wired networks, such as apartment houses, hotel rooms, and business centers.
The captive portal is presented to the client and is stored either at the gateway or on a web server hosting the web page. Depending on the feature set of the gateway, websites or TCP ports can be allow-listed so that the user would not have to interact with the captive portal in order to use them. The MAC address of attached clients can also be used to bypass the login process for specified devices.
WISPr refers to this web browser-based authentication method as the Universal Access Method (UAM).
Uses
Captive portals are primarily used in open wireless networks where the users are shown a welcome message informing them of the conditions of access (allowed ports, liability, etc.). Administrators tend to do this so that their own users take responsibility for their actions and to avoid any legal responsibility. Whether this delegation of responsibility is legally valid is a matter of debate. Some networks may also require entering the user's cell phone number or identity information so that administrators can provide information to authorities in case there was illegal activity on the network.
Often captive portals are used for marketing and commercial communication purposes. Access to the Internet over open Wi-Fi is prohibited until the user exchanges personal data by filling out a web-based registration form in a web browser. The web-based form either automatically opens in a web browser, or appears when the user opens a web browser and tries to visit any web page. In other words, the user is "captive" - unable to access the Internet freely until the user is granted access to the Internet and has "completed" the captive portal. This allows the provider of this service to display or send advertisements to users who connect to the Wi-Fi access point. This type of service is also sometimes known as "social Wi-Fi", as they may ask for a social network account to login (such as Facebook). Over the past few years, such social Wi-Fi captive portals have become commonplace with various companies offering marketing centered around Wi-Fi data collection.
The user can find many types of content in the captive portal, and it's frequent to allow access to the Internet in exchange for vie |
https://en.wikipedia.org/wiki/Authentication%20protocol | An authentication protocol is a type of computer communications protocol or cryptographic protocol specifically designed for transfer of authentication data between two entities. It allows the receiving entity to authenticate the connecting entity (e.g. Client connecting to a Server) as well as authenticate itself to the connecting entity (Server to a client) by declaring the type of information needed for authentication as well as syntax. It is the most important layer of protection needed for secure communication within computer networks.
Purpose
With the increasing amount of trustworthy information being accessible over the network, the need for keeping unauthorized persons from access to this data emerged. Stealing someone's identity is easy in the computing world - special verification methods had to be invented to find out whether the person/computer requesting data is really who he says he is. The task of the authentication protocol is to specify the exact series of steps needed for execution of the authentication. It has to comply with the main protocol principles:
A Protocol has to involve two or more parties and everyone involved in the protocol must know the protocol in advance.
All the included parties have to follow the protocol.
A protocol has to be unambiguous - each step must be defined precisely.
A protocol must be complete - must include a specified action for every possible situation.
An illustration of password-based authentication using simple authentication protocol:
Alice (an entity wishing to be verified) and Bob (an entity verifying Alice's identity) are both aware of the protocol they agreed on using. Bob has Alice's password stored in a database for comparison.
Alice sends Bob her password in a packet complying with the protocol rules.
Bob checks the received password against the one stored in his database. Then he sends a packet saying "Authentication successful" or "Authentication failed" based on the result.
This is an example of a very basic authentication protocol vulnerable to many threats such as eavesdropping, replay attack, man-in-the-middle attacks, dictionary attacks or brute-force attacks. Most authentication protocols are more complicated in order to be resilient against these attacks.
Types
Authentication protocols developed for PPP Point-to-Point Protocol
Protocols are used mainly by Point-to-Point Protocol (PPP) servers to validate the identity of remote clients before granting them access to server data. Most of them use a password as the cornerstone of the authentication. In most cases, the password has to be shared between the communicating entities in advance.
PAP - Password Authentication Protocol
Password Authentication Protocol is one of the oldest authentication protocols. Authentication is initialized by the client sending a packet with credentials (username and password) at the beginning of the connection, with the client repeating the authentication request until acknowledgement |
https://en.wikipedia.org/wiki/Information%20Technology%20Association%20of%20America | The Information Technology Association of America (ITAA), formerly the Association of Data Processing Service Organizations (ADAPSO), was a leading industry trade group for information technology companies. The association's membership contained most of the world's major Information and communications technology (ICT) firms, accounting for over 90% of ICT goods and services sold in North America. By 2009, the organization had merged with others to form TechAmerica
History
Organizational meetings of what was initially called the Data Actuating Technical Association (DATA) began in 1960. In 1961, the Association of Data Processing Service Organizations (ADAPSO) was founded as a "service bureau" trade association, and formally incorporated in 1962. Initially headquartered in Abington, Pennsylvania, then relocating to downtown New York city, ADAPSO published directories of the nascent industry, commissioned well-regarded surveys of the computer industry, and organized user-centered "Management Symposiums" that discussed the industry, pricing, and ethics. ADAPSO's industry surveys were taken up by Peter Cunningham's INPUT. ADAPSO moved to the Washington, D.C., area in 1978 to be closer to government policymakers and advocates.
ADAPSO was renamed ITAA in 1991.
In March 2007 ITAA President Phil Bond expressed his desire in merging ITAA with another high tech trade association. On January 17, 2008, ITAA announced that it had agreed to so-called "merger of equals" with the Government Electronics and Information Technology Association (GEIA), and that the combined association would retain the ITAA name. Until earlier in the year GEIA had been an affiliate of EIA (a trade association formerly known as the Electronic Industries Alliance) EIA has been very financially successful, unlike ITAA. GEIA is slated to share in the distribution over $50 million in assets resulting in the breakup of EIA. [The fall of EIA: What happened?
In 2008 the ITAA merged with the CyberSecurity Industry Alliance and the Government Electronics Industry Association.
In 2009 the ITAA merged with the AeA (formerly the American Electronics Association) to form TechAmerica. Hank Steininger was the last ITAA board chair prior to the merger.
Surveys
ITAA conducted surveys of CIOs.
Real ID
ITAA actively lobbied on behalf of the funding for the Real ID.
Some have asserted that Real ID will turn state driver's licenses into a national identity card and impose numerous new burdens on taxpayers, citizens, immigrants, and state governments – while doing nothing to protect against terrorism. As a result, it is stirring intense opposition from many groups across the political spectrum. Critics have claimed that ITAA supports the national ID card because its member companies would benefit from financially from implementing the card.
Publications
ITAA published a series of newsletters, beginning with ADAPSO News in the early 1960s. Its last regular newsletter, the ITAA E |
https://en.wikipedia.org/wiki/Sustrans | Sustrans is a United Kingdom-based walking, wheeling and cycling charity, and the custodian of the National Cycle Network.
Its flagship project is the National Cycle Network, which has created of signed cycle routes throughout the United Kingdom including of traffic-free paths. The rest of the network is on previously existing and mostly minor roads, in which motor traffic will be encountered.
In Scotland, Sustrans has established partnership teams, embedding officers in local councils as well as NHS Scotland, the Scottish Environment Protection Agency, Scottish Natural Heritage, and Transport for Edinburgh.
History
Sustrans was formed in Bristol in July 1977 as Cyclebag by a group of cyclists and environmentalists, motivated by emerging doubts about the desirability of over-dependence on the private car, following the 1973 oil crisis, and the almost total lack of specific provision for cyclists in most British cities, in contrast to some other European countries.
A decade earlier, the Beeching Axe closed many British railways that the government considered underused and too costly. One such railway was the former Midland Railway line between central Bristol and Bath, closed in favour of the more direct, former Great Western Railway between the cities. Led by John Grimshaw, Cyclebag leased part of the old route and together with many volunteers and the help of Avon County Council (Bristol and Bath were then part of the County of Avon) turned it into its first route, the Bristol & Bath Railway Path.
In the early 1980s, when unemployment rose, the organisation took advantage of government schemes to provide temporary employment to build similar "green routes". British Waterways and Cyclebag collaborated to improve towpaths along some canals, which resulted in increased use of the towpaths, especially by cyclists.
In 1983, the charity Sustrans was founded. It had 11 directors (trustees, members and board members of the charity) chosen by the existing board. The executive board was composed of the chief executive, John Grimshaw, and one of the two company secretaries.
By the early 1990s, Sustrans had a growing number of supporters, and the network of national routes was emerging. In 1995, it was granted £43.5 million from the Millennium Lottery Fund to extend the National Cycle Network to smaller towns and rural areas, as well as launch the "Safe Routes to Schools" project, based on earlier state projects in Denmark.
The five-year project, Connect2 was launched in 2006, and it aimed at improving local travel in 79 communities by creating new walking and cycling routes. In 2007 it received £50 million from the Big Lottery's 'Living Landmarks; The People's Millions' competition, following a public vote.
In 2015, Sustrans ran the Campaign for Safer Streets, which encouraged people to write to Prime Minister David Cameron to encourage him to commit to funding safer walking and cycling routes to schools.
In October 2015, Sustrans released its |
https://en.wikipedia.org/wiki/Red%20Pike%20%28cipher%29 | Red Pike is a classified United Kingdom government encryption algorithm, proposed for use by the National Health Service by GCHQ, but designed for a "broad range of applications in the British government" . Little is publicly known about Red Pike, except that it is a block cipher with a 64-bit block size and 64-bit key length. According to the academic study of the cipher cited below and quoted in a paper by Ross Anderson and Markus Kuhn, it "uses the same basic operations as RC5" (add, XOR, and left shift) and "has no look-up tables, virtually no key schedule and requires only five lines of code"; "the influence of each key bit quickly cascades" and "each encryption involves of the order of 100 operations".
Red Pike is available to approved British government contractors in software form, for use in confidential (not secret) government communication systems. GCHQ also designed the Rambutan cryptosystem for the same segment.
Given that Red Pike is a British encryption algorithm, its name likely refers to a particular fell in the western English Lake District.
Supposed source code
In February 2014, the supposed source code for Red Pike was posted as follows to the Cypherpunk mailing list.
/* Red Pike cipher source code */
#include <stdint.h>
typedef uint32_t word;
#define CONST 0x9E3779B9
#define ROUNDS 16
#define ROTL(X, R) (((X) << ((R) & 31)) | ((X) >> (32 - ((R) & 31))))
#define ROTR(X, R) (((X) >> ((R) & 31)) | ((X) << (32 - ((R) & 31))))
void encrypt(word * x, const word * k)
{
unsigned int i;
word rk0 = k[0];
word rk1 = k[1];
for (i = 0; i < ROUNDS; i++)
{
rk0 += CONST;
rk1 -= CONST;
x[0] ^= rk0;
x[0] += x[1];
x[0] = ROTL(x[0], x[1]);
x[1] = ROTR(x[1], x[0]);
x[1] -= x[0];
x[1] ^= rk1;
}
rk0 = x[0]; x[0] = x[1]; x[1] = rk0;
}
void decrypt(word * x, const word * k)
{
word dk[2] =
{
k[1] - CONST * (ROUNDS + 1),
k[0] + CONST * (ROUNDS + 1)
};
encrypt(x, dk);
}
See also
Type 1 product
References
C Mitchell, S Murphy, F Piper, P Wild. (1996). Red Pike — an assessment. Codes and Ciphers Ltd 2/10/96.
Paper by Anderson and Kuhn which includes excerpts from (Mitchell et al., 1996). Another version is
"The use of encryption and related services with the NHSnet"
Block ciphers
GCHQ |
https://en.wikipedia.org/wiki/Daniel%20Keys%20Moran | Daniel Keys Moran (born November 30, 1962), also known by his initials DKM, is an American computer programmer and science fiction writer.
Biography
Moran was born in Los Angeles to Richard Joseph Moran and Marilynn Joyce Moran. He has three sisters, Kari Lynn Moran, Jodi Anne Moran and Kathleen Moran.
A native of Southern California, he formerly lived (with his former wife Holly Thomas Moran) in North Hollywood. DKM, his third wife Amy Stout-Moran, and their sons Richard Moran and Connor Moran, along with Amy's two daughters and one son later lived in Woodland Hills, Los Angeles.
In early 2005 Keys Moran lost vision in one eye due to wet macular degeneration.
Bibliography
Moran's first story, "All the Time in the World", appeared in Asimov's Science Fiction in May 1982. This was incorporated into his first novel, The Armageddon Blues: A Tale of the Great Wheel of Existence, which was also the first novel of his projected series "Tales of the Great Wheel of Existence". A sub-series, "Tales of the Continuing Time", has been projected to include 32 volumes in its entirety, of which three novels were published in the late 1980s and early 1990s, and a fourth novel, The A.I. War, Book One: The Big Boost, in 2011.
The Great Wheel of Existence
The multi-verse in which most of DKM’s work is set.
“The Gray Maelstrom” – Isaac Asimov’s Science Fiction Magazine. Vol. 7 No. 2 (whole no. 62) February 1983. Story art: John Pierard.
Human/Praxcelis Union
“All the Time in the World” – Isaac Asimov’s Science Fiction Magazine. Vol. 6 No. 5 (whole no. 52) May 1982. Story art: Laura Buscemi/Artifact.
The Armageddon Blues (expansion of "All the Time in the World") – Bantam Spectra paperback (April 1988). . Cover art: Jim Burns.Quiet Vision hardcover (April 2001), tradepaper (June 2002). Cover design: DKM.
“Realtime” (with Gladys Prebehalla) Isaac Asimov’s Science Fiction Magazine. Vol. 8 No. 8 (whole no. 81) August 1984. Cover art: Hisaki Yasuda. Story art: Ron Lindahn.
The Ring – Bantom Doubleday hardcover (October 1988). . Jacket art: Shusei. Jacket design: Jamie S. Warren.based in part on a screenplay by William Stewart and Joanne Nelson.
The Continuing Time
Emerald Eyes – Bantam Spectra paperback (June 1988). . Cover art: Paul and Stephen Youll.Quiet Vision hardcover (June 2001), tradepaper (June 2002). Cover art and design: DKM.
The Long Run – Bantam Spectra paperback (September 1989). . Cover art Jim Burns.Quiet Vision hardcover (August 2001), tradepaper (April 2002). Cover design: DKM.
Emerald Eyes / "The Star" / The Long Run – Queen Of Angels limited edition hardcover omnibus (August 1998). Jacket art and design: DKM.“The Star” is a new short story set between the two novels, and is also included in the Quiet Vision printings of Emerald Eyes.
The Last Dancer – Bantam Spectra paperback (November 1993). . Cover art: Sanjulián.Quiet Vision hardcover (March 2002). Jacket art and design: DKM.
The A.I. War, Book One: |
https://en.wikipedia.org/wiki/List%20of%20Sydney%20Trains%20railway%20stations | Sydney Trains is a train operator of a commuter-based rail network centred on the metropolitan area of Sydney which comprises seven metropolitan lines. The entire length of railway in New South Wales is maintained by Transport for New South Wales which is a statutory authority of the Government of New South Wales. It was formed when CityRail was dissolved on 30 June 2013. The former CityRail network has over 2,060 km (1282 mi) of track. The Sydney Trains network extends up to Berowra, to the north, Richmond to the north-west, Emu Plains to the west, Waterfall to the south (with some peak hour services continuing to Helensburgh), and Macarthur to the south west.
Most of the Sydney Trains network runs on the surface of suburban areas while some recently constructed and inner city sections run underground. The network is served by a fleet of double-deck electric multiple units.
Stations
See also
Railways in Sydney
List of closed Sydney railway stations
Proposed railways in Sydney
List of Sydney Metro railway stations
List of NSW TrainLink railway stations
Related
Lists of railway stations
List of metro systems
List of suburban and commuter rail systems
List of Sydney suburbs
Public transport in Sydney
Railways in Sydney
Transport in Australia
References
External links
Station facilities – Sydney Trains and NSW TrainLink
Railway stations
Sydney trains
Railway stations
Lists of commuter rail stations |
https://en.wikipedia.org/wiki/ANIM | ANIM is a file format, used to store digital movies and computer generated animations (hence the ANIM name), and is a variation of the ILBM format, which is a subformat of Interchange File Format.
Main Features
Anim FileTypes
Known filetypes for Anim into AmigaOS are: Anim1, Anim2, Anim3, Anim5 and Anim7. Anim1 to Anim3 did not support audio. Anim 5 and Anim7 should be able to contain Audio Data, being a complete movie animation file format.
Additions to IFF Standard
In addition to the normal ILBM chunks, ANIM filetype also defines:
ANHD (ANimation HeaDer)
DLTA - stores changes between frames, with various compression methods supported to make use of the redundancy between frames.
Compression modes:
ANIM-0 ILBM BODY (no delta compression)
ANIM-1 ILBM XOR
ANIM-2 Long Delta mode
ANIM-3 Short Delta mode
ANIM-4 General Delta mode
ANIM-5 Byte Vertical Delta mode (most common)
ANIM-6 Stereo Byte Delta mode (stereoscopic frames)
ANIM-7 Anim-5 compression using LONG/WORD data
ANIM-8 Anim-5 compression using LONG/WORD data
ANIM-J Eric Grahams compression format (Sculpt 3D / Sculpt 4D)
It is possible to have several compression modes inside a file.
History
The ANIM IFF format was developed in 1988 at Sparta Inc., a firm based in California, originally for the production of animated video sequences on the Amiga computer, and was used for the first time in Aegis Development's Videoscape and Video Titler programs for the Amiga line of computers. Being very efficient and an official subset of existing Amiga ILBM/IFF standard file format, it became the de facto standard for animation files on the Amiga.
The file format must have these characteristics:
Be able to store, and playback, sequences of frames and to minimize both the storage space on disk (through compression) and playback time (through efficient de-compression algorithms).
Maintain maximum compatibility with existing IFF formats and to be able to display the initial frame as a normal still IFF picture.
Several compression schemes have been introduced in the ANIM format. Most of these are strictly of historical interest, as the only one currently used is the vertical run length encoded byte encoding developed by Atari software programmer Jim Kent.
Amiga Anim7 format was created in 1992 by programmer Wolfgang Hofer.
A video file format originally created for the Commodore CDTV, and later adapted for the Amiga CD32, was called CDXL and was similar to the ANIM file format.
The ANIM format is supported by at least one current online image editor.
Technical Overview
A minimum Anim file consists of three ILBM interleaved bitmap images. The first bitmap is a full image, necessary for the creation of the "next" frame whilst the other two are "delta" images, calculated as differences from the first one.
The initial frame is a normal run-length-encoded, IFF picture, and this allows a preview of the contents of the file. Subsequent frames are then described by listing only their di |
https://en.wikipedia.org/wiki/SRV%20record | A Service record (SRV record) is a specification of data in the Domain Name System defining the location, i.e., the hostname and port number, of servers for specified services. It is defined in RFC 2782, and its type code is 33. Some Internet protocols such as the Session Initiation Protocol (SIP) and the Extensible Messaging and Presence Protocol (XMPP) often require SRV support by network elements.
Record format
A SRV record has the form:
service: the symbolic name of the desired service.
proto: the transport protocol of the desired service; this is usually either TCP or UDP.
name: the domain name for which this record is valid, ending in a dot.
ttl: standard DNS time to live field.
IN: standard DNS class field (this is always IN).
SRV: Type of Record (this is always SRV).
priority: the priority of the target host, lower value means more preferred.
weight: A relative weight for records with the same priority, higher value means higher chance of getting picked.
port: the TCP or UDP port on which the service is to be found.
target: the canonical hostname of the machine providing the service, ending in a dot.
An example SRV record in textual form that might be found in a zone file might be the following:
This points to a server named sipserver.example.com listening on TCP port 5060 for Session Initiation Protocol (SIP) protocol services. The priority given here is 0, and the weight is 5.
As in MX records, the target in SRV records must point to hostname with an address record (A or AAAA record). Pointing to a hostname with a CNAME record is not a valid configuration.
Provisioning for high service availability
The priority field determines the precedence of the use of the record's data. Clients should use the SRV records with the lowest-numbered priority value first, and fall back to records of higher value if the connection fails. If a service has multiple SRV records with the same priority value, clients should load balance them in proportion to the values of their weight fields.
In the following example, both the priority and weight fields are used to provide a combination of load balancing and backup service.
The first three records share a priority of 10, so the weight field's value will be used by clients to determine which server (host and port combination) to contact. The sum of all three values is 100, so bigbox.example.com will be used 60% of the time. The two hosts, smallbox1 and smallbox2 will be used for 40% of requests total, with half of them sent to smallbox1, and the other half to smallbox2. If bigbox is unavailable, these two remaining machines will share the load equally, since they will each be selected 50% of the time.
If all three servers with priority 10 are unavailable, the record with the next lowest priority value will be chosen, which is backupbox.example.com. This might be a machine in another physical location, presumably not vulnerable to anything that would cause the first three hosts to become u |
https://en.wikipedia.org/wiki/HDMI | High-Definition Multimedia Interface (HDMI) is a proprietary audio/video interface for transmitting uncompressed video data and compressed or uncompressed digital audio data from an HDMI-compliant source device, such as a display controller, to a compatible computer monitor, video projector, digital television, or digital audio device. HDMI is a digital replacement for analog video standards.
HDMI implements the ANSI/CTA-861 standard, which defines video formats and waveforms, transport of compressed and uncompressed LPCM audio, auxiliary data, and implementations of the VESA EDID. CEA-861 signals carried by HDMI are electrically compatible with the CEA-861 signals used by the Digital Visual Interface (DVI). No signal conversion is necessary, nor is there a loss of video quality when a DVI-to-HDMI adapter is used. The Consumer Electronics Control (CEC) capability allows HDMI devices to control each other when necessary and allows the user to operate multiple devices with one handheld remote control device.
Several versions of HDMI have been developed and deployed since the initial release of the technology, occasionally introducing new connectors with smaller form factors, but all versions still use the same basic pinout and are compatible with all connector types and cables. Other than improved audio and video capacity, performance, resolution and color spaces, newer versions have optional advanced features such as 3D, Ethernet data connection, and CEC extensions.
Production of consumer HDMI products started in late 2003. In Europe, either DVI-HDCP or HDMI is included in the HD ready in-store labeling specification for TV sets for HDTV, formulated by EICTA with SES Astra in 2005. HDMI began to appear on consumer HDTVs in 2004 and camcorders and digital still cameras in 2006. , nearly 10 billion HDMI devices have been sold.
History
The HDMI founders were Hitachi, Panasonic, Philips, Silicon Image, Sony, Thomson, and Toshiba. Digital Content Protection, LLC provides HDCP (which was developed by Intel) for HDMI. HDMI has the support of motion picture producers Fox, Universal, Warner Bros. and Disney, along with system operators DirecTV, EchoStar (Dish Network) and CableLabs.
The HDMI founders began development on HDMI 1.0 on April 16, 2002, with the goal of creating an AV connector that was backward-compatible with DVI. At the time, DVI-HDCP (DVI with HDCP) and DVI-HDTV (DVI-HDCP using the CEA-861-B video standard) were being used on HDTVs. HDMI 1.0 was designed to improve on DVI-HDTV by using a smaller connector and adding audio capability and enhanced capability and consumer electronics control functions.
The first Authorized Testing Center (ATC), which tests HDMI products, was opened by Silicon Image on June 23, 2003, in California, United States. The first ATC in Japan was opened by Panasonic on May 1, 2004, in Osaka. The first ATC in Europe was opened by Philips on May 25, 2005, in Caen, France. The first ATC in China was opened by Sili |
https://en.wikipedia.org/wiki/LRN | LRN may refer to:
Laboratory Response Network, a collaborative effort of the U.S. Centers for Disease Control and Prevention and the Association of Public Health Laboratories
Land Rights News, the longest-running Aboriginal Australian newspaper, published by the Central and Northern Land Councils
Lateral reticular nucleus, a nucleus of the medulla oblongata involved with co-ordinating baroreceptor signals to control arterial blood pressure
Lead round nose, a type of bullet
Legislative route number, a designation for a highway defined by laws passed in a state legislature
Location Routing Number, a ten digit phone number used to route phone calls between two telephone exchanges
LORAN, a terrestrial radio navigation system originally known as LRN for Loomis Radio Navigation
LRN (company), an ethics compliance and education company
Luminous red nova, a stellar explosion thought to be caused by the merger of two stars |
https://en.wikipedia.org/wiki/Kane%20quantum%20computer | The Kane quantum computer is a proposal for a scalable quantum computer proposed by Bruce Kane in 1998, who was then at the University of New South Wales. Often thought of as a hybrid between quantum dot and nuclear magnetic resonance (NMR) quantum computers, the Kane computer is based on an array of individual phosphorus donor atoms embedded in a pure silicon lattice. Both the nuclear spins of the donors and the spins of the donor electrons participate in the computation.
Unlike many quantum computation schemes, the Kane quantum computer is in principle scalable to an arbitrary number of qubits. This is possible because qubits may be individually addressed by electrical means.
Description
The original proposal calls for phosphorus donors to be placed in an array with a spacing of 20 nm, approximately 20 nm below the surface. An insulating oxide layer is grown on top of the silicon. Metal A gates are deposited on the oxide above each donor, and J gates between adjacent donors.
The phosphorus donors are isotopically pure 31P, which have a nuclear spin of 1/2. The silicon substrate is isotopically pure 28Si which has nuclear spin 0. Using the nuclear spin of the P donors as a method to encode qubits has two major advantages. Firstly, the state has an extremely long decoherence time, perhaps on the order of 1018 seconds at millikelvin temperatures. Secondly, the qubits may be manipulated by applying an oscillating magnetic field, as in typical NMR proposals. By altering the voltage on the A gates, it should be possible to alter the Larmor frequency of individual donors. This allows them to be addressed individually, by bringing specific donors into resonance with the applied oscillating magnetic field.
Nuclear spins alone will not interact significantly with other nuclear spins 20 nm away. Nuclear spin is useful to perform single-qubit operations, but to make a quantum computer, two-qubit operations are also required. This is the role of electron spin in this design. Under A-gate control, the spin is transferred from the nucleus to the donor electron. Then, a potential is applied to the J gate, drawing adjacent donor electrons into a common region, greatly enhancing the interaction between the neighbouring spins. By controlling the J gate voltage, two-qubit operations are possible.
Kane's proposal for readout was to apply an electric field to encourage spin-dependent tunneling of an electron to transform two neutral donors to a D+–D– state, that is, one where two electrons associate with the same donor. The charge excess is then detected using a single-electron transistor. This method has two major difficulties. Firstly, the D– state has strong coupling with the environment and hence a short decoherence time. Secondly and perhaps more importantly, it's not clear that the D– state has a sufficiently long lifetime to allow for readout—the electron tunnels into the conduction band.
Development
Since Kane's proposal, under the guidance of Robert |
https://en.wikipedia.org/wiki/Las%20Vegas%20algorithm | In computing, a Las Vegas algorithm is a randomized algorithm that always gives correct results; that is, it always produces the correct result or it informs about the failure. However, the runtime of a Las Vegas algorithm differs depending on the input. The usual definition of a Las Vegas algorithm includes the restriction that the expected runtime be finite, where the expectation is carried out over the space of random information, or entropy, used in the algorithm. An alternative definition requires that a Las Vegas algorithm always terminates (is effective), but may output a symbol not part of the solution space to indicate failure in finding a solution. The nature of Las Vegas algorithms makes them suitable in situations where the number of possible solutions is limited, and where verifying the correctness of a candidate solution is relatively easy while finding a solution is complex.
Las Vegas algorithms are prominent in the field of artificial intelligence, and in other areas of computer science and operations research. In AI, stochastic local search (SLS) algorithms are considered to be of Las Vegas type. SLS algorithms have been used to address NP-complete decision problems and NP-hard combinatorial optimization problems. However, some systematic search methods, such as modern variants of the Davis–Putnam algorithm for propositional satisfiability (SAT), also utilize non-deterministic decisions, and can thus also be considered Las Vegas algorithms.
History
Las Vegas algorithms were introduced by László Babai in 1979, in the context of the graph isomorphism problem, as a dual to Monte Carlo algorithms. Babai introduced the term "Las Vegas algorithm" alongside an example involving coin flips: the algorithm depends on a series of independent coin flips, and there is a small chance of failure (no result). However, in contrast to Monte Carlo algorithms, the Las Vegas algorithm can guarantee the correctness of any reported result.
Example
// Las Vegas algorithm
repeat:
k = RandInt(n)
if A[k] == 1,
return k;
As mentioned above, Las Vegas algorithms always return correct results. The code above illustrates this property. A variable k is generated randomly; after k is generated, k is used to index the array A. If this index contains the value 1, then k is returned; otherwise, the algorithm repeats this process until it finds 1. Although this Las Vegas algorithm is guaranteed to find the correct answer, it does not have a fixed runtime; due to the randomization (in line 3 of the above code), it is possible for arbitrarily much time to elapse before the algorithm terminates.
Definition
This section provides the conditions that characterize an algorithm's being of Las Vegas type.
An algorithm A is a Las Vegas algorithm for problem class X, if
whenever for a given problem instance x∈X it returns a solution s, s is guaranteed to be a valid solution of x
on each given instance x, the run-time of A is a random variable RTA,x
T |
https://en.wikipedia.org/wiki/IBM%20hexadecimal%20floating-point | Hexadecimal floating point (now called HFP by IBM) is a format for encoding floating-point numbers first introduced on the IBM System/360 computers, and supported on subsequent machines based on that architecture, as well as machines which were intended to be application-compatible with System/360.
In comparison to IEEE 754 floating point, the HFP format has a longer significand, and a shorter exponent. All HFP formats have 7 bits of exponent with a bias of 64. The normalized range of representable numbers is from 16−65 to 1663 (approx. 5.39761 × 10−79 to 7.237005 × 1075).
The number is represented as the following formula: (−1)sign × 0.significand × 16exponent−64.
Single-precision 32-bit
A single-precision HFP number (called "short" by IBM) is stored in a 32-bit word:
{|
|- style="text-align:center"
|style="width:20px"|1
|style="width:20px"|
|style="width:50px"|7
|style="width:20px"|
|style="width:20px"|
|style="width:210px"|24
|style="width:20px"|
|style="text-align:left"|(width in bits)
|- style="text-align:center"
|colspan="1" style="text-align:center;background-color:#FC9"|S
|colspan="3" style="text-align:center;background-color:#99F"|Exp
|colspan="3" style="text-align:center;background-color:#9F9"|Fraction
|colspan="1" style="text-align:center;background-color:#FFF"|
|- style="text-align:center"
|31
|30
|...
|24
|23
|...
|0
|align="left"|(bit index)*
|-
|colspan="8"| * IBM documentation numbers the bits from left to right, so that the most significant bit is designated as bit number 0.
|}
In this format the initial bit is not suppressed, and the
radix (hexadecimal) point is set to the left of the significand (fraction in IBM documentation and the figures).
Since the base is 16, the exponent in this form is about twice as large as the equivalent in IEEE 754, in order to have similar exponent range in binary, 9 exponent bits would be required.
Example
Consider encoding the value −118.625 as an HFP single-precision floating-point value.
The value is negative, so the sign bit is 1.
The value 118.62510 in binary is 1110110.1012. This value is normalized by moving the radix point left four bits (one hexadecimal digit) at a time until the leftmost digit is zero, yielding 0.011101101012. The remaining rightmost digits are padded with zeros, yielding a 24-bit fraction of .0111 0110 1010 0000 0000 00002.
The normalized value moved the radix point two hexadecimal digits to the left, yielding a multiplier and exponent of 16+2. A bias of +64 is added to the exponent (+2), yielding +66, which is 100 00102.
Combining the sign, exponent plus bias, and normalized fraction produces this encoding:
{|
|- style="text-align:center"
|style="width:20px;text-align:center;background-color:#FC9"|S
|style="width:90px;text-align:center;background-color:#99F"|Exp
|style="width:250px;text-align:center;background-color:#9F9"|Fraction
|style="text-align:center;background-color:#FFF"|
|- style="text-align:center"
|style="text-align:center;background-color:#F |
https://en.wikipedia.org/wiki/Java%202D | Java 2D is an API for drawing two-dimensional graphics using the Java programming language. Every Java 2D drawing operation can ultimately be treated as filling a shape using a paint and compositing the result onto the screen.
Organization
The Java 2D API and its documentation are available for download as a part of JDK 6. Java 2D API classes are organised into the following packages in JDK 6:
The main package for the Java Abstract Window Toolkit.
The Java standard library of two dimensional geometric shapes such as lines, ellipses, and quadrilaterals.
The library for manipulating glyphs in Java.
The library dealing with the many different ways that color can be represented.
The library for manipulating graphical images.
The library of tools for writing to paper.
Basic concepts
These objects are a necessary part of every Java 2D drawing operation.
Shapes
A shape in Java 2D is a boundary which defines an inside and an outside. Pixels inside the shape are affected by the drawing operation, those outside are not.
Trying to fill a straight line segment will result in no pixels being affected, as such a shape does not contain any pixels itself. Instead, a thin rectangle must be used so that the shape contains some pixels.
Paints
A paint generates the colors to be used for each pixel of the fill operation. The simplest paint is , which generates the same color for all pixels. More complicated paints may produce gradients, images, or indeed any combination of colors. Filling a circular shape using the color yellow results in a solid yellow circle, while filling the same circular shape using a paint that generates an image produces a circular cutout of the image.
Composites
During any drawing operation, there is a source (the pixels being produced by the paint) and a destination (the pixels already onscreen). Normally, the source pixels simply overwrite the destination pixels, but the composite allows this behavior to be changed.
The composite, given the source and destination pixels, produces the final result that ultimately ends up onscreen. The most common composite is , which can treat the pixels being drawn as partially transparent, so that the destination pixels show through to some degree.
Filling
To fill a shape, the first step is to identify which pixels fall inside the shape. These pixels will be affected by the fill operation. Pixels that are partially inside and partially outside the shape may be affected to a lesser degree if anti-aliasing is enabled.
The paint is then asked to generate a color for each of the pixels to be painted. In the common case of a solid-color fill, each pixel will be set to the same color.
The composite takes the pixels generated by the paint and combines them with the pixels already onscreen to produce the final result.
Advanced objects
These objects can be viewed as performing their duties in terms of the simpler objects described above.
Transform
Every Java 2D operation is subject to a |
https://en.wikipedia.org/wiki/List%20of%20programs%20broadcast%20by%20E%21%20%28Canadian%20TV%20system%29 | This is a list of programs broadcast by CH / E!, a television system in Canada that operated from 2001 to 2009.
Fall 2008 schedule
In prime time, they carried some programming purchased from the American conventional broadcast networks, but otherwise aired a program schedule that was similar to the American E! network.
The last shows broadcast by E!
20/20
The Best Years
Dateline NBC
Deal or No Deal
Diva on a Dime
Doc
Extreme Makeover: Home Edition
Guiding Light
The Harley Show
How I Met Your Mother
The Insider
The Loop
Monday Night Football (broadcast time unknown)
My Boys
Psych
Running In Heels
Stargate SG-1
Talkshow with Spike Feresten
WWE Friday Night SmackDown (Montreal only)
Formerly broadcast
60 Minutes (2001-2007)
24
10 Items or Less
Creature Comforts
Dark Angel (2001)
Century City (2004)
Crossing Jordan
Help Me Help You
The King of Queens
Las Vegas
Leap of Faith (2002)
NCIS (moved to Global)
One Tree Hill
K-Ville (2007)
Raines (2007)
Ramona
Stacked
Surface (2005-2006)
Touched by an Angel
Technical Knockout
Two and a Half Men (2003-2007)
Viva Laughlin - cancelled
The Guardian
Came into 2008-2009 season
24
Boston Legal
Do Not Disturb
Knight Rider
My Name is Earl
Secret Millionaire
Worst Week
See also
List of Canadian television series
E! Canada
E |
https://en.wikipedia.org/wiki/I2P | The Invisible Internet Project (I2P) is an anonymous network layer (implemented as a mix network) that allows for censorship-resistant, peer-to-peer communication. Anonymous connections are achieved by encrypting the user's traffic (by using end-to-end encryption), and sending it through a volunteer-run network of roughly 55,000 computers distributed around the world. Given the high number of possible paths the traffic can transit, a third party watching a full connection is unlikely. The software that implements this layer is called an "I2P router", and a computer running I2P is called an "I2P node". I2P is free and open sourced, and is published under multiple licenses.
Technical design
I2P has been beta software since it started in 2003 as a fork of Freenet. The software's developers emphasize that bugs are likely to occur in the beta version and that peer review has been insufficient to date. However, they believe the code is now reasonably stable and well-developed, and more exposure can help the development of I2P.
The network is strictly message-based, like IP, but a library is available to allow reliable streaming communication on top of it (similar to Non-blocking IO-based TCP, although from version 0.6, a new Secure Semi-reliable UDP transport is used). All communication is end-to-end encrypted (in total, four layers of encryption are used when sending a message) through garlic routing, and even the end points ("destinations") are cryptographic identifiers (essentially a pair of public keys), so that neither senders nor recipients of messages need to reveal their IP address to the other side or to third-party observers.
Although many developers had been a part of the Invisible IRC Project (IIP) and Freenet communities, significant differences exist between their designs and concepts. IIP was an anonymous centralized IRC server. Freenet is a censorship-resistant distributed data store. I2P is an anonymous peer-to-peer distributed communication layer designed to run any traditional internet service (e.g. Usenet, email, IRC, file sharing, Web hosting and HTTP, or Telnet), as well as more traditional distributed applications (e.g. a distributed data store, a web proxy network using Squid, or DNS).
Many developers of I2P are known only under pseudonyms. While the previous main developer, jrandom, is currently on hiatus, others, such as zzz, killyourtv, and Complication have continued to lead development efforts, and are assisted by numerous contributors.
I2P uses 2048bit ElGamal/AES256/SHA256+Session Tags encryption and Ed25519 EdDSA/ECDSA signatures.
Releases
I2P has had a stable release every six to eight weeks. Updates are distributed via I2P torrents and are signed by the release manager (generally zzz or str4d).
Funding
On the website it states, that "funding for I2P comes entirely from donations". Admins and managers of the project said, that "the core project itself doesn't take donations". These should instead |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Alaska | The following is a list of FCC-licensed radio stations in the U.S. state of Alaska, which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
Defunct stations
KABN-FM Kasilof
KAKQ Fairbanks
KALA Sitka
KAMP-LP St. Michael
KANC Anchorage
KAQU-LP Sitka
KAUG Anchorage
KCDS Deadhorse
KCKC Long Island
KGBU Ketchikan
KGVC Glacier View
KHGO Homer
KHOH Seldovia
KHZK Kotzebue
KIAL Unalaska
KJFP Yakutat
KMJG Homer
KOGB McGrath
KRAW Sterling
KRSA Petersburg
KSEW Seward
KSVJ Seward
KUWL Fairbanks
KVBV-LP Anchorage
KVIM-LP Juneau
KVOK Kodiak
KWJG Kasilof
KWMD Kasilof
KZXX Kenai
References
Radio stations
Alaska |
https://en.wikipedia.org/wiki/Today%27s%20Best%20Hits | Today's Best Hits was an American radio network with a Hot Adult Contemporary format. It played many contemporary songs. It also featured many retro (1980s) hits, and on Saturday night, it played only requested retro songs. The network was previously known as Best Hits, Best Variety. Today's Best Hits was a property of Cumulus Media Networks (now Westwood One).
"Retro Radio", the first nationwide radio broadcast devoted solely to music from the 1980s, was launched on Saturday nights in 1997. The show was created and hosted by Thom "Booray" Daniels until 2000. The format was dissolved as Cumulus Media Networks merged with Westwood One, as there was already a "Hot AC" satellite-fed format provided by that network.
Sample hour of programming
"1999" - Prince
"Hey There Delilah" - Plain White T's
"The Impression That I Get" - The Mighty Mighty Bosstones
"Wake Up Call" - Maroon 5
"Run-Around" - Blues Traveler
"Never Again" - Kelly Clarkson
"Rockstar" - Nickelback
"Bad Day" - Daniel Powter
"Waiting on the World to Change" - John Mayer
"Her Diamonds" - Rob Thomas
"Bleeding Love" - Leona Lewis
"All Summer Long" - Kid Rock
"If It Makes You Happy" - Sheryl Crow
On-air personalities before closure
Race Taylor
Former on-air personalities
Kidd Kraddick
Barry Michaels
Susan Huber
Sources
Westwood One
Hot adult contemporary radio stations in the United States
Westwood One
Defunct radio networks in the United States
Radio stations disestablished in 2014
Defunct radio stations in the United States |
https://en.wikipedia.org/wiki/List%20of%20programs%20broadcast%20by%20CBC%20Television | This is a list of programs broadcast by CBC Television, including current and former programming as well as soon-to-be-broadcast programming.
Current programming
Anthology series
Canadian Reflections (June 10, 1978 – present)
q (June 11, 2013 – present)
The Filmmakers (July 22, 2017 – present)
Hot Docs at Home (April 2020 – present)
Movie Night in Canada (March 14, 2020 – present)
Undisrupted (2021)
Comedy series
Just for Laughs (July 14, 1983 – present)
This Hour Has 22 Minutes (October 11, 1993 – present)
Broad Appeal: Living with E's (2020–present)
Humour Resources (January 5, 2021 – present)
Overlord and the Underwoods (October 29, 2021 – present)
Sort Of (November 9, 2021 – present)
Son of a Critch (January 4, 2022 – present)
Run the Burbs (January 5, 2022 – present)
Fakes (September 1, 2022)
Drama series
Heartland (October 14, 2007 – present)
Murdoch Mysteries (January 20, 2008 – present)
Coroner (January 7, 2019 – present)
Moonshine (September 14, 2021 – present)
Plan B (2023-present)
The Porter (February 2022 − present)
SkyMed (July 10, 2022 – present)
Reality series and game show
Dragons' Den (October 3, 2006 – present)
Battle of the Blades (October 4, 2009 – November 17, 2013; September 19, 2019 – present)
Still Standing (June 23, 2015 – present)
The Great Canadian Baking Show (November 1, 2017 – present)
You Can't Ask That (2019–present)
Family Feud Canada (December 16, 2019 – present)
Fridge Wars (February 27, 2020 – present)
Race Against the Tide (premiering 2021)
Stay Tooned (2022)
Canada's Ultimate Challenge (2023)
News/documentary programming
Regional newscasts
CBC News: Morning
The National (1954–present)
The Nature of Things (1960–present)
Land and Sea (1964–present)
Marketplace (October 5, 1972 – present)
The Fifth Estate (1975–present)
The Passionate Eye (1993–present)
Absolutely Canadian (2009–present)
CBC Docs POV (2015–present)
Exhibitionists (2015–present)
Rosemary Barton Live (2020–present)
Good People (2020–present)
Anyone's Game (January 15, 2021 – present)
Sports programming (CBC Sports)
Hockey Night in Canada (1952–present; formerly in production until 2014; now produced by Rogers Media)
Olympics on CBC (1956–present), which includes:
Summer Olympics
Winter Olympics
Children's programming (CBC Kids)
International programming
Coronation Street (May 31, 1971 – present)
Escape to the Country (2014–present)
Bondi Vet (2015–present)
Grand Designs (2015–present)
When Calls the Heart (2015–present)
The Great British Bake Off (2018–present)
Call the Midwife (2020–present)
Jamie's 30-Minute Meals (2020–present)
Miss Scarlet and The Duke (March 31, 2020 – present)
Repeats
Mr. D (January 9, 2012 – December 19, 2018)
Nirvanna the Band the Show
Schitt's Creek (2015–2020)
Workin' Moms
Upcoming programming
Drama
The Red (premiering 2023)
In development
Late Bloomer
One More Time
Formerly broadcast by CBC Television
Domestically-produced programming
1 |
https://en.wikipedia.org/wiki/Lynda%20Weinman | Lynda Susan Weinman (born January 24, 1955) is an American business owner, computer instructor, and author, who founded an online software training website, lynda.com, with her husband, Bruce Heavin. Lynda.com was acquired by online business network LinkedIn in April 2015 for $1.5 billion (~$ in ).
Weinman, with self-taught computer skills, worked in the film industry as a special effects animator, and became a faculty member at ArtCenter College of Design, UCLA, American Film Institute, and San Francisco State University multimedia studies program teaching computer graphics, animation, interactive design, and motion graphics. She has also written several books.
Education
Weinman graduated with a degree in humanities from The Evergreen State College in Olympia, Washington in 1976.
Career
A year after graduating, Weinman opened two retail stores, Vertigo on Melrose and Vertigo on Sunset in Los Angeles. They closed in 1982.
Weinman worked for Dreamquest and as an independent contractor doing animation and special effects. She worked on several films, including RoboCop 2 (1990), Bill & Ted's Excellent Adventure (1989), and Star Trek V: The Final Frontier (1989).
Weinman attributes her initial interest in computers to her having taught herself how to use an Apple II. She acquired these skills by reading the manual.
Weinman taught digital media and motion graphics at Art Center College of Design in Pasadena, California from 1989 to 1996. Her book designing web graphics, published by New Riders in 1995, often is credited with being the first title to discuss web authoring technologies from a visual design perspective.
Weinman was co-founder with her husband, Bruce Heavin, of the Ojai Digital Arts Center in Ojai, California in 1999.
Lynda.com
The Lynda.com Online Training Library taught computer skills in video format to members through monthly and annual subscription-based plans. The company was founded in Ojai, California and has since moved to Ventura and Carpinteria, California, where, as of 2013, it employed nearly 500 full-time staff members and more than 140 teachers who earn royalties from their shared revenue model. The company website was created in 1995 and the company was incorporated in 1997.
Lynda.com evolved from its original conception as a free web resource for Lynda's students, to the site for her books on web design, to the registration hub for physical classrooms and conferences, to an online virtual knowledge library, where members could watch software and technology courses in several categories (3D and animation, audio, business, design, development, home computing, photography, video, and web and interactive design). The company also produced documentaries about creative professionals.
The company received $103 million (~$ in ) in venture capital funding in January 2013, led by Accel Partners and Spectrum Equity. On January 14, 2015, lynda.com announced it had raised $186 million (~$ in ) in financing, led by investm |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.