source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Google | Google LLC () is an American multinational technology company focusing on artificial intelligence, online advertising, search engine technology, cloud computing, computer software, quantum computing, e-commerce, and consumer electronics. It has been referred to as "the most powerful company in the world" and as one of the world's most valuable brands due to its market dominance, data collection, and technological advantages in the field of artificial intelligence. Alongside Amazon, Apple Inc., Meta Platforms, and Microsoft, Google's parent company Alphabet Inc. is one of the five Big Tech companies.
Google was founded on September 4, 1998, by American computer scientists Larry Page and Sergey Brin while they were PhD students at Stanford University in California. Together they own about 14% of its publicly listed shares and control 56% of its stockholder voting power through super-voting stock. The company went public via an initial public offering (IPO) in 2004. In 2015, Google was reorganized as a wholly owned subsidiary of Alphabet Inc. Google is Alphabet's largest subsidiary and is a holding company for Alphabet's internet properties and interests. Sundar Pichai was appointed CEO of Google on October 24, 2015, replacing Larry Page, who became the CEO of Alphabet. On December 3, 2019, Pichai also became the CEO of Alphabet.
The company has since rapidly grown to offer a multitude of products and services beyond Google Search, many of which hold dominant market positions. These products address a wide range of use cases, including email (Gmail), navigation (Waze & Maps), cloud computing (Cloud), web browsing (Chrome), video sharing (YouTube), productivity (Workspace), operating systems (Android), cloud storage (Drive), language translation (Translate), photo storage (Photos), video calling (Meet), smart home (Nest), smartphones (Pixel), wearable technology (Pixel Watch & Fitbit), music streaming (YouTube Music), video on demand (YouTube TV), artificial intelligence (Google Assistant), machine learning APIs (TensorFlow), AI chips (TPU), and more. Discontinued Google products include gaming (Stadia), Glass, Google+, Reader, Play Music, Nexus, Hangouts, and Inbox by Gmail.
Google's other ventures outside of Internet services and consumer electronics include quantum computing (Sycamore), self-driving cars (Waymo, formerly the Google Self-Driving Car Project), smart cities (Sidewalk Labs), and transformer models (Google Deepmind).
Google and YouTube are the two most visited websites worldwide followed by Facebook and X. Google is also the largest search engine, mapping and navigation application, email provider, office suite, video sharing platform, photo and cloud storage provider, mobile operating system, web browser, ML framework, and AI virtual assistant provider in the world as measured by market share. On the list of most valuable brands, Google is ranked second by Forbes and fourth by Interbrand. It has received significant criticism invo |
https://en.wikipedia.org/wiki/Nastygram | The term nastygram may refer to:
A cease and desist letter, often one received from a copyright holder
A Christmas tree packet (networking)
A demand letter used to collect a debt or penalties due to a breach of contract |
https://en.wikipedia.org/wiki/Database%20theory | Database theory encapsulates a broad range of topics related to the study and research of the theoretical realm of databases and database management systems.
Theoretical aspects of data management include, among other areas, the foundations of query languages, computational complexity and expressive power of queries, finite model theory, database design theory, dependency theory, foundations of concurrency control and database recovery, deductive databases, temporal and spatial databases, real-time databases, managing uncertain data and probabilistic databases, and Web data.
Most research work has traditionally been based on the relational model, since this model is usually considered the simplest and most foundational model of interest. Corresponding results for other data models, such as object-oriented or semi-structured models, or, more recently, graph data models and XML, are often derivable from those for the relational model.
Database theory helps one to understand the complexity and power of query languages and their connection to logic. Starting from relational algebra and first-order logic (which are equivalent by Codd's theorem) and the insight that important queries such as graph reachability are not expressible in this language, more powerful language based on logic programming and fixpoint logic such as datalog were studied. The theory also explores foundations of query optimization and data integration. Here most work studied conjunctive queries, which admit query optimization even under constraints using the chase algorithm.
The main research conferences in the area are the ACM Symposium on Principles of Database Systems (PODS) and the International Conference on Database Theory (ICDT).
See also
Data integration
Conjunctive query
Expressive power
References
General references
David Maier, The Theory of Relational Databases. Copyright 1983 David Maier. Available at http://web.cecs.pdx.edu/~maier/TheoryBook/TRD.html
External links
Theory |
https://en.wikipedia.org/wiki/Niko%20Nirvi | Niko Nirvi (born 16 February 1961 in Jokioinen, Finland), pen name Nnirvi, is a long-term major icon in the Finnish gaming world. He is well known for writing computer game reviews since the 1980s in MikroBitti, C=Lehti and the computer game yearbooks that were predecessors of the Pelit magazine. He has worked for the latter since its founding in 1992, and holds a column in addition to making reviews and other reports.
Nirvi began his career as a game reviewer in 1986 on pages of MikroBitti. He had made a bet with his friend that he could get his review published in the magazine. He sent two reviews, Zoids and Uridium and the former was published (they already had one Uridium review). Nirvi wrote reviews and a regular column about new games for Mikrobitti and became the "game editor" of the magazine. He also wrote reviews for C=Lehti. When Pelit, that concentrated solely on gaming, was founded by the same publisher, Nirvi joined its ranks as an editor, and has written a regular column for each issue.
Nirvi's trademarks include signing with "Nnirvi" or a variation, and never showing his face in the magazine. Photos of him are always either covered or edited in a way that the face is unrecognizable. His personal picture in his articles is usually a gaming or movie character whose face is blurred (for example Master Chief) while the rest of the crew's articles feature their real faces. Wallu's drawings of Nirvi depict him as a bearded man with Spock's Vulcan ears. According to Nirvi, his avoidance of publicity started in 1988, when a MikroBitti reader asked for a photograph of him, which Nirvi instantly declined, and this avoidance has strengthened ever since. "I replied no, and then it started feeling like a good idea. Everyone can imagine what I look like on their own", Nirvi said in an interview in Suomen Kuvalehti in 2021. Nirvi does not even allow verbal descriptions of his appearance. However, he has sometimes been described as "a large, dark-haired man" and his colleague Jukka O. Kauppinen has described him as "hairy".
In 2012, Nirvi was awarded as Game Journalist of the Year at the FIGMA audience awards. Avoiding any publicity, Nirvi did not arrive to collect his award.
Nirvi's style is typically humorous and sometimes unorthodox. Some of Nirvi's most unconventional reviews were published in C=Lehti. The review of Domark's motorboat game Hydra was written as a nursery rhyme from the beginning to the end. The review of Battle Island contained just two words: "Paska Commando-klooni." ("shitty Commando clone.")
Personal opinions
Nirvi has made it clear that he does not like sports or sports related video games. He has been a big fan of Babylon 5, Star Wars and Star Trek. He has also stated that he has read The Lord of the Rings over ten times.
Nirvi has given several statements about the usefulness of computer gaming. At one interview he said that gaming is a completely useless hobby. On the first issue of Pelit (1992) he wrote that gamin |
https://en.wikipedia.org/wiki/WUVG-DT | WUVG-DT (channel 34) is a television station licensed to Athens, Georgia, United States, broadcasting the Spanish-language Univision and UniMás networks to the Atlanta area. Owned and operated by TelevisaUnivision, the station maintains studios on Peachtree Road NE in the Buckhead section of Atlanta, and a transmitter in North Druid Hills. Despite Athens being WUVG-DT's city of license, the station maintains no physical presence there.
WUVG-DT was established as WNGM-TV, a station serving the Athens area, in 1989. Its focus broadened to Atlanta in the 1990s as the station was sold several times, airing home shopping, music videos, and then an independent format. It switched to Univision in January 2002, making it the first Spanish-language station in the market.
History
WNGM-TV
The station went on air on April 18, 1989, as WNGM-TV, with the call sign standing for "North Georgia Mountains". Initially the station ran a general entertainment format with cartoons, classic and recent sitcoms, blocks of country music programming, old movies and syndicated first-run shows; it also aired a local newscast and magazine program focusing on north Georgia.
WNGM-TV was owned by a company including the final two applicants for the channel: Georgia Mountain Corporation and Sunbelt Television, Inc., which merged their bids in 1985 and won the construction permit. Its transmitter was located away from Atlanta, reaching Athens with a grade A signal while sending a very weak signal into eastern metro Atlanta. As a result, many syndicators sold the rights for shows that were already on the Atlanta stations to WNGM. The station provided an alternative to viewers in areas which had moderate VHF reception and poor UHF reception from Atlanta; Clarke County had a cable penetration rate of 83 percent, 30 points above the national average.
NGM Television Partners, the licensee, sold the station for $10 million in 1996 to Whitehead Media, which the next year formalized a time brokerage agreement under which Paxson Communications Corporation began operating channel 34. However, Paxson opted the next year to divest itself of extra stations in markets where it controlled more than one, such as Atlanta, where it owned WPXA-TV. The $73.5 million sale by Paxson of the operating rights and by Whitehead of the licenses for WNGM-TV and WOAC in Canton, Ohio, to Global Broadcasting Systems, Inc., was terminated a month later when the buyer failed to post an escrow deposit.
From 1996 until September 1, 1997, WNGM-TV aired Paxson's Infomall TV infomercial network, then switching to separate but similar home shopping programming, which was an issue at play in a major cable carriage dispute with MediaOne over whether it had to be placed on a series of major Atlanta cable systems.
"Hotlanta 34"
In 1998, USA Broadcasting acquired WNGM for $50 million. It was part of a larger deal between Paxson and USA that allowed Paxson-owned stations in New Orleans and Memphis to make early exits |
https://en.wikipedia.org/wiki/WPXA-TV | WPXA-TV (channel 14) is a television station licensed to Rome, Georgia, United States, broadcasting the Ion Television network to the Atlanta area. The station is owned and operated by the Ion Media subsidiary of the E. W. Scripps Company, and maintains offices on North Cobb Parkway (US 41) in Marietta; its transmitter is located on Bear Mountain, near the Cherokee–Bartow county line. Despite Rome being WPXA-TV's city of license, the station maintains no physical presence there.
The station's broadcast range extends into parts of Alabama and Chattanooga, Tennessee and even the southwest corner of North Carolina. However, terrain shielding not accounted for in radio propagation models prevents this from regularly occurring, due to the north Georgia mountains.
History
The station was issued a construction permit in 1984 on Channel 14 as WZGA, but never made it to air. The station went on-air February 29, 1988 as WAWA, with studios on Shorter Avenue in Rome and transmitter on nearby Mount Alto. The station was owned by Sudbrink Broadcasting of West Palm Beach, Florida, and had a general entertainment format of low-budget shows, public domain movies, and local newscasts. It also aired several ABC, CBS and NBC shows that WSB-TV (channel 2), WAGA-TV (channel 5) and WXIA-TV (channel 11) turned down.
In 1990, the station changed its calls to WTLK-TV and moved its studios to Marietta and transmitter to Bear Mountain (west of Canton). Rebranding as "Talk TV", it featured national talk shows like Phil Donahue and Sally Jessy Raphael. It also aired local shows (with TV studio audiences) with WSB's Neal Boortz, former Miss America Suzette Charles, Hosea Williams, Michael Young, WVEE's Mike Roberts, WGST's Brian Wilson and others, while also continuing to air some preempted network programs. However, the station never took off in metro Atlanta during the days before the must-carry rules for cable systems. The other independent on the fringe of the market, Athens-licensed WNGM-TV (channel 34, now WUVG), had the same problem. Later in the 1990s, WTLK ran blocks of country music videos along with infomercials.
In 1996, the station was sold to Paxson Communications. The must-carry rules for cable systems took effect about the same time. WTLK, WNGM and WATC would be added to most metro cable systems immediately. The station's format consisted of infomercials by day and the Worship Network at night. Pax TV was launched in 1998 and WTLK became WPXA as a charter affiliate. Pax TV later became i: Independent Television and is now Ion Television. During the Pax era, WPXA aired a late-night replay of WXIA's 11 p.m. newscast. Most Pax stations had similar arrangements with the NBC affiliates in their markets.
The station's broadcast tower on Bear Mountain was also the first location for WCHK-FM (105.5), now WBZY (105.7 FM) on Sweat Mountain.
Rome also had a previous full-power TV station, WROM-TV (channel 9), from 1953 to 1957. This station later moved to Chattanoog |
https://en.wikipedia.org/wiki/Computer%20font | A computer font is implemented as a digital data file containing a set of graphically related glyphs. A computer font is designed and created using a font editor. A computer font specifically designed for the computer screen, and not for printing, is a screen font.
In the terminology of movable metal type, a font is a set of pieces of movable type in a specific typeface, size, width, weight, slope, etc. (for example, Gill Sans bold 12 point or Century Expanded 14 point), and a typeface refers to the collection of related fonts across styles and sizes (for example, all the varieties of Gill Sans). In HTML, CSS, and related technologies, the font family attribute refers to the digital equivalent of a typeface. Since the 1990s, many people outside the printing industry have used the word font as a synonym for typeface.
There are three basic kinds of computer font file data formats:
Bitmap fonts consist of a matrix of dots or pixels representing the image of each glyph in each face and size.
Vector fonts (including, and sometimes used as a synonym for, outline fonts) use Bézier curves, drawing instructions and mathematical formulae to describe each glyph, which make the character outlines scalable to any size.
Stroke fonts use a series of specified lines and additional information to define the size and shape of the line in a specific typeface, which together determines the appearance of the glyph.
Bitmap fonts are faster and easier to create in computer code than other font types, but they are not scalable: a bitmap font requires a separate font for each size. Outline and stroke fonts can be resized in a single font by substituting different measurements for components of each glyph, but they are more complicated to render on screen or in print than bitmap fonts because they require additional computer code to render the bitmaps to display on screen and in print. Although all font types are still in use, most fonts used on computers today are outline fonts.
Fonts can be monospaced (i.e. every character is plotted a constant distance from the previous character that it is next to while drawing) or proportional (each character has its own width). However, the particular font-handling application can affect the spacing, particularly when justifying text.
Font types
Bitmap fonts
A bitmap font is one that stores each glyph as an array of pixels (that is, a bitmap). It is less commonly known as a or a pixel font. Bitmap fonts are simply collections of raster images of glyphs. For each variant of the font, there is a complete set of glyph images, with each set containing an image for each character. For example, if a font has three sizes, and any combination of bold and italic, then there must be 12 complete sets of images.
Advantages of bitmap fonts include:
Extremely fast and simple to render
Easier to create than other kinds.
Unscaled bitmap fonts always give exactly the same output when displayed on the same specification display
Be |
https://en.wikipedia.org/wiki/Z4%20%28computer%29 | The Z4 was arguably the world's first commercial digital computer, and is the oldest surviving programmable computer. It was designed, and manufactured by early computer scientist Konrad Zuse's company Zuse Apparatebau, for an order placed by Henschel & Son, in 1942; though only partially assembled in Berlin, then completed in Göttingen, and not delivered before the defeat of Nazi Germany, in 1945. The Z4 was Zuse's final target for the Z3 design. Like the earlier Z2, it comprised a combination of mechanical memory and electromechanical logic, so was not a true electronic computer.
Construction
The Z4 was very similar to the Z3 in its design but was significantly enhanced in a number of respects. The memory consisted of 32-bit rather than 22-bit floating point words. The Program Construction Unit (Planfertigungsteil) punched the program tapes, making programming and correcting programs for the machine much easier by the use of symbolic operations and memory cells. Numbers were entered and output as decimal floating-point even though the internal working was in binary. The machine had a large repertoire of instructions including square root, MAX, MIN and sine. Conditional tests included tests for infinity. When delivered to ETH Zurich in 1950 the machine had a conditional branch facility added and could print on a Mercedes typewriter. There were two program tapes where the second could be used to hold a subroutine. (Originally six were planned.)
In 1944, Zuse was working on the Z4 with around two dozen people, including Wilfried de Beauclair. Some engineers who worked at the telecommunications facility of the OKW also worked for Zuse as a secondary occupation. Also in 1944 Zuse transformed his company to the Zuse KG (Kommanditgesellschaft, i.e. a limited partnership) and planned to manufacture 300 computers. This way he could also request additional staff and scientists as a contractor in the Emergency Fighter Program. Zuse's company also cooperated with Alwin Walther's Institute for Applied Mathematics at the Technical University of Darmstadt.
To prevent it from falling into the hands of the Soviets, the Z4 was evacuated from Berlin in February 1945 and transported to Göttingen. The Z4 was completed in Göttingen in a facility of the Aerodynamische Versuchsanstalt (AVA, Aerodynamic Research Institute), which was headed by Albert Betz. But when it was presented to scientists of the AVA the roar of the approaching front could already be heard, so the computer was transported with a truck of the Wehrmacht to Hinterstein in Bad Hindelang in southern Bavaria, where Konrad Zuse met Wernher von Braun.
By 1947 it was possible for constants to be entered by the punched tape.
Use after World War II
In 1949, the Swiss mathematician Eduard Stiefel, after coming back from a stay in the US where he inspected American computers, visited Zuse and the Z4. When he formulated a differential equation as a test, Zuse immediately programmed the Z4 to solve it, St |
https://en.wikipedia.org/wiki/NCR%20304 | The NCR 304 computer, announced in 1957, first delivered in 1959, was National Cash Register (NCR)'s first transistor-based computer. The 304 was developed and manufactured in cooperation with General Electric, where it was also used internally.
Its follow-on was the NCR 315.
See also
Computer architecture
Electronic hardware
Glossary of computer hardware terms
History of computing hardware
List of computer hardware manufacturers
Open-source computing hardware
Open-source hardware
Transistor
References
Transistorized computers
NCR Corporation products
Decimal computers |
https://en.wikipedia.org/wiki/Commodore%20DOS | Commodore DOS, also known as CBM DOS, is the disk operating system used with Commodore's 8-bit computers. Unlike most other DOSes, which are loaded from disk into the computer's own RAM and executed there, CBM DOS is executed internally in the drive: the DOS resides in ROM chips inside the drive, and is run there by one or more dedicated MOS 6502 family CPUs. Thus, data transfer between Commodore 8-bit computers and their disk drives more closely resembles a local area network connection than typical disk/host transfers.
CBM DOS versions
At least seven distinctly numbered versions of Commodore DOS are known to exist; the following list gives the version numbers and related disk drives. Unless otherwise noted, drives are 5¼-inch format. The "lp" code designates "low-profile" drives. Drives whose model number starts with 15 connect via Commodore's unique serial IEEE-488 bus (IEC Bus) serial (TALK/LISTEN) protocols; all others use the parallel IEEE-488.
1.0 – found in the 2040 and 3040 floppy drives
2.0 – found in the 4040 and 3040 floppy drives
2.5 – found in the 8050 floppy drives
2.6 – found in the 1540, 1541 including the one built into the SX-64, 1551, 2031 (+"lp"), and 4031 floppy drives
2.7 – found in the 8050, 8250 (+"lp"), and SFD-1001 floppy drives
3.0 – found in the 1570, external 1571, and 8280 floppy drives (8280: 8-inch), as well as the 9060 and 9090 hard drives
3.1 – found in the built-in 1571 drive of C128DCR computers
10.0 – found in the 1581 (3½-inch) floppy drive
Version 2.6 was by far the most commonly used and widely known DOS version, due to its use in the 1541 as part of C64 systems.
Note: The revised firmware for the 1571 which fixed the relative file bug was also identified as V3.0. Thus it is not possible to differentiate the two versions using the version number alone.
Technical overview
1541 directory and file types
The 1541 Commodore floppy disk can contain up to 144 files in a flat namespace (no subdirectories); the directory is stored on reserved track 18, which is located halfway from the hub to the edge of a 35-track single-sided disk. A file name may be up to 16 bytes in length and is theoretically unique; by using direct access methods on the directory structure, it is possible to rename a file to that of another—although accessing such files may be difficult or impossible. Files with identical names usually serve no purpose except to inform or visually manage files. One popular trick, used, for example, by The Final Cartridge III, was to add files named "----------------" of type DEL< to the directory, and files could then be rearranged around those lines to form groups. Many game developers, warez group members, and demoscene hackers used some more clever custom directory entries as well.
File names may contain a shifted space character ($A0), and if the directory listing is being viewed from BASIC, the portion of the file name beyond the $A0 character will appear to have been se |
https://en.wikipedia.org/wiki/David%20H.%20D.%20Warren | David H. D. Warren is a computer scientist who worked primarily on logic programming and in particular the programming language Prolog in the 1970s and 1980s. Warren wrote the first compiler for Prolog, and the Warren Abstract Machine execution environment for Prolog is named after him.
Early life and education
Warren received a Ph.D. in artificial intelligence from the University of Edinburgh in 1977 under advisor Robert Kowalski, and (a second advisor) Donald Michie.
Career
Warren worked for the Artificial Intelligence Center at SRI International in the 1980s.
He founded the company Quintus Computer Systems in 1983 with William Kornfeld, Lawrence Byrd, Fernando Pereira and Cuthbert Hurd to commercialize the Prolog compiler. Quintus was sold to Intergraph Corporation in 1989.
He has also held an academic position at the University of Bristol Department of Computer Science.
References
Living people
Alumni of the University of Edinburgh
British computer scientists
SRI International people
Logic programming researchers
Academics of the University of Bristol
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Smart%20bullet | A smart bullet is a bullet that is able to do something other than simply follow its given trajectory, such as turning, changing speed or sending data. Such a projectile may be fired from a precision-guided firearm capable of programming its behavior. It is a miniaturized type of precision-guided munition.
Types of smart bullets
In 2008 the EXACTO program began under DARPA to develop a "fire and forget" smart sniper rifle system including a guided smart bullet and improved scope. The exact technologies of this smart bullet have yet to be released. EXACTO was test fired in 2014 and 2015 and results showing the bullet alter course to correct its path to its target were released.
In 2012 Sandia National Laboratories announced a self-guided bullet prototype that could track a target illuminated with a laser designator. The bullet is capable of updating its position 30 times a second and hitting targets over a mile away.
In mid-2016, Russia revealed it was developing a similar "smart bullet" weapon designed to hit targets at a distance of up to .
Guided bullet
The guided bullet was conceptualized by Dr. Rolin F. Barrett, Jr. and patented in August 1998.
As first designed, the bullet would have three fiber-optic based eyes (at minimum, for three-dimensionality), evenly distributed about its circumference. To activate its guided nature, a laser is pointed at a target. As the bullet approaches its final destination, it adjusts its flight path in real time to allow an equivalent amount of light from the laser to enter each eye. The bullet would not travel in multiple directions as though it were an autonomous vehicle, but instead, would make small adjustments to its flight path to hit the target precisely where the laser was placed. Moreover, the laser would not have to originate from the source of the bullet, allowing the projectile to be fired at a target beyond visual range.
To allow the bullet to modify its flight path, the body was designed as a metal and polymer combination. The polymer would act as a deformable surface that would deflect the air-stream and steer the bullet in real time. The guidance system is powered by a miniature lithium-polymer battery that is connected to the navigational circuits.
Barrett went to great lengths to model the airflow of the bullet, studying butterflies with speed bumps to evaluate the effects of protruding surfaces. Due to a lack of ballistic programs at the time, custom simulations were written in Mathcad to solve for numerous flight variables.
In addition to modeling the flight, the interior ballistics were modeled by continuously altering polynomial curves until they were in agreement with publicly available data. Due to a lack of available terminal ballistics data that would have been representative of the guided bullet, the data was compared to that of large game hunting bullets.
Changing trajectory
One kind of smart bullet is a projectile that is capable of changing its course during flight. One |
https://en.wikipedia.org/wiki/Hashlife | Hashlife is a memoized algorithm for computing the long-term fate of a given starting configuration in Conway's Game of Life and related cellular automata, much more quickly than would be possible using alternative algorithms that simulate each time step of each cell of the automaton. The algorithm was first described by Bill Gosper in the early 1980s while he was engaged in research at the Xerox Palo Alto Research Center. Hashlife was originally implemented on Symbolics Lisp machines with the aid of the Flavors extension.
Hashlife
Hashlife is designed to exploit large amounts of spatial and temporal redundancy in most Life rules. For example, in Conway's Life, many seemingly random patterns end up as collections of simple still lifes and oscillators.
Representation
The field is typically treated as a theoretically infinite grid, with the pattern in question centered near the origin. A quadtree is used to represent the field. Given a square of 22k cells, 2k on a side, at the kth level of the tree, the hash table stores the 2k−1-by-2k−1 square of cells in the center, 2k−2 generations in the future. For example, for a 4×4 square it stores the 2×2 center, one generation forward; and for an 8×8 square it stores the 4×4 center, two generations forward.
Hashing
While a quadtree typically has far more overhead than other simpler representations (such as using a matrix of bits), it allows for various optimizations. As the name suggests, the algorithm uses hash tables to store the nodes of the quadtree. Many subpatterns in the tree are usually identical to each other; for example the pattern being studied may contain many copies of the same spaceship, or even large swathes of empty space. These subpatterns will all hash to the same position in the hash table, and thus many copies of the same subpattern can be stored using the same hash table entry. In addition, these subpatterns only need to be evaluated once, not once per copy as in other Life algorithms.
This itself leads to significant improvements in resource requirements; for example a generation of the various breeders and spacefillers, which grow at polynomial speeds, can be evaluated in Hashlife using logarithmic space and time.
Superspeed and caching
A further speedup for many patterns can be achieved by evolving different nodes at different speeds. For example, one could compute twice the number of generations forward for a node at the (k+1)-th level compared to one at the kth. For sparse or repetitive patterns such as the classical glider gun, this can result in tremendous speedups, allowing one to compute bigger patterns at higher generations faster, sometimes exponentially. To take full advantage of this feature, subpatterns from past generations should be saved as well.
Since different patterns are allowed to run at different speeds, some implementations, like Gosper's own hlife program, do not have an interactive display, but simply compute a preset result for a starting pattern, usu |
https://en.wikipedia.org/wiki/Jonathan%20LaPaglia | Jonathan LaPaglia (, ; born 31 August 1969) is an Australian actor and television personality. He has hosted Network 10's revival of Australian Survivor since 2016. As an actor, LaPaglia is known for his roles as Frank B. Parker in the television series Seven Days, Kevin Debreno in The District and Detective Tommy McNamara in New York Undercover.
Early and personal life
LaPaglia was born in Adelaide, South Australia, the youngest of three sons of Maria Johannes (née Brendel), a secretary, originally from the Netherlands and Gedio "Eddie" LaPaglia, an auto mechanic and car dealer from Bovalino, Calabria, Italy. His elder brothers are actor Anthony LaPaglia, and Michael LaPaglia, a car wholesaler in Los Angeles. LaPaglia lives in Santa Monica, California, with his wife Ursula Brooks and daughter.
Career
LaPaglia graduated from Rostrevor College, and then from the University of Adelaide with a MBBS medical degree in 1991. He worked three years as an emergency ward physician in Adelaide, Sydney and London. Feeling restricted, he decided to follow his brother into acting. In 1994, he moved to New York City where he joined the Circle in the Square Theatre School. He got his first break in 1996 when he joined the cast of the television series New York Undercover.
From 1998 until 2001, he played the role of Lt. Frank B. Parker on the science fiction series Seven Days. Afterwards, he played Detective Kevin Debreno, on The District from 2001–2004. LaPaglia has also guest-starred in numerous series including The Sopranos, NCIS, Cold Case and Castle. He appeared in the May 2008 issue of Car Craft magazine with his custom 6.1L Hemi '73 Dodge Challenger.
In 2011, he starred as the protagonist, Hector, in the TV adaptation of Christos Tsiolkas' novel The Slap produced for ABC TV. Although he is Australian, this was LaPaglia's first appearance in an Australian production. Having lived abroad for many years, LaPaglia found it necessary to hire a dialect coach to recover his Australian accent.
His second role in an Australian production was the title character of real-life crime boss Anthony "Rooster" Perish in Channel Nine's Underbelly: Badness, which was the fifth series of the true crime drama franchise. He starred in the 2014 movie The Reckoning alongside Luke Hemsworth.
Since 2016, he has been the host of Network 10's revival of Australian Survivor. In 2020, he was 'inducted' by the "Australian Survivor Archive" fansite into the "Inaugural Australian Survivor Hall of Fame". LaPaglia is also a sports enthusiast and model.
In October 2023, it was confirmed that he would be one of three hosts, alongside Beau Ryan and Blair Joscelyne, on a reboot of Top Gear Australia for Paramount Plus.
Filmography
Film
Television
References
External links
1969 births
20th-century Australian male actors
21st-century Australian male actors
Australian emergency physicians
Australian expatriate male actors in the United States
Australian male film actors
Australian |
https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo%20hash%20function | Fowler–Noll–Vo (or FNV) is a non-cryptographic hash function created by Glenn Fowler, Landon Curt Noll, and Kiem-Phong Vo.
The basis of the FNV hash algorithm was taken from an idea sent as reviewer comments to the IEEE POSIX P1003.2 committee by Glenn Fowler and Phong Vo in 1991. In a subsequent ballot round, Landon Curt Noll improved on their algorithm. In an email message to Landon, they named it the Fowler/Noll/Vo or FNV hash.
Overview
The current versions are FNV-1 and FNV-1a, which supply a means of creating non-zero FNV offset basis. FNV currently comes in 32-, 64-, 128-, 256-, 512-, and 1024-bit variants. For pure FNV implementations, this is determined solely by the availability of FNV primes for the desired bit length; however, the FNV webpage discusses methods of adapting one of the above versions to a smaller length that may or may not be a power of two.
The FNV hash algorithms and reference FNV source code have been released into the public domain.
The Python programming language previously used a modified version of the FNV scheme for its default hash function. From Python 3.4, FNV has been replaced with SipHash to resist "hash flooding" denial-of-service attacks.
FNV is not a cryptographic hash.
The hash
One of FNV's key advantages is that it is very simple to implement. Start with an initial hash value of FNV offset basis. For each byte in the input, multiply hash by the FNV prime, then XOR it with the byte from the input. The alternate algorithm, FNV-1a, reverses the multiply and XOR steps.
FNV-1 hash
The FNV-1 hash algorithm is as follows:
algorithm fnv-1 is
hash := FNV_offset_basis
for each byte_of_data to be hashed do
hash := hash × FNV_prime
hash := hash XOR byte_of_data
return hash
In the above pseudocode, all variables are unsigned integers. All variables, except for byte_of_data, have the same number of bits as the FNV hash. The variable, byte_of_data, is an 8 bit unsigned integer.
As an example, consider the 64-bit FNV-1 hash:
All variables, except for byte_of_data, are 64-bit unsigned integers.
The variable, byte_of_data, is an 8-bit unsigned integer.
The FNV_offset_basis is the 64-bit FNV offset basis value: 14695981039346656037 (in hex, 0xcbf29ce484222325).
The FNV_prime is the 64-bit FNV prime value: 1099511628211 (in hex, 0x100000001b3).
The multiply returns the lower 64-bits of the product.
The XOR is an 8-bit operation that modifies only the lower 8-bits of the hash value.
The hash value returned is a 64-bit unsigned integer.
FNV-1a hash
The FNV-1a hash differs from the FNV-1 hash by only the order in which the multiply and XOR is performed:
algorithm fnv-1a is
hash := FNV_offset_basis
for each byte_of_data to be hashed do
hash := hash XOR byte_of_data
hash := hash × FNV_prime
return hash
The above pseudocode has the same assumptions that were noted for the FNV-1 pseudocode. The change in order leads to sli |
https://en.wikipedia.org/wiki/EUjet | EUjet was a low-cost airline based at Shannon Airport, Ireland. It operated a network of services from its main base at Shannon Airport (SNN), with a hub at Kent International Airport (MSE), Manston, Kent, UK. The airline was sold to a British company, PlaneStation, which also owned Kent airport, for €10m. In July 2005, PlaneStation went out of business with €40m in debts, forcing EUjet to cease operations.
History
The airline was established in 2003 and started operations in May 2003. It was created by former Trans Aer head PJ McGoldrick, who linked with Fokker 100 leasing specialist Debis AirFinance to offer wet leases and charters. In 2004, the company moved into scheduled services. Airport operator PlaneStation completed its takeover of EUjet in January 2005 by acquiring the remaining 70% of the shares. It had bought the first 30% in May 2004. On 26 July 2005, the airline went into administration.
Services
EUjet operated the following services (at July 2005):
Ireland domestic destinations: Dublin and Shannon.
UK destinations: Belfast, Edinburgh, Manchester, Kent International Airport and Newcastle.
International scheduled destinations: Alicante, Amsterdam, Faro, Geneva (ski seasonal destination), Girona, Ibiza, Innsbruck, Málaga, Murcia, Nice, Palma de Mallorca, Prague, Salzburg and Valencia.
Fleet
The EuJet fleet consisted of the following aircraft (History):
Collapse
On 25 July 2005, trading in PlaneStation (EUjet's parent company) shares was suspended. Passenger numbers were far down on expected figures and the company suffered a £6.5 million loss in the last half of 2004. The company stated that discussions with the banks have "not been positive".
On 26 July 2005, all flights were suspended along with the operations of Kent International Airport for all bar freight traffic. Later in the day, EUjet went into voluntary administration leaving up to 5,000 passengers stranded abroad and 500 jobs in the balance.
Lack of passenger numbers are one reason cited for the failure of the airline, with only 330,000 out of the 500,000 passengers predicted for the first year of operation. In addition, the airline had been plagued with disruption and protest from people in Thanet, a significant proportion of whom were against any expansion of operations at Kent International Airport.
easyJet, a rival airline, offered to fly home the thousands of stranded EUjet customers for a flat fee of £25.
References
External links
Photos of EUjet aircraft
Defunct airlines of the Republic of Ireland
Airlines established in 2003
Airlines disestablished in 2005
Irish companies established in 2003 |
https://en.wikipedia.org/wiki/Ifconfig | ifconfig (short for interface config) is a system administration utility in Unix-like operating systems for network interface configuration.
The utility is a command-line interface tool and is also used in the system startup scripts of many operating systems. It has features for configuring, controlling, and querying TCP/IP network interface parameters. Ifconfig originally appeared in 4.2BSD as part of the BSD TCP/IP suite.
Usage
Common uses for ifconfig include setting the IP address and netmask of a network interface and disabling or enabling an interface. At boot time, many Unix-like operating systems initialize their network interfaces with shell scripts that call ifconfig. As an interactive tool, system administrators routinely use the utility to display and analyze network interface parameters. The following two examples show the output of the tool when querying the state of a single active interface each on a Linux-based host (interface eth0) and the ural0 interface on an OpenBSD installation.
eth0 Link encap:Ethernet HWaddr 00:0F:20:CF:8B:42
inet addr:192.168.1.128 Bcast: Mask:255.255.255.192
UP BROADCAST RUNNING MULTICAST MTU:1500 Metric:1
RX packets:2472694671 errors:1 dropped:0 overruns:0 frame:0
TX packets:44641779 errors:0 dropped:0 overruns:0 carrier:0
collisions:0 txqueuelen:1000
RX bytes:1761467179 (1679.7 Mb) TX bytes:2870928587 (2737.9 Mb)
Interrupt:28
ural0: flags=8843<UP,BROADCAST,RUNNING,SIMPLEX,MULTICAST> mtu 1500
lladdr 00:0d:0b:ed:84:fb
media: IEEE802.11 DS2 mode 11b hostap (autoselect mode 11b hostap)
status: active
ieee80211: nwid ARK chan 11 bssid 00:0d:0b:ed:84:fb 100dBm
inet 172.30.50.1 netmask 0xffffff00 broadcast 172.30.50.255
inet6 fe80::20d:bff:feed:84fb%ural0 prefixlen 64 scopeid 0xa
HWaddr: hardware address, MAC address.
The parameter txqueuelen is measured in number of Ethernet frames and is the size of the buffer that is being managed by the network scheduler.
Medium access control functions
ifconfig is also commonly used to change the medium access control (MAC) address of an interface. In this process, the network interface is first disabled (set down) with the ifconfig command, followed by a MAC change command:
ifconfig wlan0 down
ifconfig wlan0 hw ether 13:11:20:33:49:66
ifconfig wlan0 up
Release status
The Berkeley Software Distribution UNIX operating systems (e.g., NetBSD, OpenBSD, and FreeBSD) continue active development of ifconfig and extension of its functionality to cover the configuration of wireless networking interfaces, VLAN trunking, controlling hardware features such as TSO or hardware checksumming or setting up bridge and tunnel interfaces. Solaris has historically used ifconfig for all network interface configuration, but as of Solaris 10 introduced dladm to perform data-link (OSI model layer 2) configuration, reducing ifconfig's purview t |
https://en.wikipedia.org/wiki/Content%20industry | The content industry is an umbrella term that encompasses companies owning and providing mass media and media metadata. This can include music and movies, text publications of any kind, ownership of standards, geographic data, and metadata about all and any of the above.
In the Information Age, the content industry comprises an enormous market.
See also
Information industry
Information technology
Mass media industry
Industries (economics) |
https://en.wikipedia.org/wiki/BSD/OS | BSD/OS (originally called BSD/386 and sometimes known as BSDi) is a discontinued proprietary version of the BSD operating system developed by Berkeley Software Design, Inc. (BSDi).
BSD/OS had a reputation for reliability in server roles; the renowned Unix programmer and author W. Richard Stevens used it for his own personal web server.
History
BSDi was formed in 1991 by members of the Computer Systems Research Group (CSRG) at UC Berkeley to develop and sell a proprietary version of BSD Unix for PC compatible systems with Intel 386 (or later) processors. This made use of work previously done by Bill Jolitz to port BSD to the PC platform.
BSD/386 1.0 was released in March 1993. The company sold licenses and support for it, taking advantage of terms in the BSD License which permit use of the BSD software in proprietary systems, as long the author is credited. The company in turn contributed code and resources to the development of non-proprietary BSD operating systems. In the meantime, Jolitz had left BSDi and independently released an open source BSD for PCs, called 386BSD. The BSDi system features complete and thorough manpage documentation for the entire system, including complete syntax and argument explanations, examples, file usage, authors, and cross-references to other commands.
BSD/386 licenses (including source code) were priced at $995, lower than AT&T UNIX System V source licenses, a fact highlighted in their advertisements. As part of the settlement of USL v. BSDi, BSDI substituted code that had been written for the University's 4.4 BSD-Lite release for disputed code in their OS, effective with release 2.0. By the time of this release, the "386" designation had become dated, and BSD/386 was renamed "BSD/OS". Later releases of BSD/OS also support Sun SPARC-based systems. BSD/OS 5.x versions are available for PowerPC too.
The marketing of BSD/OS became increasingly focused on Internet server applications. However, the increasingly tight market for Unix-compatible software in the late 1990s and early 2000s hurt sales of BSD/OS. On one end of the market, it lacked the certification of the Open Group to bear the UNIX trademark, and the sales force and hardware support of the larger Unix vendors. Simultaneously, it lacked the negligible acquisition cost of the open source BSDs and Linux. BSD/OS was acquired by Wind River Systems in April 2001. Wind River discontinued sales of BSD/OS at the end of 2003, with support terminated at the end of 2004.
Releases
References
Berkeley Software Distribution
Discontinued operating systems |
https://en.wikipedia.org/wiki/AKDN | AKDN may refer to:
Acadiana Railway, a short line railroad based in Opelousas, Louisiana, United States
Aga Khan Development Network, a multinational network of development agencies for humanity |
https://en.wikipedia.org/wiki/Canonical%20%28company%29 | Canonical Ltd. is a UK-based privately held computer software company founded and funded by South African entrepreneur Mark Shuttleworth to market commercial support and related services for Ubuntu and related projects. Canonical employs staff in more than 70 countries and maintains offices in London, Austin, Boston, Shanghai, Beijing, Taipei, Tokyo and the Isle of Man.
Projects
Canonical Ltd. has created and continues to back several projects. Principally these are free and open-source software (FOSS) or tools designed to improve collaboration between free software developers and contributors. Some projects require a Contributor License Agreement to be signed.
Open-source software
Ubuntu Linux, a Debian-based Linux distribution with GNOME (formerly with Unity) desktop
Ubuntu Core, tiny, transactional version of Ubuntu
GNU Bazaar, a decentralized revision control system
Storm, an object-relational mapper for Python, part of the Launchpad code base
Juju, a service orchestration management tool
MAAS, a bare-metal server provisioning tool
cloud-init, the de facto standard for the initial setup of virtual machines in the cloud
Upstart, a discontinued event-based replacement for the init daemon
Quickly, a framework for creating software programs for Linux
Ubiquity, installer
Mir display server
MicroK8s since December 2018
Snappy package manager
Snapcraft, python-based tool for packaging software
Launchpad a centralised website containing several component web applications designed to make collaboration between free software projects easier:
PPA, a special software repository for uploading software packages to be built and published as an APT repository,
Blueprints, a tool for planning features of software,
Code, hosting of Bazaar branches,
Answers, support tracker,
Rosetta, an online language translation tool to help localisation of software (cf. the Rosetta Stone),
Malone (as in "Bugsy Malone"), a collaborative bug-tracker that allows linking to other bug-trackers,
Soyuz, a tool for creating custom-distributions, such as Kubuntu and Xubuntu.
Other projects and services
Landscape, a proprietary web service for centralized management of Ubuntu Linux systems
Ubuntu One, a discontinued service since 2014 for file synchronization and other uses
Ubuntu Advantage, a commercial support service that covers Ubuntu and other Canonical products
Multipass, launched in 2019, provides a command line interface to launch and manage virtual machine instances of Linux in Windows, macOS and Linux.
Joint ventures
Windows Subsystem for Linux, with Microsoft
Business plans
In 2007, Canonical launched an International online shop selling support services and Ubuntu-branded goods; later in 2008 it expanded that with a United States-specific shop designed to reduce shipment times. At the same time, the word Ubuntu was trademarked in connection with clothing and accessories.
In a Guardian interview in May 2008, Shuttleworth said that Canonica |
https://en.wikipedia.org/wiki/Ted%20Henter | Ted Henter (born 1950 in Panama Canal Zone) is an American computer programmer and businessperson known for having invented the JAWS screen reader for the blind. He studied engineering, but learned computer programming and started his own business after becoming blind in a car accident in 1978, which put an end to a promising career as an international motorcycle racer.
In 1987, he teamed up with businessperson Bill Joyce, who together founded Henter-Joyce in St. Petersburg, Florida. Henter was president and led the operation and provided technology direction while Joyce acted as a silent partner. Henter-Joyce produced JAWS, a screen reader for personal computers using MS-DOS, and later Microsoft Windows.
After becoming blinded, Henter rediscovered waterskiing, and started competing in waterskiing events. He won six times out of seven competitions in the United States and twice in international competition. He retired in 1991 after winning the overall Gold medal in the United States and World Championship for Disabled Skiers.
Henter-Joyce merged with Arkenstone and Blazie Engineering in 2000 to form Freedom Scientific. Henter currently remains on the board of directors of Freedom Scientific, and in 2002 he founded Henter Math, to produce software that helps the "pencil-impaired" with mathematics.
Career statistics
Grand Prix motorcycle racing
(key) (Races in bold indicate pole position; races in italics indicate fastest lap)
References
External links
Biography
Henter Math
1950 births
250cc World Championship riders
American computer programmers
Living people
American blind people
American water skiers
American motorcycle racers
University of Florida alumni
Zonians |
https://en.wikipedia.org/wiki/Graphing%20Calculator | Graphing Calculator may refer to:
Graphing calculators, calculators that are able to display and/or analyze mathematical function graphs
NuCalc, a computer software program able to perform many graphing calculator functions
Grapher, the Mac OS X successor to NuCalc |
https://en.wikipedia.org/wiki/NuCalc | NuCalc, also known as Graphing Calculator, is a computer software tool made by the company Pacific Tech. The tool can perform many graphing calculator functions. It can graph inequalities and vector fields, as well as functions in two, three, or four dimensions. It supports several different coordinate systems, and can solve equations. It is available for OS X (under the name Graphing Calculator) and Microsoft Windows.
History
The Graphing Calculator 1.0 software was bundled for free on all Power Macintosh computers since its introduction in 1994. Having shipped on more than 20 million machines, it is the most familiar version of the program. This version of Graphing Calculator was secretly developed at Apple by Ron Avitzur, an abandoned contractor who felt obligated to complete the project, and their friend and colleague Greg Robbins. They also made a version for older 680x0 Macintosh computers called NuCalc 1.0. In 2005, This American Life featured Avitzur's story in episode 284, Should I Stay or Should I go?
Later models of Power Macintosh computers included newer versions of the Graphing Calculator program. At one time, versions were available for free download for Mac OS 9, Mac OS X 10.3, and Mac OS X 10.4. However, these versions may lack some of the features of the original version 1.0 program and may include promotion for the more advanced, commercial version of the software. A Windows version (offered for sale) was at one time renamed NuCalc.
, the latest commercial version was Graphing Calculator 5.2. It has also been ported from C++ to SwiftUI.
Product
Graphing Calculator Version 4 was published for Mac OS X and Microsoft Windows. Pacific Tech also offers free-of-charge downloads of a viewer for saved graphs. Subsets of functionality are available as separate applications: Graphing Calculator Lite, Equation Calculator, Data Calculator, 2D Grapher, 3D Grapher, and 4D Grapher.
See also
Grapher — Apple's replacement is included with Mac OS X 10.4
References
External links
NuCalc/Graphing Calculator homepage
Information and Download for the original Graphing Calculator 1.0 for PowerPC and 680x0 Macs can still be found here
Google Tech Talk of the story behind NuCalc
Plotting software
MacOS graphics-related software
Windows graphics-related software |
https://en.wikipedia.org/wiki/Cyberathlete%20Professional%20League | The Cyberathlete Professional League (CPL) was a professional sports tournament organization specializing in computer and console video game competitions. It was founded by Angel Munoz on June 27, 1997, in Dallas, Texas. The CPL is considered the pioneer in professional video game tournaments, which have been held worldwide. The CPL's tournaments are open to all registrants, but due to the ESRB content rating of some video games, CPL competitions are restricted to participants age 17 or older. The CPL has distributed more than US$3 million in cash prizes.
In 2005, the CPL moved to a World Tour format. The 2005 CPL World Tour focused on the one-on-one deathmatch game Painkiller, and had a total prize purse of $1 million. The winner of the CPL Grand Finals event, Johnathan "Fatal1ty" Wendel, went home with the grand prize of $150,000, while Sander "Vo0" Kaasjager took home the MVP trophy for having the most tournament wins.
In March 2008, the CPL ceased operations, citing a "crowded field of competing leagues". On August 25, 2008, the CPL announced that it had signed an acquisition agreement with an investment group based in Abu Dhabi, United Arab Emirates. On August 23, 2010, the former parent company of the CPL, announced that the two-year acquisition process of the CPL was finalized, and that the sole owner of the CPL (and its subsidiaries) was now WoLong Ventures PTE of Singapore. Following this acquisition, the CPL has hosted annual competitions in China, in collaboration with the municipal government of Shenyang.
Events
2007 and 2010s
2006
The 2006 CPL World Season was a series of electronic sports competitions organized by the CPL in the fall of 2006. It was a follow-up of the 2005 CPL World Tour and was announced by the CPL on July 31, 2006.
The tour featured two games, Counter-Strike and Quake 3. After a total of 7 qualifier events, the finals were held on 16–20 December 2006 at the Hyatt Regency hotel in Dallas, Texas. The championship finals had a total prize purse of $150,000 and were won by ORG: Team: fnatic (Counter-Strike) and Paul "czm" Nelson (Quake 3).
2005
At the 2004 Cyberathlete Extreme Summer Championships, the CPL announced details on its largest event ever, the CPL World Tour. This event took place throughout 2005, with a total of 10 international stops, and a finals event held in New York City, televised by MTV.
2004
Past CPL World Champions
Individual competitions
2006 - USA - Paul "czm" Nelson - Quake III
2005 - USA - Johnathan "Fatal1ty" Wendel - Painkiller
2004 - The Netherlands - Sander "Vo0" Kaasjager - Painkiller
2003 - Norway - Chris "kJer" Lujan - Painkiller
2002 - USA - Johnathan "Fatal1ty" Wendel - Unreal Tournament 2003
2001 - USA - Johnathan "Fatal1ty" Wendel - Alien versus Predator 2
2001 - Australia - Harley "HarlsoM" Grey - Quakeworld
2000 - USA - Johnathan "Fatal1ty" Wendel - Quake III
1999 - USA - Mark "wombat" Larsen - Quake III
1998 - USA - Dan "Rix" Hammans - Quake II
1997 - USA |
https://en.wikipedia.org/wiki/Gene%20expression%20programming | In computer programming, gene expression programming (GEP) is an evolutionary algorithm that creates computer programs or models. These computer programs are complex tree structures that learn and adapt by changing their sizes, shapes, and composition, much like a living organism. And like living organisms, the computer programs of GEP are also encoded in simple linear chromosomes of fixed length. Thus, GEP is a genotype–phenotype system, benefiting from a simple genome to keep and transmit the genetic information and a complex phenotype to explore the environment and adapt to it.
Background
Evolutionary algorithms use populations of individuals, select individuals according to fitness, and introduce genetic variation using one or more genetic operators. Their use in artificial computational systems dates back to the 1950s where they were used to solve optimization problems (e.g. Box 1957 and Friedman 1959). But it was with the introduction of evolution strategies by Rechenberg in 1965 that evolutionary algorithms gained popularity. A good overview text on evolutionary algorithms is the book "An Introduction to Genetic Algorithms" by Mitchell (1996).
Gene expression programming belongs to the family of evolutionary algorithms and is closely related to genetic algorithms and genetic programming. From genetic algorithms it inherited the linear chromosomes of fixed length; and from genetic programming it inherited the expressive parse trees of varied sizes and shapes.
In gene expression programming the linear chromosomes work as the genotype and the parse trees as the phenotype, creating a genotype/phenotype system. This genotype/phenotype system is multigenic, thus encoding multiple parse trees in each chromosome. This means that the computer programs created by GEP are composed of multiple parse trees. Because these parse trees are the result of gene expression, in GEP they are called expression trees. Masood Nekoei, et al. utilized this expression programming style in ABC optimization to conduct ABCEP as a method that outperformed other evolutionary algorithms.ABCEP
Encoding: the genotype
The genome of gene expression programming consists of a linear, symbolic string or chromosome of fixed length composed of one or more genes of equal size. These genes, despite their fixed length, code for expression trees of different sizes and shapes. An example of a chromosome with two genes, each of size 9, is the string (position zero indicates the start of each gene):
012345678012345678
L+a-baccd**cLabacd
where “L” represents the natural logarithm function and “a”, “b”, “c”, and “d” represent the variables and constants used in a problem.
Expression trees: the phenotype
As shown above, the genes of gene expression programming have all the same size. However, these fixed length strings code for expression trees of different sizes. This means that the size of the coding regions varies from gene to gene, allowing for adaptation and evolution to occur s |
https://en.wikipedia.org/wiki/HP-150 | HP-150 (aka HP Touchscreen or HP 45611A) was a compact, powerful and innovative computer made by Hewlett-Packard in 1983. It was based on the Intel 8088 CPU and was one of the world's earliest commercialized touch screen computers. Like other "workalike" IBM PC clones of the time, despite running customized MS-DOS versions 2.01, 2.11 and 3.20, the machine was not IBM PC DOS compatible. Its 8088 CPU, rated at 8 MHz, was faster than the 4.77 MHz CPUs used by the IBM PC of that period. Using add-on cards, main memory could be increased from 256 KB to 640 KB. However, its mainboard did not have a slot for the optional Intel 8087 math coprocessor due to space constraints. An HP-150 with an optional hard disk was called HP Touchscreen MAX.
The computer's screen was a 9-inch Sony CRT surrounded by infrared emitters and detectors which detected the position of any non-transparent object that touched the screen. In the original HP-150, these emitters and detectors were placed within small holes located on the inside of the monitor's bezel (which resulted in the bottom series of holes sometimes filling with dust, causing the touchscreen to fail until the dust was vacuumed from the holes).
Like the original Macintosh, HP-150 was packaged with the CRT display as a single unit, and made use of 3½-inch floppy disks. Unlike the Mac, however, HP-150 had no internal floppy drive; the machine sat atop the phone book-sized 9121D dual 3½-inch floppy (76 mm high, 325 mm wide, 285 mm deep) or similarly sized hard disk devices, connected by HP-IB.
Invisible to the user, the HP-150 runs "Terminal Operating System" ("TOS", code-named "Magic" during development). This operating system generally runs only two tasks: the terminal emulator and MST (which is Microsoft DOS).
Hardware
Display
Display resolutions:
Text: 80 columns × 27 lines (720 × 378 pixels)
Character size: 7 × 10 pixels
Character cell size: 9 × 14 pixels
Inherent HP Terminal emulation equivalent to HP 2623 Graphics Terminal
Bit-map: 512 × 390 pixels
Separate plane for text and graphics
Monitor sensor grid: 40 (h) × 24 (v)
HP-150's touch screen sensor grid is quite coarse. Its resolution is only two characters wide. Used mainly for rough cursor positioning and function key control, it could not be used to draw pictures.
Processor unit
Optional internal thermal printer HP 2647A (fax roll)
Communication ports:
Two RS-232 ports (one of them supported RS-422)
HP-IB (IEEE-488)
HP-HIL (standard on HP-150 II, but an optional add-on card on HP-150)
Storage
Supported HP-IB attached storage:
Reception
BYTE in November 1984 called HP-150 "an extremely flexible machine", but "difficult to program".
Successors
The two-CPU HP-120 (aka HP 45600A) Z80 CP/M machine also used the 9121 drives.
HP-150 II (aka HP 45849A) replaced HP-150 in 1984. While still called HP Touchscreen II, the touchscreen was no longer standard, but rather a rarely-adopted option. The optional touchscreen bezel was superior to th |
https://en.wikipedia.org/wiki/UnixODBC | unixODBC is an open-source project that implements the ODBC API. The code is provided under the GNU GPL/LGPL and can be built and used on many different operating systems, including most versions of Unix, Linux, Mac OS X, IBM OS/2 and Microsoft's Interix.
The goals of the project include:
Provide developers with the tools to port Microsoft Windows ODBC applications to other platforms with the minimum of code changes.
Maintain the project as a vendor neutral interface database SDK
Provide people who write ODBC drivers the tools to port their drivers to non Windows platforms
Provide the user with a set of GUI and command line tools for managing their database access
Maintain links with both the free software community and commercial database vendors, to ensure interoperability
History
1999
The unixODBC project was first started in the early months of 1999 (by Peter Harvey) and was created as at that time the developers of iODBC (another open source ODBC implementation) were not then willing to LGPL the code, expand the API to include the current ODBC 3 API specification, and did not consider the addition of GUI based configuration tools worthwhile. iODBC now has these parts added, and applications that use the ODBC interface may use both iODBC and unixODBC, without change in most cases, as a result of both projects adhering to the single ODBC specification.
1999 July
The original driver manager was very basic. The driver manager was rewritten by Easysoft's Nick Gorham soon after the project started. Nick assumed leadership of the project in July 1999 with Peter Harvey continuing work on supporting code.
The development of unixODBC progressed since its origin, with contributions from many developers, both in the open source community and also from commercial database companies, including IBM, Oracle Corporation and SAP.
It is included as part of the standard installation of many Linux distributions.
2009
The unixODBC project was split into several projects (all hosted on SourceForge);
unixODBC ("Core" and "Dev" bits)
unixODBC-GUI-Qt (Qt based GUI bits)
unixODBC-Test (multiple test frameworks)
This split was done to allow faster releases of supporting work while maintaining focus on stability and consistency for the core code.
External links
unixODBC homepage
UnixODBC & MySQL Sample Program
Database APIs
SQL data access |
https://en.wikipedia.org/wiki/GNOME-DB | GNOME-DB is a database application by the GNOME community. The project aims to provide a free unified data access architecture to the GNOME project for all Unix platforms. GNOME-DB is useful for any application that accesses persistent data (not only databases, but data), since it contains a data management API.
Support for GObject Introspection and Vala.
Starting with the 4.2 series, GNOME-DB corresponds to the libgda library.
The libgnomedb library provides "widgets" that allow users to interact with data in databases. It uses the libgda generic database API, so it can use MySQL, Postgres, Sqlite, etc.
GNU Data Access
GNU Data Access (GDA) is a set of plugin APIs, defined as generic as possible, so that any kind of data source can be accessed through them, to provide uniform access to different kinds of data sources (databases, information servers, mail spools, etc.). Similar to Open Database Connectivity (ODBC) or Java Database Connectivity (JDBC), GNU Data Access is a wrapper but with more features to access several database engines. GNU Data Access has been developed as a complete architecture that provides everything required to access data sources.
Libgda is mainly a database and a data abstraction layer. It is a library that implements the interfaces defined by the GDA architecture, for both the client and the server parts. It additionally provides a bunch of tools to help with the development and the management of data sources via the GDA APIs. Libgda was part of the GNOME-DB project but has been separated from it to allow non-GNOME applications to be developed based on it.
The libgda library is released under the terms of the GNU Lesser General Public License (LGPL), which allows for commercial applications to be developed based on libgda. Its command-line and UI tools are under the GNU General Public License (GPL).
Libgda is a (relatively small) database access library:
features a metadata extractor (to know all about database objects in a common way)
comes with an SQL console application (like mysql, psql or sqlite3 consoles)
Libgda is coded in C, depends on GLib (and integrates with it), and LibXML2.
Libgda's UI extension depends on GTK+
Libgda's graphical tools depend on GTK+ and optionally GooCanvas and GraphViz
See also
UnixODBC – a free and open-source implementation of ODBC
SQLite
References
External links
GNOME-DB home page
libgda git
Free database management systems
Free software programmed in C
GNOME libraries
sv:GNOME-DB |
https://en.wikipedia.org/wiki/Crave%20%28TV%20network%29 | Crave (formerly The Movie Network or TMN) is a Canadian premium television network and streaming service owned by the Bell Media subsidiary of BCE Inc.
Launched in 1983 as the national service First Choice, early difficulties and a subsequent industry restructuring led to its operations being restricted to Eastern Canada from 1984 to 2016; it then held a regional legal monopoly on movie-based premium TV service in its territory until the launch of the present-day Super Channel in 2007. The service, which changed its name to The Movie Network in 1993, resumed national operations in 2016, when Movie Central (which previously held a similar monopoly in Western and Northern Canada) wound down its operations and transferred its subscribers to TMN.
In 2018, TMN merged its operations with the Bell-owned over-the-top (OTT) streaming service CraveTV, and both services were renamed Crave. With the changes, the OTT version of the service added a premium tier, "Movies + HBO", which adds access to the premium content that was previously exclusive to the TMN and HBO. Likewise, the version of the service distributed by television providers gained access to the on-demand library of the former CraveTV service as part of their subscription. As such, the service was often sold by providers under the name Crave + Movies + HBO, until programming from both tiers was collapsed into a single library in October 2021. Since then, the Crave service sold by TV service providers has been equivalent to the "Crave Total" OTT plan.
For regulatory purposes, the Crave OTT service and specialty television service are considered to be separate operations.
History
Development
In 1976, Communications Minister Jeanne Sauvé was quoted as saying "(Canadian) pay television is inevitable". During the 1970s when premium television service HBO and the then up-and-coming Atlanta, Georgia superstation WTBS (now WPCH-TV) became available via satellite in North America, some Canadians who were living in underserved rural areas, wanted access to these services. The Saskatchewan government together with Cable Regina (later Access Communications) set up a provincial pay television network called Teletheatre in 1979.
Growth of grey market television receive-only dishes by 1980 led the Canadian government under the administration of Pierre Trudeau to allow for pay television in Canada, and that there would be hearings to license pay television networks in Canada. In September 1981, the Canadian Radio-television and Telecommunications Commission (CRTC) held a hearing in Hull, Quebec to license Canada's first pay television networks. There were more than 24 applicants to start such services.
When First Choice Canadian Communications Corp. made its application to the CRTC in September 1981, the individuals and companies involved in the proposed channel included Donald Sobey (of the Sobeys supermarket chain), J. R. McCaig, Norman Keevil, television producer Riff Markowitz, Royfund Equity Ltd. (a |
https://en.wikipedia.org/wiki/Big%20Ten%20%28disambiguation%29 | The Big Ten Conference is a collegiate athletic conference in the United States.
Big Ten may also refer to:
Big Ten Network, American sports network
Big Ten Tournament (disambiguation)
"Big Ten Inch Record", a song by Bull Moose Jackson
The Big 10, a mixtape by 50 Cent
"Big Ten", a song by English reggae musician Judge Dread
See also
Big One (disambiguation)
Big Two (disambiguation)
Big Three (disambiguation)
Big Four (disambiguation)
Big Five (disambiguation)
Big Six (disambiguation)
Big Seven (disambiguation)
Big Eight (disambiguation) |
https://en.wikipedia.org/wiki/List%20of%20analyses%20of%20categorical%20data | This a list of statistical procedures which can be used for the analysis of categorical data, also known as data on the nominal scale and as categorical variables.
General tests
Bowker's test of symmetry
Categorical distribution, general model
Chi-squared test
Cochran–Armitage test for trend
Cochran–Mantel–Haenszel statistics
Correspondence analysis
Cronbach's alpha
Diagnostic odds ratio
G-test
Generalized estimating equations
Generalized linear models
Krichevsky–Trofimov estimator
Kuder–Richardson Formula 20
Linear discriminant analysis
Multinomial distribution
Multinomial logit
Multinomial probit
Multiple correspondence analysis
Odds ratio
Poisson regression
Powered partial least squares discriminant analysis
Qualitative variation
Randomization test for goodness of fit
Relative risk
Stratified analysis
Tetrachoric correlation
Uncertainty coefficient
Wald test
Binomial data
Bernstein inequalities (probability theory)
Binomial regression
Binomial proportion confidence interval
Chebyshev's inequality
Chernoff bound
Gauss's inequality
Markov's inequality
Rule of succession
Rule of three (medicine)
Vysochanskiï–Petunin inequality
2 × 2 tables
Chi-squared test
Diagnostic odds ratio
Fisher's exact test
G-test
Odds ratio
Relative risk
McNemar's test
Yates's correction for continuity
Measures of association
Aickin's α
Andres and Marzo's delta
Bangdiwala's B
Bennett, Alpert, and Goldstein’s S
Brennan and Prediger’s κ
Coefficient of colligation - Yule's Y
Coefficient of consistency
Coefficient of raw agreement
Conger's Kappa
Contingency coefficient – Pearson's C
Cramér's V
Dice's coefficient
Fleiss' kappa
Goodman and Kruskal's lambda
Guilford’s G
Gwet's AC1
Hanssen–Kuipers discriminant
Heidke skill score
Jaccard index
Janson and Vegelius' C
Kappa statistics
Klecka's tau
Krippendorff's Alpha
Kuipers performance index
Matthews correlation coefficient
Phi coefficient
Press' Q
Renkonen similarity index
Prevalence adjusted bias adjusted kappa
Sakoda's adjusted Pearson's C
Scott's Pi
Sørensen similarity index
Stouffer's Z
True skill statistic
Tschuprow's T
Tversky index
Von Eye's kappa
Categorical manifest variables as latent variable
Latent variable model
Item response theory
Rasch model
Latent class analysis
See also
Categorical distribution
Categorical data
Analysis |
https://en.wikipedia.org/wiki/List%20of%20unsolved%20problems%20in%20computer%20science | This article is a list of notable unsolved problems in computer science. A problem in computer science is considered unsolved when no solution is known, or when experts in the field disagree about proposed solutions.
Computational complexity
P versus NP problem
What is the relationship between BQP and NP?
NC = P problem
NP = co-NP problem
P = BPP problem
P = PSPACE problem
L = NL problem
PH = PSPACE problem
L = P problem
L = RL problem
Unique games conjecture
Is the exponential time hypothesis true?
Is the strong exponential time hypothesis (SETH) true?
Do one-way functions exist?
Is public-key cryptography possible?
Log-rank conjecture
Polynomial versus nondeterministic-polynomial time for specific algorithmic problems
Can integer factorization be done in polynomial time on a classical (non-quantum) computer?
Can the discrete logarithm be computed in polynomial time on a classical (non-quantum) computer?
Can the shortest vector of a lattice be computed in polynomial time on a classical or quantum computer?
Can clustered planar drawings be found in polynomial time?
Can the graph isomorphism problem be solved in polynomial time?
Can leaf powers and -leaf powers be recognized in polynomial time?
Can parity games be solved in polynomial time?
Can the rotation distance between two binary trees be computed in polynomial time?
Can graphs of bounded clique-width be recognized in polynomial time?
Can one find a simple closed quasigeodesic on a convex polyhedron in polynomial time?
Can a simultaneous embedding with fixed edges for two given graphs be found in polynomial time?
Other algorithmic problems
The dynamic optimality conjecture: do splay trees have a bounded competitive ratio?
Can a depth-first search tree be constructed in NC?
Can the fast Fourier transform be computed in time?
What is the fastest algorithm for multiplication of two n-digit numbers?
What is the lowest possible average-case time complexity of Shellsort with a deterministic, fixed gap sequence?
Can 3SUM be solved in strongly sub-quadratic time, that is, in time for some ?
Can the edit distance between two strings of length be computed in strongly sub-quadratic time? (This is only possible if the strong exponential time hypothesis is false.)
Can X + Y sorting be done in time?
What is the fastest algorithm for matrix multiplication?
Can all-pairs shortest paths be computed in strongly sub-cubic time, that is, in time for some ?
Can the Schwartz–Zippel lemma for polynomial identity testing be derandomized?
Does linear programming admit a strongly polynomial-time algorithm? (This is problem #9 in Smale's list of problems.)
How many queries are required for envy-free cake-cutting?
What is the algorithmic complexity of the minimum spanning tree problem? Equivalently, what is the decision tree complexity of the MST problem? The optimal algorithm to compute MSTs is known, but it relies on decision trees, so its complexity is unknown.
Gi |
https://en.wikipedia.org/wiki/WKTB-CD | WKTB-CD (channel 47) is a low-power, Class A television station licensed to Norcross, Georgia, United States, serving the Atlanta area as an affiliate of the Spanish-language network Telemundo. It is owned by locally based Gray Television alongside CBS affiliate and company flagship WANF (channel 46), and The CW affiliate WPCH-TV (channel 17). WKTB-CD's studios are located on Green River Parkway in Duluth, and its transmitter is located on Goshen Springs Road (near the I-85/SR 140 interchange) just outside Norcross. Master control and most internal operations are based at the shared studios of WANF and WPCH-TV on 14th Street Northwest in Atlanta's Home Park neighborhood.
The 47.2 signal is rebroadcast in widescreen standard definition on full-power WANF to provide a Telemundo signal to the entire market, using virtual channel 47.1.
History
Early years
On April 2, 1990, John R. Broomall received the construction permit for a new low-power television station licensed to Roswell, Georgia, on channel 67. Broomall sold the permit to the Korean American TV Broadcasting Co. in April 1991.
By 1996, Korean American had added Telemundo programming, which aired for most of the day, alongside Chinese- and Korean-language fare. Korean programming aired from 7 a.m. to 10 a.m. and again from 11 p.m. to 1 a.m., emphasizing local news, alongside local church service broadcasts and South Korean news and entertainment programs.
The Korean programming, known as KTN, went full-time on a cable channel on AT&T Broadband systems in 2001, which increased its output from six hours a day. Programming continued to include imported and local productions. Meanwhile, channel 67 became channel 38, a result of the clearing of channels 60 to 69 for telecommunications use, in 2000, becoming W38CU. The station's coverage area did not reach much of the city of Atlanta, but it did reach areas of Gwinnett County and DeKalb County with significant ethnic populations.
Digital era
Korean American TV obtained a permit to construct W47DN-D as its digital companion channel on channel 47, with a superior technical facility covering much of the metropolitan area. In 2009, W38CU obtained Class A status and became WKTB-CA; this transferred to the digital transmitter in 2011 upon consolidation under one license. In 2009, the station reaffiliated with Telemundo.
In August 2013, a subchannel on full-power WPXA-TV began repeating WKTB-CD's Telemundo feed in standard definition, using virtual channel 47.11. In June 2021, this moved to WSB-TV.
Sale to Gray Television
On February 7, 2022, it was announced that Gray Television would purchase WKTB-CD and sister company Surge Digital Media, an ad agency specializing in multicultural clients and services, for $30 million, pending approval of the Federal Communications Commission (FCC); this would make WKTB-CD a sister station to Gray's duopoly of CBS affiliate WGCL-TV (channel 46, now WANF) and independent station WPCH-TV (channel 17). The sale was |
https://en.wikipedia.org/wiki/The%20Wild | The Wild is a 2006 computer-animated adventure comedy film directed by animator Steve "Spaz" Williams and written by Ed Decter, John J. Strauss, Mark Gibson and Philip Halprin. It features the voices of Eddie Izzard, Kiefer Sutherland, Janeane Garofalo, Jim Belushi, Richard Kind, Greg Cipes, and William Shatner.
Produced by Walt Disney Pictures, Hoytyboy Pictures, Sir Zip Studios and Contrafilm, it was animated by C.O.R.E. Feature Animation. It was released to theaters in North America on April 14, 2006, by Buena Vista Pictures Distribution and earned $102 million on an $80 million budget. The film was a critical and commercial failure, with severe criticism given towards its animation and similarities to DreamWorks Animation's Madagascar, Pixar's Finding Nemo, and Disney's very own The Lion King.
Plot
At the Central Park Zoo, Samson the lion tells his preteen son Ryan stories of his adventures in the Wilds of Africa. Ryan wants to go to the wild too to learn how to roar like his father, but Samson disapproves of the idea. When the zoo closes, all the animals are free to roam. Samson and his friends, Benny the squirrel, Bridget the giraffe whom Benny has a crush on, Larry the dim-witted anaconda, and Nigel the unlucky but popular koala compete in a turtle curling championship. Ryan and his own friends accidentally cause a stampede which heads to the game and endangers the animals. Samson and Ryan have a falling-out and Ryan runs off before Samson can apologize. He later sneaks into a green Intermodal container which is rumored to be heading to the wild. Just as he regrets his decision, Ryan suddenly gets locked inside the container, which is then loaded onto a freight truck, shipping him away.
With the help of a pigeon, Hamir, Samson, and his friends go after Ryan, hiding in a garbage disposal truck, but Benny falls overboard. After passing through Times Square and nearly being crushed in the truck, the group encounters a pack of rabid dogs, and instead of standing his ground, Samson escapes through the sewer rather than fighting as his friends expect for him to do. There, they take directions to the docks from two friendly streetwise alligator brothers, Stan and Carmine. The next morning, they steal a tugboat during a hectic escape from the harbor. After reuniting with Benny, who has followed them with a flock of geese, Samson manages to drive the boat with Larry's help and the geese lead them to the right direction toward Ryan's ship.
A few days later the boat runs aground in Africa, where all the animals in the area are being evacuated by the carriers, as a nearby volcano is about to erupt. They witness Ryan run into the jungle, but Samson is unable to find him. After failing to eat a rock hyrax, his friend questions if he has ever been in the wild before, to which he forlornly confirms. The rest of the group heads back to the ship, but Samson continues to search for his son. While walking, he sees plants and rocks changing colors, which h |
https://en.wikipedia.org/wiki/Saturn%20Award%20for%20Best%20Network%20Television%20Series | The Saturn Award for Best Network Television Series was presented annually by the Academy of Science Fiction, Fantasy and Horror Films, honoring the best network television series. It was introduced in 1988 and discontinued in 2015 when the Saturn Award went through major changes in their television categories.
Lost holds the record of the most wins in this category with five; additionally, Buffy the Vampire Slayer and The X-Files both won the award three times. The X-Files is also the most nominated series in the category, with eight nominations.
(NOTE: Year refers to year of eligibility, the actual ceremonies are held the following year)
The winners are listed in bold.
Winners and nominees
1980s
1990s
2000s
2010s
Most nominations
8 nominations - The X-Files (2 consecutive; 6 consecutive)
7 nominations:
Buffy the Vampire Slayer (consecutive)
Lost (consecutive)
The Simpsons (consecutive)
Smallville (6 consecutive)
6 nominations:
Angel (consecutive)
Star Trek: The Next Generation (consecutive)
Supernatural (2 consecutive; 3 consecutive)
Fringe (consecutive)
4 nominations:
Heroes (consecutive)
Star Trek: Enterprise (consecutive)
3 nominations:
Alias (consecutive)
The Following (consecutive)
Star Trek: Voyager (2 consecutive)
Tales from the Crypt (2 consecutive)
2 nominations:
The Blacklist (consecutive)
CSI: Crime Scene Investigation (consecutive)
Dark Angel (consecutive)
Grimm
Hannibal (consecutive)
Once Upon a Time (consecutive)
Quantum Leap (consecutive)
Revolution (consecutive)
Roswell (consecutive)
Seven Days (consecutive)
Sleepy Hollow (consecutive)
Sliders (consecutive)
Star Trek: Deep Space Nine
Terminator: The Sarah Connor Chronicles (consecutive)
The Vampire Diaries (consecutive)
Veronica Mars (consecutive)
Most wins
5 wins - Lost (2 consecutive; 3 consecutive)
3 wins:
Buffy the Vampire Slayer (2 consecutive)
The X-Files
2 wins:
Fringe (consecutive)
Hannibal (consecutive)
Revolution (consecutive)
Star Trek: The Next Generation (consecutive)
See also
Saturn Award for Best Action-Thriller Television Series
Saturn Award for Best Animated Series or Film on Television
Saturn Award for Best Fantasy Television Series
Saturn Award for Best Horror Television Series
Saturn Award for Best Science Fiction Television Series
Saturn Award for Best Syndicated/Cable Television Series
Saturn Award for Best Youth-Oriented Television Series
External links
Official Site
Internet Movie Database: 16th, 17th, 18th, 19th, 20th, 21st, 22nd, 23rd, 24th, 25th, 26th, 27th, 28th, 29th, 30th, 31st, 32nd, 33rd, 34th, 35th, 36th, 37th, 38th, 39th, 40th, 41st
Network Television Series
fr:Saturn Award de la meilleure série#Meilleure série diffusée sur les réseaux nationaux |
https://en.wikipedia.org/wiki/Zero%20page | The zero page or base page is the block of memory at the very beginning of a computer's address space; that is, the page whose starting address is zero. The size of a page depends on the context, and the significance of zero page memory versus higher addressed memory is highly dependent on machine architecture. For example, the Motorola 6800 and MOS Technology 6502 processor families treat the first 256 bytes of memory specially, whereas many other processors do not.
Unlike more modern hardware, in the 1970s computer RAM was as fast as or faster than the CPU. Thus it made sense to have few registers and use the main memory as an extended pool of extra registers. In machines with a relatively wide 16-bit address bus and comparatively narrow 8-bit data bus, accessing zero page locations could be faster than accessing other locations.
Zero page addressing now has mostly historical significance, since the developments in integrated circuit technology have made adding more registers to a CPU less expensive and CPU operations much faster than RAM accesses.
Size
The actual size of the zero page in bytes is determined by the microprocessor design and in older designs, is often equal to the largest value that can be referenced by the processor's indexing registers. For example, the aforementioned 8-bit processors have 8-bit index registers and a page size of 256 bytes. Therefore, their zero page extends from address 0 to address 255.
Computers with few CPU registers
In early computers, including the PDP-8, the zero page had a special fast addressing mode, which facilitated its use for temporary storage of data and compensated for the relative shortage of CPU registers. The PDP-8 had only one register, so zero page addressing was essential. In the original PDP-10 KA-10 models, the registers it has are simply the first 16 words, 36-bits long, of main memory. Those locations can be accessed as both registers and memory locations.
Unlike more modern hardware, 1970s computer RAM was as fast as or faster than the CPU. Thus, it made sense to have few registers and use the main memory as an extended pool of extra registers. In machines with a relatively wide 16-bit address bus and comparatively narrow 8-bit data bus, accessing zero page locations could be faster than accessing other locations. Since zero page locations could be addressed by a single byte, the instructions accessing them could be smaller and faster loading.
For example, the MOS Technology 6502 has only one general purpose register (the accumulator). To offset this weakness and gain a performance advantage, it was designed to make special use of the zero page, providing special instructions that are smaller, thus requiring fewer memory fetch cycles and executing faster. Many instructions are coded differently for zero page and non-zero page addresses, this is called zero-page addressing in 6502 terminology (it was called direct addressing in 6800 terminology):
LDA $00 ; zero pag |
https://en.wikipedia.org/wiki/The%20Wire | The Wire is an American crime drama television series created and primarily written by author and former police reporter David Simon. The series was broadcast by the cable network HBO in the United States. The Wire premiered on June 2, 2002, and ended on March 9, 2008, comprising 60 episodes over five seasons. The idea for the show started out as a police drama loosely based on the experiences of his writing partner Ed Burns, a former homicide detective and public school teacher.
Set and produced in Baltimore, Maryland, The Wire introduces a different institution of the city and its relationship to law enforcement in each season while retaining characters and advancing storylines from previous seasons. The five subjects are, in chronological order, the illegal drug trade, the port system, the city government and bureaucracy, education and schools, and the print news medium. Simon chose to set the show in Baltimore because of his familiarity with the city.
When the series first aired, the large cast consisted mainly of actors who were unknown to television audiences, as well as numerous real-life Baltimore and Maryland figures in guest and recurring roles. Simon has said that despite its framing as a crime drama, the show is "really about the American city, and about how we live together. It's about how institutions have an effect on individuals. Whether one is a cop, a longshoreman, a drug dealer, a politician, a judge or a lawyer, all are ultimately compromised and must contend with whatever institution to which they are committed."
The Wire is lauded for its literary themes, its uncommonly accurate exploration of society and politics, and its realistic portrayal of urban life. During its original run, the series received only average ratings and never won any major television awards, but it is now often cited as one of the greatest shows in the history of television.
Production
Conception
Simon has stated that he originally set out to create a police drama loosely based on the experiences of his writing partner Ed Burns, a former homicide detective and public school teacher who had worked with Simon on projects including The Corner (2000). Burns, when working on protracted investigations of violent drug dealers using surveillance technology, had often been frustrated by the bureaucracy of the Baltimore Police Department; Simon saw similarities with his own ordeals as a police reporter for The Baltimore Sun.
Simon chose to set the show in Baltimore because of his familiarity with the city. During his time as a writer and producer for the NBC program Homicide: Life on the Street, based on his book Homicide: A Year on the Killing Streets (1991), also set in Baltimore, Simon had come into conflict with NBC network executives who were displeased by the show's pessimism. Simon wanted to avoid a repeat of these conflicts and chose to take The Wire to HBO, because of their working relationship from the miniseries The Corner. HBO was initially do |
https://en.wikipedia.org/wiki/Amazing%20Facts | Amazing Facts is a non-profit Seventh-day Adventist evangelistic ministry based in Granite Bay, California, which broadcasts daily television programming worldwide. It is based on the teachings of Scripture, and especially focuses on the Three Angels' Messages of Revelation 14. Beginning as a radio program dedicated to Christian evangelism, it later expanded into television and online Bible study ministries.
History
Amazing Facts was founded in 1965 by Joe Crews in Baltimore, Maryland. Inspired by the success of The Rest Of The Story, hosted by Paul Harvey, Joe Crews' original objective for Amazing Facts was to reach out to both Christian and non-Christian listeners via daily 15-minute programs by opening with a scientific or historic fact, and how it applies to the overall Biblical messages. Later, the program offered accompanying home Bible study courses, as well as books written by Crews himself. In 1987, Amazing Facts initiated a television ministry that has expanded to four programs as well as periodic evangelism series.
Shortly before his death in 1994, Crews invited Doug Batchelor to assume the position of president, which he holds to this day. Today, the Amazing Facts radio program "Bible Answers Live" broadcasts mainly out of Granite Bay, California each Sunday evening to about 100 national stations. At the end of 2018, Amazing Facts became an independent ministry and changed its name to Amazing Facts International.
Media programming
Amazing Facts programming is available on a variety of over-the-air, cable and satellite stations
In addition, programs are archived on the website.
Radio programs
Bible Answers Live - a 60-minute Sunday evening radio program where listeners phone or email Bible questions which are answered live
Wonders in the Word - 30-minute radio program airing Monday through Thursday
Television
The ministry carries various programming on television through Internet, mobile devices, various television stations, networks including their Amazing Facts Television Channel.
Sabbath School Study Hour
The Sabbath School Study hour is a program that aims to study in depth an important biblical theme during one quarter of the year. This big theme is then divided into related smaller themes for a weekly 60-minute study.
The program is hosted and broadcast by Granite Bay Hilltop Seventh-day Adventist Church.
Speakers
AFCOE
Amazing Facts operates the Amazing Facts Center of Evangelism (AFCOE). "AFCOE trains and equips clergy and lay people in all aspects of evangelistic ministry." Both a four-month "Complete" course and a 4-day "AFCOE To Go" courses are offered from their campus in Rocklin, CA and by request around the world.
Bible school
Amazing Facts offers a free Bible school with online study guides, ranging from real topics to health topics.
Some themes of the studies are "A Love that Transforms", "God Drew the Plans", "God's Free Health Plan", "Purity & Power!", and "Are the Dead Really Dead?".
Mergers
In Apri |
https://en.wikipedia.org/wiki/Intermediate%20Perl | Intermediate Perl is a book about the Perl programming language by Randal L. Schwartz, brian d foy and Tom Phoenix, published in 2006 by O'Reilly Media. It was released as a retitled second edition of Learning Perl Objects, References & Modules () by Schwartz and Phoenix, published by O'Reilly Media in 2003 to favorable reviews. A second edition of Intermediate Perl was released in 2012.
Intermediate Perl is a follow-up to Learning Perl. Just as Learning Perl features a llama on its cover, its follow-up features an alpaca. For this reason, they are sometimes referred to as, respectively, "the llama book" and "the alpaca book".
This book is written in very much the same style as its predecessor. It picks up right where Learning Perl left off, and takes the reader from the most basic features of Perl references all the way through to creating Perl modules and distributing them to CPAN.
Editions
First edition (2006; )
Second edition (2012; )
References
External links
O'Reilly Catalog: Learning Perl Objects, References & Modules
O'Reilly Catalog: Intermediate Perl, 2nd Edition
2003 non-fiction books
O'Reilly Media books
Books about Perl |
https://en.wikipedia.org/wiki/Darwinia%20%28video%20game%29 | Darwinia is a 2005 real-time tactics and real-time strategy video game for Microsoft Windows, Mac OS X and Linux. It is the second game developed by Introversion Software, and is set within a computer environment that simulates artificial intelligence. It received favourable reviews and won three awards at the 2006 Independent Games Festival. A multiplayer sequel, Multiwinia, was released for Windows in 2008. Darwinia and Multiwinia were released together as Darwinia+ for the Xbox 360 in 2010.
Plot
Darwinia was created as a digital theme world for artificially intelligent polygons by Dr. Sepulveda. Housed in a massive network of surplus Protologic 68000 machines from the 1980s, Darwinia is a world where the single-poly Darwinians, with their simple, but growing AI, can grow and evolve. Darwinia is also where the world can visit to see them frolicking in their natural, fractal habitat. A Darwinian lives a life working and growing, until the eventual death of the Darwinian, which releases their digital soul to later be reincarnated.
However, the player arrives in the midst of an emergency. Darwinia has been infected by a computer virus, and Sepulveda is in near panic, watching decades of research being corrupted and being used up. Sepulveda enlists the player, a curious hacker who stumbled across Darwinia by accident, to aid him in rescuing the Darwinians and drive off the computer virus. The player is given access to the combat programs, simple tools that originally began as mini-games. These are now the only means of attack against the virus. As the player progresses, it soon becomes clear this is not enough, and that triggers the third aspect of the gameplay, which is evolution.
The first two levels of the video game act as an introduction and allow the player to familiarize themselves with the controls. After that, Dr. Sepulveda begins assigning tasks that span several levels to achieve a long-term objective. The first task involves clearing the virus population from and reactivating the Mines and Power Generator to provide resources for the Construction Yard. Once done, the Yard begins producing armored units, allowing the player to move on. The next task involves the reincarnation of Darwinians: the Soul Repository in the center of Darwinia collects the floating souls, and sends them down to the Receiver, where the Darwinians gather them and send them to the Pattern Buffer to be reprogrammed with the main Darwinian blueprint code, where they are sent to the Biosphere to be reborn. The player must clear the Viruses from all the facilities and reactivate them.
In the final level of the game, Sepulveda traces the Viral infection back to its source, which is e-mail spam. After Sepulveda had accidentally flashed an image of his face across the skies of Darwinia, The Darwinians had assumed him to be God. They then re-aligned a portal inside Darwinia in an attempt to communicate with God. The Darwinians managed to access Sepulveda's computer, d |
https://en.wikipedia.org/wiki/Hidden%20text | Hidden text is computer text that is displayed in such a way as to be invisible or unreadable. Hidden text is most commonly achieved by setting the font colour to the same colour as the background, rendering the text invisible unless the user highlights it.
Hidden text can serve several purposes. Often, websites use it to disguise spoilers for readers who do not wish to read that text. Hidden text can also be used to hide data from users who are less Internet-experienced or who are not familiar with a particular website. Another meaning may refer to hidden text to small messages at the bottom of advertisements that are permitted by some law to state a particular liability or requirement in text (also known as fine print). An example of this practice is to display an FTP password in hidden text to reduce the number of users who are able to access downloads and thereby save bandwidth. Parody sites (such as Uncyclopedia) occasionally use the technique as a joke about censorship, with the "censored" text displayed black-on-black in an obvious manner akin to a theatrical stage whisper.
It is also used by websites as a spamdexing technique to fill a page with keywords that a search engine will recognize but are not visible to a visitor. However, Google has taken steps to prevent this by parsing the color of text as it indexes it and checking to see if it is transparent, and may penalize pages and give them lower rankings.
Conversely, Project Honey Pot uses links intended only to be followed by spambots; the links point to honeypots which detect e-mail address harvesting. A link using rel="nofollow" (to hide it from legitimate search engine spiders) and hidden text (to remove it for human visitors) would remain visible to malicious 'bots.
Compare with metadata, which is usually also hidden, but is used for different purposes.
Hidden characters are characters that are required for computer text to render properly but which are not a part of the content, so they are hidden. This includes characters such as those used to add a new line of text or to add space between words, commonly referred to as "white space characters".
See also
Comment (computer programming)
White fonting
References
Internet terminology |
https://en.wikipedia.org/wiki/Warcraft%3A%20The%20Roleplaying%20Game | Warcraft: The Roleplaying Game was a role-playing game line published by Sword & Sorcery Studios. It was based on the Warcraft computer games and set on Azeroth.
Second Edition
In 2005, White Wolf Publishing released a second edition of the game rules and renamed the series World of Warcraft: The Roleplaying Game to tie in with the success of World of Warcraft.
Reviews
Coleção Dragon Slayer
References
External links
Fantasy role-playing games
Role-playing games based on video games
Role-playing games introduced in 2003
Warcraft games
White Wolf Publishing games
D20 System |
https://en.wikipedia.org/wiki/Divide-and-conquer%20eigenvalue%20algorithm | Divide-and-conquer eigenvalue algorithms are a class of eigenvalue algorithms for Hermitian or real symmetric matrices that have recently (circa 1990s) become competitive in terms of stability and efficiency with more traditional algorithms such as the QR algorithm. The basic concept behind these algorithms is the divide-and-conquer approach from computer science. An eigenvalue problem is divided into two problems of roughly half the size, each of these are solved recursively, and the eigenvalues of the original problem are computed from the results of these smaller problems.
Here we present the simplest version of a divide-and-conquer algorithm, similar to the one originally proposed by Cuppen in 1981. Many details that lie outside the scope of this article will be omitted; however, without considering these details, the algorithm is not fully stable.
Background
As with most eigenvalue algorithms for Hermitian matrices, divide-and-conquer begins with a reduction to tridiagonal form. For an matrix, the standard method for this, via Householder reflections, takes floating point operations, or if eigenvectors are needed as well. There are other algorithms, such as the Arnoldi iteration, which may do better for certain classes of matrices; we will not consider this further here.
In certain cases, it is possible to deflate an eigenvalue problem into smaller problems. Consider a block diagonal matrix
The eigenvalues and eigenvectors of are simply those of and , and it will almost always be faster to solve these two smaller problems than to solve the original problem all at once. This technique can be used to improve the efficiency of many eigenvalue algorithms, but it has special significance to divide-and-conquer.
For the rest of this article, we will assume the input to the divide-and-conquer algorithm is an real symmetric tridiagonal matrix . Although the algorithm can be modified for Hermitian matrices, we do not give the details here.
Divide
The divide part of the divide-and-conquer algorithm comes from the realization that a tridiagonal matrix is "almost" block diagonal.
The size of submatrix we will call , and then is . Note that the remark about being almost block diagonal is true regardless of how is chosen (i.e., there are many ways to so decompose the matrix). However, it makes sense, from an efficiency standpoint, to choose .
We write as a block diagonal matrix, plus a rank-1 correction:
The only difference between and is that the lower right entry in has been replaced with and similarly, in the top left entry has been replaced with .
The remainder of the divide step is to solve for the eigenvalues (and if desired the eigenvectors) of and , that is to find the diagonalizations and . This can be accomplished with recursive calls to the divide-and-conquer algorithm, although practical implementations often switch to the QR algorithm for small enough submatrices.
Conquer
The conquer part of the alg |
https://en.wikipedia.org/wiki/Line%20Mode%20Browser | The Line Mode Browser (also known as LMB, WWWLib, or just www) is the second web browser ever created.
The browser was the first demonstrated to be portable to several different operating systems.
Operated from a simple command-line interface, it could be widely used on many computers and computer terminals throughout the Internet.
The browser was developed starting in 1990, and then supported by the World Wide Web Consortium (W3C) as an example and test application for the libwww library.
History
One of the fundamental concepts of the "World Wide Web" projects at CERN was "universal readership". In 1990, Tim Berners-Lee had already written the first browser, WorldWideWeb (later renamed to Nexus), but that program only worked on the proprietary software of NeXT computers, which were in limited use. Berners-Lee and his team could not port the WorldWideWeb application with its features—including the graphical WYSIWYG editor— to the more widely deployed X Window System, since they had no experience in programming it. The team recruited Nicola Pellow, a math student intern working at CERN, to write a "passive browser" so basic that it could run on most computers of that time.
The name "Line Mode Browser" refers to the fact that, to ensure compatibility with the earliest computer terminals such as Teletype machines, the program only displayed text, (no images) and had only line-by-line text input (no cursor positioning).
Development started in November 1990 and the browser was demonstrated in December 1990.
The development environment used resources from the PRIAM project, a French language acronym for "PRojet Interdivisionnaire d'Assistance aux Microprocesseurs", a project to standardise microprocessor development across CERN.
The short development time produced software in a simplified dialect of the C programming language. The official standard ANSI C was not yet available on all platforms.
The Line Mode Browser was released to a limited audience on VAX, RS/6000 and Sun-4 computers in March 1991. Before the release of the first publicly available version, it was integrated into the CERN Program Library (CERNLIB), used mostly by the High-Energy Physics-community. The first beta of the browser was released on 8 April 1991. Berners-Lee announced the browser's availability in August 1991 in the alt.hypertext newsgroup of Usenet.
Users could use the browser from anywhere in the Internet through the telnet protocol to the info.cern.ch machine (which was also the first web server).
The spreading news of the World Wide Web in 1991 increased interest in the project at CERN and other laboratories such as DESY in Germany, and elsewhere throughout the world.
The first stable version, 1.1, was released in January 1992. Since version 1.2l, released in October 1992, the browser has used the common code library (later called libwww). The main developer, Pellow, started working on the MacWWW project, and both browsers began to share some source code. In the Ma |
https://en.wikipedia.org/wiki/Single%20instruction%2C%20single%20data | In computing, single instruction stream, single data stream (SISD) is a computer architecture in which a single uni-core processor executes a single instruction stream, to operate on data stored in a single memory. This corresponds to the von Neumann architecture.
SISD is one of the four main classifications as defined in Flynn's taxonomy. In this system, classifications are based upon the number of concurrent instructions and data streams present in the computer architecture. According to Michael J. Flynn, SISD can have concurrent processing characteristics. Pipelined processors and superscalar processors are common examples found in most modern SISD computers.
Instructions are sent to the control unit from the memory module and are decoded and sent to the processing unit which processes on the data retrieved from memory module and sends back to it.
References
Flynn's taxonomy
SISD |
https://en.wikipedia.org/wiki/Theophilus%20Presbyter | Theophilus Presbyter (fl. c. 1070–1125) is the pseudonymous author or compiler of a Latin text containing detailed descriptions of various medieval arts, a text commonly known as the Schedula diversarum artium ("List of various arts") or De diversis artibus ("On various arts"), probably first compiled between 1100 and 1120. The oldest manuscript copies of the work are found in Vienna (Austrian National Library, Codex 2527) and in Wolfenbüttel (Herzog-August-Bibliothek, Cod. Guelf. Gud. Lat. 69 2°). Gotthold Ephraim Lessing rediscovered the document when he worked as librarian in Wolfenbüttel, and published excerpts in 1774. These aroused great interest as they disproved Vasari's myth of Jan van Eyck developing the technique of oil painting in the early 15th century, about which antiquaries had already become suspicious.
Theophilus' Schedula allows detailed insights into the techniques used in the applied arts in the high Middle Ages. The work is divided into three books. The first covers the production and use of painting and drawing materials (painting techniques, paints, and ink), especially for illumination of texts and painting of walls. The second deals with the production of stained glass and techniques of glass painting, while the last deals with various techniques of goldsmithing and other metalwork. It also includes an introduction into the building of organs. Theophilus contains perhaps the earliest reference to oil paint. The work has been translated into English, French, Polish, Portuguese, Spanish, Hungarian, German, Italian, Japanese, Bulgarian, and Russian, mostly in the 19th and 20th centuries.
'Theophilus' was quite possibly a Benedictine monk. It has been suggested (particularly by ) that Theophilus is the same person as the artisan monk Roger of Helmarshausen. Roger appears to have come from Stavelot Abbey in the Meuse River region, was active as an artist and author between 1100 and 1107 in St. Pantaleon's church in Cologne, and moved to Helmarshausen Abbey in 1107. The identity of the two men has been argued among researchers for some time, but Freise's conclusions have not yet been accepted by all researchers. Other suggestions have also been made, and at present there can not be said to be a consensus.
Theophilus, as the author of a "handbook", has been described as a mere theorist, but this view is currently in the minority. The First Book, on painting, is not particularly well-informed, but adequately reliable, the Second, on glass, is better, while most of the Third Book is clearly the work of a practising metalworker. It has recently been suggested that the apparent contradictory evidence as to dating, practical experience, and location of 'Theophilus' is best explained if the Schedula is understood to be a compilation.
Works
De diversis artibus or Schedula diversarum artium (in three books, date controversial but ca. 1125)
Two editions of Theophilus's work with English translations:
Dodwell, C. R. The Various A |
https://en.wikipedia.org/wiki/3D%20Monster%20Maze | 3D Monster Maze is a survival horror computer game developed from an idea by J.K. Greye and programmed by Malcolm Evans and released in 1981 for the Sinclair ZX81 platform with the 16 KB memory expansion. The game was initially released by J. K. Greye Software in December 1981 and re-released in 1982 by Evans' own startup, New Generation Software. Rendered using low-resolution character block "graphics", it was one of the first 3D games for a home computer, and one of the first games incorporating typical elements of the genre that would later be termed survival horror.
3D Monster Maze puts the player in a maze with one exit and a hostile monster, the Tyrannosaurus rex. There, the player must traverse the maze, from the first-person perspective, and escape through the exit without being eaten.
J.K.Greye Software went on to become a very successful games company, publishing six Game Tapes for the Sinclair ZX81; two use 3D graphics: 3D Monster Maze and 3D Defender, both designed by J.K.Greye and programmed by Malcolm Evans.
New Generation Software went on to become a well-known software firm with the Sinclair platform and continued to pioneer the 3D gaming technology for ZX81 and the later model ZX Spectrum. The press immediately gave the game a title of a "firm favourite" of the ZX81 users. Decades later, it became popular with the retrogaming community, inspiring remakes and fuelling ZX81 emulation projects.
Gameplay
The game uses an 18-by-16 cell maze which is randomly generated. Initially the T. rex lies in wait. Once the player starts moving, the beast begins hunting. Thereafter, the T. rex may either calm down (if the player goes into a part of the maze that is far enough away), or become more active as the player comes closer. If the T. rex gets a direct view of its prey, the monster will run directly at the player.
The T. rex anxiety level, reported to the player as a statement in the status line, provides an indirect clue to the player's relative distance from the monster. These statements are: REX LIES IN WAIT, followed by HE IS HUNTING FOR YOU, FOOTSTEPS APPROACHING, REX HAS SEEN YOU, and RUN HE IS BESIDE YOU or RUN HE IS BEHIND YOU. The player's speed is greater than the monster's, thus it is possible to escape by running (unless the player is trapped in a dead end). The player can manually map the maze on a piece of paper with each step, but this becomes increasingly difficult as the pace increases. The fast pace can also lead to hard keyboard presses, which, in turn, can shake the computer/16K memory expansion connection, and lead to a sudden reset with several minutes worth reload time.
Points are awarded for each step made by the player any time the dinosaur is on an active hunt. Since the player runs faster than the monster, it is possible to accumulate points by running around in circles with the monster just a few steps behind. Points are also given upon successfully getting away through an exit and into another maze.
Whe |
https://en.wikipedia.org/wiki/Dusky%20Sound | Tamatea / Dusky Sound is a fiord on the southwest corner of New Zealand, in Fiordland National Park.
Geography
{ "type": "ExternalData", "service": "geoshape", "ids": "Q1048789", "properties": { "fill": "#0050d0"}}
One of the most complex of the many fiords on this coast, it is also the largest at 40 kilometres in length and eight kilometres wide at its widest point. To the north of its mouth is the large Resolution Island, whose Five Fingers Peninsula shelters the mouth of the sound from the northwest; along the east coast of the island, Acheron Passage connects Dusky Sound with Breaksea Sound, to the north.
Several large islands lie in the sound, notably Anchor Island, Long Island, and Cooper Island. The upper reaches of the sound are steep-sided, and the high precipitation of the region leads to hundreds of waterfalls cascading into the sound during the rainy season. Seals and dolphins are often sighted in the sound's waters and occasionally visited by whales where the area especially nearby Preservation Inlet was one of earliest shore-based whaling ground for southern right whales, while humpback whales show sudden increases. The Seaforth River is the largest of many small rivers and creeks which flow into the sound.
At its mouth, the sound is wide, and is bordered by the Five Fingers Peninsula to the north and by South Cape and Fannin Bay in the south. The south Island's westernmost point, West Cape lies less than 10 kilometres south of the sound's mouth. Immediately inside the sound's mouth lies the large Anchor Island and numerous small islets, among them the Seal, Petrel, and Many Island groups. To the north of Anchor Island lies Resolution Island, and here its coast in indented by a large triangular cove which separates the Five Fingers Peninsula from the rest of the island. A number of small coves punctuate this coast, including Goose Cove and Earshell Cove. Immediately to the southeast of Anchor Island lies the smaller Indian Island.
To the east of Anchor Island, the sound narrows to about five kilometres and splits into two broad channels, separated by the aptly named Long Island, which stretches for some 15 kilometres in length but is only around 2000 metres wide at its widest point. The narrower of the two channels, Cook Channel, lies to the south of Long Island; Bowen Channel lies to the north. Bowen Channel links with Acheron Passage, a north–south channel which separates Resolution Island from the mainland and links with Breaksea Sound to the north.
Inland from Long Island lies Cooper Island, about eight kilometres long and up to five kilometres wide. Dusky Sound narrows to the east of Cooper Island, reaching its end in two small coves, Shark Cove and Supper Cove. The Seaforth River flows into the eastern end of Supper Cove.
Important Bird Area
The sound has been identified as an Important Bird Area by BirdLife International because it is a breeding site for Fiordland penguins.
History
It is believed that Māori occasional |
https://en.wikipedia.org/wiki/Edoc | EDOC is an abbreviation for multiple terms:
Encuentros del Otro Cine, an international documentary film festival held annually in Ecuador
Enterprise Distributed Object Computing, a standard of the Object Management Group
Edoc is short for "electronic document". It is a slang term for an etext |
https://en.wikipedia.org/wiki/Covariance%20and%20contravariance%20%28computer%20science%29 | Many programming language type systems support subtyping. For instance, if the type is a subtype of , then an expression of type should be substitutable wherever an expression of type is used.
Variance is how subtyping between more complex types relates to subtyping between their components. For example, how should a list of s relate to a list of s? Or how should a function that returns relate to a function that returns ?
Depending on the variance of the type constructor, the subtyping relation of the simple types may be either preserved, reversed, or ignored for the respective complex types. In the OCaml programming language, for example, "list of Cat" is a subtype of "list of Animal" because the list type constructor is covariant. This means that the subtyping relation of the simple types is preserved for the complex types.
On the other hand, "function from Animal to String" is a subtype of "function from Cat to String" because the function type constructor is contravariant in the parameter type. Here, the subtyping relation of the simple types is reversed for the complex types.
A programming language designer will consider variance when devising typing rules for language features such as arrays, inheritance, and generic datatypes. By making type constructors covariant or contravariant instead of invariant, more programs will be accepted as well-typed. On the other hand, programmers often find contravariance unintuitive, and accurately tracking variance to avoid runtime type errors can lead to complex typing rules.
In order to keep the type system simple and allow useful programs, a language may treat a type constructor as invariant even if it would be safe to consider it variant, or treat it as covariant even though that could violate type safety.
Formal definition
Suppose A and B are types, and I<U> denotes application of a type constructor I with type argument U.
Within the type system of a programming language, a typing rule for a type constructor I is:
covariant if it preserves the ordering of types (≤), which orders types from more specific to more generic: If A ≤ B, then I<A> ≤ I<B>;
contravariant if it reverses this ordering: If A ≤ B, then I<B> ≤ I<A>;
bivariant if both of these apply (i.e., if A ≤ B, then I<A> ≡ I<B>);
variant if covariant, contravariant or bivariant;
invariant or nonvariant if not variant.
The article considers how this applies to some common type constructors.
C# examples
For example, in C#, if is a subtype of , then:
is a subtype of . The subtyping is preserved because is covariant on .
is a subtype of . The subtyping is reversed because is contravariant on .
Neither nor is a subtype of the other, because is invariant on .
The variance of a C# generic interface is declared by placing the (covariant) or (contravariant) attribute on (zero or more of) its type parameters. The above interfaces are declared as , , and . Types with more than one type parameter may specify different v |
https://en.wikipedia.org/wiki/Sunrise%20%28Australian%20TV%20program%29 | Sunrise is an Australian breakfast show program. It is broadcast on the Seven Network, and is currently hosted by Natalie Barr and Matt Shirvington. The program follows Seven Early News, and runs from 5:30 am to 9:00 am. It is followed by The Morning Show.
History
The history of Sunrise can be traced back to 14 January 1991 when 11AM news presenter Darren McDonald began presenting an early morning Seven News – Sunrise Edition bulletin prior to hostilities breaking out during the Gulf War.
In 1996, Seven introduced a one-hour weekday bulletin called Sunrise News, later renamed Sunrise. Seven recruited Chris Bath from NBN Television to present the bulletin alongside Peter Ford. Ford moved to other presenting roles in 1996 and was replaced by finance editor David Koch. In 1997, Chris Bath was transferred to Seven's 10.30 pm News and was replaced by Melissa Doyle. Sport presenter Nick McArdle and reporter Natalie Barr were regular substitute presenters. Seven launched a Sunday edition hosted by Stan Grant, entitled Sunday Sunrise, in 1997. Weekday Sunrise was cancelled in 1999, replaced by children's program The Big Breakfast. Seven maintained half-hourly news updates during The Big Breakfast and their Sunday bulletin was not affected by the axing. Other temporary Sunrise hosts up until this time include Anne Fulwood (who was filling in for Georgie Gardner at the time of the program's end), Leigh Hatcher and Nick McArdle (previously weekend sport presenter, Seven News Sydney).
During the 2000 Summer Olympics, Andrew Daddo and Johanna Griggs presented Olympic Sunrise from a leased apartment near Lavender Bay, in Sydney which provided the Sydney Harbour Bridge and Sydney Opera House as waterside backdrops.
On 1 May 2000, the program was replaced by a new version of Sunrise produced by Adam Boland. It was hosted by Georgie Gardner and Melbourne sport reporter Mark Beretta. It was followed by music video program AMV.
According to Boland's Brekky Central, in late 2001 producers had created a plan to take on Today on the Nine Network, the leader at breakfast, taking inspiration from Fox America's Fox and Friends. Set to debut in March 2002, the multimillion-dollar production would have its own dedicated studio and fronted by Australian Radio personality Andrew Daddo and Lisa Forrest. However a month before its launch, the network's board axed the idea and believed money could be better spent.
In 2002, Seven revamped their breakfast television schedule with Seven Early News at 6:00 am, hosted by Chris Reason (which only lasted around one week), and a new version of Sunrise from 6:30 am to 9:00 am, hosted by Reason and Melissa Doyle. Sunrise ran from 6:00 am to 9:00 am from February the same year. David Koch was brought in to present the finance reports. In October of that year, Reason discovered he had another cancerous tumour behind his kidney and had to resign from his position. Four years earlier he had undergone treatment for another growth. Koch |
https://en.wikipedia.org/wiki/CTWM | In Unix computing, CTWM (Claude's Tab Window Manager) is a stacking window manager for the X Window System in the twm family of window managers. It was created in 1992 by Claude Lecommandeur from the source code for twm, which he extended to allow for virtual desktops ("workspaces" in CTWM's terminology.)
Features
Features of the CTWM window manager include:
Stacking windows
Written in C
Support for up to 32 virtual desktops
Advanced icon management
Animated icons and backgrounds
Customizable
3d titles and borders
Freely distributable under the MIT License
Basic EWMH support (as of 4.0.0)
Backwards-compatibility with twm.
XPM and JPEG images
References
External links
Free X window managers
Software using the MIT license |
https://en.wikipedia.org/wiki/ARC%20International | ARC International may refer to:
ARC (processor), the Argonaut RISC Core, a series of embedded computer processors developed by ARC International PLC
Synopsys ARC, the developer of the ARC embedded processor series
Arc International, a privately held French housewares company |
https://en.wikipedia.org/wiki/Diameter%20%28protocol%29 | Diameter is an authentication, authorization, and accounting protocol for computer networks. It evolved from the earlier RADIUS protocol. It belongs to the application layer protocols in the internet protocol suite.
Diameter Applications extend the base protocol by adding new commands and/or attributes, such as those for use with the Extensible Authentication Protocol (EAP).
Comparison with RADIUS
The name is a play on words, derived from the RADIUS protocol, which is the predecessor (a diameter is twice the radius). Diameter is not directly backward compatible but provides an upgrade path for RADIUS. The main features provided by Diameter but lacking in RADIUS are:
Support for SCTP
Capability negotiation
Application layer acknowledgements; Diameter defines failover methods and state machines (RFC 3539)
Extensibility; new commands can be defined
Aligned on 32 bit boundaries
Also:
Like RADIUS, it is intended to work in both local and roaming AAA situations.
It uses TCP or SCTP, unlike RADIUS which uses UDP.
Unlike RADIUS it includes no encryption but can be protected by transport-level security (IPSEC or TLS).
The base size of the AV identifier is 32 bit unlike RADIUS which uses 8 bit as the base AV identifier size.
Like RADIUS, it supports stateless as well as stateful modes.
Like RADIUS, it supports application-layer acknowledgment and defines failover.
Diameter is used for many different interfaces defined by the 3GPP standards, with each interface typically defining new commands and attributes.
Applications
A Diameter Application is not a software application but is a protocol based on the Diameter base protocol defined in RFC 6733 and RFC 7075 (Obsoletes: RFC 3588). Each application is defined by an application identifier and can add new command codes and/or new mandatory AVPs (Attribute-Value Pair). Adding a new optional AVP does not require a new application.
Examples of Diameter applications:
Diameter Mobile IPv4 Application (MobileIP, RFC 4004)
Diameter Network Access Server Application (NASREQ, RFC 7155)(Obsoletes: RFC 4005)
Diameter Extensible Authentication Protocol Application (RFC 4072)
Diameter Credit-Control Application (DCCA, RFC 8506])(Obsoletes: RFC 4006)
Diameter Session Initiation Protocol Application (RFC 4740)
Various applications in the 3GPP IP Multimedia Subsystem
Both the HSS and the SLF communicate using the Diameter protocol.
(Generic Bootstrapping Architecture): Bootstrapping Server Function
History
The Diameter protocol was initially developed by Pat R. Calhoun, Glen Zorn, and Ping Pan in 1998 to provide a framework for authentication, authorization, and accounting (AAA) that could overcome the limitations of RADIUS. RADIUS had issues with reliability, scalability, security, and flexibility. RADIUS cannot deal effectively with remote access, IP mobility, and policy control. The Diameter protocol defines a policy protocol used by clients to perform Policy, AAA, and resource control. This allows |
https://en.wikipedia.org/wiki/List%20of%20programmes%20broadcast%20by%20TG4 | This is a list of current and former television programmes broadcast on TG4 and its children's programming block Cúla4.
Current programming
Chat
7 Lá
Ardán
Children's
Adventure Time
ALVINNN!!! and the Chipmunks
Astroblast!
AstroKids
Balloon Barnyard
Best Sports Ever
Big Block SingSong
Big Bear and Squeak
Breadwinners
Calimero
Camp Lakebottom
Captain Flinn and the Pirate Dinosaurs
The Cat in the Hat Knows a Lot About That!
Chloe's Closet
Clarence
Clifford the Big Red Dog
Curious George
Daisy & Ollie
Dee Dee The Little Sorceress
Dennis and Gnasher
The Dog & Pony Show
Dora the Explorer
Dot.
Dinosaur Train
Earth to Luna!
Elias: The Little Rescue Boat
Ella Bella Bingo
Esme & Roy
Everybody Loves Moose
Fanboy & Chum Chum
Fangbone!
Florrie's Dragons
Go, Diego, Go!
Helen's Little School
Heroes of Envell
Horrid Henry (as Dónal Dána)
Igam Ogam
Inis Cúil
Inspector Gadget (2015)
Inui
Jamie's Got Tentacles
Johnny Test
The Jungle Bunch
Kid-E-Cats
Kioka
Let's Play
Little Tournament Over Yonder AdventuresMasha and the BearMaya the BeeMessy Goes to OkidoMiraculous: Tales of Ladybug and Cat NoirMoukNature Cat (as Cat Cliste)Numb ChucksNumberblocks (as Blocuimhreacha)OliviaOlive The OstrichOlly the Little White VanOlobob TopOswaldoPajanimalsPat the DogPeg + CatPJ MasksThe Polos (as Na Polos)PocoyoPunkyQ Pootle 5Raa Raa the Noisy LionRanger RobRekkit RabbitRev & RollRita & CrocodileRoad to AvonleaSadie SparksSantiago of the SeasSaol Faoi ShráidScaredy SquirrelSchool of RoarsSíleSpace Chickens in SpaceSpace RacersSkunk FuSpongeBob SquarePantsT.U.F.F. PuppyTaffyTeam UmizoomiThat's JoeyTickety TocTimmy TimeToonMartyTrue and the Rainbow KingdomWanda and the AlienWinston Steinburger and Sir Dudley Ding DongWissperWoozle and PipWussywat the Clumsy CatZack and QuackZak JinksZouComedyC.U. BurnFear an PhoistFFCGleann CeoThe Golden GirlsLuí na GréineSouth ParkThe WaltonsThe Wonder YearsDatingEochair an ghráPaisean FaiseanDocumentaryAg Trasnú an Atlantaigh DhuibhÁr gClubBádóiríBean an TíCeolchuairtCogarÉalúAn Fhidil Bheo - Ceol an Northern FiddlerFíorscéalMéirlighNo BéarlaScothfhoirneSeal le DáithíTabúWwoofáilThar SáileTimpeall na TíreTríd an LionsaUachtaráinDramaAifricThe Almighty JohnsonsBorgenBetter Call SaulFriday Night LightsGilmore GirlsThe KillingMurder, She WroteNashvilleRos na RúnSeacht / SevenThe Vampire DiariesHistoryCartaí PoistÉire NeodrachSéideán StaireSiar Sna…MusicFloscGeantraíGradam Ceoil TG4HupIs Maith liom PopNollaig No. 1Réalta agus GaoltaScór Encore'Sé mo LaochSlí na mBeaglaoichTradFestNewsEuronewsFrance 24Nuacht TG4SportGAA BeoRugbaí BeoSacar BeoUnderdogsWimbledon BeoTravelAmú le HectorHecor i MeiriceáHector san AfraicHector san AstráilNeeloFormer programming8 Simple Rules (comedy)America's Next Top Model (reality)Amú Amigos (travel)An Audience with Billy Connolly (comedy)Angela Anaconda (children's)Angelo Rules (children's)Animal Mechanicals (children's)The Animals of Farthing Wood (children's) (Original English voices can be still screened on RTÉ)An |
https://en.wikipedia.org/wiki/Selection%20%28genetic%20algorithm%29 | Selection is the stage of a genetic algorithm or more general evolutionary algorithm in which individual genomes are chosen from a population for later breeding (e.g., using the crossover operator). Selection mechanisms are also used to choose candidate solutions (individuals) for the next generation. Retaining the best individuals in a generation unchanged in the next generation, is called elitism or elitist selection. It is a successful (slight) variant of the general process of constructing a new population.
A selection procedure for breeding used early on may be implemented as follows:
The fitness values that have been computed (fitness function) are normalized, such that the sum of all resulting fitness values equals 1.
Accumulated normalized fitness values are computed: the accumulated fitness value of an individual is the sum of its own fitness value plus the fitness values of all the previous individuals; the accumulated fitness of the last individual should be 1, otherwise something went wrong in the normalization step.
A random number R between 0 and 1 is chosen.
The selected individual is the first one whose accumulated normalized value is greater than or equal to R.
For many problems the above algorithm might be computationally demanding. A simpler and faster alternative uses the so-called stochastic acceptance.
If this procedure is repeated until there are enough selected individuals, this selection method is called fitness proportionate selection or roulette-wheel selection. If instead of a single pointer spun multiple times, there are multiple, equally spaced pointers on a wheel that is spun once, it is called stochastic universal sampling.
Repeatedly selecting the best individual of a randomly chosen subset is tournament selection. Taking the best half, third or another proportion of the individuals is truncation selection.
There are other selection algorithms that do not consider all individuals for selection, but only those with a fitness value that is higher than a given (arbitrary) constant. Other algorithms select from a restricted pool where only a certain percentage of the individuals are allowed, based on fitness value.
Methods of Selection (Evolutionary Algorithm)
The listed methods differ mainly in the selection pressure, which can be set by a strategy parameter in the rank selection described below. The higher the selection pressure, the faster a population converges against a certain solution and the search space may not be explored sufficiently. For more selection methods and further detail see.
Roulette Wheel Selection
In the roulette wheel selection, the probability of choosing an individual for breeding of the next generation is proportional to its fitness, the better the fitness is, the higher chance for that individual to be chosen.
Choosing individuals can be depicted as spinning a roulette that has as many pockets as there are individuals in the current generation, with sizes depending on their probabi |
https://en.wikipedia.org/wiki/AWStats | AWStats (Advanced Web Statistics) is an open source Web analytics reporting tool, suitable for analyzing data from Internet services such as web, streaming media, mail, and FTP servers. AWStats parses and analyzes server log files, producing HTML reports. Data is visually presented within reports by tables and bar graphs. Static reports can be created through a command line interface, and on-demand reporting is supported through a Web browser CGI program.
AWStats supports most major web server log file formats including Apache (NCSA combined/XLF/ELF log format or Common Log Format (CLF)), WebStar, IIS (W3C log format), and many other common web server log formats.
Development was moved from SourceForge to GitHub in 2014.
Cross-platform availability
Written in Perl, AWStats can be deployed on almost any operating system. It is a server-based website log analysis tool, with packages available for most Linux distributions. AWStats can be installed on a workstation, such as Microsoft Windows, for local use in situations where log files can be downloaded from a remote server.
Licensing
AWStats is licensed under the GNU General Public License (GPL).
Support
Proper web log analysis tool configuration and report interpretation requires a bit of technical and business knowledge. AWStats support resources include documentation and user community forums
Security considerations
The on-demand CGI program has been the object of security exploits, as is the case of many CGI programs. Organizations wishing to provide public access to their Web analytics reports should consider generating static HTML reports. The on-demand facility can still be used by restricting its use to internal users. Precautions should be taken against referrer spam. Referrer spam filtering functionality was added in version 6.5.
See also
List of web analytics software
References
External links
Official Website
Free software programmed in Perl
Free web analytics software
Perl software
Web analytics
Web log analysis software
Web technology |
https://en.wikipedia.org/wiki/Class%20A | Class A may refer to:
Communications technology
Class-A amplifier, a category of electronic amplifier
Class A network, in Internet technology, a type of large network
Class A television service, a system for regulating low power stations in the United States
Sports
Class A (baseball), a level of American Minor League Baseball
Class A (classification), a Paralympic wheelchair fencing classification
Transportation
Class A airfield, a type of World War II British military installation
Class A surface, in automotive design
Milwaukee Road class A, a class of steam locomotives
Norfolk and Western Railway class A, a class of steam locomotives
Class A, a type of commercial driver's license in the United States
Class A, an ICAO airspace class
Class A, a type of motorhome
Other uses
Class A (novel), a 2004 CHERUB novel by Robert Muchamore
Class A drug, a classification of drugs controlled by the UK Misuse of Drugs Act
Class A office space, a Building Owners and Managers Association category
Library of Congress Classification:Class A -- General Works
Class A, a stellar classification
Class A, a retired type of United States Army Service Uniform
Class A foams, a type of foam used in firefighting
See also
A class (disambiguation)
Class B (disambiguation) |
https://en.wikipedia.org/wiki/Class%20E | Class E may refer to:
Science and technology
Class E amplifier, a power amplifier class in electronics
Class E addresses, in a classful network, a type of Internet Protocol IP address
Class E, twisted pair structured cabling system in the ISO/IEC 11801 standard
Other uses
Class E, an airspace class as defined by the ICAO
Class E, a driver's license
Class E felony, a category of crime in the US
See also
E class (disambiguation)
Class (disambiguation)
E (disambiguation)
E-Type (disambiguation)
Model E (disambiguation) |
https://en.wikipedia.org/wiki/Nine%20Television | Nine Television is the television arm of Nine Entertainment.
Channels
Nine Network, an Australian commercial free-to-air television primary channel
9HD is an Australian free-to-air HD digital television multichannel using the primary channel simulcast
9Gem is an Australian free-to-air digital television multichannel suitable for sport and entertainment
9Go! is an Australian free-to-air digital television multichannel aimed at 14- to 39-year-olds.
9Life is an Australian free-to-air digital television multichannel featuring reality and lifestyle programs
9Rush is an Australian free-to-air digital television multichannel aimed at a 25- to 54-year-old male audience. (joint venture with Warner Bros. Discovery)
10 Darwin (50% joint venture with Southern Cross Austereo, Network 10 affiliate)
9Now a video on demand, catch-up TV service which carries the main and multichannels of the Nine Network
Production
Nine Films and Television is the in-house film and television production arm of the Nine Network.
It produces content primarily for the network and its affiliated network WIN, but also produces feature films for release in cinemas. Nine Films and Television has produced a few television programs for the network, including:
McLeod's Daughters (co-production with Southern Star)
Water Rats (co-production with Southern Star)
Getaway
Hi-5
Cushion Kids
New MacDonald's Farm
Farscape
Former productions
In Melbourne Tonight (1957-1970)
Bandstand (1958-1972)
The Graham Kennedy Show (1972, 1973-1975)
The Ernie Sigley Show (1974-1981, 1985)
The Don Lane Show (1975-1983)
The Bert Newton Show (1984)
The Midday Show (1985-1998)
Graham Kennedy’s News Show (1988)
Graham Kennedy Coast To Coast (1989)
The AFL Footy Show (1994-2019)
In Melbourne Tonight (1996-1998, only aired in Victoria, Tasmania, South Australia & Western Australia)
Micallef Tonight (2003)
TV Week Logie Awards (1967-1980, 1982, 1984, 1986, 1988, 1991, 1994, 1996-2022)
References
Television production companies of Australia
Nine Network |
https://en.wikipedia.org/wiki/Token%20bucket | The token bucket is an algorithm used in packet-switched and telecommunications networks. It can be used to check that data transmissions, in the form of packets, conform to defined limits on bandwidth and burstiness (a measure of the unevenness or variations in the traffic flow). It can also be used as a scheduling algorithm to determine the timing of transmissions that will comply with the limits set for the bandwidth and burstiness: see network scheduler.
Overview
The token bucket algorithm is based on an analogy of a fixed capacity bucket into which tokens, normally representing a unit of bytes or a single packet of predetermined size, are added at a fixed rate. When a packet is to be checked for conformance to the defined limits, the bucket is inspected to see if it contains sufficient tokens at that time. If so, the appropriate number of tokens, e.g. equivalent to the length of the packet in bytes, are removed ("cashed in"), and the packet is passed, e.g., for transmission. The packet does not conform if there are insufficient tokens in the bucket, and the contents of the bucket are not changed. Non-conformant packets can be treated in various ways:
They may be dropped.
They may be enqueued for subsequent transmission when sufficient tokens have accumulated in the bucket.
They may be transmitted, but marked as being non-conformant, possibly to be dropped subsequently if the network is overloaded.
A conforming flow can thus contain traffic with an average rate up to the rate at which tokens are added to the bucket, and have a burstiness determined by the depth of the bucket. This burstiness may be expressed in terms of either a jitter tolerance, i.e. how much sooner a packet might conform (e.g. arrive or be transmitted) than would be expected from the limit on the average rate, or a burst tolerance or maximum burst size, i.e. how much more than the average level of traffic might conform in some finite period.
Algorithm
The token bucket algorithm can be conceptually understood as follows:
A token is added to the bucket every seconds.
The bucket can hold at the most tokens. If a token arrives when the bucket is full, it is discarded.
When a packet (network layer PDU) of n bytes arrives,
if at least n tokens are in the bucket, n tokens are removed from the bucket, and the packet is sent to the network.
if fewer than n tokens are available, no tokens are removed from the bucket, and the packet is considered to be non-conformant.
Variations
Implementers of this algorithm on platforms lacking the clock resolution necessary to add a single token to the bucket every seconds may want to consider an alternative formulation. Given the ability to update the token bucket every S milliseconds, the number of tokens to add every S milliseconds = .
Properties
Average rate
Over the long run the output of conformant packets is limited by the token rate, .
Burst size
Let be the maximum possible transmission rate in bytes/second.
Then is t |
https://en.wikipedia.org/wiki/Columbia%20%28supercomputer%29 | Columbia was a supercomputer built by Silicon Graphics (SGI) for the National Aeronautics and Space Administration (NASA), installed in 2004 at the NASA Advanced Supercomputing (NAS) facility located at Moffett Field in California. Named in honor of the crew who died in the Space Shuttle Columbia disaster, it increased NASA's supercomputing capacity ten-fold for the agency's science, aeronautics and exploration programs.
Missions run on Columbia include high-fidelity simulations of the Space Shuttle vehicle and launch systems, hurricane track prediction, global ocean circulation, and the physics of supernova detonations.
History
Columbia debuted as the second most powerful supercomputer on the TOP500 list in November 2004 at a LINPACK rating of 51.87 teraflops, or 51.87 trillion floating point calculations per second. By June 2007 it had dropped to 13th.
It was originally composed of 20 interconnected SGI Altix 3700 512-processor multi-rack systems running SUSE Linux Enterprise, using Intel Itanium 2 Montecito and Montvale processors. In 2006, NASA and SGI added four new Altix 4700 nodes containing 256 dual-core processors, which decreased the physical footprint and the power cost of the supercomputer. The nodes were connected with InfiniBand single and double data rate (SDR and DDR) cabling with transfer speeds of up to 10 gigabits per second.
The SGI Altix platform was selected due to a positive experience with Kalpana, a single-node Altix 512-CPU system built and operated by NASA and SGI and named after Columbia astronaut Kalpana Chawla, the first Indian-born woman to fly in space. Kalpana was later integrated into the Columbia supercomputer system as the first node of twenty.
At its peak, Columbia had a total of 10,240 processors and 20 terabytes of memory, 440 terabytes of online storage, and 10 petabytes of archival tape storage. The Project Columbia team, composed mostly of computer scientists and engineers from NAS, SGI, and Intel, were awarded the Government Computer News (GCN) Agency Award for Innovation in 2005 for deploying Columbia's original 10,240 processors in an unprecedented 120 days.
It was slowly phased out as its successors at NAS, the petascale Pleiades supercomputer and the Endeavour shared-memory system, expanded to meet with NASA's growing high-end computing needs. At the time of its decommissioning in March 2013, Columbia was made up of four nodes over 40 SGI Altix 4700 racks, containing Intel Itanium 2 Montecito and Montvale processors to make up a total of 4,608 cores with a theoretical peak of 30 teraflops and total memory of 9 terabytes.
References
External links
TOP500 Official Website
TOP500 Columbia System entry
2004 Press release from SGI
NASA supercomputers
Ames Research Center
SGI supercomputers
One-of-a-kind computers
Very long instruction word computing |
https://en.wikipedia.org/wiki/Claro | Claro or CLARO may refer to:
Companies
Claro (company) or Claro Americanas, a mobile and fixed voice and data communications company
Claro Argentina, Paraguay and Uruguay
Claro Brasil
Claro Colombia
Claro El Salvador
Claro Guatemala
Claro Jamaica
Claro Puerto Rico
Claro (Dominican Republic)
Claro fair trade, a sustainable company established by EvB and based in Switzerland
Claro TV, a Latin American operator of Pay television
Places
Claro, Switzerland, a place in the canton of Ticino
Claro Wapentake, the former district of Yorkshire
Other uses
Clarion (instrument), a medieval brass instrument also called Claro
CLARO (political party), a political party in Orihuela, Spain
Claro (surname), a surname (includes a list)
Claro TV, a Latin American pay television operator
Claro, a light-colored cigar wrapper
The wood of the Juglans hindsii, sometimes called claro walnut
See also
Claros, an ancient Greek sanctuary on the coast of Ionia, Greece
Rio Claro (disambiguation)
Clairo (born 1998), American lo-fi musician |
https://en.wikipedia.org/wiki/Getaway%20%28TV%20series%29 | Getaway is Australia's longest-running travel and lifestyle television program. Debuting on 14 May 1992, it is broadcast on the Nine Network and TLC. Its main competitor was The Great Outdoors on the Seven Network until 2009.
The first season looked at only tourism locally, including resorts and locations, but by 1993 had expanded to look at international travel and tourism destinations.
Presenters
Catriona Rowntree (1996–present)
David Reyne (1992–1993, 1996–present)
Charli Robinson (2003–present)
Jason Dundas (2006–present)
Tim Blackwell (2015–present)
Livinia Nixon (2012–present)
Guest Presenters
Amber Lawrence
Lauren Phillips
Samantha McClymont
Anna Gare
Ian 'Dicko' Dickson
Jesinta Franklin
Ray Martin
David Genat
Renee Bargh and Sussan Mourad
Nicky Buckley
Caroline Pemberton
David Adams
Rebecca Johns
Kathy Lette and Jane Turner
David Whitehill
Lincoln Lewis
Charlie Clausen
Evelyn Ellis and Duncan James
Poh Ling Yeow
Former Presenters
Kelly Landry (2008–2011)
Natalie Gruzlewski (2004–2014)
Sophie Monk (2010–2011)
Kate Ceberano (2011–2021)
Jennifer Hawkins (2011–2019)
Dermott Brereton (2007–2011)
Giaan Rooney (2008–2012)
Jules Lund (2004–2012)
Henry Azaris (2003–2007)
Ben Dark (1999–2010)
Erik Thomson (2006–2007)
Jodhi Meares (2006)
Megan Gale (2005–2006)
Brendon Julian (2004–2005)
Sorrel Wilby (1996–2005)
Lochie Daddo (1994–1999)
Jeff Watson (1992–1998)
Rebecca Harris (1992–1997)
Chrissy Morrisey (1995)
Jane Rutter (1994)
Tina Dalton (1992–1993)
Anna McMahon (1992–1993)
Awards
Getaway won a People's Choice Award in 1994 and an Australian Tourism Award for Excellence in the Media in 1995.
Getaway has also been nominated for the Most Popular Lifestyle Program Logie Award at the Logie Awards of 2003, 2004 and 2005, each time being beaten by Backyard Blitz. It was also nominated at the Logie Awards of 1999 and nominated as the Favourite Lifestyle Program at the Australian People Choice Awards of 1999.
"Seven Wonders of the World"
In an episode broadcast in 2007, Getaway viewers were asked to choose a new Seven Wonders of the World based on several destinations which had been pre-selected by the show's producers.
The destinations were (winners are shown in bold):
Natural wonders:
Milford Sound
Mount Everest
Grand Canyon
Ancient: one wonder
Machu Picchu
Pyramids of Giza
Petra
Ancient: two wonders
Angkor Wat
Great Wall of China
Easter Island
Waterfall wonders
Niagara Falls
Victoria Falls
Iguazu Falls
Modern wonders
Eiffel Tower
Taj Mahal
Sydney Opera House
City wonders
Rome
New York City
Shanghai
Island wonders
Bora Bora
Aitutaki
Santorini
New Zealand version
A New Zealand version of the program, with some local content, was broadcast on TV One and Prime TV.
Former Presenters
Suzy Clarkson
Charlotte Dawson
Clarke Gayford
Lance Hipkins
Renee Wright
See also
List of longest-running Australian television series
List of Australian television series
List of Nine |
https://en.wikipedia.org/wiki/South%20Eastern%20Freeway | South Eastern Freeway is a freeway in South Australia (SA). It is a part of the National Highway network linking the state capital cities of Adelaide, SA, and Melbourne, Victoria, and is signed as route M1. It carries traffic over the Adelaide Hills between Adelaide and the River Murray, near Murray Bridge, where it is connected via the Swanport Bridge to the Dukes Highway, which is the main road route to Victoria.
It was formerly signposted as Princes Highway, which refers to the coastal route from Adelaide to Sydney via Melbourne.
It is often referred to by South Australians simply as the freeway, as it was the first freeway in South Australia, and is still the longest, and the only one with "Freeway" in its name rather than "Expressway" or "Highway". South Eastern Freeway includes twin-tube tunnels - the Heysen Tunnels - in the descent towards Adelaide, the first of their kind on the National Highway.
Route
South Eastern Freeway commences at the intersection with Glen Osmond Road, Cross Road and Portrush Road in Glen Osmond, and heads southeast as a six-lane, dual-carriageway route. As it traverses across - and through, in one section, via the Heysen Tunnels - the Adelaide Hills, and due the fact the freeway is a major freight route, it also features arrester beds and concrete median barriers, with street lighting between Glen Osmond and Crafers. The freeway narrows to four lanes just before it bypasses Crafers, and continues in a south-easterly direction, past Stirling, Hahndorf and Mount Barker, before narrowing further to a two-lane, single-carriageway, crossing the Murray River over the Swanport Bridge, to terminate just east of the crossing in Long Flat, south-east of Murray Bridge.
History
Prior to the initial construction of the freeway in the 1960s, inbound and outbound road traffic between Adelaide and south-eastern South Australia or Victoria used a two-lane highway originally built in the early part of the 20th century. With growth in Adelaide's population, issues of congestion and safety mandated reconstruction. Studies began in 1962 for a freeway commencing from Crafers, that endpoint selected arguably due to the massive expenditure required with the precedent upgrade of the Mount Barker Road.
Construction began in 1965 from Crafers. The first stage of eastbound traffic lanes were opened in 1967, and the first westbound section opened in 1969. The freeway was opened in stages as construction progressed. The final section bypassing the town of Murray Bridge and connecting to the new Swanport Bridge over the River Murray opened in 1979, providing an alternative to the historic bridge in Murray Bridge.
The Adelaide–Crafers Highway extension came as a much-needed upgrade and replacement to the previous link road, the Mount Barker Road, which had been contoured to the Adelaide Hills, giving rise to many steep turns, ascending a tortuous route. The tightest hairpin turn on the Mount Barker Road was infamous as the Devil's Elbo |
https://en.wikipedia.org/wiki/CKC%20Chinese%20Input%20System | The CKC Chinese Input System is a Chinese input method for computers that uses the four corner method to encode characters.
The encoding uses a maximum of 4 digits ("0" - "9") to represent a Chinese character. All possible shapes of strokes that forms any given Chinese character are classified into 10 groups, each represented by one of the ten possible digits 0-9. Chinese characters can then be input by following the order in which the strokes are identified at the 4 corners of the character. As a result of this simplicity in coding using the ten numeric digits, users typically need to use only a numeric keypad to input Chinese.
Implementations for both Traditional and Simplified Chinese are available, though the coding principle applies to both. In other words, users only need to be trained once and the skill can be applied equally well to both Traditional and Simplified Chinese version of the CKC Chinese Input System.
Training courses on the CKC Chinese Input System are provided by training centres in CKC Centre for the Development of Information Technology for Chinese Language Teaching of The Hong Kong Institute of Education, IVE Haking Wong and of Hong Kong University.
Mapping
The mapping between groups of stokes and their corresponding digits 0-9 can be described by the following:
一橫二豎三點捺
叉四插五方塊六
七角八八九是小
撇與左勾都是零
This means: 1 represents a horizontal stroke, 2 a vertical or diagonal stroke, 3 a dot or left-to-right diagonal stroke, 4 two strokes in a cross shape, 5 three or more strokes in which one stroke intersects all others, 6 a box-shape, 7 where a stroke turns a corner, 8 the shape of the Chinese character 八 and its inverted form, 9 the shape of the Chinese character 小 and its inverted form, and 0 a right-to-left diagonal or left hook stroke.
Coding principle : single character
Order of coding : start from the top left-hand corner, then the top right-hand corner, next followed by the bottom left-hand corner and finally the bottom right-hand corner. Example : CKC code for the character "的" is 0760
When there are more than 1 way to encode, use one which covers more strokes of the character. Example : the CKC code for the character "綜 " is 2399 as opposed to 2393.
Encode each of the shapes ONCE only. Example : the CKC code for the character "香" is 06 as opposed to 0066.
When there are more than 1 way to encode, code of the strokes at the left-most or right-most side of the character is preferred. Example : the CKC code for the character "非" is 1111 as opposed to 2222.
Strokes positioned at the top most of the character is given priority to code rather than those at lower position. Example : The CKC code for the character "成" is 5307 as opposed to 7307.
Coding principle : phrase
Software availability
The software can be downloaded from The CKC Chinese Input System web site and can be run on the Microsoft Windows environment. Other platforms such as Linux, Palm and Pocket PC are under development.
WebCKC
It is also possible |
https://en.wikipedia.org/wiki/Princes%20Motorway | The Princes Motorway is a predominantly dual carriage untolled motorway that links Sydney to Wollongong and further south through the Illawarra region to . Part of the Australian Highway 1 network, the motorway is designated with the route number M1.
The motorway is sometimes known by its previous signposting F6 (Freeway Route 6) and its previous name, the Southern Freeway, which applied to the sections between Waterfall and Bulli Tops as well as Gwynneville and Yallah. The section between Bulli Tops and Gwynneville was known as Mount Ousley Road, and was first built as a defence route and later upgraded to dual carriageway standards. In early 2013, as part of the New South Wales alphanumeric route conversion process, the entire motorway was renamed to its current name and signposted M1.
It is the backbone of road traffic in the Illawarra. As Wollongong and Port Kembla are important industrial centres, freight traffic is heavy. Despite the current decline of the local steel industry, emergence of Wollongong as a commuter city of Sydney has kept the motorway busy.
Sections
In the north, the Princes Motorway route starts at Waterfall, taking more or less a parallel route with Princes Highway until the sprawling Bulli Tops interchange (with Appin Road (B69) and Princes Highway). There it continues downhill, avoiding the steep Bulli Pass, and bypasses Wollongong CBD, through Gwynneville and continues for , bypassing the suburbs of Yallah and Albion Park Rail, reaching the Albion Park interchange (with Illawarra Highway (Terry Street) (A48)) before connecting with the existing Princes Highway (A1) at the Oak Flats interchange.
The motorway can be divided into four sections:
between Waterfall and Bulli Tops (formerly Southern Freeway)
between Bulli Tops and Gwynneville (also known as Mount Ousley Road)
between Gwynneville to Yallah (formerly Southern Freeway)
Albion Park Rail Bypass
Waterfall to Bulli Tops section
Construction of the section between Waterfall and Bulli Tops commenced in July 1970. At 22.9km, it was then the longest section of freeway to completed at one time, at a cost of $30.5 million. Financed by State Government bonds, from its opening on 24 July 1975, this section of freeway initially incurred a toll. This part of the freeway did not feature the Helensburgh Interchange (which subsequently opened in February 2000). The toll operated for 20 years, which was 10 years short of its intended operating length. The main reason for this was local residents complaining that the F3 Freeway had its toll dropped in 1988, which was at the time intended to be dropped as its loans had been fully paid off unlike those of the F6.
After much pressure the toll for the F6 freeway was removed on 30 July 1995 as the loans had been repaid. Remnants of the tollbooths could initially be seen at the old toll plaza at Waterfall, such as faint markings and a set of warning lights in the southbound direction for the toll plaza. These remnants have s |
https://en.wikipedia.org/wiki/HSQLDB | HSQLDB (Hyper SQL Database) is a relational database management system written in Java. It has a JDBC driver and supports a large subset of SQL-92, SQL:2008, SQL:2011, and SQL:2016 standards. It offers a fast, small (around 1300 kilobytes in version 2.2) database engine which offers both in-memory and disk-based tables. Both embedded and server modes are available.
Additionally, it includes tools such as a minimal Web server, command line and GUI management tools (can be run as applets), and a number of demonstration examples. It can run on Java runtimes from version 1.1 upwards, including free Java implementations such as Kaffe.
HSQLDB is available under a BSD license. It is used as a database and persistence engine in many open source software projects, such as descendants of OpenOffice.org Base (i.e., Apache OpenOffice Base, LibreOffice Base, etc.), and the Jitsi VoIP and video-conference client since version 2.6. It is also used in commercial products, such as Mathematica and InstallAnywhere (starting with version 8.0).
Transaction support
HSQLDB version 2.0 has three transaction control modes. It supports read committed and serializable transaction isolation levels with table level locks or with multiversion concurrency control (MVCC), or a combination of locks and MVCC. version 1.8.1 supports transaction isolation level 0 (read uncommitted) only.
Data storage
HSQLDB has two main table types used for durable read-write data storage, i.e., if a transaction has been successfully committed, it is guaranteed that the data will survive system failure and will keep their integrity.
The default MEMORY type stores all data changes to the disk in the form of a SQL script. During engine start-up, these commands are executed and data are reconstructed into the memory.
Another table type is CACHED, which allows one to store more data, at the cost of the slower performance. The HSQLDB engine loads them only partially and synchronizes the data to the disk on transaction commits. However, the engine always loads all rows affected during an update into the memory. This renders very large updates impossible without splitting the work into smaller parts.
Other table types allow access to comma-separated values (CSV) files. These tables can participate, for example, in queries with JOINs and simplify spreadsheet processing and read-write non-durable in-memory data storage.
SQL features
HSQLDB 2.0 supports all the core features and many optional features of SQL:2008. Advanced features include user-defined SQL procedures and functions, schemas, datetime intervals, updatable views, arrays, lobs, full and lateral joins and set operations. Many non-standard functions such as TO_CHAR and DECODE are also supported. Extensions to standard SQL include user-defined aggregate functions.
Releases
Several versions of HSQLDB have been released since 2001. Early versions were based on the discontinued HypersonicSQL database engine. Version 2.0, released in 2010, |
https://en.wikipedia.org/wiki/F-Secure | F-Secure Corporation is a global cyber security and privacy company, which has its headquarters in Helsinki, Finland.
The company has offices in Denmark, Finland, France, Germany, India, Italy, Japan, Malaysia, Netherlands, Norway, Poland, Sweden, the United Kingdom and the United States, with a presence in more than 100 countries, and Security Lab operations in Helsinki and in Kuala Lumpur, Malaysia.
F-Secure develops and sells antivirus, VPN, password management, and other consumer cyber security products and services for computers, mobile devices, smart TVs and internet of things devices. The company also offers several free-to-use tools on its website.
History
F-Secure was first established under the name Data Fellows by Petri Allas and Risto Siilasmaa on May 16, 1988. Data Fellows trained computer users and built customized databases. Three years later, the company launched its first major software project and developed the first heuristic scanner for antivirus products. F-Secure’s first antivirus product for Windows PCs was launched in 1994. Data Fellows became F-Secure in 1999. F-Secure was the first company that developed an anti-rootkit technology called BlackLight in 2005.
In June 2015, F-Secure expanded into the enterprise market by acquiring nSense, a Danish company that specializes in security consultation and vulnerability assessment. The purchase of Inverse Path, a privately owned Italian security consultancy with experience in avionics, automative, and industrial control sectors.
F-Secure Client Security received AV-TEST Best Protection award for the fifth time in 2016.
In June 2018, F-Secure acquired security company MWR InfoSecurity for 80 million pounds ($106 million). F-Secure gained the MWR consulting business (now F-Secure Consulting), its threat hunting product, Countercept (now F-Secure Managed Detection and Response), and its suite of phishing protection services, phishd.
February 17th 2022, F-Secure announced a demerger of its corporate and consumer businesses. In conjunction with the demerger, the company was renamed as WithSecure Corporation (“WithSecure”). The consumer security business was to be transferred into a new independent company and continue using the name F-Secure Corporation. The demerger came into effect July 1st, 2022, when F-Secure was listed to Nasdaq Helsinki and the corporate business was completely separated from the company.
Academia
In co-operation with Aalto University School of Science and Technology, F-Secure runs a one-semester course for future virus analysts, with some material available online.
Controversies
After the media coverage of Magic Lantern and claims by some AV vendors to purposely leave a backdoor for it in their products, F-Secure announced their policy on detecting these spying programs:
"F-Secure Corporation would like to make known that we will not leave such backdoors to our F-Secure Anti-Virus products, regardless of the source of such tools. We have to draw a |
https://en.wikipedia.org/wiki/List%20of%20Buenos%20Aires%20Underground%20stations | The Buenos Aires Underground (locally known as subte, from "subterráneo") is a mass-transit network that serves the city of Buenos Aires, Argentina.
Lines
Stations
There are 87 underground stations and 18 premetro stations.
Stations under construction
Ghost stations
See also
Buenos Aires Underground
List of metro systems
External links
Metrovías official website
Subterráneos de Buenos Aires
Stations
Buenos Aires |
https://en.wikipedia.org/wiki/NSIS | NSIS may refer to:
Technology
National Sheep Identification System, the implementation in Ireland for the identification and registration of ovine and caprine animals
Network Store Interface Service, a Microsoft Windows service
Next Steps in Signaling, a former Internet Engineering Task Force working group
Nullsoft Scriptable Install System, a script-driven Windows installation system
Other uses
National Security Intelligence Section, of Ireland's Directorate of Military Intelligence
New Sathorn International School, an international school located in Bangkok, Thailand |
https://en.wikipedia.org/wiki/Eastlink | Eastlink may refer to:
Eastlink (company), a communications provider in Canada
EastLink TV, the brand for EastLink's community channels
Eastlink Wireless, a mobile network operator owned by Eastlink
East-Link (Dublin), a toll bridge in Dublin, Ireland
EastLink (Melbourne), a toll road in Melbourne, Victoria, Australia
Eastlink Centre, an arena and convention facility in Charlottetown, Prince Edward Island, Canada
East Link Extension, an under-construction light rail line in Seattle, Washington, United States
Eastlink hotel, a sculpture by Callum Morton in Melbourne, Victoria, Australia
East Link Project, a planned high-speed rail line in Sweden
EastLink Trail, a shared use cyclist/pedestrian path in Melbourne, Victoria, Australia
See also
East Tangential Link or Tangentiale Verbindung Ost, an expressway in Berlin, Germany
East-West Link (disambiguation)
East Line (disambiguation) |
https://en.wikipedia.org/wiki/Luxo%20Jr. | Luxo Jr. is a 1986 American computer-animated short film produced and released by Pixar. Written and directed by John Lasseter, the two-minute short film revolves around one larger and one smaller desk lamp. The larger lamp, named Luxo Sr., looks on while the smaller, "younger" Luxo Jr. plays exuberantly with a ball to the extent that it accidentally deflates. Luxo Jr. was Pixar's first animation after Ed Catmull and John Lasseter left Industrial Light & Magic's computer division of Cinetron Computer Systems. The film is the source of Luxo Jr., the mascot of Pixar.
Lasseter aimed to finish the short film for the 1986 SIGGRAPH, an annual computer graphics conference attended by thousands of industry professionals. The film would come from his experiments with modeling his Luxo lamp. Lasseter worked to improve the story within the allotted two minutes. In animation, the film demonstrates the use of shadow maps within the rendering software. Lasseter applied the classic animation principles popularized by Disney's Nine Old Men to convey the lamps' emotions. Catmull and Lasseter worked around the clock, and Lasseter even took a sleeping bag into work and slept under his desk, ready to work early the next morning. Ultimately, the film took four and a half months to be completed.
The short film was finished in time for it to be shown at SIGGRAPH. Before the film finished playing, the audience had already risen in applause. Luxo Jr. is regarded as a breakthrough in the animation industry as a whole, changing traditionalists' interpretation of computer animation. The short was the first work of animation to use procedural animation, the software written by Eben Ostby. It received an Academy Award nomination for Best Animated Short Film, becoming the first CGI film nominated for an Academy Award.
The soundtrack music is an uncredited edit of three compositions on Brian Bennett's album Counterpoint In Rhythm: "Finesse", "Quicksilver", and "Chateau Latour".
In 2014, Luxo Jr. was deemed "culturally, historically, or aesthetically significant" by the Library of Congress and selected for preservation in the United States National Film Registry.
Plot
In a dark room, a large illuminated balanced-arm desk lamp named Luxo Sr. sees a small yellow ball with a blue stripe and a red star on the front roll-up to him. He eyes the ball curiously and pushes it away, but the ball comes back to him. He pushes it away again, but it rolls past him as Luxo Jr., his happy and excited son, hops over and plays with the ball. Luxo Jr. then balances himself on top of the ball and bounces on it excessively, causing it to deflate. Luxo Jr. flips the deflated ball onto its side and looks up at Luxo Sr., who gently admonishes his son. Luxo Jr. then hops offscreen in shame but is later seen playing with a beach ball. Luxo Sr. looks at the camera, then shakes his head in embarrassment.
Background
The Graphics Group, which was one-third of the Computer Division of Lucasfilm, had be |
https://en.wikipedia.org/wiki/Mondo%202000 | Mondo 2000 was a glossy cyberculture magazine published in California during the 1980s and 1990s. It covered cyberpunk topics such as virtual reality and smart drugs. It was a more anarchic and subversive prototype for the later-founded Wired magazine.
History
Mondo 2000 originated as High Frontiers in 1984, edited by R. U. Sirius (pseudonym for Ken Goffman) with co-editor and publisher Morgan Russell. R. U. Sirius was succeeded as Editor-in-Chief by Alison Bailey Kennedy, a.k.a. "Queen Mu" and "Alison Wonderland".
Sirius was joined by hacker Jude Milhon (a.k.a. St. Jude) as editor and the magazine was renamed Reality Hackers in 1988 to better reflect its drugs and computers theme. It changed title again to Mondo 2000 in 1989. Art director and photographer Bart Nagel, a pioneer in Photoshop collage, created the publication's elegantly surrealist aesthetic. R. U. Sirius left at the beginning of 1993, at about the same time as the launch of Wired. The magazine continued until 1998, with the last issue being #17.
Mondo 2000 was relaunched as the blog Mondo2000.com in August 2017.
Featured writers
Along with the print version of Boing Boing — with which Mondo 2000 shared several writers, including Mark Frauenfelder, Richard Kadrey, Gareth Branwyn, and Jon Lebkowsky — Mondo 2000 helped develop what was to become the cyberpunk subculture. Writers included William Gibson, Nan C. Druid (pseudonym for Maerian Morris), Paco Nathan, Rudy Rucker, Bruce Sterling, Tiffany Lee Brown, Andrew Hultkrans, Mark Dery, Douglas Rushkoff, Mark Pesce, and Robert Anton Wilson.
Writers contributing since the 2017 relaunch include John Higgs, John Shirley, Giulio Prisco, Hyun Yi Kang, Woody Evans, Michael Pinchera, Rudy Rucker, Prop Anon, R.U. Sirius, and interviews with Douglas Rushkoff and Grant Morrison.
Publications
Mondo 2000: A User's Guide to the New Edge Rudy Rucker, R.U. Sirius, Queen Mu ()
See also
Gracie and Zarkov
Kenneth Newby
References
External links
2017 Relaunch
Mondo 2000 History Project at Archive.org
Mondo2000.net
Acceler8or RU Sirius blog ca. 2011-2012
Acceler8or Mondo 2000 archive
Mondo 1995: Up and Down With the Next Millennium's First Magazine, by Jack Boulware. (1995) SF Weekly / Suck article.
"Mondo 2000: A User's Guide to the New Edge", by Tim Appelo. (1992) Entertainment Weekly magazine review.
Cultural magazines published in the United States
Defunct magazines published in the United States
Hacker magazines
Independent magazines
Magazines established in 1984
Magazines disestablished in 1998
Magazines published in the San Francisco Bay Area
Non-fiction Cyberpunk media
Works about computer hacking |
https://en.wikipedia.org/wiki/CGW | CGW may refer to:
Chicago Great Western Railway, a Class I railroad that linked Chicago, Minneapolis, Omaha, and Kansas City
Comics' Greatest World, an imprint of Dark Horse Comics
Computer Gaming World, an American computer game magazine published between 1981 and 2006
Counsel General for Wales |
https://en.wikipedia.org/wiki/FLEX%20%28operating%20system%29 | FLEX is a discontinued single-tasking operating system developed by Technical Systems Consultants (TSC) of West Lafayette, Indiana, for the Motorola 6800 in 1976.
Overview
The original version was distributed on 8" floppy disks; the (smaller) version for 5.25" floppies is called mini-Flex. It was also later ported to the Motorola 6809; that version is called Flex09. All versions are text-based and intended for use on display devices ranging from printing terminals like the Teletype Model 33 ASR to smart terminals. While no graphic displays are supported by TSC software, some hardware supports elementary graphics and pointing devices.
FLEX is a disk-based operating system, using 256-byte sectors on soft-sectored floppies; the disk structure uses linkage bytes in each sector to indicate the next sector in a file or free list. The directory structure is simplified as a result. TSC (and others) provide several programming languages including BASIC in two flavors (standard and extended) and a tokenizing version of extended BASIC called Pre-compiled BASIC, FORTH, C, FORTRAN, and PASCAL.
TSC also wrote a version of FLEX, Smoke Signal DOS, for the California hardware manufacturer Smoke Signal Broadcasting; this version uses forward and reverse linkage bytes in each sector which increase disk reliability at the expense of compatibility and speed.
Later, TSC introduced the multitasking, multi-user, Unix-like UniFLEX operating system, which requires DMA disk controllers, 8" disk, and sold in small numbers. Several of the TSC computer languages were ported to UniFLEX.
During the early 1980s, FLEX was offered by Compusense Ltd as an operating system for the 6809-based Dragon 64 home computer.
Commands
The following commands are supported by different versions of the FLEX operating system.
APPEND
ASN
BACKUP
BUILD
CAT
COPY
COPYNEW
C4MAT
CLEAN
DATE
DELETE
ECHO
EXEC
FIX
GET
I
JUMP
LINK
LIST
MEMTEST1
MON
N
NEWDISK
O
P
P.COR
PO
PRINT
PROT
PSP
Q
QCHECK
READPROM
RENAME
RM
S
SAVE
SAVE.LOW
SBOX
SP
STARTUP
TOUCH
TTYSET
UCAL
USEMF
VER
VERIFY
VERSION
WRITPROM
XOUT
Y
See also
Microsoft BASIC-68 for FLEX
Microsoft BASIC-69 for FLEX
References
External links
FLEX User Group
FLEX User Group
SWTPC 6800 FLEX 2 and 6809 FLEX 9 / UniFLEX / OS9 Level 1 emulator
Windows-based 6809 Emulator + Flex09 and 6809 applications
AmigaDOS-based 6809 Emulator + Flex09 and 6809 applications
The Missing 6809 UniFLEX Archive
DragonWiki
SWTPC documentation collection
FLEX Software Archive
Discontinued operating systems
Disk operating systems
TRS-80 Color Computer
1976 software |
https://en.wikipedia.org/wiki/SCL | SCL may refer to:
Computing
System Control Language, of the ICL VME operating system
SC++L, the C++ standard library
Software Collections in the CentOS Linux distribution
System Command Language of the NOS/VE CDC Cyber operating system
Structured Control Language, for programming PLCs
Language
Shina language, spoken by the Shina people in Gilgit-Baltistan, Pakistan
Organizations
SCL Group, a British data analysis and communication company
Seattle City Light, public utility in Seattle, Washington, United States
Southeastern Composers League
Stanford Center on Longevity (SCL) Stanford University; see Stanford University centers and institutes
National Senior Classical League
Society of Chief Librarians, former name of Libraries Connected, British public library organisation
Society of Construction Law
IATA airport code for Arturo Merino Benítez International Airport (Santiago International Airport)
Science and technology
Sculptor (constellation), astronomical abbreviation
Semi-Conductor Laboratory of the Department of Space of India
Serial clock, a signal in I²C electronic messaging bus
Short circuit level
Skin conductance level, in medicine
Sleep Convention Logic, a typo of asynchronous logic
Structural composite lumber, an engineered wood
Substation Configuration Language, for electrical substations
Other
Arturo Merino Benítez International Airport, Santiago, Chile by IATA airport code
Seaboard Coast Line Railroad, by reporting mark
Security characteristic line, plotting performance of a security
Sha Tin to Central Link of the Hong Kong MTR transit system
Studies in Canadian Literature, a literary journal
See also
Symptom Checklist 90 (SCL-90-R), psychometric instrument |
https://en.wikipedia.org/wiki/Multilink | Multilink may refer to:
Multi-link suspension, a type of vehicle suspension design
Multilink PPP, a type of communications protocol
Multilink Procedure
Multilink striping, a type of data striping used in telecommunications |
https://en.wikipedia.org/wiki/Lzop | lzop is a free software file compression tool which implements the LZO algorithm and is licensed under the GPL.
Aimed at being very fast, lzop produces files slightly larger than gzip while only requiring a tenth of the CPU use and only slightly higher memory utilization. lzop is one of the fastest compressors available, a close second to lz4.
See also
List of archive formats
List of file archivers
Comparison of file archivers
References
External links
Free data compression software |
https://en.wikipedia.org/wiki/PAQ | PAQ is a series of lossless data compression archivers that have gone through collaborative development to top rankings on several benchmarks measuring compression ratio (although at the expense of speed and memory usage). Specialized versions of PAQ have won the Hutter Prize and the Calgary Challenge. PAQ is free software distributed under the GNU General Public License.
Algorithm
PAQ uses a context mixing algorithm. Context mixing is related to prediction by partial matching (PPM) in that the compressor is divided into a predictor and an arithmetic coder, but differs in that the next-symbol prediction is computed using a weighted combination of probability estimates from a large number of models conditioned on different contexts. Unlike PPM, a context doesn't need to be contiguous. Most PAQ versions collect next-symbol statistics for the following contexts:
n-grams; the context is the last bytes before the predicted symbol (as in PPM);
whole-word n-grams, ignoring case and nonalphabetic characters (useful in text files);
"sparse" contexts, for example, the second and fourth bytes preceding the predicted symbol (useful in some binary formats);
"analog" contexts, consisting of the high-order bits of previous 8- or 16-bit words (useful for multimedia files);
two-dimensional contexts (useful for images, tables, and spreadsheets); the row length is determined by finding the stride length of repeating byte patterns;
specialized models, such as x86 executables, BMP, TIFF, or JPEG images; these models are active only when the particular file type is detected.
All PAQ versions predict and compress one bit at a time, but differ in the details of the models and how the predictions are combined and postprocessed. Once the next-bit probability is determined, it is encoded by arithmetic coding. There are three methods for combining predictions, depending on the version:
In PAQ1 through PAQ3, each prediction is represented as a pair of bit counts . These counts are combined by weighted summation, with greater weights given to longer contexts.
In PAQ4 through PAQ6, the predictions are combined as before, but the weights assigned to each model are adjusted to favor the more accurate models.
In PAQ7 and later, each model outputs a probability rather than a pair of counts. The probabilities are combined using an artificial neural network.
PAQ1SSE and later versions postprocess the prediction using secondary symbol estimation (SSE). The combined prediction and a small context are used to look up a new prediction in a table. After the bit is encoded, the table entry is adjusted to reduce the prediction error. SSE stages can be pipelined with different contexts or computed in parallel with the outputs averaged.
Arithmetic coding
A string s is compressed to the shortest byte string representing a base-256 big-endian number x in the range [0, 1] such that P(r < s) ≤ x < P(r ≤ s), where P(r < s) is the probability that a random string r with |
https://en.wikipedia.org/wiki/Castlevania%3A%20Harmony%20of%20Dissonance | Castlevania: Harmony of Dissonance is a platform-adventure video game developed by Konami Computer Entertainment Tokyo and published by Konami for the Game Boy Advance. Part of Konami's Castlevania video game series, it is the second installment of the series on the Game Boy Advance. It was released in Japan in June 2002, in North America in September 2002, and in Europe in October 2002.
Harmony of Dissonance occurs in the fictional universe of the Castlevania series; the premise of the series centers on the eternal conflict between the vampire hunters of the Belmont clan and the immortal vampire Dracula. Set fifty years after Simon Belmont vanquished Dracula's curse, Harmony of Dissonance focuses on his grandson Juste Belmont and his quest to rescue a kidnapped childhood friend.
Koji Igarashi produced Harmony of Dissonance with the intent of "creat[ing] a game that was similar to Castlevania: Symphony of the Night", the critically acclaimed PlayStation game that he had worked on. Harmony of Dissonance sold 126,000 units in the United States in its first three months of sales, but it was not a success in Japan. Critics praised its graphics which was considered an improvement over its predecessor, gameplay, and return to elements from Symphony of the Night, while criticism was directed towards its confusing map design, story, and music.
The game was re-released as part of the Castlevania Advance Collection on September 23, 2021 for the Nintendo Switch, PlayStation 4, Xbox One and Windows alongside Castlevania: Circle of the Moon, Castlevania: Aria of Sorrow, and Castlevania: Dracula X.
Gameplay
Harmony of Dissonance makes use of a 2D side-scrolling style of gameplay, similar to many of the previous Castlevania video games. The objective of the game is to lead the player character, Juste Belmont, through the monster-filled castle as he searches for his kidnapped friend. The castle consists of two "layers": Castle A and B. Structurally, each castle has mostly the same room layout, but monster types, items, and other aspects vary between the two versions. Later, the player can use special warp rooms that can teleport Juste to other castle rooms and between castles. The two castles share a connection; for example, the destruction of a wall in one castle can cause a change in the other. The game further divides the castle into various, named areas: the Shrine of the Apostates, for example. Relics and keys found within the castle allow Juste to reach previously inaccessible areas. Harmony of Dissonance makes use of the forward dash move, which causes Juste to move forward with a short burst of speed. Unique to Harmony of Dissonance is the ability to collect furniture and collectables to furnish a bare room that Juste finds in the castle.
Juste primarily attacks at close quarters using the series' traditional whip weapon, the Vampire Killer. It can be brandished to deflect projectile attacks, reminiscent of Simon Belmont's usage of the weapon in Su |
https://en.wikipedia.org/wiki/PCI | PCI may refer to:
Business and economics
Payment card industry, businesses associated with debit, credit, and other payment cards
Payment Card Industry Data Security Standard, a set of security requirements for credit card processors
Provincial Competitiveness Index, a governance index of Vietnamese provinces
Ceridian-UCLA Pulse of Commerce Index, a U.S. economic indicator based on trucking fuel consumption
Per capita income
Equitable PCI Bank, a Philippine bank
Science and technology
Panel call indicator, telephone signalling system
Pavement condition index, used in transportation civil engineering
Picocurie (pCi), a unit of radioactivity
Peripheral Component Interconnect, a computer bus
PCI-X (PCI eXtended), a computer bus
PCI Express (PCIe), a computer bus
Projects of Common Interest, a category of EU projects for interconnecting energy infrastructures
Protocol-control information, in telecommunication
Pulverized coal injection method, in blast furnaces
Medicine
Percutaneous coronary intervention, a set of procedures used to treat coronary heart disease
Photochemical internalization, a light-triggered drug delivery method
Potato carboxypeptidase inhibitor, a natural peptide usable for thrombolytic and cancer therapy
Prophylactic cranial irradiation, a management option for certain types of aggressive cancers
Protein C inhibitor, a serine protease inhibitor
Organizations
Paralympic Committee of India, which selects athletes to represent India at international athletic meets
Parti Communiste Internationaliste, a French political party
Partito Comunista Italiano, a former Italian communist party
Peer Community in, communities of researchers reviewing and recommending preprints in their field
Pentecostal Collegiate Institute (New York), 1900–1903, US
Pentecostal Collegiate Institute (Rhode Island), 1902–1918, US
Pharmacy Council of India, a statutory body in India
Porter and Chester Institute, a technical school in Connecticut and Massachusetts, US
Post Carbon Institute, an organization advocating a more resilient, equitable, and sustainable world
Presbyterian Church in Ireland, a Protestant denomination in Ireland
Project Concern International, a humanitarian organization
Public Communications Inc., a Chicago-based national public relations agency
Other uses
Duruwa language (ISO 639-3 code)
See also
PPCI (disambiguation) |
https://en.wikipedia.org/wiki/Reporting%20mark | A reporting mark is a code used to identify owners or lessees of rolling stock and other equipment used on certain rail transport networks. The code typically reflects the name or identifying number of the owner, lessee, or operator of the equipment.
In North America, the mark, which consists of an alphabetic code of two to four letters, is stenciled on each piece of equipment, along with a one- to six-digit number. This information is used to uniquely identify every such rail car or locomotive, thus allowing it to be tracked by the railroad it is traveling over, which shares the information with other railroads and customers. In multinational registries, a code indicating the home country may also be included.
Standard practices
North America
The Association of American Railroads (AAR) assigns marks to all carriers, under authority granted by the U.S. Surface Transportation Board, Transport Canada, and Mexican Government. Railinc, a subsidiary of the AAR, maintains the active reporting marks for the North American rail industry.
Under current practice, the first letter must match the initial letter of the railroad name. As it also acts as a Standard Carrier Alpha Code, the reporting mark cannot conflict with codes in use by other nonrail carriers.
Marks ending with the letter "X" are assigned to companies or individuals who own railcars, but are not operating railroads; for example, the TTX Company (formerly Trailer Train Company) is named for its original reporting mark of TTX. In another example, the reporting mark for state-funded Amtrak services in California is CDTX (whereas the usual Amtrak mark is AMTK) because the state transportation agency (Caltrans) owns the equipment used in these services. This may also apply to commuter rail, for example Metrolink in Southern California uses the reporting mark SCAX because the equipment is owned by the Southern California Regional Rail Authority—which owns the Metrolink system—even though it is operated by Amtrak. This is why the reporting mark for CSX Transportation, which is an operating railroad, is CSXT instead of CSX. Private (non-common carrier) freight car owners in Mexico were issued, up until around 1990, reporting marks ending in two X's, possibly to signify that their cars followed different regulations (such as bans on friction bearing trucks) than their American counterparts and so their viability for interchange service was impaired. This often resulted in five-letter reporting marks, an option not otherwise allowed by the AAR.
Companies owning trailers used in trailer-on-flatcar service are assigned marks ending with the letter "Z", and the National Motor Freight Traffic Association, which maintains the list of Standard Carrier Alpha Codes, assigns marks ending in "U" to owners of intermodal containers. The standard ISO 6346 covers identifiers for intermodal containers.
When the owner of a reporting mark is taken over by another company, the old mark becomes the property of |
https://en.wikipedia.org/wiki/Lempel%E2%80%93Ziv%E2%80%93Oberhumer | Lempel–Ziv–Oberhumer (LZO) is a lossless data compression algorithm that is focused on decompression speed.
Design
The original "lzop" implementation, released in 1996, was developed by Markus Franz Xaver Johannes Oberhumer, based on earlier algorithms by Abraham Lempel and Jacob Ziv. The LZO library implements a number of algorithms with the following characteristics:
Higher compression speed compared to DEFLATE compression
Very fast decompression
Requires an additional buffer during compression (of size 8 kB or 64 kB, depending on compression level)
Requires no additional memory for decompression other than the source and destination buffers
Allows the user to adjust the balance between compression ratio and compression speed, without affecting the speed of decompression
LZO supports overlapping compression and in-place decompression. As a block compression algorithm, it compresses and decompresses blocks of data. Block size must be the same for compression and decompression. LZO compresses a block of data into matches (a sliding dictionary) and runs of non-matching literals to produce good results on highly redundant data and deals acceptably with non-compressible data, only expanding incompressible data by a maximum of 1/64 of the original size when measured over a block size of at least 1 kB.
Implementations
The reference implementation is written in ANSI C, and it has been made available as free software under the GNU General Public License. The copyright for the code is owned by Markus F. X. J. Oberhumer. It was originally published in 1996. Oberhumer has also written a command-line frontend called lzop.
Versions of LZO are available for the Perl, Python and Java languages. Various LZO implementations are reported to work under Win32, AIX, ConvexOS, IRIX, Mac OS, Palm OS, PlayStation, Nintendo 64, Wii, Solaris, SunOS, TOS (Atari ST), Linux and VxWorks.
FFmpeg's libavutil library includes its own implementation of LZO as a possible method for lossless video compression. FFmpeg's implementation of the decompressor is also used in OpenConnect in order to support LZO-compressed ESP packets sent by Juniper Networks and Pulse Secure VPN servers.
The Linux kernel uses its LZO implementation in some of its features:
btrfs uses LZO as a possible compression method for file system compression.
initrd and initramfs use LZO as a possible compression method for initial RAM drive compression.
SquashFS uses LZO as a possible compression method for file system compression.
zram uses LZO with run-length encoding called LZO-RLE as the default compression method for RAM drive compression.
zswap uses LZO as the default compression method for virtual memory compression
References
External links
- Pure Java implementation of the liblzo2 LZO compression algorithm
Lossless compression algorithms
Free data compression software
C (programming language) libraries |
https://en.wikipedia.org/wiki/CFEngine | CFEngine is a configuration management system, written by Mark Burgess. Its primary function is to provide automated configuration and maintenance of large-scale computer systems, including the unified management of servers, desktops, consumer and industrial devices, embedded network devices, mobile smartphones, and tablet computers.
Released under the terms of the GNU General Public License, CFEngine is free software.
History
The CFEngine project began in 1993 as a way for author Mark Burgess (then a post-doctoral fellow of the Royal Society at Oslo University, Norway) to get his work done by automating the management of a small group of workstations in the Department of Theoretical Physics. Burgess managed Unix workstations, scripting and fixing problems for users manually. Scripting took too much time, the flavours of Unix were significantly different, and scripts had to be maintained for multiple platforms, drowning in exception logic. After discussing the problems with a colleague, Burgess wrote the first version of CFEngine (the configuration engine) which was published as an internal report and presented at the CERN computing conference. It gained significant attention from a wider community because it hid platform differences using a domain-specific language.
A year later, Burgess finished his post-doc but decided to stay in Oslo and took a job lecturing at Oslo University College. Here he realized that there was little or no research being done into configuration management, and he set about applying the principles of scientific modelling to understanding computer systems.He developed the notion of convergent operators, which remains a core of CFEngine.
In 1998 Burgess wrote "Computer Immunology", a paper at the USENIX/LISA98 conference. It laid out a manifesto for creating self-healing systems, reiterated a few years later by IBM in their form of Autonomic Computing. This started a research effort which led to a major re-write, CFEngine 2, which added features for machine learning, anomaly detection and secure communications.
Between 1998 and 2004, CFEngine grew in adoption along with the popularity of Linux as a computing platform. During this time, Mark Burgess developed promise theory, a model of distributed cooperation for self-healing automation. In 2008, after more than five years of research, CFEngine 3 was introduced, which incorporated promise theory as "a way to make CFEngine both simpler and more powerful at the same time", according to Burgess. The most significant re-write of the project to date, CFEngine 3 also integrated knowledge management and discovery mechanisms—allowing configuration management to scale to automate enterprise-class infrastructure.
In June 2008 the company CFEngine AS was formed as a collaboration between author Mark Burgess, Oslo University College and the Oslo Innovation Centre in order to support users of CFEngine. In April 2009, the company launched the first commercial version of CFEngin |
https://en.wikipedia.org/wiki/Agent%20Extensibility%20Protocol | The Agent Extensibility Protocol or AgentX is a computer networking protocol that allows management of Simple Network Management Protocol objects defined by different processes via a single master agent. Agents that export objects via AgentX to a master agent are called subagents. The AgentX standard not only defines the AgentX protocol but also the procedure by which those subagents process SNMP protocol messages.
For more information, see RFC 2741 for the original definition of the protocol and the IETF Agentx Working Group.
References
Network management
Agent communications languages |
https://en.wikipedia.org/wiki/Motorola%206845 | The Motorola 6845, or MC6845, is a display controller that was widely used in 8-bit computers during the 1980s. Originally intended for designs based on the Motorola 6800 CPU and given a related part number, it was more widely used alongside various other processors, and was most commonly found in machines based on the Zilog Z80 and MOS 6502.
The 6845 is not an entire display solution on its own; the chip's main function is to properly time access to the display memory, and to calculate the memory address of the next portion to be drawn. Other circuitry in the machine then uses the address provided by the 6845 to fetch the pattern and then draw it. The implementation of that hardware is entirely up to the designer and varied widely among machines. The 6845 is intended for character displays, but could also be used for pixel-based graphics, with some clever programming.
Among its better-known uses is the BBC Micro, Amstrad CPC, and Videx VideoTerm display cards for the Apple II. It is also part of many early graphics adapter cards for the IBM PC, including the MDA, Hercules Graphics Card (HGC), Color Graphics Adapter (CGA) and the Plantronics Colorplus. Its functionality was duplicated and extended by custom circuits in the EGA and VGA PC video adapters.
Originally designed by Hitachi as the HD46505, Hitachi-built versions are in a wide variety of Japanese computers, from Sony, Sharp, Panasonic, and Casio. It is also known as the 6845 CRTC or the CRTC6845, meaning "cathode-ray tube controller". This version was used on the Apricot PC and Victor 9000 to provide a 800x400 resolution monochrome display.
A common clone of this CRT controller is the United Microelectronics Corporation (UMC) UM6845E CRT controller.
During the time of cold war technology embargoes, the 6845 was cloned in Bulgaria under the designation CM607.
Overview
The chip generates the signals necessary to interface with a raster display but does not generate the actual pixels, though it does contribute cursor and video-blanking information to the pixel video (intensity) signals. It is used to produce correctly timed horizontal and vertical sync and provide the address in memory from which the next pixel or set of pixels should be read. The process of reading that value, converting it into pixels, and sending it to a CRT is left to other circuits. Because of this, systems using the 6845 may have very different numbers and values of colors, or may not support color at all.
Interlaced and non-interlaced output modes are supported, as is a hardware text cursor. The sync generation includes generation of horizontal and vertical video blanking signals, which are used to condition the external pixel generation circuits. Also, an internal latch is provided which when triggered will duplicate and retain a copy of the video address so that it can later be read back by the CPU. This is useful for light pens and light guns which can function by sending a pulse to the 6845 when the elec |
https://en.wikipedia.org/wiki/Ruputer | The Ruputer is a wristwatch computer developed in 1998 by Seiko Instruments, a subsidiary of the Seiko Group. In the US, it was later marketed as the onHand PC by Matsucom.
The Ruputer has a 16-bit, 3.6 MHz processor and 2 MB of non-volatile storage memory and 128 KB of RAM. Its display is a 102×64 pixel monochrome LCD. Its main forms of input are a tiny 8-direction joystick and 6 function buttons. It also has a serial interface and an IR port for communicating with other devices. The main body of the device (separate from the strap) is roughly 2 inches wide, 1 1/8 inches across, and 5/8 of an inch deep. It is powered by two high-powered watch batteries, which supply the device enough energy for approximately 30 hours of use. Under normal conditions, the watch goes into standby mode down when not in use in order to extend its battery life. The device was distributed with a software development kit which allows for creation of new software written in the programming language C.
onHand PC
The successor to the Ruputer is the onHand PC. The onHand PC was available in two color styles, clear & black, and a single format. While the Ruputer was available with either 512Kb of storage (original Ruputer), 2Mb (Ruputer PRO), or 4 Mb of flash memory (Ruputer PRO4), the onHand PC came only in a single version with 2Mb of storage. The operating system is known as W-PS-DOS version 1.16. The device features both an icon-based GUI and a text-based user interface. There is 128Kb of RAM, with an additional 128Kb of ROM.
On the device, data can be entered by two methods: The first method is by using the joystick mounted to the front of the watch itself (a method that has been considered clumsy). The second method is by synchronizing data from a full-sized PC using the included software. A program called HandySurf also allows synchronizing internet content (such as Yahoo! News Headlines).
Communication with other devices is either through a 38,400-bit/s serial port dock, or through the 9,600 infrared link, the transmitter of which is mounted to the upper middle of the watch. It is possible to link two onHands via this infrared link to play various two-player games.
The watch uses two lithium CR2025 button cells for power, which can be accessed from the back of the device. The batteries give the user an average 3 months of usage before battery replacement. Many users have found that the CR2032 cells fit, which give the device a longer run time. The device's screen is a 102x64 STN 4-greyscale LCD which uses a timed backlight to save power.
The device weighs about , similar that of a large electronic standard watch.
Considering the type of system there is a fair amount of software available, although some of the programs written for the Ruputer are either entirely in Kanji script or will not run due to the increased speed of the onHand's processor.
One developer has made a prototype for a docking station for the watch that includes a screen illuminator and a hal |
https://en.wikipedia.org/wiki/MTR%20Corporation | MTR Corporation Limited is a majority government-owned public transport operator and property developer in Hong Kong which operates the Mass Transit Railway, the most popular public transport network in Hong Kong. It is listed on the Hong Kong Exchange and is a component of the Hang Seng Index. The MTR additionally invests in railways across different parts of the world, including franchised contracts to operate rapid transit systems in London, Sweden (Stockholm Metro and the MTRX Stockholm–Gothenburg rail link), Beijing, Hangzhou, Macau, Shenzhen, Sydney, and a suburban rail system in Melbourne.
History
The Mass Transit Railway Corporation () was established on 22 September 1972 as a government-owned statutory corporation to build and operate a mass transit railway system to meet Hong Kong's public transport needs. On 30 June 2000, the MTRC was succeeded by the MTR Corporation Limited (MTRCL, ). As with the MTRC, the MTRCL's principal business is to operate the mass transit railway system. Following a successful initial public offering, the MTRCL was listed on the Hong Kong Stock Exchange on 5 October 2000, however, the government is still the majority stakeholder in the MTRCL.
Partial privatisation
On 11 September 2000, the financial secretary of the Hong Kong Government, Sir Donald Tsang, announced the partial privatisation of MTR Corporation Limited. The offering was for one billion shares, but this was increased to 1.15 billion due to high demand. On 5 October 2000, the company was listed on the Hong Kong Stock Exchange with 600,000 shareholders. In June 2001, MTR was added to the Hang Seng Index.
At the time of the initial public offering, the company was operating with a surplus of HK$360 million (US$46.1 million), which had increased from a surplus of HK$278 million (US$35.6 million) in 1997. The MTR has continued to be one of the few profitable public transport systems in the world.
MTR–KCR merger
There had been some discussion of merging the Kowloon-Canton Railway Corporation (KCRC), which was also government-owned and the MTRCL to make the territory's transport system more efficient. The MTRCL backed such a merger while the KCRC opposed the plan. In March 2004, the Hong Kong Government officially encouraged the two companies to merge.
On 11 April 2006, the Hong Kong Government officially announced the details of the proposed merger. Under the non-binding Memorandum of Understanding the government has signed with KCRC, KCRC would grant a service concession to the MTRCL to operate the Kowloon–Canton Railway (KCR) system, with an initial period of 50 years. The KCRC would receive a one-time upfront payment of HK$4.25 billion, a fixed annual payment of HK$750 million and a variable annual payment based on revenues generated from operation of the KCR system. In addition, MTRCL would make a payment of $7.79 billion for the acquisition of property and other related commercial interests.
The KCRC's lines were less profitable than those |
https://en.wikipedia.org/wiki/Noop | Noop (, like no-op) was a project by Google engineers Alex Eagle and Christian Gruber aiming to develop a new programming language. Noop attempted to blend the best features of "old" and "new" languages, while syntactically encouraging well accepted programming best-practices. Noop was initially targeted to run on the Java Virtual Machine.
Noop progressed past its initial proposals into a limited interpreter, but according to the project owners they no longer intend to pursue the language any further. Among the reasons cited for discontinuing work on the language was the initial release of Kotlin, which achieves many of the language goals of Noop. The Noop language can be executed as an interpreted language, as a compiled language, or as java code.
Creation
The Noop language was created by Google. It was presented during the 2009 edition of the JVM Language Summit held in Santa Clara, California from September 16 to 18, 2009.
Examples
Hello world in Noop
import noop.Application;
import noop.Console;
class HelloWorld(Console console) implements Application {
Int main(List args) {
String s = "Hello World!";
console.println(s);
return 0;
}
}
References
External links
H-Online article about Noop
Article about Noop by The Register
Article about Noop by ADT Magazine
Object-oriented programming languages
Discontinued Google software
JVM programming languages |
https://en.wikipedia.org/wiki/Rail%20Clearways%20Program | The Rail Clearways Programme was conceived in 2004 with the aim of easing congestion of Sydney's suburban railway network, by reducing the amount of infrastructure shared by multiple services. The disparate projects at pinch points throughout the network were designed to increase passenger capacity and improve reliability. All projects were delivered by the Transport Construction Authority until it was subsumed in November 2011 by Transport for New South Wales. A new timetable was introduced in October 2013 that realised the benefit of many of the projects, and by January 2014—the programme was complete.
Conception
In the mid-2000s, the Government of New South Wales suffered heavy criticism for its perceived mishandling of the Sydney rail network, which had very poor on-time performance following the January 2003 Waterfall train disaster. The safety regime introduced after this crash required drivers to stick to the speed limit, which often caused delays due to the expectations of the timetable for higher speeds. A slower timetable was introduced in September 2005, which significantly improving on-time running of services. The Clearways Programme was intended as the next step in improving the network.
Clearways routes
The Clearways Programme aimed to divide fourteen rail lines into five independent "clearways", reducing the heavily interwoven nature of the Sydney system. This was intended to isolate incidents to one part of the network so other lines would still run as scheduled. The "clearways" feed the existing lines through the Sydney Central Business District.
As the Carlingford Line does not run through the CBD, it was not included in a "clearway". Track upgrades to the Carlingford Line were still included in the programme, but this was cancelled in the November 2008 Mini-Budget. The Carlingford Line has since closed for Light Rail conversion.
The five clearways routes are:
Clearway 1: Eastern Suburbs & Illawarra
This route did not change from the pre-Clearways Eastern Suburbs & Illawarra Line. The projects undertaken on this route have increased passenger capacity.
Clearway 2: Bankstown
After the Airport Line opened in May 2000, most trains from the East Hills line used the new line to approach the city, easing congestion on the older line between Sydenham and Erskineville, where tracks are shared with Bankstown Line services. Under the programme, new dedicated tracks for the Bankstown Line between Sydenham and Erskineville were to be constructed to the west of the existing four tracks to allow express East Hills Line trains from Clearway 3 to again run via Sydenham. The Airport Line would be served by all-stops East Hills Line trains from Clearway 4.
St. Peters and Erskineville railway stations were expected to continue to be served by the Bankstown Line. This would have required platforms—partially completed in the 1970s from the Eastern Suburbs Line construction—to have been activated at these two stations. The works were cancelle |
https://en.wikipedia.org/wiki/Stan%20Zemanek | Stan Zemanek (29 May 1947 – 12 July 2007) was an Australian radio broadcaster, television presenter, radio producer and author who presented a night-time show on The Macquarie Network station 2UE in Sydney and which was networked across parts of Australia via Southern Cross.
He was known for trading abusive remarks with some of his callers. He was also the 13th and longest-serving "Beast" on the popular panel TV talk show Beauty and the Beast.
Career
Zemanek was born and raised in Sydney, New South Wales, but began working in radio as a researcher for Radio C-Fun 141 in Vancouver, British Columbia, Canada. He worked as a producer on the John Laws program in Australia starting in 1978, before returning to North America for some years, where he covered the 1983 America's Cup. He spent a decade presenting on 2UE late at night beginning in 1987. He spent a year in 2000 presenting the 2GB morning shift.
Zemanek moved to Melbourne for a short stint with 3AW's drive program in 2002 before moving back to Sydney and 2UE in 2003, having failed to garner ratings, and publicly falling out with several members of the 3AW's broadcast team.
While popular with much of his audience, Stan often boasted about being the most complained-about broadcaster in the country, polarising opinions of those who did not agree with his right-wing beliefs. He was not shy to admit that he was politically biased and often criticised "idiot Labor voters" for not doing the same. His most commonly used terms were "numb nuts", "turn it up", "half-wit", "oxygen thief", "left-wing looney", "give yourself an uppercut" and "typical Labor voter"; and he once asked a caller who sounded to be a little slow 'are you smoking the wacky-tobacky', a slang reference to marijuana.
In 2003, following his return to 2UE, he received a bombardment of calls from a number of people he referred to as 'The Phone Box Boys', thinking they were all calling him from a phone box. The calls would sometimes reach 20 a night, and would spin several staples of Zemanek such as sound effects, on Stan himself. This led to an enormous spike in his ratings for the period of March–July 2003.
Zemanek had an ongoing rivalry with fellow 2UE colleague and breakfast host Mike Carlton, ever since Carlton revealed on-air that Zemanek was about to move to 2GB. An angry Zemanek called for Carlton to be sacked and for the Australian Broadcasting Authority to investigate him for "irresponsible journalism". The "debate" between the two broadcasters degenerated over the next few days, with Carlton calling Zemanek "a little shit", "a village idiot", and "a stunted runt" and Zemanek calling Carlton "a turd" and "a ponce" with "his head up his backside". After Zemanek's death, Carlton stated on his breakfast show at 2UE that he hated Zemanek and would only attend his funeral to check that he was really dead, causing 2UE management to publicly denounce Carlton. Carlton made his comment while showbiz reporter Peter Ford was doing a |
https://en.wikipedia.org/wiki/Tail%20call | In computer science, a tail call is a subroutine call performed as the final action of a procedure. If the target of a tail is the same subroutine, the subroutine is said to be tail recursive, which is a special case of direct recursion. Tail recursion (or tail-end recursion) is particularly useful, and is often easy to optimize in implementations.
Tail calls can be implemented without adding a new stack frame to the call stack. Most of the frame of the current procedure is no longer needed, and can be replaced by the frame of the tail call, modified as appropriate (similar to overlay for processes, but for function calls). The program can then jump to the called subroutine. Producing such code instead of a standard call sequence is called tail-call elimination or tail-call optimization. Tail-call elimination allows procedure calls in tail position to be implemented as efficiently as goto statements, thus allowing efficient structured programming. In the words of Guy L. Steele, "in general, procedure calls may be usefully thought of as GOTO statements which also pass parameters, and can be uniformly coded as [machine code] JUMP instructions."
Not all programming languages require tail-call elimination. However, in functional programming languages, tail-call elimination is often guaranteed by the language standard, allowing tail recursion to use a similar amount of memory as an equivalent loop. The special case of tail-recursive calls, when a function calls itself, may be more amenable to call elimination than general tail calls. When the language semantics do not explicitly support general tail calls, a compiler can often still optimize sibling calls, or tail calls to functions which take and return the same types as the caller.
Description
When a function is called, the computer must "remember" the place it was called from, the return address, so that it can return to that location with the result once the call is complete. Typically, this information is saved on the call stack, a list of return locations in the order that the call locations were reached. For tail calls, there is no need to remember the caller – instead, tail-call elimination makes only the minimum necessary changes to the stack frame before passing it on, and the tail-called function will return directly to the original caller. The tail call doesn't have to appear lexically after all other statements in the source code; it is only important that the calling function return immediately after the tail call, returning the tail call's result if any, since the calling function is bypassed when the optimization is performed.
For non-recursive function calls, this is usually an optimization that saves only a little time and space, since there are not that many different functions available to call. When dealing with recursive or mutually recursive functions where recursion happens through tail calls, however, the stack space and the number of returns saved can grow to be very sig |
https://en.wikipedia.org/wiki/Odin%20Computer%20Graphics | Odin Computer Graphics were a Liverpool-based computer games developer who came to prominence in the mid-1980s with a variety of titles for the ZX Spectrum, Commodore 64 and Amstrad CPC home computers.
History
Odin consisted of Managing Director Paul McKenna; programmers Steve Wetherill, Robbie Tinman, Marc Dawson (now Wilding), Keith Robinson, George Barnes, Tommy Laningan, Derrick Rowson, and Stefan Walker; artists Paul Salmon, Stuart Fotheringham, and Colin Grunes; and musician Keith Tinman. Bernie Duggs and musician Fred Gray are also credited. Fotheringham and Dawson had previously worked for Software Projects. Some other staff members had previously worked for Imagine Software.
Prior to the release of their debut title, Nodes of Yesod, in 1985, Odin had previously released a number of games under the name Thor. Although they developed a couple of in-house titles as Thor, they mainly acquired the publishing rights to homegrown titles from anonymous bedroom programmers. These early titles were mostly regarded as critical disappointments but not commercial failures. When Thor decided to switch to in-house development, Paul McKenna (managing director & owner) thought it appropriate to form a new company, hence Odin Computer Graphics was born.
Nodes of Yesod became an instant critical and commercial success, prompting Telecomsoft (the software division of British Telecom) to offer them a six-figure contract to develop ten games within a 12-month period. While Odin's later games (including Robin of the Wood and Heartland) were very well received, some later titles failed to live up to expected BT standards. During this period, the warehouse area attached to the Odin studio was used by Telecomsoft as a distribution warehouse and to store thousands of copies of games on their Firebird, Rainbird and Beyond labels.
Just prior to the Telecom deal Odin had secured a major contract with Capcom. They were to develop Robin Hood for coin-operated arcade machines and Capcom's Gun.Smoke for the home computer format. Unfortunately the contracts arrived a day late. Paul McKenna still has the original contracts from Capcom in his possession.
Odin made a very deliberate attempt to ensure they were mistaken for Ultimate Play the Game, one of the most critically acclaimed game developers of the 1980s. As well as establishing a very similar name (Odin Computer Graphics vs. Ashby Computer Graphics), many of their games were heavily inspired by Ultimate's output (Odin's Nodes of Yesod certainly owes a considerable debt to Ultimate's Underwurlde). The advertisements for Odin's games, which won many acclaimed awards such as Golden Joystick Awards for best advertising in 1985 and 1986, were reminiscent of 1980s popular print retailer Athena and also bore some resemblance to the highly stylised, airbrushed artwork that graced the adverts for Ultimate's games.
In 1987, Odin finally closed their doors, mainly due to an inability to expand the size of their teams whi |
https://en.wikipedia.org/wiki/English%20Electric%20KDF9 | KDF9 was an early British 48-bit computer designed and built by English Electric (which in 1968 was merged into International Computers Limited (ICL)). The first machine came into service in 1964 and the last of 29 machines was decommissioned in 1980 at the National Physical Laboratory. The KDF9 was designed for, and used almost entirely in, the mathematical and scientific processing fields in 1967, nine were in use in UK universities and technical colleges. The KDF8, developed in parallel, was aimed at commercial processing workloads.
The KDF9 was an early example of a machine that directly supported multiprogramming, using offsets into its core memory to separate the programs into distinct virtual address spaces. Several operating systems were developed for the platform, including some that provided fully interactive use through PDP-8 machines acting as smart terminal servers. A number of compilers were available, notably both checkout and globally optimizing compilers for Algol 60.
Architecture
The logic circuits of the KDF9 were entirely solid-state. The KDF9 used transformer-coupled diode–transistor logic, built from germanium diodes, about 20,000 transistors, and about 2,000 toroid pulse transformers. They ran on a 1 MHz clock that delivered two pulses of 250 ns separated by 500 ns, in each clock cycle. The maximum configuration incorporated 32K words of 48-bit core storage (192K bytes) with a cycle time of 6 microseconds. Each word could hold a single 48-bit integer or floating-point number, two 24-bit integer or floating-point numbers, six 8-bit instruction syllables, or eight 6-bit characters. There was also provision for efficient handling of double-word (96-bit) numbers in both integer and floating point formats. However, there was no facility for byte or character addressing, so that non-numerical work suffered by comparison. Its standard character set was a version of the Friden Flexowriter paper tape code that was oriented to Algol 60, and included unusual characters such as the Algol subscript 10. However, each other I/O device type implemented its own subset of that. Not every character that could be read from paper tape could be successfully printed, for example.
Registers
The CPU architecture featured three register sets. The Nest was a 16-deep pushdown stack of arithmetic registers, The SJNS (Subroutine Jump Nesting Store) was a similar stack of return addresses. The Q Store was a set of 16 index registers, each of 48 bits divided into Counter (C), Increment (I) and Modifier (M) parts of 16 bits each. Flags on a memory-reference instruction specified whether the address should be modified by the M part of a Q Store, and, if so, whether the C part should be decremented by 1 and the M part incremented by the contents of the I part. This made the coding of counting loops very efficient. Three additional Nest levels and one additional SJNS level were reserved to Director, the Operating System, allowing short-path interrupts to |
https://en.wikipedia.org/wiki/Molecule%20editor | A molecule editor is a computer program for creating and modifying representations of chemical structures.
Molecule editors can manipulate chemical structure representations in either a simulated two-dimensional space or three-dimensional space, via 2D computer graphics or 3D computer graphics, respectively. Two-dimensional output is used as illustrations or to query chemical databases. Three-dimensional output is used to build molecular models, usually as part of molecular modelling software packages.
Database molecular editors such as Leatherface, RECAP, and Molecule Slicer allow large numbers of molecules to be modified automatically according to rules such as 'deprotonate carboxylic acids' or 'break exocyclic bonds' that can be specified by a user.
Molecule editors typically support reading and writing at least one file format or line notation. Examples of each include Molfile and simplified molecular input line entry specification (SMILES), respectively.
Files generated by molecule editors can be displayed by molecular graphics tools.
Standalone programs
Java Applets
JavaScript embeddable editors
See also
ChemSpider
Comparison of software for molecular mechanics modeling
Molecular design software
Notes and references
External links
Molecular structure input on the web
The Chemical Structure Editor: Bridging Chemistry and Cheminformatics
Chemistry software
Computational chemistry |
https://en.wikipedia.org/wiki/.do | .do is the country code top-level domain (ccTLD) for the Dominican Republic. The Network Information Center .do has administered the domain since 1991.
Domains available
Source:
.do: General use
Second-level
art.do: Arts institutions
com.do: Commercial organizations
edu.do: Academic institutions
gob.do/gov.do: Governmental institutions
mil.do: Military institutions
net.do: Internet service providers
org.do: Nongovernmental institutions
sld.do: Institutions of health
See also
Internet in the Dominican Republic
References
External links
IANA .do whois information
NIC - Network Information Center
Communications in the Dominican Republic
Computer-related introductions in 1991
Country code top-level domains
Internet in the Dominican Republic
sv:Toppdomän#D |
https://en.wikipedia.org/wiki/.dz | .dz is the country code top-level domain (ccTLD) for Algeria (from , the local name for Algeria).
It is administered by the DZ Network Internet Center, a subdivision of CERIST (Centre de Recherche sur l'Information Scientifique et Technique). To apply for a .dz domain name, one must be an entity established in Algeria and/or having legal representation in Algeria and/or having a document justifying the name ownership rights in the country. Currently, NIC.DZ charges 1000 Algerian dinars per year for a domain (about US$).
Second-level domains
Registrations are taken directly at the second level, or at the third level beneath these names:
.com.dz: Commercial entities
.gov.dz: Governmental entities
.org.dz: Entities appointing non-governmental and non-commercial organizations
.edu.dz: Entities of education
.asso.dz: Approved associations
.pol.dz: Political parties
.art.dz: Arts
.net.dz: Network providers/operators and entities operating in other back-end internet services
.tm.dz: Entities, residing abroad, which possess protected trademarks covered in Algeria and having no document justifying an activity or presence in Algeria.
.soc.dz: Natural persons, residing in Algeria, who possess protected trademarks in Algeria and do not exercise a commercial activity (not having Algerian Trade certificate)
Second top-level domain
A second, internationalised top-level domain will be used for Algeria, intended for domain names in the local language, using Arabic characters: الجزائر. It was registered in 2011 and is represented as .xn--lgbbat1ad8j for the DNS name.
See also
Internet in Algeria
References
External links
IANA .dz whois information
NIC.DZ
CERIST
Ministry of Posts and Telecommunications
Internet in Algeria
Mass media in Algeria
Country code top-level domains
Communications in Algeria
Council of European National Top Level Domain Registries members
sv:Toppdomän#D |
https://en.wikipedia.org/wiki/.fo | .fo is the country code top-level domain (ccTLD) for the Faroe Islands.
History
The .fo domain was operated by UNI-C, the Danish University Network organisation until June 1997. It then passed under the control of Tele2 DK, who had bought the activities of UNI-C as part of a privatisation.
In July 1998, the operation was handed to nic.fo as a gesture of good will, and recognition that .fo was indeed Faroese.
Registration rules
Type A registrations must respond to a trademark of the registrant.
Type B registrations are possible if you do not hold a matching trademark. Any entity which owns the corresponding trademark can file an opposition within 20 days after the domain registration and be awarded the concerned domain name itself.
References
External links
.fo domain registration website
IANA .fo whois information
Country code top-level domains
Communications in the Faroe Islands
1993 establishments in Denmark
Council of European National Top Level Domain Registries members
Computer-related introductions in 1993
sv:Toppdomän#F |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.