source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/Long-running%20transaction
|
Long-running transactions (also known as the saga interaction pattern) are computer database transactions that avoid locks on non-local resources, use compensation to handle failures, potentially aggregate smaller ACID transactions (also referred to as atomic transactions), and typically use a coordinator to complete or abort the transaction. In contrast to rollback in ACID transactions, compensation restores the original state, or an equivalent, and is business-specific. For example, the compensating action for making a hotel reservation is canceling that reservation.
The number of protocols have been specified for long-running transactions using Web services within business processes. OASIS Business Transaction Processing and WS-CAF are examples. These protocols use a coordinator to mediate the successful completion or use of compensation in a long-running transaction.
See also
Optimistic concurrency control
Long-lived transaction
References
Data management
Transaction processing
|
https://en.wikipedia.org/wiki/REN%20TV
|
REN TV () is a Russian free-to-air television network. It was founded on 1 January 1997 by Irena Lesnevskaya and her son, Dmitry Lesnevsky, who had been running REN TV as a production house for other national Russian television channels. Though it focuses mostly on audiences aged between 18 and 45 years old, the network offers programming for a wide range of demographics.
REN TV's network is a patchwork of 406 independent broadcasting companies in Russia and the CIS. REN TV's signal is received in 718 towns and cities in Russia - from Kaliningrad in the West to Yuzhno-Sakhalinsk in the East. It has a potential audience of 113.5 million viewers (officially 120 million viewers
with more than 12 million of them living in Moscow city and Moscow Oblast (Moscow Region). REN TV works with 10 broadcaster affiliates and 19 cable operators in the CIS and the Baltic states; 181 cities can receive REN TV's signal.
Ownership
Until 1 July 2005 the channel belonged to its founder Irena Lesnevskaya and her son (30%) and the Russian utility RAO UES headed by Anatoly Chubais. In 2005 Bertelsmann's RTL bought 30% of REN TV with steel maker Severstal and oil and natural gas company Surgutneftegaz each buying 35%.
Severstal's Alexey Germanovich on 18 December 2006 ceded the chairperson of REN TV's board to Lyubov Sovershaeva, President Vladimir Putin's former deputy envoy to the North-West federal okrug and chairperson of the board at ABRos Investments, a subsidiary of St Petersburg's Russia bank. ABRos had bought a considerable stake in REN. The bank, whose chairman, Yury Kovalchuk, was a close friend of President Vladimir Putin, owned 38% of its home town's TRK Petersburg TV channel – and was likely to buy more of that company, analysts had told 19 December 2006's Kommersant-daily. REN TV and TRK Petersburg would merge into a single media holding, though they would operate independently, industry observers had told the daily.
Russian media had reported that oil and gas group Surgutneftegaz had sold its stake in the channel to ABRos, which had increased its stake in the media company from 45% to 70%. '[T]here are indications that Bertelsmann was interested in selling up, after about 18 months in the Russian TV market,' the broadcasting news website added.
Currently National Media Group owns 82%, and Russian state oil company Gazprom subsidiary SOGAZ owns 18%.
Logos
News coverage
In November 2005 REN TV fired Olga Romanova, the anchor of its daily 24 news flagship. Despite much publicity around the incident, her independent manner of reporting was continued by Marianna Maksimovskaya, formerly an anchor and news presenter for Vladimir Gusinsky's NTV Station. Maksimovskaya was in charge of news broadcasts on REN TV until 2014, when she was fired. Due to her activities, the channel was arguably Russia's only major TV outlet with liberal views, discussing the problem of state censorship and showing interviews with leaders of the political fringe (including Othe
|
https://en.wikipedia.org/wiki/Oracle%20HTTP%20Server
|
Oracle HTTP Server (OHS) is a web server based on the Apache HTTP Server, created by the Oracle Technology Network. The web server is based on Apache version 2.2.13. OHS, like Apache 2.2, includes support for IPv6.
It is a Web Tier component of the Oracle Fusion Middleware.
Features:
SSL/TLS security
Virtual host
Proxy Server
Mod_PLSQL interface for executing PL/SQL stored procedures in an Oracle database
See also
Oracle Technology Network
Oracle Fusion Middleware
Oracle iPlanet Web Server
Oracle WebLogic Server
Oracle Application Server
GlassFish
Comparison of web server software
Comparison of application servers
References
External links
Oracle Site
Web server software
Oracle software
|
https://en.wikipedia.org/wiki/Petrol%20AD
|
Petrol AD () is a Bulgarian oil distribution company which maintains the largest network of filling stations in the country, consisting of more than 330 retail outlets, 80 petrol depots and three petrol port terminals. The company was established in April 1932, in the capital city of Sofia, and privatized in 1999. Currently Petrol AD is a joint stock company engaged in storage, transportation and retail of fuels and petrol products. Petrol AD has adopted a two-tier management system with a Management Board and a Supervisory Board.
History
Established in 1932, Petrol AD occupies a leading position in the distribution of fuels and oils in Bulgaria. With more than 330 petrol stations under the Petrol brand, evenly distributed throughout the country, the company has the most developed fuel distribution network in the country. Today the company is among the largest Bulgarian public companies by market capitalization. In 2003 the company received an award for issuer of the year, providing the most complete and accurate corporate information on the Bulgarian Stock Exchange.
Timeline
On April 1, 1932, the Bulgarian Joint Stock Company Petrol was established. Initially, the company used the warehouse of one of the shareholders, gradually investing and building new facilities.
In 1947 the Bulgarian oil industry was nationalized. On February 18, 1948, the Grand National Assembly passed a law on the state monopoly over petroleum products.
On March 9, 1948, on the basis of the existing private and joint-stock companies, the state supply company Petrol was established. The aim is to limit the enrichment of the former owners, and the purpose is to supply the national economy with the necessary oil derivatives through the branches in the country. It is gradually expanding its activities, gas stations and oil depots are being built throughout the country.
In 1986 the association was transformed into a Petrol plant, which was included in the structure of the Chimsnab Economic Association.
In 1990, on the basis of the new legislation, the plant was reorganized into the state company Petrol.
On July 1, 1992, a sole proprietorship joint-stock company Petrol with all state ownership was established. As a result of the mass privatization, about 25% of the company's shares become the property of privatization funds and industrial shareholders.
On June 10, 1997, Petrol Joint Stock Company was re-established.
On July 1, 1999, after nearly two years of privatization procedures, the sale of the majority stake was completed. Fifty-one percent of the state's shares were sold to Bulgaria International Consortium.
On August 4, 1999, the company was privatized by the consortium led by Naftex Bulgaria Holding AD and including OMV (Austria) and Petrol Holding Group AD. Subsequently, Naftex Bulgaria Holding AD increased its stake in Petrol AD by buying out the shares of the other participants in the consortium.
Activities
The main activities of Petrol AD are:
reta
|
https://en.wikipedia.org/wiki/Collaborative%20innovation%20network
|
Collaborative innovation is a process in which multiple players contribute towards creating new products with customers and suppliers.
Collaboration can occur in all aspects of the business cycle, depending on the context:
Procurement and supplier collaboration
Research and development of new products, services, and technologies
Marketing, distribution, and commercialization
Collaborative innovation network (CoIN) is a collaborative innovation practice that uses the internet platforms such as email, chat, social networks, blogs, and Wikis to promote communication and innovation within self-organizing virtual teams. The difference is that people collaborating in CoIN are so intrinsically motivated that they might not be paid nor get any advantage.
Thus, a CoIN is a social construct with massive innovation potential. The originator of the term has defined it, Peter Gloor from MIT Sloan's Center for Collective Intelligence, as "a cyber team of self-motivated people with a collective vision, enabled by the Web to collaborate in achieving a common goal by sharing ideas, information, and work".
Indeed, CoIN is a type of open collaboration that helps organizations to become more creative, productive, and efficient. By adopting CoIN as part of their culture, these companies accelerate innovation, uncover hidden business opportunities, reduce costs, and enhance synergies. They can engage employees from every level of the hierarchy towards a joint project (discovering new talents and promoting direct relations between employees) and partner with external parties.
Similar is the concept of the "Self-Organizing Innovation Network" author has described, Robert Rycroft of the Elliott School of International Affairs of George Washington University.
Overview
Coins feature internal transparency and direct communication. Members of a CoIN collaborate and share knowledge directly with each other rather than through hierarchies. They come together with a shared vision because they are intrinsically motivated to do so and seek to collaborate to advance an idea.
Coins work across hierarchies and boundaries where members can exchange ideas and information directly and openly. This collaborative and transparent environment fosters innovation. Gloor describes the phenomenon as "swarm creativity." He says, "CoINs are the best engines to drive innovation."
Coins existed well before the advent of modern communication technology. However, the internet and instant communication improved productivity and enabled the reach of a global scale. Today, they rely on Internet, e-mail, and other communications vehicles for information sharing.
According to Peter Gloor, CoINs have 5 main characteristics:
Dispersed Membership: technology allows members to be spread worldwide. Regardless of the location, members share a common goal and are convinced of their cause.
Interdependent Membership: cooperation between members is critical to achieving a common goal. The work of one
|
https://en.wikipedia.org/wiki/LMCS
|
LMCS may refer to:
Lockheed Martin Control Systems, the former name of the Platform Solutions division of BAE Systems Electronics, Intelligence & Support
Logical Methods in Computer Science, a scientific journal in theoretical computer science
IEEE 802, the LAN/MAN Standards Committee (LMCS)
See also
LMC (disambiguation)
|
https://en.wikipedia.org/wiki/Sequential%20pattern%20mining
|
Sequential pattern mining is a topic of data mining concerned with finding statistically relevant patterns between data examples where the values are delivered in a sequence. It is usually presumed that the values are discrete, and thus time series mining is closely related, but usually considered a different activity. Sequential pattern mining is a special case of structured data mining.
There are several key traditional computational problems addressed within this field. These include building efficient databases and indexes for sequence information, extracting the frequently occurring patterns, comparing sequences for similarity, and recovering missing sequence members. In general, sequence mining problems can be classified as string mining which is typically based on string processing algorithms and itemset mining which is typically based on association rule learning. Local process models extend sequential pattern mining to more complex patterns that can include (exclusive) choices, loops, and concurrency constructs in addition to the sequential ordering construct.
String mining
String mining typically deals with a limited alphabet for items that appear in a sequence, but the sequence itself may be typically very long. Examples of an alphabet can be those in the ASCII character set used in natural language text, nucleotide bases 'A', 'G', 'C' and 'T' in DNA sequences, or amino acids for protein sequences. In biology applications analysis of the arrangement of the alphabet in strings can be used to examine gene and protein sequences to determine their properties. Knowing the sequence of letters of a DNA or a protein is not an ultimate goal in itself. Rather, the major task is to understand the sequence, in terms of its structure and biological function. This is typically achieved first by identifying individual regions or structural units within each sequence and then assigning a function to each structural unit. In many cases this requires comparing a given sequence with previously studied ones. The comparison between the strings becomes complicated when insertions, deletions and mutations occur in a string.
A survey and taxonomy of the key algorithms for sequence comparison for bioinformatics is presented by Abouelhoda & Ghanem (2010), which include:
Repeat-related problems: that deal with operations on single sequences and can be based on exact string matching or approximate string matching methods for finding dispersed fixed length and maximal length repeats, finding tandem repeats, and finding unique subsequences and missing (un-spelled) subsequences.
Alignment problems: that deal with comparison between strings by first aligning one or more sequences; examples of popular methods include BLAST for comparing a single sequence with multiple sequences in a database, and ClustalW for multiple alignments. Alignment algorithms can be based on either exact or approximate methods, and can also be classified as global alignments, semi-
|
https://en.wikipedia.org/wiki/Announcement%20%28computing%29
|
An announcement (ANN) is a Usenet, mailing list or e-mail message sent to notify subscribers that a software project has made a new release version. Newsgroup announcement recipients often have a name like "comp.somegroup.announce". Mailing list announcement recipients often have a name like "toolname-announce". In an announcement, the subject line commonly contains the abbreviated prefix ANN: or [ANN].
The contents of an announcement usually contain a title line which contains the tool name, version, release name, and date. Additional contents often fall into the following message sections:
About: a short paragraph summary of the tool's purpose
Changes: a list of the highest impact changes since the last release (should be brief since the changelog comprises the definitive list)
Resources: links to project pages of interest, such as homepage, where to download, bug tracking system, etc.
Some additional, optional fields might include "Highlights", "Author(s)", "License", "Requirements", and "Release History".
Announcement messages are usually sent in plain text form.
Example
Example announcement message subject line:
ANN: fooutils 0.9.42 beta released
Example announcement message contents:
==============================================
Fooutils 0.9.42 Beta Released -- 2006 Feb 16
==============================================
ANNOUNCING Fooutils v0.2.12beta, the first beta release.
About Fooutils
--------------
Fooutils are a set of utilities that...
Changes
-------
Improved the searching facility by including...
Fixed bugs: #123, #456, ...
Resources
---------
Homepage:
http://fooutils.org
Documentation:
http://fooutils.org/docs
Download:
http://fooutils.org/download
Bug Tracker:
http://fooutils.org/newticket
Mailing Lists:
http://lists.fooutils.org/
See also
List of e-mail subject abbreviations
Further reading
Free software culture and documents
Technical communication
Usenet
|
https://en.wikipedia.org/wiki/Gainward
|
Gainward is a computer hardware company which has produced video cards since 1984. Taiwan-based TNC Industrial sold the company to Palit Microsystems in 2005, acquiring the Gainward brand and branch Gainward Europe GmbH for $1 million.
Product families
Their graphic cards used to be exclusively based on Nvidia chipsets; however, the company also announced ATI-based graphics solutions after the successful launch of ATI 4800-series hardware, although Gainward does not currently produce any cards from the ATI Radeon range.
Gainward traditionally offers overclockable graphic cards that deviate from the reference specifications set forth by Nvidia, such as their Golden Sample range of graphics cards. These cards are overclocked past their stock speeds and tested before they are sold, to ensure quality for customers. Gainward have had success with their Phantom series of graphic cards, featuring removable fans.
References
External links
1984 establishments in Taiwan
Electronics companies established in 1984
Graphics hardware companies
Electronics companies of Taiwan
Taiwanese brands
2005 mergers and acquisitions
|
https://en.wikipedia.org/wiki/WQMY
|
WQMY (channel 53) is a television station licensed to Williamsport, Pennsylvania, United States, serving Northeastern Pennsylvania as an affiliate of MyNetworkTV. It is owned by locally based New Age Media, LLC, alongside Hazleton-licensed Fox affiliate and company flagship WOLF-TV (channel 56); New Age also provides certain services to Scranton-licensed CW affiliate WSWB (channel 38) under a local marketing agreement (LMA) with MPS Media. All three stations, in turn, are operated under a master service agreement by the Sinclair Broadcast Group. The stations share studios on PA 315 in the Fox Hill section of Plains Township; WQMY's transmitter is located on Bald Eagle Mountain. However, newscasts have originated from the facilities of sister station and CBS affiliate WSBT-TV in South Bend, Indiana since January 2017. There is no separate website for WQMY; instead, it is integrated with that of sister station WOLF-TV.
Although WQMY transmits a digital signal of its own, it does not reach the two major cities in the market, Scranton and Wilkes-Barre. Therefore, the station is simulcast on WOLF-TV's third digital subchannel (56.3) from its transmitter on Penobscot Knob near Mountain Top.
History
As a WOLF satellite
On December 30, 1988, the station signed on an analog signal on UHF channel 53. It was the second full-time satellite of Fox affiliate WOLF-TV (then on analog UHF channel 38) owned by Scranton TV Partners. Using the call letters WDZA, in which they changed to WILF in 1990, this station was established to improve coverage of its parent station in the northern and western parts of the Scranton/Wilkes-Barre market and serve portions of the Pennsylvania side of the adjacent Binghamton and Elmira markets, which themselves would not receive local Fox affiliates until April 1996 and mid-1997. On November 1, 1998, then-owner Pegasus Television changed channel 38's call letters to the current WSWB and made it the area's second WB affiliate after low-powered WYLN-LP in Hazleton dropped the network. Fox programming remained on channel 38's former satellite, WWLF in Hazleton, which picked up the WOLF-TV calls. WILF remained as a repeater of WSWB. WSWB/WILF also picked up UPN as a secondary affiliation. Select programming from the network aired on Saturday nights (since The WB did not offer programs then) without the branding. For the last three years of its affiliation with UPN, the station aired America's Next Top Model in the 8 p.m. timeslot, followed at 9 p.m. by WWE Friday Night SmackDown. Whenever Top Model was in repeats, it would air Veronica Mars instead. All UPN programming in pattern was available on cable via superstation WWOR-TV from New York City (which served Pike County, which is part of the New York DMA) or WPSG from Philadelphia (which served Lehigh and Northampton counties, which are part of the Philadelphia DMA); cable systems in some areas carried WLYH-TV from Harrisburg instead.
Pegasus declared bankruptcy in June 2004 over a
|
https://en.wikipedia.org/wiki/Trams%20in%20Germany
|
Germany has an extensive number of tramway networks (Straßenbahn in German). Some of these networks have been upgraded to light rail standards, called Stadtbahn in German. Straßenbahn and Stadtbahn schemes are usually operated on the legal foundation of the BOStrab, the Tramways Act of Germany.
Tramways served as the primary means of urban transport in Germany until the early 1960s when they were systematically replaced by buses. However, in the 1980s tramways began to reappear; experts spoke of the 'renaissance of the tramway'. In the 1990s tramways had again become a modern means of public transport. Popular notions of fashion have been used by scholars to explain this cycle of acceptance rejection and restoration. Tramways were a highly visible manifestation of commodity culture and people projected onto them not just travel destinations but more broadly their desires, ideas and beliefs.
Stadtbahn
The Stadtbahn is a concept dating back as far as the late 1940s, when city councils were considering Unterpflasterstraßenbahn (lit. below-pavement tramways) as part of rebuilding the city centres devastated by World War II. Some cities, like Hanover, reserved extra wide medians in their city's ring roads, though in most cities these plans never made it past the planning stage. However, seeing the success of the Berlin and Hamburg U-Bahn systems, cities started considering such schemes again in the 1960s and 1970s. Munich and Nuremberg decided to fully abolish their trams and started constructing a full-scale U-Bahn system (although to date, neither of these has abolished their tram system and likely never will - both are in fact re-expanding their tram systems) whilst other cities, like Hanover or Stuttgart, went for a scheme of city centre tunnels and special right-of-way arrangements with the prospect of converting their tramway networks to a full-fledged U-Bahn over several decades. By the 1980s, however, virtually all cities had abolished these plans due to the high costs involved with converting the tramways, and the most common Stadtbahn systems now are a mixture of tramway-like operations in suburban and peripheral areas, and a more U-Bahn like mode of operation, featuring tunnel stations, in the city centres.
The Stadtbahn scheme is not to be confused with the S-Bahn, which commonly is a suburban railway operating under the Railways Act, while the Stadtbahn typically is an urban railway operating under the Tramways Act.
Cities and towns with tramway networks
Augsburg
Bad Schandau
Berlin
Bielefeld (Stadtbahn)
Bochum (Stadtbahn and Tram)
Bonn (Stadtbahn)
Brandenburg an der Havel
Bremen
Braunschweig
Chemnitz
Cologne (Stadtbahn)
Cottbus
Darmstadt
Dresden
Dortmund (Stadtbahn)
Duisburg (Stadtbahn and Tram)
Düsseldorf (Stadtbahn and Tram)
Erfurt
Essen (Stadtbahn and Tram)
Frankfurt am Main (Stadtbahn and Tram)
Frankfurt (Oder)
Freiburg im Breisgau
Gelsenkirchen
Gera
Görlitz
Gotha
Halberstadt
Halle (Saale)
Hanover (Stadtbahn)
Hattingen
Hei
|
https://en.wikipedia.org/wiki/IMS%20Associates%2C%20Inc.
|
IMS Associates, Inc., or IMSAI, was a microcomputer company, responsible for one of the earliest successes in personal computing, the IMSAI 8080. The company was founded in 1973 by William Millard and was based in San Leandro, California. Their first product launch was the IMSAI 8080 in 1975. One of the company's subsidiaries was ComputerLand. IMS stood for "Information Management Sciences".
IMS Associates required all executives and key employees to take the EST Standard Training. Forbes considered Millard's requirements - which placed a heavy emphasis on self-actualization and encouraged vast discrepancies between executives and staff - were a key contributor to the downfall of the company, and Paul Freiberger and Michael Swaine concurred in Fire in the Valley: The Making of The Personal Computer, noting that Millard's EST-induced unwillingness to admit a task might be impossible was a key factor in IMSAI's demise.
History
Consultancy
In May 1972, William Millard began business individually as IMS Associates (IMS) in the area of computer consultancy and engineering, using his home as an office. The work done by IMS was similar to that Millard had done previously for the city and county of San Francisco. By 1973, Millard founded IMS Associates, Inc. Millard soon found capital for his business, and received several contracts, all for software. IMS provided advanced engineering and software management to mainframe users, including business and the United States Government.
IMSAI 8080
In 1974, IMS was contacted by a client which wanted a "workstation system" that could complete jobs for any General Motors new-car dealership. IMS planned a system including a terminal, small computer, printer, and special software. Five of these work stations were to have common access to a hard disk, which would be controlled by a small computer. Eventually, product development was stopped. Millard and his chief engineer Joe Killian turned to the microprocessor.
Intel had announced the 8080 chip, and compared to the 4004 to which IMS Associates had been first introduced, the 8080 looked like a "real computer". Full-scale development of the IMSAI 8080 was put into action, and by October 1975 an ad was placed in Popular Electronics, receiving positive reactions. IMS shipped the first IMSAI 8080 kits on 16 December 1975 and shortly after turned to fully assembled units. Between 17,000 and 20,000 units were eventually produced, with an additional 2500 produced under the Fischer-Freitas name thereafter.
Transition
In 1976, as IMS had completed its transition from a consultancy firm into a manufacturing firm, the name of the company was changed to IMSAI Manufacturing Corporation.
ComputerLand
The release of the Z80 by Zilog in 1976 quickly put an end to the dominance of 8080 machines as the new chip had an improved instruction set, could be clocked at faster speeds, and had on-chip DRAM refresh. IMSAI sales quickly plummeted and so in 1977 Millard decided
|
https://en.wikipedia.org/wiki/Monsoon%20%28speakers%29
|
Monsoon is a brand of loudspeakers, originally automotive speaker systems and later computer speakers. Monsoon was originally associated with OEM-sourced automotive audio speaker systems, notably supplied on a number of General Motors products and then later expanded onto other manufacturers such as Volkswagen. The brand name was also licensed to Sonigistix, a Richmond, B.C., Canada company, and applied to their line of computer multimedia speakers.
Sonigistix
Sonigistix started out as a project out of the UBC Electrical Engineering company and existed for two years on the UBC campus. Its founder was Brent Bolleman and its first raison d'être was to refine and market an electrostatic computer product based on the design of Quad Electrostatics. Electrostatic speakers have their own problems due to the need for the membrane requiring high voltage, which is dangerous and has the requirement of a step up transformer, which is costly. The ultimate desire was to have a speaker that looked great and sounded great, so the conversion to planar magnetic design, which had problems of its own but easier dealt with, most notably was the need for rare earth magnets, which were expensive. Much of the focus of the transition focused on how to reduce this cost element and make the speakers more appealing to a larger pool of consumers. The early unnamed company started sending out prototypes to United Technologies. Through this the company made contacts with Woody Jackson, a high end audio products expert based in Little Rock Arkansas, and Dave Clark an audio engineer who had ties to Delphi based in Detroit. Clark designed the subwoofer part of the package. Another challenge as the planar magnetic design had a bottom end of 100 Hz and it was key to make the crossover design seamless.
By 2000, Sonigistix expanded its product line and the Monsoon brand into the then burgeoning consumer computer multimedia market, developing a solid reputation for their flat-panel speaker designs that were popular with computer users keen on obtaining quality high fidelity from their computer hardware. Monsoon's speaker designs were based on planar magnetic technology, licensed from Eminent Technology who developed the original concept. However, despite the brand's popularity among computer users – or perhaps because of it – within the next couple of years the assets of Sonigistix were purchased by Eastech, an Asian technology company that also focuses on providing consumer products in a variety of audio-based markets.
As for Sonigistix, a privately held company by that name currently resides in Little Rock, Arkansas, U.S.A. An online company profile on goliath.ecnext.com lists this Little Rock company, being Woody Jackson as being in the home audio/video industry. An owner's manual for the MM-700/iM-700 Flat Panel Audio System with a copyright of 2000 shows the Monsoon Multimedia Sales office address as Little Rock, Arkansas.
Eastech
Monsoon-branded products continued for a t
|
https://en.wikipedia.org/wiki/KFX
|
KFX may refer to:
Computing
KFX (program), the kernel language of FX-87, a polymorphic typed functional language
Kameleon FireEx KFX, a computational fluid dynamics simulation program focusing on gas dispersion and fire simulation.
.kfx, a proprietary ebook format for the Amazon Kindle
Kofax (stock ticker: KFX), process automation software provider
Other uses
Kullui (ISO 639 language code: kfx)
KAI KF-X, a South Korean project for development of an indigenous fighter aircraft
KFX, a series of ATVs, see List of Kawasaki motorcycles
OMX Copenhagen 20, a stock market index for the Copenhagen Stock Exchange, formerly known as KFX
See also
KFXS radio station
KF (disambiguation)
|
https://en.wikipedia.org/wiki/NETD
|
NETD, NetD or netd can refer to:
Negative electron-transfer dissociation
Noise equivalent temperature difference
NetDetector from Niksun
Network device (NetD)
netd.com a VOD service in Turkey by Doğan Media Group
|
https://en.wikipedia.org/wiki/Wank
|
Wank may refer to:
WANK (computer worm), a computer worm that attacked DEC VAX/VMS systems through DECnet in 1989
WXTY, a radio station (99.9 FM) licensed to serve Lafayette, Florida, United States, which held the call sign WANK from 2010 to 2018
Wank (mountain), a German mountain close to the Austrian border
Male masturbation, in British slang
Wank (surname), a surname
See also
Wanka (disambiguation)
Wankel (surname)
Wanker (disambiguation)
|
https://en.wikipedia.org/wiki/Google%20Data%20Protocol
|
GData (Google Data Protocol) provides a simple protocol for reading and writing data on the Internet, designed by Google. GData combines common XML-based syndication formats (Atom and RSS) with a feed-publishing system based on the Atom Publishing Protocol, plus some extensions for handling queries. It relies on XML or JSON as a data format.
According to the Google Developers portal, "The Google Data Protocol is a REST-inspired technology for reading, writing, and modifying information on the web. It is used in some older Google APIs." However, "Most Google APIs are not Google Data APIs."
Google provides GData client libraries for Java, JavaScript, .NET, PHP, Python, and Objective-C.
Implementations
An implementation called libgdata written in C is available under the LGPL license.
See also
Open Data Protocol (OData) – competing protocol from Microsoft
GData API Directory
Resource Description Framework (RDF) – a similar concept by W3C
References
External links
Google Data APIs - Google Developers
Learning from THE WEB by Adam Bosworth - the vision behind GData
Atom (Web standard)
Data Protocol
Web syndication formats
|
https://en.wikipedia.org/wiki/Take-grant%20protection%20model
|
The take-grant protection model is a formal model used in the field of computer security to establish or disprove the safety of a given computer system that follows specific rules. It shows that even though the question of safety is in general undecidable, for specific systems it is decidable in linear time.
The model represents a system as directed graph, where vertices are either subjects or objects. The edges between them are labeled, and the label indicates the rights that the source of the edge has over the destination. Two rights occur in every instance of the model: take and grant. They play a special role in the graph rewriting rules describing admissible changes of the graph.
There are a total of four such rules:
take rule allows a subject to take rights of another object (add an edge originating at the subject)
grant rule allows a subject to grant own rights to another object (add an edge terminating at the subject)
create rule allows a subject to create new objects (add a vertex and an edge from the subject to the new vertex)
remove rule allows a subject to remove rights it has over on another object (remove an edge originating at the subject)
Preconditions for :
subject s has the right Take for o.
object o has the right r on p.
Preconditions for :
subject s has the right Grant for o.
s has the right r on p.
Using the rules of the take-grant protection model, one can reproduce in which states a system can change, with respect to the distribution of rights. Therefore, one can show if rights can leak with respect to a given safety model.
References
External links
Diagram and sample problem
Analysis
Technical Report PCS-TR90-151 (NASA)
Computer security models
|
https://en.wikipedia.org/wiki/Versant
|
The Versant suite of tests are computerized tests of spoken language available from Pearson PLC. Versant tests were the first fully automated tests of spoken language to use advanced speech processing technology (including speech recognition) to assess the spoken language skills of non-native speakers. The Versant language suite includes tests of English, Spanish, Dutch, French, and Arabic. Versant technology has also been applied to the assessment of Aviation English, children's oral reading assessment, and adult literacy assessment.
History
In 1996, Jared Bernstein and Brent Townsend founded Ordinate Corporation to develop a system that would use speech processing technology and linguistic and test theory to provide an automatically delivered and automatically scored spoken language test. The first English test was called PhonePass. It was the first fully computerized test of spoken language using speech recognition technology. In 2002, the name PhonePass was changed to PhonePass SET-10 (Spoken English Test) or simply SET-10. In 2003 Ordinate was acquired by Harcourt Assessment and later in 2005 the name of the test changed to its current name, Versant. In January 2008, Harcourt Assessment (including Ordinate Corporation) was acquired by Pearson and Ordinate Corporation became part of the Knowledge Technologies group of Pearson. In June 2010, Versant Pro Speaking Test and Versant Pro Writing Test, were launched.
Product description
Versant tests are typically fifteen-minute tests of speaking and listening skills for adult language learners. (Test length varies slightly depending on the test). The test is delivered over the telephone or on a computer and is scored by computer using pre-determined data-driven algorithms. During the test, the system presents a series of recorded prompts at a conversational pace and elicits oral responses from the test-taker. The Versant tests are available as several products:
Versant English Test
Versant English - Placement Test
Versant English - Writing Test
Versant Spanish Test
Versant Arabic Test
Versant French Test
Versant Aviation English
Additionally, several domain-specific tests have been created using the Versant framework in collaboration with other organizations. These tests include the Versant Aviation English Test (for aviation personnel), the Versant Junior English Test (for learners of English, ages 5 to 12), and the Dutch immigration test (exclusively available through Dutch Embassies). The Versant scoring system also provides automated scoring of the spoken portion of the four-skills test, Pearson Test of English, available in late 2009.
Versant test construct
Versant tests measure "facility in a spoken language", defined as the ability to understand spoken language on everyday topics and to respond appropriately at a native-like conversational pace. While keeping up with the conversational pace, a person has to track what is being said, extract meaning as speech continues, and formulate and
|
https://en.wikipedia.org/wiki/Big%20Brother%20%28Australian%20season%201%29
|
Big Brother 2001, also known as Big Brother 1, was the first season of the Australian reality television series Big Brother. It is based upon the Dutch series of the same name, it premiered on Network Ten on 23 April 2001 and lasted twelve weeks until the live finale on 16 July 2001. Big Brother 1 proved to be an early ratings success. In total, the season averaged 1.4 million viewers, thus making it the fourth highest rated season to date. This season aired for a total of 85 days, with evictions occurring once every week beginning with the second week. In total, fourteen Housemates competed in Big Brother 1. The original twelve entered on the first night, with two intruders entering at a later date. Ultimately, Housemate Ben Williams was later announced as the winner of the series, with Blair McDonough becoming the Runner-Up.
The premise of the show remained largely unchanged from other installments of the series. Big Brother revolves around ten strangers living in a house together with no communication with the outside world. They are filmed constantly during their time in the house, and can have no communication with those filming them. Each week, each contestant, referred to as "Housemates", choose two people to be up for nomination. The three (or more) people with the most votes will be nominated to leave the house. The viewers then decide which of the nominees should leave, with the selected person leaving during a live show. This process continued until only three Housemates remained, in which the viewers would decide which of the Housemates would win the grand prize. A Housemate can be ejected from the show for breaking rules, such as discussing nominations when not permitted.
The Finale was watched by 2.789 million Australian viewers.
Production
Broadcast
Shortly before the premiere of the season, a special entitled Big Brother Revealed aired, featuring information on the casting process and the development of the house. The series held a live launch on 23 April 2001. The contestants were recorded 24 hours a day with cameras fixed around the house, and had to wear portable microphones. Each night, Network Ten broadcast a daily highlights show, and from the second week there was a live eviction show hosted by Gretel Killeen, where the evicted Housemate was interviewed. The nominations aired during the daily highlights show during this season, making it the only season to not feature a live nominations special. This season also aired alongside the Big Brother Saturday spin-off series. This was an hour-long special that aired on Saturday evenings, with Gretel Killeen presenting an overview of press discussions of the series that week. The series also featured interviews with fans, which were conducted by reporter Sami Lukis. News about the previously evicted Housemates was also featured on this special. Big Brother Saturday was not featured in any subsequent seasons. The season concluded on 16 July 2001, lasting for a total of 85 days.
|
https://en.wikipedia.org/wiki/Big%20Brother%20%28Australian%20season%204%29
|
Big Brother 2004, also known as Big Brother 4, was the fourth season of the Australian reality television series Big Brother, and was aired on Network Ten, starting on Sunday 2 May 2004, with the housemates entering the day before, and ended on Monday 26 July 2004, lasting 86 days. The season was billed as "back to basics, but with one small secret". In a return to the basic format of Big Brother 1 and Big Brother 2 that had been eschewed in favour of twists and surprises in Big Brother 3, all housemates were let into the house together and former surprise elements such as swimming pools and gym equipment were all exposed from the beginning.
The only main twist of the series was the prize money - which was raised from $250,000 to $1,000,000, but this was kept hidden from housemates until later in the season. Evicted housemates also received larger prizes than any season before, with every evictee receiving a top of the range Mitsubishi Lancer VR-X.
Two Intruders entered the house later in the game, and Miriam Rivera, the transgender star of the show There's Something About Miriam, entered as a houseguest near the end. The two Intruders were some of the least liked in all the four seasons, with Violeta being chosen for eviction by every single housemate, and then Monica, who already had a boyfriend outside, immediately started falling for Ryan, and she and Bree developed rivalry towards each other. When Monica was finally up for eviction, she was evicted with a large percentage of the votes. Mid-season, the housemates were able to see the unofficial premiere of The Day After Tomorrow.
The final contestants in 2004 were Bree Amer and Trevor Butler. Trevor won, and then proposed to his girlfriend on stage. The winner announced of the finale was watched by 2.864 million Australian viewers.
Opening sequence
The opening sequence was similar to the 2003 opening sequence with some minor sound changes. The background colour is more gradient than the previous season. A scene of a green backyard appears between the diary room and kitchen scenes. The diary room chair is orange instead of red, and the evicted housemate in the titles was changed to blue. Lastly the 84 days was changed to the series 86 days.
The theme also was slightly remixed with the introduction of a guitar component.
Housemates
Nominations Table
The first Housemate in each box was Nominated for Two Points, and the second Housemate was Nominated for One Point.
Notes
The two Intruders faced the Housemate Vote, in which the Housemates would decide which one of them should go home. The Housemates unanimously chose to evict Violeta.
All Housemates were nominated by Big Brother after failing to give reasonable nomination reasons. Had this not happened, Ashalea, Ryan, and Paul would have faced the public vote. Monica, as a new Housemate, was immune from eviction.
On Day 65, Bree was incorrectly announced as the week's evictee. Bree later returned to the House, and the correct evictee,
|
https://en.wikipedia.org/wiki/Big%20Brother%20%28Australian%20season%205%29
|
Big Brother Australia 2005, also known as Big Brother 5, was the fifth season of the Australian reality television series Big Brother, and was aired on Network Ten in Australia, and TV-2 in New Zealand with a four-week delay. The series started on 8 May 2005, with housemates going into the House the day before, and finished on 15 August 2005, lasting 101 days. The theme for this season was "single, sexy and competitive". Auditions for housemates were held in March 2005. In a departure from usual procedure, candidates were not required to send in videos of themselves as had been the case for prior auditions. Instead, the producers toured major Australian cities and conducted interviews. They searched for sexy singles that were willing to have sexual relations on camera. Promos for the show suggested that Big Brother would be different this year, and phrases such as "Assume Nothing, Expect Anything", "Let's Play" and "Think Again" were used throughout the series, especially during Opening Night. The winner announced on the finale that was watched by 2.282 million Australian viewers.
Changes and additions
Fines
On Opening Night, it was revealed that A$5,000 would be subtracted from the $1 million prize money every time the housemates broke a rule. Such rules included discussing nominations, which must remain secret, not giving adequate reasons for nominating, and forgetting to wear microphones at all times. Michelle was known for being the housemate to get the most such fines—$60,000. Geneva had the least amount of fines $15,000, two in the early days at the house and one near the end of her eviction.
The Logans
It was revealed that twins would be entering the House, regularly changing places without the other housemates knowing—this was a twist first used on the fifth American series of Big Brother. Greg and David entered the House as a single person named Logan (their shared middle name). Their task was to remain undetected for two weeks while swapping places at Big Brother's command. The secret of the twins was discovered one week into the series by housemate Glenn, and this was revealed during Lies Exposed.
As a result, both Logans were able to continue living in the House, but would be treated as a single person in matters such as evictions and nominations. Late in the series a special eviction was held where one twin was evicted based on the votes of the other housemates, and the remaining twin allowed to continue in the House as a normal housemate. During this eviction process, David was evicted. However, because Greg was the last housemate to be evicted, both David and Greg shared the prize equally.
Housemates
Friday Night Live themes and winners
Nominations table
Notes
: As punishment for lying during the audition process, Constance, Dean, and Nelson were fake evicted and sent to the Holding Room. Believed to have been evicted, they could not be nominated by their housemates. On Day 9, they were informed that all three of them
|
https://en.wikipedia.org/wiki/Game%20Oriented%20Assembly%20Lisp
|
Game Oriented Assembly Lisp (GOAL, also known as Game Object Assembly Lisp) is a programming language, a dialect of the language Lisp, made for video games developed by Andy Gavin and the Jak and Daxter team at the company Naughty Dog.
It was written using Allegro Common Lisp and used in the development of the entire Jak and Daxter series of games.
Design
GOAL's syntax resembles the Lisp dialect Scheme, though with many idiosyncratic object-oriented programming features such as classes, inheritance, and virtual functions. GOAL encourages an imperative programming style: programs tend to consist of a sequence of events to be executed rather than the functional programming style of functions to be evaluated recursively. This is a diversion from Scheme, which allows such side effects but does not encourage imperative style.
GOAL does not run in an interpreter, but instead is compiled directly into PlayStation 2 machine code to execute. It offers limited facilities for garbage collection, relying extensively on runtime support. It offers dynamic memory allocation primitives designed to make it well-suited to running in constant memory on a video game console. GOAL has extensive support for inlined assembly language code using a special rlet form, allowing programs to freely mix assembly and higher-level constructs within one function.
The GOAL compiler is implemented in Allegro Common Lisp. It supports a long term compiling listener session which gives the compiler knowledge about the state of the compiled and thus running program, including the symbol table. This, in addition to dynamic linking, allows a function to be edited, recompiled, uploaded, and inserted into a running game without having to restart. The process is similar to the edit and continue feature offered by some C++ compilers, but allows programs to replace arbitrary amounts of code (even up to entire object files), and does not interrupt the running game with the debugger. This feature was used to implement code and to enable level streaming in the Jak and Daxter games.
Uses
GOAL's first use was for the Jak and Daxter: The Precursor Legacy game. The predecessor language, Game Oriented Object Lisp (GOOL), was also developed by Andy Gavin for Crash Bandicoot.
Since Naughty Dog no longer employs GOAL's primary development and maintenance engineer, and they were under pressure from their new parent company, Sony, to share technology between studios, Naughty Dog transitioned away from Lisp:
However, they have since resumed using it for scripting on some PlayStation 3 games, including The Last of Us.
OpenGOAL
A community project, OpenGOAL, started in 2020 with the goal of porting GOAL to X86-64 by decompiling existing Jak and Daxter: The Precursor Legacy and Jak II assets and recompiling them natively. It includes a GOAL compiler written in C++ as well as a Read–eval–print loop to enable a similar workflow to Naughty Dog's original implementation.
References
External links
|
https://en.wikipedia.org/wiki/Allegro%20Common%20Lisp
|
Allegro Common Lisp is a programming language with an integrated development environment (IDE), developed by Franz Inc. It is a dialect of the language Lisp, a commercial software implementation of the language Common Lisp. Allegro CL provides the full American National Standards Institute (ANSI) Common Lisp standard with many extensions, including threads, CLOS streams, CLOS MOP, Unicode, SSL streams, implementations of various Internet protocols, OpenGL interface. The first version of Allegro Common Lisp was finished at the end of 1986, originally called Extended Common Lisp. Allegro CL is available for many operating systems including Microsoft Windows (32/64-bit), and many Unix and Unix-like, 32-bit or 64-bit, including macOS (Intel, 32/64-bit), Linux (32/64-bit), FreeBSD (32-bit), Solaris (x64, SPARC; 32/64-bit), UNICOS, and UTS. Internationalization and localization support is based on Unicode. It supports various external text encodings and provides string and character types based on Universal Coded Character Set 2 (UCS-2). Allegro CL can be used with and without its integrated development environment (IDE), which is available for Windows, Linux, and on macOS in version 8.2. The IDE (written in Allegro CL) includes development tools including an editor and an interface designer. Allegro CL can be used to deliver applications.
Allegro CL is available as freeware, a Free Express Edition (with some limits like a constrained heap space) for non-commercial use. Customers can get access to much of the source code of Allegro CL.
Allegro CL includes an implementation of Prolog and an object caching database called AllegroCache.
The most recent release, Allegro CL 10.1, supports Symmetric Multiprocessing.
Allegro CL has been used to implement various applications:
Naughty Dog used it for the development of various video games, implementing the development environments for Game Oriented Object Lisp and Game Oriented Assembly Lisp
Allegro CL has been used to implement scheduling systems for various telescopes including the Hubble Space Telescope and the Spitzer Space Telescope
See also
LispWorks
References
External links
Common Lisp implementations
Common Lisp (programming language) software
Functional languages
Object-oriented programming languages
|
https://en.wikipedia.org/wiki/Semidefinite%20programming
|
Semidefinite programming (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function (a user-specified function that the user wants to minimize or maximize)
over the intersection of the cone of positive semidefinite matrices with an affine space, i.e., a spectrahedron.
Semidefinite programming is a relatively new field of optimization which is of growing interest for several reasons. Many practical problems in operations research and combinatorial optimization can be modeled or approximated as semidefinite programming problems. In automatic control theory, SDPs are used in the context of linear matrix inequalities. SDPs are in fact a special case of cone programming and can be efficiently solved by interior point methods.
All linear programs and (convex) quadratic programs can be expressed as SDPs, and via hierarchies of SDPs the solutions of polynomial optimization problems can be approximated. Semidefinite programming has been used in the optimization of complex systems. In recent years, some quantum query complexity problems have been formulated in terms of semidefinite programs.
Motivation and definition
Initial motivation
A linear programming problem is one in which we wish to maximize or minimize a linear objective function of real variables over a polytope. In semidefinite programming, we instead use real-valued vectors and are allowed to take the dot product of vectors; nonnegativity constraints on real variables in LP (linear programming) are replaced by semidefiniteness constraints on matrix variables in SDP (semidefinite programming). Specifically, a general semidefinite programming problem can be defined as any mathematical programming problem of the form
where the , and the are real numbers and is the dot product of and .
Equivalent formulations
An matrix is said to be positive semidefinite if it is the Gram matrix of some vectors (i.e. if there exist vectors such that for all ). If this is the case, we denote this as . Note that there are several other equivalent definitions of being positive semidefinite, for example, positive semidefinite matrices are self-adjoint matrices that have only non-negative eigenvalues.
Denote by the space of all real symmetric matrices. The space is equipped with the inner product (where denotes the trace)
We can rewrite the mathematical program given in the previous section equivalently as
where entry in is given by from the previous section and is a symmetric matrix having th entry from the previous section. Thus, the matrices and are symmetric and the above inner products are well-defined.
Note that if we add slack variables appropriately, this SDP can be converted to one of the form
For convenience, an SDP may be specified in a slightly different, but equivalent form. For example, linear expressions involving nonnegative scalar variables may be added to the program specification. This remains an SDP because each va
|
https://en.wikipedia.org/wiki/Symbolic%20Sound%20Corporation
|
Symbolic Sound Corporation was founded by Carla Scaletti and Kurt J. Hebel in 1989 as a spinoff of the CERL Sound Group at the Computer-based Education Research Laboratory of the University of Illinois at Urbana–Champaign. Originally named Kymatics, the company was incorporated as Symbolic Sound Corporation in March 1990. Symbolic Sound's products are being used in sound design for music, film, advertising, television, speech and hearing research, computer games, and other virtual environments. The company is based in Bozeman, Montana.
Kyma, Symbolic Sound's main product, was one of the earliest commercially available examples of a graphical signal flow language for real time digital audio signal processing. The Kyma Sound design language, based on Smalltalk, continues to evolve and runs on several generations of DSP processing units.
The company has developed and commercialized several audio processing and synthesis techniques, including real time spectral analysis and additive resynthesis, audio morphing, aggregate synthesis, granular synthesis, and Tau synthesis. They have also developed algorithms for partitioning a signal flow graph to run on multiple parallel processors and multiple devices in real time.
External links
Symbolic Sound Corporation
References
Music equipment manufacturers
Acoustics software
Computer-based Education Research Laboratory
American companies established in 1989
Companies based in Montana
|
https://en.wikipedia.org/wiki/Vehicle%20register
|
The Vehicle register in the United Kingdom is a database of motor vehicles. It is a legal requirement in the UK for most types of motor vehicle to be registered if they are to be used on the public road.
All new and imported vehicles are required to be entered onto the register, which is administered by the Driver and Vehicle Licensing Agency (DVLA) in Great Britain and by Driver & Vehicle Agency (DVA) in Northern Ireland.
Registered vehicles are not provided with tax certificates anymore in the United Kingdom.
On the register, along with the vehicle details (make, model, engine capacity, colour, VIN, etc.) are recorded the details of the current keeper of the vehicle (name, address). The current keeper is issued with a registration document known as a V5C, which displays the registration details of the vehicle. Each time any of the registration details change, if the vehicle keeper is changed, or any of the vehicle details are changed, for example, the DVLA/DVLNI has to be notified, and a new document is issued.
A vehicle first registration fee has to be paid to enter a vehicle onto the register for the first time.
Database uses
The database is available to the law enforcement authorities for activities such as:
Vehicle legality checks such as: current safety certification, motor insurance and vehicle licence
Police traffic law enforcement
Automated camera enforcement of certain traffic laws
Details from the database are also available, for £2.50, to anyone having a good reason to require them. Between 2004 and 2009 the service sold more than 18 million names and addresses charging £44 million. The DVLA stated that they did not make a profit from the service. Commercial vehicle check companies incorporate database details Car check for consumer protection and anti-fraud purposes. In 2009, Castrol used information from the database to create personalised advertisements to drivers. Five billboards in London automatically recognised the numberplate and then advised drivers what type of engine oil to use based on the make and age of their car. The DVLA said that such use of the database was "inappropriate" and it was "urgently investigating".
See also
Vehicle Excise Duty (VED) - the UK duty, or tax, payable to be allowed to use a motor vehicle on a public road
Vehicle licence - the UK licence issued for a motor vehicle in return for the appropriate VED having been paid
Vehicle registration plate
U.S. and Canadian license plates
References
External links
Vehicle Licensing - DVLA
Northern Ireland - DVLNI
Quebec (SAAQ)
Parkplatzbeschilderung (in German)
Government databases in the United Kingdom
Vehicle law
|
https://en.wikipedia.org/wiki/Swedish%20railway%20signalling
|
The signalling system used on the standard-gauge railway network in Sweden is based on that of the traditional mechanical semaphore signals. Currently only colour-light signals are used, together with the Ansaldo L10000 Automatic Train Control system.
Main signals
The main signals (huvudsignaler) display the following aspects:
The aspects may seem a little inverted, since a single green light means proceed 80, two green lights Proceed 40, caution and three green lights stands for Proceed 40, short route. In other words: more green means more cautiously. Some other countries e.g. Norway have opposite. If there is a sign saying lower speed limit than 80, of course that is valid. The speed limits apply to trains without Automatic Train Control (ATC) equipment. ATC signalling typically allow higher speeds, up to . If there is no ATC, signs can show higher speed, but rarely above 110 km/h. If there is ATC there can be even higher signs which are valid only with ATC.
Two light signalling (Malmö and Stockholm city tunnels)
On some urban lines, such as the City Tunnel in Malmö and the Stockholm City Line, a simpler signal system is in use until ERTMS is fully implemented. The interpretation of the signals follow the ERTMS level 1 standard, but the actual look is national.
This system uses two light signals with blue number signs (instead of yellow/white in normal signalling) and can show the following aspects:
These signals should not be confused with normal main signals with two lights, which have yellow number signs, while the "Two light signals" shown here have blue ones. The meaning is different to normal meanings of the signals, but if combined with a speed limit 40 (not valid for ATC) sign, the meanings are essentially the same.
Distant signals
Distant signals (försignaler) are informational signals used to give an advance warning about the next home signal. Distant signal are typically located in advance of the home signal in question.
The aspects a free-standing distant signal can display are:
The signal indication is the same as for the combined aspects in the main signals.
Dwarf signals
Dwarf signals (dvärgsignaler) are used as shunting signals and can show the following aspects:
There are also types of dwarf signals, called "Main Dwarf signals" (Huvuddvärgsignal) used as stand-ins for home signals in stations with lot of shunting or where there are a lot of switches that needs a signal. In addition to the dwarf signal aspects given above, these signals also have a red light and two green ones (one for "proceed 40", the other for "proceed 80").
Road crossing signals
Road crossing signals (Vägkorsningssignaler (V-signaler)) are used at road crossings. They tell the driver if the crossing is clear (lights flashing, bells ringing or, if available, gates are closed)
They can show the following aspects
The same aspects are also used at moveable bridges, but with another sign under the signal.
Distant road crossing signal
Some road cros
|
https://en.wikipedia.org/wiki/Cologne%E2%80%93Aachen%20high-speed%20railway
|
The Cologne–Aachen high-speed line is the German part of the Trans-European transport networks project high-speed line Paris–Brussels–Cologne. It is not a newly built railway line, but a project to upgrade the existing railway line which was opened in 1841 by the Rhenish Railway Company. When it was continued into Belgium in 1843, it became the world's first international railway line.
The line inside Germany has a length of about . The first from Cologne to Düren have been rebuilt. Since 2002 the line allows for speeds up to . Separate tracks have been built parallel to the high-speed tracks for local S-Bahn traffic. The remaining line from Düren to Aachen allows speeds up to with some slower sections. Upgrades of Düren–Aachen are planned for the near future. In Belgium, the high-speed line is continued as HSL 3.
Regional-Express services on the line are RE 1 (NRW-Express) and RE 9 (Rhein-Sieg-Express) with push-pull trains with six double-decker carriages. Long-distance trains are operated by Thalys between Paris and Cologne (six pairs of trains each day), three pairs of ICE 3M trains daily between Frankfurt and Brussels Monday to Saturday and a morning ICE 2 between Aachen and Berlin.
History
Plans for the construction of a railway between Cologne and the Belgian border began in December 1833 with the issue of concession to the Cologne Railway Committee, which was to develop a line under the direction of Cologne Lord Mayor Johann Adolph Steinberger and the entrepreneur Ludolf Camphausen. The Cologne Railway Committee presented a draft route that would bypass Aachen to reduce costs: the line would run from Eschweiler to Kornelimünster along the Inde and from there to the Belgian border. Düren would also not have been connected to the railway. The Aachen merchants resisted this proposal and they founded the Aachen Railway Committee under the direction of David Hansemann and Philipp Heinrich Pastor. This was the beginning of the so-called Eisenbahnstreites zwischen Köln und Aachen (railway dispute between Cologne and Aachen). In October, the Aachen Railway Committee presented an alternative proposal for the route that ran from Cologne via Düren and Aachen to the Belgian border.
On 6 April 1836, a conference of representatives of the traders of Aachen and Cologne in Jülich, chaired by the Oberpräsident of the Rhine Province Ernst von Bodelschwingh, could not resolve to the railway dispute. Hansemann and the Aachen cloth manufacturer Joseph van Gülpen then travelled to Berlin and lodged an application for a line running through Aachen. In Berlin, lengthy negotiations took place between representatives of Aachen and Cologne. Prussian king Frederick William III decided on 12 February 1837 that the line would run through Aachen and thus ended the railway dispute.
In June 1837, the Aachen and Cologne representatives agreed to the merger of the two committees of their cities and founded the Rhenish Railway Company (Rheinische Eisenbahn-Ges
|
https://en.wikipedia.org/wiki/Legends%20of%20Future%20Past
|
Legends of Future Past was the first commercial text-based MUD to make the transition from a proprietary network provider (CompuServe, in this case) to the Internet. It was designed by Jon Radoff and Angela Bull. It was also notable in that it had paid Game Masters who conducted online events. The game was originally offered for $6.00 per hour in 1992 via CompuServe, and then lesser amounts via the Internet, operating until December 31, 1999.
Legends introduced one of the first (if not the first) crafting system in an online game. Players could harvest resources including ores, herbs and skins, and then use them to make weapons, armor and enchanted items. The game system was skill-based; players were not constrained to premade class archetypes. There were no level caps, and some very dedicated players attained levels in the hundreds.
Legends of Future Past was set in the "Shattered Realms," a world featuring a blend of fantasy and ancient technology. Most of the action in the game revolved around the city of Fayd, which served as the hub of activity for adventures, intrigue and roleplaying events. Some of the races included: aelfen (an elflike species), drakin (a race of dragon-men that ultimately resulted in player-created languages and cultural institutions), ephemerals (a wraithlike species that could not be harmed unless the player chose to manifest themself), highlander (think dwarves), humans (the only people who could utilize ancient technology), murg (a proud warrior race), mechanoids (artificial beings) and wolflings (a race of shapechangers).
Computer Game Review awarded Legends of Future Past the Golden Triad Award. It also won the award for artistic excellence in Computer Gaming World's 1993 Online Game of the Year competition, stating that "we were also overwhelmed by the creative power of storytelling and fertile liveliness."
Legends is credited with spawning a number of other online games and introducing some of the top talent in the MMORPG industry. Many GameMasters and developers at Legends of Future Past went on to become founders or product managers at top online games including SOE's Star Wars Galaxies, Worlds Apart Productions and Dejobaan Games. Jon Radoff, the developer of the game, created a gaming social network called GamerDNA and has started a social gaming company Disruptor Beam which holds the license to Game of Thrones.
Reception
"Ranger" Chris Lombardi reviewed the game for Computer Gaming World, and stated that "this is no casual hobby, but if multi-player role-playing is one's game, it is definitely time to don one's favorite alter-ego, check into the local adventurers guild and poke around. It just might be "The Realm" in which one's personal Legends are made."
Computer Gaming World in 1993 stated that Legends of Future Past was "a rich, dynamic and lovingly supervised world of the imagination ... Like most of these games, this one is extremely addicting — perhaps even more so". That year the magazi
|
https://en.wikipedia.org/wiki/Free%20%28ISP%29
|
Free S.A.S. is a French telecommunications company, subsidiary of Iliad S.A. that provides voice, video, data, and Internet telecommunications to consumers in France. Its head office is in the 8th arrondissement of Paris and it is the second-largest ISP in France.
Free provides ISP services in France and in the 30 OECD countries. It was the first company to offer a "triple play" service in France through its self-produced singular Freebox set-top box, claiming to have invented the box marketing concept in France in reference to all the other French ISPs who thereafter released "triple play" modems named to include the anglicism box as a suffix. These boxes provide comprehensive telecommunication services such as high-speed Internet, telephone and digital television packages, leading Free to become the world's number one IPTV provider offering almost systematically IPTV to subscribers and optimizing it to be available on most landlines.
Developing its own 3G and 4G networks, Free Mobile was launched in 2012 and became the fourth mobile network operator in France.
History
1999–2001
Free was the third ISP in France to offer Internet access without a subscription or a surcharged phone number, on 26 April 1999. Unlike its predecessors in the niche of access without subscription (World Online on 1999-04-01 and on 1999-04-19), Free's offer was not restricted in time or number of subscribers.
In 2002, Free was the first ISP to provide a V.92 connection.
2002-2003: ADSL at a disruptive price
Since September 2002, Free contributed significantly to French ADSL boom. The offer was able to launch as soon as the incumbent was forced to stop abuse of dominant position and to apply fair wholesale prices.
2004-2006: Unbundled ADSL and "triple play"
Unbundling, in France, refers to the obligation for the incumbent carrier France Telecom to lease the Local loop, because it is a natural monopoly. Although the unbundling process was intended to start by 2000, the actual unbundling process actually started at the end of 2002, after a long conflict between the French regulation authority ARCEP and the non-cooperative incumbent.
Free has to pay a rental fee of €9 per month and per subscriber to the incumbent for the Twisted pair of Copper between the area central office and the subscriber premises. Although more expensive than the real cost of €7.63, this solution is still far more profitable than the bundled option.
Since January 2003, a Freenaut has maintained an unofficial website, showing figures and graphics about Free unbundled network deployment (Free Unbundling). Another Freenaut website has provided network status monitoring maps Unbundling status and location since the end of 2003. These initiatives are made possible thanks to the transparency of Free's network: their equipment replies to ping and has a meaningful reverse DNS.
2007-present: Fiber to the home
On 11 November 2006, Free announced the deployment of a new fiber to the home (FTTH) net
|
https://en.wikipedia.org/wiki/English%20Electric%20KDF8
|
KDF8 was an early British computer built by English Electric as a version of the RCA 501. By producing a software-compatible system, the intention was to reduce time and cost to develop software. However, the lengthy process of developing manufacturing capability meant that the system was soon outpaced by systems from other vendors. Only a few systems were sold during its 5 years of production. Due to the consolidation of the British computer industry, English Electric's computer division became one of the components of what would become ICL.
Background
During the late 1950s English Electric embarked on two major computer projects.
Firstly, English Electric built a version of the RCA 501 computer which was known as the KDP10 (KDP for Kidsgrove Data Processing). This was a machine intended for commercial data processing applications, with fixed length instructions, and capabilities for processing variable-length numeric and alpha-numeric data. RCA's original design was adapted to use the types of transistors, diodes and other components manufactured in the UK. The KDP10 was first delivered in 1961. In 1964 it was re-designated as the KDF8 and sales continued to 1965. The machine was essentially the same as the RCA 501 and manufactured under license so that English Electric could offer a full range of computer systems for all its customers, without the expense of developing an entirely new machine. The machine sold for £400,000. Only 13 were sold.
The second large computer to emerge from development work at Kidsgrove was the KDF9, primarily designed for scientific work.
One KDF8 was installed at the Kidsgrove (Staffordshire) site of The English Electric Company's computer bureau. Over the years, and a succession of mergers, this organisation became English Electric Leo Marconi (EELM), International Computing Services Limited (ICSL), and finally under a joint arrangement between ICL and Barclay's Bank, Baric.
Basic features
Processor/main store
KDF8 was a transistor based machine with magnetic core memory. The core memory of the machine installed at the Kidsgrove computer bureau was upgraded from 64k to the then maximum of 96k of core memory. KDF8 used an octal (base eight) addressing system. A machine-code instruction was fixed length, ten octal characters long. The instruction set was specifically designed for commercial use. It had machine-code level instructions for all four of the decimal arithmetic functions operating on variable length numbers, and also had instructions for efficient manipulation of variable-length data-strings. Not all instructions required all ten characters. Given the minimal core memory available, programmers frequently used "spare" characters in instructions for storage of constants and similar storage-saving tricks.
KDF8 was strictly a batch processing computer, running one program at a time. Only one compute instruction could be processed at one time, but it was also possible to have one read and/or o
|
https://en.wikipedia.org/wiki/Metromedia%20%28disambiguation%29
|
Metromedia is an American media company.
Metromedia can also mean:
Metromedia Fiber Network, Inc., later AboveNet
Metromedia Restaurant Group
Metromedia Square, the former Fox Television Center broadcast facility
Metromedia, the post-1971 name for the sound system Tom the Great Sebastian
|
https://en.wikipedia.org/wiki/Misra
|
Misra or Mishra may refer to:
Motor Industry Software Reliability Association
MISRA C, a software development standard for the C programming language
Misra (poetry), a term meaning a line of a couplet, or verse, in Turkic, Arabic, Persian and Urdu poetry
Mishra or Misra, an Indian and Nepalese surname
Bhagiratha, a figure in Hindu mythology, considered to be the ancestor of Mishras
Vishal Misra, an Indian-American engineer
Mishra (Magic: The Gathering), a character in The Brothers' War novel
Misra Records, a record label
A variation of the classical Arabic name for Egypt, (, )
Misra (month) (, ), the Egyptian Arabic name for a month of the Coptic calendar
See also
Misr (disambiguation)
Mushaira, gathering of Urdu poets
|
https://en.wikipedia.org/wiki/Indianapolis%20Motor%20Speedway%20Radio%20Network
|
The Indianapolis Motor Speedway Radio Network (known typically as the IMS Radio Network or the INDYCAR Radio Network), is an in-house radio syndication arrangement which broadcasts the Indianapolis 500, the NTT IndyCar Series, and Indy Lights to radio stations covering most of North America. The network, owned by the Indianapolis Motor Speedway and headquartered in Speedway, Indiana, claims to be one of the largest of its kind in the world. It currently boasts over 350 terrestrial radio affiliates, plus shortwave transmissions through American Forces Network and World Harvest Radio. The network is carried on satellite radio through SiriusXM, and is also accessible through online streaming, and downloadable podcasts. For 2017, the broadcast reached 20.5 million listeners.
The longtime flagship of the network is 1070/WFNI (formerly WIBC, currently broadcasting on WIBC-HD3 and its FM translators) in Indianapolis. Mark Jaynes is the current anchor and chief announcer for the network, a role he assumed beginning in 2016. Davey Hamilton is the Driver Analyst.
The most notable personality from the network is hall of fame broadcaster Sid Collins, who was the original "Voice of the 500" from 1952 to 1976. Other notable broadcasters over the network's history include Paul Page, Bob Jenkins, Lou Palmer, Jerry Baker, Bob Lamey, and dozens more. In addition, former Indy 500 drivers Fred Agabashian, Len Sutton, Johnny Rutherford, and numerous others have served as analysts.
History
Early radio coverage
Coverage of the Indianapolis 500 on radio dates back to 1922. Two small stations, WOH and WLK, broadcast descriptions of the race to a small number of households in the Indianapolis area. Starting in either 1924 or 1925, WFBM and WGN in Chicago carried the race, broadcasting periodic updates. In 1929, WKBF and WFBM carried a -hour full race broadcast.
The first major coverage came in 1928 when NBC covered the final hour of the race live, with Graham McNamee as anchor. There was no radio coverage in 1932, as Speedway officials decided to allow newspapers exclusive coverage of the race. NBC eventually returned, and continued until 1939, in some years also carrying live segments at the start. Charlie Lyons was their announcer for 1939. CBS also covered the race in the late 1930s, with Ted Husing anchoring the coverage in 1936. WIRE and WLW also reported from the race during the 1930s.
Mutual / WIBC
From 1939 to 1950, Mutual Broadcasting System covered the Indianapolis 500 nationwide with live segments at the start, the finish, and live periodic updates throughout the race. Bill Slater was brought in as the anchor. In the years prior to World War II, Mutual used the production services of WLW, and provided the signal to other Mutual stations across the country. In the years after World War II, Mutual utilized the services of WIBC to produce the broadcast and provide additional talent.
In 1950, due to an illness, Slater was expected to miss the broadcast. Sid
|
https://en.wikipedia.org/wiki/WANT
|
WANT (98.9 FM) is a radio station licensed to Lebanon, Tennessee, broadcasting at 98.9 MHz. Most of WANT's broadcast day is simulcast over 1490 AM WCOR, with some exceptions.
Programming
WANT is primarily focused on serving its community of Lebanon and Wilson County. It can be classified as a full-service radio station, mostly featuring country music, but regularly scheduling programs featuring oldies music, funk music, talk shows, and sporting events. Local news, weather, obituaries, and traffic reports regularly appear on weekdays.
Local deejays anchor morning and afternoon drive times with shows that feature country music, trivia, news, weather, and traffic reports. In addition, a long-running local talk show (Coleman & Company) takes one hour of programming each weekday morning (7am to 8am). The show features interviews with local newsmakers and promotes community events. On Saturday nights, the station plays funk & classic R&B music, hosted by "Fantastic Fred Anthony", a longtime fixture of the station. Sunday nights now feature an oldies music show. In addition to Lebanon High School football and basketball, the station is an affiliate of the Tennessee Titans radio network. WANT also broadcasts selected intercollegiate sporting events featuring teams associated with Lebanon's Cumberland University.
At times when no local programming is offered (such as middays, overnights, and weekends), the station takes programming from the "Real Country" radio network. When the station is playing country music (whether locally originated or from the "Real Country" network), it carries the "Real Country FM 98.9" branding. During other programming blocks, it is simply branded as "FM 98.9 WANT". The WCOR simulcast is seldom acknowledged, except in the station's legal identifications.
History
After operating under a construction permit as WJFM, the station's owners petitioned the FCC to change the call letters to WANT (reflecting the original slogan, "You'll WANT to listen!"). The station first signed on the air on October 1, 1993, and the same day, revived sister station WCOR (then on 900 AM) as a simulcast, after it had been off-the-air for over a year. The station was originally branded as "FM 99", and was later tweaked to "FM 98.9" to represent the station's actual frequency.
References
External links
WANT official website
Country radio stations in the United States
ANT
Mass media in Wilson County, Tennessee
Radio stations established in 1993
1993 establishments in Tennessee
|
https://en.wikipedia.org/wiki/Programming%20and%20Metaprogramming%20in%20the%20Human%20Biocomputer
|
Programming and Metaprogramming in the Human Biocomputer: Theory and Experiments is a 1968 book by John C. Lilly. In the book, "the doctor imagines the brain as a piece of computer technology." More specifically, he uses "the analogy of brain being the hardware, the mind being the software and consciousness being beyond both."
Summary
The term human biocomputer, coined by Lilly, refers to the "hardware" of the human anatomy. This would include the brain, internal organs, and other human organ systems such as cardiovascular, digestive, endocrine, immune, integumentary, lymphatic, muscular, nervous, reproductive, respiratory, skeletal, and urinary systems. The biocomputer has stored program properties, and self-metaprogramming properties, with limits determinable and to be determined.
Definitions
The following definitions are used in the book:
Mind, which is defined as the sum total of all the programs and metaprograms (and even supraself metaprograms) of a human biocomputer. This is the software and is looked at as the opposite of the hardware.
Brain, which is defined as the visible, palpable living set of structures to be included in the human biocomputer.
Stored program, which is defined as a set of instructions which are placed in memory storage of the biocomputer, and which control the biocomputer when orders are given for that program to be activated. These programs can be activated by the same biocomputer, another biocomputer, or a situation outside of the biocomputer.
Metaprogramming, which is defined as a set of instructions, descriptions, and implementations of related thoughts and actions (programs). Self-metaprogramming involves the creation, revision, and reorganization of programs and metaprograms.
Organization
The functional organization of the human biocomputer described in the book is:
The levels of the human biocomputer are explained thus:
Levels from one to two are the boundaries between external reality and the body. Certain energies and materials (heat, light, sound, food, and secretions) pass through this boundary in special places. Levels two to three are the boundaries of body and brain, in which special structures such as blood vessels, nerve fibers, and cerebrospinal fluid pass. Levels four through eleven are in the brain circuitry, and is the software inside the biocomputer. Levels after ten are termed unknown. This is to allow an openness for future scientific research, and discoveries. This is also to illustrate the unwillingness to subscribe to any dogmatic belief, to encourage creative, courageous and imaginative investigation, to emphasize the necessity for unknown factors on all levels, and to point out the heuristic nature of this schema.
Reception
Editions
See also
Eight-circuit model
Laws of Form
Reality tunnel
Timothy Leary
References
Citations
Works cited
1968 non-fiction books
American non-fiction books
Books about consciousness
Philosophy of mind literature
|
https://en.wikipedia.org/wiki/Data%20domain
|
In data management and database analysis, a data domain is the collection of values that a data element may contain. The rule for determining the domain boundary may be as simple as a data type with an enumerated list of values.
For example, a database table that has information about people, with one record per person, might have a "marital status" column. This column might be declared as a string data type, and allowed to have one of two known code values: "M" for married, "S" for single, and NULL for records where marital status is unknown or not applicable. The data domain for the marital status column is: "M", "S".
In a normalized data model, the reference domain is typically specified in a reference table. Following the previous example, a Marital Status reference table would have exactly two records, one per allowed value—excluding NULL. Reference tables are formally related to other tables in a database by the use of foreign keys.
Less simple domain boundary rules, if database-enforced, may be implemented through a check constraint or, in more complex cases, in a database trigger. For example, a column requiring positive numeric values may have a check constraint declaring that the values must be greater than zero.
This definition combines the concepts of domain as an area over which control is exercised and the mathematical idea of a set of values of an independent variable for which a function is defined, as in Domain of a function.
See also
Data modeling
Reference data
Master data management
Database normalization
References
Data modeling
|
https://en.wikipedia.org/wiki/Don%20Woods%20%28programmer%29
|
Donald R. Woods (born April 30, 1954) is an American hacker and computer programmer. He is best known for his role in the development of the Colossal Cave Adventure game.
Biography
Early programming career
Woods teamed with James M. Lyon while both were attending Princeton in 1972 to produce the unprecedented, excursive INTERCAL programming language. Later, he worked at the Stanford AI lab (SAIL), where among other things he became the SAIL contact for, and a contributor to, the Jargon File. He also co-authored "The Hacker's Dictionary" with Mark Crispin, Raphael Finkel, and Guy L. Steele Jr.
Work on Adventure
Woods discovered the Colossal Cave Adventure game by accident on a SAIL computer in 1976. After contacting the original author by the (now antiquated) means of sending an e-mail to crowther@sitename, where sitename was every host listed on ARPANET, he heard back from William Crowther shortly afterward.
Given the go-ahead, Woods proceeded to add enhancements to the Adventure game, and then distributed it on the Internet. It became very popular, especially with users of the PDP-10. Woods stocked the Kentucky cave that Crowther had written with new magical items, creatures, and geographical features. Crowther's game, which originally featured few supernatural elements, was transformed into a loose fantasy world featuring elements from role playing games. Woods can thus, in a sense, be considered one of the progenitors of the entire genre of computer adventure games and interactive fiction.
By 1977 tapes of the game were common on the Digital user group DECUS, and others (see The Soul of a New Machine by Tracy Kidder for a human history of this period).
References
Further reading
Don Woods' web page
Interview with Woods regarding Adventure
Computerworld Interview with Don Woods on INTERCAL
Video game programmers
Interactive fiction writers
Princeton University alumni
Living people
1954 births
Google employees
Game Developers Conference Pioneer Award recipients
|
https://en.wikipedia.org/wiki/Ducati%20888
|
The Ducati 888 was a motorcycle manufactured by Ducati as an upgrade to the Ducati 851. The earlier 851 had introduced liquid cooling, computerized fuel injection and four-valve heads to the company's two cylinder motors. In 1991 Ducati increased the capacity of the 851 to 888 cc to create the 888. Both engines featured the Desmoquattro valvetrain concept in which a four valve per cylinder motor was given desmodromic valve actuation, with cams both opening and closing the valves. Ducati's desmodromic system reduces the frictional penalty from conventional valve springs.
Production figures known for the various models are:
1991 models: 1200 × 851 Stradas, 534 × SP3 & 16 × SPS. A total of 1850 units.
1992 models: 1402 × 851 Stradas, 500 × SP4 & 101 × SPS. A total of 2003 units.
1993 models: 1280 × 888 Stradas, 500 × SP5 & 290 × SPO - for the American market. A total of 2070 units.
1994 models: 1571 × 888 Stradas & 100 SPO for the American market. A total of 1671 units.
Over all years there was a grand total of 7594 units produced.
Riding the Ducati 888, Doug Polen won first place in the 1991 and 1992 World Superbike Championships. After losing to Kawasaki in the 1993 World Superbike Championship, Ducati ceased production of the Ducati 888 and released the Ducati 916 which had a larger engine capacity.
Continuing refinement yielded the next two generations of the Ducati Desmoquattro superbike, resulting in the 916/996 and 999 lines.
In a 1993 road test of the 888SPO, Cycle World measured a time of 11.25 seconds at , and a acceleration of 3.3 seconds. They measured a top speed of and a braking distance of of . The wet weight of their test bike was and the rear-wheel horsepower was at 8,740 rpm, and torque was at 7,000 rpm.
Ducati said the 1992 racing version of the 888, the SBK had a dry weight of and at 12,000 rpm, and was capable of a top speed of more than .
Racing history
1991 Doug Polen - Ducati 888SBK
1992 Doug Polen - Ducati 888SBK
Notes
External links
Ducati 888 SBK91 at Ducati.com Heritage.
Ducati 888 SBK92 at Ducati.com Heritage.
888
Sport bikes
Motorcycles introduced in 1991
Motorcycles introduced in 1992
Motorcycles powered by V engines
|
https://en.wikipedia.org/wiki/Bird%20Internet%20routing%20daemon
|
BIRD (recursive acronym for BIRD Internet Routing Daemon) is an open-source implementation for routing Internet Protocol packets on Unix-like operating systems. It was developed as a school project at the Faculty of Mathematics and Physics, Charles University, Prague, and is distributed under the GNU General Public License.
BIRD supports Internet Protocol version 4 and version 6 by running separate daemons. It establishes multiple routing tables, and uses BGP, RIP, and OSPF routing protocols, as well as statically defined routes. Its design differs significantly from GNU Zebra, Quagga and FRRouting. Currently BIRD is included in many Linux distributions, such as Debian, Ubuntu and Fedora.
BIRD is used in several Internet exchanges, such as the London Internet Exchange (LINX), LONAP, DE-CIX and MSK-IX as a route server, where it replaced Quagga because of its scalability issues. According to the 2012 Euro-IX survey, BIRD is the most used route server amongst European Internet exchanges.
In 2010, CZ.NIC, the current sponsor of BIRD development, received the LINX Conspicuous Contribution Award for contribution of BIRD to the advancement in route server technology.
Design
BIRD implements an internal routing table to which the supported protocols connect. Most of these protocols import network routes to this internal routing table and also export network routes from this internal routing table to the given protocol. This way information about network routes is exchanged among different routing protocols.
Using the kernel protocol this internal routing table may be connected to the actual kernel routing table. This allows BIRD to export network routes from its internal routing table to the kernel routing table and optionally also learn about network routes from the kernel routing table (created externally by the administrator or by other means) and import these routes into its internal routing table.
Filters may be used to control what network routes are imported into the internal routing table or exported to the given protocol. Network routes may be accepted, rejected or modified using filters.
BIRD also supports multiple internal routing tables and multiple instances of supported protocol types. Protocols may be connected to different internal routing tables, these internal routing tables may exchange information about network routes they contain (controlled by filters) and each of these internal routing tables may be connected to a different kernel routing table thus allowing for policy routing.
Configuration is done by editing the configuration file and telling BIRD to reconfigure itself. BIRD changes to the new configuration without the need to restart the daemon itself and restarts reconfigured protocols only if necessary. There is also an option to do a soft reconfiguration, which doesn't restart protocols but may leave some stale information such as changed filters not filtering out already exported network routes.
See also
List of
|
https://en.wikipedia.org/wiki/Transport%20in%20Bristol
|
Bristol is a city in south west England, near the Bristol Channel coast, approximately 106 miles (170 km) west of London. Several factors have influenced the development of its transport network. It is a major centre of employment, retail, culture and higher education, has many historic areas, and has a history of maritime industry. The city has a population of 450,000, with a metropolitan area of 650,000, and lies at the centre of the former County of Avon, which includes many dormitory towns, and has a population of one million.
The West of England Combined Authority (WECA) has substantial responsibility for transport policy in its area which covers Bristol and surrounding areas. During 2023 residual strategic transport planning responsibility will be transferred to WECA from its constituent councils.
National and international connections
The city is connected by road on an east-west axis from London to Wales by the M4 motorway, and on a north-southwest axis from Birmingham to Exeter by the M5 motorway. Also within the authority area is the M49 motorway, a shortcut between the M5 in the south and M4 Severn Crossing in the west.
There are two principal railway stations in Bristol – Bristol Parkway and Bristol Temple Meads – and 11 suburban stations. There are scheduled coach links to most major UK cities.
Bristol Airport (BRS), about south-west of the city centre, has services to major European destinations.
Public transport
Rail
Bristol has never been well served by suburban railways, though the Severn Beach Line to Avonmouth and Severn Beach survived the Beeching Axe and is still in operation today. Usage of the line has more than doubled since the early 2000s, but still only a small percentage of Bristol residents use rail for commuting.
High frequency commuter services operate between Bristol and Bath, serving the intermediate stations of Keynsham and Oldfield Park. There is potential to reopen another intermediate station, St Anne's Park, which was closed in 1970.
Long distance services run from Bristol Temple Meads in the centre and Bristol Parkway in the north, where the line was electrified in 2018.
Improvement plans
The Filton Bank from central to north Bristol was returned to quadruple track in 2018 to allow for improvements to local and long distance services. Ashley Hill railway station is scheduled to reopen as Ashley Down in 2023.
Work began in 2022 on a new station on the Severn Beach line for the Portway park & ride site, west of the city and close to the M5 motorway.
The Portishead Railway was closed in the Beeching Axe but was relaid between 2000 and 2002 as far as the Royal Portbury Dock with a Strategic Rail Authority rail-freight grant. Plans to reinstate a further three miles of track to Portishead, a dormitory town with only one connecting road, are underway, with services to be initially one train per hour.
There are also plans to reopen parts of the Henbury Loop Line to passengers, including a stat
|
https://en.wikipedia.org/wiki/Psydoll
|
Psydoll are a Japanese cyberpunk band. They formed in Tokyo in 1997 and incorporate industrial and electropop with cyberpunk imagery, musical and lyrical content. In 2003, they came to the UK to play at the Beyond the Veil gothic music festival in Leeds and gained some recognition amongst the UK industrial and gothic underground. Later that year they returned for a mini-tour of Scotland and Northern England. Leeds based Label Planet Ghost Music, recognized the talent and signed them for their first release outside Japan. I, Psydoll is a collection of their previous two albums plus a bonus track. They then returned to the UK in 2005 for another mini-tour supporting amongst others Amen.
Personnel
Nekoi PSYDOLL (aka Rutoto Nekoi) (Vocals, Keyboards, Songs and lyrics)
Ucchi PSYDOLL (Guitars, Arrangements and Programming)
Loveless PSYDOLL (Actual name: Yoshinori Uenoyama) (Digital Percussion and Drums)
Discography
Albums
Singles and EPs
Fragments (Japan only) (2003)
Sign (Japan only) (2004)
Stories (Japan only EP) (2005)
Dance with PSYDOLL (2008)
Silent Insanity (2014)
Machine Sword: Chapter 1 of Machine Kingdom (2015)
Machine Wand: Chapter 2 of Machine Kingdom (2016)
Machine Disk: Chapter 3 of Machine Kingdom (2017)
Machine Cup: Chapter 4 of Machine Kingdom (2018)
Rebirth (2020)
Psyberdoll Resurrections (2021)
Nekoi PSYDOLL's Book
Moshi Moshi Call もしもしコール By Nekoi Rutoto 猫井るとと () (Published by Kubo Shoten 久保書店 on 1985 October 1.) This 116 page book of Nekoi's comic strips, from the early to mid 1980s, is a collection of her work from Lemon People, Melon Comic, and other monthly manga magazines that she contributed to. A photo of her appears on the inside back flap of the dust jacket.
References
External links
Official Website
Psydoll's Myspace page
Planetghost Music
Psydoll | JGoth.com :: Japan Goth and Industrial Music
Cyberpunk music
Japanese electronic music groups
Japanese industrial music groups
Musical groups from Tokyo
|
https://en.wikipedia.org/wiki/Automated%20storage%20and%20retrieval%20system
|
An automated storage and retrieval system (ASRS or AS/RS) consists of a variety of computer-controlled systems for automatically placing and retrieving loads from defined storage locations. Automated storage and retrieval systems (AS/RS) are typically used in applications where:
There is a very high volume of loads being moved into and out of storage
Storage density is important because of space constraints
No value is added in this process (no processing, only storage and transport)
Accuracy is critical because of potential expensive damages to the load
An AS/RS can be used with standard loads as well as nonstandard loads, meaning that each standard load can fit in a uniformly-sized volume; for example, the film canisters in the image of the Defense Visual Information Center are each stored as part of the contents of the uniformly sized metal boxes, which are shown in the image. Standard loads simplify the handling of a request of an item. In addition, audits of the accuracy of the inventory of contents can be restricted to the contents of an individual metal box, rather than undergoing a top-to-bottom search of the entire facility, for a single item.
They can also be used in self storage places.
Overview
AS/RS systems are designed for automated storage and retrieval of parts and items in manufacturing, distribution, retail, wholesale and institutions. They first originated in the 1960s, initially focusing on heavy pallet loads but with the evolution of the technology the handled loads have become smaller. The systems operate under computerized control, maintaining an inventory of stored items. Retrieval of items is accomplished by specifying the item type and quantity to be retrieved. The computer determines where in the storage area the item can be retrieved from and schedules the retrieval. It directs the proper automated storage and retrieval machine (SRM) to the location where the item is stored and directs the machine to deposit the item at a location where it is to be picked up. A system of conveyors and or automated guided vehicles is sometimes part of the AS/RS system. These take loads into and out of the storage area and move them to the manufacturing floor or loading docks. To store items, the pallet or tray is placed at an input station for the system, the information for inventory is entered into a computer terminal and the AS/RS system moves the load to the storage area, determines a suitable location for the item, and stores the load. As items are stored into or retrieved from the racks, the computer updates its inventory accordingly.
The benefits of an AS/RS system include reduced labor for transporting items into and out of inventory, reduced
inventory levels, more accurate tracking of inventory, and space savings. Items are often stored more densely than in systems where items are stored and retrieved manually.
Within the storage, items can be placed on trays or hang from bars, which are attached to chains/drive
|
https://en.wikipedia.org/wiki/National%20Data%20Buoy%20Center
|
The National Data Buoy Center (NDBC) is a part of the National Oceanic and Atmospheric Administration's (NOAA) National Weather Service (NWS). NDBC designs, develops, operates, and maintains a network of data collecting buoys and coastal stations. The NDBC is located in southern Mississippi as a tenant at the John C. Stennis Space Center, a National Aeronautics and Space Administration (NASA) facility.
Operations
NDBC employs engineers, meteorologists, oceanographers, computer scientists, and other professionals.
NDBC provides hourly observations from a network of about 90 buoys and 60 Coastal Marine Automated Network (C-MAN) stations to help meet these needs. All stations measure wind speed, direction, and gust; atmospheric pressure; and air temperature. In addition, all buoy stations, and some C-MAN stations, measure sea surface temperature and wave height and period. Conductivity and water current are measured at selected stations.
A new task is the operation of the DART (Deep-ocean Assessment and Reporting of Tsunamis) buoys. DART is a fleet of tsunami detecting buoys.
Another task adopted in 2005 is TAO (Tropical Atmosphere Ocean project) buoys. TAO is a fleet of over 50 buoys moored in the Pacific Ocean. These buoys are designed to help detect and predict El Niño and La Niña.
All buoys and many C-MAN stations located in offshore areas operate on marine batteries which are charged by solar cells. Sensors are calibrated in wind tunnels or environmental chambers, and later tested with the onboard station microprocessors, called payloads, on test stands at the outside sensor test facility. Final calibration and testing of the completed buoy systems are accomplished in the onsite canal. All buoys are serviced about every two years for routine maintenance and to install newly calibrated sensors.
The observations from moored buoys and C-MAN stations are transmitted hourly through NOAA Geostationary Operational Environmental Satellites (GOES) to a ground receiving facility at Wallops Island, Virginia, operated by the NOAA National Environmental Satellite, Data, and Information Service (NESDIS). Additionally, some buoys and C-MAN stations may use the Iridium satellite system to transmit data. The data is recorded and processed by the National Oceanographic Data Center.
Through a Memorandum of Agreement, the United States Coast Guard (USCG) remains a critically important partner to NDBC, supplying transportation for buoy deployments, retrievals, and other maintenance.
History
The National Data Buoy Development Program (NDBDP), created in 1967, was placed under the control of the USCG.
In 1970, NOAA was formed and the NOAA Data Buoy Office (NDBO) was created within the National Ocean Service (NOS) and located in Mississippi. In 1982, the NDBO was renamed NDBC and was placed under NOAA's NWS.
The first buoys deployed by NDBC were the large 12-m discus hulls constructed of steel. These were generally deployed in deep water off the U.S. Ea
|
https://en.wikipedia.org/wiki/David%20Adjey
|
David Adjey is a Canadian chef known for his appearances on the Food Network Canada show Restaurant Makeover.
Adjey appeared on the season 7 premiere episode of Iron Chef America which originally aired on October 5, 2008. He faced off against Iron Chef Michael Symon and the theme ingredient was sturgeon. Adjey and Symon fought to a 47-point tie/draw. He starred in Food Network Canada's Restaurant Makeover which ran from 2005 to 2008. Adjey stars in the Food Network Canada show, The Opener, which started in fall of 2010. He is the author of the New York Times best-seller Deconstructing the Dish.
Adjey founded restaurant The Chickery in May 2012.
Bibliography
1997 - Heart and soul cuisine from the estates of Sunnybrook, Sunnybrook Health Science Centre, 188 pages,
2007 - DeConstructing the Dish, modern day cuisine. by Whitecap publishers. 166 pages,
External links
DavidAdjey.com - Official site
Video of the blogger night: Date with Chef David Adjey (from NAIT's techlife magazine)
1964 births
Canadian television chefs
Culinary Institute of America alumni
Living people
Participants in Canadian reality television series
Canadian male chefs
|
https://en.wikipedia.org/wiki/Rob%20Rainford
|
Rob Rainford (born November 30, 1966) is a Canadian chef, author of Rob Rainford's Born to Grill and former host of Licence to Grill (LTG) on the Food Network Canada, Discovery Home (in the United States) and Asian Food Channel (across Asia). He was born in Saint Andrew Parish, Jamaica, before moving to Canada with his family at the age of three. Rainford completed his culinary school at George Brown College in 1994.
Career
Rainford is best known for hosting the TV series, License to Grill, which involves backyard cooking, entertaining and barbecuing. Rainford is tasked with hosting gatherings at his home where he prepares a meal while sharing tips and tricks for cooking on a barbecue. The techniques shared range from typical barbecue fare, such as hamburgers, steaks, and kebabs, to more complex meals, including legs of lamb, hot smoking and grilled desserts. His signature line from the show has been "look at those beautiful char marks!"
On May 8, 2012, Rainford released his book, Rob Rainford's Born to Grill.
References
External links
Rob Rainford at the Chef and Restaurant Database
Black Canadian broadcasters
Jamaican emigrants to Canada
Canadian television chefs
Living people
1966 births
George Brown College alumni
Canadian male chefs
|
https://en.wikipedia.org/wiki/Integrated%20test%20facility
|
An integrated test facility (ITF) creates a fictitious entity in a database to process test transactions simultaneously with live input.
ITF can be used to incorporate test transactions into a normal production run of a system. Its advantage is that periodic testing does not require separate test processes. However, careful planning is necessary, and test data must be isolated from production data.
Moreover, ITF validates the correct operation of a transaction in an application, but it does not ensure that a system is being operated correctly. Integrated test facility is considered a useful audit tool during an IT audit because it uses the same programs to compare processing using independently calculated data. This involves setting up dummy entities on an application system and processing test or production data against the entity as a means of verifying processing accuracy.
References
Databases
|
https://en.wikipedia.org/wiki/H%C3%A9ctor%20Garc%C3%ADa-Molina
|
Héctor García-Molina (15 November 1954 – 25 November 2019) was a Mexican-American computer scientist and Professor in the Departments of Computer Science and Electrical Engineering at Stanford University. He was the advisor to Google co-founder Sergey Brin from 1993 to 1997 when Brin was a computer science student at Stanford.
Biography
Born in Monterrey, Nuevo León, Mexico, García-Molina graduated in 1974 with a bachelor's degree in Electrical Engineering from the Monterrey Institute of Technology and Higher Studies (ITESM) and received both a master's degree in Electrical Engineering (1975) and a doctorate in Computer Science (1979) from Stanford University.
From 1979 to 1991, García-Molina worked as a professor of the Computer Science Department at Princeton University in New Jersey. In 1992 he joined the faculty of Stanford University as the Leonard Bosack and Sandra Lerner Professor in the Departments of Computer Science and Electrical Engineering and has served as Director of the Computer Systems Laboratory (August 1994 – December 1997) and as chairman of the Computer Science Department from (January 2001 – December 2004). During 1994–1998, he was Principal Investigator for the Stanford Digital Library Project, the project from which the Google search engine emerged.
García-Molina has served at the U.S. President's Information Technology Advisory Committee (PITAC) from 1997 to 2001 and has been a member of Oracle Corporation's Board of Directors since October 2001.
García-Molina was also a Fellow member of the Association for Computing Machinery, the American Academy of Arts and Sciences and a member of the National Academy of Engineering. He was a Venture Advisor for Diamondhead Ventures and ONSET Ventures. In 1999 he was laureated with the ACM SIGMOD Innovations Award.
García-Molina died of cancer on the eve of his 66th birthday.
Awards
(2010) VLDB 10-year Best Paper Award for the paper entitled "The Evolution of the Web and Implications for an Incremental Crawler" in VLDB 2000.
(2009) SIGMOD Best Demo Award for the demo entitled "CourseRank: A Social System for Course Planning".
(2007) ICDE Influential Paper Award for the paper entitled "Disk Striping" in ICDE 1986. This early paper on disk striping significantly influenced subsequent work on RAID storage.
(2007) Honorary doctorate from ETH Zurich for outstanding work in computer science.
References
External links
Héctor García-Molina's Personal Web page at Stanford University
El Universal: El mexicano que asesoró a los creadores de Google (in Spanish)
→ On the Origins of Google
Videolecture on Web Information Management: Past, Present and Future
"Excelling Beyond the Spreadsheet" Presentation at the 2008 Yahoo! Research Big Thinkers Series
1954 births
2019 deaths
People from Monterrey
Monterrey Institute of Technology and Higher Education alumni
Stanford University School of Engineering alumni
Mexican computer scientists
Mexican emigrants to the United States
American c
|
https://en.wikipedia.org/wiki/SunStar%20Cebu
|
SunStar Cebu, formerly stylized as Sun•Star Cebu (formerly Sun•Star Daily), is a community newspaper in Cebu City, the Philippines. It is the flagship newspaper of the SunStar network of newspapers and is the leading newspaper in both Metro Cebu and the province of Cebu. It was named Sunstar Daily when it was first founded in November 25, 1982, and changed its name to Sunstar Cebu in 2000.
It is also the oldest of the SunStar newspapers, having been in continuous publication since 1982. Its main office is located along P. del Rosario St., Cebu City.
Awards
"Best Newspaper" - Cebu Archdiocesan Mass Media Awards Hall of Fame (1991, 1992, 1993)
"Best Edited Daily" - Asia Media Project Konrad Adenauer Foundation and Philippine Press Institute (1997, 1998, 1999)
See also
SunStar Superbalita Davao
The Freeman Newspaper
References
External links
SunStar Cebu
SunStar
Newspapers established in 1982
|
https://en.wikipedia.org/wiki/Master%E2%80%93slave
|
Master–slave or master/slave may refer to:
Master/slave (technology), a model of communication between two devices in computing
Master–slave dialectic, a concept in Hegelian philosophy
Master–slave morality, a central theme of Friedrich Nietzsche's works
Master/slave (BDSM), a type of consensual relationship of dominance and submission
Letter 47 (Seneca), also known as On Master and Slave
"Master/Slave", a hidden track by the alternative rock band Pearl Jam on the album Ten
Master Slave Husband Wife (2023), a history of Ellen and William Craft's escape from slavery by Ilyon Woo
See also
Master (disambiguation)
Slave (disambiguation)
|
https://en.wikipedia.org/wiki/Polymorphic%20Programming%20Language
|
The Polymorphic Programming Language (PPL) was developed in 1969 at Harvard University by Thomas A. Standish. It is an interactive, extensible language with a base language similar to the language APL.
The assignment operator <- (or ←) has influenced the language S.
References
Procedural programming languages
Harvard University
Programming languages created in 1969
|
https://en.wikipedia.org/wiki/MEDFORIST
|
MEDFORIST is a project aimed at implementing a Euro-Mediterranean network for sharing information systems and technology (IST) resources. Started in August 2002, MEDFORIST is a project of the Euro-Mediterranean Information Society (EUMEDIS), an initiative of the European Union, ultimately aimed at establishing an EU-MED free trade zone by 2010 and setting up an information network system among European and Mediterranean universities and institutes in the field of information technology (IT). The project is coordinated by Centre TIME of the Grenoble école de management.
Objectives
The development of a business network comprising educators from the partner institutions who are specialists in information and communication technologies (ICT) and their implementation in commerce and industry
The development of jointly developed and shared learning resources and the supporting technological platform and knowledge base
Teaching students and executives in the member countries about the design and implementation of ICT-based applications for the management of local industrial and commercial companies.
Associating local partners from other academic and vocational training institutions as well as intermediary organizations like the chamber of commerce and industry or professional associations
Dissemination towards the key stakeholders of countries to guarantee the promotion of the project and its sustainability.
Project goals
Following the completion of the project the following goals are hoped to have been met:
Determine the needs for competencies and training in the field of ICT-based applications in the management of industrial and commercial companies.
Establishment of a database with the status on ICT in each country.
Creation of a network consisting of about 50 professors from the partners institutions sharing the learning resources.
Learning resources will consist of web-based pedagogic materials adapted to the context of each country on the different topics of ICT-based applications for management, including topics like e-business strategy, electronic commerce and procurement, supply chain management, customer relationship management, enterprise resource planning, and change management.
Seminars conducted in each country targeted to different user groups including under graduate students, post graduate students, managers and executives.
Diffusion of the teaching and dissemination of the results of the project will have been made widely available through the web site of the project, editorials, seminars, communication in the media, international conferences and articles in specialised magazine review.
Integration
The integrating activities have two levels:
The project management is a task for the steering committee composed with the project leader, a manager by sub-project, and a manager by Mediterranean country. This steering committee will meet in a regular way to plan the actions, to solve the difficulties and evaluate the results. This steeri
|
https://en.wikipedia.org/wiki/OBN%20Television
|
OBN Television (or OBN TV) may refer to:
Televizija OBN
Oceania Broadcasting Network
|
https://en.wikipedia.org/wiki/Sendai%20Airport%20Line
|
The is an airport rail link service connecting Sendai Airport to Sendai, Miyagi, Japan. Rail service began on March 18, 2007.
Data
The third-sector Sendai Airport Transit Co., Ltd. (SAT) started construction of the line in 2002. The construction cost is expected to reach 34.9 billion yen, and it may take as long as thirty years before the railway turns a profit.
Route: Natori Station – Sendai Airport Station
Length: 7.1 km
Gauge:
Number of stations: 4, including terminals
Multiple-track sections: Single-track except for passing loop at Mitazono Station
Electrification: 20,000 V AC
Block system: Special automatic blocking (planned)
Rolling stock: JR E721-500 and SAT721 series 2-car EMUs
Station list
Rolling stock
SAT has ordered six 2-car SAT721 trainsets which are used in conjunction with similar design JR E721-500 series sets. The stainless-steel bodied trains feature barrier-free design and have a top speed of 120 km/h. LED indicators show the stations and destination. Train interior and exterior announcements are given in Japanese and English.
Connections
From Natori Station, service extends via the Tōhoku Main Line tracks to Sendai Station, a stop for the Tōhoku Shinkansen express trains located in central Sendai. From Sendai Station, it takes 17 minutes (rapid service) or 25 minutes (local service) to get to the airport. The railway also has advertised that Sendai Airport can be reached from neighboring cities such as Fukushima and Ichinoseki in under one hour.
Trains can be up to six cars in length. Besides being faster than existing bus services from the city, with a fare of 400 yen from Natori Station, or 650 yen from Sendai Station, the rail service is also less expensive.
Sendai Airport Transit
is a third-sector company in charge of constructing and running the Sendai Airport Line train service between Sendai Airport Station and Natori Station in Miyagi Prefecture, Japan.
History
The company was founded on April 7, 2000, and has capital of over seven billion yen. The Sendai Airport Line opened on March 18, 2007, electrified at 20 kV AC. The line was severely damaged by the 2011 Tōhoku earthquake and tsunami, and service was suspended indefinitely from March 11, 2011, and reopened on October 1 of that year.
Rolling stock
The company owns three two-car SAT721 series EMU trains (identical in design to the JR East E721-500 series sets)
References
External links
Sendai Airport Transit website
SAT from Sendai airport to Sendai Stn. (how-to movies on transportation in Sendai)
SAT from Sendai Stn. to Sendai airport (how-to movies on transportation in Sendai)
Railway lines in Japan
Rail transport in Miyagi Prefecture
Airport rail links in Japan
Railway lines opened in 2007
1067 mm gauge railways in Japan
Japanese third-sector railway lines
2007 establishments in Japan
Railway companies of Japan
Railway companies established in 2000
|
https://en.wikipedia.org/wiki/Gottesman%E2%80%93Knill%20theorem
|
In quantum computing, the Gottesman–Knill theorem is a theoretical result by Daniel Gottesman and Emanuel Knill that states that stabilizer circuits, circuits that only consist of gates from the normalizer of the qubit Pauli group, also called Clifford group, can be perfectly simulated in polynomial time on a probabilistic classical computer. The Clifford group can be generated solely by using CNOT, Hadamard, and phase gate S; and therefore stabilizer circuits can be constructed using only these gates.
The reason for the speed up of quantum computers is not yet fully understood. The theorem proves that, for all quantum algorithms with a speed up that relies on entanglement which can be achieved with a CNOT and a Hadamard gate to produce entangled states, this kind of entanglement alone does not give any computing advantage.
There exists a more efficient simulation of stabilizer circuits than the construction of the original publication with an implementation.
The Gottesman–Knill theorem was published in a single author paper by Gottesman in which he credits Knill with the result through private communication.
Formal statement
Theorem: A quantum circuit using only the following elements can be simulated efficiently on a classical computer:
Preparation of qubits in computational basis states,
Clifford gates (Hadamard gates, controlled NOT gates, phase gate S ), and
Measurements in the computational basis.
The Gottesman–Knill theorem shows that even some highly entangled states can be simulated efficiently. Several important types of quantum algorithms use only Clifford gates, most importantly the standard algorithms for entanglement distillation and for quantum error correction. From a practical point of view, stabilizer circuits have been simulated in time using the graph state formalism.
See also
Magic state distillation
References
Quantum information science
|
https://en.wikipedia.org/wiki/Micro-operation
|
In computer central processing units, micro-operations (also known as micro-ops or μops, historically also as micro-actions) are detailed low-level instructions used in some designs to implement complex machine instructions (sometimes termed macro-instructions in this context).
Usually, micro-operations perform basic operations on data stored in one or more registers, including transferring data between registers or between registers and external buses of the central processing unit (CPU), and performing arithmetic or logical operations on registers. In a typical fetch-decode-execute cycle, each step of a macro-instruction is decomposed during its execution so the CPU determines and steps through a series of micro-operations. The execution of micro-operations is performed under control of the CPU's control unit, which decides on their execution while performing various optimizations such as reordering, fusion and caching.
Optimizations
Various forms of μops have long been the basis for traditional microcode routines used to simplify the implementation of a particular CPU design or perhaps just the sequencing of certain multi-step operations or addressing modes. More recently, μops have also been employed in a different way in order to let modern CISC processors more easily handle asynchronous parallel and speculative execution: As with traditional microcode, one or more table lookups (or equivalent) is done to locate the appropriate μop-sequence based on the encoding and semantics of the machine instruction (the decoding or translation step), however, instead of having rigid μop-sequences controlling the CPU directly from a microcode-ROM, μops are here dynamically buffered for rescheduling before being executed.
This buffering means that the fetch and decode stages can be more detached from the execution units than is feasible in a more traditional microcoded (or hard-wired) design. As this allows a degree of freedom regarding execution order, it makes some extraction of instruction-level parallelism out of a normal single-threaded program possible (provided that dependencies are checked, etc.). It opens up for more analysis and therefore also for reordering of code sequences in order to dynamically optimize mapping and scheduling of μops onto machine resources (such as ALUs, load/store units, etc.). As this happens on the μop-level, sub-operations of different machine (macro) instructions may often intermix in a particular μop-sequence, forming partially reordered machine instructions as a direct consequence of the out-of-order dispatching of microinstructions from several macro instructions. However, this is not the same as the micro-op fusion, which aims at the fact that a more complex microinstruction may replace a few simpler microinstructions in certain cases, typically in order to minimize state changes and usage of the queue and re-order buffer space, therefore reducing power consumption. Micro-op fusion is used in some modern CPU
|
https://en.wikipedia.org/wiki/Metalink
|
Metalink is an extensible metadata file format that describes one or more computer files available for download. It specifies files appropriate for the user's language and operating system; facilitates file verification and recovery from data corruption; and lists alternate download sources (mirror URIs).
The metadata is encoded in HTTP header fields and/or in an XML file with extension or . The duplicate download locations provide reliability in case one method fails. Some clients also achieve faster download speeds by allowing different chunks/segments of each file to be downloaded from multiple resources at the same time (segmented downloading).
Metalink supports listing multiple partial and full file hashes along with PGP signatures. Most clients only support verifying MD5, SHA-1, and SHA-256, however. Besides FTP and HTTP mirror locations and rsync, it also supports listing the P2P methods BitTorrent, ed2k, magnet link or any other that uses a URI.
Development history
Metalink 3.0 was publicly released in 2005. It was designed to aid in downloading Linux ISO images and other large files on release day, when servers would be overloaded (each server would have to be tried manually) and to repair large downloads by replacing only the parts with errors instead of fully re-downloading them. It was initially adopted by download managers, and was used by open source projects such as OpenOffice.org and Linux distributions. A community developed around it, more download programs supported it (including proprietary ones) and it saw commercial adoption. In 2008, the community took their work to the Internet Engineering Task Force which resulted in Metalink 4.0 in 2010, described in a Standards Track RFC. Metalink 3.0 (with the extension ) and Metalink 4.0 (with the extension ) are incompatible because they have a slightly different format. In 2011, another Standards Track RFC described Metalink in HTTP header fields.
Client programs
Client libraries
libmetalink (MIT License) is a Metalink library written in C. It provides the parsing of Metalink XML files to programs written in C and uses Expat (library) or libxml2. It does not handle the actual downloading of files. It is used by cURL and other client programs.
metalink-checker (GPL) is a command line downloader written in Python that supports multi-source downloads and chunk checksums, as well as checking mirrors. It can also be used as a Python library.
In use
Mandriva Linux has integrated Metalink into package management with urpmi and aria2.
Fedora has integrated Metalink into package management with yum. openSUSE has integrated Metalink into package management with ZYpp and aria2.
Wubi, the Windows-based Ubuntu installer, uses Metadl (LGPL) to download Ubuntu ISO images and takes advantage of Metalink's features of higher availability and increased reliability. If there are errors in the download, they are repaired, instead of restarting the large download.
Appupdater (GPL) for Wind
|
https://en.wikipedia.org/wiki/Inauthentic%20text
|
An inauthentic text is a computer-generated expository document meant to appear as genuine, but which is actually meaningless. Frequently they are created in order to be intermixed with genuine documents and thus manipulate the results of search engines, as with Spam blogs. They are also carried along in email in order to fool spam filters by giving the spam the superficial characteristics of legitimate text.
Sometimes nonsensical documents are created with computer assistance for humorous effect, as with Dissociated press or Flarf poetry. They have also been used to challenge the veracity of a publication—MIT students submitted papers generated by a computer program called SCIgen to a conference, where they were initially accepted. This led the students to claim that the bar for submissions was too low.
With the amount of computer generated text outpacing the ability of people to humans to curate it, there needs some means of distinguishing between the two. Yet automated approaches to determining absolutely whether a text is authentic or not face intrinsic challenges of semantics. Noam Chomsky coined the phrase "Colorless green ideas sleep furiously" giving an example of grammatically-correct, but semantically incoherent sentence; some will point out that in certain contexts one could give this sentence (or any phrase) meaning.
The first group to use the expression in this regard can be found below from Indiana University. Their work explains in detail an attempt to detect inauthentic texts and identify pernicious problems of inauthentic texts in cyberspace. The site has a means of submitting text that assesses, based on supervised learning, whether a corpus is inauthentic or not. Many users have submitted incorrect types of data and have correspondingly commented on the scores. This application is meant for a specific kind of data; therefore, submitting, say, an email, will not return a meaningful score.
See also
Scraper site
Spamdexing
Stochastic parrot
External links
An Inauthentic Paper Detector from Indiana University School of Informatics
Scientific misconduct
Machine learning
Semantics
Fraud
|
https://en.wikipedia.org/wiki/Jarkko%20Kari
|
Jarkko J. Kari is a Finnish mathematician and computer scientist, known for his contributions to the theory of Wang tiles and cellular automata. Kari is currently a professor at the Department of Mathematics, University of Turku.
Biography
Kari received his Ph.D. in 1990 from the University of Turku; his dissertation, supervised by Arto Salomaa.
He married Lila Kari, a later mathematics student at Turku; they divorced, and afterwards Lila Kari became a professor of computer science at the University of Western Ontario in Canada.
Research
Wang tiles are unit squares with colored markings on each side; they may be used to tesselate the plane, but only with tiles that have matching colors on adjoining edges. The problem of determining whether a set of Wang tiles forms a valid tessellation is undecidable, and its undecidability rests on finding sets of Wang tiles that can only tesselate the plane aperiodically, in such a way that no translation of the plane is a symmetry of the tiling. The first set of aperiodic Wang tiles found, by Robert Berger, had over 20,000 different tiles in it. Kari reduced the size of this set to only 14, by finding a set of tiles that (when used to tile the plane) simulates the construction of a Beatty sequence by Mealy machines. The same approach was later shown to lead to aperiodic sets of 13 tiles, the minimum known. Kari has also shown that the Wang tiling problem remains undecidable in the hyperbolic plane, and has discovered sets of Wang tiles with additional mathematical properties.
Kari has also used the Wang tiling problem as the basis of proofs that several algorithmic problems in the theory of cellular automata are undecidable. In particular, in his thesis research, he showed that it is undecidable to determine whether a given cellular automaton rule in two or more dimensions is reversible. For one-dimensional cellular automata, reversibility is known to be decidable, and Kari has provided tight bounds on the size of the neighborhood needed to simulate the reverse dynamics of reversible one-dimensional automata.
References
External links
Jarkko Kari's personal homepage
Cellular automatists
Finnish computer scientists
Finnish mathematicians
Living people
Year of birth missing (living people)
Vaisala Prize Laureates
|
https://en.wikipedia.org/wiki/Enterprise%20Distributed%20Object%20Computing
|
The UML profile for Enterprise Distributed Object Computing (EDOC) is a standard of the Object Management Group in support of open distributed computing using model-driven architecture and service-oriented architecture. Its aim is to simplify the development of component based (EDOC) systems by providing a UML-based modeling framework conforming to the MDA of the OMG.
The basis of EDOC is the Enterprise Collaboration Architecture, ECA, meta model that defines how roles interact within communities in the performance of collaborative business processes.
The seven EDOC specifications
EDOC is composed of seven specifications:
The Enterprise Collaboration Architecture, ECA
The Metamodel and UML Profile for Java and EJB
The Flow Composition Model, FCM
The UML Profile for Patterns
The UML Profile for ECA
The UML Profile for Meta Object Facility
The UML Profile for Relationships
See also
Model Driven Engineering (MDE)
Model-driven architecture (MDA)
Meta-model
Meta-modeling
Meta-Object Facility (MOF)
Unified Modeling Language (UML)
External links
OMG EDOC Standard at the Internet Archive
Unified Modeling Language
Year of introduction missing
|
https://en.wikipedia.org/wiki/Package%20format
|
A package format is a type of archive containing computer programs and additional metadata needed by package managers. While the archive file format itself may be unchanged, package formats bear additional metadata, such as a manifest file or certain directory layouts. Packages may contain either source code or executable files.
Packages may be converted from one type to another with software such as Alien.
Common formats
Specialized formats
Generic formats
Arch Linux's Pacman and Slackware use Tar archives with generic naming but specific internal structures.
References
Package management systems
|
https://en.wikipedia.org/wiki/Watson%20Systems
|
Watson Systems AG, established in Switzerland, founded by media developer and investor Norbert Schulz, Hamburg, produces "talking" shopping carts. The company developed and produced a worldwide database- and Internet-based audio advertising system for supermarkets and shopping centres.
External links
Watson Systems AG
Manufacturing companies of Switzerland
|
https://en.wikipedia.org/wiki/Fragment%20%28computer%20graphics%29
|
In computer graphics, a fragment is the data necessary to generate a single pixel's worth of a drawing primitive in the frame buffer.
This data may include, but is not limited to:
raster position
depth
interpolated attributes (color, texture coordinates, etc.)
stencil
alpha
window ID
As a scene is drawn, drawing primitives (the basic elements of graphics output, such as points, lines, circles, text etc.) are rasterized into fragments which are textured and combined with the existing frame buffer. How a fragment is combined with the data already in the frame buffer depends on various settings. In a typical case, a fragment may be discarded if it is farther away than the pixel that is already at that location (according to the depth buffer). If it is nearer than the existing pixel, it may replace what is already there, or, if alpha blending is in use, the pixel's color may be replaced with a mixture of the fragment's color and the pixel's existing color, as in the case of drawing a translucent object.
In general, a fragment can be thought of as the data needed to shade the pixel, plus the data needed to test whether the fragment survives to become a pixel (depth, alpha, stencil, scissor, window ID, etc.).
In computer graphics, a fragment is not necessarily opaque, and could contain an alpha value specifying its degree of transparency. The alpha is typically normalized to the range of [0, 1], with 0 denotes totally transparent and 1 denotes totally opaque. If the fragment is not totally opaque, then part of its background object could show through, which is known as alpha blending.
See also
Graphics pipeline
Vertex
References
Computer graphics
|
https://en.wikipedia.org/wiki/Fragment
|
Fragment(s) may refer to:
Computing
Fragment (computer graphics), all the data necessary to generate a pixel in the frame buffer
Fragment (logic), a syntactically restricted subset of a logical language
URI fragment, the component of a URL following the "#" that identifies a portion of a larger document
Film and television
Fragments (film), or Winged Creatures, a 2008 American film
Fragments: Chronicle of a Vanishing, a 1991 Croatian film
"The Fragment" (Dynasty), a 1982 TV episode
"Fragments" (Sanctuary), a 2009 TV episode
"Fragments" (Steven Universe Future), a 2020 TV episode
"Fragments" (Torchwood), a 2008 TV episode
Literature and writing
Literary fragment, a brief or unfinished work of prose
Manuscript fragment, a remnant of a handwritten book
Sentence fragment, a sentence not containing a subject or a predicate
Fragment (novel), a 2009 novel by Warren Fahy
Fragments (novel), a 2013 novel by Dan Wells
Fragments (magazine), an 1881–1916 Russian humor, literature, and art magazine
Fragments: Memories of a Wartime Childhood, a 1995 fictional memoir of Holocaust survival by Binjamin Wilkomirski
Fragments, a 1993 play by Edward Albee
Music
Albums
Fragments (Bonobo album), 2022
Fragments (Paul Bley album), 1987
The Bootleg Series Vol. 17: Fragments – Time Out of Mind Sessions (1996–1997), by Bob Dylan, 2023
Fragments, by Jakob Sveistrup, 2006
Fragments (EP), by Rapids!, 2011
Fragments, an EP by Chipzel, 2012
Fragments, an EP by Clara Benin, 2020
Songs
"Fragments" (song), by Jack Johnson, 2017
"Fragment", by haloblack from Funkyhell, 1996
"Fragments", by Blondie from Pollinator, 2017
"Fragments", by the Who from Endless Wire, 2006
"Fragments", by Yeule from Glitch Princess, 2022
Other uses
.hack//frägment, an online and offline RPG from the .hack video game series
Fragments Collection, a 2005–2012 sculpture series by Blake Ward
See also
Fragmentation (disambiguation)
Part (disambiguation)
Splinter (disambiguation)
|
https://en.wikipedia.org/wiki/Biogradska%20Gora
|
Biogradska Gora (, ) is a forest and a national park in Montenegro within the Kolašin municipality. One of the UNESCO World Network of Biosphere Reserves. The landscape is one of mountain ridges, glacial lakes, and temperate forest.
Location
Biogradska Gora is located in the mountainous region of Bjelasica in the central part of Montenegro between the rivers Tara and Lim, and is surrounded by three municipalities: Kolašin, Berane and Mojkovac. It is the most northeasterly of the five national parks in Montenegro.
Biogradska Gora National Park
The National Park is 54 km² in area. Basic elements of the Park are: untouched forest, large mountain slopes and tops over 2,000 meters high, six glacial lakes, five at an altitude of 1,820 meters and one easy accessible low land lake (Šiško, Mali Šiško, Ursulovačko, Pešica, and Ševarina) located at the very entrance to the park, Biogradsko Lake.
Swift streams cut through scenery of Biogradska Gora, green pastures and clear lakes reflecting centennial forests. The Park is renowned as a unique geomorphological region and, as such, it is attractive for scientific research. The seat of the park is in Kolašin. The national park abounds in cultural and historic heritage consisting of sacral monuments national building and archeological localities. Numerous authentic buildings of traditional architecture are found throughout the pastures and villages next to the virgin forest reserve on the Bjelasica mountain range.
Exploring the park
The park, between Mojkovac and Kolasin, is accessible by car via Highway E65 or by bus from Podgorica or Bijelo Polje. The park has developed infrastructure for tourists, including a visitors center, hiking trails, campsites, and a restaurant. Visitors have several options in addition to hiking, mountain biking, swimming, fishing and exploring some areas with their four-wheel drive vehicles. An open-air train takes tourists along a 3.5 km track from the entrance of the park to Lake Biograd where row boats and bicycles are available for rent. The visitor centre is nearby featuring traditional furniture from this region and a restaurant and lookout. Three other lookouts are available at higher elevations at various locations within the park: Crna Glava, Zekova Glava, and Bendovac. Used by shepherds as summer homes in the past, the wooden cottages or "katuns" along the trails can be rented for overnight stays for "traditional, rustic food and lifestyle", according to one source. Overnight camping is also allowed in the park.
Ecology
Although it is the one of smallest of five national parks in Montenegro, Biogradska Gora National Park contains great diversity of flora and fauna. There are 26 different habitats of plants with 220 different plants, 150 species of birds, and 10 species of mammals live in this Park and in its forest, there are 86 species of trees and shrubs. In the waters of the park exist three species of trout and 350 species of insects. Rainfall is extremely hi
|
https://en.wikipedia.org/wiki/WCOV-TV
|
WCOV-TV (channel 20) is a television station in Montgomery, Alabama, United States, affiliated with the Fox network. It is owned by Allen Media Broadcasting alongside Troy-licensed Cozi TV affiliate WIYC (channel 48) and low-power local weather station WALE-LD (channel 17). The stations share studios on WCOV Avenue in the Normandale section of Montgomery, while WCOV-TV's transmitter is located southeast of Grady along the Montgomery–Crenshaw county line.
WCOV-TV was the first television station to be built in Montgomery, beginning broadcasting on April 17, 1953. It was an affiliate of CBS; however, it was on the new ultra high frequency (UHF) band. When Montgomery's allocated very high frequency (VHF) station, WSFA-TV, began in late 1954, it immediately came to dominate the Montgomery market. WCOV owners attempted to have the playing field leveled by proposing either a move of WSFA-TV to UHF or of WCOV-TV to VHF, but neither was approved. In 1964, Gay-Bell Broadcasting acquired WCOV-TV and its associated radio stations; seeking to bolster its position, it attempted to buy WSLA, a VHF station in Selma and another CBS affiliate, but no sale ever materialized.
In 1985, WSLA changed its call sign to WAKA and added Montgomery to its coverage area. Despite prior reassurances from CBS, the network informed WCOV-TV that it would discontinue its affiliation with channel 20. Gay-Bell sold the station to Woods Communications, which operated it as an independent station and discontinued its local newscasts before adding the new Fox network in October 1986. The station initially struggled before Fox programming attracted significant ratings. A 1996 tornado destroyed the tower from which the station broadcast in Montgomery; WCOV-TV did not return to full power until the next year.
Allen Media acquired WCOV-TV, WIYC, and WALE-LD in 2023 from Woods Communications. The station airs a 9 p.m. local newscast produced by WAKA.
History
Early years
On December 31, 1951, the owners of radio station WCOV (1170 AM)—the First National Bank of Montgomery and the estate of G. W. Covington, Jr.—filed an application with the Federal Communications Commission (FCC) for a new television station on very high frequency (VHF) channel 12 in Montgomery. Six months later, after the commission lifted its freeze on television applications, WCOV amended its application to specify channel 20 in the new ultra high frequency (UHF) band—to the surprise of others—after radio station WSFA also filed for channel 12. The FCC granted the Covington interests—which had reorganized as the Capitol Broadcasting Company—a construction permit on September 17, 1952. Later, WCOV-TV would claim that it was forced to apply for channel 20 when it learned RCA could not deliver a VHF transmitter, but had a UHF transmitter on hand.
WCOV-TV was the first television station in Montgomery, making its first broadcast on April 17, 1953. It operated from a tower near its studios. Commercial programs started f
|
https://en.wikipedia.org/wiki/Censo%20Econ%C3%B3mico
|
The Censo Económico, or National Economic Census, is an exhaustive survey and census that presents economic data of every economic unit in Mexico. It covers the extractive and transformation industries, manufacturing sector, construction, commerce, transport and communication, and services. It only excludes agriculture, forestry, and hunting. It is carried out by Mexico's national statistics body INEGI (Instituto Nacional de Estadística, Geografía e Informática), and information has been collected approximately every five years since 1930.
The national economic censuses of 1999 and 2004 are based on the North American Industry Classification System (NAIC), also used by Statistics Canada and the Economic Classification Policy Committee of the United States. The NAIC is a unique industrial classification system that groups economic activities based on a criterion of similitude in their production process.
The dataset contains aggregate data about production, gross value, number of employees, sales, costs, labour, value of physical assets, depreciation of physical assets, and financial assets. The highest geographical disaggregation of data is at municipal level.
References
National Institute of Statistics and Geography
Censuses in Mexico
Economy of Mexico
|
https://en.wikipedia.org/wiki/UDN
|
UDN can stand for:
National Democratic Union (Brazil) (União Democrática Nacional),a political party that existed in Brazil between 1945 and 1965
Univision Deportes Network, a Spanish-language sports channel in the United States
Ulcerative dermal necrosis, a disease of salmon and trout
United Daily News, a Taiwanese newspaper
IATA airport code for Codroipo civil airport in Italy
Unique Device Name of the UPnP Device Architecture
Undiagnosed Diseases Network, an NIH-funded study of intractable medical conditions that have eluded diagnosis
University of Da Nang, a public university system in Vietnam
|
https://en.wikipedia.org/wiki/Memory%20latency
|
Memory latency is the time (the latency) between initiating a request for a byte or word in memory until it is retrieved by a processor. If the data are not in the processor's cache, it takes longer to obtain them, as the processor will have to communicate with the external memory cells. Latency is therefore a fundamental measure of the speed of memory: the less the latency, the faster the reading operation.
Latency should not be confused with memory bandwidth, which measures the throughput of memory. Latency can be expressed in clock cycles or in time measured in nanoseconds. Over time, memory latencies expressed in clock cycles have been fairly stable, but they have improved in time.
See also
Burst mode (computing)
CAS latency
Multi-channel memory architecture
Interleaved memory
SDRAM burst ordering
SDRAM latency
References
External links
Overview of the different kinds of Memory Latency
Article and Analogy of the Effects of Memory Latency
Computer memory
ar:كمون ذاكرة
el:Λανθάνων χρόνος προσπέλασης μνήμης
he:זמן אחזור
hu:Memóriakésleltetés
ru:Тайминги
|
https://en.wikipedia.org/wiki/Self-advocacy
|
Self-advocacy is the act of speaking up for oneself and one's interests. It is used as a name for civil rights movements and mutual aid networks for people with intellectual and developmental disabilities. The term arose in the broader civil rights movements of the 1960s and 1970s, and is part of the disability rights movement. Today there are self-advocacy organizations across the world.
History
Founding of the movement
The self advocacy movement began in the late 1960s. Before this, most organizations were run by parents of children with developmental disabilities, such as the March of Dimes, which began in the 1950s. The first self advocacy group originated in Sweden in the late 1960s where Dr. Bengt Nirje organized a club where people with disabilities and without could meet up, decide where they wanted to go, go on an outing and then meet to discuss their experiences. Nirje wanted to provide people with disabilities "normal" experiences in the community. Previously at this time, people with developmental disabilities were not considered able to make any decisions, including about where they wanted to go, and this program indicated a drastic departure. Nirje believed that people with developmental disabilities should be allowed to make decisions, and crucially also allowed to make mistakes, saying "To be allowed to be human means to be allowed to fail." This concept is called the dignity of risk and remains one of the central values of the self advocacy movement. In 1968, a conference was held in Sweden as part of the normalization model where people with intellectual and developmental disabilities came together to discuss their lives, their opinions and their hopes. In 1969, the first ever training was held to teach adults with developmental disabilities how to advocate for themselves politically. One man at the training said, "...I would like to organize because I know how much our comrades at the institutional schools need help to be more respected."
In 1969, Nirje presented about these achievements to the 11th World Congress of the International Society for Rehabilitation of the Disabled, saying "This is akin to any decent revolt. Some of the retarded adults themselves definitely want to play a new role in society, to create a new image of themselves in their own eyes, in the eyes of their parents and in the eyes of the general public This struggle for respect and independence is always the normal way to obtain personal dignity and a sense of liberty and equality."
After this, other countries started to plan self advocacy conferences. England held its first self advocacy conference in 1972 and Canada in 1973. In the United States, self advocates from Oregon and Washington planned their own conference held in 1974. At a meeting to plan the conference, one man, argued against the label of "mentally retarded" saying "I want to be known as a person first!" The self advocates chose People First as a name for the conferences.
Self advocate
|
https://en.wikipedia.org/wiki/Orange%20UK
|
Orange UK was a mobile network operator and internet service provider in the United Kingdom, launched in 1994. It was once a constituent of the FTSE 100 Index but was purchased by France Télécom (now Orange S.A.) in 2000, which then adopted the Orange brand for all its other mobile communications activities. Orange UK merged with Deutsche Telekom's T-Mobile UK to form a joint venture, EE in 2010. EE continued to operate the Orange brand until February 2015, when new connections and upgrades on Orange tariffs were withdrawn. Existing Orange customers could continue on their plans until March 2019.
History
Background: 1990–1994
The inception of the Orange brand occurred in 1990 in the United Kingdom with the formation of Microtel Communications Ltd, a consortium initially formed by Pactel Corporation (American), British Aerospace, Millicom and Matra (French); and later wholly owned by BAe. In July 1991, the Hong Kong-based conglomerate Hutchison Whampoa, through a stock swap deal with BAe, acquired a controlling stake of 65% in Microtel, who by then had won a license to develop a personal communications network in the United Kingdom. As part of the deal, BAe gained a 30% stake in Hutchison Telecommunications (UK) Ltd.
Launch of Orange and expansion: 1994–1999
Hutchison renamed Microtel to Orange Personal Communications Services Ltd on 28 March 1994; and on 28 April 1994, the Orange 1800 MHz GSM network was launched. The Orange brand, at the time an unusual name for a telecommunications firm, was created by a team at Microtel led by Chris Moss (marketing director) and supported by Martin Keogh, Rob Furness and Ian Pond. The brand consultancy Wolff Olins was charged with designing the brand values and logo, and advertising agency WCRS created the slogan "The future's bright, the future's Orange". The team that launched Orange in the UK was led by Malcolm Way, and later Hans Snook who became the chief executive.
A holding company structure was adopted in 1995 with the establishment of Orange plc. In April 1996, Orange went public and floated on the London Stock Exchange and NASDAQ, majority owned by Hutchison (48.22%), followed by BAe (21.1%). In June 1996, it became the youngest company to enter the FTSE 100, valued at £2.4 billion. By July 1997 Orange had gained one million customers.
Acquisition of Orange and part of France Télécom: 1999–2009
The stint as a public company came to an end in October 1999, when it was acquired for US$33 billion by the German conglomerate Mannesmann AG. Mannesmann's acquisition of Orange triggered Vodafone to make a hostile takeover bid for the German company. Shortly thereafter, in February 2000, Vodafone acquired Mannesmann for US$183bn and divested Orange, as EU regulations would not allow it to hold two mobile licences. In May 2000, France Télécom announced the acquisition of the global operations of Orange from Vodafone for US$37bn, and the transaction was completed in August 2000.
France Télécom subseq
|
https://en.wikipedia.org/wiki/Myra%20Wilson
|
Myra S. Wilson is a British computer scientist. She is a senior lecturer in computer science at Aberystwyth University, Wales. Her research interests are in the broad area of robotics, and she also teaches in the field.
Education and research
Myra S. Wilson received the B.Sc. degree from Aberdeen University, Aberdeen, U.K., and the Ph.D. degree in computer science from the University of Edinburgh, Scotland, U.K.
She heads the Intelligent Robotics Group, as well as the Biologically Inspired Robotics Network (biro-net). Her interests include adaptive robotics and biologically inspired systems.
Media work
She was a judge on the BBC television robot combat programme Robot Wars for the fourth and fifth series in 2000–2001.
Selected publications
Walker, Joanne, Simon Garrett, and Myra Wilson. "Evolving controllers for real robots: A survey of the literature." Adaptive Behavior 11.3 (2003): 179-203.
J. H. Walker, S. M. Garrett and M. S. Wilson, "The balance between initial training and lifelong adaptation in evolving robot controllers," in IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics, vol. 36, no. 2, pp. 423–432, April 2006, doi: 10.1109/TSMCB.2005.859082.
Giagkos, Alexandros, and Myra S. Wilson. "BeeIP: Bee-inspired protocol for routing in mobile ad-hoc networks." International Conference on Simulation of Adaptive Behavior. Springer, Berlin, Heidelberg, 2010.
Burbidge, Robert, and Myra S. Wilson. "Vector-valued function estimation by grammatical evolution for autonomous robot control." Information Sciences 258 (2014): 182-199.
Giagkos, Alexandros, et al. "UAV flight coordination for communication networks: genetic algorithms versus game theory." Soft computing 25.14 (2021): 9483-9503.
References
British computer scientists
British women computer scientists
Academics of Aberystwyth University
Living people
Year of birth missing (living people)
Alumni of the University of Edinburgh
|
https://en.wikipedia.org/wiki/Embedded%20Compact%20Extended
|
Embedded Compact Extended (ECX) is a small form factor Single Board Computer specification set out by Intel. ECX boards measure 105mm x 146mm.
The small size of the board gives it application in portable medical imaging devices and in-vehicle infotainment systems.
References
Single-board computers
|
https://en.wikipedia.org/wiki/Convenience%20function
|
A convenience function is a non-essential subroutine in a programming library or framework which is intended to ease commonly performed tasks. These convenience functions may be added arbitrarily based on the creator's perception of what these menial tasks will be, or they may be the result of a process of refactoring by the developers and community feedback on what could be made into a convenience function. A convenience function's task may almost always be expressed in terms of other operations, though this will likely have increased verbiage and reduced abstraction and possibly maintainability. From this perspective, any programming language above assembly language is a 'convenience language' to avoid writing machine code.
Subroutines
|
https://en.wikipedia.org/wiki/Dependency%20graph
|
In mathematics, computer science and digital electronics, a dependency graph is a directed graph representing dependencies of several objects towards each other. It is possible to derive an evaluation order or the absence of an evaluation order that respects the given dependencies from the dependency graph.
Definition
Given a set of objects and a transitive relation with modeling a dependency "a depends on b" ("a needs b evaluated first"), the dependency graph is a graph with the transitive reduction of R.
For example, assume a simple calculator. This calculator supports assignment of constant values to variables and assigning the sum of exactly two variables to a third variable. Given several equations like "A = B+C; B = 5+D; C=4; D=2;", then and . You can derive this relation directly: A depends on B and C, because you can add two variables if and only if you know the values of both variables. Thus, B must be calculated before A can be calculated. However, the values of C and D are known immediately, because they are number literals.
Recognizing impossible evaluations
In a dependency graph, the cycles of dependencies (also called circular dependencies) lead to a situation in which no valid evaluation order exists, because none of the objects in the cycle may be evaluated first. If a dependency graph does not have any circular dependencies, it forms a directed acyclic graph, and an evaluation order may be found by topological sorting. Most topological sorting algorithms are also capable of detecting cycles in their inputs; however, it may be desirable to perform cycle detection separately from topological sorting in order to provide appropriate handling for the detected cycles.
Assume the simple calculator from before. The equation system "A=B; B=D+C; C=D+A; D=12;" contains a circular dependency formed by A, B and C, as B must be evaluated before A, C must be evaluated before B, and A must be evaluated before C.
Deriving an evaluation order
A correct evaluation order is a numbering of the objects that form the nodes of the dependency graph so that the following equation holds: with . This means, if the numbering orders two elements and so that will be evaluated before , then must not depend on .
There can be more than one correct evaluation order. In fact, a correct numbering is a topological order, and any topological order is a correct numbering. Thus, any algorithm that derives a correct topological order derives a correct evaluation order.
Assume the simple calculator from above once more. Given the equation system "A = B+C; B = 5+D; C=4; D=2;", a correct evaluation order would be (D, C, B, A). However, (C, D, B, A) is a correct evaluation order as well.
Monoid structure
An acyclic dependency graph corresponds to a trace of a trace monoid as follows:
A function labels each vertex with a symbol from the alphabet
There is an edge or if and only if is in the dependency relation .
Two graphs are considered to be
|
https://en.wikipedia.org/wiki/Efferent%20coupling
|
Efferent coupling is a coupling metric in software development. It measures the number of data types a class knows about.
This includes inheritance, interface implementation, parameter types, variable types, and exceptions.
This has also been referred to by Robert C. Martin as the Fan-out stability metric which in his book Clean Architecture he describes as Outgoing dependencies. This metric identifies the number of classes inside this component that depend on classes outside the component.
This metric is often used to calculate instability of a component in software architecture as I = Fan-out / (Fan-in + Fan-out). This metric has a range [0,1]. I = 0 is maximally stable while I = 1 is maximally unstable.
References
Software metrics
|
https://en.wikipedia.org/wiki/University%20of%20New%20Hampshire%20InterOperability%20Laboratory
|
The University of New Hampshire InterOperability Laboratory (UNH-IOL) is an independent test facility that provides interoperability and standards conformance testing for networking, telecommunications, data storage, and consumer technology products.
Founded in 1988, it employs approximately 25 full-time staff members and over 100 part-time undergraduate and graduate students, and counts over 150 companies as members.
History
The UNH-IOL began as a project of the University's Research Computing Center (RCC). In 1988 the RCC was testing Fiber Distributed Data Interface (FDDI) equipment with the intention of deploying it in its network. The RCC found that equipment from two vendors did not work together and contacted the vendors to find a solution. The two vendors cooperated with the RCC to solve the problem which was caused by differences between the draft and final FDDI specification. During this same time period the RCC was testing 10BASE-T Ethernet interfaces for another project.
The University recognized the need for interoperability testing of networking equipment and also the opportunity to provide students with hands-on experience in emerging technologies. With the idea of providing testing services to companies in a vendor-neutral environment the first UNH-IOL consortium (10BASE-T Ethernet) was founded in 1990.
Over the next decade the UNH-IOL grew to twelve consortia with over 100 member companies. In 2002, having outgrown several smaller locations, the UNH-IOL moved to a 32,000 square foot facility on the outskirts of the UNH campus.
One area in which the UNH-IOL has been influential is IPv6 standardization and deployment. Between 2003 and 2007 the UNH-IOL organized the Moonv6 project, which was a multi-site, IPv6 based network designed to test the interoperability of IPv6 implementations. At the time the Moonv6 project was the largest permanently deployed multi-vendor IPv6 network in the world. The UNH-IOL is also the only North American laboratory offering ISO/IEC 17025 accredited testing designed specifically for the USGv6 Test Program.
The UNH-IOL is also known for organizing and hosting plugfests for a number of industry trade organizations. The lab has hosted plugfests for the Broadband Forum, NVM Express, SCSI Trade Association, Ethernet Alliance, and the Open Compute Project, among others.
In 2013 the UNH-IOL was awarded the IEEE-SA Corporate Award "for outstanding corporate leadership and contribution to IEEE-SA".
In January 2016 the lab moved to a new 28,000 square foot location adjacent to the main UNH campus in Durham, NH.
Consortia
The UNH-IOL operates testing programs on an annual membership basis called consortia. Each consortium is a collaboration between equipment vendors, test equipment manufacturers, industry forums, and the UNH-IOL in a particular technology. The collaborative testing model is intended to distribute the costs associated with maintaining a high-quality testing program among the consortium memb
|
https://en.wikipedia.org/wiki/Brian%20Henderson-Sellers
|
Brian Henderson-Sellers (born January 1951) is an English computer scientist residing in Sydney, Australia, and Professor of Information Systems at the University of Technology Sydney. He is also Director of the Centre for Object Technology and Applications at University of Technology Sydney.
Biography
Henderson-Sellers has received a BSc and A.R.C.S. in Mathematics from the Imperial College London in 1972, a MSc from the Reading University in 1973, and a PhD from Leicester University in 1976.
From 1976 to 1983 he was a lecturer in the Department of Civil Engineering at the University of Salford in England and from 1983 at the department of mathematics. In 1988 he emigrated to Australia and became associate professor in the school of Information Systems at the University of New South Wales. In 1990, he founded the Object-Oriented Special Interest Group of the Australian Computer Society. He is co-founder and leader of the international OPEN Consortium. Currently he is professor of Information Systems at the University of Technology Sydney. He is also Director of the Centre for Object Technology and Applications at University of Technology Sydney.
He is also editor of the International Journal of Agent-Oriented Software Engineering and on the editorial board of the Journal of Object Technology and Software and Systems Modelling and was for many years the Regional Editor of Object-Oriented Systems, a member of the editorial board of Object Magazine/Component Strategies and Object Expert. And he is associate editor of the Enterprise Modelling and Information Systems Architectures journal. Also he is a frequent, invited speaker at international OT conferences.
In July 2001 Henderson-Sellers was awarded a Doctor of Science (DSc) from the University of London for his research contributions in object-oriented methodologies.
Work
His research interests are object-oriented analysis and design, object-oriented metrics, agent-oriented methodologies, and the migration of organizations to object technology.
Object-oriented Process, Environment and Notation
Object-oriented Process, Environment and Notation (OPEN) is a third-generation, public domain, fully object-oriented methodology and process. It encapsulates business issues, quality issues, modelling issues and reuse issues within its end-to-end lifecycle support for software development using the object-oriented paradigm. OPEN provides flexibility. Its metamodel-based framework can be tailored to individual domains or projects taking into account personal skills, organizational culture and requirements peculiar to each industry domain".
Publications
Henderson-Sellers is author of numerous papers including thirty-one books and is well known for his work in object-oriented and agent-oriented software development methodologies and situational method engineering (MOSES, COMMA and OPEN) and in OO metrics. A selection:
1992. Book of object-oriented knowledge : object-oriented analysis, design, and i
|
https://en.wikipedia.org/wiki/Sutte%20Hakkun
|
is a 1997 action puzzle game featuring a character of the same name developed by Indieszero with Nintendo R&D2 and published by Nintendo for the Super Famicom's add-on, the Satellaview, datacasting on November 2, 1997, and three different updates involving new puzzles were released from 1998 to 1999.
Gameplay
Sutte Hakkun falls into the category of a side-scrolling, level-based action puzzle game; a genre best represented by the Lode Runner series. The player controls Hakkun, and attempts to gather the rainbow shards distributed across each level. A level is completed when the player finds all the shards hidden in the level. Levels are arranged simplistically at the start of the game, but become highly complex and difficult near the end. The final goal is to find all the shards hidden in the game.
Hakkun's actions consist of three movements; running to the left or right, jumping, and absorbing or depositing blocks. A combination of these is required to complete each level. The player must restart the level if Hakkun falls into a hole or touches spike traps, but there are no other impediments, such as time limits or enemy characters, towards completing each level. There are also no lives or game over screens, and the more difficult later levels are completed by repeatedly searching the level for the solution to the puzzle. Completion of the game requires a combination of puzzle-solving ability and precise control of Hakkun by the player.
Several types of traps and characters are prepared in each level, some of which help Hakkun, and others which may obstruct his path. The most important of these are the red, blue, and yellow bottles and transparent blocks. Hakkun can suck out colors from each bottle, and insert them into the transparent blocks to make them move in different directions.
Development
In response to the significant decrease in the number of original games presented over Satellaview's "Super Famicom Hour" data broadcast in 1996, Nintendo began the "Monthly Game Event" series in 1997, where a new game would be broadcast each month for the Super Famicom. However, many of these were rereleases of older games, such as Dr. Mario and F-Zero. The intricate puzzles and user-friendly tutorial made Sutte Hakkun considered by most Satellaview consumers in Japan one of the most popular games ever released for the Satellaview. The game was produced by Masayuki Uemura, composed by Akito Nakatsuka, designed by Nobuaki Tanaka, directed by Masayu Nakata, and programmed by Keiji Hara. Software for the Famicom Disk System that the third stage participant of had produced is assumed to be a prototype established by the graduate of Indiezero. This work became the debut work of Indieszero.
Release
Five versions of the game exist; four of which were released over Satellaview, and one in game cartridge format. Of the four games for Satellaview, the event version and BS version 2 were broadcast up until June 2000, when Satellaview service ended permanent
|
https://en.wikipedia.org/wiki/Veeshayne%20Patuwai
|
Veeshayne Patuwai née Armstrong (born 1972) is a New Zealand television presenter, actress, emcee and singer and currently appears on two shows on the Māori Television network, a panelist on Ask Your Auntie and Freestyle, a half-hour fashion magazine show. She is fluent in Te Reo Māori and English and has a son, Hohaia.
She is of Nga Puhi and Ngati Hine descent. She is the youngest of six children and her hometown is Moerewa. She graduated from Bay of Islands College and AUT. In the 1990s she was a disc jockey|Radio DJ on Mai FM 88.6. Her show was Queen of the Night. She gained the job through being a personal assistant. As a radio DJ, she won the Best New Broadcaster award in the 1995 Mobil Radio Awards.
Her acting credits include The Māori Merchant of Venice, where she played Nerissa, earning a nomination for Best Supporting Actress at the 2003 NZ Film and Television Awards, and Jackson's Wharf. She has recently started her own production company, Mad Ave Studios.
She is married to Tamati Patuwai, also an actor of Māori heritage, who appeared in the episodes of Xena: Warrior Princess, Mataku, Mercy Peak, and films such as The Piano.
See also
List of New Zealand television personalities
References
New Zealand television presenters
New Zealand women television presenters
1972 births
Living people
Ngāpuhi people
Ngāti Hine people
People educated at Bay of Islands College
|
https://en.wikipedia.org/wiki/Paranoia%201.0
|
Paranoia: 1.0 (originally One Point O, also known as 1.0, One Point Zero, Version 1.0, and Virus 1.0) is a 2004 cyberpunk dystopian horror mystery written and directed by Jeff Renfroe and Marteinn Thorsson. The film is a Kafkaesque nightmare in which a young computer programmer is an unwitting guinea pig in a corporate experiment to test a new advertising scheme. The film stars Jeremy Sisto and Deborah Unger and features Lance Henriksen, Eugene Byrd, Bruce Payne and Udo Kier.
Plot
A computer programmer and network engineer Simon J. (Jeremy Sisto) begins finding empty plain paper packages in his apartment. Simon goes to great length to try and secure his apartment, but the packages keep appearing. Simon attempts to find out who is leaving the packages. At the same time, Simon, who works in IT, is under pressure to complete a programming project. Simon has also become obsessed with purchasing Nature Fresh brand milk. One of Simon's friends, a courier named Nile (Eugene Byrd), tells Simon that he needs to remedy his social isolation. During his investigation, Simon becomes acquainted with his eccentric neighbours in the block of apartments where he lives. The lifts within the apartment block have ceased working and the corridors are filled with security cameras. Derrick (Udo Kier), who occupies an apartment across the hall from Simon, has developed an artificial intelligence robot head, which Simon finds intriguing. Derrick suggests that the Neighbour (Bruce Payne), who occupies the apartment next to Simon's, may be responsible for the packages. Simon confronts the Neighbour, in the corridor, and asks him whether he has been leaving him packages. The Neighbour, exuding charisma and macho-ness, simply laughs at him.
Simon follows the Neighbour to and from a nightclub. In the nightclub, Simon sees the Neighbour interacting with a number of women, including Trish (Deborah Kara Unger). Trish notices Simon staring at them. On the way home from the nightclub, the Neighbour soon realises that he is being followed and pulls a knife on Simon. When the Neighbour realises who Simon is, he invites him into his apartment for a drink. Before entering his apartment, the Neighbour smashes the security cameras in the corridor. When Simon enters the Neighbour's apartment, he becomes aware that his refrigerator is filled with cans of cola 500. The Neighbour invites Simon to participate in a virtual reality sex-game that he has developed and which features Trish. Simon immerses himself within the virtual reality game. When he exits the game, he finds the Neighbour bleeding and dying. The Neighbour advises him that he had also been receiving packages, before dying. Simon subsequently develops a romantic relationship with Trish. Trish is obsessed with orange juice.
As Simon continues his investigations, a number of other murders begin happening in the building. Simon becomes aware that the other residents are receiving packages too but were keeping quiet. Simon also
|
https://en.wikipedia.org/wiki/Codex%20%28disambiguation%29
|
A codex is a book bound in the modern manner, by joining pages, as opposed to a rolled scroll.
Codex may also refer to:
In computing
Codex Corporation, a Massachusetts tech company later known as Vanguard Managed Solutions
Codex Digital, a high-resolution media recording system
WordPress Codex, a repository and manual for WordPress documentation
OpenAI Codex, an artificial intelligence model generating code from natural language
In education
Stanford CodeX Center, a research center at Stanford University focused on artificial intelligence and law.
In entertainment and media
Codex (Warhammer 40,000), a rules supplement to the tabletop wargame
Codex (novel), by Lev Grossman (2005)
The Codex (novel), by Douglas Preston (2004)
"Codex", song by Pere Ubu from Dub Housing
"Codex", song by Radiohead from The King of Limbs
Codex (TV series), a UK quiz show
Codex, a fictional character from the web series The Guild
Codex: card-time strategy, a card game by David Sirlin (2016)
Other
1983 Code of Canon Law, also known as the Codex Iuris Canonici
Codex (horse) (1977–1984), American racehorse, Preakness Stakes winner
Codex Alimentarius, a collection of internationally recognized standards relating to food
Codex, a warez group
See also
Codec (disambiguation)
|
https://en.wikipedia.org/wiki/Total%20Entertainment%20Network
|
Total Entertainment Network (TEN) was an online gaming service that existed from September 1996 until October 1999. T E Network, Inc., which created and operated the TEN service, was formed from the merger of Optigon Interactive and Outland in June 1995 when they received their first round of venture capital funding from Vinod Khosla, a general partner at Kleiner Perkins Caufield & Byers.
History
Total Entertainment Network was the first online gaming provider to go live. Operating out of San Francisco, the service offered PC game players a place to play DOS and Windows-based games online with and against other players, to chat, to download game-related content, and to compete for high scores and to win tournaments. The service was bundled with many PC games and offered as a subscription service. The games supported on TEN include Duke Nukem 3D, NASCAR Racing Online Series, Quake, Command & Conquer, Panzer General, and Big Red Racing.
Many online games, especially PC games adapted for online game play, require low and consistent latency to play well. It was a major challenge circa 1996 for consumers to find consistent low-latency connections to central servers or to other game players because of the latency intrinsic to dial-up modems and the heavy congestion at the Internet peering points. T E Network, Inc. partnered with Concentric Network Corporation to offer consumers Internet access dial-up numbers that would provide the reliable low latencies they needed to play online games. Concentric optimized their network and their dial-up technology for the TEN service. Concentric also received venture capital financing from Kleiner Perkins Caufield & Byers.
Even with the combined revenues of subscriptions and advertising, TEN remained unprofitable, failing to reach the critical mass numbers of subscribers needed to cover their costs. After the success of Blizzard Entertainment's free Battle.net service for Diablo and their claim that offering online play as a feature of the game boosted retail sales by 10%, PC game publishers started following Blizzard's lead and offering free online game play. This undermined the subscription business model of TEN and their strategy to be the exclusive place to play popular PC games online. As Internet advertising was starting to gain traction, T E Network decided to focus on easy-to-access and easy-to-play browser-based games that would appeal to a broad audience and attract enough unique users to drive an advertising-based business model. T E Network, Inc. became Pogo.com, Inc. to pursue this new strategy.
TEN games
AD&D's Dark Sun Online
Attack Retrieve Capture (ARC)
Big Red Racing
Blood
Command & Conquer
Command & Conquer: Red Alert
Dark Sun Online: Crimson Sands
Deadlock: Planetary Conquest
Diablo
Duke Nukem 3D and add-ons
EF2000
Magic: The Gathering Online
Master of Orion II
Myth
NASCAR Racing Online Series
Necrodome
Panzer General
Quake
Quake 2
Shadow Warrior
Total Annihilation
Twil
|
https://en.wikipedia.org/wiki/SYMPL
|
SYMPL is an obsolete programming language developed by the Control Data Corporation (CDC) for use on the CDC 6000 series computer systems in the 1970s and 1980s. It was based on a subset of CDC's version of JOVIAL, as an alternative to assembly language. A number of important CDC software products were implemented in SYMPL, including compilers, libraries, a full-screen editor, and major subsystems.
SYMPL is a compiled, imperative, and procedural language. Compared to the Fortran of the day, SYMPL supports:
Strong data typing: All variables must be declared before use
Boolean variables
Variable bit width integers (both signed and unsigned)
"Status" (enumerated integer) variables
Data structures - Including "based" dynamically allocated structures
Structured programming constructs
Nested procedures
In-fix "bead" (bit) and character manipulation
A simple macro facility
A distinct feature of SYMPL, also found in JOVIAL tables, is that arrays of multi-item variables can be specified with either a "serial" or "parallel" memory layout. A "serial" layout has array entries following one another in memory as is usual in most computer languages. A "parallel" layout groups each of the individual items within each of the array entries together. For example, if each array entry has items x, y, and z, a parallel layout would group x[0]...x[n] together in memory, followed by y[0]...y[n], and then z[0]...z[n]. This has the effect of potentially speeding up access to all the same items across the array - as they are all contiguous with one another.
Simplifications compared to JOVIAL include: no fixed point data type, no table structures, and no COMPOOL concept. Though in lieu of COMPOOLs, a CDC-specific system text capability allows encapsulation of common data declarations.
External links
Ninety-nine Bottles of Beer program - written in SYMPL
SYMPL coding standard
SYMPL Reference Manual
SYMPL Users Guide
Procedural programming languages
Systems programming languages
Control Data Corporation mainframe software
Programming languages created in the 1970s
|
https://en.wikipedia.org/wiki/Pixel%20%28disambiguation%29
|
A pixel is the base element of a digital image in computer graphics.
Pixel may also refer to:
Technology
Google Pixel, a line of consumer electronics devices that run ChromeOS or the Android operating system, including:
Chromebook Pixel, a touchscreen chromebook laptop from Google
Pixel C, a 2015 Android tablet from Google
Pixel Slate, the 2018 succeeding model
Pixel Tablet
Pixel (smartphone), Android phones
Pixel (1st generation) (2016)
Pixel 2 (2017)
Pixel 3 (2018)
Pixel 3a (2019)
Pixel 4 (2019)
Pixel 4a (2020)
Pixel 5 (2020)
Pixel 5a (2021)
Pixel 6 (2021)
Pixel 6a (2022)
Pixel 7 (2022)
Pixel Watch
Quad (rocket), a VTOL rocket known as Pixel, developed in 2006 by Armadillo Aerospace
Entertainment
Pixels (2010 film), a French animated short
Pixels (2015 film), an American science fiction comedy film starring Adam Sandler based on the 2010 short film
Pixel (band), a Norwegian experimental jazz band
Pixel (board game), a Mensa select board game
Pixel (LazyTown), a fictional character good with technology
Pixel (webcomic), a webcomic written by Chris Dlugosz
Pixel, a fictional cat from Robert A. Heinlein's novel The Cat Who Walks Through Walls
Pixel (game developer), the art name of Daisuke Amaya, creator of the freeware game Cave Story
Pixel (magazine), the Polish magazine dedicated to video games and pop-culture
Other uses
IP Pixel, a Chicago-based interactive advertising agency
A pseudonym for Daisuke Amaya
See also
Tracking pixel, a web bug, a method to track user behavior on web sites
Pixl (disambiguation)
Pixel Art
P1X3L, a Cantopop boy group
|
https://en.wikipedia.org/wiki/Barnsley%20and%20District%20Tramway
|
The Barnsley and District Electric Traction Co was an electric tramway network serving the town of Barnsley, South Yorkshire.
The tramway was a subsidiary of the British Electric Traction and services begun on 31 October 1902. In early 1898, three companies had applied for local tramway systems, the Barnsley Corporation applied in 1900 for a larger network than it finally built. In 1913, the company began to run motor buses to Hoyland and other points, Electric was dropped form the company name in 1919. the Barnsley company changed its name to Yorkshire Traction Co. in 1928 and abandoned tramway operation in 1930.
Ignoring Oxford and Bristol, YTC is the largest bus operator to have originated from a tramway company in England.
The network
The Barnsley electric tramway was a standard gauge line, running from Smithies (near Monk Bretton Colliery) to the south of Barnsley, 2 miles south of the town centre to two termini, at Worsbrough Bridge and Worsbough Dale with a junction at the crossroads of Upper Sheffield Road and Kingwell Road at the Cutting End by the present day Cutting Edge public house. The line ran from the level crossing on Old Mill Lane, down the Barnsley town centre to Sheffield Road and split in two termini down Park Road (Worsbrough) and High Street. At the road junction south of Market Place, the left fork was occupied by the Dearne & District. Both networks were virtually next to each other at this point but never connected.
Extensions
The Barnsley tramway was to be larger than it actually were but the Great Central Railway company refused the passing of tramway tracks of its own network, and prevented authorised lines to be built. One of these lines was to push the tramway away from Barnsley towards Carlton Road to the North. Other extensions were to extend the tramway into a loop on Park Road (Barnsley) in Locke Park and south from Worsborough Bridge down Park Road (Worsbrough) to Hoyland Common, this extension was also blocked by the GCR.
Tram depots
Sheffield Road shed
The shed stood next to the 1920s bus garage of the same company to the south of Barnsley town centre. The shed had four running tracks and an extensive yard. Overhaul workshops were situated to the back of the shed.
At the end of tramway operations the depot became a bus depot exclusively, passing to Stagecoach Yorkshire and finally closing for housing development on 20 October 2008. Demolition work started in April 2009.
Very little of the system survives today apart from a few sawn off overhead wire poles in the cutting of Upper Sheffield Road and the occasional piece of track unearthed during roadworks.
Rolling stock
The Barnsley & District used two types of vehicle:
13 four-wheeled double-deck tramcars.
1 demi-car.
Tram transport in England
Barnsley
Rail transport in South Yorkshire
|
https://en.wikipedia.org/wiki/Head-of-line%20blocking
|
Head-of-line blocking (HOL blocking) in computer networking is a performance-limiting phenomenon that occurs when a line of packets is held up in a queue by a first packet. Examples include input buffered network switches, out-of-order delivery and multiple requests in HTTP pipelining.
Network switches
A switch may be composed of buffered input ports, a switch fabric and buffered output ports. If first-in first-out (FIFO) input buffers are used, only the oldest packet is available for forwarding. If the oldest packet cannot be transmitted due to its target output being busy, then more recent arrivals cannot be forwarded. The output may be busy if there is output contention.
Without HOL blocking, the new arrivals could potentially be forwarded around the stuck oldest packet to their respective destinations. HOL blocking can produce performance-degrading effects in input-buffered systems.
This phenomenon limits the throughput of switches. For FIFO input buffers, a simple model of fixed-sized cells to uniformly distributed destinations, causes the throughput to be limited to 58.6% of the total as the number of links becomes large.
One way to overcome this limitation is by using virtual output queues.
Only switches with input buffering can suffer HOL blocking. With sufficient internal bandwidth, input buffering is unnecessary; all buffering is handled at outputs and HOL blocking is avoided. This no-input-buffering architecture is common in small to medium-sized ethernet switches.
Out-of-order delivery
Out-of-order delivery occurs when sequenced packets arrive out of order. This may happen due to different paths taken by the packets or from packets being dropped and resent. HOL blocking can significantly increase packet reordering.
Reliably broadcasting messages across a lossy network among a large number of peers is a difficult problem. While atomic broadcast algorithms solve the single point of failure problem of centralized servers, those algorithms introduce a head-of-line blocking problem. The Bimodal Multicast algorithm, a randomized algorithm that uses a gossip protocol, avoids head-of-line blocking by allowing some messages to be received out-of-order.
In HTTP
One form of HOL blocking in HTTP/1.1 is when the number of allowed parallel requests in the browser is used up, and subsequent requests need to wait for the former ones to complete. HTTP/2 addresses this issue through request multiplexing, which eliminates HOL blocking at the application layer, but HOL still exists at the transport (TCP) layer.
In reliable byte streams
Head-of-line blocking can occur in reliable byte streams: if packets are reordered or lost and need to be retransmitted (and thus arrive out-of-order), data from sequentially later parts of the stream may be received before sequentially earlier parts of the stream; however, the later data cannot typically be used until the earlier data has been received, incurring network latency. If multiple independent highe
|
https://en.wikipedia.org/wiki/Pelni
|
Pelni (abbreviation of , ) is the national cargo and passenger shipping company of Indonesia. Its services network spans across the Indonesian archipelago. Mainly serving as connector between bigger cities and to remote islands, Pelni plays an important role in the Indonesian transport system.
Pelni is one of the few remaining economy-class long-distance passenger ship operators. Most of the world's well-known passenger ship companies have stopped their low-budget passenger services since the 1960s due to shifting trends towards air transport. Pelni's ability to survive is mostly due to monopolies on certain routes and government of Indonesia subsidies.
History
Under the Dutch colonial rule, Indonesian inter-islands transportation was dominated by Koninklijke Paketvaart-Maatschappij (KPM), founded in 1888. KPM headquarter was in Amsterdam, but daily operations were controlled from Batavia, Dutch East Indies (now Jakarta).
As a newly independent republic in the late 1940s, Indonesian government decided to nationalize Dutch-owned companies. The Dutch refused to give away KPM, due to its strong position as a connector of the Indonesian archipelago. KPM also played an important role in transporting Dutch logistics and military supplies during the Indonesian National Revolution.
In response to Dutch refusal, on September 5, 1950, Indonesia founded PEPUSKA (Yayasan Penguasaan Pusat Kapal-kapal, Centrally-controlled Ships Foundation) that operates 8 ships with a total size of 4.800 Deadweight tonnage. However, due to a lack of experience and capital, PEPUSKA failed to takeover KPM's monopoly.
On April 28, 1952, PEPUSKA was dissolved. Pelni (now as a company, not a foundation) was founded on the same day, with the same fleet. To bring more power, Indonesian Eximbank provided funding to buy 45 new coaster ships from western European countries. While waiting for these new ships to be produced, Pelni rented various ships from many countries across the world. Pelni also used ships looted from Japan in World War 2. These strategies proved successful, as KPM suffered from declining market share and strike workers led by Sukarno's leftist doctrine. KPM discontinued its Indonesian operation on December 3, 1957.
Pelni achieved its golden era during the early 1980s to late 1990s. Under Suharto’s presidency with his Transmigration program, Pelni was the main transport to move people from Java and Sumatra to eastern regions of Indonesia, because air transport facilities were still underdeveloped.
Pelni started to suffer in the 2000s, as air travel became cheaper. Some of its old ships even failed to sell to third parties, and maintaining these ships was expensive. KM Kambuna (renamed ) and KM Rinjani (renamed KRI Tanjung Fatagar (974)) was granted to the Indonesian Navy in 2004. KM Kerinci was sold in 2014. KFC Jetliner was rented to the Sri Lankan Navy between 2009 and 2012. As of 2017, no party is interested to buy KM Ganda Dewata (Ro-ro ship) even as scr
|
https://en.wikipedia.org/wiki/Waveform%20buffer
|
In computing, a waveform buffer is a technique for digital synthesis of repeating waveforms. It is common in PC sound cards.
The waveform amplitude values are stored in a buffer memory, which is addressed from a phase generator, with the retrieved value then used as the basis of the synthesized signal. In the phase generator, a value proportional to the desired signal frequence is periodically added to an accumulator. The high order bits of the accumulator form the output address, while the typically larger number of bits in the accumulator and addition value results in an arbitrarily high frequency resolution.
References
Digital signal processing
|
https://en.wikipedia.org/wiki/Action%20selection
|
Action selection is a way of characterizing the most basic problem of intelligent systems: what to do next. In artificial intelligence and computational cognitive science, "the action selection problem" is typically associated with intelligent agents and animats—artificial systems that exhibit complex behaviour in an agent environment. The term is also sometimes used in ethology or animal behavior.
One problem for understanding action selection is determining the level of abstraction used for specifying an "act". At the most basic level of abstraction, an atomic act could be anything from contracting a muscle cell to provoking a war. Typically for any one action-selection mechanism, the set of possible actions is predefined and fixed.
Most researchers working in this field place high demands on their agents:
The acting agent typically must select its action in dynamic and unpredictable environments.
The agents typically act in real time; therefore they must make decisions in a timely fashion.
The agents are normally created to perform several different tasks. These tasks may conflict for resource allocation (e.g. can the agent put out a fire and deliver a cup of coffee at the same time?)
The environment the agents operate in may include humans, who may make things more difficult for the agent (either intentionally or by attempting to assist.)
The agents themselves are often intended to model animals or humans, and animal/human behaviour is quite complicated.
For these reasons action selection is not trivial and attracts a good deal of research.
Characteristics of the action selection problem
The main problem for action selection is complexity. Since all computation takes both time and space (in memory), agents cannot possibly consider every option available to them at every instant in time. Consequently, they must be biased, and constrain their search in some way. For AI, the question of action selection is what is the best way to constrain this search? For biology and ethology, the question is how do various types of animals constrain their search? Do all animals use the same approaches? Why do they use the ones they do?
One fundamental question about action selection is whether it is really a problem at all for an agent, or whether it is just a description of an emergent property of an intelligent agent's behavior. However, if we consider how we are going to build an intelligent agent, then it becomes apparent there must be some mechanism for action selection. This mechanism may be highly distributed (as in the case of distributed organisms such as social insect colonies or slime mold) or it may be a special-purpose module.
The action selection mechanism (ASM) determines not only the agent's actions in terms of impact on the world, but also directs its perceptual attention, and updates its memory. These egocentric sorts of actions may in turn result in modifying the agent's basic behavioural capacities, particularly in that updating
|
https://en.wikipedia.org/wiki/Osem
|
Osem may refer to:
Osem (mathematics) – algorithm for image reconstruction in nuclear medical imaging
Osem (company) – Israeli food corporation
Orquesta Sinfonica del Estado de Mexico, an official State symphony orchestra in Mexico.
|
https://en.wikipedia.org/wiki/Windows%20service
|
In Windows NT operating systems, a Windows service is a computer program that operates in the background. It is similar in concept to a Unix daemon. A Windows service must conform to the interface rules and protocols of the Service Control Manager, the component responsible for managing Windows services. It is the Services and Controller app, services.exe, that launches all the services and manages their actions, such as start, end, etc.
Windows services can be configured to start when the operating system is started and run in the background as long as Windows is running. Alternatively, they can be started manually or by an event. Windows NT operating systems include numerous services which run in context of three user accounts: System, Network Service and Local Service. These Windows components are often associated with Host Process for Windows Services. Because Windows services operate in the context of their own dedicated user accounts, they can operate when a user is not logged on.
Prior to Windows Vista, services installed as an "interactive service" could interact with Windows desktop and show a graphical user interface. In Windows Vista, however, interactive services are deprecated and may not operate properly, as a result of Windows Service hardening.
Administration
Windows administrators can manage services via:
The Services snap-in (found under Administrative Tools in Windows Control Panel)
Sc.exe
Windows PowerShell
Services snap-in
The Services snap-in, built upon Microsoft Management Console, can connect to the local computer or a remote computer on the network, enabling users to:
view a list of installed services along with service name, descriptions and configuration
start, stop, pause or restart services
specify service parameters when applicable
change the startup type. Acceptable startup types include:
Automatic: The service starts at system startup.
Automatic (Delayed): The service starts a short while after the system has finished starting up. This option was introduced in Windows Vista in an attempt to reduce the boot-to-desktop time. However, not all services support delayed start.
Manual: The service starts only when explicitly summoned.
Disabled: The service is disabled. It will not run.
change the user account context in which the service operates
configure recovery actions that should be taken if a service fails
inspect service dependencies, discovering which services or device drivers depend on a given service or upon which services or device drivers a given service depends
export the list of services as a text file or as a CSV file
Command line
The command-line tool to manage Windows services is sc.exe. It is available for all versions of Windows NT. This utility is included with Windows XP and later and also in ReactOS.
The sc command's scope of management is restricted to the local computer. However, starting with Windows Server 2003, not only can sc do all that the Services snap-in does, but it c
|
https://en.wikipedia.org/wiki/Neil%20Trevett
|
Neil Trevett is an electrical engineer and executive involved in 3D computer graphics technology.
Biography
Trevett holds a first-class with honors joint B.Sc. electronic engineering and computer science degree from the University of Birmingham, England.
In 1985, Trevett joined benchMark Technologies as head of graphics systems. (benchMark became DuPont Pixel Systems, evolved into the independently owned 3Dlabs, Inc., and was acquired by Creative Labs). Trevett held the position of senior vice president of 3Dlabs from 1994 to 2005. He holds several patents in graphics technology.
From 1997–2005, Trevett served as president of the Web3D Consortium. Trevett was elected president of the Khronos Group in 2001, where he created and chaired the OpenGL ES working group, which has defined a standard for 3D graphics on embedded devices. Trevett also chairs the OpenCL working group at Khronos defining an open standard for heterogeneous computing.
In July 2005 he became vice president of mobile ecosystem at Nvidia where he is responsible for enabling and encouraging visual computing applications on non-PC platforms, including mobile phones.
References
Year of birth missing (living people)
Living people
People from Bridport
Alumni of the University of Birmingham
British electronics engineers
Businesspeople in software
|
https://en.wikipedia.org/wiki/Reactive%20planning
|
In artificial intelligence, reactive planning denotes a group of techniques for action selection by autonomous agents. These techniques differ from classical planning in two aspects. First, they operate in a timely fashion and hence can cope with highly dynamic and unpredictable environments. Second, they compute just one next action in every instant, based on the current context. Reactive planners often (but not always) exploit reactive plans, which are stored structures describing the agent's priorities and behaviour. The term reactive planning goes back to at least 1988, and is synonymous with the more modern term dynamic planning.
Reactive plan representation
There are several ways to represent a reactive plan. All require a basic representational unit and a means to compose these units into plans.
Condition-action rules (productions)
A condition action rule, or if-then rule, is a rule in the form: if condition then action. These rules are called productions. The meaning of the rule is as follows: if the condition holds, perform the action. The action can be either external (e.g., pick something up and move it), or internal (e.g., write a fact into the internal memory, or evaluate a new set of rules). Conditions are normally boolean and the action either can be performed, or not.
Production rules may be organized in relatively flat structures, but more often are organized into a hierarchy of some kind. For example, subsumption architecture consists of layers of interconnected behaviors, each actually a finite state machine which acts in response to an appropriate input. These layers are then organized into a simple stack, with higher layers subsuming the goals of the lower ones. Other systems may use trees, or may include special mechanisms for changing which goal / rule subset is currently most important. Flat structures are relatively easy to build, but allow only for description of simple behavior, or require immensely complicated conditions to compensate for the lacking structure.
An important part of any distributed action selection algorithms is a conflict resolution mechanism. This is a mechanism for resolving conflicts between actions proposed when more than one rules' condition holds in a given instant. The conflict can be solved for example by
assigning fixed priorities to the rules in advance,
assigning preferences (e.g. in Soar architecture),
learning relative utilities between rules (e.g. in ACT-R),
exploiting a form of planning.
Expert systems often use other simpler heuristics such as recency for selecting rules, but it is difficult to guarantee good behavior in a large system with simple approaches.
Conflict resolution is only necessary for rules that want to take mutually exclusive actions (c.f. Blumberg 1996).
Some limitations of this kind of reactive planning can be found in Brom (2005).
Finite State Machines
Finite state machine (FSM) is model of behaviour of a system. FSMs are used widely in compu
|
https://en.wikipedia.org/wiki/Doncaster%20Tramway
|
Doncaster Corporation Tramways was an electric tramway network serving the town of Doncaster, England. It was authorised in 1899, and the first route to Bentley opened in 1902. This remained separated from the rest of the system until North Bridge was built to carry traffic over the Great Northern Railway main line to Edinburgh. Soon afterwards, deep mining of coal began in the area, and several extensions to the system were made between 1913 and 1916 to serve new communities which developed around the pit heads. The Racecourse route was unusual, in that it had balloon loops at both ends to enable almost continuous running on race days, a feature that was not common in England, and only found favour in Europe in the 1950s and 1960s.
From 1913 to 1919, the tramways were reasonably profitable, but suffered from lack of maintenance during World War I, and the poor construction methods used to lay the track. The system had been financed by loans repayable over 40 years, and with the track needing replacement after half of that period, it was uneconomic to carry out the work. The Corporation decided to replace the system with motor buses in 1922, but in 1926 concluded that trolleybuses would be more economical. The first route of the Doncaster trolleybus system was again that to Bentley, opened in 1928, and by 1931, all of the authorised routes had been converted. The tramway to Brodsworth continued in use until 1935, when it was replaced by motor buses. Trolleybuses ran for somewhat longer than the trams had, with the system finally closing in 1963.
The service was provided by a total of 47 tramcars, all but one of them being double-deck vehicles running on 4-wheel chassis. Most were supplied by the Electric Railway and Tramway Carriage Works of Preston, or their successor, the United Electric Car Company. One single-deck vehicle was purchased second-hand in 1917 in an attempt to reduce costs on the unprofitable Avenue Road route, but local crews would not allow one-man operation, and it saw little use. The cars were stabled in two depots on Greyfriars Road. The main depot was built for the opening of the system, and the second in 1920 to house cars bought for an extension to Rossington which did not go ahead.
History
Public transport in Doncaster began in 1887, when an undertaker called J G Steadman started running horse buses in the town. Two years later, the grocers Hodgson & Hepworth also started running buses, to be joined by J Stoppani soon afterwards. Between them, the buses served Avenue Road, Balby, Bentley, Hexthorpe, Hyde Park and the Racecourse. There had been proposals for a horse tramway in 1878, and another for a tramway to Balby in 1895, but neither scheme had progressed past the planning stage. However, in 1898 a more serious contender appeared, when British Electric Traction proposed tramways serving Avenue Road, Balby, Bentley and Hexthorpe, and began applying for permission to build them.
Doncaster Corporation at the time were
|
https://en.wikipedia.org/wiki/Chipkill
|
Chipkill is IBM's trademark for a form of advanced error checking and correcting (ECC) computer memory technology that protects computer memory systems from any single memory chip failure as well as multi-bit errors from any portion of a single memory chip. One simple scheme to perform this function scatters the bits of a Hamming code ECC word across multiple memory chips, such that the failure of any single memory chip will affect only one ECC bit per word. This allows memory contents to be reconstructed despite the complete failure of one chip. Typical implementations use more advanced codes, such as a BCH code, that can correct multiple bits with less overhead.
Chipkill is frequently combined with dynamic bit-steering, so that if a chip fails (or has exceeded a threshold of bit errors), another, spare, memory chip is used to replace the failed chip. The concept is similar to that of RAID, which protects against disk failure, except that now the concept is applied to individual memory chips. The technology was developed by the IBM Corporation in the early and middle 1990s. An important RAS feature, Chipkill technology is deployed primarily on SSDs, mainframes and midrange servers.
An equivalent system from Sun Microsystems is called Extended ECC, while equivalent systems from HP are called Advanced ECC and Chipspare. A similar system from Intel, called Lockstep memory, provides double-device data correction (DDDC) functionality. Similar systems from Micron, called redundant array of independent NAND (RAIN), and from SandForce, called RAISE level 2, protect data stored on SSDs from any single NAND flash chip going bad.
A 2009 paper using data from Google's datacentres provided evidence demonstrating that in observed Google systems, DRAM errors were recurrent at the same location, and that 8% of DIMMs were affected each year. Specifically, "In more than 85% of the cases a correctable error is followed by at least one more correctable error in the same month". DIMMs with chipkill error correction showed a lower fraction of DIMMs reporting uncorrectable errors compared to DIMMs with error correcting codes that can only correct single-bit errors. A 2010 paper from University of Rochester also showed that Chipkill memory gave substantially lower memory errors, using both real world memory traces and simulations.
See also
ECC memory
Lockstep (computing)
Memory ProteXion
Redundant array of independent memory
Single-error correction and double-error detection (SECDED)
References
External links
Intel E7500 Chipset MCH Intelx4 Single Device Data Correction (x4 SDDC) Implementation and Validation, Intel Application note AP-726, August 2002.
DRAM study turns assumptions about errors upside down, Ars Technica, October 7, 2009
Enabling Memory Reliability, Availability, and Serviceability Features on Dell PowerEdge Servers, 2005
Chipkill correct memory architecture, August 2000, by David Locklear
The Mathematics of Chipkill ECC, Octob
|
https://en.wikipedia.org/wiki/Office%20%28disambiguation%29
|
An office is a room or other area in which people work, or a position within an organization with specific duties and rights attached.
Office or The Office may also refer to:
Computer software
Office suite, Bundled business productivity software
Ability Office
Collabora Online
ConceptDraw Office
Corel WordPerfect Office
Feng Office
LibreOffice
Microsoft Office
Mini Office II
Polaris Office
Siag Office
SoftMaker Office
Wang OFFICE
WPS Office
Zoho Office
The Office (video game), a 2007 game based on the 2005 U.S. television series
Film
Office (2015 Hong Kong film), a musical comedy-drama film
Office (2015 South Korean film), a thriller horror film
The Office (film), a 1966 Polish short film
Politics
Political office, the authority to govern served by an elected official
Public office, the authority to execute government policy
Music
Office (band), a Chicago-based rock band
Religion
Daily Office, also called Canonical hours, the recitation of such prayers in Christianity more generally
Holy Office, also called the Congregation for the Doctrine of the Faith in Roman Catholicism
Liturgy of the Hours, the recitation of certain Christian prayers at fixed hours according to the discipline of the Roman Catholic Church
Private offices, such as prayers in the morning and evening, as described in Luther's Small Catechism
Other offices in Christian Liturgy, such as Matins and Vespers
Television
Office (TV series), a 2013 Indian Tamil-language comedy series
The Office (1995 TV series), an American comedy series starring Valerie Harper
The Office, an international television franchise
The Office (British TV series), 2001–2003
The Office (American TV series), 2005–2013
Le Bureau, a French TV series, 2006
HaMisrad, an Israeli TV series, 2010–2013
La Job, a French Canadian TV series, 2006–2007
Other uses
Office, Kendrick, American football player
Office Holdings, which operates the "Office" chain of shoe shops in the UK and Ireland
La Oficina (lit. The Office), a Chilean intelligence agency that existed in the 1990s
See also
Officer (disambiguation)
Official (disambiguation)
Minister (Christianity), ordained offices in Christianity
it:Ufficio
|
https://en.wikipedia.org/wiki/Diana%20Merry
|
Diana Merry-Shapiro is a computer programmer who had worked for the Learning Research Group of Xerox PARC in the 1970s and 1980s, after having been hired originally as a secretary. As one of the original developers of the Smalltalk programming language, she helped to write the first system for overlapping display windows. Merry was also one of the co-inventors of the bit block transfer (BitBLT) routines for Smalltalk, subroutines for performing computer graphics operations quickly which were pivotal in the evolution of user interfaces from text-based user interfaces to graphical user interfaces.
As of 2003, Merry-Shapiro was still using Smalltalk as an employee of Suite LLC, a financial consulting firm.
References
Year of birth missing (living people)
Living people
American computer programmers
Scientists at PARC (company)
|
https://en.wikipedia.org/wiki/Music%20television
|
Music television is a type of television programming which focuses predominantly on playing music videos from recording artists, usually on dedicated television channels broadcasting on satellite, cable, or Streaming Platforms.
Music television channels may host their own shows and charts and award prizes. Examples are MTV, Channel UFX, 4Music, 40 TV, Channel V, VIVA, Scuzz, MuchMusic, Kerrang! TV, RAC 105 TV, VH1, Fuse TV and Palladia.
History
Radio broadcast (1950s)
Prior to the 1950s most musical broadcasts were on a radio format. Most radio broadcasts were live music such as Classical music broadcasts—for example, the NBC Symphony Orchestra. In the 1950s broadcast television such as NBC, CBS, and ABC sought to move their popular radio broadcasts to a television format, such as Texaco Star Theater, which went from a radio broadcast to a telecast.
As networks continued to abandon radio for popular music broadcasting, the recording industry sought to influence sales by using television as a new vessel for promoting for their artists. The coordination between record companies and television saw the incorporation of musical acts in variety shows such as The Ed Sullivan Show (1948–1971), The Stage Show (1954–1956), and Texaco Star Theater (1948–1956). Columbia records was the first to utilize this method by coordinating the release of a song on CBS's Studio One and then releasing it on audio format by the label on the next day. This practice introduced the success of the televised format for musical promotion.
Performers doing specials on variety shows also became common on television. Elvis Presley performed on numerous variety shows over the span of multiple per episodes, playing rock and roll music. His most controversial performance was his appearance on Texaco Star Theater where he did his now-signature dance moves of thrusting his pelvis suggestively during a performance of "You Ain't Nothing But A Hound Dog". This performance served as an opening to have younger and newer music targeted at a younger demographic; previously broadcasts were typically targeted towards the adult audience.
Network television (1960–1980)
In the 1960s NBC, CBS and ABC formed most of the music television market establishing themselves as the main sources for current music. A main contributor to the solidification of music broadcasting was the development of programs specifically designed to showcase music acts. This led to more technicians, set designers, producers, and directors training to specifically produce television content. The programs were of better quality than in the 1950s and gave a younger, more dynamic look to preexisting shows, such as The Ed Sullivan Show. The shift in production modality started to attract corporate sponsorships such as Ford, who used ad space in The Lively Ones to promote the Fairlane sedan to young car buyers.
Record labels and performers in the 1960s sought to utilize the newly founded music driven platform to introduce
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.