source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/TVS%20Television%20Network | The Television Sports Television Network, or TVS Television Network for short (commonly referred to as just TVS), was a syndicator of American sports programming. It was one of several "occasional" national television networks that sprang up in the early-to-mid-1960s to take advantage of the establishment of independent (mostly UHF) television stations and relaxation of the AT&T Long Lines usage rates.
History
Eddie Einhorn had begun broadcasting radio coverage of college basketball and built a network of radio stations that covered the NCAA Division I men's basketball tournament games. He later moved into television coverage of college basketball games.
College basketball
Founded by Einhorn in 1968, and operated through TVS, Inc., the network originally telecast college basketball games to regional networks at a time when the sport was of no interest to the national networks. Taking advantage of intense regional collegiate rivalries, the network blossomed in the 1960s and developed into a full service sports network. Einhorn proceeded to put together a Saturday afternoon TVS "game of the week" concept that often featured some of the major midwestern independent teams such as Marquette, DePaul, and Notre Dame. These games were widely syndicated at least in the east and midwest.
On January 20, 1968, TVS put together the "Game of the Century" (see below) between the UCLA Bruins and Houston Cougars basketball teams at the Houston Astrodome. This was the game that made college basketball a television broadcast commodity. Six years later (January 26, 1974), TVS televised another historic basketball game as the Bruins fell to Notre Dame, 71-70, breaking the Bruins' 88-game winning streak. TVS proceeded to syndicate a few games nationally each year, often involving UCLA in the middle of their run of 10 national championships in a 12-year span. TVS often used late night time slots for its nationally syndicated games which were played on the west coast.
In addition to these individual games, TVS was a pioneer in bringing college basketball to a national scope-first by their own efforts in the early 1970s, primarily with Dick Enberg and Rod Hundley (sometimes Enberg and Hundley would call a Pac-8 game on a Friday night, fly to the midwest for the TVS game of the week on Saturday afternoon, and then head back to the west coast to call a Pac-8 game on Saturday night), then in 1975, teaming with NBC Sports in a cooperative effort to regionalize NBC's coverage on Saturday afternoons (NBC/local talent, TVS production crews). This partnership lasted through 1983, though it was hampered in later years by NBC losing the rights to the NCAA Division I Men's College Basketball Tournament to CBS Sports in 1982. After the NBC partnership ended and college sports telecasts underwent a court-ordered decentralization in 1984, TVS went back to regionalizing games on their own—a forerunner to the regionalization often seen today.
Besides Dick Enberg and Rod Hundley |
https://en.wikipedia.org/wiki/Chatbot%20%28disambiguation%29 | A chatbot is a computer program designed to simulate an intelligent conversation.
Chatbot may also refer to:
ChatBot, a platform for designing bots sold by Livechat Software
IRC bot, an automated program on Internet Relay Chat
See also
Turing test
Dialog system
Interactive online characters |
https://en.wikipedia.org/wiki/Coding%20theory | Coding theory is the study of the properties of codes and their respective fitness for specific applications. Codes are used for data compression, cryptography, error detection and correction, data transmission and data storage. Codes are studied by various scientific disciplines—such as information theory, electrical engineering, mathematics, linguistics, and computer science—for the purpose of designing efficient and reliable data transmission methods. This typically involves the removal of redundancy and the correction or detection of errors in the transmitted data.
There are four types of coding:
Data compression (or source coding)
Error control (or channel coding)
Cryptographic coding
Line coding
Data compression attempts to remove unwanted redundancy from the data from a source in order to transmit it more efficiently. For example, ZIP data compression makes data files smaller, for purposes such as to reduce Internet traffic. Data compression and error correction may be studied in combination.
Error correction adds useful redundancy to the data from a source to make the transmission more robust to disturbances present on the transmission channel. The ordinary user may not be aware of many applications using error correction. A typical music compact disc (CD) uses the Reed–Solomon code to correct for scratches and dust. In this application the transmission channel is the CD itself. Cell phones also use coding techniques to correct for the fading and noise of high frequency radio transmission. Data modems, telephone transmissions, and the NASA Deep Space Network all employ channel coding techniques to get the bits through, for example the turbo code and LDPC codes.
History of coding theory
In 1948, Claude Shannon published "A Mathematical Theory of Communication", an article in two parts in the July and October issues of the Bell System Technical Journal. This work focuses on the problem of how best to encode the information a sender wants to transmit. In this fundamental work he used tools in probability theory, developed by Norbert Wiener, which were in their nascent stages of being applied to communication theory at that time. Shannon developed information entropy as a measure for the uncertainty in a message while essentially inventing the field of information theory.
The binary Golay code was developed in 1949. It is an error-correcting code capable of correcting up to three errors in each 24-bit word, and detecting a fourth.
Richard Hamming won the Turing Award in 1968 for his work at Bell Labs in numerical methods, automatic coding systems, and error-detecting and error-correcting codes. He invented the concepts known as Hamming codes, Hamming windows, Hamming numbers, and Hamming distance.
In 1972, Nasir Ahmed proposed the discrete cosine transform (DCT), which he developed with T. Natarajan and K. R. Rao in 1973. The DCT is the most widely used lossy compression algorithm, the basis for multimedia formats such as JPEG, M |
https://en.wikipedia.org/wiki/Tracking | Tracking may refer to:
Science and technology
Computing
Tracking, in computer graphics, in match moving (insertion of graphics into footage)
Tracking, composing music with music tracker software
Eye tracking, measuring the position of the eye relative to the head
Finger tracking, measuring the positions of the fingers
Optical motion tracking, or motion capture, recording the precise movements of objects or people
Position tracking, monitoring the location of a mechanical system in real-time by counting pulses; see
Positional tracking, an essential component of augmented reality
Video tracking, locating an object in each frame of a video sequence
Mobile phone tracking, monitoring the physical location of a mobile phone
Internet tracking, analyzing online activity
Web visitor tracking, the analysis of visitor behavior on a website
Sleep tracking, monitoring sleeping experience (deep, REM, duration etc.)
Life sciences
Animal migration tracking, performed by attaching a tag to an animal
Tracking (hunting), to learn about the ecology of an area
Environmental tracking, a concept developed by the Environmental Investment Organisation to monitor climate change
Logistics
Tracking (commercial airline flight), the means of tracking civil airline flights in real time
Package tracking, or package logging, the process of localizing shipping containers, mail and parcel post
Track and trace, a process of determining the current and past locations and other status of property in transit
Asset tracking, which provides status of objects of an inventory or mobile stock
Vehicle tracking system uses GPS to find out about movement and/or location of cars, trucks, and/or other vehicles
Other uses in science and technology
Tracking (particle physics), measuring the direction and magnitude of the momenta of charged particles
Tracking, a process of degradation in which tree-like carbonized patterns (electrical treeing) appear on an insulator
Tracking or Toe (automotive), the symmetric angle that each wheel makes with the long axis of a vehicle
Video tape tracking, alignment of the magnetic tape of a video recorder with the read head
Tracking, combining individual radar detections with a radar tracker
Tracking system, various methods used to monitor moving persons or objects, often remotely
Tracking transmitter, a device that broadcasts a radio signal that can be detected by a directional antenna
Target and missile tracking, elements of Go-Onto-Target systems in missile guidance
Tracking is also used, euphemistically, for surveillance or mass surveillance
Multitrack recording, a term commonly shortened to "tracking"
Arts and entertainment
Tracking (documentary), a 1994 documentary about the band Phish
Tracking (novel), a three-part work by David R. Palmer
Tracking shot, a filming technique also known as a dolly shot
Sports
Tracking (dog), the act of a dog following a scent trail
Tracking (freeflying), in skydiving, the techn |
https://en.wikipedia.org/wiki/Chord%20%28peer-to-peer%29 | In computing, Chord is a protocol and algorithm for a peer-to-peer distributed hash table. A distributed hash table stores key-value pairs by assigning keys to different computers (known as "nodes"); a node will store the values for all the keys for which it is responsible. Chord specifies how keys are assigned to nodes, and how a node can discover the value for a given key by first locating the node responsible for that key.
Chord is one of the four original distributed hash table protocols, along with CAN, Tapestry, and Pastry. It was introduced in 2001 by Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan, and was developed at MIT. The 2001 Chord paper won an ACM SIGCOMM Test of Time award in 2011.
Subsequent research by Pamela Zave has shown that the original Chord algorithm (as specified in the 2001 SIGCOMM paper, the 2001 Technical report,
the 2002 PODC paper, and
the 2003 TON paper
) can mis-order the ring, produce several rings, and break the ring.
Overview
Nodes and keys are assigned an -bit identifier using consistent hashing. The SHA-1 algorithm is the base hashing function for consistent hashing. Consistent hashing is integral to the robustness and performance of Chord because both keys and nodes (in fact, their IP addresses) are uniformly distributed in the same identifier space with a negligible possibility of collision. Thus, it also allows nodes to join and leave the network without disruption. In the protocol, the term node is used to refer to both a node itself and its identifier (ID) without ambiguity. So is the term key.
Using the Chord lookup protocol, nodes and keys are arranged in an identifier circle that has at most nodes, ranging from to . ( should be large enough to avoid collision.) Some of these nodes will map to machines or keys while others (most) will be empty.
Each node has a successor and a predecessor. The successor to a node is the next node in the identifier circle in a clockwise direction. The predecessor is counter-clockwise. If there is a node for each possible ID, the successor of node 0 is node 1, and the predecessor of node 0 is node ; however, normally there are "holes" in the sequence. For example, the successor of node 153 may be node 167 (and nodes from 154 to 166 do not exist); in this case, the predecessor of node 167 will be node 153.
The concept of successor can be used for keys as well. The successor node of a key is the first node whose ID equals to or follows in the identifier circle, denoted by . Every key is assigned to (stored at) its successor node, so looking up a key is to query .
Since the successor (or predecessor) of a node may disappear from the network (because of failure or departure), each node records an arc of nodes in the middle of which it stands, i.e., the list of nodes preceding it and nodes following it. This list results in a high probability that a node is able to correctly locate its successor or predecessor, even if the netw |
https://en.wikipedia.org/wiki/TG | TG or Tg may stand for:
Arts and entertainment
Gaming
The Gathering (computer party), the second largest computer party in the world
Travian Games, a German video game development and publisher company
Television
Telegiornale (disambiguation), the Italian word for television newscast
Top Gear, a British motoring television series
Top Gear (1977 TV series), original version running from 1977 to 2001
Top Gear (2002 TV series), revived version running since 2002
Windows TG, a fictional operating system featured in the show Mega64
Other media
Throbbing Gristle, an English music and visual arts group formed in 1976
Ferdinand Tönnies Gesamtausgabe, the complete work edition of Ferdinand Tönnies
Businesses and organizations
TG Xers, a team in the Korean Basketball League, now renamed Wonju Dongbu Promy
Thai Airways International (IATA code TG)
Theodore Goddard, a law firm established by John Theodore Goddard, solicitor to Wallis Simpson
ThinkGeek, an internet retailer
Torture Garden (fetish club), the fetish club organizers
Toyota Group, auto manufacturer
TransDigm Group, a manufacturer of aerospace components
Travian Games, a German video game company
Triumph Group, an aftermarket repair company in Wayne, Pennsylvania, US
Tigera Group, a software publisher and holding company formerly known as Fortune Systems
People
Thomas Hopkins Gallaudet, founder of Gallaudet University
Timo Glock, Formula 1 driver for Virgin Racing
Places
Talbot Gardens, a hockey arena in Norfolk County, Ontario, Canada
Târgu-Mureş, a Romanian city
Tehri Garhwal district, a district in the state of Uttarakhand, India
Telangana, a state in southern India
Thurgau, a canton in Switzerland
Togo (ISO 3166-1 country code TG)
Science, technology, and mathematics
Biology and medicine
Thapsigargin, a sesquiterpene lactone and tumor promoter
Thyroglobulin, a protein
Transgenic, referring to genetic material that has been transferred from one organism to another
Triglyceride, the main constituents of body fat in humans and animals
Trigeminal nerve, one of the cranial nerves.
Computing
.tg, the country code top level domain (ccTLD) for Togo
Telegram (software), online messaging service
Terragen, a scenery rendering software
TriGem, a South Korean computer company
Turbo Gears, a Python web application framework
Mathematics
Tangent, a trigonometric function
Tarski–Grothendieck set theory, an axiomatic set theory
Vehicles
Messerschmitt TG500, a four-wheeled car designed by German engineer Fritz Fend based on his three-wheeled Messerschmitt KR200 microcar
Tank Grote (sometimes misspelled "Grotte"), an experimental multi-turreted Soviet medium tank
Tiangong space station, a Chinese space station
Other uses in science and technology
Tear gas, a riot control agent
Teragram, a unit of mass equal to 1012 grams; equivalent to a megatonne
Thermogravimetry, a branch of physical chemistry, materials research, and thermal analysis
Transformational |
https://en.wikipedia.org/wiki/Economic%20data | Economic data are data describing an actual economy, past or present. These are typically found in time-series form, that is, covering more than one time period (say the monthly unemployment rate for the last five years) or in cross-sectional data in one time period (say for consumption and income levels for sample households). Data may also be collected from surveys of for example individuals and firms or aggregated to sectors and industries of a single economy or for the international economy. A collection of such data in table form comprises a data set.
Methodological economic and statistical elements of the subject include measurement, collection, analysis, and publication of data. 'Economic statistics' may also refer to a subtopic of official statistics produced by official organizations (e.g. statistical institutes, intergovernmental organizations such as United Nations, European Union or OECD, central banks, ministries, etc.). Economic data provide an empirical basis for economic research, whether descriptive or econometric. Data archives are also a key input for assessing the replicability of empirical findings and for use in decision making as to economic policy.
At the level of an economy, many data are organized and compiled according to the methodology of national accounting. Such data include Gross National Product and its components, Gross National Expenditure, Gross National Income in the National Income and Product Accounts, and also the capital stock and national wealth. In these examples data may be stated in nominal or real values, that is, in money or inflation-adjusted terms. Other economic indicators include a variety of alternative measures of output, orders, trade, the labor force, confidence, prices, and financial series (e.g., money and interest rates). At the international level there are many series including international trade, international financial flows, direct investment flows (between countries) and exchange rates.
For time-series data, reported measurements can be hourly (e.g. for stock markets), daily, monthly, quarterly, or annually. Estimates such as averages are often subjected to seasonal adjustment to remove weekly or seasonal-periodicity elements, for example, holiday-period sales and seasonal unemployment.
Within a country the data are usually produced by one or more statistical organizations, e.g., a governmental or quasi-governmental organization and/or the central banks. International statistics are produced by several international bodies and firms, including the International Monetary Fund and the Bank for International Settlements.
Studies in experimental economics may also generate data, rather than using data collected for other purposes. Designed randomized experiments may provide more reliable conclusions than do observational studies. Like epidemiology, economics often studies the behavior of humans over periods too long to allow completely controlled experiments, in which case econo |
https://en.wikipedia.org/wiki/Don%20Ohlmeyer | Donald Winfred Ohlmeyer Jr. (February 3, 1945September 10, 2017) was an American television producer and president of the NBC network's west coast division. He received notoriety for firing Norm Macdonald from Saturday Night Live in early 1998, a move that is widely believed to have been motivated by Macdonald's refusal to stop making jokes at the expense of Ohlmeyer's friend, O.J. Simpson.
Ohlmeyer also directed the Olympics and other live sporting events while working for ABC and ESPN. He was a professor of television communications at Pepperdine University in Malibu, California.
Early life
Born in New Orleans, Louisiana, Ohlmeyer grew up in the Chicago area and attended Glenbrook North High School. He graduated from the University of Notre Dame in 1967.
Career
ABC Sports
Ohlmeyer began his career with ABC Sports. A disciple of Roone Arledge, he worked on Wide World of Sports, was the first hired producer of Monday Night Football, brought Superstars to television, and also produced and directed three Olympics broadcasts (including the Munich Olympics).
NBC Sports
Ohlmeyer later moved to NBC as executive producer of the network's sports division, a position he held from 1977 to 1982. Over those five years, he created the popular sports anthology series SportsWorld and served as Executive Producer of NBC coverage of the Super Bowl and World Series. He also earned notoriety for the prime-time series Games People Play and the made-for-television movie The Golden Moment: An Olympic Love Story. Ohlmeyer became well known for expanding the network's sports coverage as well as introducing innovative production techniques. He launched NFL Updates, NCAA Basketball 'Whip-arounds,' and instituted NBC's live coverage of Breakfast at Wimbledon. Ohlmeyer is credited with conceiving the one-time experiment of airing a 1980 NFL telecast without announcers.
Ohlmeyer Communications Company
Ohlmeyer formed his own production company, Ohlmeyer Communications Company (OCC), in 1982. While there he produced several made-for-television movies, network series, and specials. He won an Emmy for Special Bulletin, a harrowing 1983 depiction of nuclear terrorism. His company was also responsible for producing CART IndyCar World Series race telecasts, and golf, including PGA Tour events, "The Skins Game", and Senior PGA TOUR broadcasts. While at OCC, Ohlmeyer also oversaw Nabisco's 20% stake in ESPN. Ohlmeyer also gained a 49% controlling interest in Hockey Night in Canada starting in 1986, taking over the Canadian Sports Network that ran the program under the MacLaren Advertising agency.
He later sold his interest to Molstar Communications, the company which already possessed the other 51%.
Return to NBC
Ohlmeyer returned to NBC in 1993 to become president of its West Coast division at a time when the network was in third place in the ratings, following the conclusion of popular shows such as Cheers and The Cosby Show. During his tenure, NBC returned to first place w |
https://en.wikipedia.org/wiki/PenPoint%20OS | The PenPoint OS was a product of GO Corporation and was one of the earliest operating systems written specifically for graphical tablets and personal digital assistants. It ran on AT&T Corporation's EO Personal Communicator as well as a number of Intel x86 powered tablet PCs including IBM's ThinkPad 700T series, NCR's 3125, 3130 and some of GRiD Systems' pen-based portables. It was never widely adopted.
Developers of the PenPoint OS included Robert Carr, who was involved with the Alto computer at Xerox PARC. He commissioned Dr. Tinker, the naming service company of Mark Beaulieu who generated the name 'PenPoint', using proprietary algorithms.
Awards and innovation
Byte magazine awarded PenPoint best Operating System in the 1992 Byte Awards. PenPoint won in the Standards and Operating Systems category in PC Magazine's 1991 Technical Excellence awards.
The PenPoint operating system had novel early implementations of several computing advances, including:
a large set of gestures such as circle to edit, X to delete, and caret to insert
using the same gestures at all levels of the operating system and applications
press and hold for moving any selection, which showed the selection as a floating icon to be dropped into a destination
a rich notebook user interface metaphor: Documents existed as pages in a notebook with tabs (this was not new in PenPoint, but PenPoint was the first to make it a primary OS interface; Microsoft later did it in Windows for Pen Computing)
a document architecture where each document was a directory nested in another document's directory (in some sense, this was an extension of the document architecture on Multics)
dynamic toolkit layout: this allowed applications to rescale for landscape and portrait orientation
a system-wide pluggable address book
In April 2008, as part of a larger federal court case, the gesture features of the Windows/Tablet PC operating system and hardware were found to infringe on a patent by GO Corp. concerning user interfaces for the PenPoint OS.
Third-party applications
The novel user interface of PenPoint and the mobile form factor of pen computers inspired many startup software companies, including:
Inkwriter by Aha! Software which was purchased by Microsoft and became the basis for Microsoft's Windows Journal
FutureWave Software (SmartSketch, a vector-drawing program that evolved into Adobe Flash)
Glyphic Technology (Glyphic Script prototype-based programming language, with Codeworks direct interactive programming environment)
PenMagic (Numero spreadsheet and LetterExpress document fill-in templates)
Pensoft (Perspective personal data manager, winner of a BYTE award in 1992). Pensoft was acquired by Eo.
Slate (several pen applications). Slate's founders included industry luminaries Dan Bricklin and Bob Frankston.
Gaia Software (Personal Media personal productivity applications)
Conic Systems (LocatorGIS survey/mapping application that briefly went into production at Ordnanc |
https://en.wikipedia.org/wiki/GO%20Corporation | GO Corporation was founded in 1987 to create portable computers, an operating system, and software with a pen-based user interface. It was famous not only for its pioneering work in Pen-based computing but as well as being one of the most well-funded start-up companies of its time.
Its founders were Jerry Kaplan, Robert Carr, and Kevin Doren. Mr. Kaplan subsequently chronicled the history of the company in his book Startup: A Silicon Valley Adventure. Omid Kordestani, former Senior VP of Global Business at Google, began his startup career with GO Corporation. Other notable GO alumni include CEO Bill Campbell (who later became chairman of Intuit), VP Sales Stratton Sclavos (took VeriSign public as its CEO), CFO and VP of Business Operations Randy Komisar (became CEO of LucasArts), and VP Marketing Mike Homer (was VP Marketing at time of Netscape's IPO in 1995).
History
Though the company enjoyed high levels of public awareness and generally positive attention from industry press, it ran into fierce competition, first from Microsoft (whose Pen Services for Windows were later the subject of an FTC investigation and patent violation suits by GO), and later from Apple's Newton project, and others. The company lined up software development partners but struggled to deliver hardware and software on their intended schedule. In 1991, they spun off their hardware unit under the name EO Inc., and in 1993 EO was acquired by AT&T Corporation, who hoped that its devices would showcase their AT&T Hobbit microprocessors. This sale raised much-needed cash but introduced new problems, as EO then ceased to coordinate well with GO's management, even considering adopting competing operating systems. Facing a cash crisis, GO agreed to sell itself to AT&T as well, bringing the two halves of the company back under one roof as of January 1994.
GO's PenPoint OS ran on AT&T's EO Personal Communicator and computers from IBM and others, but despite some success in vertical markets, consumers in the 1990s did not adopt tablet computing as enthusiastically as GO management had expected. (GO produced a 286-based lightweight "Go Computer" specifically for developers and evaluators; the company emphasis was that end users would run PenPoint OS on third-party hardware.) In January 1994, only two weeks after acquiring GO, AT&T decided to cancel the Hobbit product line, leaving it no reason to continue to support EO or GO. They had by then ceased to develop for other chips, and sales on the other platforms were small anyway. Co-founder Jerry Kaplan says that in its lifetime, the company generated "no meaningful sales". The loss of AT&T's support left GO with little chance of future revenue and, after burning through $75 million of venture funding, the company closed in July 1994.
Lawsuits
On 29 June 2005, Kaplan filed an antitrust lawsuit against Microsoft, alleging that Microsoft technicians had stolen technology from GO that had been shown to them under a non-disclosure agreem |
https://en.wikipedia.org/wiki/Cabinet%20%28file%20format%29 | Cabinet (or CAB) is an archive-file format for Microsoft Windows that supports lossless data compression and embedded digital certificates used for maintaining archive integrity. Cabinet files have .cab filename extensions and are recognized by their first four bytes (also called their magic number) MSCF. Cabinet files were known originally as Diamond files.
Design
A CAB archive can contain up to 65,535 folders (distinct to standard operating system directories), each of which can contain up to 65,535 files for a maximum of 4,294,836,225. Internally, each folder is treated as a single compressed block, which provides more efficient compression than individually compressing each file.
Every entry in a folder has to be a file. Due to this structure, it is not possible to store empty folders in CAB archives.
The following shows an example a CAB file structure, demonstrating the relationship between folders and files:
CAB file
First folder
Second folder
How paths should be handled is not specified in the CAB file format, leaving it to the software implementation:
Some affix file paths to filenames only, as if all files in a CAB archive are in a single folder. IExpress works this way, as does Microsoft Windows Explorer, which can open CAB archives as a folder.
Some can store the paths, and upon extraction, create folders as necessary. and (tools from Microsoft Cabinet SDK) as well as and (third-party open-source tools) work this way.
, only since version 6 (which is included from Windows Vista to above) can extract files to their paths. The previous versions don't do it.
The CAB file format may employ the following compression algorithms:
DEFLATE: invented by Phil Katz, the author of the ZIP file format (specifically, the MSZIP encapsulation)
Quantum compression: licensed from David Stafford, the author of the Quantum archiver (not available in all versions of makecab.exe/diamond.exe)
LZX: invented by Jonathan Forbes and Tomi Poutanen, given to Microsoft when Forbes joined the company
NULL: stored
A CAB archive can reserve empty spaces in the archive as well as for each file in the archive, for some application-specific uses like digital signatures or arbitrary data.
Implementations
Microsoft Windows supports creating CAB archive files using the makecab command-line utility. It supports extracting the contents of a CAB archive files using File Explorer, Setup API, and using the command-line commands expand.exe, extract.exe and extrac32.exe.
Other well-known software with CAB archive support includes WinZip, WinRAR or 7-Zip. The aforementioned cabextract is a common tool for Linux systems, but is only capable of extracting archives. The gcab tool however can both extract and create CAB archives. For a full list, see .
Uses
A variety of Microsoft installation technologies use the CAB format: these include Windows Installer, Setup API, Device Installer, Theme Pack and AdvPack (used by Internet Explorer to install A |
https://en.wikipedia.org/wiki/Epigrams%20on%20Programming | "Epigrams on Programming" is an article by Alan Perlis published in 1982, for ACM's SIGPLAN journal. The epigrams are a series of short, programming-language-neutral, humorous statements about computers and programming, which are widely quoted.
It first appeared in SIGPLAN Notices 17(9), September 1982.
In epigram #54, Perlis coined the term "Turing tarpit", which he defined as a programming language where "everything is possible but nothing of interest is easy."
References
External links
List of quotes (Yale)
Full article text -- (including so-called "meta epigrams", numbers 122-130)
Magazine articles
Association for Computing Machinery |
https://en.wikipedia.org/wiki/Future%20Shop | Future Shop was a Canadian electronics store chain. It was established in 1982 by Hassan Khosrowshahi. By 1990, the chain had become the country's largest retailer of computer and consumer electronics. In January 2013, the company operated 139 locations across Canada.
In November 2001, Future Shop was acquired by the similar American chain Best Buy for C$580 million. Although Best Buy began to establish Canadian locations under its own name following the purchase, it continued to operate the Future Shop stores as a separate chain. Even though many of the new Best Buy locations were in close proximity to existing Future Shop stores, the two chains were differentiated primarily by their in-store experiences.
On March 28, 2015, Best Buy announced the dissolution of the Future Shop brand and the closure of 66 of its locations. All remaining locations were converted to Best Buy stores.
History
Beginnings
Future Shop was founded in 1982 by Iranian entrepreneur Hassan Khosrowshahi, who left Iran to settle in Vancouver, British Columbia to start a retail business. Khosrowshahi graduated from the University of Tehran with a degree in law and economics and was a part of the family who owned the Minoo Industrial Group, a large Iran manufacturer of pharmaceuticals, cosmetics, and food products. Khosrowshahi planned to open a chain of consumer and home electronics stores and take over the Canadian retail market. His associate, Ardeshir Ziabakhsh (Ardy Zia), took the role of president and CEO of the newly formed company and Khosrowshahi served as chairman and founder. In 1983, Future Shop opened the first three stores, all of which were in British Columbia. The company sold computers, software, games, videocassettes, audio equipment, music, and other items. By December 1983, the first month all of the Future Shop stores were opened and making business, the company reached $2.8 million in sales.
By 1990, Future Shop became the largest retailer of computers and consumer electronics in Canada and was operating 38 stores across the country and some areas of the United States. In August 1993, Future Shop went public on the Toronto Stock Exchange, making $30 million to be used for expansion and to pay off debt.
By the end of 1995, Future Shop's sales had reached more than $1 billion, with more than $38 million EBITDA (earnings before interest, taxes, depreciation and amortization)
In 1997, Future Shop announced a change in management, with Ziabakhsh leaving the company. Khosrowshahi took on the roles of president and CEO, in addition to serving as chairman. Many people from company headquarters were let go during this transitional period.
Focusing on Canadian markets
In 1998, Future Shop purchased the Canadian division of Computer City from CompUSA, three months after the Computer City chain had been merged into CompUSA and either converted to CompUSA or closed and liquidated. During the next year, two of the Computer City retail stores were liquidated beca |
https://en.wikipedia.org/wiki/Io%20%28programming%20language%29 | Io is a pure object-oriented programming language inspired by Smalltalk, Self, Lua, Lisp, Act1, and NewtonScript. Io has a prototype-based object model similar to the ones in Self and NewtonScript, eliminating the distinction between instance and class. Like Smalltalk, everything is an object and it uses dynamic typing. Like Lisp, programs are just data trees. Io uses actors for concurrency.
Remarkable features of Io are its minimal size and openness to using external code resources. Io is executed by a small, portable virtual machine.
History
The language was created by Steve Dekorte in 2002, after trying to help a friend, Dru Nelson, with his language, Cel. He found out that he really didn't know much about how languages worked, and set out to write a tiny language to understand the problems better.
Philosophy
Io's goal is to explore conceptual unification and dynamic languages, so the tradeoffs tend to favor simplicity and flexibility over performance.
Features
Pure object-oriented based on prototypes
Code-as-data / homoiconic
Lazy evaluation of function parameters
Higher-order functions
Introspection, reflection and metaprogramming
Actor-based concurrency
Coroutines
Exception handling
Incremental garbage collecting supporting weak links
Highly portable
DLL/shared library dynamic loading on most platforms
Small virtual machine
Syntax
In its simplest form, it is composed of a single identifier:
doStuff
Assuming the above doStuff is a method, it is being called with zero arguments and as a result, explicit parentheses are not required.
If doStuff had arguments, it would look like this:
doStuff(42)
Io is a message passing language, and since everything in Io is a message (excluding comments), each message is sent to a receiver. The above example demonstrates this well, but not fully. To describe this point better, let's look at the next example:
System version
The above example demonstrates message passing in Io; the "version" message is sent to the "System" object.
Operators are a special case where the syntax is not as cut-and-dried as the above examples. The Io parser intercepts a set of operators defined by the interpreter, and translates them to method calls. For example, the following:
1 + 5 * 8 + 1
translates to:
1 +(5 *(8)) +(1)
All operators in Io are methods; the fact that they do not require explicit parentheses is a convenience. As you can see, there is also a little bit of operator precedence happening here, and the precedence levels are the same as with the C precedence levels.
Methods and blocks
In Io there are two ways of creating anonymous functions: methods and blocks. Between them, they are almost identical except for scope. While blocks have lexical scope, methods have dynamic scope.
Both method and block are higher-order functions.
Examples
The ubiquitous Hello world program:
"Hello, world!" println
New objects are created by cloning objects. In Io specifically, a new, empty ob |
https://en.wikipedia.org/wiki/National%20Cheng%20Kung%20University | National Cheng Kung University (NCKU; ) is a public research university located in Tainan, Taiwan. The university is best known for engineering, computer science, medicine, and design programs.
As a top university in Taiwan, NCKU has played a vital role in creating the Taiwan Miracle by helping Taiwan to transform from an agriculture-based society to an industrialized economy during the 1960s and 1970s, and further becoming one of the Four Asian Tigers. NCKU has been taking the top spot at the Global Views Monthly (遠見雜誌) Taiwan Graduate Employability Rankings for 6 consecutive years.
In 2005, NCKU was chosen by the Ministry of Education (Taiwan) as one of the seven universities in Taiwan for the Aim for the Top University Project (), which is similar to Top Global University Project in Japan and Universities of Excellence in Germany. Starting from 2006, because of its academic performance and research potential, the Ministry of Education (Taiwan) has offered NCKU NT$1.7 billion annually for five consecutive years, which is the second highest amount received among the universities in the project.
NCKU is a founding member of Taiwan Comprehensive University System, a strategic alliance of four leading research universities in the Southern Taiwan. The university is also a member of AACSB and IEET, and the only member from Taiwan in the Worldwide Universities Network.
History
National Cheng Kung University was originally established under Japanese colonial government in January 1931 as the Tainan Technical College. After the Japanese handover of Taiwan in October 1945, the school was renamed to Taiwan Provincial Tainan Junior College of Technology in March 1946, and then to Taiwan Provincial College of Engineering in October the same year.
When the government of the Republic of China moved to Taiwan in 1949, it was one of the three existing colleges in Taiwan. As the number of colleges expanded, it was upgraded to a provincial university in 1956 as Provincial Cheng Kung University, named after Koxinga, a Chinese military leader who drove the Dutch East India Company from Taiwan and founded the Kingdom of Tungning. In 1971, the university became a national university and was renamed to National Cheng Kung University.
Former Minister for Education Wu Jin served as the first president of the new National Cheng Kung University.
Campuses
NCKU is located in Tainan City, Taiwan. The main campus is situated across from the Tainan Railway Station, offering convenient transportation. NCKU has 11 campuses occupying a total of 187 hectares of land in the greater Tainan area, including the Cheng-Kung, Sheng-Li, Kuang-Fu, Cheng-Hsin, Tzu-Chiang, Ching-Yeh, Li-Hsing, Tung-Ning, Kuei-Jen An-Nan and Dou-Liu campuses, and some areas designated for dormitory use.
On January 12, 2011, the Y. S. Sun Green Building Research Center was inaugurated. It is the world's first green educational center as well as Taiwan's first zero carbon building. The -facility cost N |
https://en.wikipedia.org/wiki/Theoretical%20computer%20science | Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, formal language theory, the lambda calculus and type theory.
It is difficult to circumscribe the theoretical areas precisely. The ACM's Special Interest Group on Algorithms and Computation Theory (SIGACT) provides the following description:
History
While logical inference and mathematical proof had existed previously, in 1931 Kurt Gödel proved with his incompleteness theorem that there are fundamental limitations on what statements could be proved or disproved.
Information theory was added to the field with a 1948 mathematical theory of communication by Claude Shannon. In the same decade, Donald Hebb introduced a mathematical model of learning in the brain. With mounting biological data supporting this hypothesis with some modification, the fields of neural networks and parallel distributed processing were established. In 1971, Stephen Cook and, working independently, Leonid Levin, proved that there exist practically relevant problems that are NP-complete – a landmark result in computational complexity theory.
With the development of quantum mechanics in the beginning of the 20th century came the concept that mathematical operations could be performed on an entire particle wavefunction. In other words, one could compute functions on multiple states simultaneously. This led to the concept of a quantum computer in the latter half of the 20th century that took off in the 1990s when Peter Shor showed that such methods could be used to factor large numbers in polynomial time, which, if implemented, would render some modern public key cryptography algorithms like RSA insecure.
Modern theoretical computer science research is based on these basic developments, but includes many other mathematical and interdisciplinary problems that have been posed, as shown below:
Topics
Algorithms
An algorithm is a step-by-step procedure for calculations. Algorithms are used for calculation, data processing, and automated reasoning.
An algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.
Automata theory
Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science, under discrete mathematics (a section of mathematics and also of computer science). Automata comes from the Greek word αὐτόμα |
https://en.wikipedia.org/wiki/Israel%20Central%20Bureau%20of%20Statistics | The Israel Central Bureau of Statistics (, HaLishka HaMerkazit LiStatistika; ), abbreviated CBS, is an Israeli government office established in 1949 to carry out research and publish statistical data on all aspects of Israeli life, including population, society, economy, industry, education, and physical infrastructure.
The CBS is headquartered in the Givat Shaul neighborhood of Jerusalem, with another branch in Tel Aviv.
Overview
It is headed by a National Statistician (previously named Government Statistician), who is appointed on the recommendation of the prime minister. Professor Emeritus Danny Pfefferman of Hebrew University has served in that position and as Director of the CBS since 2013. The bureau's annual budget in 2011 was NIS 237 million.
The work of the CBS follows internationally accepted standards which enable comparison of statistical information with other countries. It gathers current, monthly, quarterly and annually data on the national economy (production, consumption, capital formation, labor productivity, savings), the balance of payments and foreign trade, the activity of different economic branches (agriculture, manufacturing, construction, transport, commerce and services, etc.), the price of goods and services, the population, family size, employment, education, health, crime, government services and more. The CBS also conducts a Census of Population and Housing every ten years, as well as periodic and one-time surveys on a variety of subjects.
The work of CBS is overseen by the Public Commission of Statistics. The data is disseminated in a wide variety of publications, among them the Statistical Abstract of Israel. Current and updated statistical information is brought to the public's attention through daily press releases. Government ministries use the data collected by CBS for policymaking, planning and tracking development. The data is also made available to academic research institutions and the general public.
References
External links
CBS's 2018 Israel's population
Israel
Government agencies of Israel |
https://en.wikipedia.org/wiki/NWR | NWR may refer to:
Organizations
National Women's Register, a network of women's discussion groups
New World Resources, a European coal mining company
Newman Wachs Racing, an American auto racing team
NOAA Weather Radio, a network of radio stations broadcasting weather information in the US
North West Radio, former radio station that broadcast 1989–2004 in parts of Ireland
Other uses
National Wildlife Refuge, a protected area of the US managed by the US Fish and Wildlife Service
Nawaru language (ISO 639:nwr), spoken in Papua New Guinea
North Western Railway (disambiguation)
Nicolas Winding Refn, a Danish movie maker.
See also
L&NWR (London and North Western Railway) |
https://en.wikipedia.org/wiki/Global%20alert | Global alert is used as the global radio-communications network during times of international crises or threats to international security. Global Alerts are also issued by agencies such as the World Health Organization (WHO), when there is a perceived threat of an international pandemic, (global epidemic), such as the threat of a SARS, (Severe Acute Respiratory Syndrome), pandemic during March 2003, due to its high contagion level which was rapidly spread by travelers sharing international flights. The global alert released by the World Health Organization regarding the SARS outbreak and its rapid contagion saved many lives: The alert about the disease, precautionary measures, and preventive measures to be taken by individuals, including specific hygiene information needed to arrest the spread of SARS was communicated instantly throughout the world.
Global Outbreak Alert & Response Network (GOARN)
GOARN is a system of cooperating institutions and networks that are constantly ready to respond to disease outbreaks. Established in 2000, it is a branch of the World Health Organization. GOARN's partners include the Red Cross and divisions of the United Nations such as UNICEF and UNHCR. In addition to providing aid to areas affected by disease outbreaks, GOARN also works to standardize protocols for medical response systems.
References
Alert measurement systems |
https://en.wikipedia.org/wiki/HLN%20%28TV%20network%29 | HLN is an American basic cable network. Owned by CNN Global, the network primarily carries true-crime programming, as well as limited live news programming.
The channel was originally launched on January 1, 1982, by Turner Broadcasting as CNN2 (later renamed Headline News or CNN Headline News), a sister network to CNN that broadcast a looping, half-hour cycle of segments covering various news topics. In 2005, HLN began to diverge from this format and air more personality-based programs, including a primetime block featuring pundits such as Glenn Beck and legal commentator Nancy Grace. In the mid-2010s, HLN repositioned itself as a social media-centric network, highlighting headlines popular on social networks, and introducing social media-themed shows. Under CNN president Jeff Zucker, the channel began to backpedal on this programming in 2016, gradually shifting to a focus on crime, "regional" headlines, and entertainment stories (in contrast to CNN's current focus on politics) during its daytime programming, with true crime programs.
With the 2022 merger of CNN parent WarnerMedia and Discovery Inc. to form Warner Bros. Discovery, HLN became a sister to Discovery's true-crime channel Investigation Discovery (ID). In December 2022, new CNN president Chris Licht announced that HLN would abandon original live news programming entirely as part of a reorganization, with HLN now being overseen by ID's staff, and news programming limited to a simulcast of CNN This Morning for contractual reasons. The network's schedule outside of that has primarily featured true crime programs as before, in addition to reruns of crime and legal dramas from the Warner Bros. Television library.
As of September 2018, HLN was available to approximately 88.7 million households (92.5 percent of pay television subscribers) in the United States. Since the mid-2000s, HLN has been available internationally on pay television providers in parts of Asia, the Caribbean, Latin America, the Middle East, North Africa, and Canada.
History
Launch and early years
The channel was launched at midnight Eastern Time on January 1, 1982, as CNN2. The channel's launch was simulcast nationwide on sister networks CNN and Superstation WTBS (now simply TBS), starting at 11:45 p.m. on December 31, 1981, as a preview for cable providers that had not yet reached agreements to carry CNN2. Following a preview reel by original CNN anchor Lou Waters and an introduction by founder and then-Turner Broadcasting CEO Ted Turner, Chuck Roberts (who would become the channel's longest-serving news anchor, with a 28-year career with CNN2/Headline News that lasted until his retirement on July 30, 2010) and Denise LeClair – anchored the channel's first newscast.
Originally, the channel's programming was formatted around the idea that a viewer could tune in at any time of day or night (instead of having to wait for the once- or twice-daily national news segments in local newscasts, or morning or evening network |
https://en.wikipedia.org/wiki/CIOS | CIOS may refer to:
Cisco IOS, software used on routers and network switches
Cyprus-Israel Optical System, a cable system linking Cyprus and Israel
Channel Islands Occupation Society, a military history organisation
Combined Intelligence Objectives Subcommittee, an organization gathering technical intelligence in Germany after WW2
CIOS-FM 98.5 FM - A radio station licensed to Stephenville, NL |
https://en.wikipedia.org/wiki/Oracle%20Database | Oracle Database (commonly referred to as Oracle DBMS, Oracle Autonomous Database, or simply as Oracle) is a proprietary multi-model database management system produced and marketed by Oracle Corporation.
It is a database commonly used for running online transaction processing (OLTP), data warehousing (DW) and mixed (OLTP & DW) database workloads. Oracle Database is available by several service providers on-prem, on-cloud, or as a hybrid cloud installation. It may be run on third party servers as well as on Oracle hardware (Exadata on-prem, on Oracle Cloud or at Cloud at Customer).
Oracle Database uses SQL query language for database updating and retrieval.
History
Larry Ellison and his two friends and former co-workers, Bob Miner and Ed Oates, started a consultancy called Software Development Laboratories (SDL) in 1977. SDL developed the original version of the Oracle software. The name Oracle comes from the code-name of a CIA-funded project Ellison had worked on while formerly employed by Ampex.
Releases and versions
Oracle products follow a custom release-numbering and -naming convention. The "c" in the current release, Oracle Database 23c, stands for "Cloud". Previous releases (e.g. Oracle Database 10g and Oracle9i Database) have used suffixes of "g" and "i" which stand for "Grid" and "Internet" respectively. Prior to the release of Oracle8i Database, no suffixes featured in Oracle Database naming conventions. Note that there was no v1 of Oracle Database, as co-founder Larry Ellison "knew no one would want to buy version 1".
Oracle Database release numbering has used the following codes:
The Introduction to Oracle Database includes a brief history on some of the key innovations introduced with each major release of Oracle Database.
See My Oracle Support (MOS) note Release Schedule of Current Database Releases (Doc ID 742060.1) for the current Oracle Database releases and their patching end dates.
Patch updates and security alerts
Prior to Oracle Database 18c, Oracle Corporation released Critical Patch Updates (CPUs) and Security Patch Updates (SPUs) and Security Alerts to close security vulnerabilities. These releases are issued quarterly; some of these releases have updates issued prior to the next quarterly release.
Starting with Oracle Database 18c, Oracle Corporation releases Release Updates (RUs) and Release Update Revisions (RURs). RUs usually contain security, regression (bug), optimizer, and functional fixes which may include feature extensions as well. RURs include all fixes from their corresponding RU but only add new security and regression fixes. However, no new optimizer or functional fixes are included.
Market position
A 2016 Gartner report claimed to show Oracle holding #1 RDBMS market share worldwide based on the revenue share ahead of its four closest competitors – Microsoft, IBM, SAP and Teradata . A 2021 Gartner Magic Quadrant report named Oracle a leader in Cloud Database Management Systems.
Competition |
https://en.wikipedia.org/wiki/Phone%20connector | Phone connector, phone plug, or phone jack may refer to:
Telephone plug, used to connect a telephone to the telephone wiring in a home or business, and in turn to a local telephone network
Phone connector (audio), an audio jack, jack plug, stereo plug, mini-jack, mini-stereo, or headphone/phone jack
See also
RCA connector, also known as a phono connector |
https://en.wikipedia.org/wiki/Registered%20jack | A registered jack (RJ) is a standardized telecommunication network interface for connecting voice and data equipment to a service provided by a local exchange carrier or long distance carrier. Registered interfaces were first defined in the Universal Service Ordering Code (USOC) system of the Bell System in the United States for complying with the registration program for customer-supplied telephone equipment mandated by the Federal Communications Commission (FCC) in the 1970s.<ref>AT&T, Registration Interface—Selection and General Information, Bell System Practices, Section 463-400-100 Issue 1, May 1976</ref> They were subsequently codified in title 47 of the Code of Federal Regulations Part 68. Registered jack connections began to see use after their invention in 1973 by Bell Labs.
The specification includes physical construction, wiring, and signal semantics. Accordingly, registered jacks are primarily named by the letters RJ, followed by two digits that express the type. Additional letter suffixes indicate minor variations. For example, RJ11, RJ14, and RJ25 are the most commonly used interfaces for telephone connections for one-, two-, and three-line service, respectively. Although these standards are legal definitions in the United States, some interfaces are used worldwide.
The connectors used for registered jack installations are primarily the modular connector and the 50-pin miniature ribbon connector. For example, RJ11 and RJ14 use female six-position modular connectors, and RJ21 uses a 25-pair (50-pin) miniature ribbon connector. RJ11 uses two conductors in a six-position female modular connector, so can be made with any female six-position modular connector, while RJ14 uses four, so can be made with either a 6P4C or a 6P6C connector.
Naming standard
The registered jack designations originated in the standardization process of telephone connections in the Bell System in the United States, and describe application circuits and not just the physical geometry of the connectors. The same modular connector type may be used for different registered jack applications. Modular connectors were developed to replace older telephone installation methods that used hardwired cords or bulkier varieties of telephone plugs.
Strictly, Registered Jack refers to both the female physical connector (modular connector) and specific wiring patterns, but the term is often used loosely to refer to modular connectors regardless of wiring, gender, or use, commonly for telephone line connections, but also for Ethernet over twisted pair, resulting in confusion over the various connection standards and applications. For example, the six-position physical connector, plug and jack, is identically dimensioned and inter-connectable, whether it is wired for one, two, or three lines. These are the RJ11, RJ14, and RJ25 interfaces. The RJ standards designations only pertain to the wiring of the (female) jacks, hence the name Registered Jack. It is commonplace, but not str |
https://en.wikipedia.org/wiki/Parameter%20%28computer%20programming%29 | In computer programming, a parameter or a formal argument is a special kind of variable used in a subroutine to refer to one of the pieces of data provided as input to the subroutine. These pieces of data are the values of the arguments (often called actual arguments or actual parameters) with which the subroutine is going to be called/invoked. An ordered list of parameters is usually included in the definition of a subroutine, so that, each time the subroutine is called, its arguments for that call are evaluated, and the resulting values can be assigned to the corresponding parameters.
Unlike argument in usual mathematical usage, the argument in computer science is the actual input expression passed/supplied to a function, procedure, or routine in the invocation/call statement, whereas the parameter is the variable inside the implementation of the subroutine. For example, if one defines the add subroutine as def add(x, y): return x + y, then x, y are parameters, while if this is called as add(2, 3), then 2, 3 are the arguments. Variables (and expressions thereof) from the calling context can be arguments: if the subroutine is called as a = 2; b = 3; add(a, b) then the variables a, b are the arguments, not the values 2, 3. See the Parameters and arguments section for more information.
The semantics for how parameters can be declared and how the (value of) arguments are passed to the parameters of subroutines are defined by the evaluation strategy of the language, and the details of how this is represented in any particular computer system depend on the calling convention of that system. In the most common case, call by value, a parameter acts within the subroutine as a new local variable initialized to the value of the argument (a local (isolated) copy of the argument if the argument is a variable), but in other cases, e.g. call by reference, the argument variable supplied by the caller can be affected by actions within the called subroutine.
Example
The following program in the C programming language defines a function that is named "SalesTax" and has one parameter named "price". The type of price is "double" (i.e. a double-precision floating point number). The function's return type is also a double.
double SalesTax(double price)
{
return 0.05 * price;
}
After the function has been defined, it can be invoked as follows:
SalesTax(10.00);
In this example, the function has been invoked with the argument 10.00. When this happens, 10.00 will be assigned to price, and the function begins calculating its result. The steps for producing the result are specified below, enclosed in {}. 0.05 * price indicates that the first thing to do is multiply 0.05 by the value of price, which gives 0.50. return means the function will produce the result of 0.05 * price. Therefore, the final result (ignoring possible round-off errors one encounters with representing decimal fractions as binary fractions) is 0.50.
Parameters and arguments
The terms parameter |
https://en.wikipedia.org/wiki/C%20standard%20library | The C standard library or libc is the standard library for the C programming language, as specified in the ISO C standard. Starting from the original ANSI C standard, it was developed at the same time as the C library POSIX specification, which is a superset of it. Since ANSI C was adopted by the International Organization for Standardization, the C standard library is also called the ISO C library.
The C standard library provides macros, type definitions and functions for tasks such as string handling, mathematical computations, input/output processing, memory management, and several other operating system services.
Application programming interface (API)
Header files
The application programming interface (API) of the C standard library is declared in a number of header files. Each header file contains one or more function declarations, data type definitions, and macros.
After a long period of stability, three new header files (iso646.h, wchar.h, and wctype.h) were added with Normative Addendum 1 (NA1), an addition to the C Standard ratified in 1995. Six more header files (complex.h, fenv.h, inttypes.h, stdbool.h, stdint.h, and tgmath.h) were added with C99, a revision to the C Standard published in 1999, and five more files (stdalign.h, stdatomic.h, stdnoreturn.h, threads.h, and uchar.h) with C11 in 2011. In total, there are now 29 header files:
Three of the header files (complex.h, stdatomic.h, and threads.h) are conditional features that implementations are not required to support.
The POSIX standard added several nonstandard C headers for Unix-specific functionality. Many have found their way to other architectures. Examples include fcntl.h and unistd.h. A number of other groups are using other nonstandard headers – the GNU C Library has alloca.h, and HP OpenVMS has the va_count() function.
Documentation
On Unix-like systems, the authoritative documentation of the actually implemented API is provided in the form of man pages. On most systems, man pages on standard library functions are in section 3; section 7 may contain some more generic pages on underlying concepts (e.g. man 7 math_error in Linux).
Implementations
Unix-like systems typically have a C library in shared library form, but the header files (and compiler toolchain) may be absent from an installation so C development may not be possible. The C library is considered part of the operating system on Unix-like systems. The C functions, including the ISO C standard ones, are widely used by programs, and are regarded as if they were not only an implementation of something in the C language, but also de facto part of the operating system interface. Unix-like operating systems generally cannot function if the C library is erased. This is true for applications which are dynamically as opposed to statically linked. Further, the kernel itself (at least in the case of Linux) operates independently of any libraries.
On Microsoft Windows, the core system dynamic libraries (DLLs |
https://en.wikipedia.org/wiki/Beny%20Alagem | Binyamin "Beny" Alagem (; born 1953) is an Israeli-American entrepreneur, business executive, hotelier and philanthropist. He is the founder and former Chief Executive of Packard Bell Computers. He is the owner of the Beverly Hilton Hotel and the Waldorf Astoria in Beverly Hills, California.
Early life
Beny Alagem was born in Israel. He was a tank driver. Alagem studied at California State Polytechnic University, Pomona where he met fellow Israeli immigrants Jason Barzilay and Alex Sandel. In 1983, Alagem would partner up with Sandel and Barzilay to start Cal-Abco, a wholesaler of computer parts. In 1986, all three then invested into creating Packard Bell. As of 1995, Cal-Abco was still intact and was listed in the Packard Bell prospectus as a supplier of parts to Packard Bell with a shared credit line between the two companies.
Career
Alagem founded Packard Bell, a personal computer manufacturer, in 1986. He served as its Chief Executive and President until 1998, when he resigned after he disagreed with NEC and Groupe Bull, the two other main shareholders. In January 1999, he acquired the rights to the AST Research name from Samsung.
Alagem serves as the Chairman of the Alagem Capital Group, an asset management firm headquartered in Beverly Hills, California. In December 2003, Alagem purchased the Beverly Hilton Hotel from entertainer Merv Griffin for US$130 million through Oasis West Realty LLC, where he serves as Chief Executive Officer. He proceeded to renovate it for an extra US$90 million. He is overseeing the development of the Beverly Hills Waldorf Astoria with Guggenheim Partners, which is scheduled to be dedicated in 2017. Designed by the architectural firm Gensler, it is adjacent to the Beverly Hilton Hotel. The Waldorf Astoria Beverly Hills will be the first new luxury hotel for the brand on the West Coast.
Philanthropy
Alagem was appointed an Honorary Ambassador of the City of Tel Aviv in 1995. He serves as an honorary member of the board of directors of the Israeli-American Council (IAC). Indeed, he has been described by The Jewish Daily Forward as one of the "major donors" to the IAC. For example, he underwrote the entire cost of the Council Leadership Gala on March 11, 2012. He also serves on the Advisory Board of the American Friends of The Citizens' Empowerment Center in Israel, a non-profit organization headquartered in Beverly Hills which promotes peace in Israel through research and education.
In 2004, Alagem held a fundraiser for the March of the Living, a non-profit organization which annual funds trips for 18,000 students to see the horror of the Auschwitz concentration camp, followed by trip to Israel on Independence Day. The event, which took place at the Beverly Hilton Hotel and was attended by Governor Arnold Schwarzenegger and Israeli ministers Ehud Olmert and Avraham Hirschenson, raised US$1 million.
Alagem co-chaired a fundraiser for the Friends of the Israel Defense Forces at the Beverly Hilton Hotel on Decem |
https://en.wikipedia.org/wiki/IMesh | iMesh was a media and file sharing client that was available in nine languages. It used a proprietary, centralized, P2P network (IM2Net) operating on ports 80, 443 and 1863. iMesh was owned by American company iMesh, Inc., who maintained development centers around the world. , it was the third most popular music subscription service in the US.
iMesh operated the first "RIAA-approved" P2P service, allowing users residing in the United States and Canada to download music content of choice for a monthly fee in the form of either a Premium subscription or a "ToGo" subscription. This subscription-based approach is advocated by theories such as the Open Music Model. A third option was also available for users (residing in either country) to permanently purchase tracks for 99 cents (USD) each, without a subscription.
In September 2013, the website of iMesh was hacked and approximately 50M accounts were exposed. The data was later put up for sale on a dark market website in mid-2016 and included email and IP addresses, usernames and salted MD5 hashes.
Shutdown
On June 9, 2016, iMesh shut down their service without prior notification. Their top-level web page was changed to read "We are sad to inform you that iMesh is no longer available." Their Support page was changed to read "Due to changes in the music industry we regret to inform you that iMesh will no longer be available for download, and will no longer sell subscriptions or music tracks." They posted to their Facebook page: "After many years of wonderful music, iMesh is no longer available. Thank you for listening with us. Stay tuned for our next adventure." Multiple Facebook users commented on the post to express frustration that they had no way to contact friends made via the iMesh social networking features.
Legal aspects
RIAA lawsuit
On September 18, 2003 the RIAA (Recording Industry Association of America) sued iMesh for encouraging copyright infringement. iMesh settled the lawsuit a little over 10 months later on July 20, 2004, where according to the RIAA, the terms of the settlement were that iMesh would pay them US$4.1 million and could continue operating as normal (unlike Grokster) while implementing a paid service (iMesh 6.0). iMesh had first agreed to have the new service available by the end of 2004, but this was pushed back towards the end of 2005 due to technicalities.
Legality
After the relaunch, iMesh was advertised as a 100% legal P2P client, and acknowledged as being so by the RIAA. This was because downloads through the client were limited to a select database of 15 million licensed songs and videos.
The iMesh 6 client (and later versions) achieved this by detecting attempts to download copyrighted material and blocking the transfer through the use of acoustic fingerprinting, provided by content protection company Audible Magic.
An agreement with the MPAA had also been reached. Video files more than 50 MB in size and 15 minutes in length could no longer be shared on |
https://en.wikipedia.org/wiki/Financial%20engineering | Financial engineering is a multidisciplinary field involving financial theory, methods of engineering, tools of mathematics and the practice of programming. It has also been defined as the application of technical methods, especially from mathematical finance and computational finance, in the practice of finance.
Financial engineering plays a key role in a bank's customer-driven derivatives business
— delivering bespoke OTC-contracts and "exotics", and implementing various structured products —
which encompasses quantitative modelling, quantitative programming and risk managing financial products in compliance with the regulations and Basel capital/liquidity requirements.
An older use of the term "financial engineering" that is less common today is aggressive restructuring of corporate balance sheets.
Mathematical finance is the application of mathematics to finance. Computational finance and mathematical finance are both subfields of financial engineering. Computational finance is a field in computer science and deals with the data and algorithms that arise in financial modeling.
Discipline
Financial engineering draws on tools from applied mathematics, computer science, statistics and economic theory.
In the broadest sense, anyone who uses technical tools in finance could be called a financial engineer, for example any computer programmer in a bank or any statistician in a government economic bureau. However, most practitioners restrict the term to someone educated in the full range of tools of modern finance and whose work is informed by financial theory. It is sometimes restricted even further, to cover only those originating new financial products and strategies.
Despite its name, financial engineering does not belong to any of the fields in traditional professional engineering even though many financial engineers have studied engineering beforehand and many universities offering a postgraduate degree in this field require applicants to have a background in engineering as well. In the United States, the Accreditation Board for Engineering and Technology (ABET) does not accredit financial engineering degrees. In the United States, financial engineering programs are accredited by the International Association of Quantitative Finance.
Quantitative analyst ("Quant") is a broad term that covers any person who uses math for practical purposes, including financial engineers. Quant is often taken to mean "financial quant", in which case it is similar to financial engineer. The difference is that it is possible to be a theoretical quant, or a quant in only one specialized niche in finance, while "financial engineer" usually implies a practitioner with broad expertise.
"Rocket scientist" (aerospace engineer) is an older term, first coined in the development of rockets in WWII (Wernher von Braun), and later, the NASA space program; it was adapted by the first generation of financial quants who arrived on Wall Street in the late 1970s and early |
https://en.wikipedia.org/wiki/British%20Transport%20Police | British Transport Police (BTP; ) is a national special police force that polices the railway network of England, Wales and Scotland. The force polices more than 10,000 miles of track and more than 3,000 stations and depots.
BTP also polices the London Underground, Docklands Light Railway, the West Midlands Metro, Tramlink, part of the Tyne and Wear Metro, Glasgow Subway and the London Cable Car.
The force is funded primarily by the rail industry.
Jurisdiction
As well as having jurisdiction across the national rail network, the BTP is also responsible for policing:
Croydon Tramlink
Docklands Light Railway
London Cable Car
Glasgow Subway
London Underground
Tyne and Wear Metro (Sunderland branch)
West Midlands Metro
This amounts to around of track and more than 3,000 railway stations and depots. There are more than one billion passenger journeys annually on the main lines alone.
In addition, BTP, in conjunction with the French National Police (under the Border Police unit) – – police the international services operated by Eurostar.
BTP is not responsible for policing the majority of the Tyne and Wear Metro, which is instead policed by Northumbria Police's Metro Unit, nor the entirety of the Manchester Metrolink (policed by Greater Manchester Police). BTP also does not police heritage railways.
A BTP constable can act as a police constable outside their normal railway jurisdiction as described in the "Powers and status of officers" section.
Previous jurisdiction
BTP constables previously had jurisdiction at docks, ports, harbours and inland waterways, as well at some bus stations and British Transport Hotels. These roles fell away in 1985 with privatisation. The legislation was amended to reflect this in 1994.
History
Foundation
The first railway employees described as "police" can be traced back to 30 June 1826. A regulation of the Stockton and Darlington Railway refers to the police establishment of "One Superintendent, four officers and numerous gate-keepers". This is the first mention of railway police anywhere and was three years before the Metropolitan Police Act was passed. They were not, however, described as "constables" and the description may refer to men controlling the trains rather than enforcing the law. Specific reference to "constables" rather than mere "policemen" is made by the BTP website article "A History of Policing the Railway" which states "The London, Birmingham and Liverpool Railway Companion of 1838 reports 'Each Constable, besides being in the employ of the company, is sworn as a County Constable.'" Further reference is made by the BTP to "an Act of 1838...which according to J. R. Whitbread in The Railway Policeman (Harrap, 1961) was the first legislation to provide for any form of policing of the railway whilst under construction, i.e. to protect the public from the navvies more or less."
The modern British Transport Police was formed by the British Transport Commission Act 1949 which combined the alread |
https://en.wikipedia.org/wiki/Mujer%2C%20Casos%20de%20la%20Vida%20Real | Mujer, Casos de la Vida Real (translated: Woman, Real Life Cases) is an anthology telenovela produced by Mexican television network Televisa for Canal de las Estrellas. Developed as a response to the Mexican earthquake of 1985, the program initially consisted of reenactments of real-life situations, or "cases", related to the earthquake's impact, with the intent of generating assistance for victims. Due to its popularity, Televisa eventually expanded the topics of the stories the series depicted beyond those related to the earthquake. The series was produced and hosted by Mexican actress and politician Silvia Pinal.
In its first few seasons, the show presented generally lighthearted themes, such as love stories and lost loves; during the 1980s, topics such as domestic violence had still not been acknowledged by Mexican society. In the 1990s, themes became darker in tone, including cases of rape, incest, child abuse, prostitution, LGBT discrimination and domestic violence. The show became a stage for social reform in Mexico. With these changes, the show was usually first in line to discuss topics that were often kept out of the public eye.
Although Mujer, Casos de la Vida Real underwent several metamorphoses in the 2000s, and a spin-off show developed, the show stopped producing episodes in 2007, and in 2009 Pinal confirmed its cancellation.
History
Mujer, Casos de la Vida Real was initially developed as a response to the Mexican earthquake of 1985, with its aim being to prompt assistance for victims of the earthquake by circulating "real-life cases" of its impact. The show received an outpouring of support from Mexican viewers, causing Televisa, the network that produced the show, to expand its scope beyond earthquake-related stories.
The original format of the show usually consisted of two cases per episode, though some one-hour special cases were presented from time to time. It was hosted by actress and politician Silvia Pinal, who at the beginning of each episode would introduce the case the audience was about to view. Afterward, she would return with comments regarding the moral of the story, as well as present her own personal view on what should be done to prevent such events from happening, or, in some cases, what should be done to allow them to happen. In other programs, a guest expert offered advice or interpretation.
By the mid-1990s, the show aired on Saturday nights on Canal de las Estrellas. In 2001, a weekday afternoon version was started, originally keeping the same style of cases as the Saturday version.
The weekday format changed in May 2006 to a mini-series format. Instead of individual cases, various situations were presented in a continuous mini-series that ran throughout the weekdays (MondayFriday) for one hour each day. This new format brought an end to the usually gritty and, at times, racy material and instead made way for more representation of the love stories and lost loves that characterized the show in its infa |
https://en.wikipedia.org/wiki/Isolation%20%28database%20systems%29 | In database systems, isolation determines how transaction integrity is visible to other users and systems.
A lower isolation level increases the ability of many users to access the same data at the same time, but also increases the number of concurrency effects (such as dirty reads or lost updates) users might encounter. Conversely, a higher isolation level reduces the types of concurrency effects that users may encounter, but requires more system resources and increases the chances that one transaction will block another.
Isolation is typically defined at database level as a property that defines how or when the changes made by one operation become visible to others. On older systems, it may be implemented systemically, for example through the use of temporary tables. In two-tier systems, a transaction processing (TP) manager is required to maintain isolation. In n-tier systems (such as multiple websites attempting to book the last seat on a flight), a combination of stored procedures and transaction management is required to commit the booking and send confirmation to the customer.
Isolation is one of the four ACID properties, along with atomicity, consistency and durability.
Concurrency control
Concurrency control comprises the underlying mechanisms in a DBMS which handle isolation and guarantee related correctness. It is heavily used by the database and storage engines both to guarantee the correct execution of concurrent transactions, and (via different mechanisms) the correctness of other DBMS processes. The transaction-related mechanisms typically constrain the database data access operations' timing (transaction schedules) to certain orders characterized as the serializability and recoverability schedule properties. Constraining database access operation execution typically means reduced performance (measured by rates of execution), and thus concurrency control mechanisms are typically designed to provide the best performance possible under the constraints. Often, when possible without harming correctness, the serializability property is compromised for better performance. However, recoverability cannot be compromised, since such typically results in a quick database integrity violation.
Two-phase locking is the most common transaction concurrency control method in DBMSs, used to provide both serializability and recoverability for correctness. In order to access a database object a transaction first needs to acquire a lock for this object. Depending on the access operation type (e.g., reading or writing an object) and on the lock type, acquiring the lock may be blocked and postponed, if another transaction is holding a lock for that object.
Read phenomena
The ANSI/ISO standard SQL 92 refers to three different read phenomena when a transaction retrieves data that another transaction might have updated.
In the following examples, two transactions take place. In transaction 1, a query is performed, then in transaction 2, an update is |
https://en.wikipedia.org/wiki/Social%20network%20analysis | Social network analysis (SNA) is the process of investigating social structures through the use of networks and graph theory. It characterizes networked structures in terms of nodes (individual actors, people, or things within the network) and the ties, edges, or links (relationships or interactions) that connect them. Examples of social structures commonly visualized through social network analysis include social media networks, meme spread, information circulation, friendship and acquaintance networks, peer learner networks, business networks, knowledge networks, difficult working relationships, collaboration graphs, kinship, disease transmission, and sexual relationships. These networks are often visualized through sociograms in which nodes are represented as points and ties are represented as lines. These visualizations provide a means of qualitatively assessing networks by varying the visual representation of their nodes and edges to reflect attributes of interest.
Social network analysis has emerged as a key technique in modern sociology. It has also gained significant popularity in the following - anthropology, biology, demography, communication studies, economics, geography, history, information science, organizational studies, political science, public health, social psychology, development studies, sociolinguistics, and computer science, education and distance education research, and is now commonly available as a consumer tool (see the list of SNA software).
The advantages of SNA are twofold. Firstly, it can process a large amount of relational data and describe the overall relational network structure. tem and parameter selection to confirm the influential nodes in the network, such as in-degree and out-degree centrality. SNA context and choose which parameters to define the “center” according to the characteristics of the network. Through analyzing nodes, clusters and relations, the communication structure and position of individuals can be clearly described.
History
Social network analysis has its theoretical roots in the work of early sociologists such as Georg Simmel and Émile Durkheim, who wrote about the importance of studying patterns of relationships that connect social actors. Social scientists have used the concept of "social networks" since early in the 20th century to connote complex sets of relationships between members of social systems at all scales, from interpersonal to international.
In the 1930s Jacob Moreno and Helen Jennings introduced basic analytical methods. In 1954, John Arundel Barnes started using the term systematically to denote patterns of ties, encompassing concepts traditionally used by the public and those used by social scientists: bounded groups (e.g., tribes, families) and social categories (e.g., gender, ethnicity).
Starting in the 1970's, scholars such as Ronald Burt, Kathleen Carley, Mark Granovetter, David Krackhardt, Edward Laumann, Anatol Rapoport, Barry Wellman, Douglas R. White, and |
https://en.wikipedia.org/wiki/Critical%20realism | Critical realism may refer to:
Critical realism (philosophy of perception), a perspective that states that some sense-data are accurate to external objects
Critical realism (philosophy of the social sciences), philosophical approach associated with Roy Bhaskar
Theological critical realism, a term used in the religion–science interface community
Social realism, particularly applied to art |
https://en.wikipedia.org/wiki/Architectural%20state | Architectural state is the collection of information in a computer system that defines the state of a program during execution. Architectural state includes main memory, architectural registers, and the program counter. Architectural state is defined by the instruction set architecture and can be manipulated by the programmer using instructions. A core dump is a file recording the architectural state of a computer program at some point in time, such as when it has crashed.
Examples of architectural state include:
Main Memory (Primary storage)
Control registers
Instruction flag registers (such as EFLAGS in x86)
Interrupt mask registers
Memory management unit registers
Status registers
General purpose registers (such as AX, BX, CX, DX, etc. in x86)
Address registers
Counter registers
Index registers
Stack registers
String registers
Architectural state is not microarchitectural state. Microarchitectural state is hidden machine state used for implementing the microarchitecture. Examples of microarchitectural state include pipeline registers, cache tags, and branch predictor state. While microarchitectural state can change to suit the needs of each processor implementation in a processor family, binary compatibility among processors in a processor family requires a common architectural state.
Architectural state naturally does not include state-less elements of a computer such as busses and computation units (e.g., the ALU).
References
Central processing unit |
https://en.wikipedia.org/wiki/Graph%20drawing | Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional depictions of graphs arising from applications such as social network analysis, cartography, linguistics, and bioinformatics.
A drawing of a graph or network diagram is a pictorial representation of the vertices and edges of a graph. This drawing should not be confused with the graph itself: very different layouts can correspond to the same graph. In the abstract, all that matters is which pairs of vertices are connected by edges. In the concrete, however, the arrangement of these vertices and edges within a drawing affects its understandability, usability, fabrication cost, and aesthetics. The problem gets worse if the graph changes over time by adding and deleting edges (dynamic graph drawing) and the goal is to preserve the user's mental map.
Graphical conventions
Graphs are frequently drawn as node–link diagrams in which the vertices are represented as disks, boxes, or textual labels and the edges are represented as line segments, polylines, or curves in the Euclidean plane. Node–link diagrams can be traced back to the 14th-16th century works of Pseudo-Lull which were published under the name of Ramon Llull, a 13th century polymath. Pseudo-Lull drew diagrams of this type for complete graphs in order to analyze all pairwise combinations among sets of metaphysical concepts.
In the case of directed graphs, arrowheads form a commonly used graphical convention to show their orientation; however, user studies have shown that other conventions such as tapering provide this information more effectively. Upward planar drawing uses the convention that every edge is oriented from a lower vertex to a higher vertex, making arrowheads unnecessary.
Alternative conventions to node–link diagrams include adjacency representations such as circle packings, in which vertices are represented by disjoint regions in the plane and edges are represented by adjacencies between regions; intersection representations in which vertices are represented by non-disjoint geometric objects and edges are represented by their intersections; visibility representations in which vertices are represented by regions in the plane and edges are represented by regions that have an unobstructed line of sight to each other; confluent drawings, in which edges are represented as smooth curves within mathematical train tracks; fabrics, in which nodes are represented as horizontal lines and edges as vertical lines; and visualizations of the adjacency matrix of the graph.
Quality measures
Many different quality measures have been defined for graph drawings, in an attempt to find objective means of evaluating their aesthetics and usability. In addition to guiding the choice between different layout methods for the same graph, some layout methods attempt to directly optimize these measures.
The crossing number of a drawing is t |
https://en.wikipedia.org/wiki/GC | GC may stand for:
Computing
Garbage collection (computer science), a form of automatic memory management
GenerativeComponents, computer-aided design software
Global Catalog, a global listing of all objects in an Active Directory forest
General Category of a Unicode symbol, see Unicode character property#General Category
gc, the Go compiler
Entertainment
GC (character), a fictitious cat on 1980s Mexican television
The GC, a New Zealand television series
GameCube, a home video game console
Games Convention, an annual video games event held in Leipzig, Germany
Good Charlotte, American rock band
People
The GC, the alter ego of English media personality and businesswoman Gemma Collins (born 1981)
Organizations
Grasshopper Club Zürich, a Swiss sports club
Green Council, an environmental organization based in Hong Kong
Gurkha Contingent of the Singapore Police Force
Guardia Civil (Civil Guard (Spain)), the civil guard or gendarmerie in Spain
, Actuarial Association of Europe, established in 1978
Grinnell College, a private liberal arts college in Grinnell, Iowa
Science
GC (gene), encodes the vitamin D-binding protein also known as gc-globulin
gc, a unit conversion factor used in engineering
GC-content, a sequence composition of DNA molecules in genetics
Gallocatechol, a plant polyphenol molecule
Gas chromatography, in analytical chemistry
Germinal center, an area in a lymph node
Gigacoulomb, an SI symbol for electric charge equal to 109 coulomb
Granular component, a component of the nucleolus
Guanylate cyclase, an enzyme catalysing the synthesis of cyclic-GMP from GTP
Neisseria gonorrhoeae or gonococcus, the causative agent of gonorrhea
Clayey gravel, in the Unified Soil Classification System
Crystallized intelligence (abbreviated Gc), a part of fluid and crystallized intelligence
Library of Congress Classification:Class G, subclass GC -- Oceanography
Genetic Counselor, health professionals who primarily counsel individuals on risks related to various hereditary diseases.
GC, star designation from the Boss General Catalogue
Transportation
Gambia International Airlines (IATA code), the national airline of the Gambia
Georgia Central Railway, a class III railroad in Georgia, United States
Grand Central, a railway operator in England
Gibraltar to Casablanca convoy (convoy code GC) in World War II
GC, Mazda's first front-wheel drive midsize car platform
GC, ID code for the first generation Subaru Impreza sedan
Other
gc (digraph), in some languages
Gender critical, alternate term for Trans-exclusionary radical feminism
George Cross, the highest civil decoration of the United Kingdom
Glivenko–Cantelli theorem, in probability
Gigacycles per second (Gc), an older term for gigahertz
GC, the DIN code for pigment-coated, virgin mechanical pulp paperboard
General classification, the overall standing on time in multi-stage bicycle races
General contractor is sometimes abbreviated as this.
geocaching, a technology- |
https://en.wikipedia.org/wiki/Rudolf%20Bayer | Rudolf Bayer (born 3 March 1939) is a German computer scientist.
He is professor emeritus of Informatics at the Technical University of Munich where he had been employed since 1972. He is noted for inventing three data sorting structures: the B-tree (with Edward M. McCreight), the UB-tree (with Volker Markl) and the red–black tree.
Bayer is a recipient of 2001 ACM SIGMOD Edgar F. Codd Innovations Award. In 2005 he was elected as a fellow of the Gesellschaft für Informatik.
References
External links
Technical University of Munich page
1939 births
Living people
German computer scientists
Academic staff of the Technical University of Munich
Database researchers
Officers Crosses of the Order of Merit of the Federal Republic of Germany
Grainger College of Engineering alumni |
https://en.wikipedia.org/wiki/Ashton-Tate | Ashton-Tate Corporation was a US-based software company best known for developing the popular dBASE database application and later acquiring Framework from the Forefront Corporation and MultiMate from Multimate International. It grew from a small garage-based company to become a multinational corporation. Once one of the "Big Three" software companies, which included Microsoft and Lotus, the company stumbled in the late 1980s and was sold to Borland in September 1991.
History
The history of Ashton-Tate and dBASE are intertwined and as such, must be discussed in parallel.
Early history: dBASE II (1981–1983)
In 1978, Martin Marietta programmer Wayne Ratliff wrote Vulcan, a database application, to help him make picks for football pools. Written in Intel 8080 assembly language, it ran on the CP/M operating system and was modeled on JPLDIS, a Univac 1108 program used at JPL and written by fellow programmer Jeb Long. Ashton-Tate was launched as a result of George Tate and Hal Lashlee having discovered Vulcan from Ratliff in 1981 and licensing it (Ashton was Tate's after-the-fact parrot, whose cage was kept in his Culver City office) The original agreement was written on one page, and called for simple, generous royalty payments to Ratliff.
Tate and Lashlee had already built three successful start-up companies by this time: Discount Software (whose president was Ron Dennis, and was one of the first companies to sell PC software programs through the mail to consumers), Software Distributors (CEO Linda Johnson / Mark Vidovich) and Software Center International, the first U.S. software store retail chain, with stores in 32 states. (Glenn Johnson was co-founder along with Tate & Lashlee. SCI was later sold to Wayne Green Publishing.)
Vulcan was sold by SCDP Systems. The founders needed to change the name of the software, because Harris Corporation already had an operating system called Vulcan. Hal Pawluk, who worked for their advertising agency, suggested "dBASE", including the capitalisation. He also suggested that the first release of the product "II" would imply that it was already in its second version, and therefore would be perceived as being more reliable than a first release. The original manual was too complex from Pawluk's perspective, so he wrote a second manual, which was duly included in the package along with the first. Pawluk created the name for the new publishing company by combining George's last name with the fictional Ashton surname, purportedly because it was felt that "Ashton-Tate" sounded better, or was easier to pronounce, than "Lashlee-Tate".
dBASE II had an unusual guarantee. Customers received a crippleware version of the software and a separate, sealed disk with the full version; they could return the unopened disk for a refund within 30 days. The guarantee likely persuaded many to risk purchasing the $700 application. In 1981 the founders hired David C. Cole to be the chairman, president and CEO of their group of comp |
https://en.wikipedia.org/wiki/Framework%20%28office%20suite%29 | Framework, launched in 1984, was an office suite to run on the (x86) IBM PC and compatibles with the MS-DOS operating system.
Unlike other integrated products, Framework was not created as "plug-in" modules with a similar look and feel, but as a single windowing workspace representing a desktop metaphor that could manage and outline "Frames" sharing a common underlying format.
Framework could be considered a predecessor to the present graphical user interface window metaphor: it was the first all-in-one package to run on any PC platform to offer a GUI, WYSIWYG typography on the display and printer output, as well as integrated interpreters.
History
Background
ValDocs, an even earlier integrated suite, and actually comparable to the original Macintosh of 1984 and Apple Lisa of 1982, was produced by Epson, a complete integrated work station that ran on the previous-generation Zilog Z80 CPU and CP/M operating system, with a graphical user interface (GUI) and "WYSIWYG" typography on the monitor and printing. Despite several iterations, ValDocs was too slow on the hardware that it was released on.
A few months before Framework, its close rival Lotus Symphony was released.
Framework offered all of the above ValDocs' functionality in the first all-in-one package to run on any PC platform.
Programmers at Work credits Robert Carr as the designer and principal developer of Framework.
Forefront Corporation
Robert Carr and Marty Mazner founded Forefront Corporation to develop Framework in 1983. In July of that year, they approached Ashton-Tate to provide the capital and to later market the product. Together with a team of six other individuals, Carr and company released the original Framework.
The initial release of Framework included about a dozen or so frame types (identified by a FRED function, @frametype). Frame types included containers which could be filled up with other frames, empty frames which could become other type of frames based on user input, formulas embedded in them or program output targeting them, word processor frames, flat-database frames and spreadsheet as well as graphic frames.
The product proved successful enough, that in 1985, Ashton-Tate bought Forefront a year sooner than planned.
Ashton-Tate era
The original team, now working for Ashton-Tate, continued to enhance the product.
Later Framework versions included a frame type that can hold compiled executable code.
Beginning with Framework II (1985), the company also produced the Framework II Runtime and the Framework II Developer's Toolkit. These products allowed application developers to create business applications using the built-in FRED programming language.
Novel MHS Electronic Mail was integrated into Framework and a MailBox cabinet was added to the desktop.
Framework III was produced in 1988–1989, and in 1991, Framework IV emerged as the last Ashton-Tate-released version.
Although Ashton-Tate humorously advertised, that "Lotus uses Framework", Framework fa |
https://en.wikipedia.org/wiki/Windows%207 | Windows 7 is a major release of the Windows NT operating system developed by Microsoft. It was released to manufacturing on July 22, 2009, and became generally available on October 22, 2009. It is the successor to Windows Vista, released nearly three years earlier. Windows 7's server counterpart, Windows Server 2008 R2, was released at the same time. Windows 7 remained an operating system for use on personal computers, including home and business desktops, laptops, tablet PCs and media center PCs, and itself was replaced in November 2012 by Windows 8, the name spanning more than three years of the product.
Extended support ended on January 14, 2020, over ten years after the release of Windows 7, after which the operating system ceased receiving further updates. A paid support program was available for enterprises, providing security updates for Windows 7 for up to three years since the official end of life.
Windows 7 was intended to be an incremental upgrade to Microsoft Windows, addressing Windows Vista's poor critical reception while maintaining hardware and software compatibility. Windows 7 continued improvements on the Windows Aero user interface with the addition of a redesigned taskbar that allows pinned applications, and new window management features. Other new features were added to the operating system, including libraries, the new file-sharing system HomeGroup, and support for multitouch input. A new "Action Center" was also added to provide an overview of system security and maintenance information, and tweaks were made to the User Account Control system to make it less intrusive. Windows 7 also shipped with updated versions of several stock applications, including Internet Explorer 8, Windows Media Player, and Windows Media Center.
Unlike Windows Vista, Windows 7 received critical acclaim, with critics considering the operating system to be a major improvement over its predecessor because of its improved performance, its more intuitive interface, fewer User Account Control popups, and other improvements made across the platform. Windows 7 was a major success for Microsoft; even before its official release, pre-order sales for the operating system on the online retailer Amazon.com had surpassed previous records. In just six months, over 100 million copies had been sold worldwide, increasing to over 630 million licenses by July 2012. By January 2018, Windows 10 surpassed Windows 7 as the most popular version of Windows worldwide. , 3.5% of traditional PCs running Windows are running Windows 7. Windows 11 has recently taken second place from Windows 7 as the most popular Windows edition on all continents. It still remains popular, and is second most popular in countries such as China.
Windows 7 is the final version of Windows that supports processors without SSE2 or NX (although an update released in 2018 dropped support for non-SSE2 processors). Its successor, Windows 8, requires a processor with SSE2 and NX in any supported archi |
https://en.wikipedia.org/wiki/Adult%20Swim | Adult Swim (stylized as [adult swim] since 2003 and also abbreviated as [as]) is a programming block broadcast by the American basic cable channel Cartoon Network during the evening, prime time, and late-night dayparts. The block features stylistically varied animated and live-action series targeting an adult audience including original programming (particularly comedies and action series), syndicated series, and short films with generally minimal or no editing for content. Adult Swim is programmed by Williams Street, a subsidiary of Warner Bros. Television Studios that also produces much of the block's original programming.
First broadcast on September 2, 2001, Adult Swim has frequently aired animated sitcoms, adult animation features, mockumentaries, sketch comedy, and pilots, with many of its programs being aesthetically experimental, transgressive, improvised, and surrealist in nature. Adult Swim has contracted with various studios known for their productions in absurd and shock comedy. In addition to comedy, Adult Swim also broadcasts Japanese anime and American action animation, and since May 2012 this type of programming has generally been aired on its Saturday night Toonami block, which itself is a relaunch of the original block of the same name that ran on Cartoon Network from March 1997 to September 2008.
Adult Swim initially ran in the late night hours. It began to expand into prime time in 2008, and moved its start time to 8:00 p.m. ET/PT in 2014. To take advantage of young adult viewership of Cartoon Network in the daypart, Adult Swim expanded further to 7:00 p.m. on weekdays and Saturdays beginning in May 2023. After experiencing success with the changes, Adult Swim announced that it would further expand to 5:00 p.m. which began on August 28, 2023, signing on with a block named "Checkered Past" in which features Cartoon Network original series primarily from the 1990s and 2000s on weekdays.
Due to its differing demographics, Adult Swim is usually promoted by Warner Bros. Discovery Networks as being a separate network time-sharing with Cartoon Network on its channel allotment, with its viewership being measured separately by Nielsen from the youth-oriented daytime and afternoon programming carried under the Cartoon Network branding.
History
Creation and development (1994–2001)
Cartoon Network's original head programmer, Mike Lazzo, conceived Adult Swim. The block grew out of Cartoon Network's previous attempts at airing content appropriate for adults who might be watching the channel after 11 pm (ET/PT). The network began experimenting with its late-night programming by airing anthology shows that presented uncensored classic cartoon shorts, such as ToonHeads, The Bob Clampett Show, The Tex Avery Show, Late Night Black and White, and O Canada. Another block, Toonami's "Midnight Run", aired the network's action programming uncut with minimal edits. At that time, one third of Cartoon Network's audience were adults.
During the 1 |
https://en.wikipedia.org/wiki/Andrew%20Viterbi | Andrew James Viterbi (born Andrea Giacomo Viterbi, March 9, 1935) is an Italian Jewish–American electrical engineer and businessman who co-founded Qualcomm Inc. and invented the Viterbi algorithm. He is the Presidential Chair Professor of Electrical Engineering at the University of Southern California's Viterbi School of Engineering, which was named in his honor in 2004 in recognition of his $52 million gift.
Early life
Viterbi was born to an Italian Jewish family in Bergamo, Italy and emigrated with them to the United States two years before World War II. His original name was Andrea, but when he was naturalized in the US, his parents anglicized it to Andrew.
Education
Viterbi attended the Boston Latin School, and then entered Massachusetts Institute of Technology (MIT) in 1952, studying electrical engineering. He received both BS and MS in electrical engineering in 1957 from MIT. He was elected to membership in the honor society Eta Kappa Nu in 1956 through the MIT chapter.
He worked at Raytheon and later at Jet Propulsion Laboratory (JPL) in Pasadena, California, where he started working on telemetry for uncrewed space missions, also helping to develop the phase-locked loop. Simultaneously, he was carrying out PhD studies at the University of Southern California, where he graduated in 1963 in digital communications.
Career
After receiving his PhD, he applied successfully for an academic position at University of California, Los Angeles (UCLA).
Viterbi was later a professor of electrical engineering at UCLA and University of California, San Diego (UCSD). In 1967 he proposed the Viterbi algorithm to decode convolutionally encoded data. It is still used widely in cellular phones for error correcting codes, as well as for speech recognition, DNA analysis, and many other applications of Hidden Markov models. On advice of a lawyer, Viterbi did not patent the algorithm.
Viterbi also helped to develop the Code Division Multiple Access (CDMA) standard for cell phone networks.
Viterbi was the cofounder of Linkabit Corporation, with Irwin M. Jacobs in 1968, a small telecommunications contractor. He was also the co-founder of Qualcomm Inc. with Jacobs in 1985. , he is the president of the venture capital company The Viterbi Group. He continues to be involved in wireless communications technology companies as a strategic advisor to Ingenu's board of directors.
Virterbi was elected a member of the National Academy of Engineering in 1978. In 1998 he was one of the few receiving a Golden Jubilee Award for Technological Innovation from the IEEE Information Theory Society. Viterbi earned it for "the invention of the Viterbi algorithm". In 2002, Viterbi dedicated the Andrew Viterbi '52 Computer Center at his alma mater, Boston Latin School. On March 2, 2004, the University of Southern California School of Engineering was renamed the Viterbi School of Engineering in his honor, following his $52 million donation to the school. He is a member of the |
https://en.wikipedia.org/wiki/Highways%20in%20Greece | The National Roads and Motorways in Greece constitute the main road network of the country. These two types of roads are distinct in terms of their construction specifications. Their main difference is that motorways (Greek: Αυτοκινητόδρομοι) adhere to higher quality construction standards than National Roads (Greek: Εθνικές Οδοί).
For example, a typical motorway (highway) in Greece consists of six or four lanes (three or two lanes in each direction) plus an emergency lane, separated by a central barrier. Entrances and exits to the motorways are only provided at grade-separated junctions (interchanges) and there are no traffic lights. Greek motorways are generally organized so that the odd-numbered motorways are of north-south alignment and the even-numbered motorways are of east-west alignment. However, there are many exceptions.
A typical National Road in Greece is usually a single carriageway or limited-access road with at-grade intersections and with one or two traffic lanes for each direction, usually with an emergency lane on each side as well. The designation of some important roads of Greece as "national" was first decided by a 1955 decree, while a minister's decision in 1963 determined the numbering of these roads. In 1998, a survey of the Hellenic Statistical Authority defined some new national roads that were constructed after the 1963 decision.
The naming system of motorways and National Roads is different. For example, "A2" refers to the Egnatia Odos motorway, while "GR-2" refers to National Road 2. All motorways are named by using the capital letter "A", followed by a number (e.g. A1). The main motorways of Greece have a single digit number and auxiliary motorways perpendicular to the main ones have a double digit number (e.g. A25). Motorways have their own white-on-green signs, while National Roads are designated by white-on-blue signs.
The construction of the Greek motorway network has been, to a large extent, a very complex and demanding project due to the peculiarities of the geomorphology of the areas through which the new roads pass. The Greek mainland is extremely mountainous; the local topography as well as environmental concerns regarding the local flora and fauna played a decisive role in the final route design. In order to overcome these difficulties, the construction of multiple large and expensive technical works, such as tunnels and bridges, was necessary in many cases. Indicatively, the total number of tunnels built along the four Greek major highways (A1, A2, A5, A8) is about 150 and their total length is about 200 km (measured as a single bore).
With a total length of about 2320 km as of 2020, Greece's motorway network is the biggest one in Southeastern Europe and one of the most advanced in Europe.
Motorways
Greece's motorway network has been extensively modernized throughout the 2000s and part of it is still under construction. Most of it was completed by early 2017. There are a total of 10 main routes thro |
https://en.wikipedia.org/wiki/WB | WB, Wb, or wb may refer to:
Businesses and organizations
Warner Bros., a large American film and television company
The WB, an American television network from 1995 to 2006
WB Channel, an Indian channel from Warner Bros
RwandAir, a Rwandan airline whose International Air Transport Association code is "WB"
Wachovia, an American banking chain whose former New York Stock Exchange IP was "WB"
W.B. Mason, an American office supply company
World Balance, a Filipino shoe company
World Bank Group, an international finance organization
World Bowling, the international governing body for nine-pin and ten-pin bowling
Whataburger, a speed-food restaurant chain in the southern United States from Florida to Arizona
WildBlue, an American satellite internet service provider
Waagner-Biro, an Austrian company
Wild Bunch (company), a film financer from France
The World Bank, an international financial institution that provides loans and grants to governments of low- and middle-income countries
Places
West Bengal, a state in eastern India, whose ISO abbreviation is "IN-WB"
West Bank of the river Jordan, a disputed region in the Middle East
West Brighton, a neighborhood on the North Shore of Staten Island, colloquially termed "the WB" or "the West"
Science
Weber (unit) (Wb), the SI unit of magnetic flux
Western blot, a medical diagnosis tool
White balance, a technical term in color photography
Woronin body, a microbody in the hyphae of filamentous Ascomycota
Wörterbuch der ägyptischen Sprache, the standard dictionary of Ancient Egyptian, published 1926–1963, in bibliographies
Writeback, a procedure conducted by a computer cache
Wet bulb, a temperature definition
Weather band, a VHF frequency band used in North America
Sport
Waasland-Beveren, Belgian football club
Warmbloods, a group of middle-weight horse types and breeds, primarily originating in Europe
Western Bulldogs, an Australian rules football club
Wing-back (association football), a position in association football
Other
Wikibooks, a Wikimedia project |
https://en.wikipedia.org/wiki/YAML | YAML () (see ) is a human-readable data serialization language. It is commonly used for configuration files and in applications where data is being stored or transmitted. YAML targets many of the same communications applications as Extensible Markup Language (XML) but has a minimal syntax which intentionally differs from Standard Generalized Markup Language (SGML). It uses both Python-style indentation to indicate nesting, and a more compact format that uses for lists and for maps but forbids tab characters to use as indentation thus only some JSON files are valid YAML 1.2.
Custom data types are allowed, but YAML natively encodes scalars (such as strings, integers, and floats), lists, and associative arrays (also known as maps, dictionaries or hashes). These data types are based on the Perl programming language, though all commonly used high-level programming languages share very similar concepts. The colon-centered syntax, used for expressing key-value pairs, is inspired by electronic mail headers as defined in , and the document separator is borrowed from MIME (). Escape sequences are reused from C, and whitespace wrapping for multi-line strings is inspired by HTML. Lists and hashes can contain nested lists and hashes, forming a tree structure; arbitrary graphs can be represented using YAML aliases (similar to XML in SOAP). YAML is intended to be read and written in streams, a feature inspired by SAX.
Support for reading and writing YAML is available for many programming languages. Some source-code editors such as Vim, Emacs, and various integrated development environments have features that make editing YAML easier, such as folding up nested structures or automatically highlighting syntax errors.
The official recommended filename extension for YAML files has been since 2006.
History and name
YAML (, rhymes with camel) was first proposed by Clark Evans in 2001, who designed it together with Ingy döt Net and Oren Ben-Kiki. Originally YAML was said to mean Yet Another Markup Language, because it was released in an era that saw a proliferation of markup languages for presentation and connectivity (HTML, XML, SGML, etc). Its initial name was intended as a tongue-in-cheek reference to the technology landscape, referencing its purpose as a markup language with the yet another construct, but it was then repurposed as YAML Ain't Markup Language, a recursive acronym, to distinguish its purpose as data-oriented, rather than document markup.
Versions
Design
Syntax
A cheat sheet and full specification are available at the official site. The following is a synopsis of the basic elements.
YAML accepts the entire Unicode character set, except for some control characters, and may be encoded in any one of UTF-8, UTF-16 or UTF-32. (Though UTF-32 is not mandatory, it is required for a parser to have JSON compatibility.)
Whitespace indentation is used for denoting structure; however, tab characters are not allowed as part of that indentation.
Comm |
https://en.wikipedia.org/wiki/Nyquist | Nyquist may refer to:
Nyquist (surname)
Nyquist (horse), winner of the 2016 Kentucky Derby
Nyquist (programming language), computer programming language for sound synthesis and music composition
See also
Johnson–Nyquist noise, thermal noise
Nyquist stability criterion, in control theory
Nyquist plot, signal processing and electronic feedback
Nyquist–Shannon sampling theorem, fundamental result in the field of information theory
Nyquist frequency, digital signal processing
Nyquist rate, telecommunication theory
Nyquist ISI criterion, telecommunication theory
6625 Nyquist, a main-belt asteroid
Nyquist filter, a filter used in television systems
Enquist
Nyqvist (disambiguation) |
https://en.wikipedia.org/wiki/Gyeongbu%20Expressway | The Gyeongbu Expressway (; Gyeongbu Gosokdoro) (Asian Highway Network ) is the second oldest and most heavily travelled expressway in South Korea, connecting Seoul to Suwon, Daejeon, Gumi, Daegu, Gyeongju, Ulsan and Busan. It has the route number 1, signifying its role as South Korea's most important expressway. The entire length from Seoul to Busan is and the posted speed limit is , enforced primarily by speed cameras.
History
Inspired by the Autobahn during a trip to Germany, South Korean President Park Chung Hee proposed the construction of the Gyeongbu Expressway as an election pledge in 1967.
February 1968 - Construction begins at the behest of South Korean President Park Chung Hee, who named Park Myung-keun in charge of construction.
21 December 1968 - Seoul-Suwon segment opens to traffic.
30 December 1968 - Suwon-Osan segment opens to traffic.
29 September 1969 - Osan-Cheonan segment opens to traffic.
10 December 1969 - Cheonan-Daejeon segment opens to traffic.
19 December 1969 - Busan-Daegu (via Gyeongju) segment opens to traffic.
7 July 1970 - The last segment, the mountainous Daejeon-Daegu segment, opens to traffic, completing South Korea's first long-distance limited access expressway.
December 1987 - Work begins to widen to six lanes in selected areas. Some areas are widened to 8 or 10 lanes by 1996.
February 1995 - Bus-only lane (essentially an HOV-9) established between the northern terminus and Sintanjin for important holidays.
14 July 2000 - Eight vehicles, including three buses and a five-ton truck, collide near Gimcheon, killing 18 and injuring over 100.
25 August 2001 - All expressways in South Korea reorganize under a pattern modeled after the United States' Interstate Highway System. The Gyeongbu Expressway's route number of 1 is the only one not to change; however, its kilometer markers change from a north–south progression to south–north.
December 2002 - Korea National Expressway Corporation passes control of the northernmost 9 km stretch of expressway (between Yangjae and Hannam Bridge) to the City of Seoul.
1 July 2008 - Bus lane enforcement between Seoul and Osan (Sintanjin on weekends) becomes daily between 6 AM and 10 PM. On 1 October this is adjusted to 7 AM to 9 PM weekdays, 9 AM to 9 PM weekends.
Compositions
Speed limit
Cheonan JC ~ Yangjae IC : 110 km/h
Guseo IC ~ Cheonan JC : 100 km/h
List of facilities
IC: Interchange, JC: Junction, SA: Service Area, TG: Tollgate
Gyeongbu Urban Expressway
In the past, this section was a part of Gyeongbu Expressway, but in 2002 the Seoul Metropolitan Government has takes control of this segment from Korea Expressway Corporation. As a results, this expressway became a part of Seoul Special Metropolitan Route 06. However, the name remains the same, on Traffic Broadcasting System, it is still called Gyeongbu Expressway or the name "Sigugan", and this section is also designated as Asian Highway 1.
Main stopovers
Seoul
Seocho District - Gangnam District |
https://en.wikipedia.org/wiki/GSA | GSA may refer to:
Commerce
Citroën GSA, a French automobile
GameSpy Arcade, a utility for use with network computer games
General sales agent, an airline sales representative
Global mobile Suppliers Association, a not-for-profit industry organisation representing companies across the worldwide mobile ecosystem
Global Sourcing Association, a trade association in the United Kingdom
Google Search Appliance, a device for document indexing
Gordon Stanfield Animation, a Canadian animation studio
Education
Gay–straight alliance, a North American student organization
German Scholars Agency, in Cambridge, Massachusetts, United States
German Studies Association, an organization of scholars of Germany, Austria, and Switzerland
Girls' Schools Association, in the United Kingdom
Graduate student assistant
Graduate student association
Green Schools Alliance, in the United States
Schools
Gaiety School of Acting, in Dublin, Ireland
German School of Athens, in Greece
Gitam School of Architecture, at Gitam University, in Visakhapatnam, India
Glasgow School of Art, in Scotland
Governor's School for the Arts (Kentucky), in Danville, Kentucky, United States
Guildford School of Acting, in England
Guyana School of Agriculture
Government
European GNSS Agency, an agency of the European Union
General Services Administration, a United States federal agency
Ghana Standards Authority
Groupement Spécial Autonome, now the Army Special Forces Brigade, French Army special forces command
Science
Genetic sexual attraction
Genetics Society of America
General somatic afferent fibers
Geological Society of America
Geological Society of Australia
Gerontological Society of America
GNAS complex locus, a protein
Other uses
Gaudineer Scenic Area, in West Virginia, United States
Gaye Su Akyol, Turkish singer, painter and anthropologist
Girl Scouts of America, defunct
Global Storage Architecture, a distributed file system
Goan Sports Association, in Mumbai, India
Long Pasia Airport, in Malaysia
Global Semiconductor Alliance |
https://en.wikipedia.org/wiki/Bucharest%20Metro | The Bucharest Metro () is an underground rapid transit system that serves Bucharest, the capital of Romania. It first opened for service on 16 November 1979. The network is run by Metrorex. One of two parts of the larger Bucharest public transport network, Metrorex has an average of approximately 720,000 passenger trips per weekday (as of 2018), compared to the 1,180,000 daily riders on Bucharest's STB transit system. In total, the Metrorex system is long and has 64 stations.
History
The first proposals for a metro system in Bucharest were made in the early part of the 20th century, by the Romanian engineers Dimitrie Leonida and Elie Radu.
The earliest plans for a Bucharest Metro were drafted in the late 1930s, alongside the general plans for urban modernization of the city. The outbreak of World War II, followed by periods of political tensions culminating with the installation of communism, put an end to the plans.
By 1970, the public transport system (ITB) was no longer adequate due to the fast pace of urban development, although the system was the fourth-largest in Europe. A commission was set up, and its conclusion pointed to the necessity of an underground transit system that would become the Bucharest Metro. The plan for the first line was approved on 25 November 1974 as part of the next five-year plan and the construction on the new metro system started on 20 September 1975.
The network was not built in the same style as other Eastern European systems. Firstly, the design of the stations on the initial lines was simple, clean-cut modern, without excessive additions such as mosaics, awkward lighting sources or elaborate and ornate decoration. The main function of the stations was speed of transit and practicality. Secondly, the trainsets themselves were all constructed in Romania and did not follow the Eastern European style of construction. Each station usually followed a colour theme (generally white – in Unirii 2, Victoriei 1, Lujerului; but also light blue – in Obor, Universitate, and Gara de Nord; orange – in Tineretului; green – in Grozăvești), and an open plan. No station was made to look exactly like any other. Despite this, many stations are rather dark, due to the policies of energy economy in the late 1980s, with later modernisations doing little to fix this problem. Bucharest being one of the largest cities in the region, the network is larger than those of Prague or Budapest. When the planned new line-extensions are finished, they will increase the system length to more than , with about 80 stations.
The first line, M1, opened on 19 November 1979, running from Semănătoarea (now Petrache Poenaru) to Timpuri Noi. It had a length of with 6 stations. Following this, more lines and several extensions were opened:
28 December 1981: M1 Timpuri Noi – Republica; , 6 stations
19 August 1983: M1 (now M3) Branch line Eroilor – Industriilor (now Preciziei) ; , 4 stations (Gorjului added later)
22 December 1984: M1 Semănătoare |
https://en.wikipedia.org/wiki/Versatile%20Real-Time%20Executive | Versatile Real-Time Executive (VRTX) is a real-time operating system (RTOS) developed and marketed by the company Mentor Graphics. VRTX is suitable for both traditional board-based embedded systems and system on a chip (SoC) architectures. It has been superseded by the Nucleus RTOS.
History
The VRTX operating system began as a product of Hunter & Ready, a company founded by James Ready and Colin Hunter in 1980 which later became Ready Systems. This firm later merged with Microtec Research in 1993, and went public in 1994. This firm was then acquired by Mentor Graphics in 1995 and VRTX became a Mentor product.
The VRTX operating system was released in September 1981.
Since the 1980s, the chief rival to VRTX has been VxWorks, a Wind River Systems product. VxWorks had its start in the mid 1980s as compiler and assembly language tools to supplement VRTX, named VRTX works, or VxWorks. Later, Wind River created their own real-time kernel offering similar to VRTX.
VRTX
VRTX comes in several flavors:
VRTX: 16-bit VRTX, for Z8000, 8086, etc.
VRTX-32: 32-bit VRTX, for M68K, AMD29K, etc.
MPV: Multiprocessor VRTX for distributed applications, such as distributed across VME backplanes.
VRTX-mc: Micro-Controller VRTX, for small systems needing minimal memory use.
VRTX-oc: On-chip VRTX, freeware community source code for personal and academic use, license required for commercial use.
VRTX-sa: Scalable Architecture VRTX for full operating system features. Loosely based on Carnegie Mellon University's Mach microkernel principles.
SPECTRA: Virtual machine (VM) implementation for running a VRTX VM on Unix-like hosts. Also includes an open integrated development environment allowing third-party tools open access to cross-development resources.
Most companies developing software with VRTX use reduced instruction set computer (RISC) microprocessors including ARM, MIPS, PowerPC, or others.
Implementations
VRTX runs the Hubble Space Telescope.
VRTX runs the Wide Area Augmentation System.
VRTX was the first operating system ported to the AMD Am29000.
VRTX is used as a core for the Motorola proprietary operating system, which runs on most company devices since the Motorola V60 and T280i, up to the Motorola RAZR2 V9x. It runs on several hardware platforms including LTE (Motorola V300, V500, V600, E398, RAZR V3 and others featuring the ARM7 processor), LTE2 (Motorola L7 and upcoming devices with 176x220 screen resolution), Rainbow POG (3G phones featuring an MCORE processor from Motorola E1000 to RAZR V3x), Argon (all new 3G phones with 532 MHz ARM11 processor since Motorola RAZR MAXX V6, and V3xx), and others.
See also
List of telescope parts and construction
Xenomai is a real-time development software framework cooperating with the Linux kernel. It could be used to port the VRTX based system to Linux although not all features are supported.
VRTX has reached end-of-life, an automated porting tool named OS Changer is available to reuse the code on a m |
https://en.wikipedia.org/wiki/Locomotive%20BASIC | Locomotive Basic is a proprietary dialect of the BASIC programming language written by Locomotive Software on the Amstrad CPC (where it was built-in on ROM) and the later Locomotive BASIC-2 as a GEM application on the Amstrad PC1512 and 1640. It was the main descendant of Mallard BASIC, the interpreter for CP/M supplied with the Amstrad PCW.
There are two versions of Locomotive BASIC: 1.0 which only came with the CPC model 464, and 1.1 which shipped with all other versions. BASIC 1.1 was also shipped with the Amstrad CPC Plus series machines, as part of the included game cartridge.
Development
Development was based on existing work recently undertaken writing Mallard BASIC for Acorn Computers Z80 addon for the BBC Micro. It is reported to have taken around 12 weeks to enhance the existing code, and was "very influenced" by BBC BASIC, though adding additional functions to do things that would have required assembly language on the BBC.
Features
It was a rather simple but powerful BASIC implementation by the standards of the day, featuring dedicated commands for handling graphics (such as DRAW, PLOT, INK, and PAPER in all versions; plus FILL in v1.1), even allowing the creation of multiple screens, windows, and the like, although the color system and palette handling was awkward. A table giving the numeric codes for the 27 system colors was printed over the built-in 3" disk drive casing on the 664 and later machines. Simple as it was, it did stand out however among other BASICs of the time by offering a timer-based software interrupt mechanism using the EVERY or AFTER commands; this offered a timed repeating or one-off call respectively to the BASIC line number of the user's choice.
Also, when compared to other home computers of the time, the Amstrad via Locomotive BASIC granted a relatively high level of control over the CPC sound chip, an AY-3-8912 with 3 melodic channels and 1 noise channel. The same chip was also used on late-model ZX Spectrums, as well as the Atari ST and MSX computers, but none of those had such a complete built-in SOUND command. Many things, from selecting a particular channel or a combination of channels, setting envelopes, volume, pitch, noise, and so on could be done with a single SOUND command, with up to 7 parameters. Granted, especially complex and/or low-level techniques could not be done with BASIC due to their requiring more precise or direct access to the hardware, e.g. especially complex music from trackers (including simulated chords using arpeggios, etc.), the playback of digitally sampled sounds as in the game RoboCop for example, and so on.
Disk, tape, and file management were managed by BASIC itself, and were usually good enough for simple file management, with commands such as GET, PUT, ERASE, SAVE, MERGE, RUN, CAT, LOAD etc. In fact, during those years, the BASIC supplied as standard with most low-cost home computers also acted as a more or less simple operating system.
Also available were some spe |
https://en.wikipedia.org/wiki/MSX%20BASIC | MSX BASIC is a dialect of the BASIC programming language. It is an extended version of Microsoft's MBASIC Version 4.5, adding support for graphic, music, and various peripherals attached to MSX microcomputers. Generally, MSX BASIC is designed to follow GW-BASIC, released the same year for IBM PCs and clones. During the creation of MSX BASIC, effort was made to make the system flexible and expandable.
Distribution
MSX BASIC came bundled in the ROM of all MSX computers. At system start-up MSX BASIC is invoked, causing its command prompt to be displayed, unless other software placed in ROM takes control (which is the typical case of game cartridges and disk interfaces, the latter causing the MSX-DOS prompt to be shown if there is a disk present which contains the DOS system files).
When MSX BASIC is invoked, the ROM code for BIOS and the BASIC interpreter itself are visible on the lower 32K of the Z80 addressing space. The upper 32K are set to RAM, of which about 23K to 28K are available for BASIC code and data (the exact amount depends on the presence of disk controller and on the MSX-DOS kernel version).
Development Environment
MSX BASIC development environment is very similar to other versions of Microsoft BASIC. It has a command line-based Integrated Development Environment (IDE) system; all program lines must be numbered, all non-numbered lines are considered to be commands in direct mode (i.e., to be executed immediately). The user interface is entirely command-line-based.
Versions of MSX BASIC
Every new version of the MSX computer was bundled with an updated version of MSX BASIC. All versions are backward compatible and provide new capabilities to fully explore the new and extended hardware found on the newer MSX computers.
MSX BASIC 1.0
Bundled with MSX1 computers
16 KB in size
No native support for floppy disk requiring the Disk BASIC cartridge extension (4 KB overhead)
Support for all available screen modes:
Screen 0 (text mode 40 x 24 characters)
Screen 1 (mixed text mode 32 x 24 characters, sprites and colored custom characters)
Screen 2 (high resolution graphic mode 256 x 192 pixels, 16 colors)
Screen 3 (low resolution graphic mode 64×48 - 4×4 pixel blocks over the screen 2 resolution)
Full support for hardware sprites and interrupt-driven automatic collision detection
Full support for the General Instruments AY-3-8910 Programmable Sound Generator (PSG)
Note that the Brazilian MSX "clones" by Sharp and Gradiente show other versions of MSX BASIC (on the Sharps even called HOT-BASIC), but they're basically just unlicensed MSX BASIC 1.0.
MSX BASIC 2.0 / 2.1
Bundled with MSX2 computers
32 KB in size (First 16 KB directly available, second 16 KB in other slot and has to be paged in/out for usage)
Added support for new available screen modes, including graphic modes with 212 progressive or 424 interlaced lines:
Updated Screen 0 (text mode 80 x 24)
Screen 5 (graphic mode 256 x 212/424 pixels, 16 colors out of 512)
|
https://en.wikipedia.org/wiki/The%20Joe%20Schmo%20Show | The Joe Schmo Show is a reality television hoax show created by Paul Wernick and Rhett Reese. The series was broadcast in the U.S. on the cable network Spike. The show's premise is that a target person or people are led to believe that they are contestants on a reality television show; in reality, all of the other participants in the purported show – including the host – are actors, and their actions and the outcome of the purported show are all scripted in an attempt to elicit comedic reactions from the targets. The show's first season, The Joe Schmo Show, aired in 2003, and its second season, Joe Schmo 2, aired in 2004. The first season's hoax was conducted as a typical reality competition show while the second hoax was a Bachelor-like dating series.
On December 10, 2012, Spike announced it was bringing The Joe Schmo Show back for a third season, which premiered on January 8, 2013.
The only constant presence in all three Joe Schmo seasons has been voice actor Ralph Garman, who has served as the "emcee" for all three editions (playing a smarmier caricature of himself in the first, a pompous British man in the second, and a bounty hunter in the third). The team behind the show also created reality television hoax show Invasion Iowa.
On May 17, 2023, TBS announced that it would revive The Joe Schmo Show with Cat Deeley as host, which is set to premiere in 2024.
Episodes
The Joe Schmo Show (2003)
The target of season one was Mt. Lebanon, Pennsylvania native Matt Kennedy Gould. The other "contestants" are archetypes of common reality TV show participants.
Two actors made brief appearances in supporting roles: Ryan Raddatz played Molly's boyfriend, William (who feigned shock at seeing her in a bikini), and Steve Ireland played David Decker, a "network executive" who negotiated with Gould to finish the "Meal Not Quite Fit for a King" challenge.
For the hoax, the producers named the faux-reality show Lap of Luxury, with a $100,000 top prize "awarded" to the "winner." Perhaps in an attempt to keep things as close to actual reality shows as possible, at the end of every episode an eviction ceremony was conducted in which each contestant voted to evict someone, and the person with the most votes was eliminated. After the written finish was executed, the actor in question would take a plate with their face painted on it and give it to Garman, who would then state a rhyming couplet that went "Ashes to ashes, dust to dust, (name), you're dead to us" then throw the plate into the fireplace, breaking it. In the final episode, the three remaining "players" (in this case Gould, "Brian", and "Hutch") faced a final vote from the evicted "houseguests" (similar to the final Tribal Council on Survivor), with the one getting the most votes "winning".
The show experienced an unexpected shift during an early episode. Earl ("the Veteran") had bonded with Gould. When Earl was "voted" off the show, Gould began to weep and question his possible monetary gain at |
https://en.wikipedia.org/wiki/Sabis | Sabis may refer to:
SABIS, global school network
Battle of the Sabis
The river Sambre (Sabis in Latin)
Sabis Vallis, valley on Mars named after the river Sabis
See also
The Sword of Knowledge, a trilogy of fantasy novels the first of which is called A Dirge for Sabis |
https://en.wikipedia.org/wiki/Content-addressable%20memory | Content-addressable memory (CAM) is a special type of computer memory used in certain very-high-speed searching applications. It is also known as associative memory or associative storage and compares input search data against a table of stored data, and returns the address of matching data.
CAM is frequently used in networking devices where it speeds up forwarding information base and routing table operations. This kind of associative memory is also used in cache memory. In associative cache memory, both address and content is stored side by side. When the address matches, the corresponding content is fetched from cache memory.
History
Dudley Allen Buck invented the concept of content-addressable memory in 1955. Buck is credited with the idea of recognition unit.
Hardware associative array
Unlike standard computer memory, random-access memory (RAM), in which the user supplies a memory address and the RAM returns the data word stored at that address, a CAM is designed such that the user supplies a data word and the CAM searches its entire memory to see if that data word is stored anywhere in it. If the data word is found, the CAM returns a list of one or more storage addresses where the word was found. Thus, a CAM is the hardware embodiment of what in software terms would be called an associative array.
A similar concept can be found in the data word recognition unit, as proposed by Dudley Allen Buck in 1955.
Standards
A major interface definition for CAMs and other network search engines was specified in an interoperability agreement called the Look-Aside Interface (LA-1 and LA-1B) developed by the Network Processing Forum. Numerous devices conforming to the interoperability agreement have been produced by Integrated Device Technology, Cypress Semiconductor, IBM, Broadcom and others. On December 11, 2007, the OIF published the serial look-aside (SLA) interface agreement.
Semiconductor implementations
CAM is much faster than RAM in data search applications. There are cost disadvantages to CAM, however. Unlike a RAM chip, which has simple storage cells, each individual memory bit in a fully parallel CAM must have its own associated comparison circuit to detect a match between the stored bit and the input bit. Additionally, match outputs from each cell in the data word must be combined to yield a complete data word match signal. The additional circuitry increases the physical size and manufacturing cost of the CAM chip. The extra circuitry also increases power dissipation since every comparison circuit is active on every clock cycle. Consequently, CAM is used only in specialized applications where searching speed cannot be accomplished using a less costly method. One successful early implementation was a General Purpose Associative Processor IC and System.
In the early 2000s several semiconductor companies including Cypress, IDT, Netlogic, Sibercore, and MOSAID introduced CAM products targeting networking applications. These products |
https://en.wikipedia.org/wiki/Host%20adapter | In computer hardware, a host controller, host adapter, or host bus adapter (HBA), connects a computer system bus, which acts as the host system, to other network and storage devices. The terms are primarily used to refer to devices for connecting SCSI, SAS, NVMe, Fibre Channel and SATA devices. Devices for connecting to FireWire, USB and other devices may also be called host controllers or host adapters.
Host adapters can be integrated in the motherboard or be on a separate expansion card.
The term network interface controller (NIC) is more often used for devices connecting to computer networks, while the term converged network adapter can be applied when protocols such as iSCSI or Fibre Channel over Ethernet allow storage and network functionality over the same physical connection.
SCSI
A connects a host system and a peripheral SCSI device or storage system. These adapters manage service and task communication between the host and target. Typically a device driver, linked to the operating system, controls the host adapter itself.
In a typical parallel SCSI subsystem, each device has assigned to it a unique numerical ID. As a rule, the host adapter appears as SCSI ID 7, which gives it the highest priority on the SCSI bus (priority descends as the SCSI ID descends; on a 16-bit or "wide" bus, ID 8 has the lowest priority, a feature that maintains compatibility with the priority scheme of the 8-bit or "narrow" bus).
The host adapter usually assumes the role of SCSI initiator, in that it issues commands to other SCSI devices.
A computer can contain more than one host adapter, which can greatly increase the number of SCSI devices available.
Major SCSI adapter manufacturers are HP, ATTO Technology, Promise Technology, Adaptec, and LSI Corporation. LSI, Adaptec, and ATTO offer PCIe SCSI adapters which fit in Apple Mac, on Intel PCs, and low-profile motherboards which lack SCSI support due to the inclusion of SAS and/or SATA connectivity.
Fibre Channel
The term host bus adapter (HBA) may be used to refer to a Fibre Channel interface card. In this case, it allows devices in a Fibre Channel storage area network to communicate data between each otherit may connect a server to a switch or storage device, connect multiple storage systems, or connect multiple servers. Fibre Channel HBAs are available for open systems, computer architectures, and buses, including PCI and SBus (obsolete today).
Each Fibre Channel HBA has a unique World Wide Name (WWN), which is similar to an Ethernet MAC address in that it uses an OUI assigned by the IEEE. However, WWNs are longer (8 bytes). There are two types of WWNs on a HBA; a node WWN (WWNN), which is shared by all ports on a host bus adapter, and a port WWN (WWPN), which is unique to each port. There are HBA models of different speeds: 1Gbit/s, 2Gbit/s, 4Gbit/s, 8Gbit/s, 10Gbit/s, 16Gbit/s, 20Gbit/s and 32Gbit/s.
The major Fibre Channel HBA manufacturers are QLogic and Broadcom. As of mid-2009, these vendo |
https://en.wikipedia.org/wiki/SASI%20%28software%29 | SASI (Schools Administrative Student Information) or SASI Student Information System was a computer program developed by Jerry D. Lloyd of Educational Timesharing Systems, who was acquired by National Computer Systems (NCS) and NCS was acquired by Pearson in 1997. The cross-platform system provides administrators and educators with access to student demographics, attendance, schedules, discipline, grades, extended test histories, and state reporting codes. Features of SASI include SASIxp, InteGrade Pro, classroomXP, and Parent Access. In 2003, more than 16,000 schools nationwide used the software.
It was classified as end of life in 2011 by Pearson.
External links
Official website
References
School-administration software |
https://en.wikipedia.org/wiki/Seagate%20Technology | Seagate Technology Holdings plc is an American data storage company. It was incorporated in 1978 as Shugart Technology and commenced business in 1979. Since 2010, the company has been incorporated in Dublin, Ireland, with operational headquarters in Fremont, California, United States.
Seagate developed the first 5.25-inch hard disk drive (HDD), the 5-megabyte ST-506, in 1980. They were a major supplier in the microcomputer market during the 1980s, especially after the introduction of the IBM XT in 1983. Much of their growth has come through their acquisition of competitors. In 1989, Seagate acquired Control Data Corporation's Imprimis division, the makers of CDC's HDD products. Seagate acquired Conner Peripherals in 1996, Maxtor in 2006, and Samsung's HDD business in 2011. Today, Seagate, along with its competitor Western Digital, dominates the HDD market.
History
Founding as Shugart Technology
Seagate Technology (then called Shugart Technology) was incorporated on November 1, 1978, and commenced operations with co-founders Al Shugart, Tom Mitchell, Doug Mahon, Finis Conner, and Syed Iftikar in October 1979. The company came into being when Conner approached Shugart with the idea of starting a new company to develop 5.25-inch HDDs which Conner predicted would be a coming economic boom in the disk drive market. The name was changed to Seagate Technology to avoid a lawsuit from Xerox's subsidiary Shugart Associates (also founded by Shugart).
Early history and Tom Mitchell era
The company's first product, the ST-506, with a storage capacity of 5 megabytes (MB), was released in 1980. It was the first hard disk to fit the 5.25-inch form factor of the Shugart mini-floppy drive. It used a Modified Frequency Modulation (MFM) encoding and was later released in a 10 MB version, the ST-412. With this, Seagate secured a contract as a major OEM supplier for the IBM XT, IBM's first personal computer to contain a hard disk. The large volumes of units sold to IBM fueled Seagate's early growth. In their first year, Seagate shipped $10 million worth of units to consumers. By 1983, the company shipped over 200,000 units for revenues of $110 million.
In 1983, Al Shugart was replaced as president by then chief operating officer, Tom Mitchell, in order to move forward with corporate restructuring in the face of a changing market. Shugart continued to oversee corporate planning. By this point, the company had a 45% market share of the single-user hard drive market, with IBM purchasing 60% of the total business Seagate was doing at the time.
In 1989, Seagate acquired Imprimis Technology, the disk storage division of Control Data Corporation, resulting in a combined market share of 43%. Seagate benefited from Imprimis' head technology and reputation while Imprimis gained access to Seagate's lower component and manufacturing costs.
Second Al Shugart era (1990s)
In September 1991, Tom Mitchell resigned as president under pressure from the board of directors, with |
https://en.wikipedia.org/wiki/VRTX | VRTX may refer to:
Versatile Real-Time Executive, a real-time operating system
Vertex Pharmaceuticals (Nasdaq stock symbol)
PowerEdge VRTX, a computer hardware product line from Dell |
https://en.wikipedia.org/wiki/Trampoline%20%28computing%29 | In computer programming, the word trampoline has a number of meanings, and is generally associated with jump instructions (i.e. moving to different code paths).
Low-level programming
Trampolines (sometimes referred to as indirect jump vectors) are memory locations holding addresses pointing to interrupt service routines, I/O routines, etc. Execution jumps into the trampoline and then immediately jumps out, or bounces, hence the term trampoline. They have many uses:
Trampoline can be used to overcome the limitations imposed by a central processing unit (CPU) architecture that expects to always find vectors in fixed locations.
When an operating system is booted on a symmetric multiprocessing (SMP) machine, only one processor, the bootstrap processor, will be active. After the operating system has configured itself, it will instruct the other processors to jump to a piece of trampoline code that will initialize the processors and wait for the operating system to start scheduling threads on them.
High-level programming
As used in some Lisp implementations, a trampoline is a loop that iteratively invokes thunk-returning functions (continuation-passing style). A single trampoline suffices to express all control transfers of a program; a program so expressed is trampolined, or in trampolined style; converting a program to trampolined style is trampolining. Programmers can use trampolined functions to implement tail-recursive function calls in stack-oriented programming languages.
Continuation-passing style is a popular intermediate format for compilers of functional languages, because many control flow constructs can be elegantly expressed and tail call optimization is easy. When compiling to a language without optimized tail calls, one can avoid stack growth via a technique called trampolining. The idea is to not make the final continuation call inside the function, but to exit and to return the continuation to a trampoline. That trampoline is simply a loop that invokes the returned continuations. Hence, there are no nested function calls and the stack won’t grow.
In Java, trampoline refers to using reflection to avoid using inner classes, for example in event listeners. The time overhead of a reflection call is traded for the space overhead of an inner class. Trampolines in Java usually involve the creation of a GenericListener to pass events to an outer class.
In Mono Runtime, trampolines are small, hand-written pieces of assembly code used to perform various tasks.
When interfacing pieces of code with incompatible calling conventions, a trampoline is used to convert the caller's convention into the callee's convention.
In embedded systems, trampolines are short snippets of code that start up other snippets of code. For example, rather than write interrupt handlers entirely in assembly language, another option is to write interrupt handlers mostly in C, and use a short trampoline to convert the assembly-language interrupt calling conventi |
https://en.wikipedia.org/wiki/COFF | The Common Object File Format (COFF) is a format for executable, object code, and shared library computer files used on Unix systems. It was introduced in Unix System V, replaced the previously used a.out format, and formed the basis for extended specifications such as XCOFF and ECOFF, before being largely replaced by ELF, introduced with SVR4.
COFF and its variants continue to be used on some Unix-like systems, on Microsoft Windows (Portable Executable), in UEFI environments and in some embedded development systems.
History
The original Unix object file format a.out is unable to adequately support shared libraries, foreign format identification, or explicit address linkage. As development of Unix-like systems continued both inside and outside AT&T, different solutions to these and other issues emerged.
COFF was introduced in 1983, in AT&T's UNIX System V for non-VAX 32-bit platforms such as the 3B20. Improvements over the existing AT&T a.out format included arbitrary sections, explicit processor declarations, and explicit address linkage.
However, the COFF design was both too limited and incompletely specified: there was a limit on the maximum number of sections, a limit on the length of section names, included source files, and the symbolic debugging information was incapable of supporting real world languages such as C, much less newer languages like C++, or new processors. All real world implementations of COFF were necessarily violations of the standard as a result. This led to numerous COFF extensions. IBM used the XCOFF format in AIX; DEC, SGI and others used ECOFF; and numerous SysV ports and tool chains targeting embedded development each created their own, incompatible, variations.
With the release of SVR4, AT&T replaced COFF with ELF.
While extended versions of COFF continue to be used for some Unix and Unix-like platforms, primarily in embedded systems, perhaps the most widespread use of the COFF format today is in Microsoft's Portable Executable (PE) format. Developed for Windows NT, the PE format (sometimes written as PE/COFF) uses a COFF header for object files, and as a component of the PE header for executable files.
Features
COFF's main improvement over a.out was the introduction of multiple named sections in the object file. Different object files could have different numbers and types of sections.
Symbolic debugging information
The COFF symbolic debugging information consists of symbolic (string) names for program functions and variables, and line number information, used for setting breakpoints and tracing execution.
Symbolic names are stored in the COFF symbol table. Each symbol table entry includes a name, storage class, type, value and section number. Short names (8 characters or fewer) are stored directly in the symbol table; longer names are stored as an offset into the string table at the end of the COFF object.
Storage classes describe the type entity the symbol represents, and may include external variables |
https://en.wikipedia.org/wiki/Sapphire%20%26%20Steel | Sapphire & Steel is a British television supernatural sci-fi/fantasy series starring Joanna Lumley as Sapphire and David McCallum as Steel. Produced by ATV, it ran from 1979 to 1982 on the ITV network. The series was created by Peter J. Hammond who conceived the programme under the working title The Time Menders, after a stay in an allegedly haunted castle. Hammond also wrote all the stories except for the fifth, which was co-written by Don Houghton and Anthony Read.
From 2005 to 2008, Sapphire & Steel returned in a series of audio dramas produced by Big Finish Productions, starring Susannah Harker and David Warner as the titular Steel and Sapphire.
Series overview
Premise
The opening credits include the narration that "All irregularities will be handled by the forces controlling each dimension. Transuranic heavy elements may not be used where there is life. Medium atomic weights are available: Gold, Lead, Copper, Jet, Diamond, Radium, Sapphire, Silver and Steel. Sapphire and Steel have been assigned." In the sixth and final assignment, Lead was replaced with Mercury in the opening credits.
The programme centres on a pair of interdimensional operatives, the eponymous Sapphire and Steel. Very little is revealed about their purposes or backgrounds in the course of the series but they appear to be engaged in guarding the continuing flow of time. They are two of multiple elements that assume human form and are sent to investigate strange events; others include Lead (Val Pringle), who takes the aspect of a jovial, friendly giant, and Silver (David Collings), a technician who can melt metals in his hands.
In the series, it is explained that Time is like a progressing corridor that surrounds everything, but there are weak spots where Time – implied to be a malignant force – can break into the present and take things. There are also creatures from the beginnings and ends of time that roam the corridor looking for the same weak spots to break through.
These breaks are most often triggered by the presence of something old in a modern situation, for example a traditional nursery rhyme, an old photograph, or a house decorated with antiques. Holding onto something of the past opposes progress and allows 'Time' to break into the present – the more old things present, the easier it is for this to occur (such as is seen in episode 1 where the two-century-old house is full of clocks and other antiques in which a traditional nursery rhyme has been read hundreds of times as a bedtime story). When this breaking-in of 'Time' occurs, Investigators will be sent to assess the situation and then, if intervention is warranted, Operators are assigned to deal with the problem by a mysterious unseen authority, to be assisted by Specialists if necessary.
Each adventure usually starts with Sapphire and Steel simply showing up, seemingly out of nowhere, although sometimes they are already present when the story begins. They will then investigate and mingle with various |
https://en.wikipedia.org/wiki/Pragma | Pragma, an abbreviation for pragmatic, or from the same root, may refer to:
, the Ancient Greek word; see pragmatism
Directive (programming), also known as a pragma or pragmat in several programming languages
#pragma once
Pragma (love), a model of love
Pragma (periodical), a 1980's publication for Pick operating system users |
https://en.wikipedia.org/wiki/MindWrite | MindWrite is word processor software for early Macintosh computers running classic Mac OS. It was released in 1986 by MindWork Software, making it among the earliest 3rd party word processors on the platform. It was later distributed by Access Technologies, who then transferred their Mac software to a spinoff, DeltaPoint. Sales continued with DeltaPoint at least into the early 1990s.
The key feature of MindWrite was its integrated outliner, a system that allowed documents to be organized in a hierarchy and then re-arranged with drag-and-drop operations. After the release of the pioneering ThinkTank, such systems were considered to be a new way to organize knowledge and perform workflows. MindWrite was the first program to cleanly integrate an outliner with a word processor. and this generated considerable press for the product. The system was otherwise fairly simple in terms of style and layout options and initially lacked a spell checker, issues that were always noted in reviews. Additionally, it was very slow.
An outliner was added to Microsoft Word version 3. When Microsoft began offering software bundles for the Mac, sales of alternative solutions slowed. The product changed hands several times before going dormant in the 1990s. It cannot be used on Macintosh systems higher than 7.0.
History
Cary Wyman and Dennis Moncrief formed AthenaSoft to produce Icon Review, an early mail order catalog of software for the recently-released Macintosh. The ultimate goal was to build up a client base which they would then use as the basis for marketing their own software. The program was first advertised as MultiWrite in Icon Review's Summer catalog, which arrived in June. However, the program was not ready at this point, and did not ship until 20 November 1986, which led to "a huge number of complaints."
This arrangement with AthenaSoft worked for a time, but as work on MindWrite continued it proved too difficult to manage and Wyman split off MindWork Software in 1987. Looking for a distributor, in late 1987 MindWork was purchased by Access Technologies, a minicomputer software vendor whose primary product was a spreadsheet program known as 20/20. Access felt that it needed to shift into the microcomputer market as the power of these platforms grew. This led Access to purchase both MindWork and Data Taylor, creators of the Mac spreadsheet Trapeze.
Not long after, Access decided to wind up operations entirely and began looking for potential purchasers. They spun out their Mac products under the DeltaPoint name in order to simplify the offering. The remaining minicomputer portion was purchased by Computer Associates. DeltaPoint continued on its own, using sales of MindWrite and Trapeze to fund the development of a new program, DeltaGraph. DeltaGraph would go on to be a best-seller and continues to be offered through a new developer. Wyman later developed a new word processor for the Mac, Taste, which DeltaPoint distributed in the early 1990s.
Descript |
https://en.wikipedia.org/wiki/Tierra%20%28computer%20simulation%29 | Tierra is a computer simulation developed by ecologist Thomas S. Ray in the early 1990s in which computer programs compete for time (central processing unit (CPU) time) and space (access to main memory). In this context, the computer programs in Tierra are considered to be evolvable and can mutate, self-replicate and recombine. Tierra's virtual machine is written in C. It operates on a custom instruction set designed to facilitate code changes and reordering, including features such as jump to template (as opposed to the relative or absolute jumps common to most instruction sets).
Simulations
The basic Tierra model has been used to experimentally explore in silico the basic processes of evolutionary and ecological dynamics. Processes such as the dynamics of punctuated equilibrium, host-parasite co-evolution and density-dependent natural selection are amenable to investigation within the Tierra framework. A notable difference between Tierra and more conventional models of evolutionary computation, such as genetic algorithms, is that there is no explicit, or exogenous fitness function built into the model. Often in such models there is the notion of a function being "optimized"; in the case of Tierra, the fitness function is endogenous: there is simply survival and death.
According to Thomas S. Ray and others, this may allow for more "open-ended" evolution, in which the dynamics of the feedback between evolutionary and ecological processes can itself change over time (see evolvability), although this claim has not been realized – like other digital evolution systems, it eventually reaches a point where novelty ceases to be created, and the system at large begins either looping or ceases to 'evolve'. The issue of how true open-ended evolution can be implemented in an artificial system is still an open question in the field of artificial life.
Mark Bedau and Norman Packard developed a statistical method of classifying evolutionary systems and in 1997, Bedau et al. applied these statistics to Evita, an Artificial life model similar to Tierra and Avida, but with limited organism interaction and no parasitism, and concluded that Tierra-like systems do not exhibit the open-ended evolutionary signatures of naturally evolving systems.
Russell K. Standish has measured the informational complexity of Tierran 'organisms', and has similarly not observed complexity growth in Tierran evolution.
Tierra is an abstract model, but any quantitative model is still subject to the same validation and verification techniques applied to more traditional mathematical models, and as such, has no special status. The creation of more detailed models in which more realistic dynamics of biological systems and organisms are incorporated is now an active research field (see systems biology).
See also
Avida
Digital organism
Digital organism simulator
Evolutionary computation
Fitness landscape
References
Further reading
Bentley, Peter, J. 2001, "Digital Biology:Ho |
https://en.wikipedia.org/wiki/Computer%20scientist | A computer scientist is a scholar who specializes in the academic study of computer science.
Computer scientists typically work on the theoretical side of computation. Although computer scientists can also focus their work and research on specific areas (such as algorithm and data structure development and design, software engineering, information theory, database theory, theoretical computer science, numerical analysis, programming language theory, compiler, computer graphics, computer vision, robotics, computer architecture, operating system), their foundation is the theoretical study of computing from which these other fields derive.
A primary goal of computer scientists is to develop or validate models, often mathematical, to describe the properties of computational systems (processors, programs, computers interacting with people, computers interacting with other computers, etc.) with an overall objective of discovering designs that yield useful benefits (faster, smaller, cheaper, more precise, etc.).
Education
Most computer scientists are required to possess a PhD, M.S., Bachelor's degree in computer science, or other similar fields like Information and Computer Science (CIS), or a closely related discipline such as mathematics or physics.
Areas of specialization
Theoretical computer science – including data structures and algorithms, theory of computation, information theory and coding theory, programming language theory, and formal methods
Computer systems – including computer architecture and computer engineering, computer performance analysis, concurrency, and distributed computing, computer networks, computer security and cryptography, and databases.
Computer applications – including computer graphics and visualization, human–computer interaction, scientific computing, and artificial intelligence.
Software engineering – the application of engineering to software development in a systematic method
Employment
Computer scientists are often hired by software publishing firms, scientific research and development organizations where they develop the theories that allow new technologies to be developed. Computer scientists are also employed by educational institutions such as universities.
Computer scientists can follow more practical applications of their knowledge, doing things such as software engineering. They can also be found in the field of information technology consulting, and may be seen as a type of mathematician, given how much of the field depends on mathematics. Computer scientists employed in industry may eventually advance into managerial or project leadership positions.
Employment prospects for computer scientists are said to be excellent. Such prospects seem to be attributed, in part, to very rapid growth in computer systems design and related services industry, and the software publishing industry, which are projected to be among the fastest growing industries in the U.S. economy.
See also
Computational scientist
|
https://en.wikipedia.org/wiki/MCM/70 | The MCM/70 was a pioneering microcomputer first built in 1973 in Toronto, Ontario, Canada and released the next year. This makes it one of the first microcomputers in the world, the second to be shipped in completed form, and the first portable computer. The MCM/70 was the product of Micro Computer Machines, one of three related companies set up in Toronto in 1971 by Mers Kutt. It is considered by some historians to be the first usable personal microcomputer system.
Early history
Kutt, a professor of mathematics at Queen's University in Kingston, Ontario during the late 1960s, noted that the efficiency of computer users there was hampered by the long wait times involved in submitting programs in punched card form for batch processing by a shared mainframe computer. In 1968, Kutt and Donald Pamenter started a firm, Consolidated Computer Inc., and began to produce a data-entry device named Key-Edit. This was a low-cost terminal, with a one-line display device, which bypassed the need for keypunching.
In 1971, Kutt, no longer part of CCI, began planning a machine to support software development in the recently developed programming language APL. APL was best programmed using a custom keyboard and these were very rare at the time. He initially named his design the Key-Cassette; similar in design and concept to Key-Edit, it would offer editing ability and support for either two cassette decks or one cassette and an acoustic coupler to upload programs to other machines.
The original design resembled a desktop electronic calculator. Kutt's notes of the era showed his intent to use the cover and display from an extant calculator with a modified power supply, to include a small keyboard with 32 keys, and a display made of either 13 or 15 segmented LEDs. Kutt also created a company, Micro Computer Machines, which would later manufacture the devices.
Development
Through his acquaintance with Intel founder Robert Noyce, Kutt had been following Intel's work on the 1201, an 8-bit microprocessor later renamed the Intel 8008. The processor was scheduled to be complete in late 1971, but its release was delayed until spring. In December 1971, Kutt incorporated a technology development company, Kutt Systems. He signed an agreement with Intel to supply an Intel 4004, a SIM4- 01 development system, supporting chips from the MCS-4 chipset, and an MP7-01 EPROM programmer to his new company. This equipment was used for early development work until the 8008 was available.
Kutt hired programmer Gord Ramer, and the two began work on developing Kutt's concept. In May 1972, Kutt Systems received one of the earliest SIM8-01 kits. The team, now including hardware engineer José Laraya, software engineer André Arpin, and two APL programmers, Don Genner and Morgan Smyth, started to build what was then termed the M/C, for microcomputer. By then, the design had expanded to include a complete keyboard, a chiclet design similar to the ones used on early models of the Commodo |
https://en.wikipedia.org/wiki/Danny%20Hillis | William Daniel Hillis (born September 25, 1956) is an American inventor, entrepreneur, and computer scientist, who pioneered parallel computers and their use in artificial intelligence. He founded Thinking Machines Corporation, a parallel supercomputer manufacturer, and subsequently was Vice President of Research and Disney Fellow at Walt Disney Imagineering.
Hillis was elected a member of the National Academy of Engineering in 2001 for advances in parallel computers, parallel software, and parallel storage.
More recently, Hillis co-founded Applied Minds, and Applied Invention, an interdisciplinary group of engineers, scientists, and artists. He is a visiting professor at the MIT Media Lab.
Biography
Early life and academic work
Born September 25, 1956, in Baltimore, Maryland, Danny Hillis spent much of his childhood living overseas, in Europe, Africa, and Asia.
He attended the Massachusetts Institute of Technology (MIT) and received his bachelor of science in mathematics in 1978. As an undergraduate, he worked at the MIT Logo Laboratory under the tutelage of Seymour Papert, developing computer hardware and software for children. During this time, he also designed computer-oriented toys and games for the Milton Bradley Company. While still in college, he co-founded Terrapin Inc., a producer of computer software, including Logo, for elementary schools.
As a graduate student at the MIT Computer Science and Artificial Intelligence Laboratory, Hillis designed tendon-controlled robot arms and a touch-sensitive robot "skin".
During his college years, Hillis was part of the team that built a computer composed entirely of Tinkertoys, currently at the Computer History Museum in Mountain View, California.
At MIT, Hillis began to study Artificial Intelligence under Marvin Minsky. In 1981, he proposed building a massively parallel computer for Artificial Intelligence, consisting of a million processors, each similar to a modern Graphics Processing Unit. This work culminated in the design of a massively parallel computer with 64,000 processors. He named it the Connection Machine, and it became the topic of his PhD, for which he received the 1985 Association for Computing Machinery Doctoral Dissertation award. Hillis earned his doctorate as a Hertz Foundation Fellow at the Massachusetts Institute of Technology, under the supervision of Marvin Minsky, Claude Shannon and Gerald Sussman, receiving his PhD in 1988. He later served as an adjunct professor at the MIT Media Lab, where he wrote The Pattern on the Stone.
Technology career
Hillis has founded a number of technology companies, including Thinking Machines Corporation, Applied Minds, Metaweb Technologies, Applied Proteomics, and Applied Invention. Hillis has over 300 issued patents in fields including parallel computers, touch interfaces, disk arrays, forgery prevention methods, electronic and mechanical devices, and bio-medical techniques, RAID disk arrays, multicore multiprocessors and for worm |
https://en.wikipedia.org/wiki/True%20Names | True Names is a 1981 science fiction novella by American writer Vernor Vinge, a seminal work of the cyberpunk genre. It is one of the earliest stories to present a fully fleshed-out concept of cyberspace, which would later be central to cyberpunk. The story also contains elements of transhumanism.
True Names first brought Vinge to prominence as a science fiction writer. It also inspired many real-life hackers and computer scientists; a 2001 book about the novella, True Names: And the Opening of the Cyberspace Frontier, included essays by Danny Hillis, Marvin Minsky, Mark Pesce, Richard Stallman and others. It was a finalist for the Hugo and Nebula awards in 1982, and was awarded the Prometheus Hall of Fame Award in 2007.
Plot summary
The story follows the progress of a group of computer hackers (called "warlocks") who are early adopters of a new full-immersion virtual reality technology, called the "Other Plane". Warlocks penetrate computers around the world for personal profit or curiosity. They must keep their true identities ("True Names") secret even from each other and from the "Great Enemy", the United States government, as those who know a warlock's True Name can force him to work on their behalf, or cause a "True Death" by killing the warlock in real life.
The protagonist is a warlock known as "Mr. Slippery" in the Other Plane. The government learns Mr. Slippery's True Name—Roger Pollack, a holonovelist in Arcata, California—and forces him to investigate the Mailman, a mysterious new warlock which the government suspects of conducting a large-scale subversion of databases and networks. The Mailman has been recruiting others, such as the warlock DON.MAC, by promising great power in the real world, and claims to be responsible for a recent revolution in Venezuela. Because he communicates only through text, and reacts to events only after a significant delay, Mr. Slippery and fellow warlock Erythrina begin to suspect that the Mailman may be an extraterrestrial invader, subverting global databases to conquer the Earth while causing the True Deaths of the warlocks he recruits.
Mr. Slippery and Erythrina receive permission from the government to use the old ARPANET to access massive amounts of computational power around the world as they search for the Mailman. As they become the most powerful warlocks in history they realize that DON.MAC is a sophisticated "personality simulator" working for the Mailman. It violently defends itself, and both sides use network connections to military weaponry to attack in the real world. Erythrina is forced to reveal her True Name to Mr. Slippery as the battles, real and virtual, cause global chaos. They succeed in destroying the many copies of the Mailman's AI, and although tempted to keep their power over the world realize that they do not wish to be tyrants.
Ten weeks after the war and resulting worldwide economic depression from the disruptions in computer systems, Mr. Slippery returns to the Coven and |
https://en.wikipedia.org/wiki/Cherry%20picking | Cherry picking, suppressing evidence, or the fallacy of incomplete evidence is the act of pointing to individual cases or data that seem to confirm a particular position while ignoring a significant portion of related and similar cases or data that may contradict that position. Cherry picking may be committed intentionally or unintentionally.
The term is based on the perceived process of harvesting fruit, such as cherries. The picker would be expected to select only the ripest and healthiest fruits. An observer who sees only the selected fruit may thus wrongly conclude that most, or even all, of the tree's fruit is in a likewise good condition. This can also give a false impression of the quality of the fruit (since it is only a sample and is not a representative sample). A concept sometimes confused with cherry picking is the idea of gathering only the fruit that is easy to harvest, while ignoring other fruit that is higher up on the tree and thus more difficult to obtain (see low-hanging fruit).
Cherry picking has a negative connotation as the practice neglects, overlooks or directly suppresses evidence that could lead to a complete picture.
Cherry picking can be found in many logical fallacies. For example, the "fallacy of anecdotal evidence" tends to overlook large amounts of data in favor of that known personally, "selective use of evidence" rejects material unfavorable to an argument, while a false dichotomy picks only two options when more are available. Some scholars classify cherry-picking as a fallacy of selective attention, the most common example of which is the confirmation bias. Cherry picking can refer to the selection of data or data sets so a study or survey will give desired, predictable results which may be misleading or even completely contrary to reality.
History
A story about the 5th century BCE atheist philosopher Diagoras of Melos says how, when shown the votive gifts of people who had supposedly escaped death by shipwreck by praying to gods, he pointed out that many people had died at sea in spite of their prayers, yet these cases were not likewise commemorated. Michel de Montaigne (1533–1592) in his essay on prophecies comments on people willing to believe in the validity of supposed seers:
In science
Cherry picking is one of the epistemological characteristics of denialism and widely used by different science denialists to seemingly contradict scientific findings. For example, it is used in climate change denial, evolution denial by creationists, denial of the negative health effects of consuming tobacco products and passive smoking.
In medicine
In a 2002 study, a review of previous medical data found cherry picking in tests of anti-depression medication:
[researchers] reviewed 31 antidepressant efficacy trials to identify the primary exclusion criteria used in determining eligibility for participation. Their findings suggest that patients in current antidepressant trials represent only a minority of patients |
https://en.wikipedia.org/wiki/Lists%20of%20Spanish-language%20television%20channels | The following articles contain lists of Spanish-language television channels:
Television in Latin America
List of Mexican television networks
List of Spanish-language television networks in the United States
Television in Spain |
https://en.wikipedia.org/wiki/The%20Men%20Who%20Killed%20Kennedy | The Men Who Killed Kennedy is a video documentary series by British television network ITV that depicts the assassination of U.S. President John F. Kennedy on November 22, 1963. Originally broadcast in 1988 in two parts (with a subsequent studio discussion), it was rebroadcast in 1991 re-edited to three parts with additional material, and a fourth episode added in 1995. The addition of three further episodes in 2003 caused great controversy, particularly in the final episode implicating Lyndon B. Johnson and the withdrawal of these additional episodes.
Broadcast history and critical response
1988 to 2003
The Men Who Killed Kennedy began with two 50-minute segments originally aired on 25 October 1988 in the United Kingdom, entitled simply Part One and Part Two. The programmes were produced by Central Television for the ITV network, and was followed three weeks later with a studio discussion on the issues titled The Story Continues, chaired by broadcaster Peter Sissons.
The original broadcast was controversial in Britain. The episodes identified three men as the assassins of Kennedy: deceased drug trafficker Lucien Sarti and two living men (Roger Bocagnani and Sauveur Pironti). All three were later revealed to have strong alibis: Sarti was undergoing medical treatment in France, another was in prison at the time, and the third had been in the French Navy. One of the two living men threatened to sue, and Central Television's own subsequent investigation into the allegations revealed they were "total nonsense". Turner justified his failure to interview one of the accused on the grounds that the individual was "too dangerous". Turner was censured by the British Parliament. The Independent Broadcasting Authority forced Central Television to produce a third episode dedicated to the false allegations, which aired on November 16, 1988, which was later referred to as a "studio crucifixion" of Turner and his inaccuracies.
The United States corporation, Arts & Entertainment Company, purchased the rights to the original two segments. In 1989, the series was nominated for a Flaherty Documentary Award. In November 1991, the series was re-edited with additional material and divided into three 50-minute programmes, which were also shown by ITV on consecutive nights. An additional episode appeared in 1995. The series typically aired in November every year and from time to time during the year.
2003 onwards
In November 2003, three additional segments ("The Final Chapter") were added by the History Channel, entitled, respectively, "The Smoking Guns", "The Love Affair" and "The Guilty Men".
"The Smoking Guns" examines claims of changes to the procedures normally followed by the Secret Service on the day of the assassination, bullet damage to windshield of the president's limousine consistent with a bullet fired through it from the front, and discrepancies between observations made by the doctors who treated Kennedy at Parkland Hospital after the shooting and t |
https://en.wikipedia.org/wiki/MTV3 | MTV3 (, ) is a Finnish commercial television channel owned and operated by the media company MTV Oy, originally launched in 13 August 1957 as a programming block and it came to be launched on 1 January 1993 as its own channel. It had the biggest audience share of all Finnish TV channels until Yle TV1 (from Yle) took the lead. MTV is actually stand for Mainos-TV (literally "Advertisement-TV", i.e. "Commercial TV), due to the channel carrying advertising for revenue. Number 3 was added later, when the channel was allocated the third nationwide television channel and it generally became known as "Channel Three"—Finnish Broadcasting Company's Yle TV1 and Yle TV2 being the first two—and also to distinguish it from the later MTV Finland, which is a Finnish version of Paramount's MTV channel. From 1957 until 2001, the channel's logo was a stylised owl, changed to an owl's eye after an image renewal in 2001, which was then used until 2013. MTV3 has about 500 employees. It is also known as Maikkari (a slang of word "Mainos-TV").
History
Early years
Oy Mainos-TV-Reklam Ab, or MTV for short, was founded on 29 April 1957 with the idea of establishing a commercial television channel that would show advertisements between programmes. MTV was one of the earliest nationwide private television networks in Europe, preceded only by the ITV network in the United Kingdom and RTL in Luxembourg.
The project set out to lease programming blocks from Yleisradio (YLE), the public broadcaster, whose television project Suomen Televisio had already begun test broadcasts. Yleisradio was initially reluctant but eventually agreed in order to get additional revenue, which was required to produce programmes in order to compete with TES-TV. According to the initial agreement, MTV only got around ten hours a week of airtime, all outside the prime time and was not allowed to produce its own newscasts nor air party political broadcasts. MTV's first broadcast was on 13 August 1957.
During the early years, MTV was on shaky financial and political grounds. The company survived the troubles and by the early 1960s had begun to establish its position. As Yleisradio expanded the range of television broadcasts, MTV's coverage increased as well. This gave them a significant competitive edge over TES-TV, since renamed to Tesvisio, whose broadcasts could only be watched in some of the larger cities. In 1964, Yleisradio announced that they had purchased Tesvisio (who were nearing bankruptcy) outright and that they would launch a second channel reorganized from Tesvisio's assets. MTV expressed demands that the second channel be given to them, but Yleisradio refused any such attempts, agreeing however to give MTV more air time, even some prime time, on the second channel. TV-ohjelma 2 ("TV programme 2") launched on 7 March 1965, with Suomen Televisio renamed to TV-ohjelma 1 ("TV programme 1").
Even though YLE and MTV broadcast on the same two channels, they were effectively considered separa |
https://en.wikipedia.org/wiki/Fragmentation | Fragmentation or fragmented may refer to:
Computers
Fragmentation (computing), a phenomenon of computer storage
File system fragmentation, the tendency of a file system to lay out the contents of files non-continuously
Fragmented distribution attack, in computer security
IP fragmentation, a process in computer networking
Science
Fragmentation (cell biology), in cells
Fragmentation (reproduction), a form of asexual reproduction
Fragmentation of memory, a psychological disorder
Fragmentation (mass spectrometry), a technique to study structure of molecules
Fragmentation (weaponry), a feature of explosive weaponry
Fragmentation (medicine), an operation that breaks of solid matter in a body part into pieces, such as kidney stones
Fragmentation, the quantification by photoanalysis of blasted material
Hadronization, with quarks
Other
Fragmentation (economics), a process of globalization
Fragmentation (music), a compositional technique
Fragmentation (sociology), a term used in urban sociology
Feudal fragmentation, in European history
Habitat fragmentation, in an organism's preferred environment
Market fragmentation, the existence of multiple incompatible technologies in a single market segment
Population fragmentation, a form of population segregation
Fragmented (album), a 2006 album by band Up Dharma Down
Fragmentation function, a probability function
See also
Divergence
Fragment (disambiguation)
Separation (disambiguation) |
https://en.wikipedia.org/wiki/List%20of%20television%20stations%20in%20Sweden | This is a list of television channels that broadcast for a Swedish language audience.
Channels holding a broadcasting license for the terrestrial network are marked "(DTT)."
Public non-commercial networks
SVT
SVT1 (News) (DTT)
SVT2 (general) (DTT)
SVT24 (news, sports, reruns) (DTT)
SVT Barn (children) (DTT)
Kunskapskanalen (educational) (DTT)
The public television channels are mostly funded by a license fee and broadcast free-to-air.
SVT has 21 local news districts.
Swedish private commercial networks
These are privately owned television channels that are solely, or almost solely, directed at Sweden. Many such channels don't broadcast from Sweden, but nevertheless target a Swedish audience.
TV4 is the only commercial channel ever to have broadcast nationally in the Swedish analogue terrestrial network, but the arrival of digital terrestrial television saw the TV4 monopoly on commercial television broken.
TV4 AB
TV4 (general entertainment) (DTT) (HD)
Sjuan (general entertainment) (DTT)
TV12 (DTT) (HD)
TV4 Film (movies) (DTT)
TV4 Fakta (documentaries) (DTT)
TV4 Guld ("classic" programming)
Viaplay Group
TV3 (general entertainment) (DTT) (HD)
TV6 (entertainment) (DTT) (HD)
TV8 (news and documentaries) (DTT)
TV10 (sport and documentaries) (DTT)
V Sport 1 (HD)
V Sport Football (HD)
V Sport Hockey
Warner Bros. Discovery Nordic
Kanal 5 (entertainment) (DTT) (HD)
Kanal 9 (entertainment) (DTT) (HD)
Kanal 11 (entertainment, formerly TV400) (DTT)
Discovery Channel Sweden (documentaries) (DTT)
TLC Sweden (lifestyle) (DTT)
Paramount Networks EMEAA
MTV Europe (music/entertainment) (DTT)
MTV 00s (DTT)
Nickelodeon Sweden (children) (DTT)
Nick Jr. (DTT)
Nicktoons (DTT)
Other
Axess TV (culture and information) - owned by Axel och Margaret Ax:son Johnsons stiftelse för allmännyttiga ändamål (DTT)
Regional terrestrial channels:
Kanal 12 (DTT)
Pan-Nordic channels
These channels mostly target the Nordic countries. Most channels carry subtitles and/or audio in Swedish.
Viaplay Group
V Film Premiere (movies) (HD)
V Film Action (HD) - previously known as Cinema
V Film Hits (HD)
V Film Family (HD)
V Series (HD)
V Sport Golf (HD)
V Sport Hockey (HD)
V Sport Live
V Sport Motor (HD)
V Sport Ultra (HD)
Viasat World
Viasat History (documentaries) (HD)
Viasat Nature (documentaries) (HD)
Viasat Explore (documentaries) (HD)
TV4 Group
TV4 Hits (HD) (DTT, partial)
TV4 Stars
TV4 Sportkanalen
TV4 Fotboll (DTT, partial) (HD)
TV4 Motor
TV4 Hockey (DTT, partial)
TV4 Tennis
TV4 Sport Live 1 (DTT, partial)
TV4 Sport Live 2
TV4 Sport Live 3
TV4 Sport Live 4
SF-kanalen
Warner Bros. Discovery Europe
Animal Planet HD, Swedish subtitles
Animal Planet Nordic, Swedish subtitles (DTT)
Cartoonito (Nordic), Swedish audio
Cartoon Network Nordic, Swedish audio (DTT, partial)
Eurosport 1, Swedish audio (DTT)
Eurosport 2, Swedish audio (DTT)
NBCUniversal International Networks/Paramount Networks EMEAA
Sky Showtime 1, Swedish subtitles
Sky Showtime 2, Swedish subtitles
BBC Stu |
https://en.wikipedia.org/wiki/KoalaPad | The KoalaPad is a graphics tablet, released in 1983 by U.S. company Koala Technologies Corporation, for the Apple II, TRS-80 Color Computer (as the TRS-80 Touch Pad), Atari 8-bit family, and Commodore 64, as well as for the IBM PC.
Originally designed by Dr. David Thornburg as a low-cost computer drawing tool for schools, the Koala Pad and the bundled drawing program, KoalaPainter, was popular with home users as well. KoalaPainter was called KoalaPaint in some versions for the Apple II, and PC Design for the IBM PC. A program called Graphics Exhibitor was included for creating slideshow presentations from KoalaPainter drawings.
Description
The pad was four inches square (i.e. roughly 10×10 cm) and mounted on a slightly inclined base with the back of the pad higher than the front. At the top, "behind" the pad, were two buttons. The pad hooked into the computer using the analog signals of the joystick ports (the so-called paddle inputs), which meant that it had a low resolution and tended to jostle the cursor if moved during use.
As an alternative to the drawing stylus, the pad could as easily be operated by the user's fingers for tasks that demanded less precision, such as selecting between menu items (thus using the pad as a kind of "indirect touch screen").
The top-mounted buttons tended to be somewhat frustrating to use, as the user had to "reach around" the stylus to push the buttons in order to start or stop drawing. A similar tablet from Atari, the Atari CX77 Touch Tablet, addressed this with a built-in button on the stylus, which some enterprising users adapted for use with their KoalaPad.
KoalaPainter
The pad shipped with a simple bitmap graphics editor developed by Audio Light, Inc called KoalaPainter, PC Design or Micro Illustrator depending on the target machine (see release history). Although bundled with the pad, KoalaPainter could also be operated using an ordinary digital joystick.
One unique feature of the program, for its time, was that it held two pictures in the computer's memory, allowing the user to flip from one to the other—a function commonly used in order to study the differences between an original and a modified picture, and to copy and paste between two different pictures.
Some third-party bitmap editors could also be used with the KoalaPad, such as Broderbund's Dazzle Draw for the Apple II.
Release history
KoalaPainter for Commodore 64 (1983) and Atari 8-bit computers (1983)
PC Design for the IBM PC (1983)
Micro Illustrator for the Apple II (1983), Atari 8-bit computers (1983) and Commodore Plus/4 (1984)
KoalaPainter II for Commodore 64 (1984)
Reception
Ahoy! called KoalaPainter "a very powerful and effective color drawing package", and concluded that it and the KoalaPad were "excellent in ease of use, a fine choice for a beginner as well as young children". BYTEs reviewer stated in December 1984 that he made far fewer errors when using an Apple Mouse with MousePaint than with a KoalaPad and its software. H |
https://en.wikipedia.org/wiki/Toom%E2%80%93Cook%20multiplication | Toom–Cook, sometimes known as Toom-3, named after Andrei Toom, who introduced the new algorithm with its low complexity, and Stephen Cook, who cleaned the description of it, is a multiplication algorithm for large integers.
Given two large integers, a and b, Toom–Cook splits up a and b into k smaller parts each of length l, and performs operations on the parts. As k grows, one may combine many of the multiplication sub-operations, thus reducing the overall computational complexity of the algorithm. The multiplication sub-operations can then be computed recursively using Toom–Cook multiplication again, and so on. Although the terms "Toom-3" and "Toom–Cook" are sometimes incorrectly used interchangeably, Toom-3 is only a single instance of the Toom–Cook algorithm, where k = 3.
Toom-3 reduces 9 multiplications to 5, and runs in Θ(nlog(5)/log(3)) ≈ Θ(n1.46). In general, Toom-k runs in , where , ne is the time spent on sub-multiplications, and c is the time spent on additions and multiplication by small constants. The Karatsuba algorithm is equivalent to Toom-2, where the number is split into two smaller ones. It reduces 4 multiplications to 3 and so operates at Θ(nlog(3)/log(2)) ≈ Θ(n1.58). Ordinary long multiplication is equivalent to Toom-1, with complexity Θ(n2).
Although the exponent e can be set arbitrarily close to 1 by increasing k, the function c grows very rapidly. The growth rate for mixed-level Toom–Cook schemes was still an open research problem in 2005. An implementation described by Donald Knuth achieves the time complexity .
Due to its overhead, Toom–Cook is slower than long multiplication with small numbers, and it is therefore typically used for intermediate-size multiplications, before the asymptotically faster Schönhage–Strassen algorithm (with complexity ) becomes practical.
Toom first described this algorithm in 1963, and Cook published an improved (asymptotically equivalent) algorithm in his PhD thesis in 1966.
Details
This section discusses exactly how to perform Toom-k for any given value of k, and is a simplification of a description of Toom–Cook polynomial multiplication described by Marco Bodrato. The algorithm has five main steps:
Splitting
Evaluation
Pointwise multiplication
Interpolation
Recomposition
In a typical large integer implementation, each integer is represented as a sequence of digits in positional notation, with the base or radix set to some (typically large) value b; for this example we use b = 10000, so that each digit corresponds to a group of four decimal digits (in a computer implementation, b would typically be a power of 2 instead). Say the two integers being multiplied are:
{|
|m || = ||12||3456||7890||1234||5678||9012
|-
|n || =
|align=right|9||8765||4321||9876||5432||1098.
|}
These are much smaller than would normally be processed with Toom–Cook (grade-school multiplication would be faster) but they will serve to illustrate the algorithm.
Splitting
In Toom-k, we want to split the fac |
https://en.wikipedia.org/wiki/Default%20argument | In computer programming, a default argument is an argument to a function that a programmer is not required to specify.
In most programming languages, functions may take one or more arguments. Usually, each argument must be specified in full (this is the case in the C programming language). Later languages (for example, in C++) allow the programmer to specify default arguments that always have a value, even if one is not specified when calling the function.
Default arguments in C++
Consider the following function declaration:
int MyFunc(int a, int b, int c = 12);
This function takes three arguments, of which the last one has a default of twelve. The programmer may call this function in two ways:
int result = MyFunc(1, 2, 3);
result = MyFunc(1, 2);
In the first case the value for the argument called c is specified explicitly. In the second case, the argument is omitted, and the default value of 12 will be used instead.
For the function called, there is no means to know if the argument has been specified by the caller or if the default value was used.
The above-mentioned method is especially useful when one wants to set default criteria so that the function can be called with or without parameters.
Consider the following:
void PrintGreeting(std::ostream& stream = std::cout) {
// This outputs a message to the given stream.
stream << "hello world!";
}
The function call:
PrintGreeting();
will by default print "hello world!" to the standard output std::cout (typically the screen). On the other hand, any object of type std::ostream can now be passed to the same function and the function will print to the given stream instead of to the standard output. The example below sets the std::ostream& to std::cerr, and thus prints the output the standard error stream.
PrintGreeting(std::cerr);
Because default arguments' values are "filled in" at the call site rather than in the body of the function being called, virtual functions take their default argument values from the static type of the pointer or reference through which the call is made, rather than from the dynamic type of the object supplying the virtual function's body.
struct Base {
virtual std::pair<int, int> Foo(int x = 1) {
return {x, 1};
}
};
struct Derived : public Base {
std::pair<int, int> Foo(int x = 2) override {
return {x, 2};
}
};
int main() {
Derived d;
Base& b = d;
assert(d.Foo() == std::make_pair(2, 2));
assert(b.Foo() == std::make_pair(1, 2));
}
Overloaded methods
Some languages, such as Java, do not have default arguments. However, the same behaviour can be simulated by using method overloading to create overloaded methods of the same name, which take different numbers of arguments; and the versions with fewer arguments simply call the versions with more arguments, with the default arguments as the missing arguments:
int MyFunc(int a, int b) { return MyFunc(a, b, 12); }
int MyFunc(int a, int b, int c) { /* main implementation here */ }
However, |
https://en.wikipedia.org/wiki/Venture%20Church%20Network | Venture Church Network (formerly known as the Conservative Baptist Association of America) is a Christian association of churches in the United States with each local congregation being autonomous and responsible for their own way of functioning.
History
The first organization of Conservative Baptists was the Conservative Baptist Foreign Mission Society (CBFMS), now called WorldVenture, formed in Chicago, in 1943. What became the Venture Church Network was organized in Atlantic City, New Jersey, in 1947 as the Conservative Baptist Association of America. The Conservative Baptist Association emerged as part of the continuing Fundamentalist–Modernist Controversy within the Northern Baptist Convention. The forming churches were fundamentalist/conservative churches that had remained in cooperation with the Northern Baptist Convention after other churches had left, such as those that formed the General Association of Regular Baptist Churches. At the 1946 NBC meeting, the old convention made it clear that it would not allow a competing missionary agency to operate within it. Churches withdrew, forming the new association, and hundreds of others withdrew in the following years. The conservatives were in the majority in Minnesota and Arizona, and the Northern Baptists lost those state agencies. The New Testament Association of Independent Churches and the Conservative Baptist Fellowship, which renamed itself the Fundamental Baptist Fellowship and is now the Fundamental Baptist Fellowship International, split from the Conservative Baptists in the 1960s. On February 16, 2021 the association announced it was changing its name to Venture Church Network because the name Conservative Baptist “no longer connects with what it was originally intended to communicate”.
Constituents
The movement presently supports three national agencies - Venture Church Network, WorldVenture (formerly CBFMS, then CBInternational), and Missions Door (formerly Conservative Baptist Home Mission Society, then Mission To The Americas). These agencies have omitted the word "baptist" from their names, and it is notable that the four associated educational institutions listed below, likewise have omitted "baptist" from their names also.
Conservative Baptists cooperate with affiliated institutions of higher learning as well as youth and women's ministries. Each local Conservative Baptist church is an autonomous organization in voluntary affiliation with each other through regional associations.
Reorganization
Until a structural reorganization began in early 2004, Venture Church Network was a network of churches and ministries, committed to evangelization and church planting. In 2003, its membership comprised over 1200 churches representing over 200,000 church members.
Following the dissolution of an Organization Task Force after an unsuccessful attempt to unite the national agencies in a single structure and vision, Venture Church Network was reorganized as “a covenantal fellowship |
https://en.wikipedia.org/wiki/Contig | A contig (from contiguous) is a set of overlapping DNA segments that together represent a consensus region of DNA.
In bottom-up sequencing projects, a contig refers to overlapping sequence data (reads); in top-down sequencing projects, contig refers to the overlapping clones that form a physical map of the genome that is used to guide sequencing and assembly. Contigs can thus refer both to overlapping DNA sequences and to overlapping physical segments (fragments) contained in clones depending on the context.
Original definition of contig
In 1980, Staden wrote: In order to make it easier to talk about our data gained by the shotgun method of sequencing we have invented the word "contig". A contig is a set of gel readings that are related to one another by overlap of their sequences. All gel readings belong to one and only one contig, and each contig contains at least one gel reading. The gel readings in a contig can be summed to form a contiguous consensus sequence and the length of this sequence is the length of the contig.
Sequence contigs
A sequence contig is a continuous (not contiguous) sequence resulting from the reassembly of the small DNA fragments generated by bottom-up sequencing strategies. This meaning of contig is consistent with the original definition by Rodger Staden (1979). The bottom-up DNA sequencing strategy involves shearing genomic DNA into many small fragments ("bottom"), sequencing these fragments, reassembling them back into contigs and eventually the entire genome ("up"). Because current technology allows for the direct sequencing of only relatively short DNA fragments (300–1000 nucleotides), genomic DNA must be fragmented into small pieces prior to sequencing. In bottom-up sequencing projects, amplified DNA is sheared randomly into fragments appropriately sized for sequencing. The subsequent sequence reads, which are the data that contain the sequences of the small fragments, are put into a database. The assembly software then searches this database for pairs of overlapping reads. Assembling the reads from such a pair (including, of course, only one copy of the identical sequence) produces a longer contiguous read (contig) of sequenced DNA. By repeating this process many times, at first with the initial short pairs of reads but then using increasingly longer pairs that are the result of previous assembly, the DNA sequence of an entire chromosome can be determined.
Today, it is common to use paired-end sequencing technology where both ends of consistently sized longer DNA fragments are sequenced. Here, a contig still refers to any contiguous stretch of sequence data created by read overlap. Because the fragments are of known length, the distance between the two end reads from each fragment is known. This gives additional information about the orientation of contigs constructed from these reads and allows for their assembly into scaffolds in a process called scaffolding.
Scaffolds consist of overlapping contigs sep |
https://en.wikipedia.org/wiki/Live%20CD | A live CD (also live DVD, live disc, or live operating system) is a complete bootable computer installation including operating system which runs directly from a CD-ROM or similar storage device into a computer's memory, rather than loading from a hard disk drive. A live CD allows users to run an operating system for any purpose without installing it or making any changes to the computer's configuration. Live CDs can run on a computer without secondary storage, such as a hard disk drive, or with a corrupted hard disk drive or file system, allowing data recovery.
As CD and DVD drives have been steadily phased-out, live CDs have become less popular, being replaced by live USBs, which are equivalent systems written onto USB flash drives, which have the added benefit of having writeable storage. The functionality of a live CD is also available with an external hard disk drive connected by USB. Many live CDs offer the option of persistence by writing files to a hard drive or USB flash drive.
Many Linux distributions make ISO images available for burning to CD or DVD. While open source operating systems can be used for free, some commercial software, such as Windows To Go requires a license to use. Many live CDs are used for data recovery, computer forensics, disk imaging, system recovery and malware removal. The Tails operating system is aimed at preserving privacy and anonymity of its users, allowing them to work with sensitive documents without leaving a record on a computer's hard drive.
History
All computers except the earliest digital computers are built with some form of minimal built-in loader, which loads a program or succession of programs from a storage medium, which then operate the computer. Initially a read-only medium such as punched tape or punched cards was used for initial program load. With the introduction of inexpensive read-write storage, read-write floppy disks and hard disks were used as boot media.
After the introduction of the audio compact disc, it was adapted for use as a medium for storing and distributing large amounts of computer data. This data may also include application and operating-system software, sometimes packaged and archived in compressed formats. Later, it was seen to be convenient and useful to boot the computer directly from compact disc, often with a minimal working system to install a full system onto a hard drive. While there are read-write optical discs, either mass-produced read-only discs or write-once discs were used for this purpose.
The first Compact Disc drives on personal computers were generally much too slow to run complex operating systems; computers were not designed to boot from an optical disc. When operating systems came to be distributed on compact discs, either a boot floppy or the CD itself would boot specifically, and only, to install onto a hard drive. Early examples of operating systems which could be booted directly from CD-ROM are the FM Towns OS, and the Desktop-VMS distribu |
https://en.wikipedia.org/wiki/ACK | ACK or Ack may refer to:
Arts and entertainment
Amar Chitra Katha, an Indian comic book series
Technology
Acknowledgement (data networks)
ACK (TCP), the control character used in the Transmission Control Protocol to acknowledge receipt of a packet
Amsterdam Compiler Kit, a retargetable compiler suite and toolchain
Transportation
Acklington railway station (Station code: ACK), a rail station in the UK
Armstrong Whitworth F.K.8, an early aircraft known as the "Big Ack"
Nantucket Airlines or ACK Air, an American airline
Nantucket Memorial Airport (IATA: ACK, FAA LID: ACK), an airport in the US
Other uses
Assumption College, Kilmore, an Australian school
Aka-Kora language (ISO 639-3: ack), an extinct Great Andamanese language
TNK2 or ACK or ACK1, an enzyme that in humans is encoded by the TNK2 gene
See also
"Ack ack", from signalese for AA, referring to anti-aircraft artillery fire
Andrew Haldane (1917–1944), an officer in the US Marine Corps in the Pacific Theatre, World War II nicknamed "Ack-Ack"
Acknowledgment (disambiguation) |
https://en.wikipedia.org/wiki/List%20of%20Chinese-language%20television%20channels | This is a list of television networks and television channels that are broadcast in the Chinese language or offer at least some programming in Chinese.
Mainland China
National networks
China Central Television (CCTV)
CCTV-1 (General)
CCTV-2 (Finance)
CCTV-3 (Arts)
CCTV-4 (International Chinese)
Asia Channel
Europe Channel
America Channel
CCTV-5 (Sports)
CCTV-6 (Movies)
CCTV-7 (Military)
CCTV-8 (Drama)
CCTV-9 (Documentary)
CCTV-10 (Science & Education)
CCTV-11 (Opera)
CCTV-12 (Law & Society)
CCTV-13 (News)
CCTV-14 (Children)
CCTV-15 (Music)
CCTV-16 (Olympic Channel)
CCTV-17 (Agriculture and Rural)
CCTV-5+ (Sport Plus)
China Education Television (CETV)
CETV-1 (Human resources)
CETV-2 (Distance education)
CETV-3 (Humanities)
CETV-4 (Classroom)
CETV-5 (Early Education)
China Xinhua News Network Corporation (CNC)
CNC World
CNC Finance and Business
China Weather TV
China Movie TV(CHC)
China Health TV
Digital television networks
CHC Television 华诚
TOPV 鼎视频道
JXTVS 吉祥购物
China Food Television (CFTV) 中华美食频道
NewsFlash 新动漫
WinTV 天盛欧洲足球频道
China Film Channel 中国电影频道
Weather Channel 气象频道
VAN Television 先锋乒羽
Cable networks
MTV Mandarin
Huaxia Television 华夏电视台
Discovery Travel & Living Asia 亚洲旅游台
Discovery Channel
Celestial Movies 天映电影频道
National Geographic Channel (NGC) 国家地理频道
AXN 索尼动作频道
Beijing TV
Goal TV
TrueVisions UBC泰星
HBO
Star Sports 卫视体育台
Hunan TV
ESPN
Channel V
Channel NewsAsia (CNA) 新加坡亚洲新
Provincial and prefectural networks
Anhui
Anhui Television (AHTV) 安徽电视台
Anhui Satellite Channel
Anhui TV Science and Education Channel
Anhui TV Economic Channel
Anhui TV Television Channel
Anhui TV Sports Channel
Anhui TV Public Channel
Hefei Television (HFTV) 合肥电视台
Hefei TV News Channel
Hefei TV Live Channel
Hefei TV Legal Channel
Hefei TV Finance Channel
Hefei TV HBO Channel
Hefei TV Feixi Channel
Hefei TV Feidong Channel
Hefei TV Long Fengtai Channel
Hefei TV Theater Channel
Bengbu Television (AHBTV) 蚌埠电视台
Bengbu TV-1
Bengbu TV-2
Bengbu TV-3
Huainan Television (HNGD) 淮南电视台
Huainan TV-1
Huainan TV-2
Huainan TV-3
Suzhou Television(AHSZTV)宿州电视台
Suzhou TV-1
Suzhou TV-2
Suzhou TV-3
Beijing
Beijing Television (BTV) 北京电视台
BTV Beijing Channel
BTV Satellite Channel
BTV Arts Channel
BTV Science and Education Channel
BTV Entertainment Channel
BTV Finance Channel
BTV Sports Channel
BTV Lifestyle Channel
BTV Youth Channel
BTV Public Channel
Kaku - Cartoons
China Central Television Pay Vision 央视风云
CCTV Film Channel
CCTV Fengyun Music Channel
CCTV Prime Theatre Channel
CCTV Football Channel
CCTV Golf and Tennis Channel
CCTV FY Theatre Channel
CCTV World Geographic Channel
CCTV Nostalgia Theatre Channel
CCTV Quality Channel
CCTV Entertainment Channel
CCTV Opera Channel
CCTV Defense Military Channel
CCTV Women Fashion Channel
Chongqing
Chongqing Broadcasting Group (CBG) 重庆电视台
Chongqing Satellite Channel
Chongqing TV Drama Channel
Chongqing TV News Channel
Chongqing |
https://en.wikipedia.org/wiki/Minimum%20description%20length | Minimum Description Length (MDL) is a model selection principle where the shortest description of the data is the best model. MDL methods learn through a data compression perspective and are sometimes described as mathematical applications of Occam's razor. The MDL principle can be extended to other forms of inductive inference and learning, for example to estimation and sequential prediction, without explicitly identifying a single model of the data.
MDL has its origins mostly in information theory and has been further developed within the general fields of statistics, theoretical computer science and machine learning, and more narrowly computational learning theory.
Historically, there are different, yet interrelated, usages of the definite noun phrase "the minimum description length principle" that vary in what is meant by description:
Within Jorma Rissanen's theory of learning, a central concept of information theory, models are statistical hypotheses and descriptions are defined as universal codes.
Rissanen's 1978 pragmatic first attempt to automatically derive short descriptions, relates to the Bayesian Information Criterion (BIC).
Within Algorithmic Information Theory, where the description length of a data sequence is the length of the smallest program that outputs that data set. In this context, it is also known as 'idealized' MDL principle and it is closely related to Solomonoff's theory of inductive inference, which is that the best model of a data set is represented by its shortest self-extracting archive.
Overview
Selecting the minimum length description of the available data as the best model observes the principle identified as Occam's razor. Prior to the advent of computer programming, generating such descriptions was the intellectual labor of scientific theorists. It was far less formal than it has become in the computer age. If two scientists had a theoretic disagreement, they rarely could formally apply Occam's razor to choose between their theories. They would have different data sets and possibly different descriptive languages. Nevertheless, science advanced as Occam's razor was an informal guide in deciding which model was best.
With the advent of formal languages and computer programming Occam's razor was mathematically defined. Models of a given set of observations, encoded as bits of data, could be created in the form of computer programs that output that data. Occam's razor could then formally select the shortest program, measured in bits of this algorithmic information, as the best model.
To avoid confusion, note that there is nothing in the MDL principle that implies a machine produced the program embodying the model. It can be entirely the product of humans. The MDL principle applies regardless of whether the description to be run on a computer is the product of humans, machines or any combination thereof. The MDL principle requires only that the shortest description, when executed, produce the o |
https://en.wikipedia.org/wiki/Megachile%20rotundata | Megachile rotundata, the alfalfa leafcutting bee, is a European bee that has been introduced to various regions around the world. As a solitary bee species, it does not build colonies or store honey, but is a very efficient pollinator of alfalfa, carrots, other vegetables, and some fruits. Because of this, farmers often use M. rotundata as a pollination aid by distributing M. rotundata prepupae around their crops. Each female constructs and provisions her own nest, which is built in old trees or log tunnels. Being a leafcutter bee, these nests are lined with cut leaves. These bees feed on pollen and nectar and display sexual dimorphism. This species has been known to bite and sting, but it poses no overall danger unless it is threatened or harmed, and its sting has been described as half as painful as a honey bee's.
Taxonomy and phylogeny
Megachile rotundata is a member of the subfamily Megachilinae, which includes more than 4,000 bee species; this currently makes this family the second-largest among all bee families. This subfamily is one of four other subfamilies of Megachilidae, the other three being the Fideliinae, Pararhophitinae, and Lithurginae. Phylogenetic studies suggest that this subfamily is monophyletic. More specifically, it belongs to the genus Megachile, which contains 52 subgenera and 1,478 species. The genus Megachile consists of bees that cut leaf pieces to line their nests.
Description and identification
Megachile rotundata is a European leaf-cutting bee placed in the subgenus Eutricharia, the "small leaf-cutting bees"; they are in length. They are partially bivoltine, meaning that under the right conditions they can produce two generations per year. These bees present a sexual dimorphism, in which the males are smaller than the females and differently marked. Megachile rotundata bees are a dark grey color. Females have white hairs all over their bodies, including on their scopae. In contrast, males have white and yellow spots on their abdomens.
Distribution and habitat
Megachile rotundata is currently found on all continents except Antarctica. In North America, the species was deliberately imported to assist in the pollination of food crops, but has now become feral and widespread. In New Zealand and Australia, M. rotundata was also introduced to assist in the pollination of alfalfa (known locally as lucerne), in 1971 in New Zealand, and 1987 in Australia.
Nest construction
Females construct tubular nests in a variety of sites, including rotting wood, flower stems, reeds, and soda straws. In the wild, females also create nests in small holes in the ground or in available cracks/crevices in trees or buildings. The nests are composed of a string of individual cells, as many as the space will allow. When managed for pollination, the females are induced to nest in paper cylinders similar to drinking straws or drilled blocks of wood.
Each cell is made from circular disks cut from plant leaves using the bee's mandibles, |
https://en.wikipedia.org/wiki/Chandy%E2%80%93Lamport%20algorithm | The Chandy–Lamport algorithm is a snapshot algorithm that is used in distributed systems for recording a consistent global state of an asynchronous system. It was developed by and named after Leslie Lamport and K. Mani Chandy.
History
According to Leslie Lamport's website, “The distributed snapshot algorithm described here came about when I visited Chandy, who was then at the University of Texas in Austin. He posed the problem to me over dinner, but we had both had too much wine to think about it right then. The next morning, in the shower, I came up with the solution. When I arrived at Chandy's office, he was waiting for me with the same solution.”
Definition
The assumptions of the algorithm are as follows:
There are no failures and all messages arrive intact and only once
The communication channels are unidirectional and FIFO ordered
There is a communication path between any two processes in the system
Any process may initiate the snapshot algorithm
The snapshot algorithm does not interfere with the normal execution of the processes
Each process in the system records its local state and the state of its incoming channels
The algorithm works using marker messages. Each process that wants to initiate a snapshot records its local state and sends a marker on each of its outgoing channels. All the other processes, upon receiving a marker, record their local state, the state of the channel from which the marker just came as empty, and send marker messages on all of their outgoing channels. If a process receives a marker after having recorded its local state, it records the state of the incoming channel from which the marker came as carrying all the messages received since it first recorded its local state.
Some of the assumptions of the algorithm can be facilitated using a more reliable communication protocol such as TCP/IP. The algorithm can be adapted so that there could be multiple snapshots occurring simultaneously.
Algorithm
The Chandy–Lamport algorithm works like this:
The observer process (the process taking a snapshot):
Saves its own local state
Sends a snapshot request message bearing a snapshot token to all other processes
A process receiving the snapshot token for the first time on any message:
Sends the observer process its own saved state
Attaches the snapshot token to all subsequent messages (to help propagate the snapshot token)
When a process that has already received the snapshot token receives a message that does not bear the snapshot token, this process will forward that message to the observer process. This message was obviously sent before the snapshot “cut off” (as it does not bear a snapshot token and thus must have come from before the snapshot token was sent out) and needs to be included in the snapshot.
From this, the observer builds up a complete snapshot: a saved state for each process and all messages “in the ether” are saved.
References
Distributed algorithms |
https://en.wikipedia.org/wiki/Happened-before | In computer science, the happened-before relation (denoted: ) is a relation between the result of two events, such that if one event should happen before another event, the result must reflect that, even if those events are in reality executed out of order (usually to optimize program flow). This involves ordering events based on the potential causal relationship of pairs of events in a concurrent system, especially asynchronous distributed systems. It was formulated by Leslie Lamport.
The happened-before relation is formally defined as the least strict partial order on events such that:
If events and occur on the same process, if the occurrence of event preceded the occurrence of event .
If event is the sending of a message and event is the reception of the message sent in event , .
If two events happen in different isolated processes (that do not exchange messages directly or indirectly via third-party processes), then the two processes are said to be concurrent, that is neither nor is true.
If there are other causal relationships between events in a given system, such as between the creation of a process and its first event, these relationships are also added to the definition.
For example, in some programming languages such as Java, C, C++ or Rust, a happens-before edge exists if memory written to by statement A is visible to statement B, that is, if statement A completes its write before statement B starts its read.
Like all strict partial orders, the happened-before relation is transitive, irreflexive (and vacuously, asymmetric), i.e.:
, if and , then (transitivity). This means that for any three events , if happened before , and happened before , then must have happened before .
(irreflexivity). This means that no event can happen before itself.
if then (asymmetry). This means that for any two events , if happened before then cannot have happened before .
Let us observe that the asymmetry property directly follows from the previous properties: by contradiction, let us suppose that we have and . Then by transitivity we have which contradicts irreflexivity.
The processes that make up a distributed system have no knowledge of the happened-before relation unless they use a logical clock, like a Lamport clock or a vector clock. This allows one to design algorithms for mutual exclusion, and tasks like debugging or optimising distributed systems.
See also
Race condition
Java Memory Model
Lamport timestamps
Logical clock
Citations
References
Events
Logical clock algorithms
Distributed computing problems |
https://en.wikipedia.org/wiki/Peterson%27s%20algorithm | Peterson's algorithm (or Peterson's solution) is a concurrent programming algorithm for mutual exclusion that allows two or more processes to share a single-use resource without conflict, using only shared memory for communication. It was formulated by Gary L. Peterson in 1981. While Peterson's original formulation worked with only two processes, the algorithm can be generalized for more than two.
The algorithm
The algorithm uses two variables: flag and turn. A flag[n] value of true indicates that the process n wants to enter the critical section. Entrance to the critical section is granted for process P0 if P1 does not want to enter its critical section or if P1 has given priority to P0 by setting turn to 0.
The algorithm satisfies the three essential criteria to solve the critical-section problem. The while condition works even with preemption.
The three criteria are mutual exclusion, progress, and bounded waiting.
Since turn can take on one of two values, it can be replaced by a single bit, meaning that the algorithm requires only three bits of memory.
Mutual exclusion
P0 and P1 can never be in the critical section at the same time. If P0 is in its critical section, then flag[0] is true. In addition, either flag[1] is false (meaning that P1 has left its critical section), or turn is 0 (meaning that P1 is just now trying to enter the critical section, but graciously waiting), or P1 is at label P1_gate (trying to enter its critical section, after setting flag[1] to true but before setting turn to 0 and busy waiting). So if both processes are in their critical sections, then we conclude that the state must satisfy flag[0] and flag[1] and turn = 0 and turn = 1. No state can satisfy both turn = 0 and turn = 1, so there can be no state where both processes are in their critical sections.
(This recounts an argument that is made rigorous in.)
Progress
Progress is defined as the following: if no process is executing in its critical section and some processes wish to enter their critical sections, then only those processes that are not executing in their remainder sections can participate in making the decision as to which process will enter its critical section next. Note that for a process or thread, the remainder sections are parts of the code that are not related to the critical section. This selection cannot be postponed indefinitely. A process cannot immediately re-enter the critical section if the other process has set its flag to say that it would like to enter its critical section.
Bounded waiting
Bounded waiting, or bounded bypass, means that the number of times a process is bypassed by another process after it has indicated its desire to enter the critical section is bounded by a function of the number of processes in the system. In Peterson's algorithm, a process will never wait longer than one turn for entrance to the critical section.
Filter algorithm: Peterson's algorithm for more than two processes
The filter algorithm gene |
https://en.wikipedia.org/wiki/Keyboard%20buffer | A keyboard buffer is a section of computer memory used to hold keystrokes before they are processed.
Keyboard buffers have long been used in command-line processing. As a user enters a command, they see it echoed on their terminal and can edit it before it is processed by the computer.
In time-sharing systems, the location of the buffer depends on whether communications is full-duplex or half-duplex. In full-duplex systems, keystrokes are transmitted one by one. As the main computer receives each keystroke, it ordinarily appends the character which it represents to the end of the keyboard buffer. The exception is control characters, such as "delete" or "backspace" which correct typing mistakes by deleting the character at the end of the buffer.
In half-duplex systems, keystrokes are echoed locally on a computer terminal. The user can see the command line on his terminal and edit it before it is transmitted to the main computer. Thus the buffer is local.
On some early home computers, to minimize the necessary hardware, a CPU interrupt checked the keyboard's switches for key presses multiple times each second, and recorded the key presses in a keyboard buffer for the operating system or application software to read.
On some systems, if the user presses too many keys at once, the keyboard buffer overflows and will emit a beep from the computer's internal speaker.
Other uses
The use of keyboard buffers is sometimes known from the user experience side as typeahead.
References
Computer keyboards
Computer memory |
https://en.wikipedia.org/wiki/Registry | Registry may refer to:
Computing
Container registry, an operating-system-level virtualization registry
Domain name registry, a database of top-level internet domain names
Local Internet registry
Metadata registry, information system for registering metadata
National Internet registry
Regional Internet registry, a database of allocated Internet number resources in a particular region of the world
Windows Registry, a database of configuration settings in Microsoft Windows operating systems
Service List Registry, an audiovisual service discovery platform
Gifts
Gift registry, a particular type of wish list, e.g., for anniversaries, birthdays, graduations, honeymoons, housewarmings, showers, weddings
Bridal registry, a retailers' plan that allows engaged couples to manage the purchase of wedding gifts
Honeymoon registry, a service that assists engaged and married couples in financing their honeymoons
Government and law
A registry is an authoritative list of one kind of information. Registries normally contain fields with a unique ID, so that the record can be referenced from other documents and registries
Civil registry, a government record of vital events (for example, births, deaths and marriages)
Land registry, an official record of land ownership
Registry of Motor Vehicles, a government agency that administers the registration of automobiles
Sex offender registry, a system to allow government authorities to keep track of sex offenders
Permanent residence registry, a legislative provision that allows an illegal entrant to become a lawful permanent resident by virtue of having continuously resided in the United States since before a specified date
Registry fee, a postal fee paid to send registered mail
The Registry, a risk management tool used by landlords to screen prospective renters
Health and medicine
Cancer registry, a systematic collection of data about cancer and tumor diseases
NREMT or National Registry of Emergency Medical Technicians, which establishes and verifies entry-level competence for American first responders, emergency medical technicians and paramedics
Nurse registry, a licensed staffing agency that provides hospitals and individuals with nursing personnel
American Joint Replacement Registry, an organization that collects and reports hip and knee replacement data to provide actionable information to guide physicians and patient decision making to improve care
Patient registry, an organised system that uses observational methods to collect uniform data on a population defined by a particular disease, condition, or exposure, and that is followed over time
Other uses
Breed registry, a record of the ancestry and ownership of purebred animals
Family registry, a registry used in many countries to track information of genealogical or legal interest
Survivor registry, a website where people in an area affected by a terrorist attack can post a message saying they are okay
The Social Registry, a record lab |
https://en.wikipedia.org/wiki/Four-Corner%20Method | The Four-Corner Method or Four-Corner System () is a character-input method used for encoding Chinese characters into either a computer or a manual typewriter, using four or five numerical digits per character.
The four digits encode the shapes found in the four corners of the symbol, upper left to lower right. Although this does not uniquely identify a Chinese character, it leaves only a very short list of possibilities. A fifth digit can be added to describe an extra part above the lower right if necessary.
The four-corner method, in its three revisions, was supported by the Chinese state for a while, and is found in numerous older reference works and some still in publication. The small Kangorin Sino-Japanese Dictionary by Yoneyama had a four-corner index when it was introduced in the 1980s, but it has been since deleted. However, it is not in common usage today, although dictionaries using it are available. It is identified, in public opinion, with the time when many Chinese were illiterate and the language was not yet unified; more Chinese today use the dictionary to help them write, not read. But it is useful for scholars, clerks, editors, compilers, and especially for foreigners who read Chinese. In recent years it has achieved a new usage as a character input system for computers, generating very short lists to browse.
Origin
The Four-Corner Method was invented in the 1920s by Wang Yunwu, the editor in chief at Commercial Press Ltd., China. It was based on experiments by Lin Yutang and others. Its original purpose was to aid telegraphers in looking up Chinese telegraph code numbers in use at that time from long lists of characters. This was mentioned by Wang Yunwu in an introductory pamphlet called Four-Corner Method, published in 1926. Cai Yuanpei and Hu Shih wrote introductory essays for this pamphlet.
Mnemonics
The four digits used to encode each character are chosen according to the "shape" of the four corners of each character. In order, these corners are upper left, upper right, lower left and lower right. The shapes can be memorized using a poem composed by Hu Shih, called Bihuahaoma Ge (), as a "memory key" to the system:
In the 1950s, lexicographers in the People's Republic of China changed the poem somewhat in order to avoid association with Hu Shih, who had criticized the Chinese Communist Party, although the contents remain generally unchanged. The 1950s version is as follows:
Several other notes:
A single stroke can be represented in more than one corner, as is the case with many curly strokes. (e.g. the code for 乙 is 1771)
If the character is fenced by , (门), or , the lower corners are used to denote what is inside the radical, instead of 00 for 囗 or 22 for the others. (e.g. the code for 回 is 6060)
There have been scores, maybe hundreds, of such numerical and alpha-numerical systems proposed or popularized (such as Lin Yutang's "Instant Index", Trindex, Head-tail, Wang An's Sanjiahaoma, Halpern); some Chinese r |
https://en.wikipedia.org/wiki/Lists%20of%20radio%20stations%20in%20Europe | This is a list of radio stations in Europe.
Pan-European radio networks
European commercial radio networks
Bauer Media Group
United Kingdom (Bauer Radio company)
Ireland (Newstalk, Today FM, 98FM, SPIN 1038, SPIN South West)
Norway (Radio Norge, Kiss, Radio Norsk Pop, Radio Topp 40, Radio Rock, Radio Vinyl, P24/7 MIX, P24/7 FUN, P24/7 KOS)
Denmark (Nova, The Voice, Radio 100, My Rock, Radio Soft, Pop FM, Mix 7, Planet Rock, Radio Vinyl, Pop FM 80'er)
Sweden (Mix Megapol, NRJ Sweden, Rock Klassiker, Svensk Pop, Vinyl FM, Feel Good Hits, Radio Nostalgie Sweden, Lugna Klassiker, Rock Klassiker Hardrock, Gold FM, Radio Active, Relax FM, Retro FM, Topp 40)
Finland (Radio Nova, Iskelma, Radio City, NRJ Finland, Radio Nostalgie Finland, Basso, Suomi Rock, Suomi Rap, Top 51, Kasari, Radio Pooki, Radio Classic, Kiss, Ysari, local stations (Radio 957, Radio Pori, Auran Aallot))
Poland (RMF FM, RMF24, RMF MAXX, RMF Classic)
Slovakia (Radio Expres, Europa 2 Slovakia, Radio Melody, Radio Rock)
Portugal (Radio Comercial, M80 Radio, Cidade FM, Vodafone FM, Smooth FM)
NRJ Group
NRJ / Energy – in France, Germany, Switzerland, Austria, Belgium, Norway, Denmark, Sweden, Finland, Bulgaria, Georgia, Cyprus, Lebanon, Morocco, Egypt and Russia
Nostalgie – in France, Belgium, Switzerland, Germany, Sweden, Finland and Lebanon
Chérie FM – in France and Belgium
Virgin Radio – in Canada, UK, Switzerland, Italy, Romania, Turkey, Lebanon, UAE and Oman
Radio Monte Carlo (RMC) – in France, Italy, Georgia, Kazakhstan, Russia
RTL Group
Germany (RTL Radio (DAB+ in Germany and FM in Luxembourg), Toggo Radio (DAB+) and local and regional radio stations)
Luxembourg (RTL Radio Lёtzebuerg, Eldoradio, L'essentiel Radio, Internet-radio (Today Radio, RTL LX, RTL Gold, RTL +80er, RTL +90er, RTL +rock))
France (RTL, RTL2, Fun Radio)
Spain (Onda Cero, Europa FM, Melodia FM)
TV3 Group
Estonia (Star FM, Power Hit Radio (FM and DAB+), Star FM Eesti (FM and DAB+), Star FM+)
Latvia (Star FM, Top Radio)
Lithuania (Power Hit Radio, pending to acquisition M-1 Group (M-1, M-1 Plius, Lietus, Laulna (Klaipeda) and Raduga (Klaipeda))
Viaplay Group (Vivendi 12,5%, Schibsted 10,1%, PPF Group 6,3%)
Sweden (Rix FM, Star FM, Bandit Rock, Lugna Favoriter, Bandit Classic Rock, Dansbands Kanalen, Go Country, Disco 54, HitMix 90's, Power Hit Radio, Rix FM Fresh, Svenska Favoriter)
Norway (P4 Hele Norge, P5 Hits, NRJ Norway, P6 Rock, P7 Klem, P8 Pop, P9 Retro, P10 Country, P11 Bandit)
Czech Media Invest
Czech Republic (Evropa 2, Frekvence 1, Dance Radio, Radio Bonton)
Romania (Europa FM, Virgin Radio Romania, Vibe FM, Smart FM)
Antenna Group
Greece (Easy FM, Rythmos FM)
Romania (Kiss FM, Magic FM, One FM, Rock FM)
News UK
United Kingdom (TalkSport (AM and DAB+), TalkRadio, Times Radio, Virgin Radio UK)
Wireless Ireland (Dublin (Dublin's Q102 and FM104), Cork (Cork's 96FM and C103), Live95 Limerick, LMFM Drogheda, U105 Belfast)
Lagardère Group (Vivendi 57,66%)
Radio station |
https://en.wikipedia.org/wiki/Computable%20set | In computability theory, a set of natural numbers is called computable, recursive, or decidable if there is an algorithm which takes a number as input, terminates after a finite amount of time (possibly depending on the given number) and correctly decides whether the number belongs to the set or not.
A set which is not computable is called noncomputable or undecidable.
A more general class of sets than the computable ones consists of the computably enumerable (c.e.) sets, also called semidecidable sets. For these sets, it is only required that there is an algorithm that correctly decides when a number is in the set; the algorithm may give no answer (but not the wrong answer) for numbers not in the set.
Formal definition
A subset of the natural numbers is called computable if there exists a total computable function such that if and if . In other words, the set is computable if and only if the indicator function is computable.
Examples and non-examples
Examples:
Every finite or cofinite subset of the natural numbers is computable. This includes these special cases:
The empty set is computable.
The entire set of natural numbers is computable.
Each natural number (as defined in standard set theory) is computable; that is, the set of natural numbers less than a given natural number is computable.
The subset of prime numbers is computable.
A recursive language is a computable subset of a formal language.
The set of Gödel numbers of arithmetic proofs described in Kurt Gödel's paper "On formally undecidable propositions of Principia Mathematica and related systems I" is computable; see Gödel's incompleteness theorems.
Non-examples:
The set of Turing machines that halt is not computable.
The isomorphism class of two finite simplicial complexes is not computable.
The set of busy beaver champions is not computable.
Hilbert's tenth problem is not computable.
Properties
If A is a computable set then the complement of A is a computable set. If A and B are computable sets then A ∩ B, A ∪ B and the image of A × B under the Cantor pairing function are computable sets.
A is a computable set if and only if A and the complement of A are both computably enumerable (c.e.). The preimage of a computable set under a total computable function is a computable set. The image of a computable set under a total computable bijection is computable. (In general, the image of a computable set under a computable function is c.e., but possibly not computable).
A is a computable set if and only if it is at level of the arithmetical hierarchy.
A is a computable set if and only if it is either the range of a nondecreasing total computable function, or the empty set. The image of a computable set under a nondecreasing total computable function is computable.
See also
Recursively enumerable language
Recursive language
Recursion
References
Cutland, N. Computability. Cambridge University Press, Cambridge-New York, 1980. ;
Rogers, H. The Theory of Recursive Func |
https://en.wikipedia.org/wiki/Industrial%20data%20processing | Industrial data processing is a branch of applied computer science that covers the area of design and programming of computerized systems which are not computers as such — often referred to as embedded systems (PLCs, automated systems, intelligent instruments, etc.). The products concerned contain at least one microprocessor or microcontroller, as well as couplers (for I/O).
Another current definition of industrial data processing is that it concerns those computer programs whose variables in some way represent physical quantities; for example the temperature and pressure of a tank, the position of a robot arm, etc.
Computer engineering |
https://en.wikipedia.org/wiki/Media%20access%20unit | A media access unit (MAU), also known as a multistation access unit (MAU or MSAU), is a device to attach multiple network stations in a star topology as a Token Ring network, internally wired to connect the stations into a logical ring (generally passive i.e. non-switched and unmanaged; however managed Token Ring MAUs do exist in the form of CAUs, or Controlled Access Units).
Passive Token Ring was an active IBM networking product in the 1997 time-frame, after which it was rapidly displaced by switched networking.
Advantages and disadvantages
Passive networking without power
The majority of IBM-implemented (actual) passive Token Ring MAUs operated without the requirement of power; instead the passive MAU used a series of relays that adjusted themselves as data is passed through: this is also why Token Ring generally used relays to terminate disconnected or failed ports. The power-less IBM 8228 Multistation Access Unit requires a special 'Setup Aid' tool to re-align the relays after the unit has been moved which causes them to be in incorrect states: this is accomplished by a 9v battery sending a charge to snap the relays back in a proper state. The advantages of having a MAU operate without power is that they can be placed in areas without outlets, the disadvantage is that they must be primed each time the internal relays experience excessive force. The IBM 8226 MAU, while containing a power jack, primarily uses this for the LEDs: relays are still used inside the unit but do not require priming.
Bandwidth
In theory, this networking technology supported large geographic areas (with a total ring circumference of several kilometers). But with the bandwidth shared by all stations, in practice separate networks spanning smaller areas were joined using bridges. This bridged network technology was soon displaced by high-bandwidth switched networks.
Fault tolerance
Multistation Access Units contain relays to short out non-operating stations. Multiple MAUs can be connected into a larger ring through their ring in/ring out connectors.
An MAU is also called a "ring in a box". The loop that used to make up the ring of the token Ring is now integrated into this device. In Token Ring, when a link is broken in the ring, the entire network goes down; however with an MAU, the broken circuit is closed within 1ms; allowing stations on the ring to have their cords unplugged without disabling the entire network.
See also
Lobe Attachment Module
References
External links
Networking hardware |
https://en.wikipedia.org/wiki/Neuengamme%20concentration%20camp | Neuengamme was a network of Nazi concentration camps in Northern Germany that consisted of the main camp, Neuengamme, and more than 85 satellite camps. Established in 1938 near the village of Neuengamme in the Bergedorf district of Hamburg, the Neuengamme camp became the largest concentration camp in Northwest Germany. Over 100,000 prisoners came through Neuengamme and its subcamps, 24 of which were for women. The verified death toll is 42,900: 14,000 in the main camp, 12,800 in the subcamps, and 16,100 in the death marches and bombings during the final weeks of World War II. Following Germany's defeat in 1945, the British Army used the site as an internment camp for SS and other Nazi officials. In 1948, the British transferred the land to the Free Hanseatic City of Hamburg, which summarily demolished the camp's wooden barracks and built in its stead a prison cell block, converting the former concentration camp site into two state prisons operated by the Hamburg authorities from 1950 to 2004. Following protests by various groups of survivors and allies, the site now serves as a memorial. It is situated 15 km southeast of the centre of Hamburg.
History
Background
In 1937, Hitler declared five cities to be converted into Führer cities (German: Führerstädte) in the new Nazi regime, one of which was Hamburg. The banks of the Elbe river of Hamburg, considered Germany's "Gateway to the World" for its large port, were to be redone in the clinker brick style characteristic of German Brick Expressionism.
To supply the bricks, the SS-owned company Deutsche Erd-und Steinwerke (DESt) (English: German Earth & Stone Works) purchased a defunct brick factory (German: Klinkerwerk) and 500,000 m² of land in Neuengamme in September 1938.
Neuengamme camp
The SS established the Neuengamme concentration camp on 13 December 1938 as a subcamp (German: Außenlager) of the Sachsenhausen concentration camp and transported 100 prisoners from Sachsenhausen to begin constructing a camp and operate the brickworks.
In January 1940, Heinrich Himmler visited the site and deemed Neuengamme brick production below standard. In April 1940, the SS and the city of Hamburg signed a contract for the construction of a larger, more modern brick factory, an expanded connecting waterway, and a direct supply of bricks and prisoners for construction work in the city. On 4 June, the Neuengamme concentration camp became an independent camp (German: Stammlager), and transports began to arrive from all over Germany and soon the rest of Europe.
As the death rate climbed between 1940 and 1942, a crematorium was constructed in the camp. In the same year, the civilian corporations Messap and Jastram opened armament plants on the camp site and used concentration camp prisoners as their workforces. After the war turned in Stalingrad, Nazis imprisoned millions of Soviets in the concentration camp system and Soviet POWs became the largest prisoner group in the Neuengamme camp and received brutal t |
https://en.wikipedia.org/wiki/List%20of%20Portuguese-language%20television%20channels | The following is a list of Portuguese language television channels.
Angola
Televisão Pública de Angola
TV Zimbo
RTP África
SIC Notícias - news
TV Globo Internacional - Brazilian programming
TV Record - Brazilian programming
Euronews (Portuguese feeds) - news
RTP Internacional - Portugal programming
Disney Channel Portugal - children
National Geographic Channel - documentaries
SuperSport 7 - Portuguese Superliga - Portugal's football league games
Brazil
Cape Verde
Rádio e Televisão de Cabo Verde - state broadcaster
RTP África
RTP1
RTP2
SIC Internacional
SIC Notícias
SIC Mulher
SIC Radical
TVI
Euronews
Disney Channel Portugal
TV Globo Internacional
TV Record Internacional
RBTi
East Timor
Radio-Televisão Timor Leste
Guinea-Bissau
Guinea-Bissau Television
EM TV Guinea-Bissau
RTP África
Macau
Canal Macau
Mozambique
Televisão de Moçambique (TVM)
TV Miramar
RTP África
Soico TV (STV) - generalist
Miramar (TV station) - generalist
SIC Notícias - news
Euronews (Portuguese feeds) - news
SIC Internacional - Portugal programming
RTP Internacional - Portugal Programming
TV Globo Internacional - Brazilian programming
TV Record - Brazilian programming
Televisão Pública de Angola - Angolan programming
TVC1 - movies
TVC2 - movies
Disney Channel Portugal - children and teenagers
National Geographic Channel - documentaries
MTV Portugal - music
SuperSport 7 - Portuguese Superliga - Portugal's football league games
Portugal
São Tomé and Príncipe
Televisão Santomense
RTP África
International Portuguese channels
Televisão Pública de Angola International
RTP Internacional
RTP África
SIC Internacional
SIC Notícias
TVI Internacional
TV Globo Internacional (North America, South America, Europe, Africa, Japan)
Record Internacional (Europe, Africa, North America, Japan)
RBTi (North America, Europe)
Band Internacional (North America, Europe, Africa)
Premiere Futebol Clube - Brazilian soccer championships (North America, South America, Europe, Africa)
Band News (North America)
United States
The Portuguese Channel-Cable channel serving Southeastern Massachusetts & Rhode Island (Based in Fall River, Massachusetts)
See also
Lists of television channels
Portuguese-language
Portuguese-language television |
https://en.wikipedia.org/wiki/ANT1 | Antenna, better known as ANT1, is a free-to-air television network airing in Greece. The alternate spelling is wordplay in Greek; ena (ένα) is the Greek number 1 (one), thus ANT1 is pronounced the same as Antenna (Αντέννα). It launched on 31 December 1989, and is owned by Antenna Group. ANT1 had been a popular network in Greece for years with its line up of soap series including dramas Lampsi and Kalimera Zoi.
History
The first broadcast of the channel was on 31 December 1989. Antenna Group also runs Easy 97.2 and Rythmos 94.9 in Athens, as well as international networks ANT1 Satellite (from America), ANT1 Pacific (from Australia) and ANT1 Europe which broadcast the best of ANT1 programming to audiences abroad. It also owns a stake in Makedonia TV also with national coverage in Greece, and through third parties Easy 97.5 based in Thessaloniki.
Programs that were once shown on ANT1 include CBS Evening News from the U.S. ANT1 Satellite News was also shown until the late 1990s. Antenna TV studios are located in the Athens suburb of Marousi. The station broadcasts terrestrially via a network of repeaters throughout all of Greece and Cyprus.
Antenna was founded by Minos Kyriakou and today is led by Theodore Kyriakou. He served as Executive Vice President of the Antenna Group S.A. (from 1995) and as Chief Operating Officer (from September 1998) until his appointment in March 1999 as Chief Executive Officer, a position which he held until his appointment in January 2002 as Group Vice Chairman. Mr. Kyriakou has been a Director since September 1998.
ANT1 International channels
Since 1993, Antenna has broadcast its programming internationally for Greek-speaking audiences abroad. Initially, the broadcast was for a few hours each day but since 2000 has evolved into a full channel that operates twenty-four hours a day. ANT1 currently operates three television channels, via satellite, which vary according to the different geographical targets:
Antenna Europe for audiences in Europe (outside Greece and Cyprus) which has been operating since 2006.
Antenna Pacific for audiences in Australia which has been operating since 1997.
Antenna Satellite for audiences in America which has been operating since 1993.
ANT1 HD
ANT1 began broadcasting in high definition (HD) by the evening of March 1, 2016. The program is transmitted as the normal broadcast and at the frequency of simple definition, but the parent (native HD) broadcast only emits what has been shot with this resolution.
In 2010, Antenna Group had launched on-demand Internet media service Netwix, available to viewers in Greece. It mainly included short YouTube-style comedy videos created by famous greek comedians. This service closed in 2023, due to the high costs of production and the low audience appeal.
ANT1+
Since April 2022, Antenna Group has launched its own subscription-based streaming media, which includes some original shows such as "Serres" and "I Gefyra (The Bridge)", along with many movies an |
https://en.wikipedia.org/wiki/Geniac | Geniac was an educational toy sold as a mechanical computer designed and marketed by Edmund Berkeley, with Oliver Garfield from 1955 to 1958, but with Garfield continuing without Berkeley through the 1960s. The name stood for "Genius Almost-automatic Computer" but suggests a portmanteau of genius and ENIAC (the first fully electronic general-purpose computer).
Operation
Basically a rotary switch construction set, the Geniac contained six perforated masonite disks, into the back of which brass jumpers could be inserted. The jumpers made electrical connections between slotted brass bolt heads sitting out from the similarly perforated masonite back panel. To the bolts were attached wires behind the panel. The circuit comprised a battery, such wires from it to, and between, switch positions, wires from the switches to indicator flashlight bulbs set along the panel's middle, and return wires to the battery to complete the circuit.
With this basic setup Geniac could use combinational logic only, its outputs depending entirely on inputs manually set. It had no active elements at all – no relays, tubes, or transistors – to allow a machine state to automatically influence subsequent states. Thus, Geniac didn't have memory and couldn't solve problems using sequential logic. All sequencing was performed manually by the operator, sometimes following fairly complicated printed directions (turn this wheel in this direction if this light lights, etc.)
The main instruction book, as well as a supplementary book of wiring diagrams, gave jumper positions and wiring diagrams for building a number of "machines," which could realize fairly complicated Boolean equations. A copy of Claude Shannon's groundbreaking thesis in the subject, A Symbolic Analysis of Relay and Switching Circuits, was also included.
A typical project
A typical project was a primitive "Masculine–Feminine Testing Machine". The user was instructed to answer five questions related to gender, such as "Which makes a better toy for a child: (a) electric train? (b) a doll with a complete wardrobe?" Having wired five of the six rotary switches and set them to "off" positions, questions could be asked. For each "a" answer, a switch was turned to one of two "on" positions, setting a circuit segment; for each "b" answer, the other "on" position. The circuitry sensed the cumulative effect of the switch positions, the circuit being completed, and a "more masculine" or "more feminine" bulb lit, once three masculine or three feminine answers were recorded.
Popularity
Widely advertised in magazines such as Galaxy Science Fiction, the Geniac provided many youths with their first hands-on introduction to computer concepts and Boolean logic.
Brainiac
A nearly identical product, called Brainiac, was introduced in 1958 by Edmund Berkeley, after he had a falling out with Oliver Garfield.
Helical slide rule
Oliver Garfield also sold the Otis King's Patent Calculator, a helical slide rule, under the Geniac b |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.