source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Dave%20Theurer | David Theurer is a game designer and computer programmer. In 1980, he created the Missile Command and Tempest arcade games for Atari, Inc., considered two of the major releases from the Golden age of arcade games. Theurer also designed I, Robot for Atari, the first commercial video game with 3D filled-polygonal graphics.
Early life
David attended Wheaton College in Chicago initially following a path in Chemistry and then Physics, but with two years to go until completion changed once more to Psychology, earning a degree. He has said that earning the degree had helped him create addictive games by using the same techniques originally used on pigeons.
David worked for the college data processing center for approximately six months after graduating. After which he found a job as a junior programmer at Bunker Ramo Corporation, a company that built supermarket computer systems. He moved to California and joined National Semiconductor in 1976. Six months after joining National Semiconductor a co-worker was hired as Manager of Programmers for Atari Games and subsequently hired David without an interview. Theurer cites Pong as his inspiration to become a game designer.
Atari, Inc.
Despite not liking the sport, David's first game for Atari was Four Player Soccer. During the development of Missile Command, David regularly had nightmares which involved the bombing of nearby towns. These nightmares continued after the game had been completed although their regularity decreased. The idea for Tempest was of monsters appearing from a hole in the ground, a scenario from a movie which Theurer had seen as a child.
The last game he worked on for Atari Games—credited as a programmer—was APB in 1987. He left in 1990 to work full-time on DeBabelizer, an automated image editor, graphics optimizer, and file converter for Windows and Macintosh.
In 2012 Theurer was given the Pioneer Award for his work on Atari arcade games.
Personal life
On the way to fireworks displays at Moffett Field on July 4, 1983, Theurer used his Porsche 928 to chase down a hit-and-run driver who had struck Michael McCully, a 15-year-old boy from Los Altos. Michael suffered a severed spine injury and was paralyzed from the waist down. The driver returned to the scene where the California Highway Patrol arrested him for hit-and-run, drunken driving, giving false information to a police officer and driving without a license. David was praised for his efforts by the California Highway Patrol.
References
External links
Atari people
Living people
People from Fergus Falls, Minnesota
Video game designers
Year of birth missing (living people)
Game Developers Conference Pioneer Award recipients |
https://en.wikipedia.org/wiki/List%20of%20busiest%20airports%20by%20passenger%20traffic | The world's busiest airports by passenger traffic are measured by total passengers (data from Airports Council International), defined as passengers enplaned plus passengers deplaned plus direct-transit passengers. Hartsfield–Jackson Atlanta International Airport has held the top spot as the world's busiest airport each year since 1998, except for 2020, when it was temporarily unseated by Guangzhou Baiyun International Airport due to the effects of the COVID-19 pandemic. Hartsfield–Jackson Atlanta regained the top position in 2021. Alternatively, London has the world's busiest city airport system by passenger count.
As of 2022, the United States accounts for the top four busiest airports in the world. Eight countries have at least two airports in the top 50, with the United States at 19, Turkey with three; and France, Germany, India, Mexico, Spain, and the United Kingdom with two airports each. In terms of regions, North America has 22 airports in the top 50, followed by Europe at 11, Southeast Asia and West Asia each at five, East Asia, South Asia and South America each at two, and Oceania has one.
Graph for the 10 busiest airports
2022 statistics
Source: 2022 report from the Port Authority of New York and New Jersey
2021 statistics
Source: 2021 report from the Port Authority of New York and New Jersey
2020 statistics
Source: 2020 report from the Port Authority of New York and New Jersey.
2019 statistics
Figures as reported by airports are as follows:
2018 statistics
Figures as reported by airports are as follows:
2017 statistics
Airports Council International's full-year figures are as follows:
2016 statistics
Airports Council International's full-year figures are as follows:
2010–2015
2000–2009
See also
List of the busiest airports
List of busiest airports by cargo traffic
List of busiest airports by international passenger traffic
List of busiest airports by aircraft movements
Busiest airports by continent
References
External links
Airports Council International Statistics and Data Centre
Aviation database with passenger traffic of over 1900 airports
Passenger traffic |
https://en.wikipedia.org/wiki/Serious%20%28TV%20series%29 | Serious, Serious Explorers in later series, is an observational documentary series made by the BBC and broadcast as part of their children's programming. It encompasses Serious Jungle (2002), Serious Desert (2003), Serious Arctic (2005), Serious Amazon (2006), Serious Andes (2007), Serious Ocean (2008) and two series of Serious Explorers (2011).
Serious Ocean consisted of ten 30-minute episodes, while each previous series was six 30-minute episodes. In each series a group of eight 12- to 15-year-olds embark on an expedition to an extreme part of the world, in order to help wildlife or assist in environmental projects. The programmes have won numerous awards, among them honours from BAFTA and the Royal Television Society.
Series guide
Serious Jungle (2002)
Serious Jungle was aired around Christmas 2002 and New Year 2003. Chosen from 1,000 applicants, eight adventurers faced a mission to build a feeding platform in the heart of the Borneo jungle, to help return orangutans to the wild (many of them rescued after being illegally kept as pets). They were in the rainforest for three weeks, with the series being filmed in August 2002. The Serious Jungle eight were accompanied by expedition leaders Bruce Parry and Emma Jay.
Larry gave an interview in 2007, giving advice to those about to apply for Serious Ocean, as well as some advice for successful applicants.
Serious Desert (2003)
Serious Desert aired from 20 to 31 October 2003. After 6,500 applications, eight adventurers were chosen to travel to Namibia and try and save the endangered black rhinoceros. They sleep under tarpaulin in the dunes and see black rhinos, but also wildebeest, zebra, springbok, giraffes, jackals, snakes, scorpions and elephants. Filming from 13 April to 5 May 2003, they build a new camel enclosure and finally make an epic fifty mile trek across the Namibian sand dunes to the Skeleton Coast. Returning from the previous series, Bruce Parry and Emma Jay were the expedition leaders who led the team.
Along with Larry from the previous series, Promise was interviewed in 2007, giving her opinion on what it was like to have the cameras following her around on the expedition.
Serious Arctic (2005)
Serious Arctic aired from 5 February to 6 March 2005. Chosen from 9,000 applicants, eight adventurers flew to Baffin Island, Canada, where they made an attempt to track polar bears across the pack ice, riding on husky sleds, with the season being filmed from 4 to 24 April 2004. Blizzards made the trip a hazard, and they spent most of one week in their tents. Serious Arctic was also the most successful Serious series picking up five awards. The expedition leaders for this trip were Ben Major and Emma Jay.
Serious Amazon (2006)
Serious Amazon aired from 25 February to 26 March 2006, and had a then-record of 29,000 12- to 15-year-olds auditioning for a part. The chosen team of eight left for Peru on 9 July 2005, with a mission to help rare uakari monkeys and pink river dolphins caught in |
https://en.wikipedia.org/wiki/ADODB | ADODB may refer to:
ActiveX Data Objects, a Microsoft API for data access
ADOdb, a database abstraction library for PHP |
https://en.wikipedia.org/wiki/Logie%20Awards%20of%202002 | The 44th Annual TV Week Logie Awards was held on Sunday 28 April 2002 at the Crown Palladium in Melbourne, and broadcast on the Nine Network. The ceremony was hosted by Wendy Harmer, and guests included Frankie Muniz and Ronn Moss.
Winners and nominees
In the tables below, winners are listed first and highlighted in bold.
Gold Logie
Acting/Presenting
Most Popular Programs
Most Outstanding Programs
Performers
Shakira – "Whenever, Wherever"
Elton John – "Original Sin"
Destiny's Child – "Bootylicious"
Hall of Fame
After several years on Australian television, Mike Willesee became the 19th inductee into the TV Week Logies Hall of Fame.
References
External links
2002 in Australian television
2002
2002 television awards
2002 awards in Australia |
https://en.wikipedia.org/wiki/WTRF-TV | WTRF-TV (channel 7) is a television station licensed to Wheeling, West Virginia, United States, serving the Wheeling, West Virginia–Steubenville, Ohio market as an affiliate of CBS, MyNetworkTV, and ABC. The station is owned by Nexstar Media Group and maintains studios on 16th Street in downtown Wheeling; its transmitter is located in Bridgeport, Ohio.
WTRF-TV was the first station to specifically serve Wheeling and Steubenville, beginning broadcasting in 1953. It was originally an NBC affiliate before switching to CBS in January 1980. In the 2000s, it expanded to add two new subchannel services.
History
Tri-City Broadcasting Corporation, owner of radio stations WTRF (1290 AM) and WTRF-FM 100.5 across the Ohio River in Bellaire, Ohio, applied to the Federal Communications Commission on April 13, 1948, for a construction permit to build a television station on channel 12, then assigned to Wheeling. Another application was made by radio station WWVA, but before a hearing could be held, the FCC declared a freeze on TV construction permits that was to last four years. The WTRF stations moved to Wheeling proper in 1950, and the application was amended to follow suit; it also was changed to specify channel 7 after the FCC lifted the freeze. WWVA instead opted to pursue channel 9 in Steubenville, Ohio, but two other groups—one consisting of radio station WKWK (1400 AM) and the News Publishing Company and the other being Polan Industries of Huntington, West Virginia—also sought channel 7 after the freeze. Polan opted to abandon the hearing and won a permit for UHF channel 51; to expedite the construction of a station in Wheeling, the WTRF and WKWK groups merged their applications, with the two groups combining. The construction permit was granted on April 22, 1953, and broadcasting began six months later, on October 24. The station made its start date despite fears that it would not be able to begin airing programming because of several parts that failed at the last minute. The primary affiliation was NBC; some CBS programming was aired until WSTV-TV (channel 9, now WTOV-TV) started, and from the start the station also was a secondary outlet of ABC.
The radio stations were sold off in 1954 to John Kluge, with Tri-City retaining WTRF-TV and the call sign. The Dix family, stockholders in Tri-City and publishers of several Ohio newspapers and owners of radio stations in Ohio and Virginia, acquired majority control in 1959. WTRF-TV was sold along with the second WTRF-FM (107.5) in 1969 to Forward Communications of Wausau, Wisconsin, for $7 million. During the 1970s, two reporters with futures in network news started their careers at WTRF-TV: Faith Daniels, later an anchor for NBC and CBS, and Bob Orr, later of CBS News. Also in this decade, the station was carried on the cable system in Canton, Ohio, because it aired Cleveland Browns games that Cleveland-area stations had to black out under National Football League blackout rules of the time.
In 1979, ci |
https://en.wikipedia.org/wiki/Thermal%20expansion%20coefficients%20of%20the%20elements%20%28data%20page%29 |
Thermal expansion
Notes
All values refer to 25 °C unless noted.
References
CRC
As quoted from this source in an online version of: David R. Lide (ed), CRC Handbook of Chemistry and Physics, 84th Edition. CRC Press. Boca Raton, Florida, 2003; Section 12, Properties of Solids; Thermal and Physical Properties of Pure Metals
Touloukian, Y. S., Thermophysical Properties of Matter, Vol. 12, Thermal Expansion, IFI/Plenum, New York, 1975.
CR2
As quoted in an online version of:
David R. Lide (ed), CRC Handbook of Chemistry and Physics, 84th Edition. CRC Press. Boca Raton, Florida, 2003; Section 4, Properties of the Elements and Inorganic Compounds; Physical Properties of the Rare Earth Metals
which further refers to:
Beaudry, B. J. and Gschneidner, K.A., Jr., in Handbook on the Physics and Chemistry of Rare Earths, Vol. 1, Gschneidner, K.A., Jr. and Eyring, L., Eds., North-Holland Physics, Amsterdam, 1978, 173.
McEwen, K.A., in Handbook on the Physics and Chemistry of Rare Earths, Vol. 1, Gschneidner, K.A., Jr. and Eyring, L., Eds., North-Holland Physics, Amsterdam, 1978, 411.
LNG
As quoted from this source in an online version of: J.A. Dean (ed), Lange's Handbook of Chemistry (15th Edition), McGraw-Hill, 1999; Section 4; Table 4.1, Electronic Configuration and Properties of the Elements
Touloukian, Y. S., Thermophysical Properties of Matter, Vol. 12, Thermal Expansion, Plenum, New York, 1975.
WEL
As quoted at http://www.webelements.com/ from these sources:
D.R. Lide, (Ed.) in Chemical Rubber Company handbook of chemistry and physics, CRC Press, Boca Raton, Florida, USA, 79th edition, 1998.
A.M. James and M.P. Lord in Macmillan's Chemical and Physical Data, Macmillan, London, UK, 1992.
G.W.C. Kaye and T. H. Laby in Tables of physical and chemical constants, Longman, London, UK, 15th edition, 1993.
J.A. Dean (ed) in Lange's Handbook of Chemistry, McGraw-Hill, New York, USA, 14th edition, 1992.
Properties of chemical elements
Chemical element data pages |
https://en.wikipedia.org/wiki/Social%20contact | Social contact can refer to:
In the sociological hierarchy leading up to social relations, an incidental social interaction between individuals
In social networks, a node (representing an individual or organization) to which another node is socially
See also
Social contract
Interpersonal relationship |
https://en.wikipedia.org/wiki/Richard%20O%27Keefe | Richard A. O'Keefe is a computer scientist best known for writing the influential 1990 book on Prolog programming, The Craft of Prolog. He was a lecturer and researcher at the department of computer science at the University of Otago in Dunedin, New Zealand and concentrates on programming languages for logic programming and functional programming, including Prolog, Haskell, and Erlang.
References
External links
, University of Otago
Programming language researchers
New Zealand computer scientists
Living people
Year of birth missing (living people)
Academic staff of the University of Otago
University of Otago alumni |
https://en.wikipedia.org/wiki/Data%20General/One | The Data General/One (DG-1) was a laptop introduced in 1984 by Data General.
Description
The nine-pound battery-powered 1984 Data General/One ran MS-DOS and had dual 3.5" diskettes, a 79-key full-stroke keyboard, 128 KB to 512 KB of RAM, and a monochrome LCD screen capable of either the standard 80×25 characters or full CGA graphics (640×200). It was a laptop comparable in capabilities to desktops of the era.
History
The Data General/One offered several features in comparison with contemporary portable computers. For instance, the popular 1983 Radio Shack TRS-80 Model 100, a non-PC-compatible machine, was comparably sized. It was a small battery-operated computer resting in one's lap, but had a 40×8 character (240×64 pixel) screen, a rudimentary ROM-based menu in lieu of a full OS, and no built-in floppy. IBM's 1984 Portable PC was comparable in capability with desktops, but was not battery operable and, being much larger and heavier, was by no means a laptop.
Drawbacks
The DG-1 was only a modest success. One problem was its use of 3.5" diskettes. Popular software titles were thus not widely available (5.25" being still the standard), a serious issue since then-common diskette copy-protection schemes made it difficult for users to copy software into that format. The device achieved moderate success in a large OEM deal with Allen-Bradley, where it was private labelled as a T-45 "programming terminal" and was resold from 1987 to 1991 with thousands of units sold.
The CPU was a CMOS version of the 8086, compatible with the IBM PC's 8088 except it ran slightly slower, at 4.0 MHz instead of the standard 4.77 MHz.
Unlike the Portable PC, the DG-1 laptop could not take regular PC/XT expansion cards.
RS-232 serial ports were built-in, but the CMOS (low battery consumption) serial I-O chip available at design time, a CMOS version of the Intel 8251, was register incompatible with the 8250 serial IC standard for the IBM PC. As a result, software written for the PC serial ports would not run correctly. This required the use of software written using the relatively slower and less flexible BIOS interrupt call (014h), or software written exclusively for the DG-1.
Video memory came out of that available for the operating system; for example, if 256 KB of RAM was installed, only 204 KB might be available to the operating system and user's programs.
Although Creative Computing termed the price of US$2895 "competitive," it was a very expensive system, and usually-needed additions such as more RAM and an external 5" drive drove the price higher yet. The styling of the product, including a bag designed by Pierre Cardin, implied a more up-market buyer than many typical PC buyers of the time.
The Data General/One also had a built-in dumb terminal emulator, suggesting an attempt to attract as customers those in organisations with large, expensive minicomputers or mainframes that would access corporate data via terminals such as the ADM-3A or Data General's |
https://en.wikipedia.org/wiki/Creative%20Computing%20%28magazine%29 | Creative Computing was one of the earliest magazines covering the microcomputer revolution. Published from October 1974 until December 1985, the magazine covered the spectrum of hobbyist/home/personal computing in a more accessible format than the rather technically oriented Byte.
The magazine was created to cover educational-related topics. Early issues include articles on the use of computers in the classroom, various simple programs like madlibs and various programming challenges, mostly in BASIC. By the late 1970s, it had moved towards more general coverage as the microcomputer market emerged. Hardware coverage became more common, but type-in programs remained common into the early 1980s.
The company published several books, the most successful being BASIC Computer Games, the first million-selling computer book. Their Best of Creative Computing collections were also popular. Creative Computing also published software on cassette and floppy disk for the popular computer systems of the time and had a small hardware business.
Ziff-Davis purchased Creative Computing in 1982 and closed the non-magazine endeavors.
History
DEC and Edu
Prior to starting Creative Computing, in the early 1970s David H. Ahl was working in the educational department of Digital Equipment Corporation (DEC) where he started publication of their Edu newsletter in the spring of 1971. At the time, DEC had an estimated 2,000 to 3,000 machines being used in educational settings, so he was surprised to find the number of subscribers reach 20,000 after 18 months. He found that many subscribers did not have a DEC machine but were using Edu as a source of general information on computers in educational settings. This began his earliest thoughts about a non-DEC magazine aimed at this market.
On 22 February 1973, Ahl was let go during a downsizing at DEC. Even before he received his last paycheck, he was hired by a different department to help develop new low-end versions of the DEC minicomputer line. During this period he collected many user submissions to Edu and convinced DEC to publish 101 BASIC Computer Games in the summer of 1973. This was a hit, eventually selling over 10,000 copies in three publishing runs in July 1973, April 1974, and March 1975.
By 1974, the team had produced two new designs, a PDP-8 combined with a VT50 terminal, and a briefcase-sized version of the PDP-8 with a small floppy disk that would be used with an external computer terminal. Other divisions within DEC saw these inexpensive machines as a threat to their own products and agitated against them, causing debates that eventually worked their way to the CEO. When the new designs were personally canceled by Ken Olsen with the statement that "I can't see any reason that anyone would want a computer of his own" Ahl quit DEC and took a position at AT&T.
Formation
It was at this point that Ahl decided to move ahead with the educational-focused magazine. Reasoning that the educational market would be o |
https://en.wikipedia.org/wiki/Pyburn%20Films | Pyburn Films is a television and film production company in New York City that specializes in original content and long-form programming.
Information
Pyburn Films also conceived and created AXIS Graphics. The technology and privately held company (AXIS Graphics, LLC) was acquired in January 2008 by the Chyron Corporation. Pyburn Films is an Emmy Award-winning entertainment company. They are located in New York City's Time Square. They are a company that is known for image branding, content development, and new technology. Altogether, Pyburn Films has created over a hundred hours of cable and broadcast television original programming. The Pyburn Film team includes software developers and technology specialists.
References
Companies based in New York City
Film production companies of the United States
Television production companies of the United States |
https://en.wikipedia.org/wiki/Extended%20affix%20grammar | In computer science, extended affix grammars (EAGs) are a formal grammar formalism for describing the context free and context sensitive syntax of language, both natural language and programming languages.
EAGs are a member of the family of two-level grammars; more specifically, a restriction of Van Wijngaarden grammars with the specific purpose of making parsing feasible.
Like Van Wijngaarden grammars, EAGs have hyperrules that form a context-free grammar except in that their nonterminals may have arguments, known as affixes, the possible values of which are supplied by another context-free grammar, the metarules.
EAGs were introduced and studied by D.A. Watt in 1974; recognizers were developed at the University of Nijmegen between 1985 and 1995. The EAG compiler developed there will generate either a recogniser, a transducer, a translator, or a syntax directed editor for a language described in the EAG formalism. The formalism is quite similar to Prolog, to the extent that it borrowed its cut operator.
EAGs have been used to write grammars of natural languages such as English, Spanish, and Hungarian. The aim was to verify the grammars by making them parse corpora of text (corpus linguistics); hence, parsing had to be sufficiently practical. However, the parse tree explosion problem that ambiguities in natural language tend to produce in this type of approach is worsened for EAGs because each choice of affix value may produce a separate parse, even when several different values are equivalent. The remedy proposed was to switch to the much simpler Affix Grammar over a Finite Lattice (AGFL) instead, in which metagrammars can only produce simple finite languages.
See also
Affix grammar
Corpus linguistics
External links
Informal introduction to the Extended Affix Grammar formalism and its compiler, by Marc Seutter, University of Nijmegen
EAG project website, University of Nijmegen
public announcement of the EAG software release, in comp.compilers, by Marc Seutter, 1993
Formal languages
Syntax
Parsing
Corpus linguistics
Grammar frameworks |
https://en.wikipedia.org/wiki/WorldWide%20Access | WorldWide Access, also known as WWA, was an Internet Service Provider based in Chicago, Illinois. WorldWide Access was the service name of the company, which was called Computing Engineers, Inc.
WorldWide Access operated from 1993 until 1998, when it was acquired by Verio. At that time, WWA was located on the nineteenth floor of the Civic Opera Building at 20 N. Wacker Dr., where it had moved from the seventh floor six months earlier.
Services
WorldWide Access offered typical ISP accounts of the era, including terminal dial-up into BSD/OS UNIX shell systems, SLIP, and PPP; web hosting; UUCP and mail hosting; DNS registration and hosting; and leased-line circuits. The company also offered tech support for Macintosh computers, which was somewhat of a rarity at the time. WorldWide Access focused its sales efforts on signup up corporate clients but the company also served thousands of residential customers. The company focused heavily on customer service excellence and was considered to be one of the better ISP operations in the Chicago area.
MagicServer
WWA was one of the first ISPs in the Chicago area to capitalize on virtual web hosting, by custom-coding virtual hosting into the NCSA httpd webserver before it was a core part of the product. This service was called MagicServer (another service mark of the corporation). The MagicServer version of httpd worked around some of the problems that plagued other implementations, such as the number of open file descriptors on the system, but had issues of its own which led to its eventual abandonment in favor of the standard built-in Apache virtual hosting.
MagicServer hosts originally also ran on the BSD/OS shell servers, but were relocated to Sun SPARC hosts running Solaris in 1996. These were tako and anago, and later gari and soba were added.
Acquisition and the local competitors
WorldWide Access was ultimately only one of several Chicago-based small Internet providers, which, in the end, were nearly all swallowed up by larger providers. WWA was the first to be sold, to Verio, in April 1998.
EnterAct was acquired in 1998 by 21st Century, which was in turn later acquired by RCN Communications
American Information Systems ("AISNet") was acquired in 1999 by Exodus Communications
MCSNet was acquired in August 1998 by Winstar Communications
Tezcatlipoca ("Tezcat") was acquired in 2000 by Ripco
InterAccess was acquired in 2000 by Allegiance Telecom
Of the major local providers, only Ripco remained unsold, and it still operates independently as of 2017.
References
Companies based in Chicago
Telecommunications companies established in 1993
Internet service providers of the United States |
https://en.wikipedia.org/wiki/Ease%20%28programming%20language%29 | Ease is a general purpose parallel programming language. It is designed by Steven Ericsson-Zenith, a researcher at Yale University, the Institute for Advanced Science & Engineering in Silicon Valley, California, the Ecole Nationale Supérieure des Mines de Paris, and the Pierre and Marie Curie University, the science department of the Sorbonne.
The book Process Interaction Models is the Ease language specification. Ease combines the process constructs of communicating sequential processes (CSP) with logically shared data structures called contexts. Contexts are parallel data types that are constructed by processes and provide a way for processes to interact.
The language includes two process constructors.
A cooperation includes an explicit barrier synchronization and is written:
If one process finishes before the other, then it will wait until the other processes are finished.
A subordination creates a process that shares the contexts that are in scope when created and finishes when complete (it does not wait for other processes) and is written:
Subordinate processes stop if they attempt to interact with a context that has completed because the parent process has stopped. This enables speculative processes to be created that will finish if their result is not needed.
Powerful replication syntax allows multiple processes to be created. For example,
creates n synchronized processes each with a local constant i.
Processes cannot share local variables and cooperate in the construction of shared contexts. Certain context types, called resources, ensure call-reply semantics.
There are four functions upon contexts:
– copies a value from the shared context to the variable.
– copies the value of expression to the shared context.
– moves the value bound to name to the shared context. The value of name is subsequently undefined.
– moves a value from context and binds it to name. The value is removed from the context.
Context types are Singletons, Bags or Streams and can be subscripted arrays.
Ease has a semiotic definition. This means that it accounts for the effect the language has on the programmer and how they develop algorithms. The language was designed to ease the developing of parallel programs.
References
Bibliography
John Redman, An Implementation of the Ease Programming Language, University of Western Australia, 1991
T.H. MacKenzie, T.I. Dix, "A distributed memory multiprocessor implementation of C-with-Ease," IEEE International Conference on Parallel and Distributed Systems, 2002
T.H. MacKenzie, T.I. Dix, "Object-Oriented Ease-Based Parallel Primitives in C++," icpads, p. 623, 1998 International Conference on Parallel and Distributed Systems (ICPADS'98), 1998
Concurrent programming languages
Concurrency control |
https://en.wikipedia.org/wiki/ICOC | ICOC may refer to:
International Churches of Christ, a global family/network of churches.
International Code of Conduct against Ballistic Missile Proliferation, also known as the "Hague Code of Conduct"
International Commission for Orders of Chivalry, a scholarly organization studying chivalric orders.
International Code of Conduct for Private Security Service Providers
See also
ICC (disambiguation), listing many organizations whose names may also be abbreviated "ICOC" |
https://en.wikipedia.org/wiki/Adam7%20algorithm | Adam7 is an interlacing algorithm for raster images, best known as the interlacing scheme optionally used in PNG images. An Adam7 interlaced image is broken into seven subimages, which are defined by replicating this 8×8 pattern across the full image.
The subimages are then stored in the image file in numerical order.
Adam7 uses seven passes and operates in both dimensions, compared to only four passes in the vertical dimension used by GIF. This means that an approximation of the entire image can be perceived much more quickly in the early passes, particularly if interpolation algorithms such as bicubic interpolation are used.
History
Adam7 is named after Adam M. Costello, who suggested the method on February 2, 1995, and after the seven steps involved.
It is a rearrangement of this five-pass scheme that had earlier been proposed by Lee Daniel Crocker:
Alternative speculative proposals at the time included square spiral interlacing and using Peano curves, but these were rejected as being overcomplicated.
Passes
The pixels included in each pass, and the total pixels encoded at that point are as follows:
When rendering, the image will generally be interpolated at earlier stages, rather than just these pixels being rendered.
Related algorithms
Adam7 is a multiscale model of the data, similar to a discrete wavelet transform with Haar wavelets, though it starts from an 8×8 block, and downsamples the image, rather than decimating (low-pass filtering, then downsampling). It thus offers worse frequency behavior, showing artifacts (pixelation) at the early stages, in return for simpler implementation.
Iteration
Adam7 arises from iteration of the following pattern:
which may be interpreted as "folding" in the vertical and horizontal dimensions. Similarly, GIF interlacing can be seen as iteration of the pattern, but only in the vertical direction ( expands to which is filled in as ).
Using this 3-pass pattern means the first pass is (1/2)2 = 1/4 (25%) of the image.
Iterating this pattern once yields a 5-pass scheme; after 3 passes this yields
which is then filled in to:
In the 5-pass pattern, the first pass (1/4)2 = 1/16 (6.25%) of the image.
Iterating again yields the 7-pass Adam7 scheme, where the first pass (1/8)2 = 1/64 (1.5625%) of the image.
In principle this can be iterated, yielding a 9-pass scheme, an 11-pass scheme, and so forth, or alternatively an adaptive number of passes can be used, as many as the image size will allow (so the first pass consists of a single pixel), as is usual in scale-free multiscale modeling. In the context that PNG was developed (i.e., for the image sizes and connection speeds in question), a 7-pass scheme was seen as sufficient, and preferable to a simple 5-pass scheme.
References
External links
Animated comparison of Adam7 and GIF interlacing
Lossless compression algorithms
Image compression |
https://en.wikipedia.org/wiki/Micallef%20Tonight | Micallef Tonight was a short-lived Aria Award-winning Australian variety show that aired on the Nine Network in 2003. It was hosted by comedian Shaun Micallef and also featured the talents of Francis Greenslade, Jason Geary, Livinia Nixon and Pete Smith.
Show content
Much like a typical variety show, each episode of Micallef Tonight featured a number of interviews with celebrities bookended by regular segments (such as "Shaun on his High Horse", which featured Micallef ranting against pop culture while straddling a gymnast vaulting horse) and a musical performance. However at times the show also delved into the realm of parody, such as introducing guest Jamie Durie with a long-winded opening only to dismiss him immediately afterwards since there was nothing left to discuss, and requesting that guest Alison Whyte hold an inflatable fish while Micallef himself danced on his desk, in an otherwise unrelated interview.
Other in-show shenanigans included stealing musical guest Delta Goodrem's shoes as she played the piano, deliberately leaving actress Melissa George, live via satellite from Hollywood, on hold for over five minutes (she had guest starred in a supersized episode of Friends earlier that night, effectively delaying the broadcast of Micallef Tonight by several minutes), and requesting singers insert random words in to their musical performances to prove they weren't lip-synching. Notable examples were David Campbell inserting the word "lamington" into his performance and Amiel inserting the word "dolphinarium".
Micallef would end each episode with the line "See you in the Monkey House Australia!" and the show would usually close with a musical performance from Greenslade that was never quite what the audience expected; such as a rendition of Billy Joel's "Piano Man" played on the guitar.
Micallef previously parodied the variety show format with 1998's The Micallef Program.
Episodes
Cancellation
The series premiered on 12 May 2003 and thirteen episodes were aired. The first episode rated strongly and although ratings declined steadily thereafter, it was announced in June 2003 that the series would be extended for a further 20 weeks.
Episode 12 (28 July) included a segment involving a midget hassling random restaurant patrons; after it screened, guest Tony Martin pointed out that the last show he had been involved in which featured the same midget actor -- (The Mick Molloy Show) -- had been axed. In an example of history repeating itself, Micallef Tonight was cancelled the following week. In addition, on an earlier episode during a live cross to promote the movie Bad Eggs, a visibly intoxicated Mick Molloy warned Micallef to "watch (his) arse" when he learned that the show was on the Nine Network.
Micallef ended his series with an interview with Ricky Martin in which both he and Martin used an expletive on live television, then called Nine Network live on air to complain about the language used on his show. Ironically, the interview |
https://en.wikipedia.org/wiki/NEC%20SX | NEC SX describes a series of vector supercomputers designed, manufactured, and marketed by NEC. This computer series is notable for providing the first computer to exceed 1 gigaflop, as well as the fastest supercomputer in the world between 1992–1993, and 2002–2004. The current model, as of 2018, is the SX-Aurora TSUBASA.
History
The first models, the SX-1 and SX-2, were announced in April 1983, and released in 1985. The SX-2 was the first computer to exceed 1 gigaflop. The SX-1 and SX-1E were less powerful models offered by NEC.
The SX-3 was announced in 1989, and shipped in 1990. The SX-3 allows parallel computing using both SIMD and MIMD. It also switched from the ACOS-4 based SX-OS, to the AT&T System V UNIX-based SUPER-UX operating system. In 1992 an improved variant, the SX-3R, was announced. A SX-3/44 variant was the fastest computer in the world between 1992-1993 on the TOP500 list. It had LSI integrated circuits with 20,000 gates per IC with a per-gate delay time of 70 picoseconds, could house 4 arithmetic processors with up to 4 sharing the same main memory, and up to several processors to achieve up to 22 GFLOPS of performance, with 1.37 GFLOPS of performance with a single processor. 100 LSI ICs were housed in a single multi chip module to achieve 2 million gates per module. The modules were watercooled.
The SX-4 series was announced in 1994, and first shipped in 1995. Since the SX-4, SX series supercomputers are constructed in a doubly parallel manner. A number of central processing units (CPUs) are arranged into a parallel vector processing node. These nodes are then installed in a regular SMP arrangement.
The SX-5 was announced and shipped in 1998, with the SX-6 following in 2001, and the SX-7 in 2002. Starting in 2001, Cray marketed the SX-5 and SX-6 exclusively in the US, and non-exclusively elsewhere for a short time.
The Earth Simulator, built from SX-6 nodes, was the fastest supercomputer from June 2002 to June 2004 on the LINPACK benchmark, achieving 35.86 TFLOPS. As of 2020, 3 Nvidia RTX 2080 Ti graphics cards can deliver comparable performance, at 14 TFLOPS per card. The SX-9 was introduced in 2007 and discontinued in 2015.
Tadashi Watanabe has been NEC's lead designer for the majority of SX supercomputer systems. For this work he received the Eckert–Mauchly Award in 1998 and the Seymour Cray Computer Engineering Award in 2006.
Hardware
Each system has multiple models, and the following table lists the most powerful variant of each system. Further certain systems have revisions, identified by a letter suffix.
Software environment
Operating system
The SX-1 and SX-2 ran the ACOS-4 based SX-OS. The SX-3 onwards run the SUPER-UX operating system (OS); the Earth Simulator runs a custom version of this OS.
Compilers
SUPER-UX comes with Fortran and C++ compilers. Cray has also developed an Ada compiler which is available as an option.
Software
Some vertical applications are available through NEC, but in general cust |
https://en.wikipedia.org/wiki/List%20of%20backup%20software | This is a list of notable backup software that performs data backups. Archivers, transfer protocols, and version control systems are often used for backups but only software focused on backup is listed here. See Comparison of backup software for features.
Free and open-source software
Commercial and closed-source software
Defunct software
See also
Comparison of file synchronization software
Comparison of online backup services
Data recovery
File synchronization
List of data recovery software
Remote backup service
Tape management system
Notes
References
Backup software |
https://en.wikipedia.org/wiki/Deductive%20database | A deductive database is a database system that can make deductions (i.e. conclude additional facts) based on rules and facts stored in its database. Datalog is the language typically used to specify facts, rules and queries in deductive databases. Deductive databases have grown out of the desire to combine logic programming with relational databases to construct systems that support a powerful formalism and are still fast and able to deal with very large datasets. Deductive databases are more expressive than relational databases but less expressive than logic programming systems such as Prolog.
In recent years, deductive databases have found new application in data integration, information extraction, networking, program analysis, security, and cloud computing.
Deductive databases reuse many concepts from logic programming; rules and facts specified in Datalog look very similar to those written in Prolog, but there are some important differences:
Order sensitivity and procedurality: In Prolog, program execution depends on the order of rules in the program and on the order of parts of rules; these properties are used by programmers to build efficient programs. In database languages (like SQL or Datalog), however, program execution is independent of the order of rules and facts.
Special predicates: In Prolog, programmers can directly influence the procedural evaluation of the program with special predicates such as the cut. This has no correspondence in deductive databases.
Function symbols: Logic programming languages allow function symbols to build up complex symbols. This is not allowed in deductive databases.
Tuple-oriented processing: Deductive databases use set-oriented processing while logic programming languages concentrate on one tuple at a time.
References
Further reading
Author: Herve Gallaire, Jack Minker, Jean-Marie Nicolas: Logic and Databases: A Deductive Approach. Publisher: ACM. doi:10.1145/356924.356929
Author: Stefano Ceri, Georg Gottlob, Letizia Tanca: Logic Programming and Databases. Publisher: Springer-Verlag.
Author: Ramez Elmasri and Shamkant Navathe: Fundamentals of Database Systems (3rd edition). Publisher: Addison-Wesley Longman.
Database management systems |
https://en.wikipedia.org/wiki/IBM%20TouchMobile | The IBM TouchMobile is a robust and practical hand-held computer announced by IBM in 1993. This device has a bar code scanner with on-screen signature and data capture. Certain models are capable of wireless communication.
The hand-held computer used a version of embedded DOS. The processor was an 80C88 processor. The system design also used 1.5 MB of PSRAM (Pseudostatic DRAM) and two custom chips.
References
TouchMobile |
https://en.wikipedia.org/wiki/Electronic%20organizer | An electronic organizer (or electric organizer) is a small calculator-sized computer, often with an built-in diary application and other functions such as an address book and calendar, replacing paper-based personal organizers. Typically, it has a small alphanumeric keypad and an LCD screen of one, two, or three lines. The electronic diary or organizer was invented by Indian businessman Satyan Pitroda in 1975, who is regarded as one of the earliest pioneers of hand-held computing because of his invention of the Electronic Diary in 1975.
They were very popular especially with businessmen during the 1990s, but because of the advent of palmtop PCs in the 1990s, personal digital assistants in the 2000s, and smartphones in the 2010s, all of which have a larger set of features, electronic organizers are mostly seen today for research purposes. One of the leading research topics being the study of how electronics can help people with mental disabilities use this type of equipment to aid their daily life. Electronic organizers have more recently been used to support people with Alzheimer's disease to have a visual representation of a schedule.
Casio digital diary
Casio digital diaries were produced by Casio in the early and mid 1990s, but have since been entirely superseded by Mobile Phones and PDAs.
Other electronic organizers
While Casio was a major role player in the field of electronic organizers there were many different ideas, patent requests, and manufacturers of electronic organizers. Rolodex, widely known for their index card holders in the 1980s, Sharp Electronics, mostly known for their printers and audio visual equipment, and lastly Royal electronics were all large contributors to the electronic organizer in its heyday.
Features
Telephone directory
Schedule keeper: Keep track of appointments.
Memo function: Store text data such as price lists, airplane schedules, and more.
To do list: Keep track of daily tasks, checking off items as you complete them.
World time: Find out the current time in virtually any location on the globe.
Secret memory area: The secret memory area keeps personal data private. Once a password is registered, data is locked away until the password is used to access the secret area.
Alarm
Metric conversion function: Conversion between metric units and another measurement unit.
Currency conversion function
Game: Some machines included a game such as Poker or Blackjack.
See also
Pocket electronic dictionary
Personal digital assistant (PDA)
Smartphone
Pocket computer
References
External links
Mobile computers |
https://en.wikipedia.org/wiki/Bidirectional%20Forwarding%20Detection | Bidirectional Forwarding Detection (BFD) is a network protocol that is used to detect faults between two routers or switches connected by a link. It provides low-overhead detection of faults even on physical media that doesn't support failure detection of any kind, such as Ethernet, virtual circuits, tunnels and MPLS label-switched paths.
BFD establishes a session between two endpoints over a particular link. If more than one link exists between two systems, multiple BFD sessions may be established to monitor each one of them. The session is established with a three-way handshake, and is torn down the same way. Authentication may be enabled on the session. A choice of simple password, MD5 or SHA1 authentication is available.
BFD does not have a discovery mechanism; sessions must be explicitly configured between endpoints. BFD may be used on many different underlying transport mechanisms and layers, and operates independently of all of these. Therefore, it needs to be encapsulated by whatever transport it uses. For example, monitoring MPLS LSPs involves piggybacking session establishment on LSP-Ping packets. Protocols that support some form of adjacency setup, such as OSPF, IS-IS, BGP or RIP may also be used to bootstrap a BFD session. These protocols may then use BFD to receive faster notification of failing links than would normally be possible using the protocol's own keepalive mechanism.
A session may operate in one of two modes: asynchronous mode and demand mode. In asynchronous mode, both endpoints periodically send Hello packets to each other. If a number of those packets are not received, the session is considered down.
In demand mode, no Hello packets are exchanged after the session is established; it is assumed that the endpoints have another way to verify connectivity to each other, perhaps on the underlying physical layer. However, either host may still send Hello packets if needed.
Regardless of which mode is in use, either endpoint may also initiate an Echo function. When this function is active, a stream of Echo packets is sent, and the other endpoint then sends these back to the sender via its forwarding plane. This is used to test the forwarding path on the remote system.
Standardization
In June 2011 the BFD protocol standardization process entered the Proposed Standard stage. RFC 5880 defines the BFD protocol, detecting MPLS LSP failure, using BFD to monitor connectivity across multiple network hops, and using BFD for IPv4 and IPv6. BFD's operation in conjunction with Open Shortest Path First (OSPF) and IS-IS protocols has also been outlined in RFC 5881..
References
External links
IETF BFD Working Group
BFD presentation by Juniper Networks
NetworkWorld article: Reducing Link Failure Detection Time with BFD
Internet protocols
Internet Standards
Network management |
https://en.wikipedia.org/wiki/Kept | Kept is a reality television series that centered on Jerry Hall (model and ex-wife to Mick Jagger) searching for a kept man. The show premiered on the American cable network VH1 in late May 2005. When Hall narrowed the list down to twelve, she spirited them off to London and eliminated them one by one.
The final three consisted of Anwar, Austen and Seth. In the August 4 finale, Hall was torn between Austen and Seth but ultimately chose Seth as he knew how to have fun and she thought he had matured throughout the process. Seth claims that he got his $100,000 in prize money but after filming stopped he never saw Jerry, the penthouse apartment, or the Lamborghini again.
Contestants
Seth Frye
Austen Earl
Jon Benarroch
Brian Bergdoll
Mike Biloto
Maurizio Farhad
Jason Fromer
Anwar Jenkins
Jeanne Marine
Ricardo Medina, Jr.
Devonric Johnson
Mike Piloto
Frank Trigg
Slavco Tuskaloski
Controversy
The show, when aired in the United Kingdom on the channel VH1 UK, caused a small controversy when adverts were banned from London Underground stations. The posters in question depicted Jerry Hall holding a leash, surrounded by several young semi-dressed men, and this violated London Underground's policy of adverts featuring people as sex objects. However, the posters were on display in other locations including mainline railway stations.
References
External links
2005 American television series debuts
2005 American television series endings
2000s American reality television series
VH1 original programming
American dating and relationship reality television series
English-language television shows |
https://en.wikipedia.org/wiki/Custom%20PC%20%28magazine%29 | Custom PC (usually abbreviated to 'CPC') was a UK-based computer magazine originally published by Dennis Publishing Ltd and subsequently sold to Raspberry Pi Trading Ltd. It was aimed at PC hardware enthusiasts, covering topics such as modding, overclocking, and PC gaming. The first issue was released in October 2003 and it was published monthly until the final issue, number 235, was released in February 2023.
In February 2023 the magazine ceased printed production and the brand name and content rights were sold to Network N Media who relaunched the brand as an online-only entity CustomPC.com.
Audited circulation figures for the magazine were 9,428 (ABC, Jan–Dec 2014). Gareth Ogden retired as editor of Custom PC at the end of Issue 52. Issue 53 was edited by Deputy Editor James Gorbold; from Issue 54 onwards the magazine was edited by Alex Watson. From Issue 87 to Issue 102 the magazine was edited by James Gorbold. From Issue 103 onward, the magazine has been edited by Ben Hardwidge.
Between 2009 and January 2012, the magazine was partnered with enthusiast site bit-tech.net, with the two editorial teams merging and sharing resources across both the site and the magazine. Custom PCs James Gorbold took over as Group Editor of the two teams. However, since February 2012, the two brands have separated and content is no longer shared between the two publications, although many of the magazine's writers continue to write for bit-tech.
In February 2019 the magazine, along with Digital SLR Photography Magazine, was sold to Raspberry Pi Trading, a subsidiary of the Raspberry Pi Foundation.
Issue 235 in February 2023 became the final issue available in printed format.
Sections
The magazine includes reviews, features, tutorials, analysis columns and sections devoted to magazine readers. The most current regular sections includes:
From the EditorIntroductory column by the editor Ben Hardwidge
Tracy KingSceptical analysis of the ways in which technology and gaming are presented in the media
Richard SwinburneAnalysis of hardware trends in Taiwan
Hobby TechTips, tricks and news about computer hobbyism, including Raspberry Pi, Arduino and retro computing, by Gareth Halfacree
Folding@Custom PCCustom PC encourages readers to use their idle computers for the purpose of scientific research – Folding@home is a program created and run by Stanford University that uses spare processor cycles to simulate protein folding for disease research. Each month the magazine features a league table of their top folders, the 'Custom PC & bit-tech' team is currently ranked number 6 worldwide. One random folder receives an item of PC hardware each month (stopped in 2010), while the top folder that month is noted in the 'Folder of the month' section.
CPC EliteA 10-page section of CPC's latest recommendations for the best hardware in several categories (motherboards, processors, cases etc.).
Reviews CPC Magazine review the latest hardware and software (including games), the |
https://en.wikipedia.org/wiki/Hierarchical%20storage%20management | Hierarchical storage management (HSM), also known as Tiered storage, is a data storage and Data management technique that automatically moves data between high-cost and low-cost storage media. HSM systems exist because high-speed storage devices, such as solid state drive arrays, are more expensive (per byte stored) than slower devices, such as hard disk drives, optical discs and magnetic tape drives. While it would be ideal to have all data available on high-speed devices all the time, this is prohibitively expensive for many organizations. Instead, HSM systems store the bulk of the enterprise's data on slower devices, and then copy data to faster disk drives when needed. The HSM system monitors the way data is used and makes best guesses as to which data can safely be moved to slower devices and which data should stay on the fast devices.
HSM may also be used where more robust storage is available for long-term archiving, but this is slow to access. This may be as simple as an off-site backup, for protection against a building fire.
HSM is a long-established concept, dating back to the beginnings of commercial data processing. The techniques used though have changed significantly as new technology becomes available, for both storage and for long-distance communication of large data sets. The scale of measures such as 'size' and 'access time' have changed dramatically. Despite this, many of the underlying concepts keep returning to favour years later, although at much larger or faster scales.
Implementation
In a typical HSM scenario, data which is frequently used are stored on warm storage device, such as solid state disk (SSD). Data that is infrequently accessed is, after some time migrated to a slower, high capacity cold storage tier. If a user does access data which is on the cold storage tier, it is automatically moved back to warm storage. The advantage is that the total amount of stored data can be much larger than the capacity of the warm storage device, but since only rarely used files are on cold storage, most users will usually not notice any slowdown.
Conceptually, HSM is analogous to the cache found in most computer CPUs, where small amounts of expensive SRAM memory running at very high speeds is used to store frequently used data, but the least recently used data is evicted to the slower but much larger main DRAM memory when new data has to be loaded.
In practice, HSM is typically performed by dedicated software, such as IBM Tivoli Storage Manager, or Oracle's SAM-QFS.
The deletion of files from a higher level of the hierarchy (e.g. magnetic disk) after they have been moved to a lower level (e.g. optical media) is sometimes called file grooming.
History
Hierarchical Storage Manager (HSM, then DFHSM and finally DFSMShsm) was first implemented by IBM on March 31, 1978 for MVS to reduce the cost of data storage, and to simplify the retrieval of data from slower media. The user would not need to know where the data was stored a |
https://en.wikipedia.org/wiki/Logie%20Awards%20of%202001 | The 43rd Annual TV Week Logie Awards was held on Sunday 22 April 2001 at the Crown Palladium in Melbourne, and broadcast on the Nine Network. The ceremony was hosted by Shaun Micallef, and guests included Michael Crawford and Christopher Ellison.
Winners and nominees
In the tables below, winners are listed first and highlighted in bold.
Gold Logie
Acting/Presenting
Most Popular Programs
Most Outstanding Programs
Performers
Ricky Martin – "She Bangs" and "Loaded"
Human Nature – A medley
Vanessa Amorosi – "Shine"
Hall of Fame
After several years on Australian television, Ruth Cracknell became the 18th inductee into the TV Week Logies Hall of Fame.
References
External links
2001
2001 television awards
2001 in Australian television
2001 awards in Australia |
https://en.wikipedia.org/wiki/Data%20Distribution%20Service | The Data Distribution Service (DDS) for real-time systems is an Object Management Group (OMG) machine-to-machine (sometimes called middleware or connectivity framework) standard that aims to enable dependable, high-performance, interoperable, real-time, scalable data exchanges using a publish–subscribe pattern.
DDS addresses the real-time data exchange needs of applications within aerospace, defense, air-traffic control, autonomous vehicles, medical devices, robotics, power generation, simulation and testing, smart grid management, transportation systems, and other applications.
Architecture
Model
DDS is a networking middleware that simplifies complex network programming. It implements a publish–subscribe pattern for sending and receiving data, events, and commands among the nodes. Nodes that produce information (publishers) create "topics" (e.g., temperature, location, pressure) and publish "samples". DDS delivers the samples to subscribers that declare an interest in that topic.
DDS handles transfer chores: message addressing, data marshalling and de-marshalling (so subscribers can be on different platforms from the publisher), delivery, flow control, retries, etc. Any node can be a publisher, subscriber, or both simultaneously.
The DDS publish-subscribe model virtually eliminates complex network programming for distributed applications.
DDS supports mechanisms that go beyond the basic publish-subscribe model. The key benefit is that applications that use DDS for their communications are decoupled. Little design time needs be spent on handling their mutual interactions. In particular, the applications never need information about the other participating applications, including their existence or locations. DDS transparently handles message delivery without requiring intervention from the user applications, including:
determining who should receive the messages
where recipients are located
what happens if messages cannot be delivered
DDS allows the user to specify quality of service (QoS) parameters to configure discovery and behavior mechanisms up-front. By exchanging messages anonymously, DDS simplifies distributed applications and encourages modular, well-structured programs.
DDS also automatically handles hot-swapping redundant publishers if the primary fails. Subscribers always get the sample with the highest priority whose data is still valid (that is, whose publisher-specified validity period has not expired). It automatically switches back to the primary when it recovers, too.
Interoperability
Both proprietary and open-source software implementations of DDS are available. These include application programming interfaces (APIs) and libraries of implementations in Ada, C, C++, C#, Java, Python, Scala, Lua, Pharo, Ruby, and Rust.
DDS vendors participated in interoperability demonstrations at the OMG Spring technical meetings from 2009 to 2013.
During demos, each vendor published and subscribed to each other's topics us |
https://en.wikipedia.org/wiki/Scattering%20parameters | Scattering parameters or S-parameters (the elements of a scattering matrix or S-matrix) describe the electrical behavior of linear electrical networks when undergoing various steady state stimuli by electrical signals.
The parameters are useful for several branches of electrical engineering, including electronics, communication systems design, and especially for microwave engineering.
The S-parameters are members of a family of similar parameters, other examples being: Y-parameters, Z-parameters, H-parameters, T-parameters or ABCD-parameters. They differ from these, in the sense that S-parameters do not use open or short circuit conditions to characterize a linear electrical network; instead, matched loads are used. These terminations are much easier to use at high signal frequencies than open-circuit and short-circuit terminations. Contrary to popular belief, the quantities are not measured in terms of power (except in now-obsolete six-port network analyzers). Modern vector network analyzers measure amplitude and phase of voltage traveling wave phasors using essentially the same circuit as that used for the demodulation of digitally modulated wireless signals.
Many electrical properties of networks of components (inductors, capacitors, resistors) may be expressed using S-parameters, such as gain, return loss, voltage standing wave ratio (VSWR), reflection coefficient and amplifier stability. The term 'scattering' is more common to optical engineering than RF engineering, referring to the effect observed when a plane electromagnetic wave is incident on an obstruction or passes across dissimilar dielectric media. In the context of S-parameters, scattering refers to the way in which the traveling currents and voltages in a transmission line are affected when they meet a discontinuity caused by the insertion of a network into the transmission line. This is equivalent to the wave meeting an impedance differing from the line's characteristic impedance.
Although applicable at any frequency, S-parameters are mostly used for networks operating at radio frequency (RF) and microwave frequencies. S-parameters in common use - the conventional S-parameters - are linear quantities (not power quantities, as in the below mentioned 'power waves' approach by ()). S-parameters change with the measurement frequency, so frequency must be specified for any S-parameter measurements stated, in addition to the characteristic impedance or system impedance.
S-parameters are readily represented in matrix form and obey the rules of matrix algebra.
Background
The first published description of S-parameters was in the thesis of Vitold Belevitch in 1945. The name used by Belevitch was repartition matrix and limited consideration to lumped-element networks. The term scattering matrix was used by physicist and engineer Robert Henry Dicke in 1947 who independently developed the idea during wartime work on radar. In these S-parameters and scattering matrices, the scattered |
https://en.wikipedia.org/wiki/BoardGameGeek | BoardGameGeek (BGG) is an online forum for board gaming hobbyists and a game database that holds reviews, images and videos for over 125,600 different tabletop games, including European-style board games, wargames, and card games. In addition to the game database, the site allows users to rate games on a 1–10 scale and publishes a ranked list of board games.
As of , boardgamegeek.com has an Alexa rank of
.
History
BoardGameGeek was founded in January 2000 by Scott Alden and Derk Solko, and marked its 20th anniversary on 20 January 2020.
Since 2005, BoardGameGeek hosts an annual board game convention, BGG.CON, that has a focus on playing games, and where winners of the Golden Geek Awards are announced. New games are showcased and convention staff is provided to teach rules. There is also an annual Spring BGG.CON which is family friendly, and an annual BGG@Sea which is held on a cruise.
In 2010, BoardGameGeek received the Diana Jones Award, which recognized it as "a resource without peer for board and card gamers, the recognized authority of this online community." The New York Times has called BoardGameGeek "the hub of board gaming on the Internet."
In 2020, BoardGameGeek was inducted into the Origins Award Hall of Fame.
The site has branched out into other fields by using the same system for RPGs and video games (rpggeek.com and videogamegeek.com).
Golden Geek Award
Since 2006, the site annually awards the best new board games of the year with the Golden Geek Award. Winners are selected based on a vote by registered users.
2006–2009
2010–2019
RPG and Video Game awards
RPG and Video game awards were introduced in 2014 and awarded through 2017. Only 1 category was awarded in 2018, and none in following years.
2020–present
2020 saw many awards replaced with new categories, such as "Board Game of the Year" replaced with "Game of the Year, Light", "Medium" and "Heavy".
See also
Going Cardboard (documentary)
References
External links
American review websites
Board game websites
Diana Jones Award winners
Internet properties established in 2000
Online game databases |
https://en.wikipedia.org/wiki/Slipstream%20%28disambiguation%29 | A slipstream is a pocket of reduced pressure following behind an object moving through a fluid medium.
Slipstream may also refer to:
Computing
Slipstream (computer science), the technique of running a shortened program concurrently and ahead of the execution of the full program
Slipstream (computing), a slang term for merging patches or updates into the original installation sources of a program
Slipstream 5000, a 1995 racing game for PC
Fiction
Slipstream (genre), a literary genre that pushes the boundary between traditional fiction and either science fiction and/or fantasy
Slipstream (radio drama), a BBC Radio 7 science fiction series
Slipstream (science fiction), fictional methods of faster-than-light travel
Characters
Slipstream (comics), a Marvel Comics superhero character
Slipstream (Transformers), several robot characters in the Transformers franchise including Transformers: Animated
Slip Stream (G.I. Joe), a pilot character in the G.I. Joe franchise
Film
Slipstream (unfinished film), an unfinished Steven Spielberg movie
Slipstream (1973 film), a Canadian drama directed by David Acomba
Slipstream (video), a 1980 concert by Jethro Tull
Slipstream (1989 film), a post-apocalyptic adventure directed by Steven Lisberger
Slipstream (2005 film), a time travel thriller directed by David van Eyssen
Slipstream (2007 film), a drama written and directed by Anthony Hopkins
Music
Slipstream (band), a UK indie band
Albums
Slipstream (Bonnie Raitt album), 2012
Slipstream (Sherbet album) or the title song (see below), 1974
Slipstream (Sutherland Brothers and Quiver album) or the title song, 1976
Songs
"Slipstream" (song), by Sherbet, 1974
"Slipstream", by Killing Joke from Extremities, Dirt and Various Repressed Emotions, 1990
"Slipstream", by Jethro Tull from Aqualung, 1971
"Slipstream", by Mike Oldfield from Light + Shade, 2005
"Slipstream", by Threshold from Dead Reckoning, 2007
Others
Slipstream (arcade game), a 1995 racing game by Capcom
Slipstream (magazine), a literary press and magazine founded in 1980
Slipstream (sculpture), a sculpture created by Richard Wilson
Drafting (aerodynamics), also called slipstreaming
Team Slipstream, a UCI professional cycling team |
https://en.wikipedia.org/wiki/Inner-City%20Muslim%20Action%20Network | Inner-City Muslim Action Network (IMAN), founded in 1996 by Rami Nashashibi, is one of the leading Muslim charity organizations in the United States.
According to the Inner-City Muslim Action Network, IMAN seeks "to utilize the tremendous possibilities and opportunities that are present in the community to build a dynamic and vibrant alternative to the difficult conditions of inner city life." IMAN sees understanding Islam as part of a larger process to empower individuals and communities to work for the betterment of humanity. Consequently, IMAN has initiated a diverse set of community programs and projects with the hope of changing the conditions in the inner city, in particular the communities on Chicago's South and Southwest Side. IMAN provides a range of direct social services through the IMAN/ICIC Food Pantry, IMAN Health Clinic, and IMAN's Career Development Initiative (ICDI). "Takin' It To The Streets" is IMAN's most popular and well-known project. The festival draws people from all over the Chicago area for a day of festivities, musical performances, sports tournaments, and carnivals.
Directors are listed as: Rami Nashashibi, Ayat Elnoory, Asad Jafri, M. Altaf Kaiseruddin.
References
External links
IMAN Website
Takin' it to the Streets 2016 Website
Islamic organizations established in 1996
Islamic charities based in the United States
Non-profit organizations based in Chicago |
https://en.wikipedia.org/wiki/Van%20der%20Valk | Van der Valk is a British television crime drama series produced for the ITV network by Thames Television. It ran from 1972 to 1992, with the first three series produced between 1972 and 1977, and two more being commissioned in 1991 and 1992.
The series was created by Nicolas Freeling, based on his novels about a detective in Amsterdam. It starred Barry Foster in the role of titular character Simon "Piet" van der Valk.
Cast and characters
Barry Foster as Commissaris Simon "Piet" van der Valk
Michael Latimer as Inspecteur Johnny Kroon (Series 1–2)
Susan Travers as Arlette van der Valk (Series 1–2)
Joanna Dunham as Arlette van der Valk (Series 3)
Meg Davies as Arlette van der Valk (Series 4–5)
Martin Wyldeck as Hoofd-commissaris Samson (Series 1)
Nigel Stock as Hoofd-commissaris Samson (Series 3)
Ronald Hines as Hoofd-commissaris Samson (Series 4–5)
Sydney Tafler as Hoofd-commissaris Halsbeek (Series 2)
Richard Huw as Wim van der Valk (Series 4–5)
Dave Carter as Brigadier Stribos (Series 1–2)
Natasha Pyne as Janet (Series 4–5)
Alan Haines as Brigadier Mertens (Series 1)
Background and production
The show was produced by Thames Television for the ITV network. The first two series were produced in 1971 and 1972, followed by a third in 1977, with two more being commissioned in 1991 and 1992.
The first and second series, of 6 and 7 one-hour episodes respectively, were recorded on 2" quadruplex videotape at Thames' Teddington Studios in London, with location scenes shot in Amsterdam on 16mm film.
The third series of 12 episodes, again of one hour in length, was generally made on location, entirely on 16mm film, by Thames's subsidiary Euston Films.
The fourth series and fifth series, of four and three two-hour episodes, were produced by Elmgate Productions, and also entirely shot on 35mm film. They were also filmed entirely shot on location in the Netherlands and were transmitted in stereo sound using the NICAM system.
Setting and characters
The television series was based on the characters and atmosphere, but not the plots, of the original novels. The stories mostly take place in and around Amsterdam, where Commissaris van der Valk is a cynical yet intuitive detective. Drugs, sex and murder are among the gritty themes of the casework, presented in contrast to the picturesque locations and the upbeat theme music.
In the opening credits of the first series, Van der Valk is standing inside the tower of the Westerkerk.
In the first two series Van der Valk contrasts with his naïve assistant, Inspecteur Johnny Kroon, played by Michael Latimer, and his superior, Hoofd-commissaris Samson, who deals with the political fallout of the cases. The fourth series and fifth series portrayed a more senior Van der Valk and introduced a son, Wim, also an Amsterdam detective. Samson was played by three actors over the course of the show: Martin Wyldeck for two episodes in 1972, Nigel Stock for 12 episodes in 1977, and Ronald Hines for the revival i |
https://en.wikipedia.org/wiki/CIVC | CIVC may refer to:
Le Comité Interprofessionnel du vin de Champagne, the organisation of champagne producers
CIVC-TV 45, a TV channel in the network Télé-Québec in Trois-Rivières, Canada
CIVC Partners, a private equity firm |
https://en.wikipedia.org/wiki/Functional%20design | Functional Design is a paradigm used to simplify the design of hardware and software devices such as computer software and, increasingly, 3D models. A functional design assures that each modular part of a device has only one responsibility and performs that responsibility with the minimum of side effects on other parts. Functionally designed modules tend to have low coupling.
Advantages
The advantage for implementation is that if a software module has a single purpose, it will be simpler, and therefore easier and less expensive, to design and implement.
Systems with functionally designed parts are easier to modify because each part does only what it claims to do.
Since maintenance is more than 3/4 of a successful system's life, this feature is a crucial advantage. It also makes the system easier to understand and document, which simplifies training. The result is that the practical lifetime of a functional system is longer.
In a system of programs, a functional module will be easier to reuse because it is less likely to have side effects that appear in other parts of the system.
Technique
The standard way to assure functional design is to review the description of a module. If the description includes conjunctions such as "and" or "or", then the design has more than one responsibility, and is therefore likely to have side effects. The responsibilities need to be divided into several modules in order to achieve a functional design.
Critiques and limits
Every computer system has parts that cannot be functionally pure because they exist to distribute CPU cycles or other resources to different modules. For example, most systems have an "initialization" section that starts up the modules. Other well-known examples are the interrupt vector table and the main loop.
Some functions inherently have mixed semantics. For example, a function "move the car from the garage" inherently has a side effect of changing the "car position". In some cases, the mixed semantics can extend over a large topological tree or graph of related concepts. In these unusual cases, functional design is not recommended by some authorities. Instead polymorphism, inheritance, or procedural methods may be preferred.
Applied to 3D modeling and simulation
Recently several software companies have introduced functional design as a concept to describe a Parametric feature based modeler for 3D modeling and simulation. In this context, they mean a parametric model of an object where the parameters are tied to real-world design criteria, such as an axle that will adjust its diameter based on the strength of the material and the amount of force being applied to it in the simulation. It is hoped that this will create efficiencies in the design process for mechanical and perhaps even architectural/structural assemblies by integrating the results of finite element analysis directly to the behavior of individual objects.
References
External links
Functional Design Specification
7 |
https://en.wikipedia.org/wiki/Cullinet | Cullinet was a software company whose products included the database management system IDMS and the integrated software package Goldengate. In 1989, the company was bought by Computer Associates. Cullinet was headquartered at 400 Blue Hill Drive in Westwood, Massachusetts.
History
Early years
The company was started by John Cullinane and Larry English in 1968 as Cullinane Corporation. Their idea was to sell pre-packaged software to mainframe users, which was at that time a new concept in an era when enterprises only used internally developed applications or the software that came bundled with the hardware.
Rather than write its own products, Cullinane approached IT (information technology) departments (at that time called Data Processing departments) of major enterprises, particularly banks, to identify internally developed applications that he felt had potential to be productized and licensed to others. However, it proved difficult to sell these applications because most weren't generalized and supportable systems. As a result, the company decided to develop a source code management system, called PLUS, that competed with Pansophic's (Panvalet) and UCC's products (UCC-1 tape management system, etc.). The first version of PLUS (which stood for Program Library Update System) required the use of magnetic tape devices, and was not competitive with the other, disk-based products. Although the company eventually responded with a disk-based version, called PLUS-DA (which stood for Direct Access, a common name for disks at the time) they did not become successful in this market.
The first breakthrough product was a report writer named Culprit, developed in-house by Gil Curtis and Anna Marie Thron, who had built the PHI payroll system. The product competed with Mark IV from Informatics, Inc., but was perceived as a late entry in the report writer category.
The company struggled with financial stability until it branded a variation of Culprit, EDP Auditor, which was nothing more than a second name for the same product with a collection of predefined reports, but more importantly, special services aimed at the new discipline of EDP (electronic data processing) Auditing including the first EDP Auditors User, special support to give auditors independence of data processing which was very important to them. What was remarkable is that many corporations licensed essentially identical products. This led to serendipitous prosperity for Cullinane. As EDP auditors developed knowledge about business systems and computers, they could invariably produce reports faster than slower-moving, internal IT departments. As a result, MIS (management information systems) departments would feel compelled to buy the Culprit version for their own use — to compete.
1970s
As the company prospered in the early 1970s, it was approached by a consultant to BFGoodrich, Naomi O. Seligman, to consider taking over development of a Honeywell database management system called Integrate |
https://en.wikipedia.org/wiki/IPSANET | IPSANET was a packet switching network written by I. P. Sharp Associates (IPSA). Operation began in May 1976. It initially used the IBM 3705 Communications Controller and Computer Automation LSI-2 computers as nodes. An Intel 80286 based-node was added in 1987. It was called the Beta node.
The original purpose was to connect low-speed dumb terminals to a central time sharing host in Toronto. It was soon modified to allow a terminal to connect to an alternate host running the SHARP APL software under license. Terminals were initially either 2741-type machines based on the 14.8 characters/s IBM Selectric typewriter or 30 character/s ASCII machines. Link speed was limited to 9600 bit/s until about 1984.
Other services including 2780/3780 Bisync support, remote printing, X.25 gateway and SDLC pipe lines were added in the 1978 to 1984 era. There was no general purpose data transport facility until the introduction of Network Shared Variable Processor (NSVP) in 1984. This allowed APL programs running on different hosts to communicate via Shared Variables.
The Beta node improved performance and provided new services not tied to APL. An X.25 interface was the most important of these. It allowed connection to a host which was not running SHARP APL.
IPSANET allowed for the development of an early yet advanced e-mail service, 666 BOX, which also became a major product for some time, originally hosted on IPSA's system, and later sold to end users to run on their own machines. NSVP allowed these remote e-mail systems to exchange traffic.
The network reached its maximum size of about 300 nodes before it was shut down in 1993.
External links
IPSANET Archives
Computer networking
Packets (information technology) |
https://en.wikipedia.org/wiki/I.%20P.%20Sharp%20Associates | I. P. Sharp Associates (IPSA) was a major Canadian computer time-sharing, consulting and services firm of the 1970s and 1980s. IPSA is well known for its work on the programming language APL, an early packet switching computer network named IPSANET, and a powerful mainframe computer-based email system named 666 Box, stylized as 666 BOX. It was purchased in 1987 by Reuters Group, which used them until 2005 as a data warehousing center for business data.
History
The company's founders worked as a team at the Toronto division of Ferranti, Ferranti-Packard, which sold many products to the Canadian military and large businesses. The team worked on operating system and compiler design for the company's range of mainframe computers, the Ferranti-Packard 6000. In 1964 Ferranti sold off its computing division to International Computers and Tabulators, which almost immediately closed the Toronto office. Ian Sharp, the chief programmer, founded I. P. Sharp Associates in December 1964 with the other members of the team (Roger Moore, Ted McDorman, Don Smith, David Oldacre, Brian Daly, and James McSherry) and David Butler shortly after.
The firm began with contract programming on IBM System/360 series mainframes, and to some degree took over Ferranti's former military work. It became particularly well used by the Canadian Navy, setting up an office in Ottawa near DND headquarters. Ted McDorman and Jim McSherry were lead players in this. At one point IPSA could claim to have played a part in every computer system onboard Canadian Navy ships.
In the early years, IPSA collaborated with its sister company Scientific Time Sharing Corporation (STSC) of Bethesda, Maryland, USA, each retailing the same services in their respective countries. IPSA and STSC jointly developed their software. Eventually they devised separate product names. They separated as Sharp APL and APL*Plus. Initially, IPSA served STSC's customers from its Toronto datacenter. In 1972, STSC built its own datacenter. Afterward, both firms provided disaster recovery for each other: if one of the datacenters could not function, the other datacenter would accommodate both vendors' users.
Timesharing and IPSANET
IPSA sold time on its mainframes by the minute to customers across Canada, and rapidly developed into a major time sharing service in the 1970s. Long before the Internet, IPSA developed IPSANET to provide cheap telecommunications between the Toronto data center and IPSA clients across North America and Europe. Packet-switching also made their transatlantic links much more usable, since on previous equipment, frequent "line hits" would produce user-visible errors. As the network grew, and as Sharp APL was available on in-house computers, Sharp clients with their own mainframes could join the network, access their own or the Toronto mainframe from anywhere on IPSANET, and transfer data accordingly. The network eventually provided "Network Shared Variables" that allowed programs running on |
https://en.wikipedia.org/wiki/ATA%20over%20Ethernet | ATA over Ethernet (AoE) is a network protocol developed by the Brantley Coile Company, designed for simple, high-performance access of block storage devices over Ethernet networks. It is used to build storage area networks (SANs) with low-cost, standard technologies.
Protocol description
AoE runs on layer 2 Ethernet. AoE does not use Internet Protocol (IP); it cannot be accessed over the Internet or other IP networks. In this regard it is more comparable to Fibre Channel over Ethernet than iSCSI.
With fewer protocol layers, this approach makes AoE fast and lightweight. It also makes the protocol relatively easy to implement and offers linear scalability with high performance. The AoE specification is 12 pages compared with iSCSI's 257 pages.
AoE Header Format:
0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
0 | Ethernet Destination MAC Address |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
4 | Ethernet Destination (cont) | Ethernet Source MAC Address |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
8 | Ethernet Source MAC Address (cont) |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
12 | Ethernet Type (0x88A2) | Ver | Flags | Error |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
16 | Major | Minor | Command |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
20 | Tag |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
24 | Arg |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
AoE has the IEEE assigned EtherType 0x88A2.
ATA encapsulation
SATA (and older PATA) hard drives use the Advanced Technology Attachment (ATA) protocol to issue commands, such as read, write, and status. AoE encapsulates those commands inside Ethernet frames and lets them travel over an Ethernet network instead of a SATA or 40-pin ribbon cable. Although internally AoE uses the ATA protocol, it presents the disks as SCSI to the operating system. Also the actual disks can be SCSI or any other kind, AoE is not limited to disks that use the ATA command set. By using an AoE driver, the host operating system is able to access a remote disk as if it were directly attached.
The encapsulation of ATA provided by AoE is simple and low-level, allowing the translation to happen either at high performance or inside a small, embedded device, or both.
Routability
AoE is a layer 2 protocol running at the data-link layer, unlike some other SAN protocols which run on top of layer 3 utilizing IP. While t |
https://en.wikipedia.org/wiki/Belief%E2%80%93desire%E2%80%93intention%20software%20model | The belief–desire–intention software model (BDI) is a software model developed for programming intelligent agents. Superficially characterized by the implementation of an agent's beliefs, desires and intentions, it actually uses these concepts to solve a particular problem in agent programming. In essence, it provides a mechanism for separating the activity of selecting a plan (from a plan library or an external planner application) from the execution of currently active plans. Consequently, BDI agents are able to balance the time spent on deliberating about plans (choosing what to do) and executing those plans (doing it). A third activity, creating the plans in the first place (planning), is not within the scope of the model, and is left to the system designer and programmer.
Overview
In order to achieve this separation, the BDI software model implements the principal aspects of Michael Bratman's theory of human practical reasoning (also referred to as Belief-Desire-Intention, or BDI). That is to say, it implements the notions of belief, desire and (in particular) intention, in a manner inspired by Bratman. For Bratman, desire and intention are both pro-attitudes (mental attitudes concerned with action). He identifies commitment as the distinguishing factor between desire and intention, noting that it leads to (1) temporal persistence in plans and (2) further plans being made on the basis of those to which it is already committed. The BDI software model partially addresses these issues. Temporal persistence, in the sense of explicit reference to time, is not explored. The hierarchical nature of plans is more easily implemented: a plan consists of a number of steps, some of which may invoke other plans. The hierarchical definition of plans itself implies a kind of temporal persistence, since the overarching plan remains in effect while subsidiary plans are being executed.
An important aspect of the BDI software model (in terms of its research relevance) is the existence of logical models through which it is possible to define and reason about BDI agents. Research in this area has led, for example, to the axiomatization of some BDI implementations, as well as to formal logical descriptions such as Anand Rao and Michael Georgeff's BDICTL. The latter combines a multiple-modal logic (with modalities representing beliefs, desires and intentions) with the temporal logic CTL*.
More recently, Michael Wooldridge has extended BDICTL to define LORA (the Logic Of Rational Agents), by incorporating an action logic. In principle, LORA allows reasoning not only about individual agents, but also about communication and other interaction in a multi-agent system.
The BDI software model is closely associated with intelligent agents, but does not, of itself, ensure all the characteristics associated with such agents. For example, it allows agents to have private beliefs, but does not force them to be private. It also has nothing to say about agent communication |
https://en.wikipedia.org/wiki/The%20Rowan%20Tree%20Church | The Rowan Tree Church is a Wiccan organization, legally incorporated in 1979. It is an Earth-focused network of Members dedicated to the study and practice of the Wiccan Tradition known as Lothloriën. Originally centered in Minneapolis beginning in the late 1970s, its main office is in Kirkland, Washington. The Rowan Tree Church maintains its network through newsletters, the internet and with an annual retreat (meeting every third year at Old Faithful and, at other times, at The Hermit's Grove in Kirkland, a property). The Rowan Tree Church has an in-depth training program which leads to ordination. It has been publishing The Unicorn newsletter since 1977. Littlest Unicorn is published eight times a year for children and their parents. The church began around the work and teaching of Rev. Paul Beyerl in the mid-1970s.
See also
Neopagan witchcraft
Wiccan organisation
References
External links
Official web site
Culture of Kirkland, Washington
Modern pagan organizations based in the United States
Wiccan organisations
Modern pagan organizations established in 1979
Wicca in the United States |
https://en.wikipedia.org/wiki/Courtenay%20Hughes%20Fenn | Courtenay Hughes Fenn, or C. H. Fenn, (April 11, 1866 – 1953) was an American Presbyterian missionary to China, and compiler of The Five Thousand Dictionary, a widely used basic Chinese-English dictionary that has gone through numerous reprints. Fenn's Chinese name was 芳泰瑞 (Fang Tairui).
Fenn was born in 1866 at Clyde, New York, U.S.A., the son of Samuel P. Fenn and Martha Wilson, and was ordained in 1890. He married Alice Holstein May Castle (d. 1938) on 8 June 1892 in Washington DC. They had a daughter, Martha Wilson Fenn, and two sons, Henry Courtenay Fenn, well-known American China scholar and architect of Yale University's Chinese language program, more commonly known as H. C. Fenn, (February 26, 1894 - July 1978), and William Purviance Fenn (born 1902) general secretary of the United Board for Christian Higher Education in Asia.
In China, Fenn was active in the Presbyterian Overseas Mission Board. He provided a photographic album as firsthand evidence of the Boxer Rebellion and Siege of Peking, 1900, now archived in the Yale Divinity Library, along with his typescript diary. Fenn had perhaps a rather dark view of his Chinese contemporaries, as can be adduced from several remarks attributed to him in New Forces in Old China (1904) by Arthur Judson Brown:
Any man who has had the least occasion to deal with Chinese courts knows that `every man has his price,' that not only every underling can be bought, but that 999 out of every 1,000 officials, high or low, will favour the man who offers the most money.
...every village and town and city—it would not be a very serious exaggeration to say every home,--fairly reeks with impurity.
I would be almost willing to assert that it is impossible for a man, brought up in China, then spending many years abroad, to return to China and write such a book in honesty and sincerity of heart. He could not possibly help knowing that nine-tenths of what he was writing about China was absolutely untrue, that her political, legal, social, domestic and personal life are rotten to the core...
Isaac Taylor Headland of Peking University, in his book The Chinese Boy and Girl, recounts that his own interest in Chinese children's rhymes began with a summer-time conversation with Mrs. Fenn on the veranda of the Fenns' house in the hills, fifteen miles west of Peking, in which he heard a nurse teach the following rhyme to her child Henry Fenn:
He climbed up the candlestick,
The little mousey brown,
To steal and eat tallow,
And he couldn't get down.
He called for his grandma,
But his grandma was in town,
So he doubled up into a wheel,
And rolled himself down.
Selected works
The Providence of God in the Siege of Peking, date unknown
"The American Marines in the Siege of Peking." Independent 52, no. 2713 (29 November 1900): 2845-2849
Over against the treasury; or, Companions of the present Christ, a vision, 1910
With you always; a sequel to "Over against th |
https://en.wikipedia.org/wiki/Bloomberg%20Television | Bloomberg Television (on-air as Bloomberg) is an American-based pay television network focusing on business and capital market programming, owned by diversified information and media private company Bloomberg L.P. It is distributed globally, reaching over 310 million homes worldwide. It is headquartered in New York City, with European headquarters in London and Asian headquarters in Hong Kong.
History
Bloomberg Television first launched in the United States in mid-1994 under the name Bloomberg Direct and was first carried on the then new satellite television service DirecTV. Within a year it was renamed Bloomberg Information TV, before it was shortened to its current name in 1997. The network has taken over the channel space of the-defunct Financial News Network, as well as hiring most of the former FNN workforce. Shortly after Bloomberg's launch, the now-defunct American Independent Network carried a simulcast of the channel at various times each weekday from 1995 to 1997, which was picked up by some broadcast stations in early morning periods to provide a de facto morning business show. Starting on July 1, 1995 the network's morning pre-opening bell programming (from 5:30 AM to 7 AM) was also aired on the USA Network, simulcast in a paid programming arrangement with the channel until 2004, when that network dropped the simulcast months before the NBCUniversal merger was consummated, due to concerns that USA would then air the coverage of a competitor to future sister network CNBC. The simulcast then moved to E! (which also became NBCUniversal-owned and sister network of CNBC in January 2011 due to that company's purchase by Comcast), where it remained until the simulcast ended in January 2009, when it was felt it had expanded digital cable footprint enough to discontinue the simulcast. During its time on E!, the 5–8 a.m. block was the most-watched period for the network, according to Nielsen Media Research.
Bloomberg Television's U.S. network debuted a new graphics package in January 2009. This current scheme was first used on the network's now-defunct pre-market program, Starting Bell, before the new graphics expanded to all of the network's programs on February 17, 2009. Also on that date, Bloomberg U.S. revamped its weekday programming lineup (see "Programs on Bloomberg" below).
In October 2009, Bloomberg Television debuted another new graphics package. In 2011, Bloomberg Television announced a strategic relationship with Gas Station TV (GSTV) to deliver personal finance and business news through the LCD screens beginning to proliferate fueling stations (currently, Cheddar is GSTV's business news provider).
Bloomberg launched a high definition simulcast feed on May 9, 2011, with Time Warner Cable as the first provider to carry it. In mid-April 2013, DirecTV started carrying Bloomberg HD.
As of July 2014, Bloomberg Television's standard-definition feed now shows a down-scaled version of its native HD feed, with the 16:9 letterbox picture |
https://en.wikipedia.org/wiki/Logie%20Awards%20of%202000 | The 42nd Annual TV Week Logie Awards was held on Sunday 30 April 2000 at the Crown Palladium in Melbourne, and broadcast on the Nine Network. The ceremony was hosted by Andrew Denton, and guests included Elle Macpherson, Ruby Wax, Savage Garden and Macy Gray.
Winners and nominees
In the tables below, winners are listed first and highlighted in bold.
Gold Logie
Acting
Most Popular Programs
Most Outstanding Programs
Performers
Macy Gray – "I Try" and "I Can't Wait to Meetchu"
Savage Garden – "Crash and Burn"
Hall of Fame
After a lifetime in Australian television, Bruce Gyngell became the 17th inductee into the TV Week Logies Hall of Fame.
References
External links
2000
2000 television awards
2000 in Australian television
2000 awards in Australia |
https://en.wikipedia.org/wiki/CHQR | CHQR is a radio station owned by Corus Entertainment operating in Calgary, Alberta, Canada. Broadcasting at AM 770, it airs talk programming. With the exception of one show, all of CHQR's weekday programming is produced in-house. CHQR is also the exclusive radio voice of the Calgary Stampeders. CHQR is also the last AM station in the Calgary market to broadcast in C-QUAM AM Stereo. CHQR is a Class B station on the clear-channel frequency of 770 kHz.
CHQR's studios are located on 17th Avenue Southwest in Calgary, while its transmitters are located just south of the Calgary city limits near De Winton.
As of Winter 2021, CHQR is the most-listened-to radio station in the Calgary market according to a PPM data report released by Numeris.
History
The station originally began broadcasting at 810 AM in 1964 and received approval to move to its current frequency on June 26, 1986.
On November 9, 2011, Corus Entertainment Inc., on behalf of its wholly owned subsidiary CKIK-FM Limited applied to the Canadian Radio-television and Telecommunications Commission (CRTC) to add an FM transmitter to serve Calgary on the frequency 106.9 MHz to rebroadcast the programming of CHQR 770. This application was denied on May 24, 2012.
In December 2015, CHQR was added to sister station CKRY-FM's HD2 sub-channel when they activated HD Radio services, becoming the first station in Alberta to do so.
On January 9, 2023, CHQR rebranded as QR Calgary and added an FM simulcast on CFGQ-FM. That spring, following inquiries by the CRTC regarding whether the simulcast complies with broadcasting regulations, Corus filed a set of applications with the CRTC to formalize the simulcast by re-designating CFGQ as the originating station of the news/talk format under a specialty FM licence, revoking CHQR's AM licence, and repurposing the current 770 AM facility as a rebroadcaster of CFGQ. In doing so, Corus questioned the format's continued viability on AM in Calgary, reiterating the arguments it had made during its 2011 rebroadcaster application while also referencing increased interference and reduced support in electric vehicles.
References
External links
QR Calgary
CHQR history - Canadian Communications Foundation
Hqr
Hqr
Hqr
Radio stations established in 1964
1964 establishments in Alberta |
https://en.wikipedia.org/wiki/BBS%3A%20The%20Documentary | BBS: The Documentary (commonly referred to as BBS Documentary) is a 3-disc, 8-episode documentary about the subculture born from the creation of the bulletin board system (BBS) filmed by computer historian Jason Scott of textfiles.com.
Production work began in July 2001, and completed in December 2004. The finished product began shipping in May 2005.
Although the documentary was released under the Creative Commons Attribute-ShareAlike 2.0 License and later under 3.0, meaning that anyone can legally download it for free, the author has made it known that the downloadable version is only a fraction of the available material and recommends that individuals purchase the documentary DVDs.
Episodes
Disc 1:
Baud: the beginnings of the first BBSes, featuring Ward Christensen and Randy Suess
SysOps and Users: experiences from those who used and operated BBSes, including B.W. Behling from Ahoy! magazine
Disc 2:
Make it Pay: the BBS industry of the 1980s and 90s featuring Philip L. Becker, founder of eSoft
FidoNet: details the largest volunteer-run computer network in history
Artscene: the history of the ANSI Art Scene which thrived in the BBS world
Disc 3:
HPAC (Hacking Phreaking Anarchy Cracking): hear from the users of "underground" BBSes
No Carrier: the end of the dial-up BBS and its integration into the Internet
Compression: the story of the PKWARE/SEA legal battle of the late 1980s
Disc 3 also serves as a DVD-ROM which contains thousands of photographs from the 200 interviews recorded during the 4-year production of the film. All of the episodes are subtitled in English and include director's commentary tracks. The Artscene episode is the only one to include subtitles translated into Russian. All discs include hidden easter eggs.
Reception
BBS: The Documentary was well reviewed, mainly by publications within the technology space. Wired called it "a five-and-a-half-hour paean to the era when computers were named Stacy and Lisa, and tech loyalists fought bitter battles over the superiority of Ataris to Amigas". Film Threat called it a "truly fascinating documentary about an increasingly obscure and obsolete technology". Popular Mechanics called it a "labor of love" and said it was "the sort of thing that not everyone can digest, but is utterly fascinating to those that can".
Since its release, the film has been cited by multiple academic works on the topic of computing history and internet culture.
References
External links
BBS: The Documentary at the Internet Archive
2005 films
Bulletin board systems
Hacking (computer security)
American documentary films
Creative Commons-licensed documentary films
Phreaking
Warez
Documentary films about the Internet
Films directed by Jason Scott
Documentary films about fandom
Films about technological impact
Works about computer hacking
2005 documentary films |
https://en.wikipedia.org/wiki/Simple%20Network%20Paging%20Protocol | Simple Network Paging Protocol (SNPP) is a protocol that defines a method by which a pager can receive a message over the Internet. It is supported by most major paging providers, and serves as an alternative to the paging modems used by many telecommunications services. The protocol was most recently described in . It is a fairly simple protocol that may run over TCP port 444 and sends out a page using only a handful of well-documented commands.
Connecting and using SNPP servers
It is relatively easy to connect to a SNPP server only requiring a telnet client and the address of the SNPP server. The port 444 is standard for SNPP servers, and it is free to use from the sender's point of view. Maximum message length can be carrier-dependent. Once connected, a user can simply enter the commands to send a message to a pager connected to that network. For example, you could then issue the PAGE command with the number of the device to which you wish to send the message. After that issue the MESS command with the text of the message you wish to send following it. You can then issue the SEND command to send out the message to the pager and then QUIT, or send another message to a different device. The protocol also allows you to issue multiple PAGE commands, stacking them one after the other, per message effectively allowing you to send the same message to several devices on that network with one MESS and SEND command pair.
References
External links
rfc-editor.org - RFC 1861
Network protocols |
https://en.wikipedia.org/wiki/SNPP | SNPP may refer to:
Real
Shoreham Nuclear Power Plant
Simple Network Paging Protocol
Smolensk Nuclear Power Plant
Suomi NPP, an American weather satellite in low Earth orbit.
Fictional
The Simpsons Archive, domain name snpp.com
Springfield Nuclear Power Plant |
https://en.wikipedia.org/wiki/Clustal | Clustal is a series of widely used computer programs used in bioinformatics for multiple sequence alignment. There have been many versions of Clustal over the development of the algorithm that are listed below. The analysis of each tool and its algorithm is also detailed in their respective categories. Available operating systems listed in the sidebar are a combination of the software availability and may not be supported for every current version of the Clustal tools. Clustal Omega has the widest variety of operating systems out of all the Clustal tools.
History
There have been many variations of the Clustal software, all of which are listed below:
Clustal: The original software for multiple sequence alignments, created by Des Higgins in 1988, was based on deriving phylogenetic trees from pairwise sequences of amino acids or nucleotides.
ClustalV: The second generation of the Clustal software was released in 1992 and was a rewrite of the original Clustal package. It introduced phylogenetic tree reconstruction on the final alignment, the ability to create alignments from existing alignments, and the option to create trees from alignments using a method called Neighbor joining.
ClustalW: The third generation, released in 1994, greatly improved upon the previous versions. It improved upon the progressive alignment algorithm in various ways, including allowing individual sequences to be weighted down or up according to similarity or divergence respectively in a partial alignment. It also included the ability to run the program in batch mode from the command line.
ClustalX: This version, released in 1997, was the first to have a graphical user interface.
ClustalΩ (Omega): The current standard version.
Clustal2: The updated versions of both ClustalW and ClustalX with higher accuracy and efficiency.
The papers describing the Clustal software have been very highly cited, with two of them amongst the most cited papers of all time.
The most recent version of the software is available for Windows, Mac OS, and Unix/Linux. It is also commonly used via a web interface on its home page or hosted by the European Bioinformatics Institute.
Name origin
The guide tree in the initial programs was constructed via a UPGMA cluster analysis of the pairwise alignments, hence the name CLUSTAL.cf. The first four versions in 1988 had Arabic numerals (1 to 4), whereas with the fifth version Des Higgins switched to Roman numeral V in 1992.cf. In 1994 and in 1997, for the next two versions, the letters after the letter V were used and made to correspond to W for Weighted and X for X Window.cf. The name omega was chosen to mark a change from the previous ones.
Function
All variations of the Clustal software align sequences using a heuristic that progressively builds a multiple sequence alignment from a series of pairwise alignments. This method works by analyzing the sequences as a whole, then utilizing the UPGMA/Neighbor-joining method to generate a distance matrix. |
https://en.wikipedia.org/wiki/FastICA | FastICA is an efficient and popular algorithm for independent component analysis invented by Aapo Hyvärinen at Helsinki University of Technology. Like most ICA algorithms, FastICA seeks an orthogonal rotation of prewhitened data, through a fixed-point iteration scheme, that maximizes a measure of non-Gaussianity of the rotated components. Non-gaussianity serves as a proxy for statistical independence, which is a very strong condition and requires infinite data to verify. FastICA can also be alternatively derived as an approximative Newton iteration.
Algorithm
Prewhitening the data
Let the denote the input data matrix, the number of columns corresponding with the number of samples of mixed signals and the number of rows corresponding with the number of independent source signals. The input data matrix must be prewhitened, or centered and whitened, before applying the FastICA algorithm to it.
Centering the data entails demeaning each component of the input data , that is,
for each and . After centering, each row of has an expected value of .
Whitening the data requires a linear transformation of the centered data so that the components of are uncorrelated and have variance one. More precisely, if is a centered data matrix, the covariance of is the -dimensional identity matrix, that is,
A common method for whitening is by performing an eigenvalue decomposition on the covariance matrix of the centered data , , where is the matrix of eigenvectors and is the diagonal matrix of eigenvalues. The whitened data matrix is defined thus by
Single component extraction
The iterative algorithm finds the direction for the weight vector
that maximizes a measure of non-Gaussianity of the projection ,
with denoting a prewhitened data matrix as described above.
Note that is a column vector. To measure non-Gaussianity, FastICA relies on a nonquadratic nonlinear function , its first derivative , and its second derivative . Hyvärinen states that the functions
are useful for general purposes, while
may be highly robust. The steps for extracting the weight vector for single component in FastICA are the following:
Randomize the initial weight vector
Let , where means averaging over all column-vectors of matrix
Let
If not converged, go back to 2
Multiple component extraction
The single unit iterative algorithm estimates only one weight vector which extracts a single component. Estimating additional components that are mutually "independent" requires repeating the algorithm to obtain linearly independent projection vectors - note that the notion of independence here refers to maximizing non-Gaussianity in the estimated components. Hyvärinen provides several ways of extracting multiple components with the simplest being the following. Here, is a column vector of 1's of dimension .
Algorithm FastICA
Input: Number of desired components
Input: Prewhitened matrix, where each column represents an -dimensional sample, where
Output |
https://en.wikipedia.org/wiki/Psion%20Wavefinder | The Psion Wavefinder was a computer peripheral for receiving digital audio broadcasting radio signals, made by Psion. It attached via USB to a personal computer, and had no loudspeakers or controls of its own, with only a flashing light on the device. Psion hoped it would become a design classic.
The Wavefinder was released on 17 October 2000, and gave access to both DAB audio and DAB Data services. The WaveFinder software had the ability to receive the 'Broadcast Website' service which some DAB broadcasters experimented with during the early days of digital radio - displaying HTML content provided by the broadcaster in the users' web browsers. The device initially retailed for £299 (at the time the cheapest digital radio on the UK market) and was bundled with new PCs sold by Dixons, but it was quickly discounted, retailing at £49.99 by that December, and was no longer produced by 2002. Psion ended support in 2004. The Wavefinder had frequent software problems, and an unofficial patch called WaveLite was released in 2001. The Wavefinder had widely reported problems with the USB drivers in Windows XP Service Pack 2.
It will work with Windows XP with SP3. There are reports that the Wavefinder works in Vista. It is not compatible with Macintosh computers, except perhaps through the use of a PC emulator or virtualisation solution. There is a driver and command line application for Linux, OpenDAB, that describes itself as "experimental". The unregulated power supply which is supplied with the Wavefinder has an output which can go up to 19 volts, this can cause the Wavefinder to develop faults. It is therefore recommended to use a regulated 12 volt supply.
References
External links
An unofficial FAQ
h2g2 article
The designer's page on the Wavefinder
Digital radio
Computer peripherals
Products introduced in 2000 |
https://en.wikipedia.org/wiki/Codd%27s%20cellular%20automaton | Codd's cellular automaton is a cellular automaton (CA) devised by the British computer scientist Edgar F. Codd in 1968. It was designed to recreate the computation- and construction-universality of von Neumann's CA but with fewer states: 8 instead of 29. Codd showed that it was possible to make a self-reproducing machine in his CA, in a similar way to von Neumann's universal constructor, but never gave a complete implementation.
History
In the 1940s and '50s, John von Neumann posed the following problem:
What kind of logical organization is sufficient for an automaton to be able to reproduce itself?
He was able to construct a cellular automaton with 29 states, and with it a universal constructor. Codd, building on von Neumann's work, found a simpler machine with eight states. This modified von Neumann's question:
What kind of logical organization is necessary for an automaton to be able to reproduce itself?
Three years after Codd's work, Edwin Roger Banks showed a 4-state CA in his PhD thesis that was also capable of universal computation and construction, but again did not implement a self-reproducing machine. John Devore, in his 1973 masters thesis, tweaked Codd's rules to greatly reduce the size of Codd's design, to the extent that it could be implemented in the computers of that time. However, the data tape for self-replication was too long; Devore's original design was later able to complete replication using Golly. Christopher Langton made another tweak to Codd's cellular automaton in 1984 to create Langton's loops, exhibiting self-replication with far fewer cells than that needed for self-reproduction in previous rules, at the cost of removing the ability for universal computation and construction.
Comparison of CA rulesets
Specification
Codd's CA has eight states determined by a von Neumann neighborhood with rotational symmetry.
The table below shows the signal-trains needed to accomplish different tasks. Some of the signal trains need to be separated by two blanks (state 1) on the wire to avoid interference, so the 'extend' signal-train used in the image at the top appears here as '70116011'.
Universal computer-constructor
Codd designed a self-replicating computer in the cellular automaton, based on Wang's W-machine. However, the design was so colossal that it evaded implementation until 2009, when Tim Hutton constructed an explicit configuration. There were some minor errors in Codd's design, so Hutton's implementation differs slightly, in both the configuration and the ruleset.
See also
Artificial life
Cellular automaton
Conway's Game of Life
Langton's loops
Von Neumann cellular automaton
Wireworld
References
External links
The Rule Table Repository has the transition table for Codd's CA.
Golly - supports Codd's CA along with the Game of Life, and other rulesets.
Download the complete machine (13MB) and more details.
shows more on Banks IV.
Artificial life
Cellular automaton rules |
https://en.wikipedia.org/wiki/Commodore%2064%20Games%20System | The Commodore 64 Games System (often abbreviated C64GS) is the cartridge-based home video game console version of the popular Commodore 64 home computer. It was released in December 1990 by Commodore into a booming console market dominated by Nintendo and Sega. It was only released in Europe and was a considerable commercial failure. The C64GS came bundled with a cartridge containing four games: Fiendish Freddy's Big Top O'Fun, International Soccer, Flimbo's Quest, and Klax.
The C64GS was not Commodore's first gaming system based on the C64 hardware. However, unlike the 1982 MAX Machine (a game-oriented computer based on a very cut-down version of the same hardware family), the C64GS is internally very similar to the complete C64, with which it is compatible. Out of the approximately 80,000 consoles produced, only 20,000 consoles were sold.
Available software
Support from games companies was limited, as many were unconvinced that the C64GS would be a success in the console market. Ocean Software was the most supportive, offering a wide range of titles, some C64GS cartridge-based only, offering features in games that would have been impossible on cassette-based games, others straight ports of games for the original C64. Domark and System 3 also released a number of titles for the system, and conversions of some Codemasters and MicroProse games also appeared. Denton Designs also released some games, among them Bounces, which was released in 1985.
The software bundled with the C64GS, a four-game cartridge containing Fiendish Freddy's Big Top O'Fun, International Soccer, Flimbo's Quest and Klax, were likely the most well known on the system. These games, with the exception of International Soccer, were previously ordinary tape-based games, but their structure and control systems (no keyboard needed) made them well-suited to the new console. International Soccer was previously released in 1983 on cartridge for the original C64 computer.
Ocean produced a number of games for the C64GS, among them a remake of Double Dragon (which was only sold at trade shows), Navy SEALS, RoboCop 2, RoboCop 3, Chase HQ 2: Special Criminal Investigation, Pang, Battle Command, Toki, Shadow of the Beast and Lemmings. They also produced Batman The Movie for the console, but this was a direct conversion of the cassette game, evidenced by the screens prompting the player to "press PLAY" that briefly appeared between levels. Some of the earliest Ocean cartridges had a manufacturing flaw, where the connector was placed too far back in the cartridge case. The result was that the cartridge could not be used with the standard C64 computer. Members of Ocean staff had to manually drill holes in the side of the cartridges to make them fit.
System 3 released Last Ninja Remix and Myth: History in the Making, although both were also available on cassette. Domark also offered two titles, Badlands and Cyberball, which were available on cartridge only.
Through publisher The Disc Comp |
https://en.wikipedia.org/wiki/Paranoia%20Network | The Paranoia Network, founded in November 2003, is a self-help user-run organisation in Sheffield, England, for people who have paranoid or delusional beliefs.
In contrast to mainstream psychiatry, that tends to see such beliefs as signs of psychopathology, the Paranoia Network promotes a philosophy of living with unusual and compelling beliefs, without necessarily pathologising them as signs of mental illness. It was partly inspired by the Hearing Voices Network's approach to auditory hallucinations.
What would otherwise seem to be a relatively minor disagreement over theory is complicated by the fact that people diagnosed as delusional can often be detained under mental health law and treated without their consent. Therefore, many of the criticisms of the diagnosis or definition have important ethical and political implications, which often leads to heated public debate.
See also
Delusion
Hearing Voices Network
Paranoia
External links
Launch of the Paranoia Network - from Asylum Online magazine.
Finding a way out of paranoia - Guardian article on the Paranoia Network.
Schizophrenia-related organizations
Mental health support groups
Mental health organisations in the United Kingdom |
https://en.wikipedia.org/wiki/Microprofessor%20II | Microprofessor II (MPF II), introduced in 1982, was Multitech's (later renamed Acer) second branded computer product and also one of the earliest Apple II clones. It does not look like most other computers. The case of the MPF II was a slab with a small chiclet keyboard on its lower part.
In 1983, the Multiprofessor II retailed in the UK for £269.00 including VAT.
One key feature of the MPF II was its Chinese BASIC, a version of Chinese-localized BASIC based on Applesoft BASIC. There was also a version sold in Europe, Northern America, India, Singapore, and Australia that did not have Chinese localization.
Differences to Apple II
The MPF II was not totally compatible with the Apple II.
The MPF II did not have Apple II's text mode. All the text was drawn on the screen by software rather than generated by hardware. It was the only cost-effective way to generate Chinese text on the screen at a time when a hardware-based Chinese character generator could cost hundreds of U.S. dollars.
Like Apple II, MPF II had two graphics buffers. However, the second buffer was at address A000H while with Apple II it was at 4000H. The keyboard input was mapped to a different address than the Apple II making impossible to play Apple's games on the MPF II.
MPF-II keyboard interface was very simple and consisted of an 8-bit output port and an input port that was directly connected to the keyboard matrix. The Apple joystick interface was not there, and instead, the joystick appeared as a keyboard with arrow keys and two other buttons.
The external slot interface was also not compatible with the Apple II and could not use any standard interface cards including the Disk II controller.
Technical information
CPU: MOS Technology 6502
Clock rate: 1 MHz
RAM: 64 KB (including 16KB RAM mapped at the same address as the ROM)
ROM: 16 KB (12 KB of which is a BASIC interpreter)
Text modes: 40×24 (using graphics mode)
Graphics modes: 280×192
Colours: 8 colours
Sound: 1 channel of 1-bit sound
Connectors: Keyboard, Printer, Expansion port, cassette recorded input and output, Composite and TV-out
Optional peripherals: 55 key full-size keyboard, Floppy disc drive, Thermal and Dot-matrix printers, Joystick
Power supply: External PSU, 5,12V
See also
Microprofessor I — unrelated Z80 programming education device
Microprofessor III
External links
MPF II at the Old Computer Museum
Acer Inc. computers
Early microcomputers
Home computers
Apple II clones |
https://en.wikipedia.org/wiki/3000%20class%20railcar | The 3000 class and 3100 class are diesel railcars that operate on the Adelaide rail network. Built by Comeng and Clyde Engineering between 1987 and 1996, they entered service under the State Transport Authority before later being operated by TransAdelaide and Adelaide Metro. Trains are typically coupled as multiple units, though the 3000 class are also able to run as single units when needed.
History
In March 1985, the State Transport Authority (STA) awarded a tender for 20 diesel railcars (eight 3000 class units with a cab at each end and twelve 3100 class with a cab at one end only) to Comeng's Dandenong rolling stock factory. The design was based on the stainless steel shell of the Comeng electric train then in production for Melbourne's Public Transport Corporation, but longer and with only two doors per side. Because of a contractual requirement to maximise local content, the fit out was conducted at Comeng's Dry Creek facility. The first commenced testing in May 1987, entering service in November 1987. The eight 3000s were built first with the first 3100 class completed in mid-1988. The last entered service in December 1988.
In the original contract, there was an option to order 76 further examples. However Comeng came back to the STA with a significantly higher price, so the work was put out to tender and a contract for 50 awarded to Clyde Engineering in November 1989. Comeng concluded a deal to sell the 3000 class design and tooling. However by the time construction commenced, Comeng had sold its Dandenong plant to ABB who backed away from an agreement to hand over the jigs and tooling, so they were built between 1992 and 1996 by Clyde Engineering's Martin & King factory in Somerton, Victoria.
All were delivered with unpainted stainless steel offset by blue and orange stripes. In April 2002 the first was repainted by Bluebird Rail Operations in Adelaide Metro's yellow, blue and red.
Originally they operated on all Adelaide suburban lines, however since the electrification of the Seaford and Flinders lines in 2014, and Gawler line in 2022, they have been confined primarily to the Belair, Grange and Outer Harbor lines, with some Gawler services still being temporarily operated by 3000/3100s while new 4000 class EMUs are being built. They have on occasions ventured beyond the Adelaide metropolitan area, operating special services to Nuriootpa on the Barossa Valley line and Riverton on the Roseworthy-Peterborough line. These tours stopped in the mid 2000s.
Mechanics
Only one of the axles per multiple unit are powered, originally with 2 Stromberg Electric Motors, which have now been replaced since the 2018 life extension.
The 3000 class bodies were built by Comeng and feature airbag secondary suspension. All 3000 class railcars are fitted with electro-magnetic track brakes, which are comparatively rare on trains, though they are commonly found on trams. These are operated separately from the normal mechanical and dynamic braking |
https://en.wikipedia.org/wiki/Chinese%20BASIC | Chinese BASIC () is the name given to several Chinese-localized versions of the BASIC programming language in the early 1980s.
Versions
At least two versions of Chinese BASIC were modified Applesoft BASIC that accepted Chinese commands and variables. They were built into some Taiwan-made Apple II clones. One of these was shipped with the best-selling Multitech Microprofessor II (known as Acer today). Another version was shipped with MiTAC's Little Intelligent Computer ().
In addition to Apple II clones, Multitech also developed a Zilog Z80-based port of the Chinese BASIC for its own line of high-end computers.
Example
In a typical Chinese BASIC environment, Chinese and English commands are interchangeable. It may also accept Chinese and Latin alphabet variables. For example, you may use in line 50, in line 200 and in line 250. They all do the same thing—to print out the value of on screen.
This program calculates the sum of . The Chinese characters used as variables are the 24 radicals of the Cangjie method, one of the earliest QWERTY keyboard-compatible Chinese input methods.
The significant length of an Applesoft BASIC variable name is restricted to two bytes. Therefore, the variables and are treated as the same. In Multitech's Chinese BASIC, a variable can be 3 bytes long (one Chinese character + one numeral).
See also
Non-English-based programming languages
References
External links
A page of the Chinese BASIC manual (in traditional Chinese)
RoboMind: educational programming language in Chinese
Non-English-based programming languages
Discontinued Microsoft BASICs
Chinese-language computing
BASIC programming language family |
https://en.wikipedia.org/wiki/Tyan | Tyan Computer Corporation (泰安電腦科技股份有限公司; also known as Tyan Business Unit, or TBU) is a subsidiary of MiTAC International, and a manufacturer of computer motherboards, including models for both AMD and Intel processors. They develop and produce high-end server, SMP, and desktop barebones systems as well as provide design and production services to tier 1 global OEMs, and a number of other regional OEMs.
Founding
The company was founded in 1989 by Dr. T. Symon Chang, a veteran of IBM and Intel. At that time, Dr. Chang saw an empty space in the market in which there were no strong players for the SMP server space, and as such he founded Tyan in order to develop, produce and deliver such products, starting with a dual Intel Pentium-series motherboard as well as a number of other single processor motherboards all geared towards server applications.
Since then, Tyan has produced a number of single and multi-processor (as well as multi-core) products using technology from many well-known companies (e.g. Intel, AMD, NVIDIA, Broadcom and many more). Notable design wins include that of Dawning corporation for the fastest supercomputer (twice); first to market with a dual AMD Athlon MP server platform; winner of the Maximum PC Kick-Ass Award (twice) for their contributions to the Dream Machine (most recently, the 2005 edition); and first to market with an eight (8) GPU server platform (the FT72-B7015).
Later company history
Tyan is headquartered in Taipei, Taiwan, separated between three buildings in the Nei-Hu industrial district. All three buildings belong to the parent company, MiTAC. The North American headquarter is in Newark, California, which is the same North American headquarter for MiTAC.
The merger in question was with MiTAC, a Taiwanese OEM which develops and produces a range of products (including servers, notebooks, consumer electronics products, networking and educational products - as well as providing contract manufacturing services), was announced in March 2007 and completed on October 1 of that year. Under the umbrella of MiTAC, Tyan acts as the brand leader and core engineering and marketing arm for delivery of server and workstation products to the distribution and reseller channel, and continues to act as a design and production services house for OEM customers.
MiTAC International Corp. spun off the Cloud Computing Business Group to the newly incorporated MiTAC Computing Technology Corporation on 1 September 2014. TYAN is a leading server brand of MiTAC Computing Technology Corp. under the MiTAC Group.
TYAN launched the first OpenPOWER reference system based on the IBM POWER8 architecture in Oct 2014. TYAN is one of the founding members of the OpenPOWER Foundation, which was established in 2013.
External links
Tyan Computer Corp.
MiTAC.com , Tyan's parent company
Tyan's Chinese website
1989 establishments in Taiwan
Companies established in 1989
Motherboard companies
Companies based in Taipei
Electronics companies of T |
https://en.wikipedia.org/wiki/Bruce%20Webster | Bruce F. Webster is an American academic and software engineer. He is currently a principal at Bruce F. Webster & Associates and an adjunct professor in computer science at Brigham Young University.
Early life and education
Webster studied computer science at Brigham Young University, graduating in 1978 with a bachelor's degree. He had received a full National Merit Scholarship for his studies. He went on to do graduate work in computer science at the University of Houston-Clear Lake in Houston, Texas.
Career
Webster, since 1980, has written over 150 articles on the computer industry and software development. He has also written four books on information technology (IT) issues, including The NeXT book, Pitfalls of Object-Oriented Development, The Art of ‘Ware, and The Y2K Survival Guide, and contributed to two others. He authored PricewaterhouseCoopers' 2000 white paper, Patterns in IT Litigation: System Failure. He also wrote for two years as an IT management columnist for Baseline.
In the 1980s, Webster wrote articles and columns for BYTE and Macworld, and taught computer science at his alma mater, Brigham Young University. In the 1990s, he went on to help found another software startup, Pages Software Inc., where he served as Chief Technical Officer and chief software architect for five years. He then served as Chief Technical Officer at Object Systems Group (now OSG), reviewing troubled corporate IT projects, and subsequently worked as a Director at PricewaterhouseCoopers (ibid). He has run his own consulting firm since 2001. Since 2017 has also served as an adjunct professor for the BYU Computer Science Department, teaching a senior-level class on real-world software engineering.
Webster was co-designer and principal programmer of the original Apple II version of SunDog: Frozen Legacy, a real-time space trading and combat game released in 1984. SunDog was cited in late 2022 by Todd Howard of Bethesda Game Studios as one of his inspirations for their forthcoming science-fiction open world game Starfield.
Personal life
Webster currently resides in Provo, Utah, with his wife Sandra. He has been a member of the Church of Jesus Christ of Latter-day Saints since 1967 and has played an active role in the church.
References
External links
Bruce Webster's web site
Bruce Webster's "And Still I Persist" blog
Bruce Webster's "Adventures in Mormonism" blog
Webster & Associates web site
Webster's SunDog page
The SunDog Resurrection project at SourceForge
Year of birth missing (living people)
Living people
American computer scientists
American Latter Day Saints
Brigham Young University alumni
Brigham Young University faculty
University of Houston–Clear Lake alumni
People from Parker, Colorado
Engineers from Colorado |
https://en.wikipedia.org/wiki/SIGTRAN | SIGTRAN is the name, derived from signaling transport, of the former Internet Task Force (I) working group that produced specifications for a family of protocols that provide reliable datagram service and user layer adaptations for Signaling System and ISDN communications protocols. The SIGTRAN protocols are an extension of the SS7 protocol family, and they support the same application and call management paradigms as SS7. However, the SIGTRAN protocols use an Internet Protocol (IP) transport called Stream Control Transmission Protocol (SCTP), instead of TCP or UDP. Indeed, the most significant protocol defined by the SIGTRAN group is SCTP, which is used to carry PSTN signaling over IP.
The SIGTRAN group was significantly influenced by telecommunications engineers intent on using the new protocols for adapting IP networks to the PSTN with special regard to signaling applications. Recently, SCTP is finding applications beyond its original purpose wherever reliable datagram service is desired.
SIGTRAN has been published in RFC 2719, under the title Framework Architecture for Signaling Transport. RFC 2719 also defines the concept of a signaling gateway (SG), which converts Common Channel Signaling (CCS) messages from SS7 to SIGTRAN. Implemented in a variety of network elements including softswitches, the SG function can provide significant value to existing common channel signaling networks, leveraging investments associated with SS7 and delivering the cost/performance values associated with IP transport.
SIGTRAN protocols
The SIGTRAN family of protocols includes:
Stream Control Transmission Protocol (SCTP), RFC 2960, RFC 3873, RFC 4166, RFC 4960.
ISDN User Adaptation (IUA), RFC 4233, RFC 5133.
Message Transfer Part 2 (MTP) User Peer-to-Peer Adaptation Layer (M2PA), RFC 4165.
Message Transfer Part 2 User Adaptation Layer (M2UA), RFC 3331.
Message Transfer Part 3 User Adaptation Layer (M3UA), RFC 4666.
Signalling Connection Control Part (SCCP) User Adaptation (SUA), RFC 3868.
V5 User Adaptation (V5UA), RFC 3807.
DPNSS/DASS2 User Adaption (DUA), RFC 4129
The Stream Control Transmission Protocol provides the transport protocol for SIGTRAN user adaptation layer messages across an IP network. It is described in RFC 3873, RFC 4166 and RFC 4960.
IUA provides an SCTP adaptation layer for the seamless backhaul of Q.921 user messages and service interface across an IP network. Some users that it supports are Q.931 and QSIG. It is specified in RFC 4233.
V5UA provides an SCTP adaptation layer for the seamless backhaul of V5.2 user messages and service interface across an IP network. It is a variation of IUA and is specified in RFC 3807.
M2PA provides an SCTP adaptation layer for providing an SS7 MTP signaling link over an IP network. It is specified in RFC 4165. The difference between M2PA and M2UA is described in section 1.9 of RFC 4165
M2UA provides an SCTP adaptation layer for the seamless backhaul of MTP Level 2 user messages and service inte |
https://en.wikipedia.org/wiki/CRTP | CRTP has several meanings in computer science.
Curiously recurring template pattern in the C++ programming language
Diapolycopene oxygenase, an enzyme
Cardiac resynchronization therapy pacemaker |
https://en.wikipedia.org/wiki/Critical%20mass%20%28software%20engineering%29 | In software engineering, critical mass is a stage in the life cycle when the source code grows too complicated to effectively manage without a complete rewrite. At the critical mass stage, fixing a bug introduces one or more new bugs.
Tools such as high-level programming languages and techniques such as programming in the large, code refactoring and test-driven development, exist to make it easier to maintain large, complicated programs.
See also
High-level programming language
Programming in the large
Code refactoring
Test-driven development
The Mythical Man-Month
References
Software project management |
https://en.wikipedia.org/wiki/Transportation%20in%20New%20York%20City | The transportation system of New York City is a network of complex infrastructural systems. New York City, being the most populous city in the United States, has a transportation system which includes one of the largest and busiest subway systems in the world; the world's first mechanically ventilated vehicular tunnel; and an aerial tramway. New York City is home to an extensive bus system in each of the five boroughs; citywide and Staten Island ferry systems; and numerous yellow taxis and boro taxis throughout the city. Private cars are less used compared to other cities in the rest of the United States.
Within the New York City metropolitan area, the airport system, which includes John F. Kennedy International Airport, LaGuardia Airport, Newark Liberty International Airport (located in New Jersey), Stewart Airport, and a few smaller facilities, is one of the largest in the world. The Port of New York and New Jersey, which includes the waterways of the New York City metropolitan area, is one of the busiest seaports in the United States.
There are three commuter rail systems, the PATH rapid transit system to New Jersey, and various ferries between Manhattan and New Jersey. Numerous separate bus systems operate to Westchester County, Nassau County, and New Jersey. For private vehicles, a system of expressways and parkways connects New York City with its suburbs.
Background
History
The history of New York City's transportation system began with the Dutch port of New Amsterdam. The port had maintained several roads; some were built atop former Lenape trails, others as "commuter" links to surrounding cities, and one was even paved by 1658 from orders of Petrus Stuyvesant, according to Burrow, et al. The 19th century brought changes to the format of the system's transport: the establishment of a Manhattan street grid through the Commissioners' Plan of 1811, as well as an unprecedented link between the then-separate cities of New York and Brooklyn via the Brooklyn Bridge, in 1883.
The Second Industrial Revolution fundamentally changed the city; the port infrastructure grew so rapidly following the 1825 completion of the Erie Canal that New York City became the most important connection between all of Europe and the interior of the United States. Elevated trains and subterranean transportation, known as 'El trains' and 'subways', were introduced between 1867 and 1904.
In 1904, the first subway line became operational. Practical private automobiles brought an additional change to the city by around 1930, notably the 1927 Holland Tunnel. With automobiles gaining importance, the later rise of Robert Moses proved essential to creating New York's modern road infrastructure. Moses was the architect of all of the parkway, many other important roads, and seven great bridges.
Mass transit use and car ownership
New York City is distinguished from other U.S. cities for its low personal automobile ownership and its significant use of public transp |
https://en.wikipedia.org/wiki/JMP%20%28statistical%20software%29 | JMP (pronounced "jump") is a suite of computer programs for statistical analysis developed by JMP, a subsidiary of SAS Institute. It was launched in 1989 to take advantage of the graphical user interface introduced by the Macintosh operating systems. It has since been significantly rewritten and made available also for the Windows operating system. JMP is used in applications such as Six Sigma, quality control, and engineering, design of experiments, as well as for research in science, engineering, and social sciences.
The software can be purchased in any of five configurations: JMP, JMP Pro, JMP Clinical, JMP Genomics and JMP Live. It formerly included the Graph Builder iPad App. JMP can be automated with its proprietary scripting language, JSL. The software is focused on exploratory visual analytics, where users investigate and explore data. These explorations can also be verified by hypothesis testing, data mining, or other analytic methods. In addition, discoveries made through graphical exploration can lead to a designed experiment that can be both designed and analyzed with JMP.
History
JMP was developed in the mid- to late-1980s by John Sall and a team of developers to make use of the graphical user interface introduced by the Apple Macintosh. It originally stood for "John's Macintosh Project" and was first released in October 1989. It was used mostly by scientists and engineers for design of experiments (DOE), quality and productivity support (Six Sigma), and reliability modeling. Semiconductor manufacturers were also among JMP's early adopters.
Interactive graphics and other features were added in 1991 with version 2.0, which was introduced at the 1991 Macworld Expo. Version 2 was twice the size as the original, though it was still delivered on a floppy disk. It required 2 MB of memory and came with 700 pages of documentation. Support for Microsoft Windows was added with version 3.1 in 1994. Rewritten with Version 4 and released in 2002, JMP could import data from a wider variety of data sources and added support for surface plots. Version 4 also added time series forecasting and new smoothing models, such as the seasonal smoothing method, called Winter's Method, and ARIMA (Autoregressive Integrated Moving Average). It was also the first version to support JSL, JMP Scripting Language.
In 2005, data mining tools like a decision tree and neural net were added with version 5 as well as Linux support, which was later withdrawn in JMP 9. Later in 2005, JMP 6 was introduced. JMP began integrating with SAS in version 7.0 in 2007 and has strengthened this integration ever since. Users can write SAS code in JMP, connect to SAS servers, and retrieve and use data from SAS. Support for bubble plots was added in version 7. JMP 7 also improved data visualization and diagnostics.
JMP 8 was released in 2009 with new drag-and-drop features and a 64-bit version to take advantage of advances in the Mac operating system. It also added a new user inter |
https://en.wikipedia.org/wiki/Very%20high-level%20programming%20language | A very high-level programming language (VHLL) is a programming language with a very high level of abstraction, used primarily as a professional programmer productivity tool.
VHLLs are usually domain-specific languages, limited to a very specific application, purpose, or type of task, and they are often scripting languages (especially extension languages), controlling a specific environment. For this reason, very high-level programming languages are often referred to as goal-oriented programming languages.
The term VHLL was used in the 1990s for what are today more often called high-level programming languages (not "very") used for scripting, such as Perl, Python, PHP, Ruby, and Visual Basic.
See also
Automatic programming
Low-level programming language
Feature-oriented programming
Notes
References
Symposium on Very High Level Languages. SIG- PLAN Notices (ACM) 9, 4 (April 1974), 1-132.
Teichroew, D. A survey of languages for stating requirements for computer-based information systems. Proc. AFIPS 1972 FJCC, AFIPS Press, Montvale, N.J., pp. 1203-1224.
Libre Software Meeting 2004
Libre Software Meeting: Proceedings of the VHLL track (2004).
Libre Software Meeting (2003) VHLL Track announcement
Programming language classification |
https://en.wikipedia.org/wiki/List%20of%20highest-income%20counties%20in%20the%20United%20States | There are 3,144 counties and county-equivalents in the United States. The source of the data is the U.S. Census Bureau and the data is current as of the indicated year. Independent cities are considered county-equivalent by the Census Bureau.
Summary
Before the American Civil War, the wealthiest counties were primarily located in Louisiana and Mississippi, because of the high number of enslaved people, who were not included in the population.
Loudoun County, Virginia, a suburb of Washington, D.C., is the highest-income county by median household income. Another Washington, D.C. suburb, Arlington County, Virginia, ranked as the highest-income county by median family income as of 2013.
Median household income
2020 Census
The chart below depicts the 100 highest income counties in the United States by median household income according to the 2020 United States census. Virginia has the most counties in the top 100 with 18. It is followed by California with 11; Maryland with 10; New Jersey with nine; New York and Texas with six each; Illinois with five; Colorado, Massachusetts, and Minnesota with four each; Ohio and Pennsylvania with three each; Georgia, Indiana, Utah, and Washington with two each; and Connecticut, Washington, D.C., Iowa, Kansas, Kentucky, New Hampshire, New Mexico, Tennessee, and Wisconsin with one each.
Per capita income
2020 Census
Highest-income counties and places by state
For more detailed lists of rankings of counties and places in the individual states, see the following pages:
Alabama
Alaska
Arizona
Arkansas
California
Colorado
Connecticut
Delaware
Florida
Georgia
Hawaii
Idaho
Illinois
Indiana
Iowa
Kansas
Kentucky
Louisiana
Maine
Maryland
Massachusetts
Michigan
Minnesota
Mississippi
Missouri
Montana
Nebraska
Nevada
New Hampshire
New Jersey
New Mexico
New York
North Carolina
North Dakota
Ohio
Oklahoma
Oregon
Pennsylvania
Rhode Island
South Carolina
South Dakota
Tennessee
Texas
Utah
Vermont
Virginia
Washington
West Virginia
Wisconsin
Wyoming
See also
List of United States counties by per capita income
List of lowest-income counties in the United States
Notes and references
Economy-related lists of superlatives
Income in the United States
Lists of counties of the United States |
https://en.wikipedia.org/wiki/List%20of%20dialling%20codes%20in%20the%20United%20Kingdom | This is a list of telephone dialling codes in the United Kingdom, which adopts an open telephone numbering plan for its public switched telephone network. The national telephone numbering plan is maintained by Ofcom, an independent regulator and competition authority for the UK communications industries. This list is based on the official standard, but includes defunct codes and historical changes, including the derivation of the two letter identities, in cases where known. Dialling codes do not correspond to specific political boundaries: for example, the Coventry dialling code covers a large area of Warwickshire and the Manchester dialling code covers part or all of several neighbouring towns.
When dialling within the country, all area codes are preceded by the national trunk prefix 0, which has been included in all listings in this article. 0 was traditionally the number dialled for the operator for long-distance calls before subscriber trunk dialling (STD) was introduced, and so was retained as a prefix for direct-dialled calls. In the majority of areas, the area code still corresponds to the original STD letter code. When dialling from abroad, the 0 prefix is not dialled. When dialling within the same area, the area code is not needed, save for a handful of areas that do require this. When calling from a mobile telephone or through a VoIP service, such as BT's 'Digital Voice', the area code is always needed.
Code prefixes
List of dialling codes
For an explanation of the two-letter STD codes used below, see Introduction of area codes.
ELNS denotes Extended Linked Numbering Scheme areas, where an area code is associated with more than one place name.
01426, 01523 and other non-standard 01 prefixes were briefly used for pagers in the late 1990s and then moved to new 076 prefixes in the Big Number Change in 2000/2001.
In several area codes, a block of 1,000 numbers is set aside for use as fictional numbers for drama.
Code length
The length of the area code part and the local number part is found as follows:
The number format '2+8' refers to, e.g. London, numbers using the (020) xxxx xxxx format.
The number format '5+4' refers to, e.g. Brampton, numbers using the (0169 77) xxxx format.
Areas with mandatory area code dialling
In the following areas, the area code must be included when dialling local numbers. This enables local numbers to start with 0 or 1 and was introduced to increase the number of available telephone numbers within these areas.
Overseas Territories
Unlike the Crown Dependencies of Jersey, Guernsey and the Isle of Man which use the UK area codes 01534, 01481 and 01624, respectively, telephone numbers in British Overseas Territories do not come under the UK telephone numbering plan. Some are within the North American Numbering Plan (NANP). These calls are treated as international calls. Below are the access codes for the overseas territories:
North American Numbering Plan
Anguilla +1 (264)
Bermuda +1 (441)
British |
https://en.wikipedia.org/wiki/List%20of%20U.S.%20states%20and%20territories%20by%20income | This is a list of U.S. states, territories and the District of Columbia by income. Data is given according to the 2021 American Community Survey (ACS) 1-Year Estimates, except for the American Samoa, Guam, the Northern Mariana Islands and the U.S. Virgin Islands, for which the data comes from 2010, as ACS does not operate in these areas.
States and territories ranked by median household income
Data given in 2019 dollars. No data was given for 2020. Tables do not reflect the margin of error in the values.
Maps
States and territories ranked by per capita income
Data for the American Samoa, Guam, the Northern Mariana Islands and the U.S. Virgin Islands is given as of 2010 (source: American FactFinder). Resident population given as of the 2020 United States Census.
See also
List of countries by average wage
List of U.S. states by median wage
Highest-income counties in the United States
Personal income in the United States
Household income in the United States
List of lowest-income places in the United States
Thank God for Mississippi
Notes
References
External links
HUD income breakout by state low/very low/extremely low income
Income
States by income
Income
United states, Income |
https://en.wikipedia.org/wiki/Mortran | Mortran (More Fortran) is an extension of the Fortran programming language used for scientific computation. It introduces syntax changes, including the use of semicolons to end statements, in order to improve readability and flexibility. Mortran code is macro-processed into Fortran code for compilation.
Example:
<I=1,200; J=I;
UNTIL M(J).EQ.0 <
J=M(J);
>
IF I.NE.J <
OUTPUT I,M(J+1); (' Chain',I4,' ends with ',A4);
>
>
Note that Mortran, like many preprocessors, does not make a complete analysis of the Fortran source and, like many preprocessors, may not always make its assumptions/requirements explicit. Consider, for example, Mortran multiple assignment. From the Mortran User Guide:
/ I, A(I,K), J / = SQRT(X/2.0);
produces the following FORTRAN statements:
I = SQRT(X/2.0)
A(I,K) = SQRT(X/2.0)
J = SQRT(X/2.0)
In this example, the produced Fortran implements the multiple assignment correctly only if X is not aliased to I or to A(I,K), assuming the multiple assignment semantics are left to right.
The MORTRAN2 processor is written in ANSI standard Fortran 66, with the only extension the ability to assign and compare character data stored in INTEGER variables.
External links
Using MORTRAN 2 (Stanford document)
A Users Guide to MORTRAN 2
EGS User Guide to Mortran3
MORTRAN3 Users Guide
Mortran lecture (Japanese) from KEK (PDF)
History of Programming Languages:Mortran
Emacs major mode for editing Mortran source
Fortran programming language family |
https://en.wikipedia.org/wiki/ShadowCrew | ShadowCrew was a cybercrime forum that operated under the domain name ShadowCrew.com between August 2002 and November 2004.
Origins
The concept of the ShadowCrew was developed in early 2002 during a series of chat sessions between Brett Johnson (GOllumfun), Seth Sanders (Kidd), and Kim Marvin Taylor (MacGayver). The ShadowCrew website also contained a number of sub-forums on the latest information on hacking tricks, social engineering, credit card fraud, virus development, scams, and phishing.
Organizational structure
ShadowCrew emerged early in 2002 from another underground site, counterfeitlibrary.com, which was run by Brett Johnson and would be followed up by carderplanet.com owned by Dmitry Golubov a.k.a. Script, a website primarily in the Russian language. The site also facilitated the sale of drugs wholesale.
During its early years, the site was hosted in Hong Kong, but shortly before CumbaJohnny (Albert Gonzalez)'s arrest, the server was in his possession somewhere in New Jersey.
Aftermath and legacy
ShadowCrew was the forerunner of today's cybercrime forums and marketplaces. The structure, marketplace, review system, and other innovations began when Shadowcrew laid the basis of today's underground forums and marketplaces. Likewise, many of today's current scams and computer crimes began with Counterfeitlibrary and Shadowcrew. The site flourished from the time it opened in 2002 until its demise in late October 2004. Even though the site was booming with criminal activity and all seemed well, the members did not know what was going on behind the scenes. Federal agents received their "big break" when they found CumbaJohnny aka Albert Gonzalez. Upon Cumba's arrest, he immediately turned and started working with federal agents. From April 2003 to October 2004, Cumba assisted in gathering information and monitoring the site and those who utilized it. He started by taking out many of the Russians who were hacking databases and selling counterfeit credit cards. CumbaJohnny was a long term police informant who was responsible for teaching the US Secret Service how to monitor, trap and arrest the ShadowCrew.
The Federal indictment says, "Shadowcrew was an international organization of approximately 4,000 members…" The last available page before October 27, 2004 on archive.org shows 2,709 registered members. To people familiar with the ShadowCrew forum, it is well known that many members had multiple user names. Members who were banned from the forum would frequently register with another user name as well. Lastly, the forum was around for over 2 years so there were possibly many inactive accounts. However, there was also a need by members to develop a name that could be trusted; so it is possible that the idea that most of the registered users were duplicates isn't accurate.
$4 million in losses is the believed amount dealt with through this forum. This figure was arrived at by multiplying the number of credit cards transferred by $500 eac |
https://en.wikipedia.org/wiki/Roy%20Conrad | Roy L. Conrad (November 11, 1940 – January 18, 2002) was an American actor, best known for his role as the voice actor of Ben in the 1995 LucasArts computer game Full Throttle.
Career
Conrad provided the voice of Ben in the LucasArts computer game Full Throttle. He has also appeared in another LucasArts game, Star Wars: Rebel Assault II: The Hidden Empire, as the rebel pilot Ace Merrick. Conrad also took smaller film roles in films such as Patch Adams, The Wizard and a role in the 1993 television series Dr. Quinn, Medicine Woman.
One of the developers of Full Throttle had this to say when recalling how they cast the part of Ben:
Roy was one of the sweetest guys you'll ever meet, and a joy to work with. It was hilarious to watch him act, and see that stern, gravelly voice of Ben coming out of this gentle, soft-spoken man. Casting Roy was definitely the easiest decision we ever had to make at LucasArts. We had been through boxes of audition tapes without much luck--When you advertise that you're looking for a tough, biker character, you get a lot of guys trying to be tough; Growling, yelling, and forcing a lot of attitude--And then we put in Roy's tape, and out came this effortless, deep, rich, bass sound. And that was that. We didn't even listen to another tape.
Conrad died of lung cancer in 2002 in Roseville, California.
Filmography
References
External links
1940 births
2002 deaths
American male video game actors
American male voice actors
Deaths from lung cancer in California
Place of birth missing |
https://en.wikipedia.org/wiki/Cities%20along%20the%20Silk%20Road | This articles lists cities located along the Silk Road. The Silk Road was a network of ancient trade routes which connected Europe with China, spanning from the Mediterranean Sea to the Korean Peninsula and Japan.
The Silk Road's eastern end is in present-day China, and its main western end is Antioch. The Silk Road started about the time of the Han dynasty, when Emperor Wu was ruling.
Along the terrestrial/land Silk Roads
Major cities, broadly from the eastern Mediterranean to South Asia, and arranged roughly west to east in each area by modern-day country
The Silk Roads across the Middle East and Western Asia
Turkey
Constantinople, ancient Byzantium, (now Istanbul)
Bursa
Beypazarı
Mudurnu
Taraklı
Konya
Adana
Antioch
Izmir
Trabzon
Azerbaijan
Baku
Shamakhi
Barda
Georgia
Tbilisi (Tiflis)
Batumi (Batoum)
Poti
Armenia
Yerevan
Lebanon
Tyre
Syria
Aleppo
Tartus
Homs
Damascus
Palmyra
Raqqa
Dura Europos
Iraq
Mosul
Erbil
Samarra
Fallujah
Baghdad
Ctesiphon
Baquba
Iran
Tabriz
Zanjan
Rasht
Kermanshah
Hamadan
Rey (or Ray in modern-day Tehran)
Hecatompylos (Damghan)
Sabzevar
Nishapur
Mashhad
Tus
Bam
Yazd
Qazvin
Qumis (Hekatompylos)
Central Asia
Turkmenistan
Nisa
Merv
Urgench
Amul
Uzbekistan
Bukhara
Shahrisabz
Samarkand
Tashkent
Kokand (Fergana Valley)
Andijon (Fergana Valley)
Tajikistan
Khujand (Fergana Valley)
Istaravshan
Kazakhstan
Otrar
Ispidjab (or Sairum)
Taraz
Hazrat-e Turkestan
Almaty
Kyrgyzstan
Issyk kul
Tokmok
Bishkek
Osh
Southern Routes and South Asia
Afghanistan
Bactra (Balkh)
Herat
Alexandria Arachosia (Kandahar)
Bamyan
Kabul
Pakistan
Purusapura
Pushkalavati
Takshashila
Multan
Banbhore/Barbarikon
Debal/Patala
India
Tamralipta (or Tamluk)
Leh
Jaisalmer
Mathura
Varanasi (or Benares)
Pataliputra
Nepal
Kathmandu – see also Patan & Bhaktapur
Bangladesh
Wari-Bateshwar
Pundranagara
Vikrampura
Somapura
Bhitargarh
Sonargaon
Chattagram/Chatgaon/Chittagong
Comilla/Mainamati/Samatata
Jahangir Nagar/Dhaka
Bhutan
Jakar
Paro
China: The northern route along the Taklamakan Desert
Kashgar (or Kashi) (Major City)
Liqian
Aksu
Kucha
Korla
Loulan
Karasahr (Yanqi)
Turpan (Turfan)
Jiaohe Ruins
Turpan Water Museum
Gaochang
the Bezeklik Thousand Buddha Caves
Chang'an
Kumul/Hami
Ürümqi
Yumen Pass (or Jade Gate or Pass of the Jade Gate) (city called Yumenguan or Hecang)
Anxi
China: The southern route along the Taklamakan Desert
Kashgar (or Kashi) (Major City)
Pishan
Khotan
Niya
Mingfeng
Endere
Charchan
Waxxari
Ruoqiang Town (Charklik)
Miran
Yangguan, or Yangguan Pass
Dunhuang
the Mogao Caves
Anxi
China: From Anxi/Dunhuang to Chang'an (Xi'an)
Dunhuang (Major City)
Jiayuguan
Jiuquan
Zhangye
Shandan
Liangzhou (Wuwei)
Tianzhu, Gansu
Lanzhou
Tianshui
Baoji
Chang'an (modern-day Xi'an)
The eastern routes
Korea
Pyongyang
Gyeongju
Busan
Seoul
Japan
Nara
Fukuoka
Nagasaki
Osaka
Along the Indian Ocean t |
https://en.wikipedia.org/wiki/History%20of%20information%20technology%20auditing | Information Technology Auditing (IT auditing) began as Electronic Data Process (EDP) Auditing and developed largely as a result of the rise in technology in accounting systems, the need for IT control, and the impact of computers on the ability to perform attestation services. The last few years have been an exciting time in the world of IT auditing as a result of the accounting scandals and increased regulation. IT auditing has had a relatively short yet rich history when compared to auditing as a whole and remains an ever-changing field.
The introduction of computer technology into accounting systems changed the way data was stored, retrieved and controlled. It is believed that the first use of a computerized accounting system was at General Electric in 1954. During the time period of 1954 to the mid-1960s, the auditing profession was still auditing around the computer. At this time only mainframe computers were used and few people had the skills and abilities to program computers. This began to change in the mid-1960s with the introduction of new, smaller and less expensive machines. This increased the use of computers in businesses and with it came the need for auditors to become familiar with EDP concepts in business. Along with the increase in computer use, came the rise of different types of accounting systems. The industry soon realized that they needed to develop their own software and the first of the generalized audit software (GAS) was developed. In 1968, the American Institute of Certified Public Accountants (AICPA) had the Big Eight (now the Big Four) accounting firms participate in the development of EDP auditing. The result of this was the release of Auditing & EDP. The book included how to document EDP audits and examples of how to process internal control reviews.
Around this time EDP auditors formed the Electronic Data Processing Auditors Association (EDPAA). The goal of the association was to produce guidelines, procedures and standards for EDP audits. In 1977, the first edition of Control Objectives was published. This publication is now known as Control Objectives for Information and related Technology (CobiT). CobiT is the set of generally accepted IT control objectives for IT auditors. In 1994, EDPAA changed its name to Information Systems Audit and Control Association (ISACA). The period from the late 1960s through today has seen rapid changes in technology from the microcomputer and networking to the internet and with these changes came some major events that change IT auditing forever.
The formation and rise in popularity of the Internet and E-commerce have had significant influences on the growth of IT audit. The Internet influences the lives of most of the world and is a place of increased business, entertainment and crime. IT auditing helps organizations and individuals on the Internet find security while helping commerce and communications to flourish.
Major Events
There are five major events in U.S. history |
https://en.wikipedia.org/wiki/Immortal%20Grand%20Prix | refers to two anime series co-produced by Production I.G and Cartoon Network. The first is a "microseries" consisting of five 5-minute episodes, and the second is a 26-episode animated series loosely related to the first.
IGPX microseries
The Immortal Grand Prix is a tournament between teams of gun-wielding mechs. As Team Velshtein is injured, the random drawing chooses Team Suzaku, led by pilot Takeshi Noa, as the one to face Team Sledge Mamma, a trio of cybernetically enhanced cyborgs. At first, Team Suzaku does not have weapons because their mechanic U-Matsu forgot them. Amy delivers weapons from Velshtein, but Team Suzaku has a hard time controlling them. Amy's cat co-pilot Luca takes control and knocks Timmer out of his mech. Liz, out of ammo, uses her capoeira image training. She is eventually at the mercy of an opposing pilot and surrenders. The Sledge Mamma mechs shoot at Takeshi, but Amy jumps in to save him and is knocked out of the game. After being kicked around by the Sledge Mamma mechs, Takeshi reveals his plan. Using his ninjatō and shuriken, he knocks Dimmer and Yammer out of their mechs and wins. However, the series ends on a bitter note as Velshtein's owner Hamgra blackmails Team Suzaku to merge their teams and allow him to add cybernetic enhancements to their pilots, or else he will make them pay for the weapons they borrowed. This conflict is never resolved due to the end of the microseries.
Cast
Beau Billingslea – Yammer
Steven Blum – Cunningham
Sandy Fox – Amy
Steve Kramer – Timmer
Lex Lang – Metoo
Wendee Lee – BT
Julie Maddalena – Luca
Michael McConnohie – Dimmer
Jamieson Price – Hamgra
Michelle Ruff – Suzaku
Joshua Seth – Takeshi Noa
Julie Ann Taylor – PA
Kirk Thornton – Umatsu
Kari Wahlgren – Liz
IGPX TV series
The IGPX TV series made its hour-long premiere on November 5, 2005, at 10/9c. The series is set in 2049 and revolves around the Immortal Grand Prix, or IGPX, which is a mecha racing/battle circuit. The sport is so popular that an entire city has been built for the racing industry, where competitions take place on a huge track. In the IGPX, two teams of three mechs, high-tech fighting machines driven by humans, race at speeds greater than . The IGPX also contains fighting elements; attacking the opposing team to disable their mechs (thus preventing them from winning the race) is not only legal, but also expected. Team Satomi, a crew of amateur pilots, has just won a minor-league championship, the IG-2, vaulting them into the sport's highest level, the IG-1. Now, the untested rookies of Team Satomi must overcome impossible odds and beat the world's most skilled and ruthless pilots.
The series was Toonami's first original series.
Cast
Haley Joel Osment – Takeshi Jin
Hynden Walch – Amy Stapleton
Michelle Rodriguez – Liz Riccaro
Kari Wahlgren – Luca, Michiru Satomi
Steven Blum – Alex Cunningham
Louise Chamis – Jane Rublev
Peter Cullen – Opening Narration
Erik Davies – Ricardo Montazio
|
https://en.wikipedia.org/wiki/Benchmark%20%28computing%29 | In computing, a benchmark is the act of running a computer program, a set of programs, or other operations, in order to assess the relative performance of an object, normally by running a number of standard tests and trials against it.
The term benchmark is also commonly utilized for the purposes of elaborately designed benchmarking programs themselves.
Benchmarking is usually associated with assessing performance characteristics of computer hardware, for example, the floating point operation performance of a CPU, but there are circumstances when the technique is also applicable to software. Software benchmarks are, for example, run against compilers or database management systems (DBMS).
Benchmarks provide a method of comparing the performance of various subsystems across different chip/system architectures.
Purpose
As computer architecture advanced, it became more difficult to compare the performance of various computer systems simply by looking at their specifications. Therefore, tests were developed that allowed comparison of different architectures. For example, Pentium 4 processors generally operated at a higher clock frequency than Athlon XP or PowerPC processors, which did not necessarily translate to more computational power; a processor with a slower clock frequency might perform as well as or even better than a processor operating at a higher frequency. See BogoMips and the megahertz myth.
Benchmarks are designed to mimic a particular type of workload on a component or system. Synthetic benchmarks do this by specially created programs that impose the workload on the component. Application benchmarks run real-world programs on the system. While application benchmarks usually give a much better measure of real-world performance on a given system, synthetic benchmarks are useful for testing individual components, like a hard disk or networking device.
Benchmarks are particularly important in CPU design, giving processor architects the ability to measure and make tradeoffs in microarchitectural decisions. For example, if a benchmark extracts the key algorithms of an application, it will contain the performance-sensitive aspects of that application. Running this much smaller snippet on a cycle-accurate simulator can give clues on how to improve performance.
Prior to 2000, computer and microprocessor architects used SPEC to do this, although SPEC's Unix-based benchmarks were quite lengthy and thus unwieldy to use intact.
Computer manufacturers are known to configure their systems to give unrealistically high performance on benchmark tests that are not replicated in real usage. For instance, during the 1980s some compilers could detect a specific mathematical operation used in a well-known floating-point benchmark and replace the operation with a faster mathematically equivalent operation. However, such a transformation was rarely useful outside the benchmark until the mid-1990s, when RISC and VLIW architectures emphasized the importa |
https://en.wikipedia.org/wiki/V-Ray | V-Ray is a biased computer-generated imagery rendering software application developed by Bulgarian software company Chaos . V-Ray is a commercial plug-in for third-party 3D computer graphics software applications and is used for visualizations and computer graphics in industries such as media, entertainment, film and video game production, industrial design, product design and architecture.
Overview
V-Ray is a rendering engine that uses global illumination algorithms, including path tracing, photon mapping, irradiance maps and directly computed global illumination.
The desktop 3D applications that are supported by V-Ray are:
Autodesk 3ds Max
Autodesk Revit
Cinema 4D
Maya
Modo
Nuke
Rhinoceros
SketchUp
Katana
Unreal
Houdini
Blender
Academic and stand-alone versions of V-Ray are also available.
Modo support will be discontinued at the end of 2021.
Notable studios using V-Ray
North America
United States
Method Studios
Digital Domain
Blur Studio
Zoic Studios
Apple Inc.
Hogarth Worldwide
Canada
Bardel Entertainment
Europe
France
Zagtoon
Netherlands
PostOffice Amsterdam
Germany
Scanline VFX
References
Further reading
Francesco Legrenzi, V-Ray - The Complete Guide, 2008
Markus Kuhlo and Enrico Eggert, Architectural Rendering with 3ds Max and V-Ray: Photorealistic Visualization, Focal Press, 2010
Ciro Sannino, Photography and Rendering with V-Ray, GC Edizioni, 2012
Luca Deriu, V-Ray e Progettazione 3D, EPC Editore, 2013
Ciro Sannino, Chiaroscuro with V-Ray, GC Edizioni, 2019
External links
Chaos Group
V-Ray at rhino3d.com
A Closer Look At VRAY Architectural Review of V-Ray
VRay Material Downloads and Resource Library
VRAYforC4D - the website of V-Ray for Cinema4d, made by LAUBlab KG
Free Material Library
3D graphics software
Rendering systems
Global illumination software
3D rendering software for Linux
Proprietary commercial software for Linux |
https://en.wikipedia.org/wiki/Fez%20%28That%20%2770s%20Show%29 | Fez is a fictional character and one of the male leads on the Fox Network's That '70s Show, also appearing in a minor role in the Netflix sequel That '90s Show portrayed by Wilmer Valderrama. He was the foreign exchange student in a group of six local teenagers.
Origins
Fez was born on August 4, 1960. His real name is deemed unpronounceable by his friends, so they call him "Fernando" (a homophone of "FES", an acronym for foreign exchange student). The series' official web site explains the spelling "Fez", as opposed to "Fes", as "poetic license".
Fez's country of origin is one of the longest running gags on the show.
Later life
In That '90s Show, Fez and Jackie broke up when she cheated by returning to Kelso (including having their son Jay), after which Fez became a successful businessman by opening a beauty salon called "Chez Fez". He is now dating the Formans' next door neighbor Sherri, mother of Gwen and Nate.
References
External links
Mastro, Dana. and Morawitz, Elizabeth. Latino Representation on Primetime Television: A Content Analysis, Section Stereotypes of Latinos, pp. 7.
Thanu Yakupitiyage Battling or Creating Stereotypes in ‘Aliens in America’?, October 19, 2007, Racewire.
Ben Megargel Reality spin-off falls into familiar traps, The Michigan Daily, February 6, 2007.
That '70s Show characters
Fictional characters from Wisconsin
Television characters introduced in 1998
Fictional immigrants to the United States
Male characters in television
Teenage characters in television |
https://en.wikipedia.org/wiki/Kiwi%20FM | Kiwi FM (formerly Channel Z) was a New Zealand alternative music radio network. From 1996 to 2005, as Channel Z, it broadcast alternative and local music for a youth-oriented market. From 2005 to 2015, as Kiwi FM, it broadcast predominantly New Zealand independent music, to showcase local music across a wide range of genres and enable greater access to an international market for local contemporary artists. The station broadcast in Auckland, Wellington and Christchurch on FM frequencies and globally through an internet stream. During its later years it operated as a non-profit subsidiary of MediaWorks New Zealand, and was affiliated with XFM and Triple J.
History
Channel Z
Channel Z began as a modern rock and alternative rock radio station with a youth to adult demographic in Wellington from 19 August 1996, expanding to Auckland in 1997 and Christchurch in 1999. Channel Z was named after The B-52's song of the same name, and played a vital role in lynchpinning alternative NZ and international artists other stations claimed were too "dangerous" to play. John Diver was the station's first programme director and Martin Devlin, John Diver, James Coleman, and Olivia Sinclair-Thomson were among the station's earliest presenters. The station was part of the More FM group of stations. The group in turn became part of CanWest-owned Global Radio, which later became RadioWorks.
In 1998, longtime presenter Pheobe Spiers and breakfast hosts Jon Bridges and Nathan Rarere joined the station. In 1999, under network programme director Roger Clamp and Global Radio chief executive Brent Impey, the station changed to a less alternative format. Former programme director John Diver and fellow DJ Olivia Sinclair-Thomson resigned in protest. It received a mixed response from listeners. The network expanded to Christchurch in August 1999, with Willy Macalister presenting a local daytime show and Melanie Wise presenting a night show alongside the national network programme. The new station was launched with a concert featuring Stellar*, Living End, Zed and Tadpole.
In 2001, local shows in Wellington and Christchurch were abolished in favour of networked programming, Jon and Nathan's breakfast show was replaced with a James Coleman breakfast show, and Bomber and Clarke Gayford moved from Nights to Drive. The station's frequencies were reallocated from 94.2 to 93.8 in Auckland and 91.7 to 94.7 in Wellington, while it remained on 99.3 in Christchurch. In 2003, the station's breakfast show was cancelled. The 94.2 frequency in Auckland was used to launch The Edge and Channel Z was moved to a lower powered 93.8 frequency. The station's ratings fell, but improved when the transmitter was relocated to the Sky Tower from its previous position on Waiheke Island and gained a higher-powered frequency.
Channel Z released four compilation albums based on listener polls and staff selections: Channel Z: the Best of Volume One, Channel Z: Up Loud!, Channel Z: the Best of Volume Two, |
https://en.wikipedia.org/wiki/Coast%20%28radio%20station%29 | Coast is a New Zealand radio network playing a mix of "feel good" hits predominantly from the 1970s and 1980s. The network includes stations in 21 major cities and provincial centres broadcasting from studios in central Auckland, owned and operated by New Zealand Media and Entertainment (NZME).
The Coast network reaches an estimated 315,100 listeners each week. Its format is smooth, with short hourly news bulletins, succinct voice breaks, minimal ad breaks and limited clutter. Its target listener is 40 to 64 years old; has reached their highest-earning potential, owns their own home and spends disposable income on luxury items and travel. The audience is almost equally male and female, with a 52% female skew.
Coast format was launched 26 April 2004.
History
Early years
Coast originally started in Hawke's Bay in 2002, as a local station. The history of this station dates back to 1995 as The Wireless Station broadcasting on 1530 AM and playing music from the 1930s, 1940s and 1950s. The Wireless Station was started/operated by The Wireless Station Ltd for three years from November 1995 and was then leased or sold to Hawke's Bay Media Group in 1998 and re-branded as Goodtime Gold, playing music from the 1960s and 1970s. In 1999 it was renamed simply Gold 1530.
Gold 1530 was leased (or sold) to The Radio Network in 2000 and was re-branded as Jammin' Oldies 1530 AM or JO 1530 in June 2000. In 2002 the station became the very first station under the Coast brand name and in 2004 Coast began producing their programme from Auckland networked back to Hawke's Bay on 1530 AM (then on 1584 AM from 2011), and later to the rest of New Zealand.
Relaunch
The final re-branding of the station was to the current name Coast 1530. In 2004 the station became voice tracked from Auckland in preparation for its launch in the Auckland market on 26 April 2004. The network expanded beyond Auckland and Hawke's Bay to other markets later in the year. Initially, the playlist consisted of music from the 50s, 60s and 70s, with a very small portion from the late 40s.
The network rose to third place in the Auckland radio survey ratings in 2006, just two years after it began. Then programme director Mike Regal credited the station's success to serving the baby boomer gap in the market that had previously been ignored by marketers, advertisers and media companies. He said the station was a fine balancing act between being neither a station for the young or a station for seniors. "We don't want to be too cool and hip with it and risk alienating people, but on the other side we didn't want to sound too old either," he told the New Zealand Herald.
Recent years
In the current radio survey results Coast has 100,000 listeners in Auckland each week and a 5.1% market share, making it the sixth highest-rating radio stations in the highly competitive Auckland radio market.
By 2014 most of the older playlist (pre-1960) had been dropped, and at times more recent artists could be heard |
https://en.wikipedia.org/wiki/Gerard%20Salton%20Award | The Gerard Salton Award is presented by the Association for Computing Machinery (ACM) Special Interest Group on Information Retrieval (SIGIR) every three years to an individual who has made "significant, sustained and continuing contributions to research in information retrieval". SIGIR also co-sponsors (with SIGWEB) the Vannevar Bush Award, for the best paper at the Joint Conference on Digital Libraries.
Chronological honorees and lectures
Source: SIGIR
1983 — Gerard Salton, Cornell University : "About the future of automatic information retrieval."
1988 — Karen Spärck Jones, University of Cambridge : "A look back and a look forward."
1991 — Cyril Cleverdon, Cranfield Institute of Technology : "The significance of the Cranfield tests on index languages."
1994 — William S. Cooper, University of California, Berkeley : "The formalism of probability theory in IR: a foundation or an encumbrance?"
1997 — , Rutgers University : "Users lost (summary): reflections on the past, future, and limits of information science."
2000 — Stephen E. Robertson, City University London : "On theoretical argument in information retrieval."For ... "Thirty years of significant, sustained and continuing contributions to research in information retrieval. Of special importance are the theoretical and empirical contributions to the development, refinement, and evaluation of probabilistic models of information retrieval."
2003 — W. Bruce Croft, University of Massachusetts Amherst : "Information retrieval and computer science: an evolving relationship."For ... "More than twenty years of significant, sustained and continuing contributions to research in information retrieval. His contributions to the theoretical development and practical use of Bayesian inference networks and language modelling for retrieval, and to their evaluation through extensive experiment and application, are particularly important. The Center for Intelligent Information Retrieval which he founded illustrates the strong synergies between fundamental research and its application to a wide range of practical information management problems."
2006 — C. J. van Rijsbergen, University of Glasgow : "Quantum haystacks."
2009 — Susan Dumais, Microsoft Research : "An Interdisciplinary Perspective on Information Retrieval."
2012 — Norbert Fuhr, University of Duisburg-Essen: "Information Retrieval as Engineering Science."
2015 — Nicholas J. Belkin, Rutgers University : “People, Interacting with Information”
2018 — , University of Tampere : “Information Interaction in Context”
2021 — ChengXiang Zhai, University of Illinois Urbana–Champaign : “Information Retrieval as Augmentation of Human Intelligence”
See also
Information Retrieval Awards
List of computer science awards
References
External links
ACM SIGIR homepage
ACM SIGIR awards
Awards of the Association for Computing Machinery
Computer science awards |
https://en.wikipedia.org/wiki/List%20of%20typographic%20features | Typographic features made possible using digital typographic systems have solved many the demands placed on computer systems to replicate traditional typography and have expanded the possibilities with many new features. Three systems are in common use: OpenType, devised by Microsoft and Adobe, Apple's Apple Advanced Typography (AAT), and SIL's Graphite. The lists below provide information about OpenType and AAT features. Graphite does not have a fixed set of features; instead it provides a way for fonts to define their own features.
OpenType typographic features
The OpenType format defines a number of typographic features that a particular font may support. Some software, such as Adobe InDesign, LibreOffice/OpenOffice, or recent versions of Lua/XeTeX, gives users control of these features, for example to enable fancy stylistic capital letters (swash caps) or to choose between ranging (full-height) and non-ranging (old-style, or lower-case) digits. Some web browsers also support OpenType features in accordance with the CSS Fonts Module Level 3 specification, which allows OpenType features to be set directly via the property, or indirectly by means of higher-level mechanisms.
The following tables list the features defined in version 1.8.1 of the OpenType specification. The codes in the "type" column are explained after the tables.
OpenType features may be applicable only to certain language scripts or specific languages, or in certain writing modes. The features are split into several tables accordingly.
Features primarily intended for or exclusively required by South-Asian alphasyllabaries (Indic/Brahmic)
Features primarily intended for or exclusively required by East-Asian tetragrams (Chinese, Japanese, Korean)
Features primarily intended for or exclusively required by West-Asian (Semitic, Arabic) and other cursive scripts or fonts
Features intended for bicameral [cased] alphabets (Latin, Greek, Cyrillic, etc.)
Features depending on writing direction
Features intended for digits and math
Ligation and alternate forms features intended for all scripts
Positioning features intended for all scripts
Special features intended for all scripts
Legend of substitution and positioning codes
Below are listed the OpenType lookup table types, as used in the "type" column in the above tables. S stands for substitution, and P stands for positioning. Note that often a feature can be implemented by more than one type of table, and that sometimes the specification fails to explicitly indicate the table type.
AAT typographic features
Features that take one value, mutual exclusive from the rest:
Annotation nalt
No Annotation
Box Annotation
Rounded Box Annotation
Circle Annotation
Inverted Circle Annotation
Parenthesis Annotation
Period Annotation
Roman Numeral Annotation
Diamond Annotation
Character Alternatives
No Alternates
… rand; aalt, calt, falt, jalt, salt, ssXX, hkna/vkna, rtla, vrt2
Character Shape half, ruby; ljmo, vjmo, tjmo
|
https://en.wikipedia.org/wiki/SpaceWire | SpaceWire is a spacecraft communication network based in part on the IEEE 1355 standard of communications. It is coordinated by the European Space Agency (ESA) in collaboration with international space agencies including NASA, JAXA, and RKA.
Within a SpaceWire network the nodes are connected through low-cost, low-latency, full-duplex, point-to-point serial links, and packet switching wormhole routing routers. SpaceWire covers two (physical and data-link) of the seven layers of the OSI model for communications.
Architecture
Physical layer
SpaceWire's modulation and data formats generally follow the data strobe encoding - differential ended signaling (DS-DE) part of the IEEE Std 1355-1995. SpaceWire utilizes asynchronous communication and allows speeds between 2 Mbit/s and 200 Mbit/s, with initial signalling rate of 10Mbit/s. DS-DE is well-favored because it describes modulation, bit formats, routing, flow control, and error detection in hardware, with little need for software. SpaceWire also has very low error rates, deterministic system behavior, and relatively simple digital electronics. SpaceWire replaced old PECL differential drivers in the physical layer of IEEE 1355 DS-DE by low-voltage differential signaling (LVDS). SpaceWire also proposes the use of space-qualified 9-pin connectors.
SpaceWire and IEEE 1355 DS-DE allows for a wider set of speeds for data transmission, and some new features for automatic failover. The fail-over features let data find alternate routes, so a spacecraft can have multiple data buses, and be made fault-tolerant. SpaceWire also allows the propagation of time interrupts over SpaceWire links, eliminating the need for separate time discretes.
Link layer
Each transferred character starts with a parity bit and a data-control flag bit. If data-control flag is a 0-bit, an 8-bit LSB character follows. Otherwise one of the control codes, including end of packet (EOP).
Network layer
The network data frames look as follows:
One or more address bytes are used for the routing. Addresses are either physical ones (0-31), or logical ones. The difference is that the physical addresses are deleted from the frame header during routing - which is used for hop-based routing (based on path specified in the frame itself). Logical addresses may be deleted as well, depending on the router configuration.
Interconnection
The hardware devices may be connected either directly, or via a SpaceWire router. In the former case, usually pairs of devices are used to guarantee a fail-safe operation, which is handled by the software.
A SpaceWire router is usually a crossbar switch-type device, operating in wormhole switching mode. This also may limit the speed of the communication to the lowest common speed. The routing decisions are based on the programmed routing table and the initial incoming frame contents.
Uses
SpaceWire is used all around the globe.
Its use began primarily in ESA projects, but it is currently used by NASA, JAXA, |
https://en.wikipedia.org/wiki/TARGET%20%28CAD%20software%29 | TARGET 3001! is a CAD computer program for EDA and PCB design, developed by Ing.-Büro Friedrich in Germany. It supports the design of electronic schematics, PCBs, and device front panels. It runs under Windows and is available in English, German and French.
A special branch of the program is the ASIC Designer, which allows design of integrated circuits.
The free version (for non-commercial use) is limited to 250 connection pins or pads on two copper layers. The PCB manufacturer PCB-Pool and Conrad Electronic provide a free unlimited version, that generates only printed output or output for PCB-Pool and Conrad's PCB service. Commercial versions with all features are available.
Features
TARGET 3001! collects several features under one user interface (MDI). All project information is stored in one file to avoid redundancy and version conflicts. Design begins with the creation of a schematic diagram and usually ends with the layout of a PCB (or chip).
The schematics can be simulated by the integrated PSPICE compatible mixed mode simulator. Components are stored in a SQLite or MySQL database, also externally accessible. Component data include direct links to datasheets and component supplier information as well as simulation information and 3D models. TARGET's open Component Interchange Format CXF is supported by universal component databases like Ultra Librarian and Footprint Expert.
PCBs or ASICs can be designed manually or using an autoplacer and autorouter. A Specctra interface to external autorouters is available. The design can be automatically checked for spacing violations and many other design rules. If the PCB is ready designed it can be directly displayed and rotated in a live 3D view. The 3D data can be exported in STEP format to produce preview 3D dummies of the PCB on 3D printers. Circuit design on 3D bodies (Molded Interconnect Device, MID) is possible.
CNC data for PCB milling can be obtained in several formats. Additionally a device front panel can directly be derived from the PCB, using the coordinates on the PCB, e.g. from LEDs or potentiometers.
History
A predecessor of TARGET 3001! was "RULE" (), a DOS-based program for PCB layout (1989). After hobbyists used this, there were calls for a schematic tool and autorouter. In response, TARGET 2.1 (for DOS) was released in 1992. The move to Windows was difficult: early versions of "TARGET V3 for Windows" were prone to crash. The package became stable and more accepted among hobby, educational and professional users.
Developments in versions V7 to V16 included an EMC tool and PSPICE-compatible simulation. The name TARGET was changed to TARGET 2001!, but, as year 2001 approached, "TARGET 3001!" was registered as a trademark and used for versions V9 and higher.
TARGET 3001! is used also by industrial designers. For example, TOYOTA used it for cable harnesses in their Formula 1 racing car.
Today, TARGET 3001! is one of the most popular PCB layout systems in Germany and Europe. |
https://en.wikipedia.org/wiki/PowerLinux | PowerLinux is the combination of a Linux-based operating system (OS) running on PowerPC- or Power ISA-based computers from IBM. It is often used in reference along with Linux on Power, and is also the name of several Linux-only IBM Power Systems.
IBM and Linux
In the late 1990s, IBM began considering the Linux operating system. In 2000, IBM announced it would promote Linux. In 2001, IBM invested $1 billion to back the Linux movement, embracing it as an operating system for IBM servers and software. Within a decade, Linux could be found in virtually every IBM business, geography and workload, and continues to be deeply embedded in IBM hardware, software, services and internal development.
A survey released by the Linux Foundation in April 2012 showed IBM as the fifth-leading commercial contributor over the past seven years, with more than 600 developers involved in more than 100 open-source projects.
IBM established the Linux Technology Center (LTC) in 1999 to combine its software developers interested in Linux and other open-source software into a single organization. The LTC collaborated with the Linux community to make Linux run optimally on PowerPC, x86, and more recently, the Cell Broadband Engine. Developers in the LTC contribute to various open-source projects as well as projects focused on enabling Linux to use new hardware functions on IBM platforms.
Linux has run on IBM POWER systems since 2001, when a team created a new, 64-bit port for the Linux kernel to allow the OS to run on PowerPC processors.
The first system to fully support the 64-bit Linux kernel was IBM's POWER5, created in 2004. It was followed by POWER6 in 2007 and the current POWER7-based systems in 2010.
PowerLinux Servers
Linux was first ported to POWER in June 2000. Since then PowerLinux was used in a number of supercomputers including MareNostrum 2004 and Roadrunner 2008.
Beginning in April 2012, IBM introduced three POWER7 processor-based Linux-specific systems for big data analytics, industry applications and open-source infrastructure services such as Web-serving, email and social media collaboration services.
The IBM PowerLinux 7R1 and IBM PowerLinux 7R2 systems are one- and two-socket, rack-mount servers that support either 8 or 16 POWER7 microprocessor cores in 3.55 GHz (7R1 only) or, with the 7R2, 3.55 and 3.3 GHz options with 128 GB maximum memory (for the 7R1) or 256 GB maximum memory (7R2) that can be configured with 8, 16 and 32 GB dual inline memory modules (DIMMs). Both systems run Linux operating systems: Red Hat Enterprise Linux or SUSE Linux Enterprise Server and include a built-in PowerVM [for PowerLinux] hypervisor that supports up to 10 VMs per core and 160 VMs per server.
The IBM PowerLinux 7R4 is a POWER7+ processor-based system in a 5U package with two or four sockets and 16 or 32 cores. It can accommodate up to 1 TB of 1066 MHz DDR3
Active Memory Sharing. PowerVM for Linux dynamically adjusts system resources to partitions based on worklo |
https://en.wikipedia.org/wiki/Line%20clipping | In computer graphics, line clipping is the process of removing (clipping) lines or portions of lines outside an area of interest (a viewport or view volume). Typically, any part of a line which is outside of the viewing area is removed.
There are two common algorithms for line clipping: Cohen–Sutherland and Liang–Barsky.
A line-clipping method consists of various parts. Tests are conducted on a given line segment to find out whether it lies outside the view area or volume. Then, intersection calculations are carried out with one or more clipping boundaries. Determining which portion of the line is inside or outside of the clipping volume is done by processing the endpoints of the line with regards to the intersection.
Cohen–Sutherland
In computer graphics, the Cohen–Sutherland algorithm (named after Danny Cohen and Ivan Sutherland) is a line-clipping algorithm. The algorithm divides a 2D space into 9 regions, of which only the middle part (viewport) is visible.
In 1967, flight-simulation work by Danny Cohen led to the development of the Cohen–Sutherland computer graphics two- and three-dimensional line clipping algorithms, created with Ivan Sutherland.
Liang–Barsky
The Liang–Barsky algorithm uses the parametric equation of a line and inequalities describing the range of the clipping box to determine the intersections between the line and the clipping box. With these intersections it knows which portion of the line should be drawn. This algorithm is significantly more efficient than Cohen–Sutherland, but Cohen–Sutherland does trivial accepts and rejects much faster, so it should be considered instead if most of the lines you need to clip would be completely in or out of the clip window.
Cyrus–Beck
Very similar to Liang–Barsky line-clipping algorithm. The difference is that Liang–Barsky is a simplified Cyrus–Beck variation that was optimized for a rectangular clip window.
The Cyrus–Beck algorithm is primarily intended for a clipping a line in the parametric form against a convex polygon in 2 dimensions or against a convex polyhedron in 3 dimensions.
Nicholl–Lee–Nicholl
The Nicholl–Lee–Nicholl algorithm is a fast line-clipping algorithm that reduces the chances of clipping a single line segment multiple times, as may happen in the Cohen–Sutherland algorithm. The clipping window is divided into a number of different areas, depending on the position of the initial point of the line to be clipped.
Fast clipping
This algorithm has similarities with Cohen–Sutherland. The start and end positions are classified by which portion of the 9-area grid they occupy. A large switch statement jumps to a specialized handler for that case. In contrast, Cohen–Sutherland may have to iterate several times to handle the same case.
O(lg N) algorithm
This algorithm classifies vertices against the given line in the implicit form p: ax + by + c = 0. As the polygon is assumed to be convex and vertices are ordered clockwise or anti-clockwise, binary search can |
https://en.wikipedia.org/wiki/A%20Milhouse%20Divided | "A Milhouse Divided" is the sixth episode of the eighth season of the American animated television series The Simpsons. It originally aired on the Fox Network in the United States on December 1, 1996. In the episode, Milhouse's parents Kirk and Luann get a divorce, causing Homer to examine his own marriage. It was directed by Steven Dean Moore and is the only episode for which Steve Tompkins has sole writing credit.
Plot
Marge invites the Flanders, the Lovejoys, the Hibberts and the Van Houtens to a dinner party. While the other guests enjoy themselves, Kirk and Luann Van Houten bicker. They get more quarrelsome as the party continues, making the other guests uncomfortable. After a volatile game of Pictionary, Luann demands a divorce. Afterwards, Kirk moves into a singles complex and gets fired from his job at the cracker factory, as they feel he sets a bad example for the company with his recent breakup, not to mention the company is run by Luann's father. Luann, on the other hand, adjusts to life as a single parent with Milhouse and starts dating Chase, an American Gladiator.
At Moe's, Kirk reveals to Homer that he has decided to pursue a singing career and introduces him to his new "girlfriend" Starla, who soon steals his car and tosses his demo tape onto the street. Kirk muses that he never saw the divorce coming and regrets being a bad husband, remarking that "one day your wife is making you your favorite meal, the next day you're thawing a hot dog in a gas station sink". Homer tries to console him and boasts that his marriage to Marge is rock-solid. At home, however, Homer discovers that Marge has gone out and left him hot dogs for dinner, and becomes terrified that Marge is going to leave him.
Homer enlists Lisa's help to save his marriage, but she is unable to offer any advice beyond observing that he is lucky to have Marge as his wife. He recalls their no-frills wedding, followed by a cheesy wedding cake at a roadside truck stop. To save their marriage, Homer attempts to perform "selfless" gestures for Marge such as giving her a new haircut and making soothing noises as she sleeps, which only annoy her.
Deciding that Marge deserves a fresh start, Homer secretly files for a divorce. Marge returns home that night and is surprised to find all of the Simpsons' friends gathered in the living room. Homer declares that he wants to be remarried, with a perfect wedding this time. Reverend Lovejoy reads the rambling wedding vows Homer has written himself, and Marge and Homer are remarried. Later at the party, Kirk tries to reconcile with Luann by singing her a corny love song from his demo tape. Though Luann appears touched at first, she rebuffs Kirk instantly when he asks her to remarry, after which Chase kicks him out of the house.
Production
"A Milhouse Divided" is the only episode for which Steve Tompkins has sole writing credit, although he had been a part of the writing staff for several years. The writers wanted to do an episode that i |
https://en.wikipedia.org/wiki/Lava%20%28programming%20language%29 | Lava is an experimental, visual object-oriented, interpreter-based programming language with an associated programming environment (Lava Programming Environment or LavaPE) that uses structure editors instead of text editors. Only comments, constants, and new identifiers may be entered as text.
Declarations are represented in LavaPE as tree structures whose subtrees may be collapsed or expanded. The properties of the declared Lava entities can be edited through pop-up dialogs.
Although executable code has a traditional text representation in LavaPE, it can be edited only as complete syntactic units, rather than character by character. If you insert a new syntactic construct, it will typically contain "placeholders" (syntactic variables) that can then be replaced by concrete constructs; the latter may in turn contain syntactic variables, etc. LavaPE provides a tool button for every type of syntactic construct, and a button is enabled only if it is syntactically correct to insert the associated construct at the selected place.
Further characteristic properties of Lava and LavaPE include the following:
It provides strict syntactic separation of interface (public) and implementation (private) sections of a Lava class.
It distinguishes variable "state objects" from constant "value objects"; the latter cannot be modified any longer after creation/initialization.
It supports "virtual types": type parameters of classes and packages (families of related classes). As a consequence, undermining of strong type checks by "type casts" is no longer required.
It uses recursion and logical quantifiers instead of traditional loop constructs.
It uses single assignment; i.e., a value can be assigned to a variable only once within the same branch of a function.
It supports refactoring extensively via the LavaPE structure editors.
It distinguishes between constituents (sub-objects) and object acquaintances (pointers to independent objects). Copying and deletion of complex objects is largely facilitated in this way.
Since release 0.9.0, LavaPE completely prevents inadvertent access to uninitialized variables and null objects already at programming time by complete static initialization checks.
Lava is open source software using the GPL license (see also Lava at the Free Software Foundation and at KDE-Apps.org). It currently runs on Microsoft Windows, Linux and Mac OS X platforms.
References
Sources
Lava: Bausteinbasiertes Programmieren mit Struktureditoren (German, Article in OBJEKTspektrum 1/2002)
External links
Class-based programming languages
Experimental programming languages
Free integrated development environments
Linux integrated development environments
Visual programming languages |
https://en.wikipedia.org/wiki/Lanczos%20approximation | In mathematics, the Lanczos approximation is a method for computing the gamma function numerically, published by Cornelius Lanczos in 1964. It is a practical alternative to the more popular Stirling's approximation for calculating the gamma function with fixed precision.
Introduction
The Lanczos approximation consists of the formula
for the gamma function, with
Here g is a real constant that may be chosen arbitrarily subject to the restriction that Re(z+g+) > 0. The coefficients p, which depend on g, are slightly more difficult to calculate (see below). Although the formula as stated here is only valid for arguments in the right complex half-plane, it can be extended to the entire complex plane by the reflection formula,
The series A is convergent, and may be truncated to obtain an approximation with the desired precision. By choosing an appropriate g (typically a small integer), only some 5–10 terms of the series are needed to compute the gamma function with typical single or double floating-point precision. If a fixed g is chosen, the coefficients can be calculated in advance and, thanks to partial fraction decomposition, the sum is recast into the following form:
Thus computing the gamma function becomes a matter of evaluating only a small number of elementary functions and multiplying by stored constants. The Lanczos approximation was popularized by Numerical Recipes, according to which computing the gamma function becomes "not much more difficult than other built-in functions that we take for granted, such as sin x or ex." The method is also implemented in the GNU Scientific Library, Boost, CPython and musl.
Coefficients
The coefficients are given by
where represents the (n, m)th element of the matrix of coefficients for the Chebyshev polynomials, which can be calculated recursively from these identities:
Godfrey (2001) describes how to obtain the coefficients and also the value of the truncated series A as a matrix product.
Derivation
Lanczos derived the formula from Leonhard Euler's integral
performing a sequence of basic manipulations to obtain
and deriving a series for the integral.
Simple implementation
The following implementation in the Python programming language works for complex arguments and typically gives 13 correct decimal places.
Note that omitting the smallest coefficients (in pursuit of speed, for example) gives totally inaccurate results; the coefficients must be recomputed from scratch for an expansion with fewer terms.
from cmath import sin, sqrt, pi, exp
"""
The coefficients used in the code are for when g = 7 and n = 9
Here are some other samples
g = 5
n = 5
p = [
1.0000018972739440364,
76.180082222642137322,
-86.505092037054859197,
24.012898581922685900,
-1.2296028490285820771
]
g = 5
n = 7
p = [
1.0000000001900148240,
76.180091729471463483,
-86.505320329416767652,
24.014098240830910490,
-1.2317395724501553875,
0.0012086509738661785061,
-5.39523938495312 |
https://en.wikipedia.org/wiki/Partition%20%28database%29 | A partition is a division of a logical database or its constituent elements into distinct independent parts. Database partitioning is normally done for manageability, performance or availability reasons, or for load balancing. It is popular in distributed database management systems, where each partition may be spread over multiple nodes, with users at the node performing local transactions on the partition. This increases performance for sites that have regular transactions involving certain views of data, whilst maintaining availability and security.
Partitioning criteria
Current high-end relational database management systems provide for different criteria to split the database. They take a partitioning key and assign a partition based on certain criteria. Some common criteria include:
Range partitioning: selects a partition by determining if the partitioning key is within a certain range. An example could be a partition for all rows where the "zipcode" column has a value between 70000 and 79999. It distributes tuples based on the value intervals (ranges) of some attribute. In addition to supporting exact-match queries (as in hashing), it is well-suited for range queries. For instance, a query with a predicate “A between A1 and A2” may be processed by the only node(s) containing tuples.
List partitioning: a partition is assigned a list of values. If the partitioning key has one of these values, the partition is chosen. For example, all rows where the column Country is either Iceland, Norway, Sweden, Finland or Denmark could build a partition for the Nordic countries.
Composite partitioning: allows for certain combinations of the above partitioning schemes, by for example first applying a range partitioning and then a hash partitioning. Consistent hashing could be considered a composite of hash and list partitioning where the hash reduces the key space to a size that can be listed.
Round-robin partitioning: the simplest strategy, it ensures uniform data distribution. With n partitions, the ith tuple in insertion order is assigned to partition (i mod n). This strategy enables the sequential access to a relation to be done in parallel. However, the direct access to individual tuples, based on a predicate, requires accessing the entire relation.
Hash partitioning: applies a hash function to some attribute that yields the partition number. This strategy allows exact-match queries on the selection attribute to be processed by exactly one node and all other queries to be processed by all the nodes in parallel.
Partitioning methods
The partitioning can be done by either building separate smaller databases (each with its own tables, indices, and transaction logs), or by splitting selected elements, for example just one table.
Horizontal partitioning
Horizontal partitioning involves putting different rows into different tables. For example, customers with ZIP codes less than 50000 are stored in CustomersEast, while customers with ZIP codes gr |
https://en.wikipedia.org/wiki/Jes%C3%BAs%20Villasante | Jesús Villasante is the head Net Innovation Unit of the Communications Networks, Content and Technology (Connect) Directorate General in the European Commission.
He read Telecommunications Engineering at the Technical University of Madrid in Madrid, Spain and later obtained a master's degree in Public Management from the Université libre de Bruxelles in Brussels, Belgium.
See also
CNet news IT giants accused of exploiting open source
Jesús Villasante, Future Internet Assembly
References
Living people
Year of birth missing (living people)
Place of birth missing (living people) |
https://en.wikipedia.org/wiki/Microsoft%20Active%20Accessibility | Microsoft Active Accessibility (MSAA) is an application programming interface (API) for user interface accessibility. MSAA was introduced as a platform add-on to Microsoft Windows 95 in 1997. MSAA is designed to help Assistive Technology (AT) products interact with standard and custom user interface (UI) elements of an application (or the operating system), as well as to access, identify, and manipulate an application's UI elements. AT products work with MSAA enabled applications in order to provide better access for individuals who have physical or cognitive difficulties, impairments, or disabilities. Some examples of AT products are screen readers for users with limited sight, on screen keyboards for users with limited physical access, or narrators for users with limited hearing. MSAA can also be used for automated testing tools, and computer-based training applications.
The current and latest specification of MSAA is found in part of Microsoft UI Automation Community Promise Specification.
History
Active Accessibility was initially referred to as OLE Accessibility and this heritage is reflected in the naming of its binary components such as oleacc.dll and the header file oleacc.h which contains definitions and declarations. As part of Microsoft's ActiveX branding push in March 1996, OLE Accessibility was renamed ActiveX Accessibility (sometimes referred to as AXA) and presented as such at the Microsoft Professional Developers Conference in San Francisco, March 1996. Later, the ActiveX branding was reserved for internet-specific technologies, and ActiveX Accessibility became Active Accessibility and frequently shortened to MSAA.
MSAA was originally made available in April 1997 as part of the Microsoft Active Accessibility Software Developers Kit (SDK) version 1.0. The SDK packaged included documentation, programming libraries, sample source code, and a Re-Distributable Kit (RDK) for accessible technology vendors to include with their products. The RDK included updated operating system components for Microsoft Windows 95. Since Windows 98 and Windows NT 4.0 Service Pack 4, MSAA has been built-into all versions of the Windows platform, and has received periodic upgrades and patches over time.
Programmatic exposure for assistive technology applications on Windows has historically been provided through MSAA. However, newer applications are now using Microsoft UI Automation (UIA), which was introduced in Windows Vista and the .NET Framework 3.0.
Version history
The following Active Accessibility versions have been released:
Motivation and goals
The motivating factor behind the development of MSAA was to allow an available and seamless communication mechanism between the underlying operating system or applications and assistive technology products.
The programmatic goal of MSAA is to allow Windows controls to expose basic information, such as name, location on screen, or type of control, and state information such as visibility, enabled, or se |
https://en.wikipedia.org/wiki/KAZA-TV | KAZA-TV (channel 54) is a television station licensed to Avalon, California, United States, serving the Los Angeles area as an owned-and-operated station of the classic television network MeTV. It is owned by Weigel Broadcasting alongside Bishop-licensed KVME-TV (channel 20) and low-power Class A MeTV+ station KHTV-CD (channel 6), Ontario-licensed Catchy Comedy outlet KPOM-CD (channel 14), and Jewelry Television affiliate KSFV-CD (channel 27). KAZA-TV's studios are located on Grand Central Avenue in Glendale, and its transmitter is located at the Mount Harvard Radio Site in the San Gabriel Mountains. KAZA-TV's primary channel is separate from the MeTV feed on the third digital subchannel of Anaheim-licensed KDOC-TV (channel 56), a Tri-State Christian Television (TCT) owned-and-operated station.
Even though KAZA-TV is licensed as a full-power station, its broadcasting radius does not reach all of Greater Los Angeles as it shares spectrum with KHTV-CD. Therefore, the station relies on cable and satellite carriage to reach the entire market.
History
The station first signed on the air on July 9, 2001, originally operating as an independent station, carrying a format of Spanish-language music videos temporarily until the launch of Azteca América on July 28. The station was founded by Visalia-based Pappas Telecasting (which initially held a 75% majority stake in the station, which expanded to 80% in 2014) and TV Azteca (which owned the remaining interest).
On November 30, 2006, NBC Universal (owner of rival KVEA, channel 52 and then-owner of KWHY, channel 22) filed a petition with the Federal Communications Commission (FCC) to deny KAZA's license renewal, on basis that TV Azteca controlled 51.6% of the station (above the FCC-designated 33% interest limit for foreign owned broadcasters) via loans and other interests. According to the Los Angeles Times, it is believed to be the first challenge to a license renewal sent to the FCC since 1979 (notwithstanding the two-decade long RKO General license challenges including KHJ-TV that were not fully sorted until the late 1980s).
According to the filing, NBC Universal accused TV Azteca of attempting to undermine its operations in Mexico. One example cited is the shutdown of production of the Telemundo program Quinceañera. NBC Universal accused TV Azteca of hiring undercover police officers to enforce the shutdown; the show's production was moved to Miami as a result. Two days later, Azteca chairman, Luis Echarte, insisted that the local marketing agreement is legitimate and called NBC Universal's allegations "ridiculous", citing that: "It's obviously a ploy to damage our image, given our strong performance in the U.S.," he says. "KAZA is owned by Pappas. We’ve been paying rent to Pappas to operate the station for three years."
On September 8, 2017, Pappas Telecasting and TV Azteca announced they would sell KAZA to Chicago-based Weigel Broadcasting for $9 million. On January 1, 2018, KJLA (channel 57) re |
https://en.wikipedia.org/wiki/The%20Parent%20Rap | "The Parent Rap" is the second episode and official premiere of the thirteenth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on November 11, 2001. In the episode, Bart and his father, Homer, are sentenced by the cruel judge Constance Harm to be tethered to each other as a result of Bart stealing Police Chief Wiggum's car. Eventually, Homer's wife, Marge, is fed up with the punishment and cuts the rope, which instead leads to Judge Harm sentencing them to have their heads and hands locked up in wooden stocks.
The episode was written by George Meyer and Mike Scully, who also served as the show runner for the episode, and Mark Kirkland worked as the director. The writers based the story on “a couple of incidents” in real life in which troublesome children, through alternative sentencing, were tethered to their parents. The episode marks the first appearance of the infamous and notoriously cruel Judge Constance Harm, who is voiced by actress Jane Kaczmarek.
When it was first broadcast, “The Parent Rap” was watched by 14.4 million viewers, making it the second most watched show of its timeslot that night. After its release on DVD and Blu-ray, however, the episode garnered mixed reviews from critics.
Plot
After missing the bus, Bart and Milhouse are given a ride to school by Homer, but are evicted from the car after Homer spots the opportunity to win a competition by local radio station KBBL (the prizes being $40 and a Blue Öyster Cult medallion). Being forced to walk to school, they get into trouble and are arrested for stealing Chief Wiggum's squad car. Milhouse gets off but when Bart comes to the bench, Judge Constance Harm (voiced by Jane Kaczmarek) takes over and lays down the law while Judge Snyder is on his fishing trip. She holds Homer responsible for Bart's deeds and sentences him and Bart to be tethered together. Initially, this brings Bart and Homer closer together, despite Homer disrupting Bart's education and later getting cut up by glass during a baseball game. However, things soon go wrong, such as Bart being left outside in the cold while Homer drinks at Moe's, and again when Marge and Homer try to have sex when Bart does his homework, leading father and son to fight one another. Fed up with the punishment, Marge then finally cuts the tether, only for her and Homer to be brought back before Harm and have their heads and hands locked up in old-fashioned wooden pillories, as well as being slapped on the buttocks from passing cars.
Unable to bear the punishment any longer, they break free using Ned Flanders's power tools and decide to get back at the judge by hanging an insulting banner from her houseboat. The plan goes awry when they are cornered by Harm's guard seal Poncho and accidentally sink the boat, being once again brought into court. When Bart pleads to take full responsibility for his parents' actions, Harm agrees and almost sentences Bart to five y |
https://en.wikipedia.org/wiki/Half-Decent%20Proposal | "Half-Decent Proposal" is the tenth episode of the thirteenth season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on February 10, 2002. In the episode, Homer's snoring interferes with Marge's sleep. To earn money to cure Homer's snoring, Marge agrees to spend a weekend with Artie Ziff if he vows to not grope her as he did during their high-school prom date ("The Way We Was"). While spying on Marge and Artie, Homer mistakenly thinks they are making out, so he leaves with Lenny to work on an oil rig.
Although the episode was written by Tim Long, the idea for the episode was pitched by series' co-creator and executive producer James L. Brooks. The episode was directed by Lauren MacMullan, who ordered several complicated sequences from the animators, leading to some tensions among The Simpsons staff. The episode's plot and title is based on the 1993 film Indecent Proposal, and the episode also features references to M*A*S*H, Midnight Cowboy and Five Easy Pieces. The episode features Jon Lovitz as Artie Ziff, the first time he portrayed Ziff since the season 2 episode "The Way We Was".
In its original broadcast, the episode was seen by approximately 7.5 million viewers and finished in 36th place in the ratings the week it aired.
Since its original broadcast, "Half-Decent Proposal" has received mostly positive reviews from critics, some of whom considered it among the best episodes of the season. However, the episode has also been criticized for parodying Indecent Proposal nine years after its release, a criticism that the episode's showrunner Al Jean responded to in the episode's DVD commentary.
Plot
Marge grows irritated when Homer's loud snoring keeps her awake at night. Dr. Hibbert recommends an expensive surgery to correct the problem, but balks when Homer asks him to do it for free. While spending the night with Patty and Selma to get some sleep, Marge hears a news report that her old high school boyfriend, Artie Ziff, is now the fifth-richest man in the United States. She drunkenly dictates an e-mail to Artie to congratulate him on his success, but Patty and Selma turn it into a sexually provocative message, to Marge's horror.
Artie, who has been deeply obsessed with Marge since high school, flies to Springfield and makes the Simpsons an offer: $1 million to spend a weekend with Marge to show her what life would be like if they were married. Eventually Marge accepts the offer to cure Homer's snoring. At first she enjoys Artie's company, but during a re-enactment of their high school prom, he tricks her into making out against her will. While trying to sneak into the prom, Homer sees them kissing and is devastated, not knowing the exact circumstances. A furious Marge leaves Artie and returns home to find Homer gone and a taped message saying he has left Springfield with Lenny — similarly despondent over his relationship with Carl—to work at an oil field.
While working on an |
https://en.wikipedia.org/wiki/Air%20interface | The air interface, or access mode, is the communication link between the two stations in mobile or wireless communication. The air interface involves both the physical and data link layers (layer 1 and 2) of the OSI model for a connection.
Physical Layer
The physical connection of an air interface is generally radio-based. This is usually a point to point link between an active base station and a mobile station. Technologies like Opportunity-Driven Multiple Access (ODMA) may have flexibility regarding which devices serve in which roles. Some types of wireless connections possess the ability to broadcast or multicast.
Multiple links can be created in limited spectrum through FDMA, TDMA, or SDMA. Some advanced forms of transmission multiplexing combine frequency- and time-division approaches like OFDM or CDMA. In cellular telephone communications, the air interface is the radio-frequency portion of the circuit between the cellular phone set or wireless modem (usually portable or mobile) and the active base station. As a subscriber moves from one cell to another in the system, the active base station changes periodically. Each changeover is known as a handoff.
In radio and electronics, an antenna (plural antennae or antennas), or aerial, is an electrical device which converts electric power into radio waves, and vice versa. It is usually used with a radio transmitter or radio receiver. In transmission, a radio transmitter supplies an electric current oscillating at radio frequency to the antenna's terminals, and the antenna radiates the energy from the current as electromagnetic waves (radio waves). An antenna focuses the radio waves in a certain direction. Usually, this is called the main direction. Because of that, in other directions less energy will be emitted. The gain of an antenna, in a given direction, is usually referenced to an (hypothetical) isotropic antenna, which emits the radiation evenly strong in all directions. The antenna gain is the power in the strongest direction divided by the power that would be transmitted by an isotropic antenna emitting the same total power. In this case the antenna gain (Gi) is often specified in dBi, or decibels over isotropic.
Other reference antennas are also used, especially: •gain relative to a half-wave dipole (Gd), when the reference antenna is a half-wave dipole antenna;
•gain relative to a short vertical antenna (Gv), when the reference antenna is a linear conductor, much shorter than one quarter of the wavelength.
Data Link Layer
The data link layer in an air interface is often divided farther than the simple Media access control (MAC) and Logical link control (LLC) sublayers found in other OSI terminology. While the MAC sublayer is generally unmodified, the LLC sublayer is subdivided into two or more additional sublayers depending on the standard. Common sublayers include:
Radio Link Control
Packet Data Convergence Protocol
Radio Resource Control
Especially in mobile telecommunication |
https://en.wikipedia.org/wiki/Nukernel | NuKernel is a microkernel which was developed at Apple Computer during the early 1990s. Written from scratch and designed using concepts from the Mach 3.0 microkernel, with extensive additions for soft real-time scheduling to improve multimedia performance, it was the basis for the Copland operating system. Only one NuKernel version was released, with a Copland alpha release. Development ended in 1996 with the cancellation of Copland.
The External Reference Specification (ERS) for NuKernel is contained in its entirety in its patent.
The one-time technical lead for NuKernel, Jeff Robbin, was one of the leaders of iTunes and the iPod.
Apple's NuKernel is not the microkernel in BeOS, nukernel.
See also
XNU, the microkernel in Mac OS X
References
Apple Inc. operating systems
Microkernels |
https://en.wikipedia.org/wiki/Hash%20join | The hash join is an example of a join algorithm and is used in the implementation of a relational database management system. All variants of hash join algorithms involve building hash tables from the tuples of one or both of the joined relations, and subsequently probing those tables so that only tuples with the same hash code need to be compared for equality in equijoins.
Hash joins are typically more efficient than nested loops joins, except when the probe side of the join is very small. They require an equijoin predicate (a predicate comparing records from one table with those from the other table using a conjunction of equality operators '=' on one or more columns).
Classic hash join
The classic hash join algorithm for an inner join of two relations proceeds as follows:
First, prepare a hash table using the contents of one relation, ideally whichever one is smaller after applying local predicates. This relation is called the build side of the join. The hash table entries are mappings from the value of the (composite) join attribute to the remaining attributes of that row (whichever ones are needed).
Once the hash table is built, scan the other relation (the probe side). For each row of the probe relation, find the relevant rows from the build relation by looking in the hash table.
The first phase is usually called the "build" phase, while the second is called the "probe" phase. Similarly, the join relation on which the hash table is built is called the "build" input, whereas the other input is called the "probe" input.
This algorithm is simple, but it requires that the smaller join relation fits into memory, which is sometimes not the case. A simple approach to handling this situation proceeds as follows:
For each tuple in the build input
Add to the in-memory hash table
If the size of the hash table equals the maximum in-memory size:
Scan the probe input , and add matching join tuples to the output relation
Reset the hash table, and continue scanning the build input
Do a final scan of the probe input and add the resulting join tuples to the output relation
This is essentially the same as the block nested loop join algorithm. This algorithm scans eventually more times than necessary.
Grace hash join
A better approach is known as the "grace hash join", after the GRACE database machine for which it was first implemented.
This algorithm avoids rescanning the entire relation by first partitioning both and via a hash function, and writing these partitions out to disk. The algorithm then loads pairs of partitions into memory, builds a hash table for the smaller partitioned relation, and probes the other relation for matches with the current hash table. Because the partitions were formed by hashing on the join key, it must be the case that any join output tuples must belong to the same partition.
It is possible that one or more of the partitions still does not fit into the available memory, in which case the algorithm is r |
https://en.wikipedia.org/wiki/Ring%203 | Ring 3 may refer to:
Ring III, a road in Helsinki region, Finland
Ring 3 (Oslo), a road Norway
Ring 3 (computer security)
See also
Three-ring (disambiguation)
Third Ring Road (disambiguation)
Ring Ring Ring (disambiguation)
Ring (disambiguation)
Loop (novel), the third Ring novel
Rings (2017 film), third film in the American-remake Ring film series
Ring 0: Birthday, third film in the Japanese Ring film series |
https://en.wikipedia.org/wiki/Skool%20Daze | Skool Daze is a computer game released by Microsphere in 1984 for the ZX Spectrum and Commodore 64 home computers. It was written by David Reidy, with graphics designed by Keith Warrington. The game was commercially and critically successful, and praised for its original concept. It has since been regarded as one of the pioneers of the sandbox game genre.
Gameplay
The game features the player as a schoolboy named Eric, with the objective of stealing his report card out of the staff room safe by accomplishing various tasks around the school. The computer controls all the other characters in the game, including the headmaster, other teachers and other pupils.
The four teachers are Mr Wacker (the headmaster), Mr Rockitt (the science teacher), Mr Withit (the geography teacher) and Mr Creak (the history master). Other than Eric, three of the pupils are named: Boy Wander (the tearaway), Angelface (the bully) and Einstein (the swot). The player has the option of renaming the characters before the game begins. There are also many unnamed, undistinguished pupils at the school.
If Eric is caught out of class or otherwise misbehaving, teacher characters pursue him and issue lines. When 10,000 lines or more are accumulated, the game ends with Eric's expulsion. However, Eric can also receive lines for things that are not his fault, such as lying or sitting on the floor when in fact he has been knocked down, or being nearest a teacher who has just been hit by a projectile fired by one of the other pupils. So part of the challenge of the game is to prevent other pupils from getting Eric into trouble.
Background
Helen Reidy had a background in teaching, while David had fonder memories of activities between lessons and designed the game around this. The characters were based on schoolboy characters he read about as a child, including Just William and The Beano's The Bash Street Kids. He later clarified that "each of the rooms would look like a frame in a comic".
David Reidy considered himself to be more proficient as a programmer and engineer, and decided the game's graphics would benefit from a separate designer. He recruited a family friend, Keith Warrington, who was studying graphic design. Warrington learned the rudiments of computer graphics from David, and drew the characters as line drawings on squared paper. From this, he blocked in the individual pixels to create an appropriate sprite, with tracing paper to design the individual animation frames for each character. He later obtained a Spectrum to assist with the design, but found using graph paper easier. Warrington based the teachers on ones that had taught him at school, and later said the geography teacher, Mr Withit, was based on "my all time favourite teacher". He found the screen resolution limitations helpful, as it forced him to design cartoon-like characters, saying "you couldn't do a normal person because they would have all looked the same". As with other Microsphere games, David des |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.