source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Silmarils%20%28company%29 | Silmarils was a French computer game software company founded in 1987 by Louis-Marie and André Rocques. It produced games for PC, Amiga, Amstrad CPC, Macintosh, Atari ST and Atari Falcon.
The company is most closely associated with its Ishar series. Crystals of Arborea was one of the first games to offer real-time 3D environment and a large world with very few limits on movement. The company went bankrupt in 2003, and in 2004 the Rocques brothers and another former Silmarils member, Pascal Einsweiler, founded a new studio called Eversim, specializing in political strategy games.
It was named after J. R. R. Tolkien's Silmarils.
Games
1987
Manhattan Dealers
1988
Mad Show
1989
Le Fetiche Maya
Targhan (planned for Sega Genesis)
Windsurf Willy
1990
Colorado (planned for Sega Genesis)
Crystals of Arborea
Star Blade (planned for Sega Genesis)
1991
Boston Bomb Club
Metal Mutant
Storm Master
Xyphoes Fantasy
1992
Bunny Bricks
Ishar I: Legend of the Fortress
1993
Ishar II: Messengers of Doom
Transarctica
1994
Robinson's Requiem
Ishar 3: The Seven Gates of Infinity
1996
Deus
1997
Time Warriors
1998
Asghan: The Dragon Slayer
2001
Arabian Nights
Les Visiteurs: La Relique de Sainte Rolande
2003
Inspector Gadget: Mad Robots Invasion
unknown
Asghan 2
References
External links
Video game companies established in 1987
Video game companies disestablished in 2003
Defunct video game companies of France
Things named after Tolkien works |
https://en.wikipedia.org/wiki/LIS | LIS or LiS may refer to:
Computing
LIS (programming language)
Lis (linear algebra library), library of iterative solvers for linear systems
Laboratory information system, databases oriented towards medical laboratories
Land information system, land mapping and cadastre GIS used by local governments
Language-independent specification, a programming language specification
Legume Information System, online resources and exploratory tools for legume researchers and breeders
Linear Integrated Systems, American manufacturer of semiconductors
Local information systems, collect, store, and disseminate information about small geographic areas
Location information server, provides location information
Longest increasing subsequence, algorithm to find the longest increasing subsequence in an array of numbers
Science
Laser Isotope Separation, a means of producing enriched uranium from uranium ore
Lateral internal sphincterotomy, an operation for the treatment of chronic anal fissure
Lightning Imaging Sensor, an instrument on the TRMM satellite and on the International Space Station
Liquid-impregnated surface
Locked-in syndrome, a type of paralysis
Library and information science
Other
Lis (given name)
Lis (surname)
Lis River, a river in Portugal
Lis coat of arms, of Polish Clan Lis
Lis, Albania, in the Mat municipality of Dibër County
Italian Sign Language (Lingua dei Segni Italiana)
Life Is Strange (series), a series of episodic graphic adventure games.
Life Is Strange (2015 video game)
Lithium-sulphur battery (Li-S)
Locate in Scotland (1981–2001), replaced by Scottish Development International
London Interdisciplinary School, alternative university in England
Lisbon Airport, Portugal, IATA code |
https://en.wikipedia.org/wiki/SIPRNet | The Secret Internet Protocol Router Network (SIPRNet) is "a system of interconnected computer networks used by the U.S. Department of Defense and the U.S. Department of State to transmit classified information (up to and including information classified SECRET) by packet switching over the 'completely secure' environment". It also provides services such as hypertext document access and electronic mail. As such, SIPRNet is the DoD's classified version of the civilian Internet.
SIPRNet is the secret component of the Defense Information Systems Network. Other components handle communications with other security needs, such as the NIPRNet, which is used for nonsecure communications, and the Joint Worldwide Intelligence Communications System (JWICS), which is used for Top Secret communications.
Access
According to the U.S. Department of State Web Development Handbook, domain structure and naming conventions are the same as for the open internet, except for the addition of a second-level domain, like, e.g., "sgov" between state and gov: openforum.state.sgov.gov. Files originating from SIPRNet are marked by a header tag "SIPDIS" (SIPrnet DIStribution). A corresponding second-level domain smil.mil exists for DoD users.
Access is also available to a "...small pool of trusted allies, including Australia, Canada, the United Kingdom and New Zealand...". This group (including the US) is known as the Five Eyes.
SIPRNet was one of the networks accessed by Chelsea Manning, convicted of leaking the video used in WikiLeaks' "Collateral Murder" release as well as the source of the US diplomatic cables published by WikiLeaks in November 2010.
Alternate names
SIPRNet and NIPRNet are referred to colloquially as SIPPERnet and NIPPERnet (or simply sipper and nipper), respectively.
See also
CAVNET
Classified website
NIPRNet
RIPR
Intellipedia
Protective distribution system
NATO CRONOS
References
External links
DISA
Secret Internet Protocol Router Network (SIPRNET) by the Federation of American Scientists' Intelligence Resource Program
They've Got Learning Locked Down – article detailing U.S. Coast Guard Academy classroom being first to get access to SIPRNet
BBC Article on SIPRNet
Wide area networks
Cryptography
United States government secrecy
Military communications of the United States |
https://en.wikipedia.org/wiki/Forward%20algorithm | The forward algorithm, in the context of a hidden Markov model (HMM), is used to calculate a 'belief state': the probability of a state at a certain time, given the history of evidence. The process is also known as filtering. The forward algorithm is closely related to, but distinct from, the Viterbi algorithm.
The forward and backward algorithms should be placed within the context of probability as they appear to simply be names given to a set of standard mathematical procedures within a few fields. For example, neither "forward algorithm" nor "Viterbi" appear in the Cambridge encyclopedia of mathematics. The main observation to take away from these algorithms is how to organize Bayesian updates and inference to be efficient in the context of directed graphs of variables (see sum-product networks).
For an HMM such as this one:
this probability is written as . Here is the hidden state which is abbreviated as and are the observations to .
The backward algorithm complements the forward algorithm by taking into account the future history if one wanted to improve the estimate for past times. This is referred to as smoothing and the forward/backward algorithm computes for . Thus, the full forward/backward algorithm takes into account all evidence. Note that a belief state can be calculated at each time step, but doing this does not, in a strict sense, produce the most likely state sequence, but rather the most likely state at each time step, given the previous history. In order to achieve the most likely sequence, the Viterbi algorithm is required. It computes the most likely state sequence given the history of observations, that is, the state sequence that maximizes .
History
The forward algorithm is one of the algorithms used to solve the decoding problem. Since the development of speech recognition and pattern recognition and related fields like computational biology which use HMMs, the forward algorithm has gained popularity.
Algorithm
The goal of the forward algorithm is to compute the joint probability , where for notational convenience we have abbreviated as and as . Computing directly would require marginalizing over all possible state sequences , the number of which grows exponentially with . Instead, the forward algorithm takes advantage of the conditional independence rules of the hidden Markov model (HMM) to perform the calculation recursively.
To demonstrate the recursion, let
.
Using the chain rule to expand , we can then write
.
Because is conditionally independent of everything but , and is conditionally independent of everything but , this simplifies to
.
Thus, since and are given by the model's emission distributions and transition probabilities, one can quickly calculate from and avoid incurring exponential computation time.
The initial condition is set as some prior probability over as
such that
Once the joint probability has been computed using the forward algorithm, we can easily obtain the |
https://en.wikipedia.org/wiki/Bob%20%26%20Rose | Bob & Rose is a British television drama, originally screened in six one-hour episodes on the ITV network in the UK in Autumn 2001. It was produced by the independent Red Production Company, and was that company's first prime-time drama for the ITV network.
Bob & Rose was the inspiration for Jules & Mimi, the fictional British television show featured in Sex and the City.
Production
The series was written by Russell T Davies, who had previously been responsible for the much-discussed Channel 4 drama Queer as Folk, another Red Production Company programme.
Bob was played by stand-up comedian and actor Alan Davies (no relation to writer Russell), who was at the time best known for his lead role in the BBC television mystery series Jonathan Creek. Rose was played by actress Lesley Sharp, who was nominated for the BAFTA and Royal Television Society Best Actress awards for the part. Although critically well-received, Bob & Rose was not a huge success in terms of audience share for ITV, and the final two episodes were relegated from prime-time to later night slots.
Plot
The story follows the life of gay school teacher Bob who is fed up with the shallowness of the gay club scene in Manchester. A romantic at heart, Bob yearns to meet the right person and settle down. After yet another unsuccessful date, he meets Rose while they are both waiting for a taxi cab. Rose is disenchanted with her down-to-earth boyfriend and is smitten with Bob but she does not initially realise he is gay. Subsequent episodes chart their on-off love affair which is bedeviled by the activities of Bob's best friend Holly. Holly (Jessica Hynes) is secretly in love with Bob and does everything she can to quietly interfere with Bob's relationships with men because she does not want to lose him. Privately she is lonely and her only social life is through Bob and the gay clubs he visits. When Rose suddenly appears on the scene, Holly sees her as a threat, stalks her and may (or may not – the plot leaves the final matter in doubt) conspire with Bob's former boyfriend Carl to split Bob and Rose up. A situation is created which suggests Bob may have had a one-night stand with Carl and Holly deliberately preys on Rose's insecurities and creates further doubts. Eventually, she outright lies to Rose.
The story also follows the attempts of Rose's mother to find a reliable boyfriend, and Bob's campaigning mother who runs a fictional gay support group called "Parents Against Homophobia" (PAH!). The series is a gentle romantic comedy with each episode managing to end at an emotional or comic climax – as when Bob follows Rose down the street after they argue in a pub. He admits that their first heterosexual sex act has confused him but he wants to do it again. Equally confused, Rose turns towards the camera and unromantically says: "Oh bollocks!" and the credits roll.
The script takes some shrewd looks at emotions and motivations but also contrasts the different atmosphere and attitudes |
https://en.wikipedia.org/wiki/Hash%20key | Hash key may refer to:
Number sign, also known as the number, pound or hash key, a key on a telephone keypad
For its use in data structure, database and cryptographic applications, see hash function or unique key |
https://en.wikipedia.org/wiki/Catch%20%27em%20if%20You%20Can | "Catch 'em if You Can" is the eighteenth episode of the fifteenth season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on April 25, 2004.
Plot
Bart lectures the other students on the bus on the topic of water balloons. After he hits Lisa with one she fights with him all the way home. Marge stops them and tells the pair that they are going to Ohio to celebrate Uncle Tyrone's birthday. Bart and Lisa are saddened with the idea as Tyrone complained last year about why he is still alive. Homer and Marge relent and allow the kids to stay home; but Marge insists they do one family activity together. They all rent a romantic film; Bart and Lisa are unimpressed by it such that they ruin any moment the film might have created for Homer and Marge.
Homer and Marge look forward to their trip without the children as they ruin every possible chance of intimacy for them. At the airport the next day, they see people in another queue, dressed in Hawaiian shirts and skimpy tops, going to Miami. This causes them to reminisce on their less-than-stellar honeymoon at a beach billboard in a run-down area of Springfield. On a whim, they decide to forego visiting Tyrone and get on the plane to Miami as a second honeymoon. As the flight is overbooked, they are upgraded to first-class, much to their delight.
Bart, Lisa and Grampa learn on the news that the hotel in Dayton where Marge and Homer are supposed to be staying has been completely wiped out by a tornado. They suddenly get a call from Marge, informing them that all is well. Suspicious, Bart uses last-call return to find out the last incoming phone number and discovers their parents are in Miami. He and Lisa get Grampa to take them there.
Homer and Marge see the children waiting for them outside their hotel room door, so they run from the ready-to-track-them-down pair, causing Bart and Lisa to summon a hot pursuit of their parents in an instrumental musical montage and an animated sequence. They will not have any trouble paying for their chase, considering Homer has borrowed Ned Flanders' credit card and Bart has borrowed Rod Flanders' credit card. Meanwhile, in Miami, Grampa finds companionship with an old man named Raúl who responds by turning his hearing aid off.
Homer and Marge finally find themselves at the Niagara Falls, only to find the children are already there. When Bart and Lisa confront them, they agree to let them mess about in the room, making them even more despondent. The next day, Bart and Lisa, feeling a little guilty, decide to give their parents some space, and go to an amusement park, inadvertently running into Homer and Marge who snuck off for some time alone. Refusing to allow Lisa to explain, an angry Homer and Marge start running away again and find refuge in a giant inflatable castle, which their lovemaking antics cause them to fall into the Niagara River. The Canadian and American rescue teams start to fight over who is |
https://en.wikipedia.org/wiki/Packet%20forwarding | Packet forwarding is the relaying of packets from one network segment to another by nodes in a computer network. The network layer in the OSI model is responsible for packet forwarding.
Models
The simplest forwarding modelunicastinginvolves a packet being relayed from link to link along a chain leading from the packet's source to its destination. However, other forwarding strategies are commonly used. Broadcasting requires a packet to be duplicated and copies sent on multiple links with the goal of delivering a copy to every device on the network. In practice, broadcast packets are not forwarded everywhere on a network, but only to devices within a broadcast domain, making broadcast a relative term. Less common than broadcasting, but perhaps of greater utility and theoretical significance, is multicasting, where a packet is selectively duplicated and copies delivered to each of a set of recipients.
Networking technologies tend to naturally support certain forwarding models. For example, fiber optics and copper cables run directly from one machine to another to form a natural unicast mediadata transmitted at one end is received by only one machine at the other end. However, as illustrated in the diagrams, nodes can forward packets to create multicast or broadcast distributions from naturally unicast media. Likewise, traditional Ethernet (10BASE5 and 10BASE2, but not the more modern 10BASE-T) are natural broadcast mediaall the nodes are attached to a single long cable and a packet transmitted by one device is seen by every other device attached to the cable. Ethernet nodes implement unicast by ignoring packets not directly addressed to them. A wireless network is naturally multicast all devices within a reception radius of a transmitter can receive its packets. Wireless nodes ignore packets addressed to other devices, but require forwarding to reach nodes outside their reception radius.
Decisions
At nodes where multiple outgoing links are available, the choice of which, all, or any to use for forwarding a given packet requires a decision-making process that, while simple in concept, is sometimes bewilderingly complex. Since a forwarding decision must be made for every packet handled by a node, the total time required for this can become a major limiting factor in overall network performance. Much of the design effort of high-speed routers and switches has been focused on making rapid forwarding decisions for large numbers of packets.
The forwarding decision is generally made using one of two processes: routing, which uses information encoded in a device's address to infer its location on the network, or bridging, which makes no assumptions about where addresses are located and depends heavily on broadcasting to locate unknown addresses. The heavy overhead of broadcasting has led to the dominance of routing in large networks, particularly the Internet; bridging is largely relegated to small networks where the overhead of broadcasting is tole |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Florida | The following is a list of FCC-licensed radio stations in the U.S. state of Florida, which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
Defunct
WAGE
WAXA
WBFT-LP
WCFI
WCFQ-LP
WCNU
WDDV
WDSP
WEAG
WEKJ-LP
WFAB
WFHA-LP
WFLA (Boca Raton, Florida)
WFBO-LP
WFJV-LP
WFLP-LP
WFLU-LP
WFSH
WFSX
WFTI-FM
WGAG-FM
WGOT-LP
WGRV-LP
WHBT
WHTR-LP
WINV
WKGC
WKIZ
WKJO-LP
WLAS-LP
WLMS
WLVF (AM)
WMJX
WNOG
WNPL
WNRG-LP
WORZ-LP
WPCU-LP
WPLP
WRAP
WREH
WSBR
WSUN
WSVE
WTHA-LP
WTKP
WVFP-LP
WVOI
WVST
WWSD
WYFR
WZRO-LP
See also
WRMI, a shortwave radio station that broadcasts from Okeechobee, Florida
Florida media
List of newspapers in Florida
List of television stations in Florida
Media of cities in Florida: Fort Lauderdale, Gainesville, Jacksonville, Key West, Lakeland, Miami, Orlando, St. Petersburg, Tallahassee, Tampa
References
Bibliography
+ FM Stations on the Air: Florida
External links
(Directory ceased in 2017)
Florida Association of Broadcasters
Florida Antique Wireless Group (est. 1991)
Jacksonville Antique Radio Society (est. 2001)
Images
Florida
Florida-related lists |
https://en.wikipedia.org/wiki/Nielsen%20Holdings | Nielsen Holdings plc is an American information, data and market measurement firm. Nielsen operates in over 100 countries and employs approximately 44,000 people worldwide.
The company was listed on the New York Stock Exchange (NYSE) and used to be a component of the S&P 500.
History
Formation
Nielsen was founded in 1923 by Arthur C. Nielsen, Sr., who invented an approach to measuring competitive sales results that made the concept of "market share" a practical management tool. The company was originally incorporated in the Netherlands and later was purchased on May 24, 2006, by a consortium of private equity firms.
Merger and listing
In January 2011, Nielsen consummated an initial public offering of common stock and, subsequently, started trading on the New York Stock Exchange under the symbol "NLSN". On August 31, 2015, Nielsen N.V., a Dutch public company listed on the New York Stock Exchange, merged with Nielsen Holdings plc, by way of a cross-border merger under the European Cross-Border Merger Directive, with Nielsen Holdings plc being the surviving company. The merger effectively changed the place of incorporation of Nielsen's publicly traded parent holding company from the Netherlands to England and Wales, with no changes made to the business being conducted by Nielsen prior to the merger.
2022 buyout
In March 2022, Nielsen announced that it had accepted a $16 billion offer from a group of private equity investors led by Elliott Investment Management subsidiary Evergreen Coast Capital Corp., and Brookfield Business Partners. The Nielsen board of directors had turned down an initial $9 billion offer from the investment consortium. The transaction was completed in October 2022.
Company information
Nielsen is a global, independent measurement and data company for fast-moving consumer goods, consumer behavior, and media. With a presence in more than 100 countries and services covering more than 90% of the globe's GDP and population, Nielsen provides clients with data about what consumers watch (programming, advertising) and what they buy (categories, brands, products) on a global and local basis and how those choices intersect.
The company's operations span developing and emerging markets worldwide, in more than 100 countries. According to SEC records, on February 26, 2015, Nielsen N.V., announced that its board of directors unanimously approved a proposal that resulted in a change in the company's legal domicile, from the Netherlands to the United Kingdom. Upon approval, the company became incorporated under English law and was registered as a public limited company to be named Nielsen Holdings PLC.
Up to 2022, James Attwood Jr. was Nielsen's non-executive chairman, who succeeded Dave Calhoun as Executive Chairman in January 2016. Prior to joining Nielsen as CEO in 2006, Dave Calhoun served as Vice Chairman of the General Electric Company and President and Chief Executive Officer of GE Infrastructure, the largest of six GE business |
https://en.wikipedia.org/wiki/Logistello | Logistello is a computer program that plays the game Othello, also known as Reversi. Logistello was written by Michael Buro and is regarded as a strong player, having beaten the human world champion Takeshi Murakami six games to none in 1997 — the best Othello programs are now much stronger than any human player. Logistello's evaluation function is based on disc patterns and features over a million numerical parameters which were tuned using linear regression.
See also
Computer Othello
External links
Game artificial intelligence
Reversi software |
https://en.wikipedia.org/wiki/ESDP | The acronym ESDP may refer to:
European Security and Defence Policy the former name of the European Union's Common Security and Defence Policy
The European Spatial Development Planning network
European Spatial Development Perspective
Essential Skills Development Program at Humber College - Lakeshore Campus
Enhanced Service Discovery Protocol - Bluetooth.org
The Egyptian Social Democratic Party |
https://en.wikipedia.org/wiki/Database%20abstraction%20layer | A database abstraction layer (DBAL or DAL) is an application programming interface which unifies the communication between a computer application and databases such as SQL Server, IBM Db2, MySQL, PostgreSQL, Oracle or SQLite. Traditionally, all database vendors provide their own interface that is tailored to their products. It is up to the application programmer to implement code for the database interfaces that will be supported by the application. Database abstraction layers reduce the amount of work by providing a consistent API to the developer and hide the database specifics behind this interface as much as possible. There exist many abstraction layers with different interfaces in numerous programming languages. If an application has such a layer built in, it is called database-agnostic.
Database levels of abstraction
Physical level (lowest level)
The lowest level connects to the database and performs the actual operations required by the users. At this level the conceptual instruction has been translated into multiple instructions that the database understands. Executing the instructions in the correct order allows the DAL to perform the conceptual instruction.
Implementation of the physical layer may use database-specific APIs or use the underlying language standard database access technology and the database's version SQL.
Implementation of data types and operations are the most database-specific at this level.
Conceptual or logical level (middle or next highest level)
The conceptual level consolidates external concepts and instructions into an intermediate data structure that can be devolved into physical instructions. This layer is the most complex as it spans the external and physical levels. Additionally it needs to span all the supported databases and their quirks, APIs, and problems.
This level is aware of the differences between the databases and able to construct an execution path of operations in all cases. However the conceptual layer defers to the physical layer for the actual implementation of each individual operation.
External or view level
The external level is exposed to users and developers and supplies a consistent pattern for performing database operations.
Database operations are represented only loosely as SQL or even database access at this level.
Every database should be treated equally at this level with no apparent difference despite varying physical data types and operations.
Database abstraction in the API
Libraries unify access to databases by providing a single low-level programming interface to the application developer. Their advantages are most often speed and flexibility because they are not tied to a specific query language (subset) and only have to implement a thin layer to reach their goal. As all SQL dialects are similar to one another, application developers can use all the language features, possibly providing configurable elements for database-specific cases, such as typically user-IDs |
https://en.wikipedia.org/wiki/WxPython | wxPython is a wrapper for the cross-platform GUI API (often referred to as a "toolkit") wxWidgets (which is written in C++) for the Python programming language. It is one of the alternatives to Tkinter. It is implemented as a Python extension module (native code).
History
In 1995, Robin Dunn needed a GUI application to be deployed on HP-UX systems but also run Windows 3.1 within short time frame. He needed a cross-platform solution. While evaluating free and commercial solutions, he ran across Python bindings on the wxWidgets toolkit webpage (known as wxWindows at the time). This was Dunn's introduction to Python. Together with Harri Pasanen and Edward Zimmerman he developed those initial bindings into wxPython 0.2.
In August 1998, version 0.3 of wxPython was released. It was built for wxWidgets 2.0 and ran on Win32, with a wxGTK version in the works.
The first versions of the wrapper were created by hand. However, the code became difficult to maintain and keep synchronized with wxWidgets releases. By 1997, versions were created with SWIG, greatly decreasing the amount of work to update the wrapper.
Project Phoenix
In 2010, the Project Phoenix began; an effort to clean up the wxPython implementation and in the process make it compatible with Python 3. The project is a new implementation of wxPython, focused on improving speed, maintainability and extensibility. Like the previous version of wxPython, it wraps the wxWidgets C++ toolkit and provides access to the user interface portions of the wxWidgets API.
With the release of 4.0.0a1 wxPython in 2017, the Project Phoenix version became the official version. wxPython 4.x is the current version being developed as of June 2022.
Use
wxPython enables Python to be used for cross-platform GUI applications requiring very little, if any, platform-specific code.
Example
This is a simple "Hello world" module, depicting the creation of the two main objects in wxPython (the main window object and the application object), followed by passing the control to the event-driven system (by calling MainLoop()) which manages the user-interactive part of the program.
#!/usr/bin/env python3
import wx
app = wx.App(False) # Create a new app, don't redirect stdout/stderr to a window.
frame = wx.Frame(None, title="Hello World") # A Frame is a top-level window.
frame.Show(True) # Show the frame.
app.MainLoop()
This is another example of the wxPython Close Button with wxPython GUI display show in Windows 10 operating system.
import wx
class WxButton(wx.Frame):
def __init__(self, *args, **kw):
super(WxButton, self).__init__(*args, **kw)
self.InitUI()
def InitUI(self):
pnl = wx.Panel(self)
closeButton = wx.Button(pnl, label='Close Me', pos=(20, 20))
closeButton.Bind(wx.EVT_BUTTON, self.OnClose)
self.SetSize((350, 250))
self.SetTitle('Close Button')
self.Centre()
def OnClose(self, e):
self.Close(True)
def main():
app |
https://en.wikipedia.org/wiki/Beyond%20Zork | Beyond Zork (full title: Beyond Zork: The Coconut of Quendor) is an interactive fiction computer game written by Brian Moriarty and released by Infocom in 1987. It was one of the last games in the Zork series developed by Infocom (titles such as Zork Nemesis and Zork: Grand Inquisitor were created after Activision had dissolved Infocom as a company and kept the Infocom brand name). It signified a notable departure from the standard format of Infocom's earlier games which relied purely on text and puzzle-solving: among other features, Beyond Zork incorporated a crude on-screen map, the use of character statistics and levels, and RPG combat elements.
The game, Infocom's twenty-ninth, was available on the Amiga (512KB), Apple (128KB), Atari ST, Commodore 128, IBM (192KB), and the Macintosh (512KB) computers. Beyond Zork was one of 20 Infocom games bundled in the 1991 compilation The Lost Treasures of Infocom published by Activision.
Plot
The player explores the Southlands of Quendor somewhat aimlessly at first. Soon, however, a task is bestowed by the Implementors, a group of godlike creatures jokingly based on Infocom's game designers. The Coconut of Quendor, a mighty artifact that embodies the whole of Magic, has fallen into the claws of an unspeakably foul beast: an Ur-grue. Rumoured to be the spirits of fallen Implementors, Ur-Grues can surround themselves in a sphere of darkness that only sunlight can pierce. The player must recover the Coconut from this monster's grasp or face the unthinkable consequences.
Ur-grue
Beyond Zork introduces the "Ur-grue", a being which game materials describe as the progenitor and ruler of the monstrous race of grues—the term "Ur-grue" combines the German prefix ur- signifying "original" and "grue"—as well as the source of many other evil monsters. He is said to have originated as the shade of a "fallen Implementor".
The Ur-Grue character in Beyond Zork may be a reference to Brian Moriarty himself, the creator of the game, who is notably absent from the game's portrayal of an "Implementors' Luncheon", where each Implementor is recognizably based on a member of the Infocom staff. His persona as the progenitor of grues and creator of monsters may be linked to his role as the creator of the games' challenges, Infocom having long made joking references to grues being the foremost example of the Implementors' capricious, sometimes nonsensical design decisions.
The Ur-grue is revealed to be the primary villain of the story. The player, sent to retrieve the Coconut of Quendor from the Implementors, arrives at the Implementors' Luncheon on the Ethereal Plane of Atrii only to find he has been followed by the Ur-grue in shadow form, who takes the opportunity to steal it for himself. The player must then venture into the Ur-grue's extensive underground lair and retrieve it.
The Ur-grue is shown to be a dungeon master of sorts, controlling huge parts of the Zork underground and having accumulated an enormous hoard of t |
https://en.wikipedia.org/wiki/MMDF | MMDF, the Multichannel Memorandum Distribution Facility, is a message transfer agent (MTA), a computer program designed to transmit email.
History
MMDF was originally developed at the University of Delaware in the late 1970s, and provided the initial means of operating CSNET, the predecessor to NSFNET. It grew in popularity throughout the 1980s, and was selected by the Santa Cruz Operation as the MTA it would distribute with SCO UNIX in 1989. It was also adopted as the basis for other commercial efforts, including the gateway used to connect the MCI Mail service to Internet mail. A re-coded variant of MMDF, called Pascal MDF (PMDF) was written at the University of Pennsylvania for VMS and was eventually commercialized through Ned Freed's Innosoft, which subsequently ported PMDF to Tru64 Unix and Solaris. In 1999 PMDF was translated from Pascal to C. The C version of PMDF became the basis of the Sun Java System Messaging Server of Sun Microsystems, while rights to PMDF itself were purchased by Process Software, which then ported PMDF to Linux.
Design philosophy
As its name denotes, MMDF is an MTA oriented around the idea of channels. Each means of formatting and transporting mail into or out of the mail system is a channel, and is implemented by a separate executable. This makes MMDF a highly modular system, with each module having all of the idiosyncratic syntax and semantic information necessary for a particular email technology or network, as well as the least privilege necessary, with the authority of each module partitioned from others. An inbound channel receives messages (via the protocol and in the format it implements) and an outbound channel delivers messages (via its relevant protocol and mapping into the relevant format). Internally, MMDF uses a canonical representation for message content and header, including addresses.
Some examples of MMDF channels are SMTP, UUCP, and local (for delivering mail into local mailboxes and accepting mail submitted on the local system). MMDF was used on the CSNET network.
Message flow
A message that flows through MMDF will typically follow this path:
An inbound channel accepts a message.
It invokes the core of the MMDF system, a program called submit, and feeds it the message as well as the out-of-band information for the message - return address, recipient, etc.
Submit stores the message text after doing any necessary header rewriting, determines what channel(s) will be used to deliver the message, and injects the message into the queues for those channels.
Depending on configuration, submit may then call deliver, or deliver may run later as part of periodic processing. Deliver does no direct processing of messages; instead it invokes outbound (delivery) channels, tells them which messages to process, and gives them a list of recipient addresses for each message.
Each outbound channel delivers the message to those recipients who are to be reached by that channel, and reports to deliver whi |
https://en.wikipedia.org/wiki/Palestinian%20Environmental%20NGOs%20Network | The Palestinian NGOs Network (PNGON) is a non-profit, non-governmental organization with a mandate to protect the environment of Palestine by acting as a coordinating body for Palestinian environmental organizations located in the West Bank and Gaza Strip. PNGON was initiated after the 2000 al-Aqsa Intifada due to heightened demands for Palestinian environmental organizations to defend the Palestinian environment.
PNGON is composed of 21 member organizations with goals covering a wide range of environmental issues such as defending land against misuse, sustainable agriculture, water conservation, rural issues, sustainable development, protection of cultural heritage, health and sanitation, biodiversity protection, human rights and community participation.
PNGON's General Assembly consists of all of its members. The Coordinating Committee consists of seven members who are elected every two years by the General Assembly.
PNGON is an umbrella organization for Palestinian environmental organizations operating in both the West Bank and Gaza Strip. PNGON focuses on protection of the Palestinian environment within the context of Israeli military occupation. Therefore, environmental efforts are coordinated with social justice campaigns and also integrate social, economic and cultural rights to effect environmental protection and defense.
PNGON seeks to raise international awareness, build capacity for environmental advocacy and mobilizes communities to engage in sustainable development. PNGON also encourages cooperation with other developing societies.
The Member Organizations of the PNGON network are:
Al-Ard Society for Environmental Awareness and Protection
Applied Research Institute--Jerusalem (ARIJ)
Center for Agricultural Services (TCAS)
Center for Development in Primary Health Care (CDPHC)- Al Quds University
Institute of Water Studies, Birzeit University
Development and Environment Association—Baladna Cultural Center
Land Research Center (LRC)
LAW-The Palestinian Society for the Protection of Human Rights and the Environment
The Local Committee for the Protection of the Environment, Nablus
MA'AN Development Center
Palestinian Agricultural Relief Committees (PARC)
Palestinian Association for Cultural Exchange (PACE)
Palestinian Hydrology Group (PHG)
Roads and Environmental Safety Center (RESC)
The Society for Environmental Protection, Jenin
Union of Agricultural Work Committees (UAWC)
Union of Palestinian Medical Relief Committees (UPMRC)
Water and Environment Department-Ramallah Municipality
Water and Soil Environmental Research Unit (WSERU), Bethlehem University
Water and Environmental Studies Center (WESC), An-Najah National University
Wildlife Palestine Society (WLPS)
References
External links
Palestinian Environmental NGOs Network
Organizations based in the State of Palestine
Environmental organizations based in the State of Palestine |
https://en.wikipedia.org/wiki/Mobile%20IP | Mobile IP (or MIP) is an Internet Engineering Task Force (IETF) standard communications protocol that is designed to allow mobile device users to move from one network to another while maintaining a permanent IP address. Mobile IP for IPv4 is described in IETF RFC 5944, and extensions are defined in IETF RFC 4721. Mobile IPv6, the IP mobility implementation for the next generation of the Internet Protocol, IPv6, is described in RFC 6275.
Introduction
The Mobile IP allows for location-independent routing of IP datagrams on the Internet. Each mobile node is identified by its home address disregarding its current location in the Internet. While away from its home network, a mobile node is associated with a care-of address which identifies its current location and its home address is associated with the local endpoint of a tunnel to its home agent. Mobile IP specifies how a mobile node registers with its home agent and how the home agent routes datagrams to the mobile node through the tunnel.
Applications
In many applications (e.g., VPN, VoIP), sudden changes in network connectivity and IP address can cause problems. Mobile IP was designed to support seamless and continuous Internet connectivity.
Mobile IP is most often found in wired and wireless environments where users need to carry their mobile devices across multiple LAN subnets. Examples of use are in roaming between overlapping wireless systems, e.g., IP over DVB, WLAN, WiMAX and BWA.
Mobile IP is not required within cellular systems such as 3G, to provide transparency when Internet users migrate between cellular towers, since these systems provide their own data link layer handover and roaming mechanisms. However, it is often used in 3G systems to allow seamless IP mobility between different packet data serving node (PDSN) domains.
Operational principles
The goal of IP Mobility is to maintain the TCP connection between a mobile host and a static host while reducing the effects of location changes while the mobile host is moving around, without having to change the underlying TCP/IP. To solve the problem, the RFC allows for a kind of proxy agent to act as a middle-man between a mobile host and a correspondent host.
A mobile node has two addresses – a permanent home address and a care-of address (CoA), which is associated with the network the mobile node is visiting. Two kinds of entities comprise a Mobile IP implementation:
A home agent (HA) stores information about mobile nodes whose permanent home address is in the home agent's network. The HA acts as a router on a mobile host's (MH) home network which tunnels datagrams for delivery to the MH when it is away from home, maintains a location directory (LD) for the MH.
A foreign agent (FA) stores information about mobile nodes visiting its network. Foreign agents also advertise care-of addresses, which are used by Mobile IP. If there is no foreign agent in the host network, the mobile device has to take care of getting an address an |
https://en.wikipedia.org/wiki/WebGain | WebGain was a jointly funded venture between Warburg Pincus and BEA Systems. The objective of the company was to acquire existing Java EE /Java programming language development tools and roll them together into a single application development environment: WebGain studio. In April 2000, WebGain acquired the company The Object People, and their TopLink product-line became the property of WebGain.
A number of challenges, including the dot-com crash, hastened the demise of WebGain, which closed in 2002.
See also
Visual Café
TopLink
References
Defunct software companies of the United States |
https://en.wikipedia.org/wiki/AMPL | AMPL (A Mathematical Programming Language) is an algebraic modeling language to describe and solve high-complexity problems for large-scale mathematical computing (i.e., large-scale optimization and scheduling-type problems).
It was developed by Robert Fourer, David Gay, and Brian Kernighan at Bell Laboratories.
AMPL supports dozens of solvers, both open source and commercial software, including CBC, CPLEX, FortMP, MOSEK, MINOS, IPOPT, SNOPT, KNITRO, and LGO. Problems are passed to solvers as nl files.
AMPL is used by more than 100 corporate clients, and by government agencies and academic institutions.
One advantage of AMPL is the similarity of its syntax to the mathematical notation of optimization problems. This allows for a very concise and readable definition of problems in the domain of optimization. Many modern solvers available on the NEOS Server (formerly hosted at the Argonne National Laboratory, currently hosted at the University of Wisconsin, Madison) accept AMPL input. According to the NEOS statistics AMPL is the most popular format for representing mathematical programming problems.
Features
AMPL features a mix of declarative and imperative programming styles. Formulating optimization models occurs via declarative language elements such as sets, scalar and multidimensional parameters, decision variables, objectives and constraints, which allow for concise description of most problems in the domain of mathematical optimization.
Procedures and control flow statements are available in AMPL for
the exchange of data with external data sources such as spreadsheets, databases, XML and text files
data pre- and post-processing tasks around optimization models
the construction of hybrid algorithms for problem types for which no direct efficient solvers are available.
To support re-use and simplify construction of large-scale optimization problems, AMPL allows separation of model and data.
AMPL supports a wide range of problem types, among them:
Linear programming
Quadratic programming
Nonlinear programming
Mixed-integer programming
Mixed-integer quadratic programming with or without convex quadratic constraints
Mixed-integer nonlinear programming
Second-order cone programming
Global optimization
Semidefinite programming problems with bilinear matrix inequalities
Complementarity theory problems (MPECs) in discrete or continuous variables
Constraint programming
AMPL invokes a solver in a separate process which has these advantages:
User can interrupt the solution process at any time
Solver errors do not affect the interpreter
32-bit version of AMPL can be used with a 64-bit solver and vice versa
Interaction with the solver is done through a well-defined nl interface.
Availability
AMPL is available for many popular 32 & 64-bit operating systems including Linux, macOS, Solaris, AIX, and Windows.
The translator is proprietary software maintained by AMPL Optimization LLC. However, several online services exist, providing fre |
https://en.wikipedia.org/wiki/Extensible%20Binary%20Meta%20Language | Extensible Binary Meta Language (EBML) is a generalized file format for any kind of data, aiming to be a binary equivalent to XML. It provides a basic framework for storing data in XML-like tags. It was originally developed for the Matroska audio/video container format.
EBML is not extensible in the same way that XML is, as the XML schema (e.g., DTD) must be known in advance.
See also
Binary XML
WBXML
Matroska
WebM
XML
IFF, an older structured binary format widely adopted for multimedia
References
External links
The EBML website
The EBML specifications
RFC 8794
Markup languages
Computer file formats |
https://en.wikipedia.org/wiki/Tog | Tog(s) or TOG(s) may refer to:
ACM Transactions on Graphics, a scientific journal covering computer graphics
Bruce Tognazzini's nickname
Clothing, sometimes referred to as "togs"
Tog, short for "togman", a cloak or loose coat
Swimming togs, a swimsuit, sometimes shortened to "togs"
TOG (hackerspace), a hackerspace in Dublin, Ireland
Tog (unit) of thermal insulation
TOG1 and TOG II*, WWII UK tank prototypes
TOGs, "Terry's Old Geezers/Gals", listeners of a UK radio show
TOG, the List of IOC country codes (IOC code) of Togo
TOG superfamily of proteins.
Tonga (Nyasa) language, ISO 639-2 code
Turn Out Gear |
https://en.wikipedia.org/wiki/Roger%20Schank | Roger Carl Schank (March 12, 1946 – January 29, 2023) was an American artificial intelligence theorist, cognitive psychologist, learning scientist, educational reformer, and entrepreneur. Beginning in the late 1960s, he pioneered conceptual dependency theory (within the context of natural language understanding) and case-based reasoning, both of which challenged cognitivist views of memory and reasoning. He began his career teaching at Yale University and Stanford University. In 1989, Schank was granted $30 million in a ten-year commitment to his research and development by Andersen Consulting, through which he founded the Institute for the Learning Sciences (ILS) at Northwestern University in Chicago.
Early life
Schank was born in Manhattan, New York, in 1946, and he attended Stuyvesant High School.
Academic career
For his undergraduate degree, Schank studied mathematics at Carnegie Mellon University in Pittsburgh PA, and later was awarded a PhD in linguistics at the University of Texas in Austin and went on to work in faculty positions at Stanford University and then at Yale University. In 1974, he became professor of computer science and psychology at Yale University. In 1981, Schank became Chairman of Computer Science at Yale and director of the Yale Artificial Intelligence Project.
In 1989, Schank was granted $30 million in a ten-year commitment to his research and development by Andersen Consulting, allowing him to leave Yale and set up the Institute for the Learning Sciences (ILS) at Northwestern University in Chicago, bringing along 25 of his Yale colleagues. ILS attracted other corporate sponsors such as IBM and Ameritech, as well as government sponsors such as the U.S. Army, EPA and the National Guard, leading to a focus on the development of educational software, especially in employee training. ILS was later absorbed by the School of Education as a separate department.
When Carnegie Mellon University's Silicon Valley campus was established in 2002, Schank came to serve as Chief Educational Officer at the institution.
Entrepreneurship
While at Yale in 1979, Schank was among the first to "capitalize on the expected boom" in AI when he founded Cognitive Systems, a company that went public in 1986. Schank resigned as chairman and chief executive in 1988 for personal reasons, but stayed as a board member and advisor.
In 1994, Schank founded Cognitive Arts Corporation (originally named Learning Sciences Corporation) to market the software developed at ILS, and led the company until it was sold in 2003.
From 2005 to 2007, Schank was the chief learning officer of Trump University.
In 2001 he founded Socratic Arts, a company that sells e-learning software to both businesses and schools.
In 2008, Schank built a story-centered curriculum (SCC) at the Business Engineering School of La Salle International Graduate School of Ramon Llull University, Barcelona to teach MBA students to launch their own businesses or to go to work.
In 2012, S |
https://en.wikipedia.org/wiki/Wireless%20sensor%20network | Wireless sensor networks (WSNs) refer to networks of spatially dispersed and dedicated sensors that monitor and record the physical conditions of the environment and forward the collected data to a central location. WSNs can measure environmental conditions such as temperature, sound, pollution levels, humidity and wind.
These are similar to wireless ad hoc networks in the sense that they rely on wireless connectivity and spontaneous formation of networks so that sensor data can be transported wirelessly. WSNs monitor physical conditions, such as temperature, sound, and pressure. Modern networks are bi-directional, both collecting data and enabling control of sensor activity. The development of these networks was motivated by military applications such as battlefield surveillance. Such networks are used in industrial and consumer applications, such as industrial process monitoring and control and machine health monitoring and agriculture.
A WSN is built of "nodes" – from a few to hundreds or thousands, where each node is connected to other sensors. Each such node typically has several parts: a radio transceiver with an internal antenna or connection to an external antenna, a microcontroller, an electronic circuit for interfacing with the sensors and an energy source, usually a battery or an embedded form of energy harvesting. A sensor node might vary in size from a shoebox to (theoretically) a grain of dust, although microscopic dimensions have yet to be realized. Sensor node cost is similarly variable, ranging from a few to hundreds of dollars, depending on node sophistication. Size and cost constraints constrain resources such as energy, memory, computational speed and communications bandwidth. The topology of a WSN can vary from a simple star network to an advanced multi-hop wireless mesh network. Propagation can employ routing or flooding.
In computer science and telecommunications, wireless sensor networks are an active research area supporting many workshops and conferences, including International Workshop on Embedded Networked Sensors (EmNetS), IPSN, SenSys, MobiCom and EWSN. As of 2010, wireless sensor networks had deployed approximately 120million remote units worldwide.
Application
Area monitoring
Area monitoring is a common application of WSNs. In area monitoring, the WSN is deployed over a region where some phenomenon is to be monitored. A military example is the use of sensors to detect enemy intrusion; a civilian example is the geo-fencing of gas or oil pipelines.
Health care monitoring
There are several types of sensor networks for medical applications: implanted, wearable, and environment-embedded. Implantable medical devices are those that are inserted inside the human body. Wearable devices are used on the body surface of a human or just at close proximity of the user. Environment-embedded systems employ sensors contained in the environment. Possible applications include body position measurement, location of persons, ov |
https://en.wikipedia.org/wiki/Cancer%20registry | A cancer registry is a systematic collection of data about cancer and tumor diseases. The data are collected by Cancer Registrars. Cancer Registrars capture a complete summary of patient history, diagnosis, treatment, and status for every cancer patient in the United States, and other countries.
The Surveillance, Epidemiology and End Results (SEER) program of the National Cancer Institute (NCI) was established in 1973 as a result of the National Cancer Act of 1971. The National Program of Cancer Registries (NPCR) was established by Congress through the Cancer Registries Amendment Act in 1992, and administered by the Centers for Disease Control and Prevention (CDC). NPCR and SEER together collect cancer data for the entire U.S. population. CDC and NCI, in collaboration with the North American Association of Central Cancer Registries, have been publishing annual federal cancer statistics in the United States Cancer Statistics: Incidence and Mortality report. Information maintained in the cancer registry includes: demographic information, medical history, diagnostic findings, cancer therapy and follow up details. The data is used to evaluate patient outcome, quality of life, provide follow-up information, calculate survival rates, analyze referral pattern, allocate resources at regional or state level, report cancer incidence as required under state law, and evaluate efficacy of treatment modalities.
There exist population-based cancer registries, hospital cancer registries (also called hospital-based cancer registries), and special purpose registries.
History
In 1926, Yale-New Haven Hospital became the first to set up a cancer registry. In 1956, the American College of Surgeons (ACoS) formally adopted a policy to encourage, through their Approvals Program, the development of hospital-based cancer registries. In 1973, the Surveillance, Epidemiology and End Results (SEER) Program of NCI established the first national cancer registry program. In 1992, U.S. Public Law 102-515 established the National Program of Cancer Registries (NPCR); it is administered by the US Centers for Disease Control and Prevention (CDC).. By 1993, most states considered cancer a reportable disease.
Types
Population-based cancer registry
Population-based cancer registries monitor the frequency of new cancer cases (so-called incident cases) every year in well defined populations and over time by collecting case reports from different sources (treatment facilities, clinicians and pathologists, and death certificates). The frequency of these incident cases are expected per 100,000 of the mother population. If an unexpected accumulation can be observed, a hypothesis about possible causes is generated. This hypothesis is investigated in a second step by collecting more detailed data. The aim is to recognize and to reduce risks. Population-based registries can also monitor the effects of preventive measures. All population-based central registries in the United States and Can |
https://en.wikipedia.org/wiki/Internet%20Protocol%20television | Internet Protocol television (IPTV) is the delivery of television content over Internet Protocol (IP) networks. This is in contrast to delivery through traditional terrestrial, satellite, and cable television formats. Unlike downloaded media, IPTV offers the ability to stream the source media continuously. As a result, a client media player can begin playing the content (such as a TV channel) almost immediately. This is known as streaming media.
Although IPTV uses the Internet protocol it is not limited to television streamed from the Internet (Internet television). IPTV is widely deployed in subscriber-based telecommunications networks with high-speed access channels into end-user premises via set-top boxes or other customer-premises equipment. IPTV is also used for media delivery around corporate and private networks. IPTV in the telecommunications arena is notable for its ongoing standardisation process (e.g., European Telecommunications Standards Institute).
IPTV services may be classified into live television and live media, with or without related interactivity; time shifting of media, e.g., catch-up TV (replays a TV show that was broadcast hours or days ago), start-over TV (replays the current TV show from its beginning); and video on demand (VOD) which involves browsing and viewing items of a media catalogue.
Definition
Historically, many different definitions of IPTV have appeared, including elementary streams over IP networks, MPEG transport streams over IP networks and a number of proprietary systems. One official definition approved by the International Telecommunication Union focus group on IPTV (ITU-T FG IPTV) is:
IPTV is defined as multimedia services such as television/video/audio/text/graphics/data delivered over IP-based networks managed to provide the required level of quality of service and experience, security, interactivity and reliability.
Another definition of IPTV, relating to the telecommunications industry, is the one given by Alliance for Telecommunications Industry Solutions (ATIS) IPTV Exploratory Group in 2005:
IPTV is defined as the secure and reliable delivery to subscribers of entertainment video and related services. These services may include, for example, Live TV, Video On Demand (VOD) and Interactive TV (iTV). These services are delivered across an access agnostic, packet switched network that employs the IP protocol to transport the audio, video and control signals. In contrast to video over the public Internet, with IPTV deployments, network security and performance are tightly managed to ensure a superior entertainment experience, resulting in a compelling business environment for content providers, advertisers and customers alike.
History
Up until the early 1990s, it was not thought possible that a television programme could be squeezed into the limited telecommunication bandwidth of a copper telephone cable to provide a video-on-demand (VOD) television service of acceptable quality, as the requir |
https://en.wikipedia.org/wiki/Ittijah | Ittijah or "Union of Arab Community-Based Associations" is a network for Palestinian non-governmental organizations (NGOs) founded in 1995 in Israel. The organization's stated goals are promoting the Palestinian Arab civil society and advocating political, economic and social change for Palestinians who are denied access to infrastructure and services "due to discriminatory practices and policies of the (Israeli) State". Based in Haifa, he focuses on coordinating the activities and strategies of member organisations while promoting advocacy, capacity building and networking.
Ittijah's advocacy focuses on raising awareness about the social, political and economic needs of Palestinian Arabs at the (inter-Palestinian), region (Arab) and international levels. Advocacy is directed at governments, civil society groups, donor agencies, other indigenous peoples and human rights agencies, unions, and Palestinian solidarity groups. Ittijah hosts regular Ambassadorial study days and solidarity delegations, produces fact sheet publications, and arranges conferences and meetings.
Ittijah's capacity building efforts are aimed at enhancing the human, technical, financial and educational resources of its member organizations. Ittijah places international volunteers with local organizations and provides translation assistance with English language correspondence.
Ittijah's networking efforts are engaged at the grassroots through international levels extending from field-based networking with women's and youth groups at the local level through regional inter-Arab and international levels. Particular attention is paid to developing a network of specialists engaged in building civil society infrastructure, communication and cooperation. Ittijah's helped create the "Youth Network," a collaboration between ten Community associations that participated in a one-year project with participating young Palestinians from different regions.
Conferences
In 2000, Ittijah arranged a regional conference in Cyprus for Palestinian civil society groups from all parts of historical Palestine and Lebanon. Three Palestinian networks attended; Ittijah: Union of Arab Community-Based Associations; PNGO (The Palestinian NGO Network in the West Bank and Gaza Strip), and The Collective Forum for Palestinian NGOs in Lebanon. The conference noted the indivisible nature of the Palestinian people, warned against accepting divisions imposed upon them by others, and defined the role of the three networks in working towards a unified Palestinian civil society, including Palestinians living in Israel, the West Bank and Gaza Strip, and the large Palestinian refugee communities in Lebanon.
Ittijah also attended the Durban World Conference against Racism in 2001. Ittijah facilitated communication between Palestinian NGOs on the issue of racism, particularly what it believes is Israeli-state racism against Palestinian citizens, and discriminatory practices in the West Bank and Gaza Strip.
Ittijah |
https://en.wikipedia.org/wiki/R2000 | R2000 or R-2000 might refer to:
R2000 (microprocessor), a microprocessor developed by MIPS Computer Systems
Pratt & Whitney R-2000, an aircraft engine
R-2000 program, a Natural Resources Canada program for the construction of energy efficient homes
Robin R2000, a French aircraft |
https://en.wikipedia.org/wiki/New%20Democrat%20Network | The New Democrat Network is an American think tank that promotes centrist candidates for the Democratic Party. NDN is a 501(c)(4) membership organization that functions in conjunction with its two subsidiary organizations, the NDN Political Fund, a non-federal political organization (527), and NDN PAC, a federal political action committee.
Founding
NDN is led and was founded by Simon Rosenberg in 1996, after his split with the Democratic Leadership Council (DLC), for which he worked. Before founding NDN, Rosenberg worked as a television news writer and producer and a political strategist for the Michael Dukakis and Bill Clinton presidential campaigns and the Democratic National Committee.
NDN has offices in Washington, D.C., New York City, San Francisco, and Miami.
Involvement in the 2004 presidential election
The NDN, while not supporting or embracing 2004 Democratic presidential primary candidate Howard Dean, has pointed to his online network of small donors, volunteers, and bloggers as the model to emulate for the Democratic Party. The NDN is now challenging the DLC and is becoming an increasingly influential player in the party's politics.
In the 2004 United States presidential election, NDN led an effort to turn out Hispanic voters for John Kerry. Also in 2004, Rosenberg announced his candidacy for Chairman of the Democratic National Committee, but eventually withdrew from the race, after it became clear that he would lose to eventual Chairman Howard Dean. Rosenberg then supported Dean's campaign.
See also
New Democrat Coalition
Third Way (United States)
References
External links
Official website
New Politics Institute website
NDN's Hispanic Strategy Center website (2008)
Opensecrets.org's summary of NDN's PAC contributions by cycle
Report on NDN's spending by the Center for Public Integrity (2003)
501(c)(4) nonprofit organizations
527 organizations
Factions in the Democratic Party (United States)
Organizations established in 1996
Democratic Party (United States) organizations |
https://en.wikipedia.org/wiki/Intelligence%20gathering%20network | An intelligence gathering network is a system through which information about a particular entity is collected for the benefit of another through the use of more than one, inter-related source. Such information may be gathered by a military intelligence, government intelligence, or commercial intelligence network.
Intelligence assessment employs intelligence analysis to refine information. Foreign embassies subscribe to the newspapers and keep tabs on the news channels of their host countries — the information doesn't have to be classified to be considered useful intelligence; indeed, so-called OSINT, or open-source intelligence, is increasing in both quantity and utility with the ascendancy of digital media. Researchers may also be employed to dig through archives and check facts. An important form of intelligence is so-called "signals intelligence", which attempts to intercept electronic communications and other signals sent between parties working for a hostile, or potentially hostile, entity, or between neutral or even friendly parties but discussing that entity.
In established intelligence agencies, such networks usually follow a linear rather than distributed structure. An agent handler directs the activities of a number of persons and sources in order to obtain the necessary facts about the target of the intelligence gathering operation. The two main HUMINT agent types used are infiltration and penetration agents. An infiltration agent is someone who enters the target of the operation from the outside, but on a suitable pretext so that they are not suspected of espionage. A penetration agent would already be in place in the target area, and is recruited by the handler, often by means of the MICE principle. The information so gathered is processed by one or more analysts and turned into an intelligence product. Information is conveyed between nodes of the network by a variety of secure/clandestine means, be they physical or electronic.
History
Turkey
At the turn of the twentieth century, the last Sultan, Abdul Hamid II, demanded daily intelligence reports called djournals (from the word "journal). After decades, he had saved millions of them in "a whole building to itself in the War Office, where a Government Commission is now," Francis McCullagh wrote in 1910, "wading slowly through this amazing accumulation."
References
Espionage
Open-source intelligence |
https://en.wikipedia.org/wiki/W5%20%28TV%20program%29 | W5 is a Canadian news magazine television program produced by CTV News. The program is broadcast Friday nights at 10 p.m. on the CTV Television Network, with repeat broadcasts at later times on CTV as well as co-owned channels CTV 2, CTV News Channel, and Investigation Discovery. The program also airs in a radio simulcast on CFRB (1010) in Toronto.
The title refers to the Five Ws of journalism: Who, What, Where, When and Why? It is the longest-running news magazine/documentary program in North America and the most-watched program of its type in Canada.
History
W5 is the longest-running current affairs/newsmagazine program in North America and the third longest-running Canadian television program.
It was launched as W5 on September 11, 1966, just after the demise of CBC Television's This Hour Has Seven Days, at a time when the CTV network was on the brink of bankruptcy. The program's magazine format is considered an inspiration for a number of similar programs, including the American program 60 Minutes which premiered two years later.
The program's first executive producer and host was Peter Reilly. He quit only a few weeks into the first season of W5, in a dispute with John Bassett, who owned the CTV network's biggest station, CFTO-TV in Toronto. Reilly went on to become the first host of the CBC's later current affairs offering, The Fifth Estate. Peter Rehak was executive producer through the 1980s and 1990s.
Robert Hurst oversaw a revamping of the program look in the fall of 1995. Fiona Conway became executive producer but left for ABC News in 1998. Conway was succeeded by senior producer Ian McLeod and after he left Malcolm Fox became the executive producer from September 2000 until September 2009. Anton Koschany served as executive producer from 2009-2021, during which time the program moved into HD and produced an expanded number of episodes per season. He was succeeded by current Executive Producer Derek Miller.
The program's first regular host was Ken Cavanagh, with reports from CTV National News journalists such as Doug Johnson and Frank Drea, who later became a Progressive Conservative member of Provincial Parliament in Ontario and Trina McQueen, later president of CTV. During the 1970s, Henry Champ was a long-time host, along with Ken Lefolii and Tom Gould. Helen Hutchinson, who also hosted during the 1970s (concurrent with her tenure as co-host of the morning show Canada AM), was one of the first women to gain a prominent position in television news in Canada. Jim Reed joined the programme in 1972 as a field producer and was later appointed as host along with Hutchinson and Champ.
Eric Malling joined W5 in 1990 from CBC's rival news magazine, The Fifth Estate. In 1991, a new team of reporters also joined the program: Susan Ormiston, Christine Nielsen, and Elliott Shiff. The program was called W5 with Eric Malling until Malling moved to hosting the television program Mavericks in 1995.
In 1993–94, an in-depth report on New Ze |
https://en.wikipedia.org/wiki/Dataflow%20programming | In computer programming, dataflow programming is a programming paradigm that models a program as a directed graph of the data flowing between operations, thus implementing dataflow principles and architecture. Dataflow programming languages share some features of functional languages, and were generally developed in order to bring some functional concepts to a language more suitable for numeric processing. Some authors use the term datastream instead of dataflow to avoid confusion with dataflow computing or dataflow architecture, based on an indeterministic machine paradigm. Dataflow programming was pioneered by Jack Dennis and his graduate students at MIT in the 1960s.
Considerations
Traditionally, a program is modelled as a series of operations happening in a specific order; this may be referred to as sequential,
procedural,
control flow (indicating that the program chooses a specific path), or imperative programming. The program focuses on commands, in line with the von Neumann vision of sequential programming, where data is normally "at rest".
In contrast, dataflow programming emphasizes the movement of data and models programs as a series of connections. Explicitly defined inputs and outputs connect operations, which function like black boxes. An operation runs as soon as all of its inputs become valid. Thus, dataflow languages are inherently parallel and can work well in large, decentralized systems.
State
One of the key concepts in computer programming is the idea of state, essentially a snapshot of various conditions in the system. Most programming languages require a considerable amount of state information, which is generally hidden from the programmer. Often, the computer itself has no idea which piece of information encodes the enduring state. This is a serious problem, as the state information needs to be shared across multiple processors in parallel processing machines. Most languages force the programmer to add extra code to indicate which data and parts of the code are important to the state. This code tends to be both expensive in terms of performance, as well as difficult to read or debug. Explicit parallelism is one of the main reasons for the poor performance of Enterprise Java Beans when building data-intensive, non-OLTP applications.
Where a sequential program can be imagined as a single worker moving between tasks (operations), a dataflow program is more like a series of workers on an assembly line, each doing a specific task whenever materials are available. Since the operations are only concerned with the availability of data inputs, they have no hidden state to track, and are all "ready" at the same time.
Representation
Dataflow programs are represented in different ways. A traditional program is usually represented as a series of text instructions, which is reasonable for describing a serial system which pipes data between small, single-purpose tools that receive, process, and return. Dataflow programs start with |
https://en.wikipedia.org/wiki/Subdivision%20surface | In the field of 3D computer graphics, a subdivision surface (commonly shortened to SubD surface or Subsurf) is a curved surface represented by the specification of a coarser polygon mesh and produced by a recursive algorithmic method. The curved surface, the underlying inner mesh, can be calculated from the coarse mesh, known as the control cage or outer mesh, as the functional limit of an iterative process of subdividing each polygonal face into smaller faces that better approximate the final underlying curved surface. Less commonly, a simple algorithm is used to add geometry to a mesh by subdividing the faces into smaller ones without changing the overall shape or volume.
The opposite is reducing polygons or un-subdividing.
Overview
A subdivision surface algorithm is recursive in nature. The process starts with a base level polygonal mesh. A refinement scheme is then applied to this mesh. This process takes that mesh and subdivides it, creating new vertices and new faces. The positions of the new vertices in the mesh are computed based on the positions of nearby old vertices, edges, and/or faces. In many refinement schemes, the positions of old vertices are also altered (possibly based on the positions of new vertices).
This process produces a denser mesh than the original one, containing more polygonal faces (often by a factor of 4). This resulting mesh can be passed through the same refinement scheme again and again to produce more and more refined meshes. Each iteration is often called a subdivision level, starting at zero (before any refinement occurs).
The limit subdivision surface is the surface produced from this process being iteratively applied infinitely many times. In practical use however, this algorithm is only applied a limited, and fairly small (), number of times.
Mathematically, the neighborhood of an extraordinary vertex (non-4-valent node for quad refined meshes) of a subdivision surface is a spline with a parametrically singular point.
Refinement schemes
Subdivision surface refinement schemes can be broadly classified into two categories: interpolating and approximating.
Interpolating schemes are required to match the original position of vertices in the original mesh.
Approximating schemes are not; they can and will adjust these positions as needed.
In general, approximating schemes have greater smoothness, but the user has less overall control of the outcome. This is analogous to spline surfaces and curves, where Bézier curves are required to interpolate certain control points, while B-Splines are not (and are more approximate).
Subdivision surface schemes can also be categorized by the type of polygon that they operate on: some function best for quadrilaterals (quads), while others primarily operate on triangles (tris).
Approximating schemes
Approximating means that the limit surfaces approximate the initial meshes, and that after subdivision the newly generated control points are not in the limit surfaces. |
https://en.wikipedia.org/wiki/Algebraic%20code-excited%20linear%20prediction | Algebraic code-excited linear prediction (ACELP) is a speech coding algorithm in which a limited set of pulses is distributed as excitation to a linear prediction filter. It is a linear predictive coding (LPC) algorithm that is based on the code-excited linear prediction (CELP) method and has an algebraic structure. ACELP was developed in 1989 by the researchers at the Université de Sherbrooke in Canada.
The ACELP method is widely employed in current speech coding standards such as AMR, EFR, AMR-WB (G.722.2), VMR-WB, EVRC, EVRC-B, SMV, TETRA, PCS 1900, MPEG-4 CELP and ITU-T G-series standards G.729, G.729.1 (first coding stage) and G.723.1. The ACELP algorithm is also used in the proprietary ACELP.net codec. Audible Inc. use a modified version for their speaking books. It is also used in conference-calling software, speech compression tools and has become one of the 3GPP formats.
The ACELP patent expired in 2018 and is now royalty-free.
Features
The main advantage of ACELP is that the algebraic codebook it uses can be made very large (> 50 bits) without running into storage (RAM/ROM) or complexity (CPU time) problems.
Technology
The ACELP algorithm is based on that used in code-excited linear prediction (CELP), but ACELP codebooks have a specific algebraic structure imposed upon them.
A 16-bit algebraic codebook shall be used in the innovative codebook search, the aim of which is to find the best innovation and gain parameters. The innovation vector contains, at most, four non-zero pulses.
In ACELP, a block of N speech samples is synthesized by filtering an appropriate innovation sequence from a codebook, scaled by a gain factor g c, through two time-varying filters.
The long-term (pitch) synthesis filter is given by:
The short-term synthesis filter is given by:
References
Speech codecs |
https://en.wikipedia.org/wiki/G.729 | G.729 is a royalty-free narrow-band vocoder-based audio data compression algorithm using a frame length of 10 milliseconds. It is officially described as Coding of speech at 8 kbit/s using code-excited linear prediction speech coding (CS-ACELP), and was introduced in 1996. The wide-band extension of G.729 is called G.729.1, which equals G.729 Annex J.
Because of its low bandwidth requirements, G.729 is mostly used in voice over Internet Protocol (VoIP) applications when bandwidth must be conserved. Standard G.729 operates at a bit rate of 8 kbit/s, but extensions provide rates of 6.4 kbit/s (Annex D, F, H, I, C+) and 11.8 kbit/s (Annex E, G, H, I, C+) for worse and better speech quality, respectively.
G.729 has been extended with various features, commonly designated as G.729a and G.729b:
G.729: This is the original codec using a high-complexity algorithm.
G.729A or Annex A: This version has a medium complexity, and is compatible with G.729. It provides a slightly lower voice quality.
G.729B or Annex B: This version extends G.729 with silence suppression, and is not compatible with the previous versions.
G.729AB: This version extends G.729A with silence suppression, and is only compatible with G.729B.
G.729.1 or Annex J: This version extends G.729A and B with scalable variable encoding using hierarchical enhancement layers. It provides support for wideband speech and audio, using modified discrete cosine transform (MDCT) coding.
Dual-tone multi-frequency signaling (DTMF), fax transmissions, and high-quality audio cannot be transported reliably with this codec. DTMF requires the use of the named telephony events in the RTP payload for DTMF digits, telephony tones, and telephony signals as specified in RFC 4733.
G.729 annexes
G.729 Annex A
G.729a is a compatible extension of G.729, but requires less computational power. This lower complexity, however, bears the cost of marginally reduced speech quality.
G.729a was developed by a consortium of organizations: France Télécom, Mitsubishi Electric Corporation, Nippon Telegraph and Telephone Corporation (NTT).
The features of G.729a are:
Sampling frequency 8 kHz/16-bit (80 samples for 10 ms frames)
Fixed bit rate (8 kbit/s 10 ms frames)
Fixed frame size (10 bytes (80 bits) for 10 ms frame)
Algorithmic delay is 15 ms per frame, with 5 ms look-ahead delay
G.729a is a hybrid speech coder which uses Algebraic Code Excited Linear Prediction (ACELP)
The complexity of the algorithm is rated at 15, using a relative scale where G.711 is 1 and G.723.1 is 25.
PSQM testing under ideal conditions yields mean opinion scores of 4.04 for G.729a, compared to 4.45 for G.711 (μ-law)
PSQM testing under network stress yields mean opinion scores of 3.51 for G.729a, compared to 4.13 for G.711 (μ-law)
Some VoIP phones incorrectly use the description "G729a/8000" in SDP (e.g. this affects some Cisco and Linksys phones). This is incorrect as G729a is an alternative method of encoding the audio, but still gene |
https://en.wikipedia.org/wiki/Fred%20Silverman | Fred Silverman (September 13, 1937 – January 30, 2020) was an American television executive and producer. He worked as an executive at all of the Big Three television networks, and was responsible for bringing to television such programs as Scooby-Doo, Where Are You! (the original incarnation of the Scooby-Doo franchise, 1969–1970), All in the Family (1971–1979), The Waltons (1972–1981), and Charlie's Angels (1976–1981), as well as the miniseries Rich Man, Poor Man (1976), Roots (1977), and Shōgun (1980). For his success in programming such successful shows, Time magazine declared him "The Man with the Golden Gut" in 1977.
Biography
Early life and career
Silverman was born in New York City, the son of Mildred, a homemaker, and William Silverman, a radio and television service repairman. His father was Jewish and his mother was Catholic. He grew up in Rego Park, Queens, and attended Forest Hills High School. He graduated with a bachelor's degree from Syracuse University, where he was a member of Alpha Epsilon Pi fraternity, and then earned a master's degree from Ohio State University. His 406-page masters thesis analyzed ten years worth of ABC programming and led to his hiring at WGN-TV in Chicago, which was followed by positions at WPIX in New York, and then at CBS. His first job at CBS was to oversee the network's daytime programming. Silverman married his assistant, Cathy Kihn, and they had a daughter, Melissa, and son, William.
CBS
In 1970, Silverman was promoted from vice-president of program planning and development to vice president, Programs, heading the entire program department at CBS. Silverman was promoted to bring a change in perspective for the network, as it had just forced out the previous executive in that position, Michael Dann; Dann's philosophy was to draw as many viewers as possible without regard to key demographics, which the network found to be unacceptable, as advertisers were becoming more specific about what kind of audience they were aiming for. To boost viewership in demographics that were believed to be more willing to respond to commercials, Silverman orchestrated the "rural purge" of 1971, which eventually eliminated many popular country-oriented shows, such as Green Acres, Mayberry R.F.D., Hee Haw, and The Beverly Hillbillies from the CBS schedule. In their place, however, came a new wave of classics aimed at the upscale baby boomer generation, such as All in the Family, The Mary Tyler Moore Show, M*A*S*H, The Waltons, Cannon, Barnaby Jones, Kojak, and The Sonny & Cher Comedy Hour.
Silverman had an uncanny ability to spot burgeoning hit material, especially in the form of spin-offs, new television series developed with characters that appeared on an existing series. For example, he spun off Maude and The Jeffersons from All in the Family, and Rhoda from The Mary Tyler Moore Show (as well as The Bob Newhart Show from MTM's writers). In early 1974, Silverman ordered a Maude spin-off titled Good Times; that seri |
https://en.wikipedia.org/wiki/International%20Baby%20Food%20Action%20Network | The International Baby Food Action Network, IBFAN, consists of public interest groups working around the world to reduce infant and young child morbidity and mortality. IBFAN aims to improve the health and well-being of babies and young children, their mothers and their families through the protection, promotion and support of breastfeeding and optimal infant feeding practices. IBFAN works for universal and full implementation of the International Code of Marketing of Breast-milk Substitutes and Resolutions.
IBFAN was set up in 1979 due to the efforts of various individuals including Gabrielle Palmer through UNICEF and the WHO.
In 1998 IBFAN received the Right Livelihood Award. The RLA Jury has honoured IBFAN “for its committed and effective campaigning over nearly twenty years for the rights of mothers to choose to breastfeed their babies, in the full knowledge of the health benefits of breastmilk, and free from the commercial pressure and misinformation with which companies promote breastmilk substitutes.”
IBFAN's principles are:
The right of infants everywhere to have the highest level of health.
The right of families, and in particular women and children, to have enough nutritious food.
The right of women to breastfeed and to make informed choices about infant feeding.
The right of women to full support for successful breastfeeding and for sound infant feeding practices.
The right of all people to health services which meet basic needs.
The right of health workers and consumers to health care systems which are free of commercial pressures.
The right of people to organise in international solidarity to secure changes which protect and promote basic health.
See also
Breastfeeding promotion
References
External links
official website
Right Livelihood Award recipient
Infant feeding
International medical and health organizations
Organizations established in 1979 |
https://en.wikipedia.org/wiki/Nicky%20Campbell | Nicholas Andrew Argyll Campbell OBE (born Nicholas Lackey, 10 April 1961) is a Scottish broadcaster and journalist. He has worked in television and radio since 1981 and as a network presenter with BBC Radio since 1987.
Early life
Campbell was born in Portobello, Edinburgh, in April 1961, and was taken for adoption at just a few days old. His biological parents were both Irish. His unmarried mother, Stella Lackey, was an Irish Protestant matron at a Dublin Hospital. She was single when Campbell was conceived during a secretive affair. She travelled from Ireland to Edinburgh, where she gave birth to her son. His Belfast-born father, Eugene Hughes, also known as Joseph Leahy, was then a Catholic policeman, 14 years Stella's junior, and was also formerly an Irish Republican. 18 months before Nicky was born, Stella gave birth to his half-sister, Esther, also taken for adoption. His adoptive mother, Sheila, was a psychiatric social worker, and his adoptive father, Frank, a publisher of maps. He was educated at the Edinburgh Academy, an independent school. In July 2022, he disclosed that he witnessed and experienced sexual and violent physical abuse there, which had a "profound effect on [his] life".
He studied history at the University of Aberdeen and graduated with a 2:1 degree.
Career
Radio
In his 2021 memoir ‘One of the Family’ Campbell describes his lifelong obsession with radio and how he and his best friend at the time, the actor Iain Glen, would call various Radio Forth phone-in shows pretending to be different characters.
He started working for Northsound Radio in Aberdeen while still at University there, making commercials and writing jingles. In 1983 he was offered his own show, The World of Opera, which aired every Sunday night at 9pm. On one occasion the DJ presenting the late night pop show after him did not turn up and Campbell had to take the reins. Shortly after this he was offered the station's Breakfast Show, which he presented until 1986, when he sent a tape to Capital Radio in London and was given a try-out on the Saturday Afternoon Show. He then took over the Weekend Breakfast Show from Roger Scott and was used as a daytime "dep" for all the main daytime programmes.
The Capital Radio roster at the time included Roger Scott, Kenny Everett, Alan Freeman, Chris Tarrant and David ‘Kid’ Jensen. It was while standing in for Tarrant and also Jensen that the Head of Music at Radio One Doreen Davis poached him from Capital and he joined the national network in October 1987.
He first presented the late night Saturday programme but was soon moved to the weekend early show. In 1989 he was offered the weekday late night slot which was named Into the Night. He played a wide variety of music and hosted an eclectic selection of guests for long interviews. These included Frank Zappa, David Icke, John Major, the Bee Gees and the Reverend Ian Paisley. He was also regularly joined by Frankie Howerd in the last years of the comedian's life. In A |
https://en.wikipedia.org/wiki/Viz | Viz or VIZ may refer to:
Aerovis Airlines (ICAO: VIZ), a cargo airline based in Kyiv, Ukraine
Viz., a synonym for “namely”
Viz (comics), a British adult comic magazine
Viz: The Game, a computer game based on the comic
Viz Media, an American manga and anime distribution and entertainment company
"Viz", a song from the 2004 Le Tigre album This Island
Visualization (disambiguation), the practice of creating visual representations of complex data and information
Vizcaya station (Station code: VIZ), a Metrorail metro station in Miami, Florida, United States
See also
Hi viz (disambiguation)
Vis-à-vis (disambiguation)
VIZ-Stal, a Russian producer of cold-rolled electrical steels
WVIZ, an American TV station |
https://en.wikipedia.org/wiki/Stanford%20bunny | The Stanford bunny is a computer graphics 3D test model developed by Greg Turk and Marc Levoy in 1994 at Stanford University. The model consists of 69,451 triangles, with the data determined by 3D scanning a ceramic figurine of a rabbit. This figurine and others were scanned to test methods of range scanning physical objects.
The data can be used to test various graphics algorithms, including polygonal simplification, compression, and surface smoothing. There are a few complications with this dataset that can occur in any 3D scan data: the model is manifold connected and has holes in the data, some due to scanning limits and some due to the object being hollow. These complications provide a more realistic input for any algorithm that is benchmarked with the Stanford bunny, though by today's standards, in terms of geometric complexity and triangle count, it is considered a simple model.
The model was originally available in .ply (polygons) file format in four different resolutions.
The model can be found at https://graphics.stanford.edu/data/3Dscanrep/
See also
3D modeling
Stanford dragon
Utah teapot
Suzanne (3D model)
Cornell box
List of common 3D test models
References
External links
The Stanford 3D Scanning Repository provides the Stanford bunny model for download.
3D graphics models
Test items
Fictional rabbits and hares
1994 works |
https://en.wikipedia.org/wiki/Greg%20Turk | Greg Turk is an American-born researcher in the field of computer graphics and a professor at the School of Interactive Computing in the College of Computing at the Georgia Institute of Technology (Georgia Tech). His paper "Zippered polygon meshes from range images", concerning the reconstruction of surfaces from point data, brought the "Stanford bunny", a frequently used example object in computer graphics research, into the CGI lexicon. Turk actually purchased the original Stanford Bunny and performed the initial scans on it. He is also known for his work on simplification of surfaces, and on reaction–diffusion-based texture synthesis. In 2008, Turk was the technical papers chair of SIGGRAPH 2008. In 2012, Greg Turk was awarded the ACM Computer Graphics Achievement Award 2012.
Education and computer graphics research
After receiving his Ph.D. from the University of North Carolina at Chapel Hill under the supervision of Henry Fuchs in 1992, Turk was a postdoctoral researcher at Stanford University from 1992 to 1994 with Marc Levoy before he returned to UNC-Chapel Hill as a research professor from 1994 to 1996. He joined the Georgia Tech faculty in 1996. The following year, Turk was awarded an NSF CAREER Award, one of the most prestigious awards granted by the NSF to new faculty.
It was while at Stanford that he first brought the "Stanford bunny" back to the lab for scanning, which he recounts in a "had I but known" fashion:
Personal life
Turk was born in 1961, and grew up in Southern California. He attended Santa Monica High School in the 1970s, where he was a member of the nonmusical group "The Olive Starlight Orchestra", along with David Linden, Keith Goldfarb, David Coons, Susan P. Crawford, Eric Enderton and Jan Steckel. He did his undergraduate work at UCLA.
A guitarist in a short-lived band while he attended UCLA, Turk performed with the group as "Industrial Waist", which also had Jack Watt (on drums; formerly Jackie Watt before he transitioned), the mathematician and teacher Paul Lockhart (lead vocals, guitar; Lockhart later became known for writing the internet sensation, and later book, A Mathematician's Lament), the Rhythm and Hues Studios co-founder Keith Goldfarb (bass guitar player), and Alex Melnick (the band's original drummer). Turk and Lockhart were roommates in Santa Monica for a couple of years while they attended UCLA.
Turk lives in Atlanta.
Notable publications
Citations taken from his Google Scholar Profile (May 2014).
Turk G, Levoy M. (1994) "Zippered polygon meshes from range images" cited: 1254
Turk G (1992) "Re-tiling polygonal surfaces" cited: 1038
Turk G (1991) "Generating textures on arbitrary surfaces using reaction–diffusion" cited: 517
See also
Turmites
References
External links
Greg Turk's homepage
Greg Turk's publications at DBLP.
The Stanford Bunny
Living people
Georgia Tech faculty
Computer graphics professionals
University of North Carolina at Chapel Hill alumni
1961 births |
https://en.wikipedia.org/wiki/GMR%20%28magazine%29 | GMR was a monthly magazine on video games that was published by Ziff-Davis — the publisher of such magazines as PC Magazine, Electronic Gaming Monthly, and Computer Gaming World (later Games for Windows: The Official Magazine). GMR was launched in February 2003, being sold in only the Electronics Boutique (EB) chain of video game stores. The magazine was unusual among multiconsole magazines in that it covered PC as well as console games, as well as its minimalistic cover art, and, in its last few months, its shift in focus toward promotion of less mainstream titles. It lasted exactly two years, as the 25th and last issue (which was only sent to subscribers) was the February 2005 edition (though prints were limited and not even all subscribers received the final issue).
As the magazine was funded by Electronics Boutique, the magazine stopped circulation when GameStop merged with EB Games, as GameStop already had its own magazine, Game Informer. The fates of its entire staff remain unknown, although James "Milkman" Mielke and Andrew "Skip" Pfister have transferred to the 1Up.com Network online.
Shortly after the release of the PS2 game Monster Hunter, an online-only Event Quest was released which allowed players to obtain the "GMR Chrome Heart," a weapon prominently featuring an embossed GMR logo.
Magazine covers
Each month had a title, e.g. "The Rainbow Issue", "The First Issue". These are listed where known.
February 2003: Dead or Alive: Extreme Beach Volleyball - "The First Issue"
March 2003: Xenosaga - "The Chewy issue"
April 2003: Zone of the Enders - "The Metal issue"
May 2003: Auto Modellista - "The Speed issue"
June 2003: World of Warcraft, Star Wars Galaxies - "The Wired issue"
July 2003: Metal Gear Solid 3: Snake Eater - "The Jungle issue"
August 2003: Ninja Gaiden - "The Masked issue"
September 2003: Soul Calibur II - "The Kick A** Issue"
October 2003: F-Zero GX - "The Future Issue"
November 2003: SSX 3 - "The Frosted Issue"
December 2003: Tony Hawk's Underground - "The Flipped Issue"
January 2004: Rainbow Six 3, Ninja Gaiden - "The Creepy Issue"
February 2004: Darkwatch - "The Dead Issue"
March 2004: Star Wars: Republic Commando - "The Space Issue"
April 2004: Astro Boy - "The Anime Issue"
May 2004: Nina: Death By Degrees - "The Women Issue"
June 2004: Onimusha 3 - "The Samurai Issue"
July 2004: Kingdom Hearts: Chain of Memories - "The magic issue"
August 2004: Everquest 2, Monster Hunter, Final Fantasy XI: Chains of Promathia, The Matrix Online - Four different covers, "The Online World issue"
September 2004: Grand Theft Auto: San Andreas - "The Sandbox Issue"
October 2004: Fable, Dead or Alive Ultimate - Two different covers, "The Hot Pink Issue"
November 2004: Paper Mario: The Thousand-Year Door - "the it's a-me issue"
December 2004: Need For Speed Underground 2, - "The nitro issue"
January 2005: Halo 2 - "The FPS Issue"
February 2005: Resident Evil 4 - "The last issue"
Rating system
When games were revie |
https://en.wikipedia.org/wiki/Customized%20Applications%20for%20Mobile%20networks%20Enhanced%20Logic | Customized Applications for Mobile networks Enhanced Logic (CAMEL) is a set of standards designed to work on either a GSM core network or the Universal Mobile Telecommunications System (UMTS) network. The framework provides tools for operators to define additional features for standard GSM services/UMTS services. The CAMEL architecture is based on the Intelligent Network (IN) standards, and uses the CAP protocol. The protocols are codified in a series of ETSI Technical Specifications.
Many services can be created using CAMEL, and it is particularly effective in allowing these services to be offered when a subscriber is roaming, like, for instance, No-prefix dialing (the number the user dials is the same no matter the country where the call is placed) or seamless MMS message access from abroad.
CAMEL entities
GSM Service Control Function (gsmSCF)
GSM Service Switching Function (gsmSSF)
GSM Specialized Resource Function (gsmSRF)
GPRS Service Switching Function (gprsSSF)
Specifications
CAMEL specification were published in phases, with four phases having been established , each building on the previous. Phases 1 and 2 were defined before 3G networks existed, and as such support adding IN services to a GSM network, although they are equally applicable to 2.5G and 3G networks. Phase 3 was defined for 3GPP Releases 99 and 4, and hence is a GSM and UMTS common specification, while Phase 4 was defined as part of 3GPP Release 5.
In line with other GSM specifications, later phases should be fully backwards compatible with earlier phases; this is achieved by means of the Transaction Capabilities Application Part (TCAP) Application Context (AC) negotiation procedure, with each CAMEL phase is allocated its own AC version.
Phase 1
CAMEL Phase 1 defined only very basic call control services, but introduced the concept of a CAMEL Basic call state model (BCSM) to the Intelligent Network (IN). Phase 1 gave the gsmSCF the ability to bar calls (release the call prior to connection), allow a call to continue unchanged, or to modify a limited number of call parameters before allowing it to continue. The gsmSCF could also monitor the status of a call for certain events (call connection and disconnection), and take appropriate action on being informed of the event.
Phase 1 was defined as part of Release 96 in 1997.
Phase 2
CAMEL Phase 2 enhanced the capabilities defined in Phase 1. In addition to supporting the facilities of Phase 1, Phase 2 included the following:
Additional event detection points
Interaction between a user and a service using announcements, voice prompting and information collection via in-band interaction or Unstructured Supplementary Service Data (USSD) interaction
Control of call duration and transfer of Advice of Charge Information to the mobile station;
The ability to inform the gsmSCF about the invocation of the supplementary services Explicit Call Transfer (ECT), Call Deflection (CD) and Multi-Party Calls (MPTY)
The abili |
https://en.wikipedia.org/wiki/Darkeden | DarkEden is a free-to-play massively multiplayer online role-playing computer game in isometric projection or 3/4 perspective developed and published by SOFTON (formerly Metrotech). The game has a horror theme based on a war between humans (Slayers), vampires and Ousters in a region called Helea located in a fictional country of Eastern Europe known as Eslania. The original version of the game, and the most advanced one, is the Korean one from which several other versions have been derived from such as the Japanese, Chinese, Thai and International versions. The Thai and international versions are currently closed.
Story
Vlad Tepes, Elizabeth Bathory, and Gilles de Rais, three of the twelve master vampires, form an alliance and enter the mountainous area of Helea, killing every person they find. They then attempt to awaken Lilith, the mother of all vampires, so that they can have her power. Opening her tomb does not awaken her, but it does create a cloud over Helea that blocks the sun, making Helea a dark eden for vampires.
The human world responded by isolating the region and sending in their militaries to try to rid the area of vampires.
The master vampires soon discover that the only way to gain the power they seek is to search for the pieces of Lilith's soul, which were scattered about the area of Helea. Unwilling to share this power, they break their alliance and begin a civil war.
Later, an ancient race of people known as the Ousters awakens from their long sleep and are shocked to see what the vampires and humans have done to Helea. They begin to attempt to wipe them from the area.
Gameplay
DarkEden is a hack-and-slash game, which requires the players to kill hordes of monsters in order to make their character progress. This character progression varies according to the different races. Slayers only have to attack a monster or player to gain experience points. Vampires need to kill a monster or player and drink its blood to gain the maximum experience points available, whereas ousters just have to kill to gain these points. For the same monster, ousters gain more experience points out of them than vampires do even when drinking their blood. Each of the races have a special advantage: the slayers sell the heads and skulls of monsters at the highest prices to npc, the vampires drop the best items out of the three races, and the ousters get experience points the quickest.
DarkEden is oriented toward player versus player. Except for few safe zones, players can be attacked without any restriction at any moment by other players. Players may change the race of their character during their progression. If a human is bitten by a vampire, they will turn into a vampire unless they cure themselves in time. Vampire characters can choose to turn humans by talking to an NPC who will do the work for them. There are three different time periods that regulate the battles in Helea, with different circumstances and power dynamics between the races.
Busi |
https://en.wikipedia.org/wiki/Family%20Channel%20%28Canadian%20TV%20channel%29 | Family Channel (commonly or simply known as Family) is a Canadian English-language discretionary specialty channel owned by WildBrain. The network primarily airs children's television series, teen dramas, as well as other programming targeting a family audience. Despite having its own headquarters in the Brookfield Place office in Financial District, the channel is transmitted from Corus Quay.
Launched on September 1, 1988, it was originally a joint venture between the owners of the premium television services First Choice and Superchannel; due to the breakup of Western International Communications, the network became a joint venture between Astral Media and Corus Entertainment. Astral later acquired full ownership of the network; after the 2013 acquisition of Astral by Bell Media, the network and its sister channels were divested to DHX Media (now WildBrain) in 2014.
Family was originally licensed as a premium specialty service, which necessitated that it operate under a commercial-free format, but allowed it to operate multiplex feeds. Nevertheless, television providers typically distributed Family as a conventional specialty channel. In 2016, Family was relieved of this mandate after the CRTC transitioned premium specialty services to the standardized discretionary service license.
From its launch in 1988 until 2015, many of Family Channel's programming format mirrored that of the American premium service Disney Channel. Family Channel's programming lineup consisted mainly of domestic and foreign-imported live-action and animated series from Disney Channel, feature films from the Disney film library, classic films from other Canadian and American film studios, and specials, while also using this partnership to launch Canadian versions of Disney Junior and Disney XD. This partnership ended in 2015, when Disney entered into a new licensing agreement with Corus and launched a Canadian version of Disney Channel and, later, Disney XD and Disney Junior. Since then, Family Channel has acquired programming from other sources.
As of March 2013, Family Channel is available to approximately six million pay television households in Canada. It broadcasts Eastern Time Zone feeds in both standard definition and high definition, and a Pacific Time Zone feed solely in standard definition.
History
Early history
Family Channel was licensed as a premium television service by the Canadian Radio-television and Telecommunications Commission (CRTC) on December 1, 1987; it was originally operated as a joint venture between Allarcom Pay Television Limited and First Choice Canadian Communications Corporation (owners of both Superchannel and First Choice), with both companies owning a 50% stake in the service.
In October 1999, as part of the break-up of Western International Communications (which had bought Allarcom), its stake in Family Channel was sold to Corus Entertainment. In March 2001, in response to concerns from the CRTC over its near-monopoly on the own |
https://en.wikipedia.org/wiki/Compute%21 | Compute! (), often stylized as COMPUTE!, was an American home computer magazine that was published from 1979 to 1994. Its origins can be traced to 1978 in Len Lindsay's PET Gazette, one of the first magazines for the Commodore PET computer. In its 1980s heyday, Compute! Covered all major platforms, and several single-platform spinoffs of the magazine were launched. The most successful of these was Compute!'s Gazette, which catered to VIC-20 and Commodore 64 computer users.
History
Compute!s original goal was to write about and publish programs for all of the computers that used some version of the MOS Technology 6502 CPU. It started out in 1979 with the Commodore PET, VIC-20, Atari 400/800, Apple II+, and some 6502-based computers one could build from kits, such as the Rockwell AIM 65, the KIM-1 by MOS Technology, and others from companies such as Ohio Scientific. Coverage of the kit computers and the Commodore PET were eventually dropped. The platforms that became mainstays at the magazine were the Commodore 64, VIC-20, Atari 8-bit family, TI-99/4A, and the Apple II. Later on, the 6502 platform focus was dropped and IBM PC, Atari ST, and the Amiga computers were added to its line-up. It also published a successful line of computer books, many of which consisted of compilations of articles from the magazine.
ABC Publishing acquired Compute! Publications in May 1983 for $18 million in stock, and raised circulation of the magazine from 200,000 to 420,000 by the end of the year. Compute!'s Gazette, for Commodore computers, began publishing that year. Compute! claimed in 1983 that it published more type-in programs "in each issue than any magazine in the industry". A typical issue would feature a large-scale program for one of the covered platforms, with smaller programs for one or more platforms filling the remainder of the issue's type-ins. Most personal computers of the time came with some version of the BASIC programming language. Machine code programs were also published, usually for simple video games listed in BASIC DATA statements as hexadecimal numbers that could be POKEd into the memory of a home computer by a 'stub' loader at the beginning of the program. Machine language listings could be entered with a program provided in each issue called MLX (available for Apple II, Atari and Commodore hardware, and written in BASIC). Early versions of MLX accepted input in decimal, but this was later changed to the more compact hexadecimal format. It was noted particularly for software such as the multiplatform word processor SpeedScript, the spreadsheet SpeedCalc, and the game Laser Chess.
Editors of the magazine included Robert Lock, Richard Mansfield, Charles Brannon, and Tom R. Halfhill. Noted columnists included Jim Butterfield, educator Fred D'Ignazio and science fiction author Orson Scott Card.
With the May 1988 issue, the magazine was redesigned and the type-in program listings were dropped, as was coverage of the Atari 8-bit computers. I |
https://en.wikipedia.org/wiki/High%20Performance%20Fortran | High Performance Fortran (HPF) is an extension of Fortran 90 with constructs that support parallel computing, published by the High Performance Fortran Forum (HPFF). The HPFF was convened and chaired by Ken Kennedy of Rice University. The first version of the HPF Report was published in 1993.
Building on the array syntax introduced in Fortran 90, HPF uses a data parallel model of computation to support spreading the work of a single array computation over multiple processors. This allows efficient implementation on both SIMD and MIMD style architectures. HPF features included:
New Fortran statements, such as FORALL, and the ability to create PURE (side effect free) procedures
Compiler directives for recommended alignment and distribution of array data (influenced by the earlier Fortran D research effort)
Compiler directive for specifying processor arrangements (e.g., rank, extent, etc.)
Compiler directive for asserting loop iteration independence
Extrinsic procedure interface for interfacing to non-HPF parallel procedures such as those using message passing
Additional library routines - including environmental inquiry, parallel prefix/suffix (e.g., 'scan', segmented scan), data scattering, and sorting operations
Fortran 95 incorporated several HPF capabilities. In response, the HPFF again convened and published the HPF 2.0 Report. The updated report removed material which was already covered by Fortran 95. The report was also reorganized and revised based on experience with HPF 1.0.
While some vendors did incorporate HPF into their compilers in the 1990s, some aspects proved difficult to implement and of questionable use. Since then, most vendors and users have moved to OpenMP-based parallel processing. However HPF continues to have influence. For example, the BIT data type proposal for the Fortran-2008 standard contained a number of new intrinsic functions taken directly from HPF.
See also
Partitioned global address space
External links
HPFF - Rice University HPF Forum
Internet Parallel Computing Archive : Standards : Hpf
ADAPTOR- An open-source HPF compilation system
HPF+ - HPF for advanced applications
The rise and fall of High Performance Fortran: an historical object lesson
References
Concurrent programming languages
Fortran programming language family |
https://en.wikipedia.org/wiki/Single%20program%2C%20multiple%20data | In computing, single program, multiple data (SPMD) is a term that has been used to refer to computational models for exploiting parallelism where-by multiple processors cooperate in the execution of a program in order to obtain results faster.
The term SPMD was introduced in 1983 and was used to denote two different computational models:
by Michel Auguin (University of Nice Sophia-Antipolis) and François Larbey (Thomson/Sintra), as a “fork-and-join” and data-parallel approach where the parallel tasks (“single program”) are split-up and run simultaneously in lockstep on multiple SIMD processors with different inputs, and
by Frederica Darema (IBM), where “all (processors) processes begin executing the same program... but through synchronization directives ... self-schedule themselves to execute different instructions and act on different data” and enabling MIMD parallelization of a given program, and is a more general approach than data-parallel and more efficient than the fork-and-join for parallel execution on general purpose multiprocessors.
The (IBM) SPMD is the most common style of parallel programming and can be considered a subcategory of MIMD in that it refers to MIMD execution of a given (“single”) program. It is also a prerequisite for research concepts such as active messages and distributed shared memory.
SPMD vs SIMD
In SPMD parallel execution, multiple autonomous processors simultaneously execute the same program at independent points, rather than in the lockstep that SIMD or SIMT imposes on different data. With SPMD, tasks can be executed on general purpose CPUs. In SIMD the same operation (instruction) is applied on multiple data to manipulate data streams (a version of SIMD is vector processing where the data are organized as vectors). Another class of processors, GPUs encompass multiple SIMD streams processing. Note that SPMD and SIMD are not mutually exclusive; SPMD parallel execution can include SIMD, or vector, or GPU sub-processing. SPMD has been used for parallel programming of both message passing and shared-memory machine architectures.
Distributed memory
On distributed memory computer architectures, SPMD implementations usually employ message passing programming. A distributed memory computer consists of a collection of interconnected, independent computers, called nodes. For parallel execution, each node starts its own program and communicates with other nodes by sending and receiving messages, calling send/receive routines for that purpose. Other parallelization directives such as Barrier synchronization may also be implemented by messages. The messages can be sent by a number of communication mechanisms, such as TCP/IP over Ethernet, or specialized high-speed interconnects such as Myrinet and Supercomputer Interconnect. For distributed memory environments, serial sections of the program can be implemented by identical computation of the serial section on all nodes rather than computing the result on one |
https://en.wikipedia.org/wiki/Complex%20polygon | The term complex polygon can mean two different things:
In geometry, a polygon in the unitary plane, which has two complex dimensions.
In computer graphics, a polygon whose boundary is not simple.
Geometry
In geometry, a complex polygon is a polygon in the complex Hilbert plane, which has two complex dimensions.
A complex number may be represented in the form , where and are real numbers, and is the square root of . Multiples of such as are called imaginary numbers. A complex number lies in a complex plane having one real and one imaginary dimension, which may be represented as an Argand diagram. So a single complex dimension comprises two spatial dimensions, but of different kinds - one real and the other imaginary.
The unitary plane comprises two such complex planes, which are orthogonal to each other. Thus it has two real dimensions and two imaginary dimensions.
A complex polygon is a (complex) two-dimensional (i.e. four spatial dimensions) analogue of a real polygon. As such it is an example of the more general complex polytope in any number of complex dimensions.
In a real plane, a visible figure can be constructed as the real conjugate of some complex polygon.
Computer graphics
In computer graphics, a complex polygon is a polygon which has a boundary comprising discrete circuits, such as a polygon with a hole in it.
Self-intersecting polygons are also sometimes included among the complex polygons. Vertices are only counted at the ends of edges, not where edges intersect in space.
A formula relating an integral over a bounded region to a closed line integral may still apply when the "inside-out" parts of the region are counted negatively.
Moving around the polygon, the total amount one "turns" at the vertices can be any integer times 360°, e.g. 720° for a pentagram and 0° for an angular "eight".
See also
Regular polygon
Convex hull
Nonzero-rule
List of self-intersecting polygons
References
Citations
Bibliography
Coxeter, H. S. M., Regular Complex Polytopes, Cambridge University Press, 1974.
External links
Introduction to Polygons
Types of polygons |
https://en.wikipedia.org/wiki/WBQC-LD | WBQC-LD (channel 25) is a low-power television station in Cincinnati, Ohio, United States, affiliated with the Spanish-language network Telemundo. It is owned by Gray Television alongside Fox affiliate WXIX-TV (channel 19). The two stations share studios at 19 Broadcast Plaza on Seventh Street in the Queensgate neighborhood just west of downtown Cincinnati; WBQC-LD's transmitter is located on Symmes Street in the Mount Auburn section of the city.
According to its website, WBQC was the first television station to be fully automated. It was also the first station in Cincinnati to perform "digital spot insertion" and to air Spanish-language commercials.
History
WB affiliation
The station signed on the air in 1994, as low-power television station W25AI on UHF channel 25. The station originally ran mostly infomercials. All of Cincinnati's full-power stations, in contrast, carried programming from national networks. Needing an affiliate in Cincinnati, The WB, which launched on January 11, 1995, signed an affiliation agreement with channel 25. The station then changed its call letters to WBQC-LP to reflect its new affiliation and began to brand itself on-air as "WB Channel 25".
UPN affiliation
In July 1997, the Sinclair Broadcast Group signed an affiliation deal with The WB that resulted in a number of the company's UPN affiliates and independent stations switching to The WB. One of the stations included in the deal was WSTR-TV (channel 64). As a result, the WB affiliation moved to WSTR in January 1998, leaving WBQC without a network affiliation. UPN struck an affiliation deal to air its programming on NBC affiliate WLWT (channel 5), which aired its weekly then-Monday-to-Wednesday six-hour schedule from 2 to 4 a.m. on early Saturday, Sunday and Monday mornings as a secondary affiliation. Meanwhile, as an independent station, WBQC carried NBC programming that WLWT chose not to carry, including various sporting events, as well as series such as The Profiler and Sunset Beach. After a few months of poor late night ratings on WLWT, and with the addition of Thursday and Friday hours on the horizon the next season that would likely see WLWT refuse lower-rated programming and the network's Thursday night film, UPN resumed discussions with WBQC to join the network. In the fall of 1998, UPN agreed to affiliate with WBQC.
"Should-carry"
WBQC had been pushing for carriage on local cable and satellite providers for many years. In 2005, WBQC swapped channel allocations with America One-affiliated sister station WOTH-LP (channel 38). In 2001, WBQC became a Class A television station, with the call sign WBQC-CA, in hopes of receiving must-carry status on cable providers and protection from displacement by the full-power stations' digital channel allocations. As a Class A station, WBQC had to meet all the requirements of a full-power station. Ultimately, Class A stations did not receive must-carry status, though they did receive protection from displacement. In neg |
https://en.wikipedia.org/wiki/Hierarchical%20INTegration | Hierarchical INTegration, or HINT for short, is a computer benchmark that ranks a computer system as a whole (i.e. the entire computer instead of individual components). It measures the full range of performance, mostly based on the amount of work a computer can perform over time. A system with a very fast processor would likely be rated poorly if the buses were very poor compared to those of another system that had both an average processor and average buses. For example, in the past, Macintosh computers with relatively slow processor speeds (800 MHz) used to perform better than x86 based systems with processors running at nearly 2 GHz.
HINT is known for being almost immune to artificial optimization and can be used by many computers ranging from a calculator to a supercomputer. It was developed at the U.S. Department of Energy's Ames Laboratory and is licensed under the terms of the GNU General Public License.
HINT is intended to be "scalable" to run on any size computer, from small serial systems to highly parallel supercomputers.
The person using the HINT benchmark can use any floating-point or integer type.
HINT benchmark results have been published comparing a variety of parallel and uniprocessor systems.
A related tool ANALYTIC HINT can be used as a design tool to estimate the benefits of using more memory, a faster processor, or improved communications (bus speed) within the system.
See also
John Gustafson (scientist)
References
External links
official site
article discussing HINT benchmark
benchmark sources download
benchmark sources download
Benchmarks (computing) |
https://en.wikipedia.org/wiki/Game%20Boy%20Sound%20System | The Game Boy Sound System (GBS) is a file format containing Nintendo Game Boy sound driver data designed for the Game Boy sound hardware.
GBS rips are an arduous task often involving debuggers and compiled assembly code, as there was no uniform sound driver for each Game Boy game. As a result, GBS players and the files themselves emulate just enough of the original hardware and ROM data to play back the music driver and data.
Players
Kobarin Media Player - Includes a front end, supports GBS and many chiptune formats natively, has a Winamp plugin converter.
Audacious - *nix player that accepts GBS.
Chipamp - Winamp plug-in bundle compiled by OverClocked ReMix allowing playback of over 40 chiptune and tracker formats
gbsplay - Open source player (Linux, *nix) (and XMMS plugin in older versions)
NEZPlug++ - Winamp plug-in that currently supports the most up-to-date implementation of the GBS format.
Audio Overload - A media player capable of playing a variety of audio formats from vintage consoles and computers.
Noise Entertainment System - a NSF/e (NES Sound File), GBS, VGM and SPC player for the iPhone and iPod touch.
VLC Media Player
References
Digital audio
Video game music file formats |
https://en.wikipedia.org/wiki/Lftp | lftp is a command-line program client for several file transfer protocols. lftp is designed for Unix and Unix-like operating systems. It was developed by Alexander Lukyanov, and is distributed under the GNU General Public License.
lftp can transfer files via FTP, FTPS, HTTP, HTTPS, FISH, SFTP, BitTorrent, and FTP over HTTP proxy. It also supports the File eXchange Protocol (FXP), which allows the client to transfer files from one remote FTP server to another.
Among lftp's features are transfer queues, segmented file transfer, resuming partial downloads, bandwidth throttling, and recursive copying of file directories. The client can be used interactively or automated with scripts. It has Unix shell-like job control, and a facility for scheduling file transfers for execution at a later time.
Development history
lftp was initially developed as part of the ftpclass package. Subsequently it grew and became a more capable program (e.g., mirroring capability was added), and was renamed to lftp in February 1997. The initial goals of development were robustness, automatic resuming of transfers, and increasing transfer speed by transferring parts of a file in parallel using several connections as well as by protocol pipelining. Version 2.0 introduced HTTP and IPv6 support in 1999, more protocols were added later.
See also
NcFTP
Comparison of FTP client software
Notes
References
Dee-Ann LeBlanc (May 22, 2003) Moving Files In Linux: lftp, LinuxPlanet
Richard Petersen, Fedora 10 Linux Desktop, Surfing Turtle Press, 2008, , p. 255
Michael Jang, Linux annoyances for geeks, O'Reilly Media, 2006, , pp. 127–128
Ellen Siever, Stephen Figgins, Robert Love, Arnold Robbins, Linux in a Nutshell, Edition 6, O'Reilly Media, 2009, , pp. 244–247
Further reading
Dmitri Popov (December 4, 2007) CLI Magic: Quick and easy backup with lftp, Linux.com
External links
lftp man page
lftp-vi: a module that adds editing capability to lftp
LftpFS – filesystem based on FUSE and lftp
Free FTP clients
Hypertext Transfer Protocol clients
SSH File Transfer Protocol clients
Files transferred over shell clients
Free BitTorrent clients
BitTorrent clients for Linux |
https://en.wikipedia.org/wiki/TURBOchannel | TURBOchannel is an open computer bus developed by DEC by during the late 1980s and early 1990s. Although it is open for any vendor to implement in their own systems, it was mostly used in Digital's own systems such as the MIPS-based DECstation and DECsystem systems, in the VAXstation 4000, and in the Alpha-based DEC 3000 AXP. Digital abandoned the use of TURBOchannel in favor of the EISA and PCI buses in late 1994, with the introduction of their AlphaStation and AlphaServer systems.
History
TURBOchannel was developed in the late 1980s by Digital and was continuously revised through the early 1990s by the TURBOchannel Industry Group, an industry group set up by Digital to develop promote the bus. TURBOchannel has been an open bus from the beginning, the specification was publicly available at an initial purchase cost for the reproduction of material for third-party implementation, as were the mechanical specifications, for both implementation in both systems and in options. TURBOchannel was selected by the failed ACE (Advanced Computing Environment) for use as the industry standard bus in ARC (Advanced RISC Computing) compliant machines. Digital initially expected TURBOchannel to gain widespeard industry acceptance due to its status as an ARC standard, although ultimately Digital was the only major user of the TURBOchannel in their own DEC 3000 AXP, DECstation 5000 Series, DECsystem and VAXstation 4000 systems. While no third parties implemented TURBOchannel in systems, they did implement numerous TURBOchannel option modules for Digital's systems.
Although the main developer and promoter of TURBOchannel was the TURBOchannel Industry Group, Digital's TRI/ADD Program, an initiative to provide technical and marketing support to third parties implementing peripherals based on open interfaces such as FutureBus+, SCSI, VME and TURBOchannel for Digital's systems, was also involved in promoting TURBOchannel implementation and sales. The TRI/ADD Program was discontinued on 15 December 1992, except for in Japan.
In the early 1990s, Digital expected the TURBOchannel bus to face serious competition from other buses from other vendors such as HP, Sun and IBM, and therefore it announced that it intended to update the existing TURBOchannel specification to permit it to transfer up to 200 MB/s, using similar hardware. This upgrade to the protocol was to be backwards compatible, but Digital later canceled the intended update and TURBOchannel itself towards the end of 1994 once it became clear that PCI had become dominant.
Architecture
TURBOchannel is a 32-bit address and data multiplexed bus, clocked at frequencies between 12.5 and 25 MHz, with a maximum theoretical usable bandwidth of 90 MB/s. The bus differs from others at the time by having point to point control lines. The firmware contained within TURBOchannel cards is MIPS machine code, a remnant of the bus' original use in MIPS-based systems. Because of this, later systems that use this bus such a |
https://en.wikipedia.org/wiki/Markus%20Kuhn%20%28computer%20scientist%29 | Markus Guenther Kuhn (born 1971) is a German computer scientist, currently working at the Computer Laboratory, University of Cambridge and a fellow of Wolfson College, Cambridge.
Education
Kuhn was educated at University of Erlangen (Germany), he received his Master of Science degree at Purdue University and PhD at the University of Cambridge.
Research
Kuhn's main research interests include computer security, in particular the hardware and signal-processing aspects of it, and distributed systems. He is known, among other things, for his work on security microcontrollers, compromising emanations, and distance-bounding protocols. He developed the Stirmark test for digital watermarking schemes, the OTPW one-time password system, and headed the project that extended the X11 misc-fixed fonts to Unicode.
In 1994, as an undergraduate student, he became known for developing several ways to circumvent the VideoCrypt encryption system, most notably the Season7 smartcard emulator.
In 2002, he published a new method for eavesdropping CRT screens and in 2003 he went on to publish mitigations such as "Tempest fonts".
In 2010, Kuhn was asked to analyse the ADE 651, a device used in Iraq that was said to be a bomb-detecting device; he found that it contained nothing but an anti-theft tag and said that it was "impossible" that the device could detect anything whatsoever.
He is also known for some of his work on international standardisation, such as pioneering the introduction of Unicode/UTF-8 under Linux.
Awards and honours
In 1987 and 1988, he won the German national computer-science contest, and in 1989, he won a gold medal for the West German team at the International Olympiad in Informatics.
References
1971 births
Living people
German computer scientists
Purdue University alumni
Fellows of Wolfson College, Cambridge
Members of the University of Cambridge Computer Laboratory
Computer security academics
Studienstiftung alumni
University of Erlangen-Nuremberg alumni
Scientists from Munich
Alumni of the University of Cambridge |
https://en.wikipedia.org/wiki/Super%20Harvard%20Architecture%20Single-Chip%20Computer | The Super Harvard Architecture Single-Chip Computer (SHARC) is a high performance floating-point and fixed-point DSP from Analog Devices. SHARC is used in a variety of signal processing applications ranging from audio processing, to single-CPU guided artillery shells to 1000-CPU over-the-horizon radar processing computers. The original design dates to about January 1994.
SHARC processors are typically intended to have a good number of serial links to other SHARC processors nearby, to be used as a low-cost alternative to SMP.
Architecture
The SHARC is a Harvard architecture word-addressed VLIW processor; it knows nothing of 8-bit or 16-bit values since each address is used to point to a whole 32-bit word, not just an octet. It is thus neither little-endian nor big-endian, though a compiler may use either convention if it implements 64-bit data and/or some way to pack multiple 8-bit or 16-bit values into a single 32-bit word. In C, the characters are 32-bit as they are the smallest addressable words by standard.
The word size is 48-bit for instructions, 32-bit for integers and normal floating-point, and 40-bit for extended floating-point. Code and data are normally fetched from on-chip memory, which the user must split into regions of different word sizes as desired. Small data types may be stored in wider memory, simply wasting the extra space. A system that does not use 40-bit extended floating-point might divide the on-chip memory into two sections, a 48-bit one for code and a 32-bit one for everything else. Most memory-related CPU instructions can not access all the bits of 48-bit memory, but a special 48-bit register is provided for this purpose. The special 48-bit register may be accessed as a pair of smaller registers, allowing movement to and from the normal registers.
Off-chip memory can be used with the SHARC. This memory can only be configured for one single size. If the off-chip memory is configured as 32-bit words to avoid waste, then only the on-chip memory may be used for code execution and extended floating-point. Operating systems may use overlays to work around this problem, transferring 48-bit data to on-chip memory as needed for execution. A DMA engine is provided for this. True paging is impossible without an external MMU.
The SHARC has a 32-bit word-addressed address space. Depending on word size this is 16 GB, 20 GB, or 24 GB (using the common definition of an 8-bit "byte").
SHARC instructions may contain a 32-bit immediate operand. Instructions without this operand are generally able to perform two or more operations simultaneously. Many instructions are conditional, and may be preceded with "if condition " in the assembly language. There are a number of condition choices, similar to the choices provided by the x86 flags register.
There are two delay slots. After a jump, two instructions following the jump will normally be executed.
The SHARC processor has built-in support for loop control. Up to 6 levels may be use |
https://en.wikipedia.org/wiki/Shannon%20Gilligan | Shannon Gilligan is an author of interactive fiction and computer games.
Early life and education
Gilligan graduated from Williams College in 1981 and spent a year abroad at Doshisha University in Kyoto, Japan.
Career
Gilligan has been extensively involved in the Choose Your Own Adventure series, having written five books in the main series and six others in the "Younger Readers" series. Her stepsons, Ramsey Montgomery(deceased) and Anson Montgomery, wrote several books in the series as well. Shannon was married to the series co-founder, R. A. Montgomery. She also writes the History Mystery Series and Our Secret Gang series for children. Over 2 million copies of her books are in print in several languages including English, Italian, Spanish and Turkish. She also worked in mystery computer games for Activision such as The Elk Moon Murder and the Murder Mystery series for Creative Multimedia. She was the first person to be inducted into the Mystery Writers of America based on interactive works.
Bibliography
Choose Your Own Adventure series
#14 The Search for Champ (November 1983)
#15 The Three Wishes (April 1984)
#21 Mona Is Missing (October 1984)
#29 The Fairy Kidnap (August 1985)
#33 Haunted Harbor (April 1986)
#43 Home in Time for Christmas (December 1987)
#44 The Mystery of Ura Senke (May 1985)
#53 The Case of the Silk King (February 1986, adapted by ABC for an hour-long prime-time special)
#81 Terror in Australia (July 1988)
#119 The Terrorist Trap (November 1991)
#127 Showdown (August 1992)
Mystery games
The Elk Moon Murder
Who Killed Brett Penace? The Environmental Surfer
Who Killed Sam Rupert?
Who Killed Elspeth Haskard? The Magic Death
Who Killed Taylor French?
Comic Creator
See also
List of Choose Your Own Adventure books
References
External links
Official Choose Your Own Adventure site
Living people
Year of birth missing (living people)
American children's writers
American mystery writers
Choose Your Own Adventure writers
American women children's writers
Women mystery writers
American women novelists
21st-century American women |
https://en.wikipedia.org/wiki/Logic%20synthesis | In computer engineering, logic synthesis is a process by which an abstract specification of desired circuit behavior, typically at register transfer level (RTL), is turned into a design implementation in terms of logic gates, typically by a computer program called a synthesis tool. Common examples of this process include synthesis of designs specified in hardware description languages, including VHDL and Verilog. Some synthesis tools generate bitstreams for programmable logic devices such as PALs or FPGAs, while others target the creation of ASICs. Logic synthesis is one step in circuit design in the electronic design automation, the others are place and route and verification and validation.
History
The roots of logic synthesis can be traced to the treatment of logic by George Boole (1815 to 1864), in what is now termed Boolean algebra. In 1938, Claude Shannon showed that the two-valued Boolean algebra can describe the operation of switching circuits. In the early days, logic design involved manipulating the truth table representations as Karnaugh maps. The Karnaugh map-based minimization of logic is guided by a set of rules on how entries in the maps can be combined. A human designer can typically only work with Karnaugh maps containing up to four to six variables.
The first step toward automation of logic minimization was the introduction of the Quine–McCluskey algorithm that could be implemented on a computer. This exact minimization technique presented the notion of prime implicants and minimum cost covers that would become the cornerstone of two-level minimization. Nowadays, the much more efficient Espresso heuristic logic minimizer has become the standard tool for this operation. Another area of early research was in state minimization and encoding of finite-state machines (FSMs), a task that was the bane of designers. The applications for logic synthesis lay primarily in digital computer design. Hence, IBM and Bell Labs played a pivotal role in the early automation of logic synthesis. The evolution from discrete logic components to programmable logic arrays (PLAs) hastened the need for efficient two-level minimization, since minimizing terms in a two-level representation reduces the area in a PLA.
Two-level logic circuits are of limited importance in a very-large-scale integration (VLSI) design; most designs use multiple levels of logic. Almost any circuit representation in RTL or Behavioural Description is a multi-level representation. An early system that was used to design multilevel circuits was LSS from IBM. It used local transformations to simplify logic. Work on LSS and the Yorktown Silicon Compiler spurred rapid research progress in logic synthesis in the 1980s. Several universities contributed by making their research available to the public, most notably SIS from University of California, Berkeley, RASP from University of California, Los Angeles and BOLD from University of Colorado, Boulder. Within a decade, the technology |
https://en.wikipedia.org/wiki/HIL%20bus | The HP-HIL (Hewlett-Packard Human Interface Link) is the name of a computer bus used by Hewlett-Packard to connect keyboards, mice, trackballs, digitizers, tablets, barcode readers, rotary knobs, touchscreens, and other human interface peripherals to their HP 9000 workstations. The bus was in use until the mid-1990s, when HP substituted PS/2 technology for HIL. The PS/2 peripherals were themselves replaced with USB-connected models.
The HIL bus is a daisy-chain of up to 7 devices, running at a raw clock speed of 8 MHz. Each HIL device typically has an output connector, and an input connector to which the next device in the chain plugs; the exception is the mouse which has only the output connector.
HIL buses can be found on HP PA-RISC and m68k based machines, some early HP Vectra computers, as well as in some HP/Agilent Logic Analyzers. HP-UX, OpenBSD, Linux and NetBSD include drivers for the HIL bus and HIL devices.
The HP-HIL bus uses specific 4-pin, 6-pin, or 8-pin SDL connectors, somewhat similar to the 8P8C 8-pin modular connector commonly (though incorrectly) called the RJ-45. The bus can reportedly also use a 9-pin D-subminiature DE-9 connector.
A HIL to PS/2 converter is available, namely the HP A4220-62001.
Specification
HP-HIL Technical Reference Manual, HP P/N 45918A
External links
HP HIL Linux driver suite
Vectra RS/20 with HIL
Serial buses
Hewlett-Packard products |
https://en.wikipedia.org/wiki/KSL%20%28radio%20network%29 | KSL Newsradio is a pair of radio stations serving the Salt Lake City, Utah region, consisting of the original AM station, KSL, licensed to Salt Lake City on 1160 kHz, and FM station KSL-FM, licensed to Midvale on 102.7 MHz. Owned by Bonneville International, a broadcasting subsidiary of the Church of Jesus Christ of Latter-day Saints, the stations share studios with sister television station KSL-TV in the Broadcast House building at the Triad Center in downtown Salt Lake City.
The AM station broadcasts with 50,000 watts non-directional, day and night, the maximum power permitted by the Federal Communications Commission. A Class A clear channel station, it covers most of north-central Utah in the daytime and can be heard in much of western North America at night. The KSL transmitter site is located west of Salt Lake City International Airport, while the KSL-FM transmitter is located on Farnsworth Peak in the Oquirrh Mountains, southwest of Salt Lake City.
The AM station is Utah's primary entry point for the Emergency Alert System. Both KSL's AM and FM transmissions broadcast in HD Radio. KSL-FM carries the Latter-day Saints Channel over its HD2 subchannel.
Programming
Both stations simulcast a format of all-news during key hours on weekdays and talk programming the rest of the time.
Weekdays
Once a month during non-election cycles (usually on the last Thursday of the month), the Governor of Utah has airtime on the station for a "Let Me Speak to the Governor" segment, where calls are taken from constituents, with the governor answering questions and concerns.
A notable program from KSL's history was Herb Jepko's Nitecap [Radio Network], a call-in show airing overnight on 1160 KSL from 1964 to 1990. Nightcaps was one of the first U.S. radio talk shows to be syndicated nationally, airing on numerous Mutual Broadcasting System Network stations.
Weekends
Programming airing on weekends includes KSL Outdoors, The KSL Greenhouse Show, Cougar Sports Saturday, The Movie Show Matinee, Best of The Doug Wright Show, Meet The Press, Ric Edelman as well as numerous LDS religious shows and paid programming.
KSL was the flagship station of Brigham Young University's football and men's basketball teams until BYU Radio took over the duties in 2017. KSL remains an affiliate for those teams though. Commentary for football games is provided by Greg Wrubell, the "Voice of the Cougars."
Due to its affiliation with the LDS Church, KSL, along with its television counterparts and other LDS-affiliated outlets in Utah, airs simulcasts of the General Conferences, held twice a year during April and October.
On Sunday mornings, KSL airs its longest-running show, Music and the Spoken Word, a weekly broadcast of The Tabernacle Choir at Temple Square which is also syndicated nationwide via CBS Radio and television. Continuously airing since 1929, it is one of the longest-running radio programs in the world, and one of only two radio shows to be inaugurated into the Nati |
https://en.wikipedia.org/wiki/Frederic%20C.%20Williams | Sir Frederic Calland Williams, (26 June 1911 – 11 August 1977), known as F.C. Williams or Freddie Williams, was an English engineer, a pioneer in radar and computer technology.
Education
Williams was born in Romiley, Stockport, and educated at Stockport Grammar School. He gained a scholarship to study engineering at the University of Manchester where he was awarded Bachelor of Science and Master of Science degrees. He was awarded a Doctor of Philosophy degree in 1936 for research carried out as a postgraduate student of Magdalen College, Oxford.
Research and career
Working at the Telecommunications Research Establishment (TRE), Williams was a substantial contributor during World War II to the development of radar.
In 1946 he was appointed as head of the Electrical Engineering Department of the University of Manchester. There, with Tom Kilburn and Geoff Tootill, he built the first electronic stored-program digital computer, the Manchester Baby.
Williams is also recognised for his invention of the Williams tube, an early memory device. He supervised the research of his PhD students Richard Grimsdale and Tom Kilburn.
Awards and honours
Williams was elected a Fellow of the Royal Society (FRS) in 1950. His nomination reads
Personal life
Williams died in Manchester in 1977, aged 66.
References
1911 births
1977 deaths
Academics of the Victoria University of Manchester
Alumni of Magdalen College, Oxford
Alumni of the Victoria University of Manchester
Commanders of the Order of the British Empire
English electrical engineers
Fellows of the Royal Society
History of computing in the United Kingdom
Knights Bachelor
People educated at Stockport Grammar School
People from Stockport
People associated with the Department of Computer Science, University of Manchester
Engineers from Lancashire
Alumni of the University of Manchester |
https://en.wikipedia.org/wiki/NCR%20Voyager | The NCR Voyager was an SMP computer platform produced by the NCR Corporation circa 1985. Linux support for some models existed between 2005 and 2010.
Sources
NCR Corporation products |
https://en.wikipedia.org/wiki/BEEP | The Blocks Extensible Exchange Protocol (BEEP) is a framework for creating network application protocols. BEEP includes building blocks like framing, pipelining, multiplexing, reporting and authentication for connection and message-oriented peer-to-peer (P2P) protocols with support of asynchronous full-duplex communication.
Message syntax and semantics is defined with BEEP profiles associated to one or more BEEP channels, where each channel is a full-duplex pipe. A framing-mechanism enables simultaneous and independent communication between peers.
BEEP is defined in independently from the underlying transport mechanism. The mapping of BEEP onto a particular transport service is defined in a separate series of documents.
Overview
Profiles, channels and a framing mechanism are used in BEEP to exchange different kinds of messages. Only content type and encoding are defaulted by the specification leaving the full flexibility of using a binary or textual format open to the protocol designer. Profiles define the functionality of the protocol and the message syntax and semantics. Channels are full-duplex pipes connected to a particular profile. Messages sent through different channels are independent from each other (asynchronous). Multiple channels can use the same profile through one connection.
BEEP also includes TLS for encryption and SASL for authentication.
History
In 1998 Marshall T. Rose, who also worked on the POP3, SMTP, and SNMP protocols, designed the BXXP protocol and subsequently handed it over to the Internet Engineering Task Force (IETF) workgroup in summer 2000. In 2001 the IETF published BEEP () and BEEP on TCP () with some enhancements to BXXP. The three most notable are:
Using application/octet-stream as the default "Content-Type"
Support multi-reply for messages
Changing the name from BXXP to BEEP
BEEP session
To start a BEEP session, an initiating peer connects to the listening peer. Each peer sends a reply containing a greeting element. The greeting contains up to three different elements:
features: optional channel management profile feature tokens supported by the peer.
localize: optional preferred language tags for reporting and messages.
profile : profiles supported by the peer.
Example greeting and answer:
L: <wait for incoming connection>
I: <open connection>
L: RPY 0 0 . 0 110
L: Content-Type: application/beep+xml
L:
L: <greeting>
L: <profile uri='http://iana.org/beep/TLS' />
L: </greeting>
L: END
I: RPY 0 0 . 0 52
I: Content-Type: application/beep+xml
I:
I: <greeting />
I: END
Profiles
Profiles define the syntax and semantics of messages and the protocol functionality based on BEEP. A single BEEP session can provide access to multiple profiles. To identify a profile, a unique string is assigned to it. This profile identifier has the format of a Uniform Resource Identifier (URI) or Uniform Resource Name (URN). In the past, the URI format of the profile identifier lead to confusion, because it i |
https://en.wikipedia.org/wiki/Lisp%20Machines | Lisp Machines, Inc. was a company formed in 1979 by Richard Greenblatt of MIT's Artificial Intelligence Laboratory to build Lisp machines. It was based in Cambridge, Massachusetts.
By 1979, the Lisp Machine Project at MIT, originated and headed by Greenblatt, had constructed over 30 CADR computers for various projects at MIT. Russell Noftsker, who had formerly been administrator of the MIT Artificial Intelligence lab some years previously and who had since started and run a small company, was convinced that computers based on the artificial intelligence language LISP had a bright future commercially. There were a number of ready customers who were anxious to get machines similar to ones they had seen at MIT.
Greenblatt and Noftsker had differing ideas about the structure and financing of the proposed company. Greenblatt believed
the company could be "bootstrapped", i.e. financed practically from scratch from the order flow from customers (some of whom were willing to pay in advance). This would mean that the principals of the company would retain control. Noftsker favored
a more conventional venture capital model, raising a considerable sum of money, but with the investors having control of the company. The two negotiated at length, but neither would compromise. The ensuing discussions of the choice rent the lab into two factions. In February, 1979, matters came to a head. Greenblatt believed that the proceeds from the construction and sale of a few machines could be profitably reinvested in the funding of the company. Most sided with Noftsker, believing that a commercial venture fund-backed company had a better chance of surviving and commercializing Lisp Machines than Greenblatt's proposed self-sustaining start-up. They went on to start Symbolics Inc.
Alexander Jacobson, a consultant from CDC, was trying to put together an AI natural language computer application, came to Greenblatt, seeking a Lisp machine for his group to work with. Eight months after Greenblatt had his disastrous conference with Noftsker, he had yet to produce anything. Alexander Jacobson decided that the only way Greenblatt was going to actually start his company and build the Lisp machines that Jacobson needed, was if he pushed and financially helped Greenblatt launch his company. Jacobson pulled together business plans, a board, and a partner, F. Stephen Wyle, for Greenblatt. The newfound company was named LISP Machine, Inc. (LMI), and was funded mostly by order flow including CDC orders, via Jacobson.
History of LMI
The following parable-like story is told about LMI by Steven Levy and used for the first time in Hackers: Heroes of the Computer Revolution (1984). Levy's account of hackers is in large part based on the values of the hackers at MIT Artificial Intelligence Laboratory. Among these hackers was Richard Stallman, whom Levy at the time called the last true hacker.
When Noftsker started Symbolics, while he was able to pay salaries, he didn't actually have |
https://en.wikipedia.org/wiki/Tablet | Tablet may refer to:
Medicine
Tablet (pharmacy), a mixture of pharmacological substances pressed into a small cake or bar, colloquially called a "pill"
Computing
Tablet computer, a mobile computer that is primarily operated by touching the screen
Graphics tablet or digitizing tablet, a computer input device for capturing hand-drawn images and graphics
Tablet, a section of columns in a range of rows in Google's Bigtable NoSQL database
Confectionery
Tablet (confectionery), a medium-hard, sugary confection from Scotland
Tableting, a confectionery manufacturing process
A type of chocolate bar
Inscription, printing, and writing media
Clay tablet, one of the earliest known writing mediums
Wax tablet, used by scribes as far back as ancient Greece
Notebook of blank or lined paper, usually bound with glue or staples along one edge
Stele, slab of stone or wood erected as a monument or marker
Tabula ansata, tablets with handles
Vindolanda tablets, Roman era writings found in Britain
Periodicals and printed works
Tablet (magazine), a daily online magazine of Jewish news, ideas, and culture
Tablet (newspaper), a newspaper published in Seattle, Washington
Tablet (religious), a traditional term used for certain religious texts
The Tablet, a Catholic magazine published in the United Kingdom
The Tablet (Brooklyn), a Catholic newspaper published in the United States
The New Zealand Tablet, a former weekly Catholic newspaper
Other uses
Tabula rasa, the theory originating with Aristotle of the newborn mind as an uninscribed tablet or blank slate
Tablet is a form of token (railway signalling)
Tyer's Electric Train Tablet, a system of controlling access to single-track railway lines in Britain
"Tablett", tray, a shallow platform designed for carrying things, in German
See also
Plaque (disambiguation) |
https://en.wikipedia.org/wiki/WHSG-TV | WHSG-TV (channel 63) is a religious television station licensed to Monroe, Georgia, United States, serving the Atlanta area as an owned-and-operated station of the Trinity Broadcasting Network (TBN). The station's transmitter is located in Atlanta's Cabbagetown section.
Because it airs no local content (except for local insertion of the required station identification), it is not carried as a local channel on DirecTV; the network's national feed is already available, but TBN's subchannel sister networks are not available.
It had one broadcast translator, W55BM, licensed to Marietta with transmitter atop Sweat Mountain, northwest of Atlanta. That station was later W49DE and WXID-LP, an affiliate of JCTV.
History
The construction permit for a new television station on channel 63 at Monroe was originally issued to a local permittee, Monroe Television, Inc., around 1987. In December 1989, TBN purchased the permit and completed the station's construction; WHSG commenced operations on March 15, 1991, as a TBN owned-and-operated outlet.
During the late 1990s through the early 2010s, WHSG played an important role within TBN, as it originated a weekly edition of the network's flagship program Praise the Lord and a portion of the ministry's semi-annual Praise-a-Thon fundraisers. This ended in 2017 when TBN revamped its local and network programming operations following Matt Crouch's ascension to leadership of the ministry, after the death of his mother and TBN co-founder Jan Crouch. The station's studio on Agape Way in Decatur was officially closed by TBN in 2019 following the Federal Communications Commission (FCC)'s repeal of the Main Studio Rule, and later sold.
Technical information
Subchannels
Analog-to-digital transition
WHSG-TV shut down its analog signal, over UHF channel 63, on April 16, 2009. The station's digital signal remained on its pre-transition UHF channel 44, using PSIP to display WHSG-TV's virtual channel as 63 on digital television receivers, which was among the high band UHF channels (52-69) that were removed from broadcasting use as a result of the transition.
The station's analog transmitter was located in northern Rockdale County, halfway between Monroe and Atlanta. The station's digital facility is immediately south of Atlanta's Inman Park neighborhood, along the north side of Interstate 20. This is the same tower used by WUPA (channel 69), built by that station when its original location (atop the Westin Peachtree Plaza hotel) could not hold a second large TV antenna for digital, although WUPA has since moved to the North Druid Hills site, sharing an antenna through a diplexer. It also has WIRE-CD (channel 40), an expired construction permit for W06CM-D (channel 6), and a license for WYGA-CD on channel 16 (as well as a permit for 18 and a later app for 16 again). No serious damage occurred to the tower when the 2008 Atlanta tornado passed by the site, even though the then-analog WYGA-CA 45 (operating from the site under ST |
https://en.wikipedia.org/wiki/Cyber%20Team%20in%20Akihabara | is a 1998 Japanese anime television series created by Tsukasa Kotobuki and Satoru Akahori. It aired from April 4, 1998, to September 26, 1998, on TBS and ran for 26 episodes. It was released in the United States by ADV Films and was also broadcast on international networks such as Anime Network (United States), AXN Asia (Singapore, Philippines and Thailand), Locomotion (Mexico, Colombia, Venezuela, Argentina, Spain and Brazil). A 1-hour featured animation film of the series was subsequently released in Japan entitled ; unlike the series the film was produced by Production I.G and Xebec. The show has an array of characters, many of whom are named after birds, gods, and real-myth villains. The conception design was hand drawn.
Media format initial was Japanese VHS Vol. 1-7 release on 23 Dec 1998, along with LD. Outside JP, NA region had 2004 volume and a complete DVD collection box released on 2006, by ADV Films. In 2016, announcement made by King Records for a limited Blu-Ray box set release, are included all various video benefits, a 48P booklet and Summer Vacation 2011 film which already had VHS and DVD JP physical retail.
Story
Twelve-year-old junior high school student Hibari Hanakoganei lives in Akihabara, a suburb of Tokyo, in the year 2010. The current craze among young girls in Akihabara are electronic pets called "Pata-Pi." Hibari seems to be the only girl in town who doesn't have one and can only admire the PataPi owned by her best friend, Suzume, whom she has named Francesca.
Late one evening, Hibari sees a hill and recognizes a person standing beside a tree at its peak as "her Prince", who has been appearing to her in her dreams. She runs towards him and he mysteriously vanishes. A glowing sphere descends from the sky and lands on her palms. It materializes into a PataPi. She hugs it and the adventure of Hibari and Densuke the PataPi begins.
Unbeknownst to Hibari, she is under the watchful eye of a shadowy character and is ambushed when she walks home from school. Attacked by strange creatures called Homunculus and confronted by a masked woman (Jun), Hibari finds out that they are after Densuke and strives to protect him. When all else fails, Jun calls out a more powerful creature called Cerberus to attack Hibari and take Densuke from her. Out of extreme love for Densuke, Hibari cries out and an intense beam of light descends from the sky onto Densuke. Densuke vanishes and transformed into a woman in a black body suit to which various mecha components materialize and bond to her. Densuke has become the Diva (Aphrodite), who looks remarkably like Hibari. Aphrodite soundly defeats Cerberus while Jun runs away in defeated frustration. Unknown to Hibari, a masked man in black (Takashi a.k.a. Shooting Star) stands at the top of a building, observing every moment of what happened.
Shortly thereafter, Aphrodite vanishes, and Densuke re-appears and falls to the ground as Hibari quickly scoops him up.
The next few episodes focus on unloc |
https://en.wikipedia.org/wiki/David%20Moon | David or Dave Moon may refer to:
David A. Moon, American computer scientist and Lisp developer
David Moon (historian), British professor
David Moon (politician) (born 1979), Maryland legislator
David Moon (rugby league), Australian rugby league player
David Moon (Jersey politician), candidate in the 1996 Jersey general election
Dave Moon, American football player chosen in the 1949 NFL Draft
Dave Moon, British television editor of Freshers
Dave Moon, Canadian curler on the winning team in the 2003 Canadian Masters Curling Championships
David Moon, cast member of the Impractical Jokers UK TV series
David Moon, a minor character on Frasier, an American sitcom
See also
Moon (surname), including a list of people with the name
David Mooney (disambiguation) |
https://en.wikipedia.org/wiki/Atomix | Atomix may refer to:
Atomix (video game), a computer puzzle game
Atomix, a character from the TV show Ben 10: Omniverse
Atomix, a Korean restaurant in Rose Hill, Manhattan rated among the Top 50 in the world.
See also
Atomics (disambiguation) |
https://en.wikipedia.org/wiki/Keymaker | The Keymaker is a fictional character, portrayed by Korean-American actor Randall Duk Kim, in the 2003 film The Matrix Reloaded. He is a computer program that can create shortcut commands, physically represented as keys, which can be used by other programs to gain quick access to various areas within the simulated reality of the Matrix. He appears as an elderly, bespectacled Korean man dressed in a button-down shirt, smock, and an apron hung with bunches of keys.
Backstory and role
The Keymaker is an "Exile", a program whose usefulness has come to an end and that has chosen to hide in the Matrix rather than be deleted. The Oracle tells Neo that he will need the Keymaker's help in order to reach the Source, the machine mainframe; however, he is being held captive by a dangerous Exile known as the Merovingian. Neo, Morpheus, and Trinity are rebuffed when they demand that the Merovingian release the Keymaker, but his wife Persephone betrays him and takes them to where the Keymaker is being held: a small room in which he toils over a key-cutting machine. Thousands of previously made keys hang in bunches on the walls.
Morpheus and Trinity, separated from Neo, flee with the Keymaker as the Merovingian's Twins, the police, and three Agents (sent to terminate the Keymaker as he is an Exile) pursue them onto the city freeways. The Keymaker assists in the escape by quickly providing Trinity with the ignition key needed to start a motorcycle, saving her the time of waiting for hot-wiring instructions to be uploaded into her mind.
Following the escape, the Keymaker meets with three crews of Zion rebels to describe the security measures in place around the building which houses the door that leads to the Source. Two electric power stations must both be shut down in order to disable the alarm system, after which Neo will have only a short time to reach the Source before the building is destroyed by explosives; in addition, if the door is opened while the alarm is still active, the explosives will detonate. As the other two crews attack the power stations, the Keymaker leads Neo and Morpheus to a hall within the building, filled with doors that represent backdoor access to other parts of the Matrix.
They are interrupted by the arrival of Agent Smith and dozens of copies he has made of himself. The Keymaker hurriedly opens a door, allowing Neo and Morpheus to take cover inside a room as the Smiths open fire, but sustains multiple gunshot wounds to the chest. Before dying, he gives Neo a single key on a chain around his neck—the one needed to reach the Source—and points Morpheus toward a door that will allow him to re-enter the Matrix proper.
Role experience
Casting director Mali Finn succeeded in bringing Kim to the attention of the Wachowskis, the creators of the Matrix series. "Randall Duk Kim was cast for his talent, his presence and his voice," said Finn. After meeting the Wachowskis, Kim said he agreed to the Keymaker role "without a single bit of hesi |
https://en.wikipedia.org/wiki/3/24 | 3/24 () is a Catalan free-to-air news and information network operated by Televisió de Catalunya (TVC).
It was launched on 11 September 2003.
History
3/24 was born on 11 September 2003 as an initiative of the Catalan public television to develop digital terrestrial television in Catalonia. However, a general lack of DVB-T set top boxes combined with slight public interest towards digital terrestrial television prompted TVC to simulcast in analogue.
From its launch on 11 September 2003 until 12 June 2004, 3/24 was on air daily from 11p.m. till 8:30a.m.. The channel now operates as a regular full-time channel.
Contents
3/24 devotes exclusively to live news and information, including news, traffic (morning), sports and stock markets from Bolsa de Barcelona. Originally, 3/24 was to become the first 24-hour news service in Catalonia. Later, this plan was dropped, and it was remade into a continuous information service. In consequence, this channel now also features special blocks dedicated to science, society, history, etc.
Most of the day, under the title Notícies 3/24, the channel features a 30-minute informational wheel, including 2 minutes of headlines, 18 minutes of news, 8 minutes of sports and 2 minutes of regional weather. Along with other Televisió de Catalunya's channels, no live programming is featured between 01:00 and 07:00 unless news breaks.
3/24 also shares programs with sister channel TV3. It simulcasts TV3's daily news programs, Telenotícies every day at 14:30-16:00 and 21-22:00; and its morning news program Els Matins every weekday 08:00-10:15. Also, in the early morning, TV3 also simulcasts 3/24 from 07:00 to 08:00 on weekdays, 08:15 on Saturday and 10:15 on Sunday. During the summer break and public holidays, TV3 simulcasts 3/24 in its entirety, in place of Els Matins, but it ends at 10:00. Plus, the nightly world news programme Món 3/24, running from 22 to 23:30, was then rebroadcast on TV3 twice at 23:30 and 00:00 every Tuesday and Wednesday.
3/24 also broadcasts sports-related programmes such as "3/24 Esports" and its sister channel Esport 3 also simulcast this programme. This show can be watched nightly at 12:05am.
Programming
News
Noticies 3/24
Telenotícies
3/24 Esports
Information
L'entrevista del Diumenge
Més 3/24
3/24 en Áranes
Món 3/24
3/24 Comarques
See also
Televisió de Catalunya
External links
Official Site
Televisió de Catalunya
24-hour television news channels in Spain
Catalan-language television stations
Televisió de Catalunya
Television channels and stations established in 2003
Television stations in Catalonia |
https://en.wikipedia.org/wiki/Quill%20%28disambiguation%29 | A quill is a writing tool made from the wing feather of a large bird.
Quill may also refer to:
Computer software
Quill, a word processor developed by Psion
Quill (software), a 1982 suite of tools for literacy development
QUILL, a programming language used in Quintiq software
The Quill Adventure System, a 1983 computer program to write adventure games
Quill, an automated narrative generator from Narrative Science
Oculus Quill, a painting and animation software for virtual reality
Films
Quill (film), a 2004 Japanese movie
Quills (film), a 2000 English movie
Mechanical parts
Quill (bicycle part), a component that connects handlebars to the steerer tube of the fork
Quill drive, a mechanism to connect drive shafts together so they need not be oriented in the same direction
The non-rotating shaft that houses the spindle in a pillar drill
Music
Quill (band), a US band that played at the Woodstock festival
Quill (album)
The Quill (band), a Swedish stoner rock/metal band
The Quill (album), 1995
Quill, one of many plectra in a harpsichord, made from a feather or synthetic material
The quills, an old word in the United States and Britain for pan pipes
Places
Lake Quill in New Zealand, source of the Sutherland Falls
Quill, Georgia, a community in the United States
Quill City, Malaysia
Quill Lakes, a wetland complex in Saskatchewan, Canada
Quill Lake, Saskatchewan, a village northwest of Quill Lakes
The Quill (volcano), Sint Eustatius, Caribbean Netherlands
Publishing
Quill Award, an American literary award given 2005–2007
Quill Awards, annual journalism awards given by the Melbourne Press Club
The Quill (magazine), Bowdoin College's literary magazine
Quill (comics), several Marvel Comics characters
Quill (magazine), the magazine of the Society of Professional Journalists
The Quill (newspaper), the student newspaper at Brandon University
Other uses
Quill (surname), an Irish surname
Quill Corporation, a retailer based in Lincolnshire, Illinois
Quill Corp. v. North Dakota, a United States Supreme Court case regarding use tax
"Quill" (Grimm), a 2012 episode of the TV series Grimm
Quill (horse), an American Thoroughbred racehorse
Spine (zoology), a needle-like anatomical structure in some animals
Quill (satellite), a reconnaissance satellite programme
Quills (play), a 1995 play by Doug Wright
See also
Quiller (disambiguation)
Quilling, an art form
Quillwork, traditional Native American art form
Quillwort, common name of Isoetes |
https://en.wikipedia.org/wiki/Code%20reuse | In software development (and computer programming in general), code reuse, also called software reuse, is the use of existing software, or software knowledge, to build new software, following the reusability principles.
Code reuse may be achieved by different ways depending on a complexity of a programming language chosen and range from a lower-level approaches like code copy-pasting (e.g. via snippets), simple functions (procedures or subroutines) or a bunch of objects or functions organized into modules (e.g. libraries) or custom namespaces, and packages, frameworks or software suites in higher-levels.
Code reuse implies dependencies which can make code maintainability harder. At least one study found that code reuse reduces technical debt.
Overview
Ad hoc code reuse has been practiced from the earliest days of programming. Programmers have always reused sections of code, templates, functions, and procedures. Software reuse as a recognized area of study in software engineering, however, dates only from 1968 when Douglas McIlroy of Bell Laboratories proposed basing the software industry on reusable components.
Code reuse aims to save time and resources and reduce redundancy by taking advantage of assets that have already been created in some form within the software product development process. The key idea in reuse is that parts of a computer program written at one time can be or should be used in the construction of other programs written at a later time.
Code reuse may imply the creation of a separately maintained version of the reusable assets. While code is the most common resource selected for reuse, other assets generated during the development cycle may offer opportunities for reuse: software components, test suites, designs, documentation, and so on.
The software library is a good example of code reuse. Programmers may decide to create internal abstractions so that certain parts of their program can be reused, or may create custom libraries for their own use. Some characteristics that make software more easily reusable are modularity, loose coupling, high cohesion, information hiding and separation of concerns.
For newly written code to use a piece of existing code, some kind of interface, or means of communication, must be defined. These commonly include a "call" or use of a subroutine, object, class, or prototype. In organizations, such practices are formalized and standardized by domain engineering, also known as software product line engineering.
The general practice of using a prior version of an extant program as a starting point for the next version, is also a form of code reuse.
Some so-called code "reuse" involves simply copying some or all of the code from an existing program into a new one. While organizations can realize time to market benefits for a new product with this approach, they can subsequently be saddled with many of the same code duplication problems caused by cut and paste programming.
Many researche |
https://en.wikipedia.org/wiki/OEM%20%28disambiguation%29 | OEM is an original equipment manufacturer, a company that makes a part or subsystem that is used in another company's end product.
OEM may also refer to:
Computing
Object Exchange Model, a model for exchanging data between object-oriented databases
OEM font, or OEM-US, the original character set of the IBM PC,
Oracle Enterprise Manager, a computer application that aims to manage software produced by Oracle Corporation
Organisations
OEM International, a former construction company in Gibraltar
Office for Emergency Management, a World War II function within the Executive Office of the United States Government
Office of Emergency Management, a general term for emergency management functions
Oklahoma Department of Emergency Management, for coordinating the response to a natural disaster
Organización Editorial Mexicana, a Mexican print media company
Other uses
Occupational and Environmental Medicine, a medical journal
See also |
https://en.wikipedia.org/wiki/Fred%20Fish | Fred Fish (November 4, 1952 – April 20, 2007) was a computer programmer notable for work on the GNU Debugger and his series of freeware disks for the Amiga.
The Amiga Library Disks – colloquially referred to as Fish Disks (a term coined by Perry Kivolowitz at a Jersey Amiga User Group meeting) – became the first national rallying point, a sort of early postal system. Fish would distribute his disks around the world in time for regional and local user group meetings, which in turn duplicated them for local distribution. Typically, only the cost of materials changed hands. The Fish Disk series ran from 1986 to 1994. In it, one can chart the growing sophistication of Amiga software and see the emergence of many software trends.
The Fish Disks were distributed at computer stores and Amiga enthusiast clubs. Contributors submitted applications and source code and the best of these each month were assembled and released as a diskette. Since the Internet was not yet in popular usage outside military and university circles, this was a primary way for enthusiasts to share work and ideas. He also initiated the "GeekGadgets" project, a GNU standard environment for AmigaOS and BeOS.
Fish worked for Cygnus Solutions in the 1990s before he left for Be Inc. in 1998.
In 1978, he self-published User Survival Guide for TI-58/59 Master Library, which was advertised in enthusiast newsletters covering the TI-59 programmable calculator.
Personal life
Fred Fish was married to Michelle Fish (née Norman) at the time of his death. Fred Fish died at his home in Idaho on Friday April 20, 2007 of a heart attack.
References
External links
Fish Disks
Announcement of first Fish disks
- research in progress, explicitly welcomes Wiki usage.
Computer programmers
Amiga people
1952 births
2007 deaths
Place of birth missing
Deaths from myocarditis |
https://en.wikipedia.org/wiki/Man%20from%20Atlantis | Man from Atlantis is a short-lived American science fiction/fantasy television series that ran for 13 episodes on the NBC network during the 1977–78 season, following four television films that had aired earlier in 1977. Ratings success by these movies led to the commissioning of a weekly series for the 1977–78 season, but it was canceled at the end of the first season due to a declining audience and high production costs.
Plot
The series stars Patrick Duffy as an amnesiac man given the name of Mark Harris, believed to be the only surviving citizen of the lost civilization of Atlantis. He possesses exceptional abilities, including the ability to breathe underwater and withstand extreme depth pressures, and superhuman strength. His hands and feet are webbed, his eyes are unusually sensitive to light, and he swims using his arms and legs in a fashion suggestive of an underwater butterfly stroke or dolphin kick. Following his discovery, he is recruited by the Foundation for Oceanic Research, a governmental agency that conducts top secret research and explores the depths of the ocean in a sophisticated submarine called the Cetacean.
The supporting cast includes Belinda J. Montgomery as Dr. Elizabeth Merrill (who had nursed Mark Harris back to health) and Alan Fudge as C. W. Crawford, Jr., both of the Foundation for Oceanic Research. Victor Buono played the villainous Mr. Schubert in the pilot and several episodes of the series. Kenneth Tigar appeared in the second, third, and fourth movies as Dr. Miller Simon, M.D., also of the Foundation for Oceanic Research. The series added an ensemble cast as "The Crew of the Cetacean", consisting of Richard Laurance Williams, J. Victor Lopez, Jean Marie Hon (who had also been seen in Ark II), and Anson Downes. In the 12th episode, a new female lead character replaced Elizabeth Merrill, Dr. Jenny Reynolds, played by actress Lisa Blake Richards. (Belinda Montgomery had managed to get out of her contract with the help of lawyers.) The last episode did not feature any female lead character.
Production
The show was produced by Herbert Franklin Solow's studio Solow Production Company, a company spun off from the live-action arm of American animation studio Hanna-Barbera Productions. The Foundation for Oceanic Research headquarters building was represented by the Point Fermin lighthouse in San Pedro, California. The Cetacean submarine's voyages were shown through miniature work by the special effects team of Gene Warren.
Critical reaction
Critic Tom Shales, reviewing the show for the Washington Post, opined that "kids may be impressed" by the heroics and special effects, but the show lacked "adult appeal" and that the stories would "soon wear thinner than water".
Episodes
Television movies
Series
Home media
The pilot film was released on VHS in 1986 by Worldvision Home Video, and re-released in 1987 by Goodtimes Home Video. It was later released on DVD as a part of the Warner Archive collection from Warner |
https://en.wikipedia.org/wiki/Honeytoken | In the field of computer security, honeytokens are honeypots that are not computer systems. Their value lies not in their use, but in their abuse. As such, they are a generalization of such ideas as the honeypot and the canary values often used in stack protection schemes. Honeytokens do not necessarily prevent any tampering with the data, but instead give the administrator a further measure of confidence in the data integrity.
Honeytokens are fictitious words or records that are added to legitimate databases. They allow administrators to track data in situations they wouldn't normally be able to track, such as cloud-based networks. If data is stolen, honey tokens allow administrators to identify who it was stolen from or how it was leaked. If there are three locations for medical records, different honey tokens in the form of fake medical records could be added to each location. Different honeytokens would be in each set of records.
If they are chosen to be unique and unlikely to ever appear in legitimate traffic, they can also be detected over the network by an intrusion-detection system (IDS), alerting the system administrator to things that would otherwise go unnoticed. This is one case where they go beyond merely ensuring integrity, and with some reactive security mechanisms, may actually prevent the malicious activity, e.g. by dropping all packets containing the honeytoken at the router. However, such mechanisms have pitfalls because it might cause serious problems if the honeytoken was poorly chosen and appeared in otherwise legitimate network traffic, which was then dropped.
The term was first coined by Augusto Paes de Barros in 2003.
Uses
Honeytokens can exist in many forms, from a dead, fake account to a database entry that would only be selected by malicious queries, making the concept ideally suited to ensuring data integrity. A particular example of a honeytoken is a fake email address used to track if a mailing list has been stolen.
See also
Honeypot
Fictitious entry
Trap street
References
Computer network security |
https://en.wikipedia.org/wiki/Internet%20%28disambiguation%29 | The Internet is a global system of interconnected computer networks.
Internet may also refer to:
Internet (web browser), by Amazon
Internet Co., Ltd., a software company based in Japan
The Internet (band), a soul music band
"Internets", a catchphrase to portray someone as ignorant about technology
"Internet", a song by Post Malone from Hollywood's Bleeding
International Project Management Association, known as INTERNET before 1996; see Association for Project Management
See also
Internet Protocol Suite, a computer networking model
Internetwork, any system of interconnected networks
Private network, referred to in RFC 1918 as "private internets"
Intranet, a computer network within an organization
Internet2, a consortium that develops high bandwidth network applications |
https://en.wikipedia.org/wiki/Output%20device | An output device is any piece of computer hardware that converts information/DATA into a human-perceptible form or, historically, into a physical machine-readable form for use with other non-computerized equipment. It can be text, graphics, tactile, audio, or video. Examples include monitors, printers, speakers, headphones, projectors, GPS devices, optical mark readers, and braille readers.
In an industrial setting, output devices also include "printers" for paper tape and punched cards, especially where the tape or cards are subsequently used to control industrial equipment, such as an industrial loom with electrical robotics which is not fully computerized.
Visual
A display device is the most common form of output device which presents output visually on computer screen. The output appears temporarily on the screen and can easily be altered or erased.
With all-in-one PCs, notebook computers, hand held PCs and other devices; the term display screen is used for the display device. The display devices are also used in home entertainment systems, mobile systems, cameras and video game systems.
Display devices form images by illuminating a desired configuration of pixels. Raster display devices are organized in the form of a 2-dimensional matrix with rows and columns. This is done many times within a second, typically 60, 75, 120 or 144Hz on consumer devices.
Interface
The interface between a computer's CPU and the display is a Graphics Processing Unit (GPU). This processor is used to form images on a framebuffer. When the image is to be sent to the display, the GPU sends its image through a video display controller to generate a video signal, which is then sent to a display interface such as HDMI, VGA, DisplayPort, or DVI.
GPUs can be divided into discrete and integrated units, the former being an external unit and the latter of which is included within a CPU die. Discrete graphics cards are almost always connected to the host through the PCI Express bus, while older graphics cards may have used AGP or PCI. Some mobile computers support an external graphics card through Thunderbolt (via PCIe).
Form factors
Monitor
A monitor is a standalone display commonly used with a desktop computer, or in conjunction to a laptop as an external display. The monitor is connected to the host through the use of a display cable, such as HDMI, DisplayPort, VGA, and more.
Older monitors use CRT technology, while modern monitors are typically flat panel displays using a plethora of technologies such as TFT-LCD, LED, OLED, and more.
Internal display
Almost all mobile devices incorporate an internal display. These internal displays are connected to the computer through an internal display interface such as LVDS or eDP. The chief advantage of these displays is their portability.
Terminal
Prior to the development of modern pixel-oriented displays, computer terminals were used, composed of a character-oriented display device known as a VDU and a comput |
https://en.wikipedia.org/wiki/Random%20sample%20consensus | Random sample consensus (RANSAC) is an iterative method to estimate parameters of a mathematical model from a set of observed data that contains outliers, when outliers are to be accorded no influence on the values of the estimates. Therefore, it also can be interpreted as an outlier detection method. It is a non-deterministic algorithm in the sense that it produces a reasonable result only with a certain probability, with this probability increasing as more iterations are allowed. The algorithm was first published by Fischler and Bolles at SRI International in 1981. They used RANSAC to solve the Location Determination Problem (LDP), where the goal is to determine the points in the space that project onto an image into a set of landmarks with known locations.
RANSAC uses repeated random sub-sampling. A basic assumption is that the data consists of "inliers", i.e., data whose distribution can be explained by some set of model parameters, though may be subject to noise, and "outliers" which are data that do not fit the model. The outliers can come, for example, from extreme values of the noise or from erroneous measurements or incorrect hypotheses about the interpretation of data. RANSAC also assumes that, given a (usually small) set of inliers, there exists a procedure which can estimate the parameters of a model that optimally explains or fits this data.
Example
A simple example is fitting a line in two dimensions to a set of observations. Assuming that this set contains both inliers, i.e., points which approximately can be fitted to a line, and outliers, points which cannot be fitted to this line, a simple least squares method for line fitting will generally produce a line with a bad fit to the data including inliers and outliers. The reason is that it is optimally fitted to all points, including the outliers. RANSAC, on the other hand, attempts to exclude the outliers and find a linear model that only uses the inliers in its calculation. This is done by fitting linear models to several random samplings of the data and returning the model that has the best fit to a subset of the data. Since the inliers tend to be more linearly related than a random mixture of inliers and outliers, a random subset that consists entirely of inliers will have the best model fit. In practice, there is no guarantee that a subset of inliers will be randomly sampled, and the probability of the algorithm succeeding depends on the proportion of inliers in the data as well as the choice of several algorithm parameters.
Overview
The RANSAC algorithm is a learning technique to estimate parameters of a model by random sampling of observed data. Given a dataset whose data elements contain both inliers and outliers, RANSAC uses the voting scheme to find the optimal fitting result. Data elements in the dataset are used to vote for one or multiple models. The implementation of this voting scheme is based on two assumptions: that the noisy features will not vote consistently f |
https://en.wikipedia.org/wiki/Escom%20AG | Escom AG (stylized in uppercase; previously Schmitt Computer Systems) was a German computer company, best known in Germany, the Netherlands, United Kingdom and the United States as the successful purchaser of Commodore International and the Amiga trademarks in 1995.
Escom was founded by Manfred Schmitt of Darmstadt, West Germany as the computer division of his music company in 1986. It became a separate company in 1991. In 1993, it became a publicly traded company, and it grew rapidly, controlling 11.2% of the market of German PCs by 1994.
During 1992 and 1993, a British operation was set up with a distribution and assembly base in Irvine, North Ayrshire and a small number of retail stores. These followed the model established in Germany, with small town centre shops which would customise PCs to order, rather than the out of town superstores and mail order businesses which dominated the market in the United Kingdom.
In February 1995, Escom's retail presence on the high streets of the United Kingdom suddenly expanded massively, when it took over many branches of the Rumbelows electrical chain, which were being sold off by Rumbelows owner Thorn EMI. Also in April 1995, Escom bought Commodore International for US$14 million, primarily to get the Commodore and Amiga brand names.
Escom was one of two companies to bid for the Commodore and Amiga Brand names and assets. They won the bidding process against Dell and Creative Electronics International. Many other companies were involved in the buyout but did not bid such as Commodore UK and Samsung. It started using the Commodore name on computers sold in Europe, and established a separate division for Amiga related technologies.
The company grew too quickly, however, and lost 185 million German Mark that year. With no bailout from its shareholders, the company declared bankruptcy on 15 July 1996, and was liquidated. The Commodore trademarks were purchased the following year by Tulip Computers, while the remaining trademarks, together with the full set of patents, copyrights and other intellectual property, were acquired by Gateway 2000.
References
External links
Amiga companies
Commodore International
Defunct computer companies of Germany
Defunct computer hardware companies |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Finland | This is a list of radio networks and stations in Finland and elsewhere broadcasting exclusively or partly in the Finnish language.
Yleisradio
National stations
YleX
Yle Radio Suomi
Yle Vega
Yle X3M
Regional stations
Yle Radio Suomi
Helsinki
Hämeenlinna
Joensuu
Jyväskylä
Kajaani
Kemi
Kokkola
Kotka
Kuopio
Lahti
Lappeenranta
Mikkeli
Oulu
Pohjanmaa (Vaasa and Seinäjoki)
Pori
Rovaniemi
Sámi Radio
Tampere
Turku
Yle Vega
Huvudstadsregionen (Helsinki)
Västnyland (Raseborg)
Östnyland (Porvoo)
Österbotten (Vaasa)
Åboland (Turku)
Commercial radio
National distribution
Radio Dei
Radio Nova
Radio Rock
Radio Sputnik
Radio Suomipop
Local distribution
Aito Kajaus
Auran Aallot
Business FM
Finest FM
FUN Tampere
Iskelmä
Järviradio
Lähiradio
Metro Helsinki
Pispalan Radio
Radio 957
Radio City
Radio Helsinki
Radio Kompassi
Radio Kuopio
Radio Mikkeli
Radio Moreeni
Radio Musa
Radio Pooki
Radio Pori
Radio Pro
Radio Ramona
Radio Sandels
Radio SUN
Radio Vaasa
Radio Voima
Sea FM
Steel FM
Spirit FM
HitMix
Stations broadcasting in Finnish outside Finland
Public service stations (Sweden)
See also
Media of Finland
Fin |
https://en.wikipedia.org/wiki/Geometry%20pipelines | Geometric manipulation of modelling primitives, such as that performed by a geometry pipeline, is the first stage in computer graphics systems which perform image generation based on geometric models. While geometry pipelines were originally implemented in software, they have become highly amenable to hardware implementation, particularly since the advent of very-large-scale integration (VLSI) in the early 1980s. A device called the Geometry Engine developed by Jim Clark and Marc Hannah at Stanford University in about 1981 was the watershed for what has since become an increasingly commoditized function in contemporary image-synthetic raster display systems.
Geometric transformations are applied to the vertices of polygons, or other geometric objects used as modelling primitives, as part of the first stage in a classical geometry-based graphic image rendering pipeline. Geometric computations may also be applied to transform polygon or repair surface normals, and then to perform the lighting and shading computations used in their subsequent rendering.
History
Hardware implementations of the geometry pipeline were introduced in the early Evans & Sutherland Picture System, but perhaps received broader recognition when later applied in the broad range of graphics systems products introduced by Silicon Graphics (SGI). Initially the SGI geometry hardware performed simple model space to screen space viewing transformations with all the lighting and shading handled by a separate hardware implementation stage. In later, much higher performance applications, such as the RealityEngine, they began to be applied to perform part of the rendering support as well.
More recently, perhaps dating from the late 1990s, the hardware support required to perform the manipulation and rendering of quite complex scenes has become accessible to the consumer market.
Companies such as Nvidia and AMD Graphics (formerly ATI) are two current leading representatives of hardware vendors in this space. The GeForce line of graphics cards from Nvidia was the first to support full OpenGL and Direct3D hardware geometry processing in the consumer PC market, while some earlier products such as Rendition Verite incorporated hardware geometry processing through proprietary programming interfaces. On the whole, earlier graphics accelerators by 3Dfx, Matrox and others relied on the CPU for geometry processing.
This subject matter is part of the technical foundation for modern computer graphics, and is a comprehensive topic taught at both the undergraduate and graduate levels as part of a computer science education.
See also
Vertex pipeline
Graphics pipeline (include Pixel pipeline)
Rasterisation
Open Graphics Project
References
3D computer graphics |
https://en.wikipedia.org/wiki/Bruno%20Kramm | Bruno Kramm (born 13 October 1967, in Munich) is a German musician, known for programming, playing synthesizers and keyboards, co-fronting and performing backup vocals for the electro-industrial duo Das Ich, alongside Stefan Ackermann. Kramm is a multi-instrumentalist, singer-songwriter and founder of the German goth club, "Generation Gothic". He is also a record producer for a number of musical projects.
Known for his iconic "devil-horn hair", Kramm sports a dark outfit during performances in Das Ich, often being significantly more "made-up" than vocalist Ackermann. His vocals tend to bring up a deeper and more intense feel that contrast Stefan's fast-paced and shrill, exciting voice.
Bruno Kramm was an active member of the Pirate Party Germany and has been appointed by its board as federal commissioner on copyright issues.
In September 2016 Kramm stepped down as party chairman and rejoined Alliance '90/The Greens.
See also
Das Ich
Stefan Ackermann
External links
Bruno Kramm and Generation Gothic – Official MySpace.com profile
Das Ich – Official website
References
1967 births
Living people
German keyboardists
German record producers
Pirate Party Germany politicians
Alliance 90/The Greens politicians |
https://en.wikipedia.org/wiki/Hearing%20Voices%20Network | Hearing Voices Networks, closely related to the Hearing Voices Movement, are peer-focused national organizations for people who hear voices (commonly referred to as auditory hallucinations) and supporting family members, activists and mental health practitioners. Members may or may not have a psychiatric diagnosis. Networks promote an alternative approach, where voices are not necessarily seen as signs of mental illness and regard hearing voices as a meaningful and understandable, although unusual, human variation. Voices are not seen as the problem, rather it is the relationship the person has with their voices that is regarded as the main issue.
Development
The first hearing voices network was founded in the Netherlands in 1987 by the Dutch psychiatrist Marius Romme, the science journalist, Sandra Escher, and voice hearer, Patsy Hage. This was followed by the founding of the UK network in 1988 based in Manchester, England. Subsequently networks have been established in 29 countries over the world, including Australia, Canada, the UK, and the United States. The first 15 years of the global networks' development is outlined by Adam James in his book Raising Our Voices (2001).
The National and Regional Networks are affiliated with the international umbrella organization known as INTERVOICE (The International Network for Training Education and Research into Hearing Voices) and often referred to as the Hearing Voices Movement. Within these international networks, the combined experience of voice-hearers and professionals have overseen the development of ways of working with people who hear voices, drawing on the value of peer support and helping people live peacefully and positively with their experiences.
Purpose
The principal roles of Hearing Voices Networks are as follows:
To support and develop local Hearing Voices Support Groups
Raise awareness of the hearing voices approach
To campaign for human rights and social justice for people who hear voices
To provide information, advice and support to people who hear voices, their family, friends
To provide training and education for mental health services and practitioners
Practices and philosophy
These networks are designed to support voice hearers specifically through local hearing voices support groups, where people who hear voices are afforded the opportunity in a non-medical setting to share their experiences, coping mechanisms, and explanatory frameworks. These groups are run in different ways and some are exclusive to individuals who hear voices, while others are supported by mental health workers. Groups are based in a range of settings, from community centers, libraries, churches, child and adolescent mental health services, prisons, and inpatient units.
Groups are designed to function as peer support groups meant foster socialization and belonging, not therapy and treatment. Members are encouraged to talk about their experiences, to learn what the voices mean to them, and how to gain c |
https://en.wikipedia.org/wiki/Shader | In computer graphics, a shader is a computer program that calculates the appropriate levels of light, darkness, and color during the rendering of a 3D scene—a process known as shading. Shaders have evolved to perform a variety of specialized functions in computer graphics special effects and video post-processing, as well as general-purpose computing on graphics processing units.
Traditional shaders calculate rendering effects on graphics hardware with a high degree of flexibility. Most shaders are coded for (and run on) a graphics processing unit (GPU), though this is not a strict requirement. Shading languages are used to program the GPU's rendering pipeline, which has mostly superseded the fixed-function pipeline of the past that only allowed for common geometry transforming and pixel-shading functions; with shaders, customized effects can be used. The position and color (hue, saturation, brightness, and contrast) of all pixels, vertices, and/or textures used to construct a final rendered image can be altered using algorithms defined in a shader, and can be modified by external variables or textures introduced by the computer program calling the shader.
Shaders are used widely in cinema post-processing, computer-generated imagery, and video games to produce a range of effects. Beyond simple lighting models, more complex uses of shaders include: altering the hue, saturation, brightness (HSL/HSV) or contrast of an image; producing blur, light bloom, volumetric lighting, normal mapping (for depth effects), bokeh, cel shading, posterization, bump mapping, distortion, chroma keying (for so-called "bluescreen/greenscreen" effects), edge and motion detection, as well as psychedelic effects such as those seen in the demoscene.
History
This use of the term "shader" was introduced to the public by Pixar with version 3.0 of their RenderMan Interface Specification, originally published in May 1988.
As graphics processing units evolved, major graphics software libraries such as OpenGL and Direct3D began to support shaders. The first shader-capable GPUs only supported pixel shading, but vertex shaders were quickly introduced once developers realized the power of shaders. The first video card with a programmable pixel shader was the Nvidia GeForce 3 (NV20), released in 2001. Geometry shaders were introduced with Direct3D 10 and OpenGL 3.2. Eventually, graphics hardware evolved toward a unified shader model.
Design
Shaders are simple programs that describe the traits of either a vertex or a pixel. Vertex shaders describe the attributes (position, texture coordinates, colors, etc.) of a vertex, while pixel shaders describe the traits (color, z-depth and alpha value) of a pixel. A vertex shader is called for each vertex in a primitive (possibly after tessellation); thus one vertex in, one (updated) vertex out. Each vertex is then rendered as a series of pixels onto a surface (block of memory) that will eventually be sent to the screen.
Shaders replace |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Mississippi | The following is a list of FCC-licensed radio stations in the U.S. state of Mississippi, which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
Defunct
WAKK
WCBI
WCMR-FM
WCSA
WEPA
WETX
WGRM
WGRM-FM
WHLV
WHSY (1230 AM)
WIGG
WILU-LP
WJNS
WKOR
WKOZ
WKXG
WLGD
WMLC
WMOX
WNBN
WOKJ
WQBC
WQMA
WQST
WSAO
WSWG
WXAB
WZHL
WZRX
See also
Mississippi media
List of newspapers in Mississippi
List of television stations in Mississippi
Media of locales in Mississippi: Biloxi, Gulfport, Hattiesburg, Jackson
References
Bibliography
External links
(Directory ceased in 2017)
Mississippi Association of Broadcasters
Images
Mississippi
Radio |
https://en.wikipedia.org/wiki/Independent%20software%20vendor | An independent software vendor (ISV), also known as a software publisher, is an organization specializing in making and selling software, as opposed to computer hardware, designed for mass or niche markets. This is in contrast to in-house software, which is developed by the organization that will use it, or custom software, which is designed or adapted for a single, specific third party. Although ISV-provided software is consumed by end users, it remains the property of the vendor.
Software products developed by ISVs serve a wide variety of purposes. Examples include software for real estate brokers, scheduling for healthcare personnel, barcode scanning, stock maintenance, gambling, retailing, energy exploration, vehicle fleet management, and child care management software.
An ISV makes and sells software products that run on one or more computer hardware or operating system platforms. Companies that make the platforms, such as Microsoft, AWS, Cisco, IBM, Hewlett-Packard, Red Hat, Google, Oracle, VMware, Lenovo, Apple, SAP, Salesforce and ServiceNow encourage and lend support to ISVs, often with special "business partner" programs. These programs enable the platform provider and the ISV to leverage joint strengths and convert them into incremental business opportunities.
Independent software vendors have become one of the primary groups in the IT industry, often serving as relays to disseminate new technologies and solutions.
See also
Commercial off-the-shelf
Software company
Micro ISV
References
Software industry |
https://en.wikipedia.org/wiki/Underground%20Network | Underground Network is Anti-Flag's third studio album, released on Fat Wreck Chords in 2001. Widely considered to be the band's breakthrough album, it helped make Anti-Flag become a household name in the U.S. punk scene with tracks like "Underground Network," "Bring Out Your Dead," and "Stars and Stripes."
The title "This Machine Kills Fascists" pays tribute to folk-music hero Woody Guthrie, who had a guitar labeled with the same slogan.
Background
In 2000, Anti-Flag went on the Vans Warped Tour, where they met Fat Mike, head of Fat Wreck Chords. The band had originally tried to get their previous album, A New Kind of Army, released on the label, but Mike had turned them down, offering to release it on Honest Don's Records due to the band being different than the other bands on Fat. Instead, the band released the album on Go-Kart Records and A-F Records, their own label. Mike told them on the tour that he had been impressed with them turning him down, and offered to release their next album on Fat. The band accepted, and they went into the studio in November of that year to start recording. Having co-produced their last 2 albums with Joe West, the band asked Squirtgun bassist and producer Mass Giorgini to produce the album, in order to make them sound better. According to Justin, "I could write half decent songs. The problem was that we couldn't play them very well. Luckily...Mass Giorgini found a way to help us sound like better musicians than we were at the time."
Writing and Recording
The band worked on the album throughout November, and January through February. Mass had originally told Pat that it would take about an hour to record each song, although it took the band three months to finish it. All of the songs were recorded at Giorigini's studio, Sonic Iguana Studios. Musically, the album is heavier than their previous albums. The album's lyrics were inspired by the writings of Noam Chomsky, Howard Zinn, and Matthew Rothschild. This is the first album to feature material written by Chris #2, as the bass parts on the last album had already been written by the time he joined the band. The album is also the first to include political essays in the booklet, which would become a fixture in most of their future albums.
Music
Angry, Young and Poor is similar to the song Born to Die, off of Their System Doesn't Work for You, and features commentary on the problems facing the American Youth. This Machine Kills Fascists is a hardcore style song that attacks the Neo-Nazi punks who had tried to infiltrate the Pittsburgh punk scene. The title track is a slower, more melodic track and features a guitar solo from Justin. The song criticizes American Mainstream Media, and calls for the use of alternative news media.
Daddy Warbux is the first song to feature Chris #2 singing lead vocals, and is a straight-forward punk song. Vieques, Puerto Rico draws attention to the US Government's use of Puerto Rico for military training and munitions testing, and |
https://en.wikipedia.org/wiki/Superordinate | Superordinate may refer to:
In metadata analysis and linguistics, an element of analytical relationship-classification schemes
Superordinate goals, in psychology, those goals that further other specified goals
Hypernymy, in the context of linguistic hyponymy and hypernymy |
https://en.wikipedia.org/wiki/Generative%20topographic%20map | Generative topographic map (GTM) is a machine learning method that is a probabilistic counterpart of the self-organizing map (SOM), is probably convergent and does not require a shrinking neighborhood or a decreasing step size. It is a generative model: the data is assumed to arise by first probabilistically picking a point in a low-dimensional space, mapping the point to the observed high-dimensional input space (via a smooth function), then adding noise in that space. The parameters of the low-dimensional probability distribution, the smooth map and the noise are all learned from the training data using the expectation-maximization (EM) algorithm. GTM was introduced in 1996 in a paper by Christopher Bishop, Markus Svensen, and Christopher K. I. Williams.
Details of the algorithm
The approach is strongly related to density networks which use importance sampling and a multi-layer perceptron to form a non-linear latent variable model. In the GTM the latent space is a discrete grid of points which is assumed to be non-linearly projected into data space. A Gaussian noise assumption is then made in data space so that the model becomes a constrained mixture of Gaussians. Then the model's likelihood can be maximized by EM.
In theory, an arbitrary nonlinear parametric deformation could be used. The optimal parameters could be found by gradient descent, etc.
The suggested approach to the nonlinear mapping is to use a radial basis function network (RBF) to create a nonlinear mapping between the latent space and the data space. The nodes of the
RBF network then form a feature space and the nonlinear mapping can then be taken as a linear transform of this feature space. This approach has the advantage over the suggested density network approach that it can be optimised analytically.
Uses
In data analysis, GTMs are like a nonlinear version of principal components analysis, which allows high-dimensional data to be modelled as resulting from Gaussian noise added to sources in lower-dimensional latent space. For example, to locate stocks in plottable 2D space based on their hi-D time-series shapes. Other applications may want to have fewer sources than data points, for example mixture models.
In generative deformational modelling, the latent and data spaces have the same dimensions, for example, 2D images or 1 audio sound waves. Extra 'empty' dimensions are added to the source (known as the 'template' in this form of modelling), for example locating the 1D sound wave in 2D space. Further nonlinear dimensions are then added, produced by combining the original dimensions. The enlarged latent space is then projected back into the 1D data space. The probability of a given projection is, as before, given by the product of the likelihood of the data under the Gaussian noise model with the prior on the deformation parameter. Unlike conventional spring-based deformation modelling, this has the advantage of being analytically optimizable. The disadva |
https://en.wikipedia.org/wiki/Ghostbusters%20%281984%20video%20game%29 | Ghostbusters is a licensed game by Activision based on the film of the same name. It was designed by David Crane and released for several home computer platforms in 1984, and later for video game console systems, including the Atari 2600, Master System and Nintendo Entertainment System. The primary target was the Commodore 64 and the programmer for the initial version of the game was Adam Bellin. All versions of the game were released in the USA except for the Amstrad CPC and ZX Spectrum versions, which were released only in Europe, and the MSX version, which was released only in Europe, South America, and Japan.
In 1984, after the film Ghostbusters had been launched, John Dolgen VP of Business Development at Columbia Pictures approached Gregory Fischbach (President of Activision International and subsequently CEO and Co-founder of Acclaim Entertainment) and offered to license the game rights to Activision without specific rules or requests for the design or content of the game, only stipulating that it was to be finished as quickly as possible in order to be released while the movie was at peak popularity. Activision was forced to complete the programming work in only six weeks in contrast to their usual several months of development time for a game. Activision had at the time a rough concept for a driving/maze game to be called "Car Wars", and it was decided to build the Ghostbusters game from it. Both the movie and the game proved to be huge successes with the game selling over two million copies by 1989.
Gameplay
The player sets up a Ghostbusters franchise in a city whose psychokinetic (PK) energy levels have begun to rise. At the start of the game, the player is given a set amount of money and must use it to buy a vehicle and equipment for detecting/catching ghosts. They must then move through a grid representing the city, with flashing red blocks indicating sites of ghost activity.
When the player moves to a flashing block, the game shifts to an overhead street view and they must drive to the site, attempting to vacuum up stray ghosts if the vehicle is equipped to do so. Upon reaching the site, the player must maneuver two Ghostbusters to guide a Slimer ghost into position to be drawn into a trap. Successfully doing so awards money, but each failure causes the PK energy level to jump and incapacitates one of the player's three team member characters.
The player must return to the Ghostbusters headquarters at intervals to empty the traps and/or revive any incapacitated team members. As the game progresses, the player must also keep free-roaming ghosts from reaching the temple of Zuul for as long as possible; each one that does so adds to the PK energy level. The ghosts occasionally merge to form the Stay Puft Marshmallow Man, who will attempt to trample a city block. Stopping such an attack earns a bonus, but each failure to do so deducts money.
If the player has not earned more money than the total spent on equipment when the PK ener |
https://en.wikipedia.org/wiki/30%20Seconds%20to%20Fame | 30 Seconds to Fame is an American television series that was shown on the Fox Network from July 17, 2002 to June 26, 2003, featuring a talent show where acts could only last up to 30 seconds each, regardless of any resolution to the act. The series was hosted by Craig Jackson.
Many different talents were exhibited, such as contortionism, juggling, magic tricks, stand-up comedy, and beatboxing, in addition to singing and dancing acts. Much of the charm of the show was derived from the fact that each act lasted only 30 seconds, leading to a variety of different acts being displayed. The live audience acted as the judges. During the performances, if the audience found an act undesirable to watch, they booed and used electronic devices to put in a vote for elimination, complete with an on-screen "Eliminator" scale graphic (colored in green, yellow, and red). If enough people did so (i.e. the "Eliminator" scale needle hit any part of the red area), the act was to be cut short, regardless of how much time was left on the clock.
At the end of the show, every member of the audience voted for his or her favorite act, and the top three acts got a chance to do another 30-second performance. After this, a final round of voting occurred, and the winner earned a cash prize of US$25,000.
The network began to rerun the series on their Saturday late night block in January 2011 in order to fill the half-hour after Fringe which was vacated by the canceled Running Wilde, until the launch of the Animation Domination High Definition block in July 2013; the late night timeslot was used for repurposed reruns of recent Fox series after Fox temporarily ending original late night programming in September 2010.
International versions
These versions are no longer airing.
In Indonesian version, Global TV picked this format which was distributed with FremantleMedia
References
External links
Official Website
20th Television franchises
2000s American game shows
2002 American television series debuts
2003 American television series endings
Fox Broadcasting Company original programming
2000s American variety television series
English-language television shows
Television series by 20th Century Fox Television |
https://en.wikipedia.org/wiki/GameShark | GameShark is the brand name of a line of video game cheat cartridges and other products for a variety of console video game systems and Windows-based computers. Currently, the brand name is owned by Mad Catz, which marketed GameShark products for the Sony PlayStation, Xbox, and Nintendo game consoles. Players load cheat codes from GameShark discs or cartridges onto the console's internal or external memory, so that when the game is loaded, the selected cheats can be applied.
Products
When the original GameShark was released, it came with 4,000 preloaded codes. Codes could be entered, but unlike the Game Genie, codes were saved in the onboard flash memory and could be accessed later rather than having to be reentered. The cartridges also acted as memory cards, with equal or greater storage capacity to the consoles' first party memory cards. It was originally released for the Sega Saturn and Sony PlayStation consoles in January 1996. It was a runner-up for Electronic Gaming Monthlys Best Peripheral of 1996 (behind the Saturn analog controller). A GameShark was released for the Nintendo 64 in late August 1997. The Nintendo 64 GameShark also bypasses the console's regional lockout, allowing games from any region to be played on the same unit.
See also
Action Replay
Code Breaker
DexDrive
Game Genie
Multiface
MaxDrive
SharkWire Online
Xploder
Equalizer (Datel)
References
External links
GameShark.com
GSCentral.com
The GSHI
Computer peripherals
Unlicensed Nintendo hardware
Cheating in video games
Computer-related introductions in 1995 |
https://en.wikipedia.org/wiki/Remote%20direct%20memory%20access | In computing, remote direct memory access (RDMA) is a direct memory access from the memory of one computer into that of another without involving either one's operating system. This permits high-throughput, low-latency networking, which is especially useful in massively parallel computer clusters.
Overview
RDMA supports zero-copy networking by enabling the network adapter to transfer data from the wire directly to application memory or from application memory directly to the wire, eliminating the need to copy data between application memory and the data buffers in the operating system. Such transfers require no work to be done by CPUs, caches, or context switches, and transfers continue in parallel with other system operations. This reduces latency in message transfer.
However, this strategy presents several problems related to the fact that the target node is not notified of the completion of the request (single-sided communications).
Acceptance
As of 2018 RDMA had achieved broader acceptance as a result of implementation enhancements that enable good performance over ordinary networking infrastructure. For example RDMA over Converged Ethernet (RoCE) now is able to run over either lossy or lossless infrastructure. In addition iWARP enables an Ethernet RDMA implementation at the physical layer using TCP/IP as the transport, combining the performance and latency advantages of RDMA with a low-cost, standards-based solution. The RDMA Consortium and the DAT Collaborative have played key roles in the development of RDMA protocols and APIs for consideration by standards groups such as the Internet Engineering Task Force and the Interconnect Software Consortium.
Hardware vendors have started working on higher-capacity RDMA-based network adapters, with rates of 100 Gbit/s reported. Software vendors, such as IBM, Red Hat and Oracle Corporation, support these APIs in their latest products, and engineers have started developing network adapters that implement RDMA over Ethernet.
Both Red Hat Enterprise Linux and Red Hat Enterprise MRG have support for RDMA. Microsoft supports RDMA in Windows Server 2012 via SMB Direct. VMware's ESXi product also supports RDMA as of 2015.
Common RDMA implementations include the Virtual Interface Architecture, RDMA over Converged Ethernet (RoCE), InfiniBand, Omni-Path and iWARP.
Using RDMA
Applications access control structures using well-defined APIs originally designed for the InfiniBand Protocol (although the APIs can be used for any of the underlying RDMA implementations). Using send and completion queues, applications perform RDMA operations by submitting work queue entries (WQEs) into the submission queue (SQ) and getting notified of responses from the completion queue (CQ).
Transport Types
RDMA can transport data reliably or unreliably over the Reliably Connected (RC) and Unreliable Datagram (UD) transport protocols, respectively. The former has the benefit of preserving requests (no requests are lost), w |
https://en.wikipedia.org/wiki/RDMA | RDMA may refer to:
Remote direct memory access, in computing
Radio Disney Music Awards, an annual musical awards ceremony
Royal Dutch Medical Association, in the Netherlands |
https://en.wikipedia.org/wiki/BPB | BPB may refer to:
BPB plc (British Plaster Board), a British building materials business
Ballet Palm Beach, an American professional ballet company
BIOS parameter block, a computing data structure
Boridi Airport, Boridi, Papua New Guinea, IATA airport code BPB
Brighton Photo Biennial, a month-long British festival of photography
Bromophenol blue, a dye
Federal Agency for Civic Education (Bundeszentrale für politische Bildung, or bpb), a German government agency
Pasto language, ISO 639-3 code bpb |
https://en.wikipedia.org/wiki/BIOS%20parameter%20block | In computing, the BIOS parameter block, often shortened to BPB, is a data structure in the volume boot record (VBR) describing the physical layout of a data storage volume. On partitioned devices, such as hard disks, the BPB describes the volume partition, whereas, on unpartitioned devices, such as floppy disks, it describes the entire medium. A basic BPB can appear and be used on any partition, including floppy disks where its presence is often necessary; however, certain filesystems also make use of it in describing basic filesystem structures. Filesystems making use of a BIOS parameter block include FAT12 (except for in DOS 1.x), FAT16, FAT32, HPFS, and NTFS. Due to different types of fields and the amount of data they contain, the length of the BPB is different for FAT16, FAT32, and NTFS boot sectors. (A detailed discussion of the various FAT BPB versions and their entries can be found in the FAT article.) Combined with the 11-byte data structure at the very start of volume boot records immediately preceding the BPB or EBPB, this is also called FDC descriptor or extended FDC descriptor in ECMA-107 or ISO/IEC 9293 (which describes FAT as for flexible/floppy and optical disk cartridges).
FAT12 / FAT16
DOS 2.0 BPB
Format of standard DOS 2.0 BPB for FAT12 (13 bytes):
DOS 3.0 BPB
Format of standard DOS 3.0 BPB for FAT12 and FAT16 (19 bytes), already supported by some versions of MS-DOS 2.11:
DOS 3.2 BPB
Format of standard DOS 3.2 BPB for FAT12 and FAT16 (21 bytes):
DOS 3.31 BPB
Format of standard DOS 3.31 BPB for FAT12, FAT16 and FAT16B (25 bytes):
DOS 3.4 EBPB
Format of PC DOS 3.4 and OS/2 1.0-1.1 Extended BPB for FAT12, FAT16 and FAT16B (32 bytes):
FAT12 / FAT16 / HPFS
DOS 4.0 EBPB
Format of DOS 4.0 and OS/2 1.2 Extended BPB for FAT12, FAT16, FAT16B and HPFS (51 bytes):
FAT32
DOS 7.1 EBPB
Format of short DOS 7.1 Extended BIOS Parameter Block (60 bytes) for FAT32:
Format of full DOS 7.1 Extended BIOS Parameter Block (79 bytes) for FAT32:
NTFS
Format of Extended BPB for NTFS (73 bytes):
exFAT BPB
exFAT does not use a BPB in the classic sense. Nevertheless, the volume boot record in sector 0 is organized similarly to BPBs.
See also
BPB formats in the FAT file systems
MDBPB (Microsoft DoubleSpace BPB)
References
Further reading
— a description of BPBs, from version 2.0 to version 7.0
— In the "processing the BIOS parameter block" section the authors describe the evolution of the BIOS parameter block from the MS-DOS version 2.0 BPB to the PC DOS version 4.0 BPB, and label each field with the DOS version that introduced it.
— Figure 4.3 contains a diagram of the version 4.0 BPB and states that the layout of BPBs "is not defined by Microsoft and can vary with different vendors". At the time that the book was written, this was true. Microsoft first publicly documented the BPB structure in the OS/2 Developers' Toolkit.
— Verstak reverse engineers the BIOS parameter block. The paper contains several errors. One s |
https://en.wikipedia.org/wiki/FatWallet | FatWallet was a comparison shopping website, centering on a set of forums that allowed users to publish deals and rebate offers on products and services, with computer-related products and electronics most prominent in the listings. It was headquartered in Beloit, Wisconsin, and ceased operation on October 9, 2017.
Products and services
Coupons and Cash Back
FatWallet featured a "Coupons" section where users could find discounts from online retailers.
Before being acquired, FatWallet also featured its own "Cash Back" rebate shopping section, in which members received back a percentage of purchases made through referral links to partnered retailers. FatWallet has since ended the cash back program and now directs its members to the program offered by Rakuten.
Forums
FatWallet users posted the sale prices of major retailers, often before they were officially released in retailers' advertisements, which involved the site in a legal dispute in 2002 involving Black Friday advertisements. Several retailers, including Walmart, Target, Best Buy and Staples, have served FatWallet with "take-down" notices pursuant to the Digital Millennium Copyright Act, claiming that their sale prices were copyrighted and must be removed from the FatWallet site. In addition, Wal-Mart served FatWallet with a subpoena to reveal the identity of the users who had posted Wal-Mart's prices, but the demand was later dropped.
Although FatWallet initially complied with the take-down notices due to the fear of liability, within two weeks it reposted the prices and argued that the prices were facts rather than expression, and therefore not subject to copyright. FatWallet filed a lawsuit in the U.S. District Court for the Northern District of Illinois against three of the retailers, seeking damages for knowing assertion of invalid copyright claims and a declaratory judgment that the take-down provisions of the DMCA were unconstitutional. The case, FatWallet, Inc. v. Best Buy Enterprise Services, Inc., was dismissed. The court ruled that FatWallet lacked standing to sue for any harm done to its users for having their postings temporarily removed, and FatWallet did not assert any injury to itself that the court found cognizable.
Since its launch, FatWallet has expanded its forums to include discussion on other financial topics such as investments, banking and credit cards. The Finance forum has been mentioned in The Wall Street Journal and The New York Times referencing personal finance topics including on credit cards and 401K investment tips.
FatWallet launched "Best Deals" in 2009 (initially called "Today's Top Deals"), which features researched deals found on the internet by staff and members. Best Deals also features an "Expert Picks" section where staff research bigger ticket retail products like laptops, computers and HDTVs for the best value for the price, and post their endorsements each week.
Relocation
Between March and April 2011, FatWallet moved to Beloit, Wisconsi |
https://en.wikipedia.org/wiki/Komplett | Komplett AS is a Norwegian e-commerce company with nine webshops in 3 countries in Scandinavia. The main part of their product assortment is computers and components, but they have also expanded to include photographic, Hi-Fi, TV, gaming and white goods. The headquarters are located in Sandefjord, Norway where the company was founded. In addition to their Norwegian operations, Komplett also runs webshops in Sweden and Denmark, and distribution in Norway through the channels Norek and Itegra.
Komplett has three call centers for sales and support in Sandefjord, Norway and Gothenburg, Sweden.
Komplett has a distribution center and warehouses in Sandefjord, Norway. Company turnover in 2015, was 7.3 billion NOK with 800 employees and 1 800,000 active customers.
History
Awards
Komplett was awarded the Farmand Prize (awarded by Farmand Activum) for best website in 2007 and they won the Gulltaggen the same year in the category Interactive Advertiser of the Year 2007.
References
Computer companies of Norway
Wholesalers of Norway
Companies formerly listed on the Oslo Stock Exchange |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.