source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/VOWR | VOWR is a radio station in St. John's, Newfoundland and Labrador, Canada. The station is operated by the Wesley United Church of Canada and operates a mix of 30% religious programming and 70% secular programming, including classical, folk, country, oldies, military/marching band, adult standards, beautiful music and music from the 1940s through the 1970s, interviews and informational programs. VOWR has several information based programs that are of interest to its core demographic including Consumer Reports, a gardening show, the 50+ Radio Show and many others of a wide range of subjects.
VOWR is a non-profit station staffed by volunteers, of which many are former broadcasters in the public and private local broadcasting industry.
VOWR transmits on 800 kHz. The dominant station on 800 kHz is XEROK in Ciudad Juárez, Mexico.
VOWR first signed on July 24, 1924 under the call sign 8WMC, which stood for the Wesley Methodist Church. Reverend Joseph G. Joyce (1889–1959) started the station to provide church services to shut-ins, but soon expanded it to provide public service announcements and entertainment.
VOWR is one of just four broadcast radio stations in Canada whose call letters do not begin with CB (for the CBC), CF, CH, CI, CJ, or CK. The others, VOCM, VOCM-FM and VOAR-FM, are also based in the St. John's area. With exception of VOCM-FM, which launched in 1982, all of these stations first aired before Newfoundland joined Canadian Confederation in 1949. The ITU prefix VO was originally assigned to Newfoundland and remains in use by radio amateurs.
References
External links
VOWR
Radio stations in St. John's, Newfoundland and Labrador
Christian radio stations in Canada
Radio stations established in 1924
Full service radio stations in Canada |
https://en.wikipedia.org/wiki/Online%20help | Online help is topic-oriented, procedural or reference information delivered through computer software. It is a form of user assistance. The purpose of most online help is to assist in using a software application, web application or operating system. However, it can also present information on a broad range of subjects. Online help linked to the application's state (what the user is doing) is called Context-sensitive help.
Benefits
Online help has largely replaced live customer support. Before its availability, support could only be given through printed documentation, postal mail, or telephone.
Platforms
Online help is created using help authoring tools or component content management systems. It is delivered in a wide variety of formats, some proprietary and some open-standard, including:
Hypertext Markup Language (HTML), which includes HTML Help, HTML-based Help, JavaHelp, and Oracle Help
Adobe Portable Document Format (PDF)
Online help is also provided via live chat systems, one step removed from telephone calls. This allows the support person to conduct several support sessions simultaneously, thus reducing costs. The transcript is immediately available and can be sent to the customer after the session ends.
The chat feature also reduces the intense negativity that can be directed at customer support personnel, requiring the customer to calm down and articulate their thoughts more clearly.
DITA and DocBook
The Open Source tool DocBook XSL can also generate help files and is a resource for single source publishing. From one source, DocBook can generate PDF, JavaHelp, WebHelp, eBook and many more formats (even .chm files if required). The same with DITA, which is even favored for that purpose.
Microsoft help platforms
Microsoft develops the platforms for delivering help systems in the Microsoft Windows operating system.
Other platforms
See also
Balloon help
Darwin Information Typing Architecture
DocBook
Frequently Asked Questions
List of help authoring tools
Microsoft Assistance Markup Language (Microsoft AML)
Web help
help desk
References |
https://en.wikipedia.org/wiki/BushBuck%20Charms%2C%20Viking%20Ships%20%26%20Dodo%20Eggs | Bushbuck Charms, Viking Ships & Dodo Eggs, also known as Bush Buck: Global Treasure Hunter, is an educational computer game released in 1991. Designed by the Australian company Reckon, the game was published by "PC Globe", a small US-based company that specialized in "edutainment" software in the late 1980s and early 90s. In the tradition of Brøderbund's Carmen Sandiego games, "Bushbuck Charms, Viking Ships and Dodo Eggs" taught geography through a storyline that involved a global scavenger hunt for unusual items. Each game, the player had to find fifteen items which the game chose from a selection of hundreds of possible items. A few of the possible items were a hemlock leaf, a lava-lava, and an alpaca poncho. The game ran on the Amiga and MS-DOS platforms.
Gameplay
The game is played by flying from city to city seeking treasures as laid out at the beginning of the round. The game has three possible modes, one player with no computer player (not available in advanced skill), one player with computer player, and two player.
The game starts in a randomly selected city which becomes the home base for that round's competition, to which the player must return to redeem treasures for points and additional tickets. If the player collects all available items, a one way flight back to the home base city is rewarded. Five items are made available at any one time with a total of fifteen items available for the entire round.
Weather
Different weather-related obstacles are presented while heading from city to city. At times the player may have to choose to either fly through a blizzard, typhoon, hailstorm, rain storm, hurricane, or pick another city than the one intended. If the player chooses to go through the storm, they may make it, or they may be redirected back to the original city. If there are any items on board when flying through inclement weather, they will be roughed up, and be worth less points when turned in.
Tickets
The player starts with a set number of tickets at the beginning of the round (60 in beginner, 50 in intermediate, 40 in advanced). One ticket is used per flight, and if a player chooses to fly through a storm and does not make it to the desired destination, between one and three tickets need to be cashed in to pay for damages to the plane. When the player returns items to the home base, 10 additional tickets are given per item returned.
Infoboxes
Each city has an "infobox" which pops up either when the player flies into the city, or when the player clicks on the city in the pointer mode. The infoboxes contain varied interesting information about the city, from famous people from there to who founded it, and have an underlined feature such as a monument or attraction present in that city.
Clues
Clues are available at certain cities as indicated by a little black box on the map. Five clues are available for each item, and the clues get progressively more helpful as the player finds them. City features, historical facts, a |
https://en.wikipedia.org/wiki/International%20Network%20of%20Crackers | International Network of Crackers (INC) was one of the premier cracking/releasing warez groups for the IBM PC during the late 1980s and early 1990s.
The formation of INC was the result of the merger of several cracking groups, including Union, based out of Texas, and the Miami Cracking Machine (MCM), based out of Florida. The founder of MCM, who went under the pseudonym Line Noise, continued to manage INC until 1992. Following his departure from the group, Cool Hand and The Cracksmith took over. There were a few years in which the group seemed dominant over the "warez" scene. It was not until internal conflicts and lack of interest by upper management entered the picture that things began to decline. When Cool Hand and The Cracksmith disappeared, the remaining members were unable to hold things together.
The real identities of the key members have never been fully uncovered, but it has been reported that the founding members, Line Noise (Neil), The Cracksmith (Drew), and Cool Hand (Joe) have left the scene. Releases from INC aggressively declined and people within the scene generally had felt that INC lost its edge. During a one-year period, they went from being the top gaming software release group to barely memorable. Some of the best games of the 80s and 90s were released by INC during a period of stiff competition with groups like FLT, THG, and Razor 1911. By early 1994, INC had completely disappeared from the warez scene.
Among their biggest rivals and competitors during the group's existence were The Humble Guys. During a period in which most groups were using any and all means possible (including credit card fraud, lies, and anything else) to beat them, INC always maintained its moral high ground. The worst INC ever did was to "leak" a new game to The Humble Guys so they could steal the credit. While unknown to THG - the game was infected with a trojan that searched for a modem then dialed 9-1-1. Several of The Humble Guys members were visited by the police before they discovered they had been fooled.
References
Warez groups
Software cracking |
https://en.wikipedia.org/wiki/MPEG%20user%20data | The MPEG user data feature provides a means to inject application-specific data into an MPEG elementary stream. User data can be inserted on three different levels:
The sequence level
The group of pictures (GOP) level
The picture data level
Applications that process MPEG data do not need to be able to understand data encapsulated in this way, but should be able to preserve it.
Examples of information embedded in MPEG streams as user data are:
Aspect ratio information
"Hidden" information per the Active Format Descriptor specification
Closed captioning per the EIA-708 standard
External links
ATSC
DVB
ATSC
Digital television
MPEG |
https://en.wikipedia.org/wiki/Pelmorex%20Radio%20Network | The Pelmorex Radio Network was a system of Canadian radio stations in Northern Ontario, owned and operated by Pelmorex.
History
In 1989, Pierre Morrissette founded his own communications company, Pelmorex Media Inc., and acquired several French and English-language radio stations that were serving various small and medium-size markets in northern Ontario. Pelmorex acquired the first stations from Mid-Canada Radio in 1990.
In 1992, Pelmorex also entered into one of Canada's first local management agreements, taking over day-to-day management, but not formal ownership, of Telemedia's CHAS-FM in Sault Ste. Marie.
Pelmorex became controversial as one of the first radio broadcast groups in Canada to centralize its operations as a cost-saving measure. Almost all local programming on the stations was discontinued, with only local morning shows remaining. This process began slowly in 1991 with a midday program after a satellite uplink was installed at the CHNO-CJMX studios in Sudbury. By 1994, most of the stations' programming was delivered by satellite from a facility in Mississauga, and the stations were reduced to storefronts with just a few staff members.
The controversy came to a head in 1995, when Environment Canada issued a severe weather warning in Sudbury during the Heat Wave of 1995 Derecho Series. The warning, issued barely ten minutes after the stations had switched to the central programming feed, was never broadcast on any of Pelmorex's three stations in the city. Pelmorex, ironically, also owned Canada's Weather Network.
Scott Jackson, a former program director with the company, has written on his website that Pelmorex often neglected necessary equipment and technology upgrades at the stations, and that the company had him simultaneously serve as program director of both the Sudbury and North Bay clusters, spending half of his working week in each city.
Pelmorex subsequently sold CKNR, CJNR and CKNS to North Channel Broadcasting in 1996. All three stations were merged by North Channel into a new FM station on 94.1 MHz in 1997, known as CKNR.
Pelmorex also converted CHVR Pembroke, CHVR-1 Renfrew and CHVR-2 Arnprior to the FM band in 1996. All three stations were merged into a new single FM station on 96.7 MHz, known as CHVR-FM. Pelmorex converted CHUR North Bay to the FM band in 1997.
In 1997 and 1998, staff at the stations in Sudbury were involved in a four-month strike, during which all programming on the stations aired exclusively from the Mississauga facility.
In 1998, after a change in CRTC ownership rules, Pelmorex sold CHUR, CHVR, CJMX in Sudbury and CJQM in Sault Ste. Marie to Telemedia. (Telemedia had previously been limited to one station on each of the AM and FM bands in each market; with the change, it could acquire two in one band and one in the other, so it added second FMs to its existing AM/FM combos in each city.)
Pelmorex sold the remaining stations to Haliburton Broadcasting Group in 1999. The company had re |
https://en.wikipedia.org/wiki/Cybercenter | Cybercenter may refer to:
Data center, a facility used to house computer systems and associated components
Internet café, a place which provides internet access to the public, usually for a fee |
https://en.wikipedia.org/wiki/Good%20Morning%20Australia%20%281981%20TV%20program%29 | Good Morning Australia (or GMA) is an Australian breakfast television program that was broadcast on Network Ten. It aired from 23 February 1981 until 18 December 1992. It was seen as an Australian equivalent of ABC's Good Morning America and ITV's Good Morning Britain.
History
The original Good Morning Australia breakfast television program was a news and entertainment show broadcast by Network Ten on weekdays from 7:00 to 9:00am. It debuted on 23 February 1981 with Gordon Elliott and Sue Kellaway co-hosting and with Di Morrissey as the roving reporter. Kellaway departed shortly after the program began and was replaced by Kerri-Anne Kennerley, who stayed with the program until the end of 1991 when she was replaced by Sandra Sully, Joy Smithers and then Sandra Sully again.
The male co-host position on GMA was filled by Tim Webster, Mike Gibson, Terry Willesee, Webster again, Mike Hammond and Ron Wilson.
The breakfast program competed with the Nine Network's Today (which launched in 1982 with Sue Kellaway, initial co-host of the Ten show) and usually placed second in the ratings behind Today.
In 1992, Good Morning Australia moved to the 6:30 to 8:30am timeslot, coinciding with the launch of The Morning Show with Bert Newton. Good Morning Australia, as a breakfast news program, was cancelled at the end of 1992. The name was taken over by Bert Newton's morning program and became Good Morning Australia with Bert Newton, which ran until 2005.
Since the demise of the original Good Morning Australia, other breakfast programs have arisen such as Sunrise and ABC News Breakfast, Weekend Today, Weekend Sunrise and Weekend Breakfast.
See also
List of Australian television series
References
1981 Australian television series debuts
1992 Australian television series endings
Australian television news shows
Breakfast television in Australia
English-language television shows
Network 10 original programming
Television shows set in Sydney
10 News First |
https://en.wikipedia.org/wiki/ChessV | ChessV (short for Chess Variants) is a free computer program designed to play many chess variants.
ChessV is an open-source, universal chess variant program with a graphical user-interface, sophisticated AI, support for opening books and other features of traditional chess programs. The developer of this program, Gregory Strong, has been adding more variants with each release of ChessV. Over 100 chess variants are supported, including the developer's few own variants and other exotic variants, and can be programmed to play additional variants. ChessV is designed to be able to play any game that is reasonably similar to chess. ChessV is one of only a few such programs that exist. The source code of this program is freely available for download as well as the executable program.
As of ChessV 0.93, it is possible to customize the variants it supports. Of all chess variants supported, two of the most-played variants are probably Fischer Random Chess and Grand Chess.
ChessV is capable of playing:
2 variants on 6×6 squares
17 variants on 8×8 squares
15 variants on 10×8 squares
(including 10 Capablanca Chess variants)
15 variants on 10×10 squares
3 variants on 12×8 squares
Some of the provided variants can be customized in their details. While users can create custom variants with ChessV 0.93, it needs to be recompiled, which is tedious when programming. ChessV 2.0+ fixes this, using a scripting language. While the pieces in a custom variant have to be chosen from a limited list, this allows ChessV to play hundreds or thousands of variants of each game it directly supports.
Engine features
Searching: Alpha-Beta Nega-Max Principal variation search, Iterative deepening, Null-move Forward Pruning, Static Exchange Evaluation (SEE).
Search Extensions: check extension, recapture extension, null-move threat extension, PV extension, Futility Pruning and Razoring, History Heuristic, Killer-move heuristic.
Evaluation: Piece-square tables, Pawn structure evaluation, Mobility evaluation, King safety, King tropism, Lazy evaluation.
Hash Tables: Transposition table, Pawn structure table, Evaluation cache, Repetition detection.
Since ChessV 2.2, the engine can be set to adjust to their player's needs:
Transposition Table Size can be adjusted.
The engine can be allowed for variance of play.
Weaken the chess engine to be human-beatable even for beginners.
Current limitations
No games with more than two players are supported.
No games with randomness or hidden information are supported.
No ability to edit the board mid-game is provided.
Supported games
ChessV supports many variants. Other than chess, it supports:
Alice Chess, Almost Chess, Archchess, Berolina Chess, Bird's Chess, Capablanca Chess and its variants, Carrera's Chess, Chess480, Chess and a Half, Chess with Different Armies, Courier Chess, Cylindrical Chess, Diagonal Chess, Diamond Chess, Doublemove chess, Embassy Chess, Eurasian Chess, Extinction Chess, Fischer Random Chess (Chess9 |
https://en.wikipedia.org/wiki/The%20Team%20%28radio%20network%29 | The Team (corporately styled as The TEAM) was a Canadian sports radio network, which broadcast from 2001 to 2002. It was owned and operated by CHUM Limited, based on the existing format of their Ottawa station The Team 1200, and incorporated virtually all of the company's AM radio stations across Canada. It was dissolved as a national network in 2002 amid poor ratings, although a few of its former stations retained the sports format and Team branding as standalone entities.
History
The network was launched on May 7, 2001, but struggled to build an audience in many cities. In Toronto, for example, the network had to compete against Telemedia's The Fan 590, and found that much of its potential audience had already built a strong sense of loyalty to the more established station. The switch of 1050 CHUM, the network's flagship station, away from its popular former oldies format was also controversial.
The network aired both original programming — its marquee Canadian sportscaster was Jim Van Horne, while other programs were hosted by Paul Romanuk, Mike Richards and Gene Valaitis — and syndicated sports programming from the United States, such as The Jim Rome Show.
In August 2002, after just over a year on the air, CHUM pulled the plug and most of the network's stations reverted to their old pre-Team formats. However, the sports format and the Team branding were retained in Ottawa, where it had already been the station's established format before the network was launched, and in Montreal and Vancouver, where it was also successful in the ratings. Most of these stations, and one in Edmonton which had licensed the brand name but which at the time was owned by a different company, continued to use the Team branding as of early 2011, but were no longer considered a network.
All of the stations, save the former Calgary affiliate, are now owned by CHUM's successor Bell Media. In 2011, some of these stations were rebranded and integrated into a new TSN Radio network, starting with Toronto's radio station CHUM on April 13, 2011; the Winnipeg and Montreal stations were added shortly thereafter, with Ottawa and Edmonton stations added in 2013. The two Bell Media-owned sports radio stations in Vancouver, while sharing some programming with the TSN Radio stations, retained the Team branding until September 8, 2014, when they were both re-branded as TSN Radio.
The Team stations
CHUM-owned
Affiliates
CFAC in Calgary and CFRN in Edmonton were also affiliates of the Team, although the stations were not CHUM-owned — CFAC was owned by Rogers and CFRN by Standard Broadcasting. After the Team network folded, both stations retained the sports format, although CFAC adopted the name The Fan 960, as Rogers had by this time acquired Toronto's Fan 590. CFRN, now also owned by Bell Media Radio, continued to use the Team branding until joining TSN Radio in 2013; it was shut down in June 2023.
Later
Vancouver's CFTE, a sister station to CKST, also converted to the Team b |
https://en.wikipedia.org/wiki/Programming%20Language%20Design%20and%20Implementation%20%28conference%29 | Programming Language Design and Implementation (PLDI) is an academic conference in computer science, in particular in the study of programming languages and compilers. PLDI is organized by the Association for Computing Machinery under the SIGPLAN interest group.
History
The precursor of PLDI was the Symposium on Compiler Optimization, held July 27–28, 1970 at the University of Illinois at Urbana-Champaign and chaired by Robert S. Northcote. That conference included papers by Frances E. Allen, John Cocke, Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. The first conference in the current PLDI series took place in 1979 under the name SIGPLAN Symposium on Compiler Construction in Denver, Colorado. The next Compiler Construction conference took place in 1982 in Boston, Massachusetts. The Compiler Construction conferences then alternated with SIGPLAN Conferences on Language Issues until 1988, when the conference was renamed to PLDI. From 1982 until 2001, the conference acronym was SIGPLAN 'xx. Starting in 2002, the initialism became PLDI 'xx, and in 2006 PLDI xxxx.
Conference locations and organizers
PLDI 2023 - SIGPLAN Conference on Programming Language Design and Implementation: Orlando, FL, United States
General Chair: Steve Blackburn
Program Chair: Nate Foster
PLDI 2022 - SIGPLAN Conference on Programming Language Design and Implementation: San Diego, CA, United States
General Chair: Ranjit Jhala
Program Chair: Isil Dillig
PLDI 2021 - SIGPLAN Conference on Programming Language Design and Implementation: Online due to COVID-19
General Chair: Stephen N. Freund
Program Chair: Eran Yahav
PLDI 2020 - SIGPLAN Conference on Programming Language Design and Implementation: London, United Kingdom (planned); moved online due to COVID-19
General Chair: Alastair F. Donaldson
Program Chair: Emina Torlak
proceedings
PLDI 2019 - SIGPLAN Conference on Programming Language Design and Implementation: Phoenix, AZ, United States
Conference Chair: Kathryn S. McKinley
Program Chair: Kathleen Fisher
PLDI 2018 - SIGPLAN Conference on Programming Language Design and Implementation: Philadelphia, PA, United States
Conference Chair: Jeffrey S. Foster
Program Chair: Dan Grossman
PLDI 2017 - SIGPLAN Conference on Programming Language Design and Implementation: Barcelona, Spain
Conference Chair: Albert Cohen
Program Chair: Martin Vechev
PLDI 2016 - SIGPLAN Conference on Programming Language Design and Implementation: Santa Barbara, CA, United States
Conference Chair: Chandra Krintz
Program Chair: Emery Berger
PLDI 2015 - SIGPLAN Conference on Programming Language Design and Implementation: Portland, OR, United States
Conference Chair: Dave Grove
Program Chair: Steve Blackburn
Part of the Federated Computing Research Conference 2015
PLDI 2014 - SIGPLAN Conference on Programming Language Design and Implementation: Edinburgh, Scotland, United Kingdom
Conference Chair: Michael O'Boyle
Program Chair: Keshav Pingali
PLDI 2013 - SIG |
https://en.wikipedia.org/wiki/SIGPLAN | SIGPLAN is the Association for Computing Machinery's Special Interest Group on programming languages.
Conferences
Principles of Programming Languages (POPL)
Programming Language Design and Implementation (PLDI)
International Symposium on Memory Management (ISMM)
Languages, Compilers, and Tools for Embedded Systems (LCTES)
Symposium on Principles and Practice of Parallel Programming (PPoPP)
International Conference on Functional Programming (ICFP)
Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH)
Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA)
History of Programming Languages (HOPL)
Dynamic Languages Symposium (DLS)
Associated journals
ACM Transactions on Architecture and Code Optimization
ACM Transactions on Programming Languages and Systems
Proceedings of the ACM on Programming Languages
Newsletters
SIGPLAN Notices - - Home page at ACM
Fortran Forum -
Lisp Pointers (final issue 1995) -
OOPS Messenger (1990–1996) -
Awards
Programming Languages Software Award
2023: OCaml
2022: CompCert
2021: WebAssembly
2020: Pin (computer program)
2019: Scala (programming language)
2018: Racket (programming language)
2016: V8 (JavaScript engine)
2015: Z3 Theorem Prover
2014: GNU Compiler Collection (GCC)
2013: Coq proof assistant
2012: Jikes Research Virtual Machine (RVM)
2011: Simon Peyton Jones and Simon Marlow (Glasgow Haskell Compiler)
2010: Chris Lattner (LLVM)
Programming Languages Achievement Award
Recognizes an individual or individuals who has made a significant and lasting contribution to the field of programming languages.
2020: Hans-J. Boehm
2019: Alex Aiken
2017: Thomas W. Reps
2016: Simon Peyton Jones
2015: Luca Cardelli
2014: Neil D. Jones
2013: Patrick Cousot and Radhia Cousot
2012: Matthias Felleisen
2011: Tony Hoare
2010: Gordon Plotkin
2009: Rod Burstall
2008: Barbara Liskov
2007: Niklaus Wirth
2006: Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark Wegman, and Kenneth Zadeck
2005: Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides
2004: John Backus
2003: John C. Reynolds
2002: John McCarthy
2001: Robin Milner
2000: Susan Graham
1999: Ken Kennedy
1998: Fran Allen
1997: Guy Steele
Robin Milner Young Researcher Award
Recognizes outstanding contributions by young researchers in the area of programming languages. The award is named after the computer scientist Robin Milner.
2019: Martin Vechev
2018: Ranjit Jhala
2017: Derek Dreyer
2016: Stephanie Weirich
2015: David Walker
2014: Sumit Gulwani
2013: Lars Birkedal
2012: Shriram Krishnamurthi
SIGPLAN Doctoral Dissertation Award
The full name of this award is the John C. Reynolds Doctoral Dissertation Award, after the computer scientist John C. Reynolds. It is "presented annually to the author of the outstanding doctoral dissertation in the area of Programming Languages."
2018: Justin Hsu and David Menendez
2017: Ramana Kumar
2016: Shachar Itzhaky and Vilhelm Sjö |
https://en.wikipedia.org/wiki/Digital%20currency | Digital currency (digital money, electronic money or electronic currency) is any currency, money, or money-like asset that is primarily managed, stored or exchanged on digital computer systems, especially over the internet. Types of digital currencies include cryptocurrency, virtual currency and central bank digital currency. Digital currency may be recorded on a distributed database on the internet, a centralized electronic computer database owned by a company or bank, within digital files or even on a stored-value card.
Digital currencies exhibit properties similar to traditional currencies, but generally do not have a classical physical form of fiat currency historically that can be held in the hand, like currencies with printed banknotes or minted coins. However, they do have a physical form in an unclassical sense coming from the computer to computer and computer to human interactions and the information and processing power of the servers that store and keep track of money. This unclassical physical form allows nearly instantaneous transactions over the internet and vastly lowers the cost associated with distributing notes and coins: for example, of the types of money in the UK economy, 3% are notes and coins, and 79% as electronic money (in the form of bank deposits). Usually not issued by a governmental body, virtual currencies are not considered a legal tender and they enable ownership transfer across governmental borders.
This type of currency may be used to buy physical goods and services, but may also be restricted to certain communities such as for use inside an online game.
Digital money can either be centralized, where there is a central point of control over the money supply (for instance, a bank), or decentralized, where the control over the money supply is predetermined or agreed upon democratically.
History
Precursory ideas for digital currencies were presented in electronic payment methods such as the Sabre (travel reservation system). In 1983, a research paper titled "Blind Signatures for Untraceable Payments" by David Chaum introduced the idea of digital cash. In 1989, he founded DigiCash, an electronic cash company, in Amsterdam to commercialize the ideas in his research. It filed for bankruptcy in 1998.
e-gold was the first widely used Internet money, introduced in 1996, and grew to several million users before the US Government shut it down in 2008. e-gold has been referenced to as "digital currency" by both US officials and academia. In 1997, Coca-Cola offered buying from vending machines using mobile payments. PayPal launched its USD-denominated service in 1998. In 2009, bitcoin was launched, which marked the start of decentralized blockchain-based digital currencies with no central server, and no tangible assets held in reserve. Also known as cryptocurrencies, blockchain-based digital currencies proved resistant to attempt by government to regulate them, because there was no central organization or person with th |
https://en.wikipedia.org/wiki/Alberto%20Abadie | Alberto Abadie (born April 3, 1968) is professor of the department of economics at MIT and associate director of the Institute for Data, Systems, and Society (IDSS) also at MIT. He was born in the Basque Country, Spain. He received his PhD in economics from MIT in 1999. Upon graduating, he joined the faculty at the Harvard Kennedy School, where he was promoted to full professor in 2005. He returned to MIT in 2016.
Alberto Abadie's research interests lie in the areas of econometric methodology and applied econometrics, with special emphasis on causal inference and program evaluation methods. He has made fundamental contributions to important areas in econometrics and statistics, including treatment effect models, instrumental variable estimation, matching estimators, difference in differences, and synthetic controls. He is Associate Editor of AER: Insights, and has previously served as Editor of the Review of Economics and Statistics and Associate Editor of Econometrica and the Journal of Business and Economic Statistics. He is a Fellow of the Econometric Society and a member of the American Academy of Arts and Sciences.
References
External links
Alberto Abadie's Home Page at MIT
Spanish political scientists
21st-century Spanish economists
20th-century Spanish economists
MIT School of Humanities, Arts, and Social Sciences faculty
MIT School of Humanities, Arts, and Social Sciences alumni
University of the Basque Country alumni
Living people
1968 births
Fellows of the Econometric Society
Spanish expatriates in the United States |
https://en.wikipedia.org/wiki/GRML | GRML – an acronym for General Reuse Markup Language – is a markup language similar to HTML and XML, using tags to organize data in files and web pages. Data is organized in columns and rows. Tags are used to define forms, images, and hyper-linking. Its syntax, like HTML, is based on a simplified subset of SGML. GRML is not in very wide use as of May 2005.
GRML is a data-oriented format which defines data content rather than data presentation; the file or web browser determines how data is displayed. This is the same goal as HTML's separating CSS from HTML, moving away from <font> tags, but GRML takes it even further. One of the key aims in creating the format was to separate "views" of the data from "forms" used to manipulate it.
It is also a common result of a typographical error when attempting to type HTML, because HT and GR are adjacent on a Qwerty keyboard.
History
1.0 - January, 2003
1.1 - June, 2003
1.2 - March, 2004
2.0 - September, 2004
2.1 - November, 2004
External links
Understanding GRML
References
Markup languages |
https://en.wikipedia.org/wiki/Sort-merge%20join | The sort-merge join (also known as merge join) is a join algorithm and is used in the implementation of a relational database management system.
The basic problem of a join algorithm is to find, for each distinct value of the join attribute, the set of tuples in each relation which display that value. The key idea of the sort-merge algorithm is to first sort the relations by the join attribute, so that interleaved linear scans will encounter these sets at the same time.
In practice, the most expensive part of performing a sort-merge join is arranging for both inputs to the algorithm to be presented in sorted order. This can be achieved via an explicit sort operation (often an external sort), or by taking advantage of a pre-existing ordering in one or both of the join relations. The latter condition, called interesting order, can occur because an input to the join might be produced by an index scan of a tree-based index, another merge join, or some other plan operator that happens to produce output sorted on an appropriate key. Interesting orders need not be serendipitous: the optimizer may seek out this possibility and choose a plan that is suboptimal for a specific preceding operation if it yields an interesting order that one or more downstream nodes can exploit.
Let's say that we have two relations and and . fits in pages memory and fits in pages memory. So, in the worst case sort-merge join will run in I/Os. In the case that and are not ordered the worst case time cost will contain additional terms of sorting time: , which equals (as linearithmic terms outweigh the linear terms, see Big O notation – Orders of common functions).
Pseudocode
For simplicity, the algorithm is described in the case of an inner join of two relations left and right. Generalization to other join types is straightforward. The output of the algorithm will contain only rows contained in the left and right relation and duplicates form a Cartesian product.
function Sort-Merge Join(left: Relation, right: Relation, comparator: Comparator) {
result = new Relation()
// Ensure that at least one element is present
if (!left.hasNext() || !right.hasNext()) {
return result
}
// Sort left and right relation with comparator
left.sort(comparator)
right.sort(comparator)
// Start Merge Join algorithm
leftRow = left.next()
rightRow = right.next()
outerForeverLoop:
while (true) {
while (comparator.compare(leftRow, rightRow) != 0) {
if (comparator.compare(leftRow, rightRow) < 0) {
// Left row is less than right row
if (left.hasNext()) {
// Advance to next left row
leftRow = left.next()
} else {
break outerForeverLoop
}
} else {
// Left row is greater than right row
if (right.hasNext()) {
// Advan |
https://en.wikipedia.org/wiki/Solid%20Logic%20Technology | Solid Logic Technology (SLT) was IBM's method for hybrid packaging of electronic circuitry introduced in 1964 with the IBM System/360 series of computers and related machines. IBM chose to design custom hybrid circuits using discrete, flip chip-mounted, glass-encapsulated transistors and diodes, with silk-screened resistors on a ceramic substrate, forming an SLT module. The circuits were either encapsulated in plastic or covered with a metal lid. Several of these SLT modules (20 in the image on the right) were then mounted on a small multi-layer printed circuit board to make an SLT card. Each SLT card had a socket on one edge that plugged into pins on the computer's backplane (the exact reverse of how most other companies' modules were mounted).
IBM considered monolithic integrated circuit technology too immature at the time. SLT was a revolutionary technology for 1964, with much higher circuit densities and improved reliability over earlier packaging techniques such as the Standard Modular System. It helped propel the IBM System/360 mainframe family to overwhelming success during the 1960s. SLT research produced ball chip assembly, wafer bumping, trimmed thick-film resistors, printed discrete functions, chip capacitors and one of the first volume uses of hybrid thick-film technology.
SLT replaced the earlier Standard Modular System, although some later SMS cards held SLT modules.
Details
SLT used silicon planar glass-encapsulated transistors and diodes.
SLT uses dual diode chips and individual transistor chips each approximately square. The chips are mounted on a square substrate with silk-screened resistors and printed connections. The whole is encapsulated to form a square module. Up to 36 modules are mounted on each card, though a few card types had just discrete components and no modules. Cards plug into boards which are connected to form gates which form frames.
SLT voltage levels, logic low to logic high, varied by circuit speed:
High speed (5-10 ns) 0.9 to 3.0 V
Medium speed (30 ns) 0.0 to 3.0 V
Low speed (700 ns) 0.0 to 12.0 V
Later developments
The same basic packaging technology (both device and module) was also used for the devices that replaced SLT as IBM gradually transitioned to the use of monolithic integrated circuits:
Solid Logic Dense (SLD) increased packaging density and circuit performance by mounting the discrete transistors and diodes on top of the substrate and the resistors on the bottom. SLD voltages were the same as SLT.
Unit Logic Device (ULD) use flat-pack ceramic packages, much smaller than SLT's metal cans. Each package contains a ceramic wafer with up to four silicon dies on top, each die implementing one transistor or two diodes; and thick-film resistors underneath. ULDs were used in the Launch Vehicle Digital Computer and Launch Vehicle Data Adapter of the Saturn V rocket.
Advanced Solid Logic Technology (ASLT) increased packaging density and circuit performance by stacking two substrates in the same |
https://en.wikipedia.org/wiki/T-square%20%28fractal%29 | In mathematics, the T-square is a two-dimensional fractal. It has a boundary of infinite length bounding a finite area. Its name comes from the drawing instrument known as a T-square.
Algorithmic description
It can be generated from using this algorithm:
Image 1:
Start with a square. (The black square in the image)
Image 2:
At each convex corner of the previous image, place another square, centered at that corner, with half the side length of the square from the previous image.
Take the union of the previous image with the collection of smaller squares placed in this way.
Images 3–6:
Repeat step 2.
The method of creation is rather similar to the ones used to create a Koch snowflake or a Sierpinski triangle, "both based on recursively drawing equilateral triangles and the Sierpinski carpet."
Properties
The T-square fractal has a fractal dimension of ln(4)/ln(2) = 2. The black surface extent is almost everywhere in the bigger square, for once a point has been darkened, it remains black for every other iteration; however some points remain white.
The fractal dimension of the boundary equals .
Using mathematical induction one can prove that for each n ≥ 2 the number of new squares that are added at stage n equals .
The T-Square and the chaos game
The T-square fractal can also be generated by an adaptation of the chaos game, in which a point jumps repeatedly half-way towards the randomly chosen vertices of a square. The T-square appears when the jumping point is unable to target the vertex directly opposite the vertex previously chosen. That is, if the current vertex is v[i] and the previous vertex was v[i-1], then v[i] ≠ v[i-1] + vinc, where vinc = 2 and modular arithmetic means that 3 + 2 = 1, 4 + 2 = 2:
If vinc is given different values, allomorphs of the T-square appear that are computationally equivalent to the T-square but very different in appearance:
T-square fractal and Sierpiński triangle
The T-square fractal can be derived from the Sierpiński triangle, and vice versa, by adjusting the angle at which sub-elements of the original fractal are added from the center outwards.
See also
List of fractals by Hausdorff dimension
The Toothpick sequence generates a similar pattern
H tree
References
Further reading
Iterated function system fractals |
https://en.wikipedia.org/wiki/Jack%20FM | Jack FM is a radio network brand, licensed by Sparknet Communications, with the exception of the European Union where it is licensed by Oxis Media. It plays an adult hits format, in most cases not using DJs.
Format characteristics
Stations using the "Jack" name are strictly licensed by SparkNet Communications. There are several terms that each station must agree to, including the use of no disc jockeys for at least the first few months of the format. SparkNet has been protective of its format, unsuccessfully filing trademark infringement suits against Bonneville International for its use of the Jack FM service-marked slogan "Playing What We Want" and other similar phrases. For this reason, many stations airing a Jack-like format use slightly different slogans to avoid infringing on SparkNet's service marks: WBEN-FM in Philadelphia uses the tagline "Playing anything we feel like." On WLKO "102.9 The Lake" in Charlotte, North Carolina, the tagline is "We Play Anything". During its run as "Doug FM", WDRQ in Detroit used the line "93.1 DOUG FM - We Play...EVERYTHING!"
Most stations in the United States use Howard Cogan and Andrew Anthony (best known as the voice of EA Sports and GEICO) as the voice of "Jack", while stations in Canada use Greg Beharrell. All Jack FM stations in the United Kingdom used former Blake's 7 actor Paul Darrow as the voice of Jack. In place of DJs, the Jack character makes sarcastic or ironic remarks and quips, often using self-deprecating humor.
Each September, all Jack FM stations ask listeners to visit a certain link to evaluate which songs should be played on the radio and which ones should be swapped. Changes take effect usually a few weeks to two months after the results are finalized.
History
2000–2003: Origins
One of the early originators of the Jack FM format was radio programmer Bob Perry, on a United States-based Internet radio stream in 2000. Perry named the station after a fictitious persona, "Cadillac Jack" Garrett, "a hard-living radio cowboy". The back story created by Perry for the original webstream was that Garrett, a disc jockey who had worked many "big sticks", finally got his own radio station and after years of being told what he was to play on-air was creating a station where the motto was "playing what we want". However, according to Rogers Communications, the only thing taken, without permission, for the first Jack FM radio station, in Vancouver, British Columbia, Canada, was the name and the tagline. Pat Cardinal, one of the first Jack program directors, says that he was unaware of the type of music on the American website and that "Jack" was one of several names that were considered for the format. Rogers Communications came to an agreement with Perry for the use of the Jack FM name in Canada soon after the launch. The original webstream is still live to this day.
Jack was also inspired by the success of CHUM Limited's "Bob FM" brand on CFWM radio in Winnipeg. Program director Howard Kr |
https://en.wikipedia.org/wiki/Econet | Econet was Acorn Computers's low-cost local area network system, intended for use by schools and small businesses. It was widely used in those areas, and was supported by a large number of different computer and server systems produced both by Acorn and by other companies.
Econet software was later mostly superseded by Acorn Universal Networking (AUN), though some suppliers were still offering bridging kits to interconnect old and new networks. AUN was in turn superseded by the Acorn Access+ software.
Implementation history
Econet was specified in 1980, and first developed for the Acorn Atom and Acorn System 2/3/4 computers in 1981. Also in that year the BBC Micro was released, initially with provision for floppy disc and Econet interface ports, but without the necessary supporting ICs fitted, optionally to be added in a post sale upgrade.
In 1982, the Tasmania Department of Education requested a tender for the supply of personal computers to their schools. Earlier that year Barson Computers, Acorn's Australian computer distributor, had released the BBC Microcomputer with floppy disc storage as part of a bundle. Acorn's Hermann Hauser and Chris Curry agreed to allow it to be also offered with Econet fitted, as they had previously done with the disc interface. As previously with the Disc Filing System, they stipulated that Barson would need to adapt the network filing system from the System 2 without assistance from Acorn. Barson's engineers applied a few modifications to fix bugs on the early BBC Micro motherboards, which were adopted by Acorn in later releases. With both floppy disc and networking available, the BBC Micro was approved for use in schools by all state and territory education authorities in Australia and New Zealand, and quickly overtook the Apple II as the computer of choice in private schools.
With no other supporting documentation available, the head of Barson's Acorn division, Rob Napier, published Networking with the BBC Microcomputer, the first reference documentation for Econet.
Econet was officially released for the BBC Micro in the UK in 1984, and it later became popular as a networking system for the Acorn Archimedes. Econet was eventually officially supported on all post-Atom Acorn machines, apart from the Electron (except in Australia and New Zealand where Barson Computers built their own Econet daughter board), along with 3rd party ISA cards for the IBM PC. The "Ecolink" ISA interface card for IBM-compatible PCs was available. It used Microsoft's MS-NET Redirector for MS-DOS to provide file and printer sharing via the NET USE command.
File, Print and Tape servers, for the architecture were also supplied by 3rd party vendors such as S J Research.
Econet was supported by Acorn MOS, RISC OS, RISC iX, FreeBSD and Linux operating systems.
Acorn once received an offer from Commodore International to license the technology, which it refused.
Subsequent development
With the falling prices and widespread adoption o |
https://en.wikipedia.org/wiki/Element%2014%20%28company%29 | Element 14 Ltd was a British developer of digital subscriber line (DSL) equipment created in July 1999 from the disposal of the assets of Acorn Computers. As "a three-site startup", it combined teams from Acorn, Inmos/STMicroelectronics and Alcatel.
History
By January 1999, Acorn Computers Ltd. had renamed to Element 14 Limited to reflect the changed focus of the business and to distance itself from the education market that Acorn Computers was most known for. Other names had been considered by the company, but the domain name e-14.com had been registered before the official announcement.
During this time the ARM Holdings share value had increased to a point where the capital value of Acorn Group was worth less than the value of its 24% holding in ARM. This situation led shareholders to press Acorn to sell its stake in ARM Holdings to provide a return on their investment.
In May 1999, a deal was offered to Acorn Group plc shareholders by MSDW Investment Holdings Limited, a newly incorporated subsidiary of Morgan Stanley Dean Witter Group, in which the MSDW subsidiary would acquire Acorn by giving Acorn shareholders two ARM Holdings shares in exchange for every five Acorn Group shares being held.
As part of the disposal of Acorn's assets, an independent company "owned by Stan Boland and certain senior management" were granted the option to purchase Acorn's silicon and software design activity for £1 million subject to obtaining external financing. This company was effectively the independent Element 14 entity, which set about raising venture capital and subsequently secured £8.25 million in first-round funding from Bessemer Venture Partners, Atlas Ventures and Herman Hauser's Amadeus Capital Partners.
In February 2000, Element 14 successfully head-hunted Alcatel's top digital subscriber line (DSL) engineers, including designers of analogue front-end and digital ICs, xDSL modem software and specialists in asymmetric DSL (ADSL) and very high rate DSL (VDSL) systems, and thereby acquired an engineering centre in Mechelen, Belgium. This reflected a shift towards the companies targeting of the DSP technology away from Media and towards DSL markets.
Element 14 developed IPTV over standard phone lines and worked with telcos such as Canada's NBTel. It continued to develop its DSP products until it was purchased by Broadcom Corporation in November 2000 for £366 million and Element 14 became Broadcom's DSL business unit.
References
Acorn Computers
Defunct technological companies of the United Kingdom
Defunct computer hardware companies
Companies based in Cambridge
Telecommunications companies established in 1999
Technology companies disestablished in 2000
1999 establishments in England
2000 disestablishments in England |
https://en.wikipedia.org/wiki/Group%20Policy | Group Policy is a feature of the Microsoft Windows NT family of operating systems (including Windows 7, Windows 8.1, Windows 10, Windows 11, and Windows Server 2003+) that controls the working environment of user accounts and computer accounts. Group Policy provides centralized management and configuration of operating systems, applications, and users' settings in an Active Directory environment. A set of Group Policy configurations is called a Group Policy Object (GPO). A version of Group Policy called Local Group Policy (LGPO or LocalGPO) allows Group Policy Object management without Active Directory on standalone computers.
Active Directory servers disseminate group policies by listing them in their LDAP directory under objects of class groupPolicyContainer. These refer to fileserver paths (attribute gPCFileSysPath) that store the actual group policy objects, typically in an SMB share \\domain.com\SYSVOL shared by the Active Directory server. If a group policy has registry settings, the associated file share will have a file registry.pol with the registry settings that the client needs to apply.
The Policy Editor (gpedit.msc) is not provided on Home versions of Windows XP/Vista/7/8/8.1/10/11.
Operation
Group Policies, in part, control what users can and cannot do on a computer system. For example, a Group Policy can be used to enforce a password complexity policy that prevents users from choosing an overly simple password. Other examples include: allowing or preventing unidentified users from remote computers to connect to a network share, or to block/restrict access to certain folders. A set of such configurations is called a Group Policy Object (GPO).
As part of Microsoft's IntelliMirror technologies, Group Policy aims to reduce the cost of supporting users. IntelliMirror technologies relate to the management of disconnected machines or roaming users and include roaming user profiles, folder redirection, and offline files.
Enforcement
To accomplish the goal of central management of a group of computers, machines should receive and enforce GPOs. A GPO that resides on a single machine only applies to that computer. To apply a GPO to a group of computers, Group Policy relies on Active Directory (or on third-party products like ZENworks Desktop Management) for distribution. Active Directory can distribute GPOs to computers which belong to a Windows domain.
By default, Microsoft Windows refreshes its policy settings every 90 minutes with a random 30 minutes offset. On domain controllers, Microsoft Windows does so every five minutes. During the refresh, it discovers, fetches and applies all GPOs that apply to the machine and to logged-on users. Some settings - such as those for automated software installation, drive mappings, startup scripts or logon scripts - only apply during startup or user logon. Since Windows XP, users can manually initiate a refresh of the group policy by using the gpupdate command from a command prompt.
Group Policy |
https://en.wikipedia.org/wiki/Mitzi%20Kapture | Mitzi Kapture (born Mitzi Gaynor Donahue; May 2, 1962) is an American actress, known for her role as Sgt. Rita Lee Lance in the CBS/USA Network crime drama series Silk Stalkings from 1991 to 1995.
Life and career
Kapture was born in Yorba Linda, California, and raised in Atlanta, Georgia. She began her career in films such as Lethal Pursuit (1988), Angel III: The Final Chapter (1988), Liberty & Bash (1989), and The Vagrant (1992), before moving to television. She gained exposure with her first regular series role as Sergeant Rita Lee Lance in the television series Silk Stalkings. Silk Stalkings premiered on CBS and USA, but later moved solely to USA Network. The show aired for eight seasons and became USA network's highest-rated original drama series. She played Rita, the other half of the two "Sams" for almost five years. Paired with Rob Estes, who played Sergeant Chris Lorenzo, Kapture gained recognition along with her co-star. Sergeant Lance eventually became Lieutenant Lance by the time Kapture left the series in 1995 to have her first daughter. During her time with the series, Kapture also directed episodes.
Kapture returned to television in 1997, starring in two made-for-USA-Network movies. She played lead roles in USA Pictures Originals telemovies, Perfect Crime (based on a true story, also called Hide and Seek: The Joanne Jensen Story), which also starred Jasmine Guy, and His Bodyguard with Robert Guillaume. She returned to series television in a lead role on Baywatch as Alexis Ryker.
From 2002 through 2005, she played the seductive Anita Hodges on the CBS daytime soap opera The Young and the Restless, credited as Mitzi Kapture Donahue. She also starred in the made-for-Lifetime television movie Night of Terror, which premiered March 26, 2007. In her latest film, she played the role of a therapist specializing in autism in the independent feature God's Ears, released in 2008 and on DVD in 2012.
In 2010, she guest-starred in an episode of the CBS sitcom Rules of Engagement.
Filmography
References
External links
1962 births
20th-century American actresses
21st-century American actresses
Living people
People from Yorba Linda, California
American television actresses
American stage actresses
American soap opera actresses
American film actresses
Actresses from California |
https://en.wikipedia.org/wiki/TCN | TCN is the flagship television station of the Nine Network in Australia. The station is currently located at 1 Denison Street, North Sydney. The licence, issued to a company named Television Corporation Ltd headed by Sir Frank Packer, was one of the first four licences (two in Sydney, two in Melbourne) to be issued for commercial television stations in Australia. TCN-9 is the home of the NRL coverage and national-level Nine News bulletins.
History
TCN began broadcasting on 16 September 1956, and became the first television station in Australia to begin regular transmissions. Test broadcasts, initially consisting of a test slide and later documentaries and dramas, had commenced two months earlier on 13 July 1956. The first TV tower was built there at 24 Artarmon Rd, Willoughby, in 1956 and rose 171 m (561 ft) in height, but was replaced by a taller one in 1965 which is the tallest lattice tower in Australia at 233 m (764 ft), and is now operated by TXA Australia which operates another tower nearby at Artarmon.
The first words spoken on the station were by John Godson, who introduced the station audio-only, shortly before the first program, This Is Television, was introduced by Bruce Gyngell. As Godson's voice only was heard, Gyngell (who spoke and was seen) is regarded as the first person to "appear" on Australian television. Original footage of Gyngell's opening address is not believed to exist but it was re-created in 1959 to have a representation in the archives (albeit, not the real thing). Other early programming included the 1958 variety music program Bandstand which was launched by Brian Henderson. It lasted for 14 years on the station and launched the careers of many Australian performers.
In 1957, the station formed an affiliation with Melbourne station HSV-7, allowing them to share programming. In 1963, station affiliations changed; TCN-9 formed part of the National Television Network with GTV-9 in Melbourne, QTQ-9 in Brisbane and NWS-9 in Adelaide. These stations formed the basis of what is now the Nine Network, although only the Sydney and Melbourne stations were owned by the Packer-controlled company Nine Network Limited.
On Sir Frank Packer's death in 1974 ownership of Nine Network passed to his younger son Kerry Packer. Kerry's older brother Clyde Packer had been groomed to take over from their father but after a bitter split with his father ca. 1972 he relinquished his role in the company and subsequently moved to the USA.
On 2 March 1981 , the station began broadcasting at the Kingsgate Hyatt Tower (now Elan Building) on UHF channel 49, later moving to UHF channel 52 in February 1983 to allow for ABC and SBS to set up transmitters there. This transmitter was installed to cover areas of central Sydney where reception is affected by the ghosting caused by the high-rise buildings in Sydney's central business district.
In January 1987, Kerry Packer sold the Sydney and Melbourne stations to Alan Bond's Bond Media for $1.055 bill |
https://en.wikipedia.org/wiki/StrataCom | StrataCom, Inc. was a supplier of Asynchronous Transfer Mode (ATM) and Frame Relay high-speed wide area network (WAN) switching equipment. StrataCom was founded in Cupertino, California, United States, in January 1986, by 26 former employees of the failing Packet Technologies, Inc. StrataCom produced the first commercial cell switch, also known as a fast-packet switch. ATM was one of the technologies underlying the world's communications systems in the 1990s.
Origins of the IPX at Packet Technologies
Internet pioneer Paul Baran was an employee of Packet Technologies and provided a spark of invention at the initiation of the Integrated Packet Exchange (IPX) project (StrataCom's IPX communication system is unrelated to Novell's IPX Internetwork Packet Exchange protocol).
The IPX was initially known as the PacketDAX, which was a play on words of Digital access and cross-connect system (or DACS). A rich collection of inventions were contained in the IPX, and many were provided by the other members of the development team. The names on the original three IPX patents are Paul Baran, Charles Corbalis, Brian Holden, Jim Marggraff, Jon Masatsugu, David Owen and Pete Stonebridge. StrataCom's implementation of ATM was pre-standard and used 24 byte cells instead of standards-based ATM's 53 byte cells. However, many of concepts and details found in the ATM set of standards were derived directly from StrataCom's technology, including the use of CRC-based framing on its links.
The IPX development
The IPX's first use was as a 4-1 voice compression system. It implemented Voice-Activity-Detection (VAD) and ADPCM, which together, gave 4-1 compression allowing 96 telephone calls to be fit into the space of 24. The IPX was also used as an enterprise voice-data networking system as well as a global enterprise networking system. McGraw-Hill's Data communications Magazine included the IPX in its list of "20 Most Significant Communications Products of the Last 20 Years" in a 1992 edition.
The Beta test of the IPX was in Michigan Bell between Livonia, Plymouth, and Northville, 3 suburbs of Detroit. The first customer shipment was to the May Company between department stores in San Diego and Los Angeles. The most significant early use of the IPX was as the backbone of the Covia/United Airlines flight reservation system. It also was used in multiple corporate networks including those of CompuServe, Intel and Hewlett-Packard. The IPX's most successful use was as the first Frame Relay networking product. It formed the core of the AT&T and CompuServe Frame Relay networks. The BPX, which was produced in 1993, increased the speed and sophistication of the Frame Relay offering. It also supported the 53 byte cells of the ATM standard instead the IPX's 24 byte cells. The original IPX product was also enhanced and re-introduced as the IGX.
The IPX product
The cards in the original IPX system were:
The PCC — The Processor Control Card — a Motorola 68000 based sh |
https://en.wikipedia.org/wiki/30%20Minute%20Meals | 30 Minute Meals is a Food Network show hosted by Rachael Ray. Her first of four shows on Food Network, its original run aired from November 17, 2001, until May 5, 2012. The show specializes in convenience cooking for those with little time to cook. The show is recorded live-to-tape, with Ray doing almost all preparation in real time. The show was awarded an Emmy for Best Daytime Service Show in 2006.
A common feature on the program is the creation of new versions of classic dishes (including clam chowder and macaroni and cheese), some of which are traditionally slow to cook. Ray focuses on creating meals in less than 30 minutes.
Ray has also done two specials with the title Thanksgiving in 60, about preparing a Thanksgiving dinner in one hour.
Each episode Ray opens the show by saying "Hi there, I'm Rachael Ray and I make 30-minute meals. Now that means in the time it takes you to watch this program, I will have made a delicious and healthy meal from start to finish."
A 30-episode revival was announced on January 25, 2019 and began airing on April 1, 2019.
About the show
Rachael Ray's 30 Minute Meals, based on the cookbook series, debuted on November 17, 2001, and ended production in 2012, then was revived in 2019. After writing and releasing her cookbook in 1999, Rachael Ray went on NBC's Today to make soup with Al Roker. Two weeks later, she had two pilot shows on TV.
Criticism of the show
Criticism of Rachael Ray's show has been levied despite its successes. Ray had no formal cooking experience, leading to complaints about the appearance of her food.
Charlie Dougiello, Ray's director of publicity stated, "Rachael always says that some of the criticisms of her as a chef are correct. She is not a chef. She whips up meals in a way some chefs would cringe at. If she slips up, she slips up. We don't stop taping. It is just like life."
Books
The TV series has also led to a group of cookbooks.
Since the original 30 Minute Meals: Comfort Foods
came out, several other books have also been published:
References
External links
30 Minute Meals at foodnetwork.com
30 Minute Meals at Rachael Ray's Official Site
2001 American television series debuts
2000s American cooking television series
2010s American cooking television series
Food Network original programming
2012 American television series endings
2019 American television series debuts
American television series revived after cancellation |
https://en.wikipedia.org/wiki/TMS9900 | The TMS9900 was one of the first commercially available, single-chip 16-bit microprocessors. Introduced in June 1976, it implemented Texas Instruments' TI-990 minicomputer architecture in a single-chip format, and was initially used for low-end models of that lineup.
Its 64-pin DIP format made it more expensive to implement in smaller machines than the more common 40-pin format, and it saw relatively few design wins outside TI's own use. Among those uses was their TI-99/4 and TI-99/4A home computers, which ultimately sold about 2.8 million units.
Microcomputer-on-chip implementations of the 9900 in 40-pin packages included the TMS9940, TMS9980/81, TMS9995. The TMS99105/10 was the last iteration of the 9900 in 1981 and incorporated features of TI's 990/10 minicomputer.
By the mid-1980s the microcomputer field was moving to 16-bit systems like the Intel 8088 and newer 16/32-bit designs like the Motorola 68000. With no obvious future for the chip, TI turned its attention to special-purpose processors like the Texas Instruments TMS320, introduced in 1983.
History
The TMS9900 was designed as a single chip version of the TI 990 minicomputer series, much like the Intersil 6100 was a single chip PDP-8 (12 bit), and the Fairchild 9440 and Data General mN601 were both one-chip versions of Data General's Nova. Unlike multi-chip 16-bit microprocessors such as the National Semiconductor IMP-16 or DEC LSI-11, some of which predated the TMS9900, the 9900 was a single-chip, self-contained 16-bit microprocessor.
The minicomputer roots of the TMS9900 give rise to a number of architectural features that are not commonly found on designs that started from a blank sheet. Notable among these was the TMS9900's use of processor registers that are mapped into main memory. This allows for fast context switching, which can be accomplished by changing a single register, the Workspace Pointer, to point to the first entry in a list of register values. More traditional designs would require the entire set of internal registers to be stored out to memory or the stack.
The downside to this approach is that accessing these registers is more time-consuming. In a minicomputer implementation with fast memory, the effect is relatively small and the upside in a real-time or multi-tasking environment is significant as context switches are common. In other roles, like single-user microcomputers, this tradeoff may not be worthwhile. The 40-pin implementations of the 9900 included 128 or 256 bytes of fast onboard RAM for registers.
TI used the same architecture across different divisions for corporate synergy: "one company, one computer architecture". In the late 1970s Walden C. Rhines gave a presentation of the TMS99110, then code-named “Alpha”, to an IBM group developing a personal computer. "We wouldn't know until 1981 just what we had lost" because IBM chose the Intel 8088 for the IBM PC, he recalled. One factor was the lack of a roadmap for accessing more than 64K of logi |
https://en.wikipedia.org/wiki/MediaTransparency | MediaTransparency was a project begun in 1999 which monitored the financial ties of conservative think tanks to conservative foundations in the United States. Its database tracked over 50,000 grants awarded since 1985, which total more than US$3.2 billion. It was run by Cursor, Inc. before being acquired by Media Matters for America in 2008.
Cursor.org was dedicated to "news, opinion, analysis and investigative data related to links between conservative philanthropies and the organizations and people they fund, and their influence in the media."
References
American political websites |
https://en.wikipedia.org/wiki/Mount%20Wuteve | Mount Wuteve is a mountain located in Liberia, whose summit is the highest point in Liberia. It is located in the Guinea Highlands range, whose parent range is the West Africa Mountains. Data from the Shuttle Radar Topography Mission reveals that the correct elevation of its summit is 1,440 meters, and not the previously quoted 1,380 meters. It is also known as Mount Wologizi among locals of the Loma tribe.
References
West Africa Mountains
Guinea Highlands
Mount Wuteve
Wuteve
Lofa County
Highest points of countries |
https://en.wikipedia.org/wiki/Flow%20%28television%29 | In television programming, flow is how channels and networks try to hold their audience from program to program, or from one segment of a program to another. Thus, it is the flow of television material from one element to the next. The term is also significant in television studies, the academic analysis of the medium. Media scholar Raymond Williams is responsible for first using the term in this sense. He emphasized that flow is "the defining characteristic of broadcasting, simultaneously as a technology and as a cultural form." "It is evident that what is now called 'an evening's viewing' is in some ways planned by providers and then by viewers as a whole; that it is in any event planned in discernible sequences which in this sense override particular program units". Williams argued that ads glued programs together which created the sense of television flow with a shift "from the concept of sequence as programming to the concept of flow."
Since the 1990s, the concept of flow has been transformed by new technologies and programming strategies that free the viewer from the old television model. VCRs, DVDs, DVRs (such as TiVo), Video-on-Demand, and online video sources all allow the viewer to construct their own flow. They are no longer limited to a choice of a small number of networks, as they were in the 1950s–1970s. Consequently, the concept of provider-planned flow is dying out and may not survive beyond the broadcast era of television.
Production and purpose
Williams claims that flow is determined by television's "stage of development," but Rick Altman, Professor of Cinemas and Comparative Literature at the University of Iowa, argues that the culture of the medium produces and determines its flow. He notes that the soundtrack is unique to American culture and is one of the techniques that shapes the viewer's flow or his or her experience watching television. He notes that the soundtrack provides the viewer with sufficient plot, cues important events by sound (sound advance, e.g. clapping before it is seen on screen), and creates continuity. These sonic elements create an intermittent flow of television. The goal is not to get the viewers to watch carefully, but to keep them from turning the television off.
References
Sources
Williams, Raymond (1974). Television: Technology and Cultural Form. London: Fontana.
External links
Flow — an online journal of television and media studies
"Television Studies Information" — museum of broadcast communications.
Television terminology |
https://en.wikipedia.org/wiki/Central%20do%20Brasil | Central do Brasil () is a major train station in the Brazilian city of Rio de Janeiro. It is the last stop of Rio's railway network, as well as a hub for connection with the city subway and a bus station. Central do Brasil was also a preeminent stop in the interstate Central do Brasil railroad, which linked Rio de Janeiro with São Paulo and Minas Gerais, though the railroad is now deactivated. The station is located in downtown Rio de Janeiro, along the Avenida Presidente Vargas and across from the Campo de Santana park. It was built in the Art Deco style.
References
External links
Photo Album of the Brazilian Railroads
Line 1 (Rio de Janeiro)
Metrô Rio stations
SuperVia stations
Art Deco architecture in Brazil
Transport infrastructure completed in 1937
National heritage sites of Rio de Janeiro (state) |
https://en.wikipedia.org/wiki/Data%20remanence | Data remanence is the residual representation of digital data that remains even after attempts have been made to remove or erase the data. This residue may result from data being left intact by a nominal file deletion operation, by reformatting of storage media that does not remove data previously written to the media, or through physical properties of the storage media that allow previously written data to be recovered. Data remanence may make inadvertent disclosure of sensitive information possible should the storage media be released into an uncontrolled environment (e.g., thrown in the bin (trash) or lost).
Various techniques have been developed to counter data remanence. These techniques are classified as clearing, purging/sanitizing, or destruction. Specific methods include overwriting, degaussing, encryption, and media destruction.
Effective application of countermeasures can be complicated by several factors, including media that are inaccessible, media that cannot effectively be erased, advanced storage systems that maintain histories of data throughout the data's life cycle, and persistence of data in memory that is typically considered volatile.
Several standards exist for the secure removal of data and the elimination of data remanence.
Causes
Many operating systems, file managers, and other software provide a facility where a file is not immediately deleted when the user requests that action. Instead, the file is moved to a holding area (i.e. the "trash"), making it easy for the user to undo a mistake. Similarly, many software products automatically create backup copies of files that are being edited, to allow the user to restore the original version, or to recover from a possible crash (autosave feature).
Even when an explicit deleted file retention facility is not provided or when the user does not use it, operating systems do not actually remove the contents of a file when it is deleted unless they are aware that explicit erasure commands are required, like on a solid-state drive. (In such cases, the operating system will issue the Serial ATA TRIM command or the SCSI UNMAP command to let the drive know to no longer maintain the deleted data.) Instead, they simply remove the file's entry from the file system directory because this requires less work and is therefore faster, and the contents of the file—the actual data—remain on the storage medium. The data will remain there until the operating system reuses the space for new data. In some systems, enough filesystem metadata are also left behind to enable easy undeletion by commonly available utility software. Even when undelete has become impossible, the data, until it has been overwritten, can be read by software that reads disk sectors directly. Computer forensics often employs such software.
Likewise, reformatting, repartitioning, or reimaging a system is unlikely to write to every area of the disk, though all will cause the disk to appear empty or, in the c |
https://en.wikipedia.org/wiki/Acronym%20Finder | Acronym Finder (AF) is a free, online, searchable dictionary and database of abbreviations (acronyms, initialisms, and others) and their meanings.
The entries are classified into categories such as Information Technology, Military/Government, Science, Slang/Pop Culture etc. It also contains a database of the United States and Canadian postal codes. For abbreviations with multiple meanings, they are listed by popularity, with the most common one being listed first. it claims to have over a million "human-edited" and verified definitions.
History
Acronym Finder was registered and the database put online by Michael K. Molloy of Colorado in 1997, but he began compiling it in 1985, working as a computer systems officer for the USAF. Molloy first saw the need of an acronym list while integrating computers at the Randolph Air Force Base in Texas, his first acronym list running up to 30 pages. When he had retired and put AF online in 1997, his list already had 43,000 acronyms. It began mainly as a list of Military/Government abbreviations before expanding to other areas.
Molloy and his wife served as the editors of the website, verifying user submissions for abbreviations and adding others they found to the database. Molloy has also provided opinions on abbreviations such as "MSG" which Madison Square Garden wanted as a domain name (msg.com), claiming trademark to the abbreviated letters. He stated that MSG also stood for more common things such as monosodium glutamate and message, among others. The Garden in the end settled out of court and came to own msg.com.
The website was maintained under Mountain Data Systems, LLC by Molloy, before being sold off and eventually coming under the ownership of Farlex, Inc. publishers of Thefreedictionary.com.
Content
The website contains a database of meanings and expansions for abbreviations, acronyms, initialisms mainly in English but includes some entries in other languages such as French, German, Spanish etc. as well. It is freely accessible. The entries are further classified into categories such as Information Technology, Military/Government, Science, Slang/Pop Culture etc. It also contains a database of US and Canadian postal codes which are shown on a Map along with location information. Abbreviations with multiple expansions are listed by popularity with the most common one being presented first, these can be sorted alphabetically as well.
Anyone can contribute to the database by submitting abbreviations and their meanings, these are reviewed by an editor and categorized before being added to the database. While the database has been described as fairly accurate errors have been found in the meanings and expansions of abbreviations. The website does not list sources for the abbreviations and their meanings but it does identify people who have contributed more than 50 abbreviations to the database.
The database only contains abbreviations and their expansions and does not list other data such as gram |
https://en.wikipedia.org/wiki/SIAM%20Journal%20on%20Computing | The SIAM Journal on Computing is a scientific journal focusing on the mathematical and formal aspects of computer science. It is published by the Society for Industrial and Applied Mathematics (SIAM).
Although its official ISO abbreviation is SIAM J. Comput., its publisher and contributors frequently use the shorter abbreviation SICOMP.
SICOMP typically hosts the special issues of the IEEE Annual Symposium on Foundations of Computer Science (FOCS) and the Annual ACM Symposium on Theory of Computing (STOC), where about 15% of papers published in FOCS and STOC each year are invited to these special issues. For example, Volume 48 contains 11 out of 85 papers published in FOCS 2016.
References
External links
SIAM Journal on Computing
bibliographic information on DBLP
Computer science journals
Academic journals established in 1972
Computing
Bimonthly journals |
https://en.wikipedia.org/wiki/List%20of%20MacGyver%20%281985%20TV%20series%29%20episodes | MacGyver is an American action-adventure television series created by Lee David Zlotoff and Henry Winkler. The show ran for seven seasons on ABC in the United States and various other networks abroad from 1985 to 1992.
The pilot episode was first aired in the US on September 29, 1985. The show's final episode aired on April 25, 1992 on ABC (the network aired a previously unseen episode for the first time on May 21, 1992, but it was originally intended to air before the series finale). Two television movies, MacGyver: Lost Treasure of Atlantis and MacGyver: Trail to Doomsday, aired on ABC in 1994.
Series overview
Episodes
Season 1 (1985–86)
Season 2 (1986–87)
Season 3 (1987–88)
Season 4 (1988–89)
Season 5 (1989–90)
Season 6 (1990–91)
Season 7 (1991–92)
TV films (1994)
References
External links
Episodes
Lists of American action television series episodes
zh:百戰天龍#劇集列表 |
https://en.wikipedia.org/wiki/Sequence%20point | In C and C++, a sequence point defines any point in a computer program's execution at which it is guaranteed that all side effects of previous evaluations will have been performed, and no side effects from subsequent evaluations have yet been performed. They are a core concept for determining the validity of and, if valid, the possible results of expressions. Adding more sequence points is sometimes necessary to make an expression defined and to ensure a single valid order of evaluation.
With C11 and C++11, usage of the term sequence point has been replaced by sequencing. There are three possibilities:
An expression's evaluation can be sequenced before that of another expression, or equivalently the other expression's evaluation is sequenced after that of the first.
The expressions' evaluation is indeterminately sequenced, meaning one is sequenced before the other, but which is unspecified.
The expressions' evaluation is unsequenced.
The execution of unsequenced evaluations can overlap, leading to potentially catastrophic undefined behavior if they share state. This situation can arise in parallel computations, causing race conditions, but undefined behavior can also result in single-threaded situations. For example, a[i] = i++; (where is an array and is an integer) has undefined behavior.
Examples of ambiguity
Consider two functions f() and g(). In C and C++, the + operator is not associated with a sequence point, and therefore in the expression f()+g() it is possible that either f() or g() will be executed first. The comma operator introduces a sequence point, and therefore in the code f(),g() the order of evaluation is defined: first f() is called, and then g() is called.
Sequence points also come into play when the same variable is modified more than once within a single expression. An often-cited example is the C expression i=i++, which apparently both assigns i its previous value and increments i. The final value of i is ambiguous, because, depending on the order of expression evaluation, the increment may occur before, after, or interleaved with the assignment. The definition of a particular language might specify one of the possible behaviors or simply say the behavior is undefined. In C and C++, evaluating such an expression yields undefined behavior. Other languages, such as C#, define the precedence of the assignment and increment operator in such a way that the result of the expression i=i++ is guaranteed.
Behavior
Up to C++03
In C and C++, sequence points occur in the following places. (In C++, overloaded operators act like functions, and thus operators that have been overloaded introduce sequence points in the same way as function calls.)
Between evaluation of the left and right operands of the && (logical AND), || (logical OR) (as part of short-circuit evaluation), and comma operators. For example, in the expression , all side effects of the sub-expression are completed before any attempt to access .
Between the evalua |
https://en.wikipedia.org/wiki/Cray-2 | The Cray-2 is a supercomputer with four vector processors made by Cray Research starting in 1985. At 1.9 GFLOPS peak performance, it was the fastest machine in the world when it was released, replacing the Cray X-MP in that spot. It was, in turn, replaced in that spot by the Cray Y-MP in 1988.
The Cray-2 was the first of Seymour Cray's designs to successfully use multiple CPUs. This had been attempted in the CDC 8600 in the early 1970s, but the emitter-coupled logic (ECL) transistors of the era were too difficult to package into a working machine. The Cray-2 addressed this through the use of ECL integrated circuits, packing them in a novel 3D wiring that greatly increased circuit density.
The dense packaging and resulting heat loads were a major problem for the Cray-2. This was solved in a unique fashion by forcing the electrically inert Fluorinert liquid through the circuitry under pressure and then cooling it outside the processor box. The unique "waterfall" cooler system came to represent high-performance computing in the public eye and was found in many informational films and as a movie prop for some time.
Unlike the original Cray-1, the Cray-2 had difficulties delivering peak performance. Other machines from the company, like the X-MP and Y-MP, outsold the Cray-2 by a wide margin. When Cray began development of the Cray-3, the company chose to develop the Cray C90 series instead. This is the same sequence of events that occurred when the 8600 was being developed, and as in that case, Cray left the company.
Initial design
With the successful launch of his famed Cray-1, Seymour Cray turned to the design of its successor. By 1979 he had become fed up with management interruptions in what was now a large company, and as he had done in the past, decided to resign his management post and move to form a new lab. As with his original move to Chippewa Falls, Wisconsin from Control Data HQ in Minneapolis, Minnesota, Cray management understood his needs and supported his move to a new lab in Boulder, Colorado. Working as an independent consultant at these new Cray Labs, starting in 1980 he put together a team and started on a completely new design. This Lab would later close, and a decade later a new facility in Colorado Springs would open.
Cray had previously attacked the problem of increased speed with three simultaneous advances: more functional units to give the system higher parallelism, tighter packaging to decrease signal delays, and faster components to allow for a higher clock speed. The classic example of this design is the CDC 8600, which packed four CDC 7600-like machines based on ECL logic into a 1 × 1 meter cylinder and ran them at an 8 ns cycle speed (125 MHz). Unfortunately, the density needed to achieve this cycle time led to the machine's downfall. The circuit boards inside were densely packed, and since even a single malfunctioning transistor would cause an entire module to fail, packing more of them onto the cards greatly in |
https://en.wikipedia.org/wiki/Beagle%20Bros | Beagle Bros was an American software company that specialized in creating personal computing products. Their primary focus was on the Apple II family of computers. Although they ceased business in 1991, owner Mark Simonsen permitted the Beagle Bros name and logo to be included on the 30th anniversary reboot of I. O. Silver, released on December 12, 2014 by former Beagle programmer Randy Brandt.
History
Beagle Bros was founded in 1980 by Bert Kersey and expanded over the years to include a wide variety of staff members, programmers, and designers. Whereas most software companies focused on professional users and business systems, Kersey founded the company with the intention of capitalizing on the "hobbyist" market that had formed when affordable personal computers became more readily available. Apple Mechanic allowed users to create their own shape tables (an early form of sprites) to create their own games, DOS Boss let users patch the disk operating system, and Beagle Bag had a number of games written in BASIC that people could utilize. Beagle Bros' catalog and print advertisements featured many playful programming tips about the Apple II system, many in the form of short Applesoft BASIC programs that took advantage of undocumented or unexpected behavior. Beagle Bros used woodcut and other 19th century artwork in its printed designs.
When the Apple IIGS was released, Beagle Bros was among the first companies to release content for the platform. Both Platinum Paint and BeagleWrite GS (acquired and repackaged) are still regarded as being among the high points of commercial IIGS software.
Beagle Bros began producing add-ons for the AppleWorks, its first being the MacroWorks keyboard shortcut utility by Randy Brandt. Beagle Bros programmer Alan Bird later devised an API for creating AppleWorks add-ons, which they dubbed TimeOut. TimeOut programmers Alan Bird, Randy Brandt and Rob Renstrom were tapped by Claris to develop AppleWorks 3.0, and the TimeOut API itself became a part of AppleWorks with version 4.0. Eventually the TimeOut API was made public and a number of non-Beagle TimeOut applications were released.
In 1991, Mark Simonsen licensed the Beagle Bros Apple II line to Quality Computers. Quality Computers subsequently went through several acquisitions and no longer exists. Multiple Beagle Bros products were released as freeware in the mid-1990s, including most of the company's early utilities and games. Today, their programs are available on the Internet.
BeagleWorks, the company's main Macintosh product, was licensed to WordPerfect Corporation in 1992, where it became WordPerfect Works. This product was later discontinued after WordPerfect was acquired by Novell. The company also produced a few small Macintosh and PC utilities.
Many former employees have continued to be involved in the software industry, such as Joe Holt who co-authored iMovie, and Alan Bird who worked on Eudora and the OneClick shortcut utility for Macintosh. Randy B |
https://en.wikipedia.org/wiki/Glenbrook%20rail%20accident | The Glenbrook rail accident occurred on 2 December 1999 at 8:22 am on a curve east of Glenbrook railway station on the CityRail network between Glenbrook and Lapstone, in the Blue Mountains of New South Wales, Australia. Seven passengers were killed and 51 passengers were taken to hospital with injuries when a CityRail electric interurban train collided with the rear wagon of the long-haul Perth-to-Sydney Indian Pacific.
Overview
The Indian Pacific train was authorised to pass a red signal at Glenbrook and stopped at the next signal, also red. The driver alighted to use the lineside signal telephone to call the signaller for authority to pass the signal at danger; as a component of the phone was missing, he incorrectly believed it to be defective. A delay of approximately seven minutes resulted despite the locomotive having a radio (at that time it was not a procedure for the National Rail Corporation to use a radio to contact signal boxes).
The interurban train restarted with authority after stopping at the red signal at Glenbrook and collided shortly after with the rear of the Indian Pacific train waiting at the second failed signal. Several factors were involved, from equipment breakdown to poor phrasing of the safe working rules: the most important was that the interurban picked up too much speed and the driver was not able to see the rear of the Indian Pacific around a sharp curve in a deep cutting in time to avoid a collision. This is essentially equivalent to a blind corner.
Visibility
The track was curved to the left, the train was using the left-hand track, the driver was sitting on the left side of the train, and the track was in a narrow rock cutting. These four factors contributed to less than average visibility.
Inquiry
A Commission of Inquiry headed by Justice Peter McInerney investigated the accident.
Causes
The Commission found that the accident occurred after a power failure disabled two consecutive automatic signals: due to their fail-safe design, both exhibited danger (red).
Both trains obtained permission from the signalman at Penrith to pass the first signal at danger. The driver of the Indian Pacific obeyed the rule requiring him to proceed with "extreme caution", but the driver of the interurban train failed to do so and caught up with the Indian Pacific.
The Commission found fault with a number of procedures, their application by railway employees, and the training those employees had received. Among other factors, it found that:
the signalman was unable to monitor the position of the Indian Pacific, so was unaware it had not cleared the second signal;
safety-critical communication was too informal;
the train controller in Sydney told the driver of the interurban train by radio, "it's only an auto... just trip past", thereby potentially misleading the driver into believing that the signal section was clear; the signalman in Penrith was not aware of this exchange;
the driver of the interurban train failed t |
https://en.wikipedia.org/wiki/ACE%20%28compressed%20file%20format%29 | In computing, ACE is a proprietary data compression archive file format developed by Marcel Lemke, and later bought by e-merge GmbH. The peak of its popularity was 1999–2001, when it provided slightly better compression rates than RAR, which has since become more popular.
WinAce
WinAce, maintained by e-merge GmbH, is used to compress and decompress ACE files under Microsoft Windows. When installed, it lets the user choose between paying for a registration or installing WhenU SaveNow adware. e-merge GmbH also produces a Commandline ACE for DOS; and a freeware command-line interface decompression tool for Linux (i386) and macOS called "Unace". e-merge GmbH also provides several libraries for developers, including a freeware decompression DLL called "unace.dll". Some third-party archivers can read the format using this DLL. None of the above is open source free software.
On November 23, 2007, version 2.69 of WinACE was released, including a less-intrusive adware application, MeMedia AdVantage, which replaces WhenU. No other major changes are in this release.
Other implementations
An older version of an Unace 1.2b is free software and licensed under the GPL by the author Marcel Lemke, but it cannot extract ACE archives from version 2.0 and newer.
A newer version of Unace 2.5 that supports ACE 2.0 archives is available under a restrictive source available license, also by Marcel Lemke.
An older, independent C implementation is part of XAD-Master libxad by Dirk Stöcker. It is limited to unpacking ACE 1.0 archives.
Since 2017, there is a BSD licensed python module and CLI utility by Daniel Roethlisberger, that supports unpacking of ACE 2.0 format archives.
Third-party support
Packing of ACE files is licensed as proprietary information and only available through WinACE, while unpacking of ACE files is supported by a number of third-party archivers. However, virtually all of them (the ones that support ACE 2.x format) do this by using the proprietary "unace.dll" from e-merge GmbH.
Use for malware distribution
Since at least 2015, ACE archives have been used to deliver malware to victims by e-mail. This tactic was viable because popular archiving software was able to uncompress ACE archives, but support for the ACE format in security products such as mail filters, web content filters, and anti-virus software was generally weak.
Security vulnerabilities
In February 2019 several major security vulnerabilities were found in the unacev2.dll library which is used by WinRAR and other archiving products. Since WinACE is abandonware, users are advised against opening ACE archives in WinRAR and possibly other products using this library. WinRAR stopped supporting ACE as of version 5.70, and similar products are following suit.
See also
Comparison of archive formats
Comparison of file archivers
List of archive formats
External links
Official Website - Web Archive Snapshot from 14.07.2017
Download link for last Version 2.69i - Web Archive Snapshot from |
https://en.wikipedia.org/wiki/XORP | XORP is an open-source Internet Protocol routing software suite originally designed at the International Computer Science Institute in Berkeley, California. The name is derived from eXtensible Open Router Platform. It supports OSPF, BGP, RIP, PIM, IGMP, OLSR.
The product is designed from principles of software modularity and extensibility and aims at exhibiting stability and providing feature requirements for production use while also supporting networking research. The development project was founded by Mark Handley in 2000. Receiving funding from Intel, Microsoft, and the National Science Foundation, it released its first production software in July 2004. The project was then run by Atanu Ghosh of the International Computer Science Institute, in Berkeley, California.
In July 2008, the International Computer Science Institute transferred the XORP technology to a new entity, XORP Inc., a commercial startup founded by the leaders of the opensource project team and backed by Onset Ventures and Highland Capital Partners. In February 2010, XORP Inc. was wound up, a victim of the recession. However the open source project continued, with the servers based at University College London. In March 2011, Ben Greear became the project maintainer and the www.xorp.org server is now hosted by Candela Technologies.
The XORP codebase consists of around 670,000 lines of C++ and is developed primarily on Linux, but supported on FreeBSD, OpenBSD, DragonFlyBSD, NetBSD. Support for XORP on Microsoft Windows was recently re-added to the development tree. XORP is available for download as a Live CD or as source code via the project's homepage.
The software suite was selected commercially as the routing platform for the Vyatta line of products in its early releases, but later has been replaced with quagga.
Routing features
As of 2009, the project supports the following routing protocols:
Static routing
Routing Information Protocol (RIP and RIPng):
(RIP version 2)
(RIP-2 MD5 Authentication)
(RIPng for IPv6)
Border Gateway Protocol:
(A Border Gateway Protocol 4 (BGP-4))
(Capabilities Advertisement with BGP-4)
(Multiprotocol Extensions for BGP-4)
(Use of BGP-4 Multiprotocol Extensions for IPv6 Inter-Domain Routing)
(BGP Communities Attribute)
(BGP Route Reflection - An Alternative to Full Mesh IBGP)
(Autonomous System Confederations for BGP)
(BGP Route Flap Damping)
(BGP Support for Four-octet AS Number Space)
(Definitions of Managed Objects for the Fourth Version of the Border Gateway Protocol (BGP-4) using SMIv2)
Open Shortest Path First version 2 (OSPFv2) and version 3 (OSPFv3):
(OSPF Version 2)
(The OSPF Not-So-Stubby Area (NSSA) Option)
(OSPF for IPv6)
PIM Sparse Mode (PIM-SM):
IGMP v1, v2, and v3:
(Internet Group Management Protocol, Version 2)
(Internet Group Management Protocol, Version 3)
Multicast Listener Discovery (MLD v1 and v2):
(Multicast Listener Discovery (MLD) for IPv6)
(Multicast Listener Discovery Version 2 (MLDv2) for IP |
https://en.wikipedia.org/wiki/Diablo%20630 | The Diablo 630 is a discontinued daisy wheel style computer printer sold by the Diablo Data Systems division of the Xerox Corporation beginning in 1980. The printer is capable of letter-quality printing; that is, its print quality is equivalent to the quality of an IBM Selectric typewriter or printer, the de facto quality standard of the time.
Overview
The printer is capable of this quality at a nominal speed of 30 characters per second (roughly twice the speed of the Selectric). Several technologies were introduced to enable this quality and speed:
The lightweight daisy wheel is rotated by a closed-loop servo and can be positioned rapidly and accurately. Because the wheel can turn in either direction, the next character is never more than 180° away from the previous character (and related characters are grouped together so the average "seek" is much less than 180°).
Like the "typeball" element on a Selectric, the daisy wheel can be easily changed, allowing for a wide variety of fonts and character pitches.
Some models can use wheels with two rows of characters, allowing for the machine to print in two different languages or with a large set of special symbols.
The printer uses cartridge-loaded ribbons; both an economical endless cloth ribbon and a high-quality single-use film ribbon were available, with colored ribbons provided by third parties. By contrast, Selectric-based printers can use only one type of ribbon—cloth or single-use carbon film—and were almost always equipped for the former for economic reasons.
The carriage is also servo-controlled and the printer can print with the carriage moving either forward or backward, saving most of the time that would otherwise be spent executing carriage returns.
The servo control of the carriage permitted the use of proportionally-spaced fonts, wherein each character does not have to occupy the same amount of horizontal space.
Unlike Selectric-based printers, daisy wheel printers support the entire ASCII printing character set.
Bidirectional paper motion is similarly servo-controlled, allowing quick printing of subscripts and superscripts as well as fast slewing past white space.
Servo control of both paper and carriage permitted the unit to be used for plotting, with resolution of 120×48 steps per inch. This was popular enough that special daisy wheels were made with a reinforced period (.), the character most often used for plotting.
The logic permits simultaneous motion of the wheel, the carriage, and the paper. The hammer automatically strikes only after all three motions complete. This minimized the time spent waiting for the motions to complete.
A related model, the Diablo 1620, includes a keyboard and strongly resembles a slightly overgrown Selectric typewriter. In fact, a "local/remote" switch permits it to be used as an offline typewriter as well as an interactive computer terminal. Unfortunately for a typist (in either role), the daisy wheel mechanism hides the area just |
https://en.wikipedia.org/wiki/Table%20cell | A table cell is one grouping within a chart table used for storing information or data. Cells are grouped horizontally (rows of cells) and vertically (columns of cells). Each cell contains information relating to the combination of the row and column headings it is collinear with. In software design, table cells are a key component in HTML and webpage building, and it is part of the <table> component. A coder may specify dimensions for a table cell, and use them to hold sections of webpages.
HTML usage
Kinds of cell in HTML
A table cell in HTML is a non-empty element and should always be closed. There are two different kinds of table cell in HTML: normal table cell and header cell. <td> denotes a table cell, the name implying 'data', while <th> denotes a table 'header'. The two can be used interchangeably, but it is recommended that header cell be only used for the top and side headers of a table.
Syntax
A table cell also must be nested within a <table> tag and a <tr> (table row) tag. If there are more table cell tags in any given row than in any other, the particular <tr> must be given a attribute declaring how many columns of cells wide it should be.
Example
An example of an HTML table containing 4 cells:
HTML source:
<table border="1">
<tr>
<td>
Cell 1
</td>
<td>
Cell 2
</td>
</tr>
<tr>
<td>
Cell 3
</td>
<td>
Cell 4
</td>
</tr>
</table>
Colspan and rowspan
Every row must have the same number of table data cells, occasionally table data cells have to span more than one column or row. In this case the tags colspan and/or rowspan are used - where they are set to a number.
See also
Tables in Wikipedia pages
Table (HTML)
External links
TH and TD elements
DHTML Reference: td
TD Tag
HTML tags
HTML |
https://en.wikipedia.org/wiki/SKI%20combinator%20calculus | The SKI combinator calculus is a combinatory logic system and a computational system. It can be thought of as a computer programming language, though it is not convenient for writing software. Instead, it is important in the mathematical theory of algorithms because it is an extremely simple Turing complete language. It can be likened to a reduced version of the untyped lambda calculus. It was introduced by Moses Schönfinkel and Haskell Curry.
All operations in lambda calculus can be encoded via abstraction elimination into the SKI calculus as binary trees whose leaves are one of the three symbols S, K, and I (called combinators).
Notation
Although the most formal representation of the objects in this system requires binary trees, for simpler typesetting they are often represented as parenthesized expressions, as a shorthand for the tree they represent. Any subtrees may be parenthesized, but often only the right-side subtrees are parenthesized, with left associativity implied for any unparenthesized applications. For example, ISK means ((IS)K). Using this notation, a tree whose left subtree is the tree KS and whose right subtree is the tree SK can be written as KS(SK). If more explicitness is desired, the implied parentheses can be included as well: ((KS)(SK)).
Informal description
Informally, and using programming language jargon, a tree (xy) can be thought of as a function x applied to an argument y. When evaluated (i.e., when the function is "applied" to the argument), the tree "returns a value", i.e., transforms into another tree. The "function", "argument" and the "value" are either combinators or binary trees. If they are binary trees, they may be thought of as functions too, if needed.
The evaluation operation is defined as follows:
(x, y, and z represent expressions made from the functions S, K, and I, and set values):
I returns its argument:
Ix = x
K, when applied to any argument x, yields a one-argument constant function Kx, which, when applied to any argument y, returns x:
Kxy = x
S is a substitution operator. It takes three arguments and then returns the first argument applied to the third, which is then applied to the result of the second argument applied to the third. More clearly:
Sxyz = xz(yz)
Example computation: SKSK evaluates to KK(SK) by the S-rule. Then if we evaluate KK(SK), we get K by the K-rule. As no further rule can be applied, the computation halts here.
For all trees x and all trees y, SKxy will always evaluate to y in two steps, Ky(xy) = y, so the ultimate result of evaluating SKxy will always equal the result of evaluating y. We say that SKx and I are "functionally equivalent" because they always yield the same result when applied to any y.
From these definitions it can be shown that SKI calculus is not the minimum system that can fully perform the computations of lambda calculus, as all occurrences of I in any expression can be replaced by (SKK) or (SKS) or (SK whatever) and the resulting expression |
https://en.wikipedia.org/wiki/989%20Studios | 989 Studios was a division of Sony Computer Entertainment America (SCEA) that developed games for PlayStation consoles and Windows personal computers. Their games include EverQuest, Twisted Metal III, Twisted Metal 4, Syphon Filter, Syphon Filter 2, Jet Moto 3, Bust a Groove, and others.
History
The 989 Sports name developed from a long history of name changes and corporate shuffling within Sony centered around operations in Foster City, California. In August 1995, the video game business of Sony Imagesoft was merged with the product development branch of SCEA, becoming Sony Interactive Studios America (SISA) In 1998, SISA was spun off from SCEA and was renamed 989 Studios. On April 1, 2000, 989 Studios was merged back into SCEA as a first party development group, in order to prepare for the then-upcoming PlayStation 2. SCEA continued to release sports games under the 989 Sports brand until the brand was retired in 2005.
Games
As Sony Interactive Studios America
2Xtreme (1996)
Blasto (1998)
CART World Series (1997)
ESPN Extreme Games (1995)
Jet Moto (1996)
Jet Moto 2 (1997)
MLB '98 (1997)
MLB '99 (1998)
MLB Pennant Race (1996)
NBA ShootOut 98 (1998)
NCAA Gamebreaker (1996)
NCAA Gamebreaker 98 (1997)
NHL FaceOff (1995)
NFL GameDay (1996)
NFL GameDay 97 (1996)
NFL GameDay 98 (1997)
Rally Cross (1997)
Spawn: The Eternal (1997)
Tanarus (1997)
Twisted Metal (1995)
Twisted Metal 2 (1996)
Warhawk (1995)
As 989 Studios
3Xtreme (1999)
Bust a Groove (Bust a Move: Dance & Rhythm Action in Japan) (1998)
Cardinal Syn (1998)
Cool Boarders 3 (1998)
Cool Boarders 4 (1999)
Cyberstrike 2 (1998)
EverQuest (1999)
Jet Moto 3 (1999)
Rally Cross 2 (1999)
Running Wild (1998)
Syphon Filter (1999)
Syphon Filter 2 (2000)
Twisted Metal III (1998)
Twisted Metal 4 (1999)
As 989 Sports
MLB 2000 (1999)
MLB 2001 (2000)
MLB 2002 (2001)
MLB 2003 (2002)
MLB 2004 (2003)
MLB 2005 (2004)
MLB 2006 (2005)
NBA 2005 (2004)
NBA ShootOut 2000 (1999)
NBA ShootOut 2001 (2000)
NBA ShootOut 2002 (2001)
NBA ShootOut 2003 (2002)
NBA ShootOut 2004 (2003)
NCAA Final Four 99 (1999)
NCAA Final Four 2000 (1999)
NCAA Final Four 2001 (2000)
NCAA Final Four 2002 (2001)
NCAA Final Four 2003 (2002)
NCAA Final Four 2004 (2003)
NCAA GameBreaker 99 (1998)
NCAA GameBreaker 2000 (1999)
NCAA GameBreaker 2001 (2000)
NCAA GameBreaker 2003 (2002)
NCAA GameBreaker 2004 (2003)
NFL GameDay 99 (1998)
NFL GameDay 2000 (1999)
NFL GameDay 2001 (2000)
NFL GameDay 2002 (2001)
NFL GameDay 2003 (2002)
NFL GameDay 2004 (2003)
NFL GameDay 2005 (2004)
NFL Xtreme (1998)
NFL Xtreme 2 (1999)
NHL FaceOff 99 (1998)
NHL FaceOff 2000 (1999)
NHL FaceOff 2001 (2001)
NHL FaceOff 2003 (2002)
Supercross Circuit (1999)
World Tour Soccer 2002 (2002)
World Tour Soccer 2003 (2003)
Formula One 2001 (2001)
See also
989 Sports Major League Baseball series
References
External links
PlayStation Studios
Companies based in San Diego
Video game companies established |
https://en.wikipedia.org/wiki/ATN | ATN is the Sydney flagship television station of the Seven Network in Australia. The licence, issued to a company named Amalgamated Television Services, a subsidiary of John Fairfax & Sons, was one of the first four licences (two in Sydney, two in Melbourne) to be issued for commercial television stations in Australia. The station formed an affiliation with GTV-9 Melbourne in 1957, in order to share content. In 1963, Frank Packer ended up owning both GTV-9 and TCN-9, so as a result the stations switched their previous affiliations. ATN-7 and HSV-7 joined to create the Australian Television Network, which later became the Seven Network. ATN-7 is the home of the national level Seven News bulletins.
History
ATN-7 began broadcasting on 2 December 1956 and became the third television station in Sydney to begin regular transmissions.
The station opened in 1956 with principal offices and studios located at Mobbs Lane, Epping. The initial black and white cameras and other equipment was supplied by the Marconi Company of England. Conversion to PAL colour occurred on 1 March 1975. Digital DVB-T commenced on 1 January 2001.
The initial transmission tower in 1956 was located near the ABC tower at Gore Hill, Sydney. This was eventually demolished after ATN was invited to share a new site at Artarmon which was built by a new 3rd, commercial broadcaster TEN-10.
ATN-7 commenced digital television transmissions on 1 January 2001, broadcasting on VHF Channel 6 while maintaining analogue transmission on VHF Channel 7.
ATN-7's Sydney transmissions – both DVB-T terrestrial digital PAL – are broadcast from masts operated by Transmitters Australia (TXA) at Artarmon and/or Willoughby. Retransmission translators to UHF channels service Sydney viewers from Kings Cross and North Head at Manly and north of Sydney at Bouddi, Gosford and Forresters Beach (see the Digital Broadcast Australia) web site.
Beginning in the early 2000s, on-air programs were sent by digital link from the Seven Network's national program play-out centre at Docklands in Melbourne where the Master Control Room was located for all metropolitan and regional feeds to be controlled. Programming line-up, advertisement output, feed switching, time zone monitoring and national transmission output was previously delivered here. All Seven Network owned and operated studios used to have their live signals relayed here: for instance, ATN's output was fed to HSV and then transmitted via satellite or fibre optics to the towers around metropolitan Sydney. In 2019 however, this function was transferred to a new play-out centre in Sydney as part of a joint venture with the Nine Network.
The analogue signal for ATN-7 was turned off at 9:00 a.m. on 3 December 2013 by using a special five-minute retrospective clip of the local station and the song "My City of Sydney" by Tommy Leonetti, used for the first time in 30 years, combined with the old "Mother kangaroo putting her baby joey to bed" animation, which was pla |
https://en.wikipedia.org/wiki/ATN%20%28disambiguation%29 | ATN is the Sydney flagship television station of the Seven Network in Australia.
ATN may also refer to:
Medicine
Acute tubular necrosis, a medical condition of the kidneys
Asymmetrical tonic neck reflex
Atypical trigeminal neuralgia
Television
Access Television Network, California, US
Aotearoa Television Network, Māori language television station, New Zealand, 1996–1997
Arabian Television Network, Dubai, United Arab Emirates
Ariana Television Network, Kabul, Afghanistan
Asian Television Network, Canada
ATN Channel, Canada, owned by Asian Television Network
Transportation
Advanced transit network, another name for personal rapid transit
Air Transport International, ICAO airline designator
Anaheim Resort Transportation, or Anaheim Transportation Network
Anniston station (Amtrak station code: ATN), Alabama, United States
Arriva Trains Northern, a former train operator, England
Atherton railway station, Greater Manchester, England (National Rail code)
Australian Transport Network, a former freight railway operator in Australia
Namatanai Airport, Papua New Guinea, IATA code
Other
Addicted to Noise, former online music magazine
Aeronautical Telecommunication Network
ATN International, a US telecommunications company
Augmented transition network in linguistics
Australian Technology Network, a network of universities in Australia
See also
Ant (name) |
https://en.wikipedia.org/wiki/TCN%20%28disambiguation%29 | TCN is a television station in Sydney, Australia, with initials standing for "Television Corporation New South Wales".
TCN may also refer to:
Broadcasting
The Comedy Network, a Canadian comedy TV channel owned by Bell Media
The Country Network, an American TV channel broadcasting country music videos
The Comcast Network, a regional sports network owned by Comcast broadcasting in the Eastern United States
The Cartoon Network, a holding company for Cartoon Network and Adult Swim brands, owned by Warner Bros. Discovery
Other organisations
Take Care Now, a former private company providing out-of-hours medical cover in England
Transportation Communications Newsletter, an electronic newsletter published on weekdays about communications technology in the transportation industry
The Curling News, a Canadian curling newspaper
Science and technology
Tetracycline, an antibiotic used to treat conditions including cholera, brucellosis, plague, malaria and syphilis
Train communication network, a fieldbus standard used in train control systems, described in IEC 61375
Topology change notification in Spanning Tree Protocol, an ethernet networking protocol
Terrestrial Cosmogenic nuclide, rare isotope found on the earth surface.
Other uses
The Chronicles of Narnia, a series of seven fantasy novels for children written by C. S. Lewis
Third country national, a term used in the context of migration and, in the U.S., regarding public-sector contracts |
https://en.wikipedia.org/wiki/Iterative%20Viterbi%20decoding | Iterative Viterbi decoding is an algorithm that spots the subsequence S of an observation O = {o1, ..., on} having the highest average probability (i.e., probability scaled by the length of S) of being generated by a given hidden Markov model M with m states. The algorithm uses a modified Viterbi algorithm as an internal step.
The scaled probability measure was first proposed by John S. Bridle. An early algorithm to solve this problem, sliding window, was proposed by Jay G. Wilpon et al., 1989, with constant cost T = mn2/2.
A faster algorithm consists of an iteration of calls to the Viterbi algorithm, reestimating a filler score until convergence.
The algorithm
A basic (non-optimized) version, finding the sequence s with the smallest normalized distance from some subsequence of t is:
// input is placed in observation s[1..n], template t[1..m],
// and [[distance matrix]] d[1..n,1..m]
// remaining elements in matrices are solely for internal computations
(int, int, int) AverageSubmatchDistance(char s[0..(n+1)], char t[0..(m+1)], int d[1..n,0..(m+1)]) {
// score, subsequence start, subsequence end
declare int e, B, E
t'[0] := t'[m+1] := s'[0] := s'[n+1] := 'e'
e := random()
do
e' := e
for i := 1 to n do d'[i,0] := d'[i,m+1] := e
(e, B, E) := ViterbiDistance(s', t', d')
e := e/(E-B+1)
until (e == e')
return (e, B, E)
}
The ViterbiDistance() procedure returns the tuple (e, B, E), i.e., the Viterbi score "e" for the match of t and the selected entry (B) and exit (E) points from it. "B" and "E" have to be recorded using a simple modification to Viterbi.
A modification that can be applied to CYK tables, proposed by Antoine Rozenknop, consists in subtracting e from all elements of the initial matrix d.
References
Silaghi, M., "Spotting Subsequences matching a HMM using the Average Observation Probability Criteria with application to Keyword Spotting", AAAI, 2005.
Rozenknop, Antoine, and Silaghi, Marius; "Algorithme de décodage de treillis selon le critère de coût moyen pour la reconnaissance de la parole", TALN 2001.
Further reading
Error detection and correction
Markov models |
https://en.wikipedia.org/wiki/Hitachi%20%28Australian%20train%29 | The Hitachi (also known as Martin & King or Stainless Steel) was an electric multiple unit that operated on the Melbourne suburban railway network between 1972 and 2014. Electrical equipment was supplied by Commonwealth Engineering to designs by Hitachi of Japan, leading to their official name today, though no actual Hitachi-supplied components were used in their construction. They were the last suburban trains in Melbourne with no air conditioning. A total of 355 carriages were built between 1972 and 1981, including a replacement carriage for one written off while the fleet was still being delivered.
Configuration
Based on a successful trial of longer Harris trailer cars built between 1967 and 1971, the Hitachi used carriages long, up from the standard length of the earlier suburban cars. The revised carriage design enabled a six car Hitachi to seat 560 passengers, up from 540 for a seven car Harris, and allowed a maximum load of 1,500 passengers, 300 more than a Harris.
As delivered, Hitachi trains were composed of three types of carriage; driving motor, trailer and driving trailer; coded M, T and D respectively. These cars were arranged in sets of M-T-T-M and M-D, which could be arranged together to create a six car set. Early M and D carriages delivered were provided with nose doors at the front of the cab, which allowed passengers to move through them and between coupled units in a train. This feature did not last, as instructions were soon issued to lock the doors to cabs to prevent unauthorised access. The nose doors also tended to leak and cause draughts, and so the feature was omitted from later carriages, and the door was covered over in sets containing them.
All but one of the 68 D carriages (353D, involved in a collision at Pakenham on 16 April 1980, that also resulted in the scrapping of guard's van Z286) produced were converted into T carriages by the late 1970s, in order to form symmetrical M-T-M units for the opening of the City Loop. These units could be doubled to make six car sets, configured as M-T-M-M-T-M, which became the de facto unit configuration in the 1990s, due to refurbishments.
The 237 motor carriages that have been in service have been numbered 1M through 237M, and the 117 trailer carriages, 1901T through 2017T. On 15 August 2009, the remaining Hitachi carriages were renumbered in order to make way for the second order of X'Trapolis trains, which would also start from 1. The remaining M cars were renumbered from 273M up to 300M, however the new numbering does not reflect the age of each car. The numbering reflects which T car is in each set, the lowest numbered T car receives the lowest numbered M cars, in order of which M car was already the lowest (for example, 2007T was the highest-numbered T car, so 23M was renumbered 299M as it was lower than 233M, which was renumbered 300M).
Service
Intended to replace the first generation of electric trains, the Swing Door and Tait, the stainless steel Hitachi was th |
https://en.wikipedia.org/wiki/Pelmorex | Pelmorex Corp. is a Canadian weather information and media company. Based in Oakville, Ontario, it is the owner of the Canadian specialty channels The Weather Network (English) and MétéoMédia (French), and their associated digital properties.
Founded in 1989, "Pelmorex" is a portmanteau derived from the name of the company's chairman and controlling shareholder, Pierre L. Morrissette.
History
Pelmorex Corp. was established in 1989 and acquired The Weather Network and MeteoMedia shortly after. The brand grew in Canada and in 1996, The Weather Channel in the United States was brought on board as a strategic minority shareholder.
In the early 1990s, the company owned the Pelmorex Radio Network stations in Northern Ontario. The company sold the stations in 1998 and 1999, to Telemedia and Haliburton Broadcasting Group respectively.
In 2006, Pelmorex purchased the operations of World Weatherwatch, a meteorological service company with clients such as the Ontario Ministry of Transportation, Hydro One and Bruce Nuclear Generating Station. Terms of the transaction were not disclosed.
In 2012, Pelmorex acquired the Spanish weather website eltiempo.es, where it focused on bolstering its digital and marketing operations, and hiring prominent local personality José Antonio Maldonado. It also acquired the traffic information provider Beat the Traffic. In 2013, Ron Close became the new president and CEO of the company. The company also began to plot out further expansion in Europe, Latin America, and the United States, as well as optimization of digital advertising delivery based on weather data.
In 2015, Pelmorex bought out The Weather Channel's 49% stake in the company.
Public alerting
In 2001, Pelmorex first proposed that an emergency population warning system, "All Channel Alert", be implemented by all television providers, using proprietary Pelmorex hardware and funded primarily via an increase in carriage fees for The Weather Network/MétéoMédia. The CRTC rejected the proposal, citing the need to consult with the industry over design, costs, and governance of the system.
In 2010, Pelmorex established a "national aggregator and distributor" (NAAD) of localized emergency alert messages compliant with the Common Alerting Protocol as a condition of a request for must-carry status for the two channels. It is governed by representatives of the broadcasting industry, the federal government, members of the Senior Officials Responsible for Emergency Management (SOREM), and the Canadian Association for Public Alerting and Notification. In 2011, the CRTC renewed the must-carry status, under the condition that Pelmorex allow all federal, provincial and territorial emergency management officials to have access to the system, that it commit at least $1 million per-year on public awareness campaigns, and that it develop "broadcast-intrusive" alerts. On August 29, 2014, the CRTC ruled that all over-the-air television channels, radio stations, and television pro |
https://en.wikipedia.org/wiki/America%20Undercover | America Undercover is a series of documentaries that aired on the cable television network HBO from 1983 through 2006. Within the series are several sub-series, such as Autopsy, Real Sex, and Taxicab Confessions.
History
The series began in 1984 and, after a brief time being broadcast weekly in 2001, was later broadcast once per month. In 2006, episodes began being rebroadcast on A&E Network.
Over the years, episodes have covered numerous subjects such as abortion, organized crime, and pedophilia. The show won several awards for the 1998 production of Strippers: The Naked Stages.
Episodes
Hooker (1983) - Directed by Robert Niemack
When Women Kill (1983) - Directed by Lee Grant
The Nightmare of Cocaine (1984) - Directed by Fleming B. Fuller
Toxic Time Bomb: The Fight Against Deadly Pollution (1984) - Directed by August Cinquegrana
Acts of Violence (1985) - Directed by Imre Horvath
UFO's: What's Going On? (1985) - Directed by Robert Guenette
The Gift of Life (1986) - Directed by Bill Couturié
And the Pursuit of Happiness (1986) - Directed by Louis Malle
Kids in Crisis (1986) - Directed by Robert Niemack
Kids in Sports: The Price of Glory (1986) - Directed by Dennis Lofgren
Surveillance: No Place to Hide (1986) - Directed by Joseph Angier
Drunk & Deadly: A Day on America's Highways (1987) - Directed by Robert Niemack
Murder or Mercy: Five American Families (1988) - Directed by Terry Dunn Meurer
Execution: Fourteen Days in May (1988) - Directed by Paul Hamann
Confessions of an Undercover Cop (1988) - Directed by Chris Jeans
Warning: Medicine May Be Hazardous to Your Health (1988) - Directed by Veronica L. Young
Why Did Johnny Kill? (1988) - Directed by Robert Niemack
Transplant (1988) - Directed by Vincent Stafford
Into Madness (1989) - Directed by Susan Raymond
Battered (1989) - Directed by Lee Grant
Crack USA: County Under Siege (1989) - Directed by Vince DiPersio and Bill Guttentag
One Year in a Life of Crime (1989) - Directed by Jon Alpert
Convicts on the Street: One Year on Parole (1990) - Directed by Robert Niemack
Doing Time: Life Inside the Big House (1991) - Directed by Alan Raymond
Rape: Cries from the Heartland (1991) - Directed by Maryann DeLeo
Attempted Murder: Confrontation (1991) - Directed by Tom Spain
Death on the Job (1991) - Directed by Vince DiPersio and Bill Guttentag
The Iceman Tapes: Conversations with a Killer (1992) - Directed by Arthur Ginsberg and Tom Spain
Suicide Notes (1992) - Directed by Robert Niemack
Asylum (1992) - Directed by Joan Churchill
Abortion: Desperate Choices (1992) - Directed by Deborah Dickson, Susan Froemke, and Albert Maysles
My Mother's Murder (1992) - Directed by Charles C. Stuart
Never Say Die: The Search for Eternal Youth (1992) - Directed by Antony Thomas
Women on Trial (1992) - Directed by Lee Grant
I Am a Promise: The Children of Stanton Elementary School (1993)
Gang War: Bangin' In Little Rock (1994)
High on Crack Street: Lost Lives in Lowell (1995) - Directed by Jon Alpert, Maryann DeLeo |
https://en.wikipedia.org/wiki/Data%20entry%20clerk | A data entry clerk, also known as data preparation and control operator, data registration and control operator, and data preparation and registration operator, is a member of staff employed to enter or update data into a computer system. Data is often entered into a computer from paper documents using a keyboard. The keyboards used can often have special keys and multiple colors to help in the task and speed up the work. Proper ergonomics at the workstation is a common topic considered.
The data entry clerk may also use a mouse, and a manually-fed scanner may be involved.
Speed and accuracy, not necessarily in that order, are the key measures of the job.
History
The invention of punched card data processing in the 1890s created a demand for many workers, typically women, to run keypunch machines. To ensure accuracy, data was often entered twice; the second time a different keyboarding device, known as a verifier (such as the IBM 056) was used.
In the 1970s, punched card data entry was gradually replaced by the use of video display terminals.
Examples
For a mailing company, data entry clerks might be required to type in reference numbers for items of mail which had failed to reach their destination, so that the relevant addresses could be deleted from the database used to send the mail out. If the company was compiling a database from addresses handwritten on a questionnaire, the person typing those into the database would be a data entry clerk. In a cash office, a data entry clerk might be required to type expenses into a database using numerical codes.
Optical character/mark recognition
With to the advance of technology, many data entry clerks no longer work with hand-written documents. Instead, the documents are first scanned by a combined OCR/OMR system (optical character recognition and optical mark recognition,) which attempts to read the documents and process the data electronically. The accuracy of OCR varies widely based upon the quality of the original document as well as the scanned image; hence the ongoing need for data entry clerks. Although OCR technology is continually being developed, many tasks still require a data entry clerk to review the results afterward to check the accuracy of the data and to manually key in any missed or incorrect information.
An example of this system would be one commonly used to document health insurance claims, such as for Medicaid in the United States. In many systems, the hand-written forms are first scanned into digital images (JPEG, PNG, bitmap, etc.). These files are then processed by the optical character recognition system, where many fields are completed by the computerized optical scanner. When the OCR software has low confidence in a data field, it is flagged for review – not the entire record but just the single field. The data entry clerk then manually reviews the data already entered by OCR, corrects it if needed, and fills in any missing data by simultaneously viewing the i |
https://en.wikipedia.org/wiki/CIE%20301%20Class | The Córas Iompair Éireann 301 Class locomotives were the first diesel locomotives used on the CIÉ network, this class of 5 being built between 1947 and 1948 by the company for shunting use, particularly in the railway yards on Dublin's North Wall. They were a six coupled (0-6-0 wheel arrangement) locomotive, fitted with a Mirrlees TLDT6 engine of with diesel-electric transmission via two Brush traction motors. Unusually, they lacked train vacuum brakes, although air brakes were provided for the locomotive itself.
They were initially numbered 1000-1004 in the steam locomotive number series, but were subsequently renumbered D301-D305 in order. The locomotives were used on yard pilot and transfer freight duties, although number 1000 hauled a freight train from Dublin to Cork during trials. Two locomotives were stored from 1960 and the rest had followed by 1972, though officially they remained in stock until 1976. All five were scrapped in 1977.
Model
The D Class is not available in either RTR or kit form. However, the British Rail Class 08 can be used as a close approximation.
Footnotes
References
External links
Eiretrains - Irish Locomotives
Iarnród Éireann locomotives
C locomotives
Railway locomotives introduced in 1947
5 ft 3 in gauge locomotives
Diesel-electric locomotives of Ireland
Scrapped locomotives |
https://en.wikipedia.org/wiki/David%20H.%20Munro | David Herbert Munro (born April 29, 1955 in Oakland, California) is a physicist at Lawrence Livermore National Laboratory (LLNL) who created the programming language Yorick as well as the scientific graphics library Gist.
Munro earned his BS at Caltech (1976) and PhD at the Massachusetts Institute of Technology (1980). He joined LLNL in 1980 and has primarily focused his research on laser fusion.
He received the Excellence in Plasma Physics award of the American Physical Society in 1995 and was elected a Fellow of the American Physical Society in 2001 "For his seminal contributions to the design of laser-driven Rayleigh-Taylor experiments, and to the analysis and design of shock-timing experiments for cryogenic inertial confinement fusion targets".
References
"David Herbert Munro." Marquis Who's Who TM. Marquis Who's Who, 2009. Fee (via Fairfax County Public Library). Reproduced in Biography Resource Center. Farmington Hills, Michigan.: Gale, 2009. http://galenet.galegroup.com/servlet/BioRC. Accessed 2009-10-22. Document Number: K2015715582.
External links
RPM shipped by David H. Munro -- yorick-1.4-15.i386 (downloadable free software for Linux, listing as of Wednesday, March 29, 2006 16:05:02)
21st-century American physicists
1955 births
Living people
Scientists from Oakland, California
Massachusetts Institute of Technology alumni
California Institute of Technology alumni
Lawrence Livermore National Laboratory staff
Programming language designers
Fellows of the American Physical Society |
https://en.wikipedia.org/wiki/TDM%20over%20IP | In computer networking and telecommunications, TDM over IP (TDMoIP) is the emulation of time-division multiplexing (TDM) over a packet-switched network (PSN). TDM refers to a T1, E1, T3 or E3 signal, while the PSN is based either on IP or MPLS or on raw Ethernet. A related technology is circuit emulation, which enables transport of TDM traffic over cell-based (ATM) networks.
TDMoIP is a type of pseudowire (PW). However, unlike other traffic types that can be carried over pseudowires (e.g. ATM, Frame Relay and Ethernet), TDM is a real-time bit stream, leading to TDMoIP having unique characteristics. In addition, conventional TDM networks have numerous special features, in particular those required in order to carry voice-grade telephony channels. These features imply signaling systems that support a wide range of telephony features, a rich standardization literature and well-developed Operations and Management (OAM) mechanisms. All of these factors must be taken into account when emulating TDM over PSNs.
One critical issue in implementing TDM PWs is clock recovery. In native TDM networks the physical layer carries highly accurate timing information along with the TDM data, but when emulating TDM over PSNs this synchronization is absent. TDM timing standards can be exacting and conformance with these may require innovative mechanisms to adaptively reproduce the TDM timing.
Another issue that must be addressed is TDMoIP packet loss concealment (PLC). Since TDM data is delivered at a constant rate over a dedicated channel, the native service may have bit errors but data is never lost in transit. All PSNs suffer to some degree from packet loss and this must be compensated when delivering TDM over a PSN.
In December 2007 TDMoIP was approved as an IETF RFC 5087 authored by Dr. Yaakov Stein, Ronen Shashua, Ron Insler, and Motti Anavi of RAD Data Communications.
Background
Communications service providers and enterprise customers are interested in deployment of voice and leased line services over efficient Ethernet, IP and MPLS infrastructures. While Voice over IP (VoIP) is maturing, its deployment requires an investment in new network infrastructure and customer premises equipment (CPE). TDMoIP presents a migration path, whereby modern packet switched networks can be used for transport, while the end-user equipment need not be immediately replaced.
TDMoIP was first developed in 1998 by RAD Data Communications (see U.S. patent number 6,731,649) and first deployed in Sweden in 1999 by Utfors (later acquired by Telenor). Utfors employed the first generation TDMoIP product (known as IPmux-4) to provide bundled services including TDM private lines, TDM leased lines and a variety of IP and Ethernet services. In 2001, the IETF set up the PWE3 working group, which was chartered to develop an architecture for edge-to-edge pseudowires, and to produce specifications for various services, including TDM. Other standardization forums, including the ITU and the |
https://en.wikipedia.org/wiki/Cray%20T3D | The T3D (Torus, 3-Dimensional) was Cray Research's first attempt at a massively parallel supercomputer architecture. Launched in 1993, it also marked Cray's first use of another company's microprocessor. The T3D consisted of between 32 and 2048 Processing Elements (PEs), each comprising a 150 MHz DEC Alpha 21064 (EV4) microprocessor and either 16 or 64 MB of DRAM. PEs were grouped in pairs, or nodes, which incorporated a 6-way processor interconnect switch. These switches had a peak bandwidth of 300 MB/second in each direction and were connected to form a three-dimensional torus network topology.
The T3D was designed to be hosted by a Cray Y-MP Model E, M90 or C90-series "front-end" system and rely on it and its UNICOS operating system for all I/O and most system services. The T3D PEs ran a simple microkernel called UNICOS MAX.
Several different configurations of T3D were available. The SC (Single Cabinet) models shared a cabinet with a host Y-MP system and were available with either 128 or 256 PEs. The MC (Multi-Cabinet) models were housed in one or more liquid-cooled cabinet(s) separately from the host, while the MCA models were smaller (32 to 128 PEs) air-cooled multi-cabinet configurations. There was also a liquid-cooled MCN model which had an alternative interconnect wire mat allowing non-power-of-2 numbers of PEs.
The Cray T3D MC cabinet had an Apple Macintosh PowerBook laptop built into its front. Its only purpose was to display animated Cray Research and T3D logos on its color LCD screen.
The first T3D delivered was a prototype installed at the Pittsburgh Supercomputing Center in early September 1993. The supercomputer was formally introduced on 27 September 1993.
The T3D was superseded in 1995 by the faster and more sophisticated Cray T3E.
Gallery
References
External links
CRAY T3D System Architecture Overview Manual
Computer-related introductions in 1993
T3d
Supercomputers |
https://en.wikipedia.org/wiki/Sequitur%20algorithm | Sequitur (or Nevill-Manning-Witten algorithm) is a recursive algorithm developed by Craig Nevill-Manning and Ian H. Witten in 1997 that infers a hierarchical structure (context-free grammar) from a sequence of discrete symbols. The algorithm operates in linear space and time. It can be used in data compression software applications.
Constraints
The sequitur algorithm constructs a grammar by substituting repeating phrases in the given sequence with new rules and therefore produces a concise representation of the sequence. For example, if the sequence is
S→abcab,
the algorithm will produce
S→AcA, A→ab.
While scanning the input sequence, the algorithm follows two constraints for generating its grammar efficiently: digram uniqueness and rule utility.
Digram uniqueness
Whenever a new symbol is scanned from the sequence, it is appended with the last scanned symbol to form a new digram. If this digram has been formed earlier then a new rule is made to replace both occurrences of the digrams.
Therefore, it ensures that no digram occurs more than once in the grammar. For example, in the sequence S→abaaba, when the first four symbols are already scanned, digrams formed are ab, ba, aa. When the fifth symbol is read, a new digram 'ab' is formed which exists already. Therefore, both instances of 'ab' are replaced by a new rule (say, A) in S. Now, the grammar becomes S→AaAa, A→ab, and the process continues until no repeated digram exists in the grammar.
Rule utility
This constraint ensures that all the rules are used more than once in the right sides of all the productions of the grammar, i.e., if a rule occurs just once, it should be removed from the grammar and its occurrence should be substituted with the symbols from which it is created. For example, in the above example, if one scans the last symbol and applies digram uniqueness for 'Aa', then the grammar will produce: S→BB, A→ab, B→Aa. Now, rule 'A' occurs only once in the grammar in B→Aa. Therefore, A is deleted and finally the grammar becomes
S→BB, B→aba.
This constraint helps reduce the number of rules in the grammar.
Method summary
The algorithm works by scanning a sequence of terminal symbols and building a list of all the symbol pairs which it has read. Whenever a second occurrence of a pair is discovered, the two occurrences are replaced in the sequence by an invented nonterminal symbol, the list of symbol pairs is adjusted to match the new sequence, and scanning continues. If a pair's nonterminal symbol is used only in the just created symbol's definition, the used symbol is replaced by its definition and the symbol is removed from the defined nonterminal symbols. Once the scanning has been completed, the transformed sequence can be interpreted as the top-level rule in a grammar for the original sequence. The rule definitions for the nonterminal symbols which it contains can be found in the list of symbol pairs. Those rule definitions may themselves contain additional nonterminal symb |
https://en.wikipedia.org/wiki/General%20Problem%20Solver | General Problem Solver (GPS) is a computer program created in 1957 by Herbert A. Simon, J. C. Shaw, and Allen Newell (RAND Corporation) intended to work as a universal problem solver machine. In contrast to the former Logic Theorist project, the GPS works with means–ends analysis.
Overview
Any problem that can be expressed as a set of well-formed formulas (WFFs) or Horn clauses, and that constitute a directed graph with one or more sources (that is, axioms) and sinks (that is, desired conclusions), can be solved, in principle, by GPS. Proofs in the predicate logic and Euclidean geometry problem spaces are prime examples of the domain the applicability of GPS. It was based on Simon and Newell's theoretical work on logic machines. GPS was the first computer program that separated its knowledge of problems (rules represented as input data) from its strategy of how to solve problems (a generic solver engine). GPS was implemented in the third-order programming language, IPL.
While GPS solved simple problems such as the Towers of Hanoi that could be sufficiently formalized, it could not solve any real-world problems because search was easily lost in the combinatorial explosion. Put another way, the number of "walks" through the inferential digraph became computationally untenable. (In practice, even a straightforward state space search such as the Towers of Hanoi can become computationally infeasible, albeit judicious prunings of the state space can be achieved by such elementary AI techniques as A* and IDA*).
The user defined objects and operations that could be done on the objects, and GPS generated heuristics by means–ends analysis in order to solve problems. It focused on the available operations, finding what inputs were acceptable and what outputs were generated. It then created subgoals to get closer and closer to the goal.
The GPS paradigm eventually evolved into the Soar architecture for artificial intelligence.
See also
Logic Theorist
References
Newell, A.; Shaw, J.C.; Simon, H.A. (1959). Report on a general problem-solving program. Proceedings of the International Conference on Information Processing. pp. 256–264.
Newell, A. (1963). A Guide to the General Problem-Solver Program GPS-2-2. RAND Corporation, Santa Monica, California. Technical Report No. RM-3337-PR.
Ernst, G.W. and Newell, A. (1969). GPS: a case study in generality and problem solving. Academic Press. (Revised version of Ernst's 1966 dissertation, Carnegie Institute of Technology.)
Newell, A., and Simon, H. A. (1972) Human problem solving Englewood Cliffs, NJ: Prentice-Hall
History of artificial intelligence |
https://en.wikipedia.org/wiki/SAP%20NetWeaver%20Business%20Warehouse | SAP Business Warehouse (SAP BW) is SAP’s Enterprise Data Warehouse product. It can transform and consolidate business information from virtually any source system. It ran on industry standard RDBMS until version 7.3 at which point it began to transition onto SAP's HANA in-memory DBMS, particularly with the release of version 7.4.
Latterly, it evolved into a product called BW/4HANA so as to align with SAP's sister ERP Product called S/4HANA. This strategy allowed SAP to engineer the database to use the HANA in-Memory database. Consequently, this facilitates the push down of complex OLAP based functions to the database as opposed to NetWeaver ABAP Application Server to improve performance. The product is also more open and can incorporate SAP and Non-SAP data more easily.
History
In 1998 SAP released the first version of SAP BW, providing a model-driven approach to EDW that made data warehousing easier and more efficient, particularly for SAP R/3 data. Since then, SAP BW has evolved to become a key component for thousands of companies. An article, provided the history of SAP BW from inception to the newer releases powered by SAP HANA.
References
Online analytical processing
Business Intelligence |
https://en.wikipedia.org/wiki/Spigot%20algorithm | A spigot algorithm is an algorithm for computing the value of a transcendental number (such as or e) that generates the digits of the number sequentially from left to right providing increasing precision as the algorithm proceeds. Spigot algorithms also aim to minimize the amount of intermediate storage required. The name comes from the sense of the word "spigot" for a tap or valve controlling the flow of a liquid. Spigot algorithms can be contrasted with algorithms that store and process complete numbers to produce successively more accurate approximations to the desired transcendental.
Interest in spigot algorithms was spurred in the early days of computational mathematics by extreme constraints on memory, and such an algorithm for calculating the digits of e appeared in a paper by Sale in 1968. In 1970, Abdali presented a more general algorithm to compute the sums of series in which the ratios of successive terms can be expressed as quotients of integer functions of term positions. This algorithm is applicable to many familiar series for trigonometric functions, logarithms, and transcendental numbers because these series satisfy the above condition. The name "spigot algorithm" seems to have been coined by Stanley Rabinowitz and Stan Wagon, whose algorithm for calculating the digits of is sometimes referred to as "the spigot algorithm for ".
The spigot algorithm of Rabinowitz and Wagon is bounded, in the sense that the number of terms of the infinite series that will be processed must be specified in advance. The term "streaming algorithm" indicates an approach without this restriction. This allows the calculation to run indefinitely varying the amount of intermediate storage as the calculation progresses.
A variant of the spigot approach uses an algorithm which can be used to compute a single arbitrary digit of the transcendental without computing the preceding digits: an example is the Bailey–Borwein–Plouffe formula, a digit extraction algorithm for which produces base 16 digits. The inevitable truncation of the underlying infinite series of the algorithm means that the accuracy of the result may be limited by the number of terms calculated.
Example
This example illustrates the working of a spigot algorithm by calculating the binary digits of the natural logarithm of 2 using the identity
To start calculating binary digits from, as an example, the 8th place we multiply this identity by 27 (since 7 = 8 − 1):
We then divide the infinite sum into a "head", in which the exponents of 2 are greater than or equal to zero, and a "tail", in which the exponents of 2 are negative:
We are only interested in the fractional part of this value, so we can replace each of the summands in the "head" by
Calculating each of these terms and adding them to a running total where we again only keep the fractional part, we have:
{| class="wikitable"
|-
! k
! A = 27−k
! B = A mod k
! C =
! Sum of C mod 1
|-
| 1
| 64
| 0
| 0
| 0
|-
| 2
| 32
| 0
| 0
| 0
|
https://en.wikipedia.org/wiki/Timesheet | A timesheet (or time sheet) is a method for recording the amount of a worker's time spent on each job. Traditionally a sheet of paper with the data arranged in tabular format, a timesheet is now often a digital document or spreadsheet. The time cards stamped by time clocks can serve as a timesheet or provide the data to fill one. These, too, are now often digital. Timesheets came into use in the 19th century as time books. To record time in a more granular fashion, time-tracking software may be used.
Use
Originally developed for an employer to calculate payroll, a timesheet can also be used for management accounting. Timesheets may track the start and end times of tasks or just the duration. It may contain a detailed breakdown of tasks accomplished throughout the project or program. This information may be used for payroll, client billing, and increasingly for project costing, estimation, tracking, and management.
Some companies provide web-based timesheet software or services that provide a means to track time for payroll, billing and project management. One of the major uses of timesheet in a project management environment is comparing planned costs versus actual costs, as well as measuring employee performance and identifying problematic tasks. This knowledge can drive corporate strategy as users stop performing or reassign unprofitable work.
Time cards
Factory workers may often have a "time card" (also known as punch card) and "punch in" by inserting their card into an automatic timestamp machine (called a time clock or bundy clock) when starting and ending their work shift, though other card technologies such as swipe cards have become more prevalent.
Advantages
Time tracking can reduce costs in three ways: by making payroll processing more efficient, by making costs visible so they can be reduced, and by automating billing and invoicing.
Time tracking can increase revenue through automating billing, which tends to make it easier for a company to get correct invoices out for all hours worked by consulting staff. This speeds up payment and eliminates the hassles of 'dropping' bills.
By reducing costs in three ways, and increasing revenue in one way, timesheet management technologies that are web-based can improve the health of companies.
In project management, timesheet can also be used to build a body of knowledge about how much effort tasks take to develop. Machine learning is being used to automatically find patterns in timesheet — then using this information to recommend more accurate project plans in the future. For example, if developing a training plan has historically taken a month, then it can be assumed that creating a new one will take a month. Also, most timesheet software has the ability to track resource costs and project expenses to allow for better future budgeting.
For the HR function, the time spent on activities by individuals can be analysed over a period of time and categorised into broad types. Based on the |
https://en.wikipedia.org/wiki/Lily%20pad%20network | A lily pad network is a series of wireless access points spread over a large area, each connected to a different network and owned by different enterprises and people, providing hotspots where wireless clients can connect to the Internet without regard for the particular networks to which they link.
This is in contrast with wireless community networks, where the access points route traffic between them, as well as a corporate wireless LAN where several access points are connected to the corporate network, and the members of the organization are supposed to stick to their own network.
Unlike a traditional corporate wireless LAN, which allows access to other networks only via access points connected to the main corporate network, a lily pad does not restrict a network user to connecting only to their own network. In this way, a lily pad network enables the network users to roam over a large area while staying connected, without needing the overheads of the access points to route traffic between the individual networks.
Lily pad networks derive their name from their frog-like "hopping" facility, where mobile stations which roam over a large area are akin to frogs, hopping from lily pad to lily pad, and because of the technology, remaining continuously connected. Unlike typical wireless mesh networks, where each network client needs to manage their own network connection continuity, a lily pad network topology enables roaming by linking a number of wireless access points together.
A lily pad network is particularly suitable for mobile wireless network connectivity over a large geographic area, such as a combination of coffee houses, libraries, and other public spaces. In these locations wireless access infrastructure is available for configuring the lily pad network to provide "hot spots", allowing a mobile station to connect to the Internet for both surfing or VoIP.
Wi-Fi
Network access |
https://en.wikipedia.org/wiki/BMS | BMS may refer to:
Arts and entertainment
Be-Music Source, a computer file format and Beatmania simulating game system
Bristol Motor Speedway, Tennessee, US
Blue Mountain State, a television series
Bibliography of Music Literature (BMS or BMS online)
Banco del Mutuo Soccorso, a rock band
Benchmark Sims, a gaming community who authored the Falcon BMS modification to upgrade the original Falcon 4.0 combat flight simulator
Corporations and organizations
Bayer MaterialScience, the former name of the materials science company Covestro
Bemis Company (New York Stock Exchange symbol)
BBK BMS, a Danish basketball club
Bharatiya Mazdoor Sangh, a trade union organisation in India
BMS Scuderia Italia, an Italian racing team
BMS World Mission, a Christian missionary society
British Mycological Society, to promote the study of fungi
Bristol Myers Squibb, a pharmaceutical and health products company
Boston Microtonal Society, US
Education
Bachelor of Management Studies
Bedford Modern School, a school in Bedford, England
Berlin Mathematical School, Germany
B.M.S. College of Engineering, an engineering college in Bangalore, India
B.M.S. Institute of Technology and Management, an engineering college in Bangalore, India
Science and technology
Battery management system
Battlefield management system
Bridge management system
Building management system
Borane dimethylsulfide, a chemical
Medical
Bone marrow suppression
Burning mouth syndrome, also known as glossodynia or stomodynia oral dysaesthesia
Bare-metal stent, a coronary stent
Bio-mechanical stimulation, vibration transferred to the human body
Physics
Bondi–Metzner–Sachs group (or BMS group), an asymptotic symmetry group of General Relativity
Transportation
Broadmeadows railway station, Melbourne (station code), Australia
Bromley South railway station (National Rail station code), England
Blue Air (ICAO code), a Romanian airline |
https://en.wikipedia.org/wiki/WriteNow | WriteNow is a word processor application for the original Apple Macintosh and later computers in the NeXT product line. The application is one of two word processors that were first developed with the goal that they be available at the time of the Mac product launch in 1984, and was the primary word processor for computers manufactured by NeXT. WriteNow was purchased from T/Maker by WordStar in 1993, but shortly after that, WordStar merged with SoftKey, which ultimately led to its discontinuation. It had a combination of powerful features, excellent performance, and small system requirements.
History
WriteNow was written for Apple Computer, Inc., by John Anderson and Bill Tschumy in Seattle, separate from the Macintosh computer and MacWrite word processor development teams. Steve Jobs was concerned that those programming MacWrite were not going to be ready for the 1984 release date of the Macintosh; Apple Computer therefore commissioned a team of programmers, friends of Apple engineer Bud Tribble, to work independently on a similar project, which eventually became WriteNow. Members of the WriteNow team knew about MacWrite, but members of the MacWrite team did not know about WriteNow.
Ultimately, MacWrite was completed on schedule and shipped with the Macintosh. This left WriteNow in limbo until Jobs left Apple to form NeXT and bought Solaster Software which was started by John Anderson, Bill Tschumy and Christopher Stinson. John and Bill, the authors of WriteNow, joined NeXT. WriteNow marketing rights ended up being owned by NeXT, and WriteNow released for the Macintosh in 1985, published by the T/Maker Company.
In October 1988, WriteNow 2.0 was released on Macintosh, adding dictionaries, character / word / paragraph count, import and export of RTF and MacWrite files, and updated compatibility with recent system enhancements. Version 3.0 introduced style sheets.
Features
WriteNow improved on some of the limitations of MacWrite through the better handling of large documents and the addition of features such as spell check and footnotes. It was "lean and fast," being written entirely in assembly language, and it was suited for Macintosh users with only 400 KB floppy disk. WriteNow went through several versions culminating (in 1993) with version 4.0.2, which continued the "lean and fast" reputation while adding features such as tables.
In the opinion of many of its users, WriteNow represented the ideal Macintosh application. It had a simple, intuitive graphical user interface (GUI), no copy protection, and it worked in practically every revision of the Macintosh operating system, including in the Mac 68k emulator on PowerPC Macs and in the Classic Environment under Mac OS X. Its biggest claim to fame, however, was its speed. It was written in assembly language (Motorola 680x0) by a group of developers who had a reputation for producing extremely efficient code. The user interface was unusual in that, while the typical word processor had a rule |
https://en.wikipedia.org/wiki/Severo%20Ornstein | Severo M. Ornstein (born 1930) is a retired computer scientist and son of American composer Leo Ornstein. In 1955 he joined MIT's Lincoln Laboratory as a programmer and designer for the SAGE air-defense system. He later joined the TX-2 group and became a member of the team that designed the LINC. He moved with the team to Washington University in St. Louis where he was one of the principal designers of macromodules.
Returning to Boston he joined Bolt, Beranek and Newman. When ARPA issued a Request for Proposal for the ARPANET, he joined the group that wrote the winning proposal. He was responsible for the design of the communication interfaces and other special hardware for the Interface Message Processor. In 1972 he headed the first delegation of U.S. computer scientists to the People's Republic of China.
In 1976, he joined Xerox PARC where he implemented a computer interface to an early laser printer. Later he co-led (with Ed McCreight) the team that built the Dorado computer.
Ornstein co-designed Mockingbird, the first interactive computer-based music-score editor, and oversaw its programming.
In 1980 he was instrumental in starting Computer Professionals for Social Responsibility (CPSR). He wrote an autobiography describing his experiences in computer science, published in 2002.
References
Oral history interview with Severo Ornstein, Charles Babbage Institute, University of Minnesota. Ornstein describes his experience at Lincoln Laboratory which included work on the SAGE, TX-2 and LINC computers. He discusses his move to Washington University, and the later work there on DARPA/IPTO sponsored macromodule project. As the principal hardware designer of the Interface Message Processor (IMP) for the ARPANET, Ornstein describes the IMP design work at Bolt Beranek and Newman (BBN), the working environment of the group at BBN, his relationship with Lawrence Roberts, his interactions with Honeywell, and his work on the Pluribus multi-processor IMP. Ornstein also discusses the contributions of Wesley Clark and Norman Abramson, his involvement with the Computer Professionals for Social Responsibility, and his views on artificial intelligence and time-sharing.
Oral history interview with Severo Ornstein and Laura Gould, Charles Babbage Institute, University of Minnesota. Oral history interview by Bruce Bruemmer, 17 November 1994, Woodside, California, discussing the formation and activities of Computer Professionals for Social Responsibility.
A Brief History of ARPANET, mentioning Ornstein
Severo's website on the composer Leo Ornstein, his father
American computer scientists
Computer systems researchers
Living people
American people of Russian-Jewish descent
Scientists at PARC (company)
MIT Lincoln Laboratory people
1930 births
Washington University in St. Louis people |
https://en.wikipedia.org/wiki/Pygame | Pygame is a cross-platform set of Python modules designed for writing video games. It includes computer graphics and sound libraries designed to be used with the Python programming language.
History
Pygame was originally written by Pete Shinners to replace PySDL after its development stalled. It has been a community project since 2000 and is released under the free software GNU Lesser General Public License (which "provides for Pygame to be distributed with open source and commercial software").
Development of Version 2
Pygame version 2 was planned as "Pygame Reloaded" in 2009, but development and maintenance of Pygame completely stopped until the end of 2016 with version 1.9.1. After the release of version 1.9.5 in March 2019, development of a new version 2 was active on the roadmap.
Pygame 2.0 released on 28 October, 2020, on Pygame's 20th birthday.
Features
Pygame uses the Simple DirectMedia Layer (SDL) library, with the intention of allowing real-time computer game development without the low-level mechanics of the C programming language and its derivatives. This is based on the assumption that the most expensive functions inside games can be abstracted from the game logic, making it possible to use a high-level programming language, such as Python, to structure the game.
Other features that SDL does have include vector math, collision detection, 2D sprite scene graph management, MIDI support, camera, pixel-array manipulation, transformations, filtering, advanced freetype font support, and drawing.
Applications using Pygame can run on Android phones and tablets with the use of Pygame Subset for Android (pgs4a). Sound, vibration, keyboard, and accelerometer are supported on Android.
Community
There is a regular competition, called PyWeek, to write games using Python (and usually but not necessarily, Pygame). The community has created many tutorials for Pygame.
Notable games using Pygame
Frets on Fire
Dangerous High School Girls in Trouble
Save the Date, IndieCade 2013 Finalist
Drawn Down Abyss
See also
Cocos2d
Panda3D
Pyglet
Notes
References
External links
Pygame newsgroup (web access) - the "official" Pygame newsgroup, requires registration
Pygame Subset for Android (PGS4A)
pyOpenGL - Python OpenGL Bindings
Pygame-SDL2 - a reimplementation of Pygame APIs on top of SDL2
PySDL2 - a wrapper around the SDL2 library similar to the discontinued PySDL project
Application programming interfaces
Free computer libraries
Free software programmed in Python
Graphics libraries
Linux APIs
MacOS APIs
Python (programming language) libraries
Simple DirectMedia Layer
Video game development software
Video game development software for Linux
Windows APIs |
https://en.wikipedia.org/wiki/Pipeline%20%28Unix%29 | In Unix-like computer operating systems, a pipeline is a mechanism for inter-process communication using message passing. A pipeline is a set of processes chained together by their standard streams, so that the output text of each process (stdout) is passed directly as input (stdin) to the next one. The second process is started as the first process is still executing, and they are executed concurrently.
The concept of pipelines was championed by Douglas McIlroy at Unix's ancestral home of Bell Labs, during the development of Unix, shaping its toolbox philosophy. It is named by analogy to a physical pipeline. A key feature of these pipelines is their "hiding of internals" (Ritchie & Thompson, 1974). This in turn allows for more clarity and simplicity in the system.
This article is about anonymous pipes, where data written by one process is buffered by the operating system until it is read by the next process, and this uni-directional channel disappears when the processes are completed. This differs from named pipes, where messages are passed to or from a pipe that is named by making it a file, and remains after the processes are completed. The standard shell syntax for anonymous pipes is to list multiple commands, separated by vertical bars ("pipes" in common Unix verbiage):
command1 | command2 | command3
For example, to list files in the current directory (), retain only the lines of output containing the string (), and view the result in a scrolling page (), a user types the following into the command line of a terminal:
ls -l | grep key | less
The command ls -l is executed as a process, the output (stdout) of which is piped to the input (stdin) of the process for grep key; and likewise for the process for less. Each process takes input from the previous process and produces output for the next process via standard streams. Each | tells the shell to connect the standard output of the command on the left to the standard input of the command on the right by an inter-process communication mechanism called an (anonymous) pipe, implemented in the operating system. Pipes are unidirectional; data flows through the pipeline from left to right.
Example
Below is an example of a pipeline that implements a kind of spell checker for the web resource indicated by a URL. An explanation of what it does follows.
curl "https://en.wikipedia.org/wiki/Pipeline_(Unix)" |
sed 's/[^a-zA-Z ]/ /g' |
tr 'A-Z ' 'a-z\n' |
grep '[a-z]' |
sort -u |
comm -23 - <(sort /usr/share/dict/words) |
less
curl obtains the HTML contents of a web page (could use wget on some systems).
sed replaces all characters (from the web page's content) that are not spaces or letters, with spaces. (Newlines are preserved.)
tr changes all of the uppercase letters into lowercase and converts the spaces in the lines of text to newlines (each 'word' is now on a separate line).
grep includes only lines that contain at least one lowercase alphabetical character (removing any blank lines) |
https://en.wikipedia.org/wiki/Apple%20Pascal | Apple Pascal is an implementation of Pascal for the Apple II and Apple III computer series. It is based on UCSD Pascal.
Just like other UCSD Pascal implementations, it ran on its own operating system (Apple Pascal Operating System, a derivative of UCSD p-System with graphical extensions).
Originally released for the Apple II in August 1979, just after Apple DOS 3.2, Apple Pascal pioneered a number of features that would later be incorporated into DOS 3.3, as well as others that would not be seen again until the introduction of ProDOS.
The Apple Pascal software package also included disk maintenance utilities, and an assembler meant to complement Apple's built-in "monitor" assembler. A FORTRAN compiler (written by Silicon Valley Software, Sunnyvale California) compiling to the same p-code as Pascal was also available.
Comparison of Pascal OS with DOS 3.2
Apple Pascal Operating System introduced a new disk format. Instead of dividing the disk into 256-byte sectors as in DOS 3.2, Apple Pascal divides it into "blocks" of 512 bytes each. The p-System also introduced a different method for saving and retrieving files. Under Apple DOS, files were saved to any available sector that the OS could find, regardless of location. Over time, this could lead to file system fragmentation, slowing access to the disk. Apple Pascal attempted to rectify this by saving only to consecutive blocks on the disk.
Other innovations introduced in the file system included the introduction of a timestamp feature. Previously only a file's name, basic type, and size would be shown. Disks could also be named for the first time.
Limitations of the p-System included new restrictions on the naming of files.
Writing files only on consecutive blocks also created problems, because over time free space tended to become too fragmented to store new files. A utility called Krunch was included in the package to consolidate free space.
The biggest problem with the Apple Pascal system was that it was too big to fit on one floppy disk. This meant that on a system with only one floppy disk drive, frequent disk swapping was needed. A system needed at least two disk drives in order to use the operating system properly.
Release history
Sources
Notes
External links
The History of Apple's Pascal "Syntax" Poster, 1979-80.
Pascal Syntax Poster
Pascal
Pascal
Disk operating systems
Pascal programming language family
Discontinued operating systems |
https://en.wikipedia.org/wiki/Pipeline%20%28computing%29 | In computing, a pipeline, also known as a data pipeline, is a set of data processing elements connected in series, where the output of one element is the input of the next one. The elements of a pipeline are often executed in parallel or in time-sliced fashion. Some amount of buffer storage is often inserted between elements.
Computer-related pipelines include:
Instruction pipelines, such as the classic RISC pipeline, which are used in central processing units (CPUs) and other microprocessors to allow overlapping execution of multiple instructions with the same circuitry. The circuitry is usually divided up into stages and each stage processes a specific part of one instruction at a time, passing the partial results to the next stage. Examples of stages are instruction decode, arithmetic/logic and register fetch. They are related to the technologies of superscalar execution, operand forwarding, speculative execution and out-of-order execution.
Graphics pipelines, found in most graphics processing units (GPUs), which consist of multiple arithmetic units, or complete CPUs, that implement the various stages of common rendering operations (perspective projection, window clipping, color and light calculation, rendering, etc.).
Software pipelines, which consist of a sequence of computing processes (commands, program runs, tasks, threads, procedures, etc.), conceptually executed in parallel, with the output stream of one process being automatically fed as the input stream of the next one. The Unix system call pipe is a classic example of this concept.
HTTP pipelining, the technique of issuing multiple HTTP requests through the same TCP connection, without waiting for the previous one to finish before issuing a new one.
Some operating systems may provide UNIX-like syntax to string several program runs in a pipeline, but implement the latter as simple serial execution, rather than true pipelining—namely, by waiting for each program to finish before starting the next one.
Concept and motivation
Pipelining is a commonly used concept in everyday life. For example, in the assembly line of a car factory, each specific task—such as installing the engine, installing the hood, and installing the wheels—is often done by a separate work station. The stations carry out their tasks in parallel, each on a different car. Once a car has had one task performed, it moves to the next station. Variations in the time needed to complete the tasks can be accommodated by "buffering" (holding one or more cars in a space between the stations) and/or by "stalling" (temporarily halting the upstream stations), until the next station becomes available.
Suppose that assembling one car requires three tasks that take 20, 10, and 15 minutes, respectively. Then, if all three tasks were performed by a single station, the factory would output one car every 45 minutes. By using a pipeline of three stations, the factory would output the first car in 45 minutes, and then a new one ev |
https://en.wikipedia.org/wiki/Boost%20Mobile | Boost Mobile may refer to:
Boost Mobile (Australia), an Australian mobile virtual network operator
Boost Mobile (United States), an American mobile virtual network operator owned by Dish Wireless
Spark New Zealand, a telecommunications company in New Zealand which used the Boost Mobile brand prior to 2007 |
https://en.wikipedia.org/wiki/.ke | .ke is the Internet country code top-level domain (ccTLD) for Kenya.
KENIC, short for Kenya Network Information Centre, is the authoritative agency responsible for managing the registrations and issuance of the .ke domain.
In 2002, KENIC assumed control of the .ke domain when it had a meager number of less than 1,000 registrations.
Prior to KENIC's involvement, the administration of the domain was overseen by two individuals: Shem Ochuodho from Kenya and Randy Bush from America, both esteemed tech experts.
Second-level domains
Second-level domains, under which domains are registered at the third level, are:
.co.ke: This is the most common .ke domain extension and is available for registration by anyone, both individuals and businesses, without specific restrictions. However, presence in Kenya is required.
.or.ke: Intended for not-for-profit organizations operating in Kenya. To register a .or.ke domain, the organization must provide documentation proving its not-for-profit status.
.ne.ke: for network devices
.go.ke: for Government entities. Requires supporting documents
.ac.ke: Reserved for academic institutions such as universities, colleges, and schools in Kenya. Proof of educational institution status is typically required.
.sc.ke: for lower and middle institutes of learning. Requires supporting documents
.me.ke: for personal names/websites
.mobi.ke: for mobile content
.info.ke: for informational content
KeNIC's Dispute Resolution
KeNIC (Kenya Network Information Centre) has established a dispute resolution process for handling domain name disputes related to .ke domains. This process is designed to resolve conflicts or disputes that may arise between parties over the registration and use of .ke domain names.
"Dispute Categories: KeNIC's dispute resolution process covers various categories of disputes, including but not limited to:
Cybersquatting: This involves the bad-faith registration of a domain name with the intent to profit from the goodwill associated with someone else's trademark.
Domain Name Similarity: Disputes over domain names that are similar to existing trademarks or other domain names.
Abusive Registrations: Disputes related to the abusive or unlawful use of a domain name.
Complaint Filing: To initiate a dispute resolution process, the complainant (the party bringing the dispute) must file a complaint with KeNIC. The complaint should include detailed information about the dispute, evidence of rights to the domain name or trademark, and a description of how the domain name is being used in bad faith.
Response: The respondent (the party against whom the complaint is filed) has the opportunity to respond to the complaint. They can provide evidence and arguments in their defense.
Appointment of a Panel: KeNIC typically appoints an independent panel of experts to review the dispute. These experts are knowledgeable in domain name disputes and intellectual property matters.
Decision: The panel will review the |
https://en.wikipedia.org/wiki/Bellman%20equation | A Bellman equation, named after Richard E. Bellman, is a necessary condition for optimality associated with the mathematical optimization method known as dynamic programming. It writes the "value" of a decision problem at a certain point in time in terms of the payoff from some initial choices and the "value" of the remaining decision problem that results from those initial choices. This breaks a dynamic optimization problem into a sequence of simpler subproblems, as Bellman's “principle of optimality" prescribes. The equation applies to algebraic structures with a total ordering; for algebraic structures with a partial ordering, the generic Bellman's equation can be used.
The Bellman equation was first applied to engineering control theory and to other topics in applied mathematics, and subsequently became an important tool in economic theory; though the basic concepts of dynamic programming are prefigured in John von Neumann and Oskar Morgenstern's Theory of Games and Economic Behavior and Abraham Wald's sequential analysis. The term 'Bellman equation' usually refers to the dynamic programming equation associated with discrete-time optimization problems. In continuous-time optimization problems, the analogous equation is a partial differential equation that is called the Hamilton–Jacobi–Bellman equation.
In discrete time any multi-stage optimization problem can be solved by analyzing the appropriate Bellman equation. The appropriate Bellman equation can be found by introducing new state variables (state augmentation). However, the resulting augmented-state multi-stage optimization problem has a higher dimensional state space than the original multi-stage optimization problem - an issue that can potentially render the augmented problem intractable due to the “curse of dimensionality”. Alternatively, it has been shown that if the cost function of the multi-stage optimization problem satisfies a "backward separable" structure, then the appropriate Bellman equation can be found without state augmentation.
Analytical concepts in dynamic programming
To understand the Bellman equation, several underlying concepts must be understood. First, any optimization problem has some objective: minimizing travel time, minimizing cost, maximizing profits, maximizing utility, etc. The mathematical function that describes this objective is called the objective function.
Dynamic programming breaks a multi-period planning problem into simpler steps at different points in time. Therefore, it requires keeping track of how the decision situation is evolving over time. The information about the current situation that is needed to make a correct decision is called the "state". For example, to decide how much to consume and spend at each point in time, people would need to know (among other things) their initial wealth. Therefore, wealth would be one of their state variables, but there would probably be others.
The variables chosen at any given point in time are of |
https://en.wikipedia.org/wiki/KDKA-TV | KDKA-TV (channel 2) is a television station in Pittsburgh, Pennsylvania, United States, serving as the market's CBS outlet. It is owned and operated by the network's CBS News and Stations division alongside Jeannette-licensed independent station WPKD-TV (channel 19). Both stations share studios at the Gateway Center in downtown Pittsburgh, while KDKA-TV's transmitter is located in the city's Perry North neighborhood. KDKA-TV, along with sister station KYW-TV in Philadelphia, are the only CBS-affiliated television stations east of the Mississippi River with "K" call signs.
KDKA-TV is available on cable in parts of the Johnstown–Altoona, Wheeling–Steubenville and Youngstown areas, as well as several other out-of-market cable systems in northwestern Pennsylvania, western Maryland, northeastern and east-central Ohio, and north-central West Virginia. The farthest south KDKA-TV is carried on cable is in Beverly, West Virginia.
History
DuMont origins (1949–1954)
The station signed on as WDTV on January 11, 1949, as a primary affiliate of the former DuMont Television Network, while carrying secondary affiliations with CBS, NBC, and ABC. It originally broadcast on channel 3 and was owned and operated by DuMont parent company Allen B. DuMont Laboratories. It was the 51st television station in the U.S., the third and last DuMont-owned station to sign on the air (behind WABD (now WNYW) in New York City and WTTG in Washington, D.C.), and the first owned-and-operated station in the Commonwealth of Pennsylvania. To mark the occasion, a live television special aired that day from 8:30 to 11 p.m. on WDTV, which began with a one-hour local program broadcast from Syria Mosque in Pittsburgh. The remainder of the show featured live segments from DuMont, CBS, NBC, and ABC with Arthur Godfrey, Milton Berle, DuMont host Ted Steele, and many other celebrities.
The station also represented a milestone in the television industry, providing the link between the Midwestern and East Coast stations which included 13 other cities able to receive live telecasts from Boston to St. Louis for the first time. WDTV was one of the last stations to receive a construction permit before the Federal Communications Commission (FCC)-imposed four-year freeze on new television station licenses.
When the release of the FCC's Sixth Report and Order ended the license freeze in 1952, DuMont was forced to give up its channel 3 allocation to alleviate interference with nearby stations broadcasting on the frequency, notably NBC-owned WNBK (now WKYC) in Cleveland, who itself moved to the frequency to avoid interference with stations in Columbus and Detroit. WDTV moved its facilities to channel 2 on November 23, 1952; WPSU-TV would later sign on with the channel 3 frequency for the Johnstown/Altoona market. Shortly after moving, it was the first station in the country to broadcast 24 hours a day, seven days a week, advertising that its 1:00–7:00 a.m. Swing Shift Theatre served the "200,000 worke |
https://en.wikipedia.org/wiki/WPGH-TV | WPGH-TV (channel 53) is a television station in Pittsburgh, Pennsylvania, United States, affiliated with the Fox network. It is owned by Sinclair Broadcast Group alongside dual CW/MyNetworkTV affiliate WPNT (channel 22). Both stations share studios on Ivory Avenue in the city's Summer Hill neighborhood, where WPGH-TV's transmitter is also located.
History
Early history of channel 53 (1953–1971)
The station originally signed on the air with a test pattern on July 14, 1953 as WKJF-TV, with regular programming starting August 1, becoming Pittsburgh's first UHF television station. The studio and transmitter facilities of both WKJF-TV and WKJF-FM (now KDKA-FM), were located at 1715 Grandview Avenue in Pittsburgh's Duquesne Heights section. WKJF-TV carried some NBC programming declined by their primary affiliate WDTV.
Southwestern Pennsylvania is a very rugged dissected plateau, and compared to VHF, UHF stations typically do not get good reception in rugged terrain. In addition, WKJF-TV was operating at very low power while awaiting delivery of a high-power transmitter. The transmitter upgrade never took place, which severely degraded the reception and area of coverage. At the time, UHF stations could only be seen with a separately purchased converter and UHF antenna (television sets were not required to have UHF tuners until 1964, after passage of the All-Channel Receiver Act), and even then the picture quality was spotty at best. WKJF-TV was certainly no exception to this, with much of Pittsburgh actually receiving better reception from Johnstown's NBC affiliate, WJAC-TV, a VHF station that appeared in the TV listings along with local stations.
The station never thrived against Pittsburgh's then-only VHF station, WDTV (channel 2, now KDKA-TV) which had the additional advantage of affiliation with all the major networks, DuMont, NBC, CBS and ABC. In June 1954, the Federal Communications Commission (FCC) gave WKJF-TV permission to go off the air on July 2 for ninety days pending the outcome of a Senate subcommittee investigation into UHF television. WKJF-TV never signed back on. Pittsburgh would eventually get individual network affiliates when two commercial VHF stations signed on, WIIC-TV (channel 11, now WPXI), in 1957 with NBC and WTAE-TV (channel 4) in 1958 with ABC.
On February 12, 1965, the FCC announced that an application was filed to sell the Channel 53 construction permit (now with call letters WAND-TV) from Agnes Jane Reeves Greer to Daniel H. Overmyer for consideration of $28,000, with the FCC granting approval of the sale on July 28, 1965. Mr. Overmyer was planning a group of UHF stations to be part of the Overmyer Network which was intended to begin programming in 1967. The Pittsburgh station call letters were changed to WECO-TV for one of his daughters, Elizabeth Clark Overmyer.
Channel 53 remained silent for nearly 15 years, it returned to the air under new owners U.S. Communications Corporation on February 1, 1969 as independent |
https://en.wikipedia.org/wiki/Vendetta%20Online | Vendetta Online is a twitch-based, science fiction massively multiplayer online role-playing game (MMORPG) developed by Guild Software for the operating systems Android, Linux, Mac OS X, iOS, and Microsoft Windows. It uses the NAOS game engine, a fully real-time flight model and combat system, to offer first-person/third-person shooter-style player versus player and player versus environment battle action against the backdrop of a massively multiplayer universe. Vendetta Online shipped as a commercial MMORPG on November 1, 2004 with a subscription-based business model, although it has been running continuously since April 2002. Vendetta Online is available to play across a wide array of platforms, including the Oculus Rift virtual reality display, allowing all users to directly interact in a single, contiguous galaxy. It is also notable for its twitch combat and fidelity to real physics.
Gameplay
The twitch gameplay in Vendetta Online revolves around lining up a correct shot against enemy ships, while avoiding incoming fire. The dynamics of this can be complex, as ships are moving through 3-D space, and the weapons fire itself has a specific velocity, modified by the ships' absolute velocity. The ships mostly obey the laws of Newtonian Mechanics although a few artificial limits are put in place to increase the playability of the game. The control scheme includes a full six degrees of freedom, allowing users to assign keys or control axes (via joystick, thumb-stick, throttle, accelerometer, or touch area) to yaw, pitch, roll, and thrust along three axes. Ships can also be controlled with the mouse and keyboard using "mouselook" mode, in which the direction of view is controlled by the mouse and the ship's nose auto-corrects to catch up. Ships each have detailed specifications such as mass, thrust, torque, cargo capacity, top speed, turbo energy drain, armor, and weapon ports. There are also many variants of the main ship types, some holding certain advantages over others, with some advanced variants belonging to special factions. Depending on what equipment is being used, and what is carried in the cargo hold, the mass of the ship (and consequently maneuverability) will change greatly, affecting combat.
Weaponry
There are a wide variety of weapons in Vendetta Online, some requiring energy to fire, others relying on ammunition, proximity fuzes, target tracking, or some combination thereof. As most weapons have a cone of fire assisted by autoaim, effectively deploying weaponry relies less on careful aiming than it does on managing the ship's momentum, energy, attitude and distance to target. Knowledge of combat proves an effective tool, as a veteran pilot flying mediocre equipment will often defeat a less experienced pilot using superior equipment, by virtue of tactics alone. However, certain weapons do require careful aiming, such as railguns. Weapons may cause the target ship to be displaced, or to spin through concussive force. Weapons may als |
https://en.wikipedia.org/wiki/Aaron%27s%2C%20Inc. | The Aaron's Company is an American lease-to-own retailer. The company focuses on leases and retail sales of furniture, electronics, appliances, and computers. The company sells through the company-operated and franchised stores, e-commerce platform (Aarons.com)
Locations
, the Aaron's Company has 1,340 stores: 1,092 company-operated stores (in 43 states and Canada) and 248 independently owned and operated franchised stores in 35 states and Canada.
History
Aaron Rents, Inc. was founded by R. Charles Loudermilk, Sr. in 1955.
In September 2008, Aaron's announced the sale of its Corporate Furnishings division to CORT Business Services, part of Berkshire Hathaway. Aaron's Corporate Furnishings division, which operated 47 stores, recorded revenues of approximately $99 million in 2007.
As of December 31, 2016, Aaron's had 1,864 stores located in 28 states and the District of Columbia and Canada. In addition, they had 699 independently owned franchised stores in 46 states and Canada.
On July 29, 2020, Aaron's Holdings Company, Inc. announced plans to split into two companies: PROG Holdings, Inc. and The Aaron's Company, Inc. PROG Holdings, with the ticker symbol "PRG" (), remained in the S&P Midcap 400 stock index but its Global Industry Classification Standard was changed to "Consumer Finance". The Aaron's Company continueed to trade under the ticker symbol "AAN" () but was moved into the S&P Smallcap 600.
Controversy
In February 2013, customers sued Aaron's for allegedly using spyware on rented computers to send over 185,000 emails to the rental company, including customers' Social Security numbers, passwords and captured keystrokes, as well as explicit images. The Aaron's Company officials had previously said that the company had not installed the spyware, and individual franchisees were responsible. In October 2013, Aaron's agreed to a settlement with the Federal Trade Commission that limited how it used monitoring technology and ordered it to delete customer information that had been improperly collected.
Sponsorships
NASCAR racing: Aaron's entered NASCAR jumping in between multiple teams and drivers, sponsoring drivers such as Johnny Benson Jr., Kenny Wallace, and Hermie Sadler. In 2008, Aaron's then became the full-time sponsor for the team Michael Waltrip Racing in NASCAR's Monster Energy Cup Series for a couple of years, sponsoring drivers such as David Reutimann, Michael McDowell, Mark Martin, Brian Vickers, and David Ragan in a scheme that was named the "Aaron's Dream Machine". Aaron's was also the namesake of the spring race at Talladega Superspeedway, the Aaron's 499, along with the Xfinity Series spring race at the track, the Aaron's 312, from 2002 to 2014. Aaron's also sponsored Clint Bowyer for a single race in Atlanta during the 2016 season. The year after, Aaron's sponsored Michael Waltrip in his last race.
National Hot Rod Association racing: Aaron's sponsored Don Schumacher Racing in the NHRA Camping World Drag Racing S |
https://en.wikipedia.org/wiki/Torque%20%28game%20engine%29 | Torque Game Engine, or TGE, is an open-source cross-platform 3D computer game engine, developed by GarageGames and actively maintained under the current versions Torque 3D as well as Torque 2D. It was originally developed by Dynamix for the 2001 first-person shooter Tribes 2. In September 2012, GarageGames released Torque 3D as open-source software under the MIT License.
Torque 3D features a world editor suite including tools for sculpting terrain and painting forests, drawing rivers and roads, as well as material, particle and decal editing. It supports the open COLLADA file format as interface to 3D digital content creation software. PhysX provides support for cloth dynamics, rigid body dynamics, destructible objects and joints, as well as fluid buoyancy simulation. Other features include a deferred lighting model and modern shader features such as dynamic lighting, normal and parallax occlusion mapping, screen space ambient occlusion, depth of field, volumetric light beam effects, lens flare/corona effects, refraction, bloom, blurring and color correction, among others. Networking functionality for multiplayer support is included as well. Build support is provided for desktop Windows, Linux, macOS and Web platforms.
Inception
The Torque engine and its many derivative products were available for license from GarageGames, a company formed by many members of the Tribes 2 team at Dynamix. GarageGames was later acquired by InstantAction, but on November 11, 2010, InstantAction announced that it was winding down its operations and looking for potential buyers for Torque. On January 19, 2011, GarageGames was re-acquired by Graham Software Development, and their name was reverted back to the original.
GarageGames released Torque 3D as open-source software under the MIT License on September 20, 2012. Torque 2D followed on February 5, 2013. Torque 3D and most of their other products were to continue being developed and supported. The latest stable release of Torque 2D was marked May 2018 on GitHub, and the latest stable release of Torque 3D was marked August 2022, on GitHub.
History
Original Torque Game Engine
The original Torque Game Engine, which has been superseded by Torque 3D, provided networking code, scripting, in-engine world editing, and GUI creation. The source code could be compiled for Windows, macOS, Linux, Wii, Xbox 360, and iOS platforms. TGE shipped with starter kits for a first-person shooter and an off-road racing game. A real-time strategy starter kit was also available as a separate purchase. These starter packs could be modified to suit the needs of the developer, or the developer could start from scratch.
The engine supported loading of 3D models in the DTS and DIF file formats. DTS models were typically used for characters and vehicles though occasionally for buildings and interiors. They could be animated using either skeletal or morph target animation. It was also possible to blend multiple skeletal animations together |
https://en.wikipedia.org/wiki/National%20University%20of%20Computer%20and%20Emerging%20Sciences | The National University of Computer and Emerging Sciences (NUCES) (), also known as Foundation for Advancement of Science and Technology (FAST), is a private research university with multiple campuses in different cities of Pakistan.
Overview
The university is the first multi-campus university in Pakistan, having five modern campuses based in different cities. These campuses are located in Chiniot-Faisalabad, Islamabad, Karachi, Lahore and Peshawar, providing a standard educational environment and recreational facilities to 11,000 students, out of which 500 are faculty members and a quarter is covered by female students. Founded as Federally Chartered University, it was inaugurated by President Pervez Musharraf in July 2000. It is consistently ranked among the leading institutions of higher education in the country and ranked top in computer sciences and information technology by the Higher Education Commission of Pakistan in 2020. Its engineering programs are accredited with Pakistan Engineering Council. FAST is a not-for-profit educational institution charging subsidized fees from its students. Besides this, FAST offers different financial assistance programs for deserving students in the form of loans.
FAST is considered to be very strict in Pakistan.
History
The Foundation of Advancement of Science and Technology was founded and established by Bank of Credit and Commerce International financier. Hasan Abidi, founder of BCCI, provided a large financial capital for the university to promote research in computer sciences and emerging technologies during 1980s. Later this foundation established the National University of Computer and Emerging Sciences which was inaugurated by Former President and Chief of Army Staff General Pervez Musharraf in 2000. It is privileged to be the first private sector university, having multiple campuses set up under the Federal Charter granted by Ordinance No.XXIII of 2000, dated July 1, 2000.
Established in 1980, the sponsoring body of FAST university was registered by Government of Pakistan as a charitable institution. FAST was a pioneer in Pakistan's IT sector development by offering the country's first undergraduate computer science curriculum, with its headquarters at Islamabad.
Campuses
National University of Computer and Emerging Sciences is a university in Pakistan, with a multi-campus setup and its central administration based in Islamabad. The university operates five campuses in Islamabad, Karachi, Lahore, Peshawar, and Faisalabad.
Islamabad Campus
The FAST National University Islamabad campus, situated at A.K Brohi Road, H-11/4, serves as the university's main hub.The university is very beautiful
Karachi Campus
The FAST National University Karachi campus has two branches: the main campus, located on the National Highway, and the city campus, located in Block-6 PECHS.
Lahore Campus
The FAST National University Lahore campus is situated in Faisal Town and spans 12.5 acres of land.
At the Lahore |
https://en.wikipedia.org/wiki/Ada%20Conformity%20Assessment%20Test%20Suite | The Ada Conformity Assessment Test Suite (ACATS) is the test suite used for Ada processor conformity testing. A prior test suite was known as the Ada Compiler Validation Capability (ACVC).
ACVC era
The Ada Compiler Validation Capability test suite, commonly referred to as the ACVC tests, was the original test suite developed for the Ada language. The ACVC system was organized under the aegis of the Ada Joint Program Office.
The tests were developed by the American company SofTech, beginning around 1980.
The test suites were modeled on a VAX/VMS system, which was the dominant host platform for such defense-related applications at the time.
Some of the tests were composed using orthogonal Latin squares as an approach towards get the most effective coverage of language feature combinations without employing an exhaustive enumeration of them.
The individual test files were based on the section of the Ada reference manual they pointed to, for instance C45210A.ADA. The suite included both positive tests and negative tests. There was an organization set up to review queries vendors raised as to whether a certain aspect of one or more tests was an accurate reflection of the language standard.
The year 1985 saw the issuing of the first Ada validation certificates. At the height of the language's use, which corresponded to the years 1985 through 1993, there were five Ada Validation Facilities around the world that could process vendor ACVC submissions: the Language Control Facility at Wright Patterson Air Force Base (United States), the National Bureau of Standards (United States, soon renamed to the National Institute of Standards), the National Computing Centre (United Kingdom), AFNOR (France), and IABG (Germany). However once Ada use for defense or similar applications began falling, the number of validation contracts fell as well, and several of these facilities became inoperative or transferred their responsibilities.
The Ada Compiler Validation Capability came to an end with the closure of the Ada Joint Program Office in 1998. Ada compiler vendors still wanted a validation mechanism, however, so a new validation system was devised to replace it, the Ada Conformity Assessment Test Suite.
ACATS era
The preface to the test report includes the following:
Conformity assessment does not ensure that a processor has no nonconformities to the Ada standard other than those, if any, documented in this report. The compiler vendor declares that the tested processor contains no deliberate deviation from the Ada standard; a copy of this Declaration of Conformity is presented immediately after the certificate.
The second paragraph of the background of the current ACAA procedures says:
It is important to note the scope and intent of conformity assessment. The purpose of conformity assessment is to ensure that Ada processors achieve a high degree of conformity with the Ada standard (Ada95 as corrected by [TC1]). Characteristics such as performanc |
https://en.wikipedia.org/wiki/Parengarenga%20Harbour | { "type": "ExternalData", "service": "geoshape", "ids": "Q1375426", "properties": { "fill": "#73a3f0"}}
Parengarenga Harbour is a natural harbour close to the northernmost point on the North Island of New Zealand. Located at the northern end of the Aupōuri Peninsula, it extends inland for over 10 kilometres, almost severing the northern tip of the island from the rest of the peninsula. The harbour's mouth is towards the northern end of Great Exhibition Bay. The island's northernmost point, at the Hikurua / de Surville Cliffs is only about 10 kilometres north of the harbour. Te Hāpua is a settlement at the western side of the harbour.
History
The harbour was an important location for the kauri gum digging trade in the latter 19th and early 20th centuries, as some of the highest quality kauri gum could be found around the harbour. The Parenga Gumfield Company was formed to harvest this resource.
The white sand of Kokota Sandspit, at the southern head of Parengarenga Harbour, has provided a source of high purity silica sand for glassmaking. Dredging continued here until 1997. While smaller or lower purity deposits are found elsewhere in Northland, the Parengarenga area holds the region's largest silica sand resource by far.
Samuel Yates and his wife, Ngāwini Yates, were prominent landowners in the area in the later part of the 19th century and had a homestead on the southern side of the harbour, at Paua.
Ecology
The water is a habitat for Green sea turtles and dolphins, while Orca, and Pilot whales visit the adjacent areas.
Gallery
References
Far North District
Geography of the Northland Region
Ports and harbours of New Zealand
Kauri gum |
https://en.wikipedia.org/wiki/UVC-based%20preservation | UVC-based preservation is an archival strategy for handling the preservation of digital objects. It employs the use of a Universal Virtual Computer (UVC)—a virtual machine (VM) specifically designed for archival purposes, that allows both emulation and migration to a language-neutral format like XML.
Background to the development of a UVC approach
Digital preservation problem
Preservation of digital resources is of a paramount importance for deposit libraries, research libraries, archives, government agencies, and actually most organizations. The dominant approach to digital preservation is migration. Migration entails making periodic transformations of archived information into new logical formats as their native formats, or the software or hardware on which they depend becomes obsolete. The notable danger of migration is data loss, and possible loss of original functionality or the ‘look and feel’ of the original format. Furthermore, digital migrations are time consuming and costly as the process requires converting the format of every document, in addition to copying converted bit streams to new media as necessary.
Emulation theory
Jeff Rothenberg caused a bit of stir in organizations concerned and responsible for digital preservation with his report in 1999: "Avoiding technological quicksand: Finding a viable technical foundation for digital preservation". He states that there are no viable solutions to ensure that digital information will be readable in the future. The proposed solutions of relying on standards and migrations are labeled time consuming and ultimately incapable of preserving digital documents in their original form. He suggests:
"an ideal approach should provide a single, extensible, long-term solution that can be designed once and for all and applied uniformly, automatically, and in synchrony (for example, at every future refresh cycle) to all types of documents and all media, with minimal human intervention."
He proposes that the best way to satisfy the above criteria is Emulation by; developing an emulator that will run on unknown future computers; developing techniques to capture the metadata needed to find, access and recreate the document; developing techniques for encapsulating documents, their attendant metadata, software, and emulator specifications.
In 2000, he suggests implementing an emulation-based preservation approach in which emulator specification are expressed as programs and interpreted by an emulator specification interpreter program written for an emulation virtual machine.
Rothenberg's approach was met with skepticism and considered too technically challenging, too expensive and too time consuming, and therefore an economic risk (without the support of empirical evidence). (See further reading section)
UVC concept development
Role of IBM
Raymond A. Lorie, during his employment at IBM Research Centre Almaden, initiated the development of a UVC-based solution to long-term digital preservation. He |
https://en.wikipedia.org/wiki/Delta%20rule | In machine learning, the delta rule is a gradient descent learning rule for updating the weights of the inputs to artificial neurons in a single-layer neural network. It can be derived as the backpropagation algorithm for a single-layer neural network with mean-square error loss function.
For a neuron with activation function , the delta rule for neuron 's -th weight is given by
where
is a small constant called learning rate
is the neuron's activation function
is the derivative of
is the target output
is the weighted sum of the neuron's inputs
is the actual output
is the -th input.
It holds that and .
The delta rule is commonly stated in simplified form for a neuron with a linear activation function as
While the delta rule is similar to the perceptron's update rule, the derivation is different. The perceptron uses the Heaviside step function as the activation function , and that means that does not exist at zero, and is equal to zero elsewhere, which makes the direct application of the delta rule impossible.
Derivation of the delta rule
The delta rule is derived by attempting to minimize the error in the output of the neural network through gradient descent. The error for a neural network with outputs can be measured as
In this case, we wish to move through "weight space" of the neuron (the space of all possible values of all of the neuron's weights) in proportion to the gradient of the error function with respect to each weight. In order to do that, we calculate the partial derivative of the error with respect to each weight. For the th weight, this derivative can be written as
Because we are only concerning ourselves with the -th neuron, we can substitute the error formula above while omitting the summation:
Next we use the chain rule to split this into two derivatives:
To find the left derivative, we simply apply the power rule and the chain rule:
To find the right derivative, we again apply the chain rule, this time differentiating with respect to the total input to , :
Note that the output of the th neuron, , is just the neuron's activation function applied to the neuron's input . We can therefore write the derivative of with respect to simply as 's first derivative:
Next we rewrite in the last term as the sum over all weights of each weight times its corresponding input :
Because we are only concerned with the th weight, the only term of the summation that is relevant is . Clearly,
giving us our final equation for the gradient:
As noted above, gradient descent tells us that our change for each weight should be proportional to the gradient. Choosing a proportionality constant and eliminating the minus sign to enable us to move the weight in the negative direction of the gradient to minimize error, we arrive at our target equation:
See also
Stochastic gradient descent
Backpropagation
Rescorla–Wagner model – the origin of delta rule
References
Artificial neural networks |
https://en.wikipedia.org/wiki/.mu | .mu is the Internet country code top-level domain (ccTLD) for Mauritius. It is administered by the Mauritius Network Information Centre and registrations are processed via accredited registrars. Some registrars market it as the .music and .museum TLD.
Usage
A number of musical groups have started to use this domain, with .mu being used to indicate music. Some examples are the rock band Athlete, the country band Lonestar, the British progressive rock bands Muse and Pendragon, the New Age musical project Amethystium and the 80s influenced hardcore metal band Blessed By A Broken Heart. In addition, the UK-based record label Planet Mu also uses the .mu domain, with the .mu forming the second half of the label's name. The world's largest direct seller of musical instruments, (Musician's Friend), also uses a .mu URL (frnd.mu) as a link shortener for several of their social media channels, including Twitter. The French webpage for the Canadian Broadcasting Corporation (Radio-Canada) uses the .mu domain for its Music network's web-only personalised music streams.
Recent events
In 2009, a Memorandum of Understanding was signed between Internet Direct and the Government of Mauritius. In 2012, the agreement was not renewed by the Ministry of IT. In July 2013, Internet Direct Limited stated that they would no longer provide services to the Government of Mauritius unless the arrears for domain name registrations and renewals are settled. The National Computer Board of Mauritius refused to pay, claiming that it should be free because they are the Government.
The Information and Communication Technologies Authority (ICTA Mauritius) published a consultation paper in September 2011 and April 2012, with a view to forcing a re-delegation. At the public consultation meeting held on 12 April 2012, the international consultant informed ICTA that their proposal was clumsy and the Government does not have a case for re-delegation, because their proposed model is inappropriate and no proposal will be possible without working together with the current sponsoring organization "Internet Direct Ltd".
In October 2014, the portal of the government of Mauritius was no longer accessible outside the Orange network. Orange is a subsidiary of Mauritius Telecom, the state-owned telecom operator. Various IT experts including staff of AfriNIC, Google and the local Linux Group found that the DNS servers set up by Orange contained incorrect entries, thereby hiding from the Mauritius public the true situation when in fact the services were already disconnected. The Ministry of Information and Communication Technology of Mauritius was not aware of the issue. All the websites hosted on the gov.mu domain name were no longer accessible. It turned out that the Government, despite numerous extensions given to settle the renewal fees, still did not pay for the services and requested the Supreme Court to order Internet Direct Ltd to provide the service for free in perpetuity. Both the Mini |
https://en.wikipedia.org/wiki/Stone%20Soupercomputer | The Stone Soupercomputer was a Beowulf-style computer cluster built at the US Oak Ridge National Laboratory in the late 1990s.
A group of lab employees including William W. Hargrove and Forrest M. Hoffman applied for a grant to build a cluster in 1996, but it was rejected.
They decided to build a cluster anyway, using desktop personal computers that had been discarded as being too slow. The name was derived from the story of stone soup.
The developers used freely available and open source software such as Linux operating system, the Parallel Virtual Machine toolkit, and the Message Passing Interface library.
By early 1997 the first applications were running on the cluster. By May 2001 it had 133 nodes. They included Intel 80486 and Pentium-based machines as well as a few DEC Alpha workstations. Low-cost Ethernet networking was used for interconnection instead of any special-purpose network. The cluster was the subject of an article in Scientific American magazine in 2001. Many applications were developed on this system that could then be deployed on other, faster clusters. The stone cluster was no longer in use by August 2003.
This approach was used as a model for other educational cluster projects.
References
Parallel computing
Oak Ridge National Laboratory |
https://en.wikipedia.org/wiki/Concurrency%20%28road%29 | A concurrency in a road network is an instance of one physical roadway bearing two or more different route numbers. When two roadways share the same right-of-way, it is sometimes called a common section or commons. Other terminology for a concurrency includes overlap, coincidence, duplex (two concurrent routes), triplex (three concurrent routes), multiplex (any number of concurrent routes), dual routing or triple routing.
Concurrent numbering can become very common in jurisdictions that allow it. Where multiple routes must pass between a single mountain crossing or over a bridge, or through a major city, it is often economically and practically advantageous for them all to be accommodated on a single physical roadway. In some jurisdictions, however, concurrent numbering is avoided by posting only one route number on highway signs; these routes disappear at the start of the concurrency and reappear when it ends. However, any route that becomes unsigned in the middle of the concurrency will still be signed on most maps and road atlases.
Overview
Most concurrencies are simply a combination of at least two route numbers on the same physical roadway. This is often practically advantageous as well as economically advantageous; it may be better for two route numbers to be combined into one along rivers or through mountain valleys. Some countries allow for concurrencies to occur, however, others specifically do not allow it to happen. In those nations which do permit concurrencies, it can become very common. In these countries, there are a variety of concurrences which can occur.
An example of this is the concurrency of Interstate 70 (I-70) and I-76 on the Pennsylvania Turnpike in western Pennsylvania. I-70 merges with the Pennsylvania Turnpike so the route number can ultimately continue east into Maryland; instead of having a second physical highway built to carry the route, it is combined with the Pennsylvania Turnpike and the I-76 designation. A triple Interstate concurrency is found in Wisconsin along the section of I-41, I-43, and I-894 in Milwaukee, Wisconsin. The concurrency of I-41 and I-43 on this roadway is an example of a wrong-way concurrency.
The longest Interstate highway concurrency is I-80 and I-90 for across Indiana and Ohio, while the longest Interstate highway concurrency with three interstates is I-39, I-90, and I-94 in Portage, Wisconsin for over 29 miles (47 km).
There are at least two examples of eight-way concurrencies. The first example is in Indianapolis, between exits 46 and 47 of the I-465 beltway, where the highway is concurrent with U.S. Route 31 (US 31), US 36, US 40, US 52, US 421, State Road 37 (SR 37), and SR 67. Once I-69 is extended south of Indianapolis, this segment will have a nine-way concurrency. The second example is in downtown Athens, Georgia, between exits 4 and 8 of Georgia State Route 10 Loop, where the highway is concurrent with US 29, US 78, US 129, US 441, State Route 8 (SR 8), SR 15, and SR 422.
|
https://en.wikipedia.org/wiki/EXeem | eXeem was a peer-to-peer (P2P) file sharing client using the BitTorrent protocol. eXeem was designed to replace the need for centralized trackers (servers which co-ordinate the transfer of metadata across a BitTorrent network). It largely failed to achieve this goal, and the project was canceled and eXeem's network was shut down by the end of 2005.
eXeem was written in C++ using the open source libtorrent library for its BitTorrent functionality.
Overview
eXeem was created by Swarm Systems Inc. which is located in Saint Kitts and Nevis. The company employed Andrej Preston, the founder of Suprnova.org, as its spokesperson and public face of eXeem. Five thousand Suprnova.org users were selected to take part in a private beta test of eXeem before the public beta was released on January 21, 2005.
eXeem's developers expected to implement the following features:
On-the-fly encryption and decryption
Searching by file hash
Quality of service features
Proper Universal Plug and Play-support
User comments & ratings, but only when the file has been downloaded (to prevent fake ratings)
Minimum limited upload rate (5 kB/s) to stop leechers.
Criticism of eXeem
Criticism of eXeem arose soon after it debuted and included:
eXeem's for-profit operating model, including support through advertising (much akin to Kazaa) and a public beta that included HTML ads supported by Cydoor, which is widely considered to be spyware. Ads-free versions called eXeem Lite and BIT eXeem were subsequently released, and eXeem later replaced Cydoor with WhenU from version 0.21 onward.
Closed source code development, in contrast with the open-source model followed by the most popular BitTorrent software, on which eXeem is based.
No initial Linux or Macintosh versions, with no ability to allow third parties to port the code beyond Windows (as eXeem is closed source).
Seacay was released as a Linux Client for the eXeem network when eXeem version 0.21 was released (see screenshot, right )
Network
The eXeem network used super-peers that were used to track torrents (as ordinary BitTorrent trackers). These super-peers were also responsible for maintaining file lists, comments and ratings for part of the files in the network. When a peer that was tracking a torrent was closed or went down, a new peer was assigned to be the tracker for that particular torrent.
See also
Distributed hash table (DHT) used in trackerless torrents
Peer exchange (PEX) used in trackerless torrents
References
External links
News article on Slyck – includes partial transcript of Sloncek interview
Spanish eXeem tutorial
File sharing software |
https://en.wikipedia.org/wiki/.ph | .ph is the Internet country code top-level domain (ccTLD) for the Philippines.
The official domain registry of the .ph domain is dotPH Domains Inc. dotPH holds and maintains the database of PH domain names, specifically .ph, .com.ph, .net.ph, and .org.ph. Its domain name registrars are not only individuals, businesses, and organizations in the Philippines, but also those in other parts of the world.
The PH domain is currently administered by José Emmanuel "Joel" Disini, who is also dotPH's current CEO. Disini has been the domain administrator since Jon Postel assigned him the domain in 1990. The domain is sponsored by the PH Domain Foundation, a social outreach arm of dotPH which was also founded by Disini together with a group of IT professionals in August 1999.
In 1994, the administration of the .gov.ph domain was sub-delegated to the Government of the Philippines. In like manner, .edu.ph was sub-delegated to the Philippine Network Foundation, Inc. (PHNET).
Aside from being the registry, dotPH sells domains and web-related services such as web hosting, co-location, private registration and e-mail forwarding. dotPH also offers a free referral service which connects Small- and Medium-sized Enterprises with a network of over 300 accredited professional Filipino web designers. It formerly offered a free blogging service through .i.ph domains.
History
Birth of the .ph registry
In 1989, Joel Disini founded the Email Company (EMC), one of the earliest Internet service providers in the Philippines. At that time most networks (including EMC) were connected to the Internet via UUCP. Disini's network had a UUCP connection to UUNET. This network connection, along with Disini's credentials as a Computer Science and Electrical Engineering graduate of Caltech and five-year experience in Macintosh Networking & Communications software development in Cupertino, California, became Jon Postel's basis for delegating the .ph domain to him. The .ph country code top-level domain was officially delegated on September 14, 1990. Since then, .ph domains have been commercially available to the public.
In 1994, the PHNET wide-area network, a project funded by DOST, completed its development and was able to connect the Philippines to the rest of the world by establishing TCP/IP connections to the U.S. using 64 kbit/s international leased lines.
At this point, the PHNET Foundation wanted to take over the administration of the .ph domain registry. Protracted negotiations took place, and eventually the responsibility of administrating the .edu.ph and .gov.ph domains were transferred to the PHNET Foundation and the Department of Science and Technology, respectively.
At that time domain fees ranged from Php 450 to Php 1,350. Domains registered during this period had no expiration and therefore had no renewal rates, thus the label lifetime domains. However, a fee was charged for modifications to these domains. Lifetime domains were non-transferable, and were only valid fo |
https://en.wikipedia.org/wiki/.sd | .sd is the Internet country code top-level domain (ccTLD) for Sudan.
2nd level domains
com.sd - Companies
net.sd - Network providers and ISPs
org.sd - Sudanese NGOs
edu.sd - Sudanese universities and colleges
med.sd - Medical
tv.sd - TV channels and Electronic media
gov.sd - Sudanese government and ministries
info.sd - Newspapers, information, and media
Second top domain
A new top domain string using Arabic letters, سودان, was reserved for Sudan in November 2012.
References
External links
IANA .sd whois information
Country code top-level domains
Communications in Sudan
sv:Toppdomän#S |
https://en.wikipedia.org/wiki/.sy | .sy is the Internet country code top-level domain (ccTLD) for Syria. The registry is operated by the National Agency for Network Services. It took over from the Syrian Telecommunications Establishment in 2011.
Second-level domains
There are several reserved second-level domains. They are:
.edu.sy (educational institutions)
.gov.sy (Government of Syria and government agencies)
.net.sy (network operator/providers)
.mil.sy (Syrian Armed Forces)
.com.sy (commercial entities)
.org.sy (nonprofit organisations)
.news.sy (news agencies)
External links
IANA .sy whois information
.sy registration rules
Country code top-level domains
Telecommunications in Syria
Internet in Syria
sv:Toppdomän#S |
https://en.wikipedia.org/wiki/.tt | .tt is the internet country code top-level domain (ccTLD) in the Domain Name System of the Internet for Trinidad and Tobago.
The Trinidad and Tobago Network Information Centre (TTNIC) allows registrations under for second-level domains, and for third-level domains under the following domains: , , , , , , , , , , , , , , and . Registration under the above domains is unrestricted and the registry does not require applicants to have a physical presence in Trinidad and Tobago. However, registrants with a foreign address are charged double.
In addition, there is , restricted to entities in the Military of Trinidad and Tobago, is a registry for educational institutions in Trinidad and Tobago, and reserved for agencies of the government.
Domain hacks using include , and , URL shorteners used for Dropbox, IFTTT and the 2012 U.S. presidential campaign of Mitt Romney, respectively.
See also
Internet in Trinidad and Tobago
References
External links
IANA .tt whois information
Country code top-level domains
Communications in Trinidad and Tobago
Computer-related introductions in 1991
sv:Toppdomän#T |
https://en.wikipedia.org/wiki/.tz | .tz is the Internet country code top-level domain for Tanzania.
Through a consultative process, Tanzania Network information Centre (tzNIC), a not-for-profit company was established and registered (in 2006) to administer and manage the operations of the Tanzania country code top-level domain. tzNIC is a limited company (by guarantee) with two founding members – the Tanzania Communication Regulatory Authority (the regulator) and the Tanzania Internet Service Provider Association.
On 29 April 2010, the .tz top-level domain was transferred to tzNIC. On 18 October 2018, the members of tzNIC passed a resolution to liquidate itself and agreed to “execute the process of transferring the tzNIC functions to TCRA”. The decision was made after they confirmed that tzNIC had not fulfilled its financial sustainability goal and that the TCRA could no longer financially support it. The resolution recognized that the “only way forward in compliance with the law was for tzNIC’s functions to be absorbed within TCRA in such a way that same present tzNIC staff would continue managing and administering the same .tz registry infrastructure within TCRA”.
From July 1995 until March 2022, registrations were permitted only at the third level beneath the following second-level names:
.co.tz – commercial
.ac.tz – schools granting baccalaureate degrees
.go.tz – governmental entities
.or.tz – not-for-profit organizations
.mil.tz – exclusively for Tanzania Military entities recognized by the Ministry responsible for Defence
.sc.tz – schools that are elementary, primary and secondary level institutions
.ne.tz – network infrastructure
On 1 March 2022 and effective on 1 July of that year, Tanzania's Ministry of Information, Communication, and Information Technology began to allow registrations at the top-level domain .tz without the use of a second-level domain such as .co.tz. The ministry also removed the requirement for registrants to have a local presence in Tanzania.
Additional second-level names were added on Tuesday, 14 February 2012:
.hotel.tz – hotel operators
.mobi.tz – mobile phone operators
.tv.tz – television operators and stations
.info.tz – informational sites such as museums
.me.tz – individuals
On 1 March 2022 the Tanzania Communication Regulatory Authority opened .tz second-level domain registration in parallel with other third-level domains such as .co.tz, .or.tz etc. At that time, registration was allowed only to priority groups, until 1 July 2022 when .tz second domain registration was opened to the general public. Priority groups were existing third-level .tz domain owners (those registered before 1 March 2022) and trademark owners. Unlike third-level domains, the second-level domain is a premium .tz domain, elegant, easy to remember and sounds more professional than other third-level domains. Registration of .tz follows similar processes as other .tz domains, and can be done via any TCRA accredited registrars. For the second-level domai |
https://en.wikipedia.org/wiki/Z22%20%28computer%29 | The Z22 was the seventh computer model Konrad Zuse developed (the first six being the Z1, Z2, Z3, Z4, Z5 and Z11, respectively). One of the early commercial computers, the Z22's design was finished about 1955. The major version jump from Z11 to Z22 was due to the use of vacuum tubes, as opposed to the electromechanical systems used in earlier models. The first machines built were shipped to Berlin and Aachen.
By the end of 1958 the ZMMD-group had built a working ALGOL 58 compiler for the Z22 computer. ZMMD was an abbreviation for Zürich (where Rutishauser worked), München (workplace of Bauer and Samelson), Mainz (location of the Z22 computer), Darmstadt (workplace of Bottenbruch).
In 1961, the Z22 was followed by a logically very similar transistorized version, the Z23. Already in 1954, Zuse had come to an agreement with Heinz Zemanek that his Zuse KG would finance the work of Rudolf Bodo, who helped Zemanek build the early European transistorized computer Mailüfterl, and that after that project Bodo should work for the Zuse KG—there he helped build the transistorized Z23. Furthermore, all circuit diagrams of the Z22 were supplied to Bodo and Zemanek.
The University of Applied Sciences, Karlsruhe still has an operational Z22 which is on permanent loan at the ZKM in Karlsruhe.
Altogether 55 Z22 computers were produced.
In the 1970s, clones of the Z22 using TTL were built by the company Thiemicke Computer.
Technical data
The typical setup of a Z22 was:
14 words of 38-bit as fast access RAM implemented as core memory
8192 word (38-bit each) magnetic drum memory as RAM
One teletype as console and main input/output device
Additional punch tape devices as fast input/output devices
600 tubes working as flip-flops
electrical cooling unit, needing a water tap connection (water cooling, so to say)
380 V 16 A three-phase power supply
The Z22 operated at 3 kHz operating frequency, which was synchronous with the speed of the drum storage. The input of data and programs was possible via punch-tape reader and console commands. The Z22 also had glow-lamps which showed the memory state and machine state as output.
Programming
The Z22 was designed to be easier to program than previous first generation computers. It was programmed in machine code with 38-bit instruction words, consisting of five fields:
2 bits `10` to mark an instruction
18-bit instruction field, thereof:
5 bits condition symbols
13 bits operation symbols
5-bit fast storage (core) address
13-bit (drum) memory address
The 18-bit instruction field did not contain a single opcode, but each bit controlled one functional unit of the CPU. Instructions were constructed from these. For example, the bit 'A' meaning to add the content of a memory location to the accumulator could be combined with `N` Nullstellen (zeroing) to turn the Add instruction into a Load. Many combinations are quite unusual by modern standards, like 'LLRA 4' means "multiply the accumulator by three".
Ther |
https://en.wikipedia.org/wiki/Trans-Texas%20Corridor | The Trans-Texas Corridor (TTC) was a proposal for a transportation network in the U.S. State of Texas that was conceived to be composed of a new kind of transportation modality known as supercorridors. The TTC was initially proposed in 2001 and after considerable controversy was discontinued by 2010 in the planning and early construction stages.
The network, as originally envisioned, would have been composed of a network of supercorridors up to wide to carry parallel links of tollways, rails, and utility lines. It was intended to route long-distance traffic around population centers, and to provide stable corridors for future infrastructure improvements–such as new power lines from wind farms in West Texas to the cities in the east–without the otherwise often lengthy administrative and legal procedures required to build on privately owned land. The tollway portion would have been divided into two separate elements: truck lanes and lanes for passenger vehicles. Similarly, the rail lines in the corridor would have been divided among freight, commuter, and high-speed rail. The Texas Department of Transportation (TxDOT) intended to "charge public and private concerns for utility, commodity or data transmission" within the corridor,
in essence making a toll road for services such as water, electricity, natural gas, petroleum, fiber optic lines, and other telecommunications services. The network would have been funded by private investors and built and expanded as demand warrants.
In 2009, TxDOT decided to phase out the all-in-one corridor concept in favor of developing separate rights-of-way for road, rail, and other infrastructure using more traditional corridor widths for those modes. In 2010, official decision of "no action" was issued by the Federal Highway Administration, formally ending the project. The action eliminated the study area and canceled the agreement between TxDOT and ACS-Zachry.
In 2011, the Texas Legislature formally canceled the Trans-Texas Corridor with the passage of HB 1201.
Network
The TTC was hoped to be a multi-use, statewide system that would have included new and existing highways, railways, and utility rights-of-way. According to the Houston Chronicle, on January 6, 2009, "In response to public outcry, the ambitious proposal to create the Trans-Texas Corridor network has been dropped and will be replaced with a plan to carry out road projects at an incremental, modest pace".
The network was proposed to include separate lanes for passenger and truck traffic, freight and high-speed commuter railways, and infrastructure for utilities, including water, oil, and gas pipelines; electricity; along with broadband and other telecommunications services. Although the model corridor design incorporates all of these elements running in parallel within a shared right-of-way, more recent plans suggested that existing rail and road corridors could be used for some components of the TTC. The model corridor design also represented |
https://en.wikipedia.org/wiki/M3U | M3U (MP3 URL or Moving Picture Experts Group Audio Layer 3 Uniform Resource Locator in full) is a computer file format for a multimedia playlist. One common use of the M3U file format is creating a single-entry playlist file pointing to a stream on the Internet. The created file provides easy access to that stream and is often used in downloads from a website, for emailing, and for listening to Internet radio.
Although originally designed for audio files, such as MP3, it is commonly used to point media players to audio and video sources, including online sources. M3U was originally developed by Fraunhofer for use with their Winplay3 software, but numerous media players and software applications now support the format.
Careless handling of M3U playlists has been the cause of vulnerabilities in many music players such as VLC media player, iTunes, Winamp, and many others.
File format
There is no formal specification for the M3U format; it is a de facto standard.
An M3U file is a plain text file that specifies the locations of one or more media files. The file is saved with the "m3u" filename extension if the text is encoded in the local system's default non-Unicode encoding (e.g., a Windows codepage), or with the "m3u8" extension if the text is UTF-8 encoded.
Each entry carries one specification. The specification can be any one of the following:
an absolute local pathname; e.g., C:\My Music\Heavysets.mp3
a local pathname relative to the M3U file location; e.g. Heavysets.mp3
a URL
Each entry ends with a line break which separates it from the following one. Furthermore, some devices only accept line breaks represented as CR LF, but do not recognize a single LF.
Extended M3U
The M3U file can also include comments, prefaced by the "#" character. In extended M3U, "#" also introduces extended M3U directives which are terminated by a colon ":" if they support parameters.
Apple used the extended M3U format as a base for their HTTP Live Streaming (HLS) which was documented in an Independent Submission Stream RFC in 2017 as RFC 8216. Therein, a master playlist references segment playlists which usually contain URLs for short parts of the media stream. Some tags only apply to the former type and some only to the latter type of playlist, but they all begin with #EXT-X-.
M3U8
The Unicode version of M3U is M3U8, which uses UTF-8-encoded characters. M3U8 files are the basis for the HTTP Live Streaming (HLS) format originally developed by Apple to stream video and radio to iOS devices, and which is now a popular format for adaptive streaming in general.
The 2015 proposal for the HLS playlist format uses UTF-8 exclusively and does not distinguish between the "m3u" and "m3u8" file name extensions.
Internet media types
The only Internet media type registered for M3U and M3U8 is application/vnd.apple.mpegurl, registered in 2009 and only referring to the playlist format as used in HLS applications.
The current proposal for the HLS playlist format ackn |
https://en.wikipedia.org/wiki/Netscape%20Portable%20Runtime | The Netscape Portable Runtime, or NSPR, is a cross-platform abstraction layer library for the C programming language. It provides a uniform API for various operating system functions.
History
Much of the library, and perhaps the overall thrust of it in the Gromit environment, provides the underpinnings of the Java virtual machine, more or less mapping the sys layer that Sun defines for the porting of the Java VM to various platforms. NSPR does go beyond that requirement in some areas, as it also functions as the platform-independent layer for most of the servers produced by Netscape.
The first generation of NSPR originally aimed just to satisfy the requirements of porting Java to various host environments. NSPR20, an effort started in 1996, built on that original idea, though very little remains of the original code. (The "20" in "NSPR20" does not mean "version 2.0" but rather "second generation".) Many of the concepts show reform, expansion, and maturation. In 2009, NSPR still functioned appropriately as the platform-dependent layer under Java, but it also served in supporting clients written entirely in C or in C++.
Features
Threads
Threads feature prominently in NSPR. The software industry's offering of threads lacks consistency. NSPR, while far from perfect, does provide a single API to which clients may program and expect reasonably consistent behavior. The operating systems provide everything from no concept of threading at all up to and including sophisticated, scalable and efficient implementations. NSPR makes as much use of what the systems offer as it can. NSPR aims to impose as little overhead as possible in accessing those appropriate system features.
Thread synchronization
Thread synchronization loosely depends on monitors as described by C. A. R. Hoare in "Monitors: An operating system structuring concept", Communications of the ACM, 17(10), October 1974 and then formalized by Xerox' Mesa programming language ("Mesa Language Manual", J.G. Mitchell et al., Xerox PARC, CSL-79-3 (Apr 1979)). This mechanism provides the basic mutual exclusion (mutex) and thread notification facilities (condition variables) implemented by NSPR. Additionally, NSPR provides synchronization methods more suited for use by Java. The Java-like facilities include monitor reentrancy, implicit and tightly bound notification capabilities with the ability to associate the synchronization objects dynamically.
I/O
NSPR's I/O slightly augments the Berkeley sockets model and allows arbitrary layering. The designers originally intended to export synchronous I/O methods only, relying on threads to provide the concurrency needed for complex applications. That method of operation remains preferred, though one can configure the network I/O channels as non-blocking in the traditional sense.
Network addresses
Part of NSPR deals with manipulation of network addresses. NSPR defines an IP-centric network address object. While it does not define the object as opaque, |
https://en.wikipedia.org/wiki/Service%20discovery | Service discovery is the process of automatically detecting devices and services on a computer network. This reduces the need for manual configuration by users and administrators. A service discovery protocol (SDP) is a network protocol that helps accomplish service discovery. Service discovery aims to reduce the configuration efforts required by users and administrators.
Service discovery requires a common language to allow software agents to make use of one another's services without the need for continuous user intervention.
Protocols
There are many service discovery protocols, including:
Bluetooth Service Discovery Protocol (SDP)
DNS Service Discovery (DNS-SD), a component of zero-configuration networking
DNS, as used for example in Kubernetes
Dynamic Host Configuration Protocol (DHCP)
Internet Storage Name Service (iSNS)
Jini for Java objects.
Lightweight Service Discovery (LSD), for mobile ad hoc networks
Link Layer Discovery Protocol (LLDP) standards-based neighbor discovery protocol similar to vendor-specific protocols which find each other by advertising to vendor-specific broadcast addresses (versus all-1's), such Cabletron (Enterasys) and Cisco Discovery Protocol (both referred to as CDP but different formats).
Local Peer Discovery, or Local Service Discovery
Multicast Source Discovery Protocol (MSDP), usually used for unicast exchange of multicast source information between anycast Rendez-Vous Points (RPs) to service mcast clients.
Service Location Protocol (SLP)
Session Announcement Protocol (SAP) used to discover RTP sessions
Simple Service Discovery Protocol (SSDP), a component of Universal Plug and Play (UPnP)
Universal Description Discovery and Integration (UDDI) for web services
Web Proxy Autodiscovery Protocol (WPAD)
WS-Discovery (Web Services Dynamic Discovery)
XMPP Service Discovery (XEP-0030)
XRDS (eXtensible Resource Descriptor Sequence) used by XRI, OpenID, OAuth, etc.
See also
Discoverability
Semantic web
References
External links
Service Discovery S-Cube Knowledge Model
Dong, H., Hussain, F.K., Chang, E.: Semantic Web Service matchmakers: State of the art and challenges[Online]. Concurrency and Computation: Practice and Experience 25(7) (May 2013) pp. 961–988. Accessed on June 16, 2015.
Sun, L., Dong, H., Hussain, F.K., Hussain, O.K., Chang, E.: Cloud service selection: State-of-the-art and future research directions. Journal of Network and Computer Applications[Online] 45 (October 2014) pp. 134–150. Date accessed: 16 June 2015.
Internet protocols
Application layer protocols
Computer configuration
Service-oriented (business computing) |
https://en.wikipedia.org/wiki/Bedrock%20%28framework%29 | Bedrock was a joint effort by Apple Computer and Symantec to produce a cross platform programming framework for writing applications on the Apple Macintosh and Microsoft Windows platforms. The project was a failure for a variety of reasons, and after delivering a developer preview version the project was abandoned in late 1993.
History
Background
Bedrock started as an internal effort at Symantec in the early 1990s. At the time many of Symantec's products ran on both Mac and Windows, and what would become Bedrock was originally an internal set of tools intended to ease the effort of keeping both platforms up to date.
In 1991, Apple released the 3.0 version of its own development environment, MPW, along with its own object framework, MacApp. MPW was a command-line driven system that had not been competitively maintained. MacApp 3.0 is a major upgrade from previous versions, being ported from Object Pascal to C++. This left it largely incompatible with the previous version, and caused considerable consternation in the Mac developer community.
Symantec was also the supplier of the then-premier development platform on the Mac, Think C. This is a GUI-based environment which included an application framework of its own, TCL. Think C/TCL had garnered a considerable following in the Mac community, especially during the MacApp 3.0 era. To remain competitive, at some point MPW would have to be replaced with something much more similar to Think.
Throughout this period, Microsoft Windows was first starting its rise in popularity. Cross-platform development systems had been developed, but to this time they tended to be relatively simple, delivering least-common-denominator applications. A cross-platform SDK that could deliver first-rate solutions is one of the industry's supremely idealistic goals at the time.
Concept
The first mention of a collaboration between Apple and Symantec was contained in the flier for WWDC '92. The companies talked about it very briefly at the show, calling it "Cross Platform Framework" and mentioning that more would be revealed at the PC Expo show in June. This was greeted with considerable interest in the press.
At the MacWorld show they announced the conceptnot yet a real productas Bedrock. Bedrock would first be released on the Mac and Windows, with plans to expand it in the future to support Unix, OS/2, Windows NT, and Pink—the OS originated at Apple and now developed at Taligent. It was expected to become "the most direct path for migration" from System 7 to Pink. Allowing a single application source code base to target all of these platforms, Bedrock was intended to become the total successor to MacApp. Seven MacApp engineers at Apple were adding MacApp 3.0 technology and functionality. Even though Bedrock did not yet exist as a product, MacApp was officially deprecated with a maintenance release of 3.0.1, unless Bedrock's schedule would eventually slip.
Bedrock development was intended to be supported on Macintosh by |
https://en.wikipedia.org/wiki/ISO%2010303 | ISO 10303 is an ISO standard for the computer-interpretable representation and exchange of product manufacturing information. It is an ASCII-based format. Its official title is: Automation systems and integration — Product data representation and exchange. It is known informally as "STEP", which stands for "Standard for the Exchange of Product model data". ISO 10303 can represent 3D objects in Computer-aided design (CAD) and related information.
Overview
The objective of the international standard is to provide a mechanism that is capable of describing product data throughout the life cycle of a product, independent from any particular system. The nature of this description makes it suitable not only for neutral file exchange, but also as a basis for implementing and sharing product databases and archiving.
STEP can be typically used to exchange data between CAD, computer-aided manufacturing, computer-aided engineering, product data management/enterprise data modeling and other CAx systems.
STEP addresses product data from mechanical and electrical design, geometric dimensioning and tolerancing, analysis and manufacturing, as well as additional information specific to various industries such as automotive, aerospace, building construction, ship, oil and gas, process plants and others.
STEP is developed and maintained by the ISO technical committee TC 184, Automation systems and integration, sub-committee SC 4, Industrial data. Like other ISO and IEC standards STEP is copyright by ISO and is not freely available. However, the 10303 EXPRESS schemas are freely available, as are the recommended practices for implementers.
Other standards developed and maintained by ISO TC 184/SC 4 are:
ISO 13584 PLIB - Parts Library
ISO 15531 MANDATE - Industrial manufacturing management data
ISO 15926 Process Plants including Oil and Gas facilities Life-Cycle data
ISO 18629 PSL- Process specification language
ISO 18876 IIDEAS - Integration of industrial data for exchange, access, and sharing
ISO 22745 Open technical dictionaries and their application to master data
ISO 8000 Data quality
STEP is closely related with PLIB (ISO 13584, IEC 61360).
History
The basis for STEP was the Product Data Exchange Specification (PDES), which was initiated during the mid-1980's and was submitted to ISO in 1988. The Product Data Exchange Specification (PDES) was a data definition effort intended to improve interoperability between manufacturing companies, and thereby improve productivity.
The evolution of STEP can be divided into four release phases. The development of STEP started in 1984 as a successor of IGES, SET and VDA-FS. The initial plan was that "STEP shall be based on one single, complete, implementation-independent Product Information Model, which shall be the Master Record of the integrated topical and application information models". But because of the complexity, the standard had to be broken up into smaller parts that can be developed, balloted and ap |
https://en.wikipedia.org/wiki/All%20Night%20Nippon | is a Japanese radio program broadcast by Nippon Broadcasting System and other radio stations from 1–5 am (JST). It preempts broadcasts from TBS Radio's programming heard on stations under both JRN and NRN (TBC Radio, CBC Radio, etc.).
DJs
The day of the week below are for the evening preceding in Japan, i.e. day in UTC.
Mondays – Thursdays, 13:00 UTC – 15:00 UTC with "All Night Nippon Music 10 (オールナイトニッポンMUSIC10)" (aired on 11 radio stations in Japan)
Mondays: Ryoko Moriyama
Tuesdays: Anju Suzuki
Wednesdays: Yuko Natori (first and third Wednesday), Chisato Moritaka (second Wednesday), Kaori Kishitani (fourth Wednesday)
Thursdays: Marina Watanabe
Mondays – Saturdays, 16:00 UTC – 18:00 UTC with "All Night Nippon (オールナイトニッポン)" (aired on 36 radio stations in Japan)
Mondays: Ado
Tuesdays: Gen Hoshino
Wednesdays: Nogizaka46
Thursdays: Ninety-nine
Fridays: Shimofuri Myojo
Saturdays: Audrey
Mondays – Thursdays, 18:00 UTC – 19:30 UTC with "All Night Nippon 0(ZERO) (オールナイトニッポン0(ZERO))" (aired on 11 radio stations in Japan from 18:00 UTC until 19:00 UTC, and on 9 radio stations from 19:00 UTC until 19:30 UTC )
Mondays: Fuwa-Chan
Tuesdays: Ano
Wednesdays: Nobuyuki Sakuma
Thursdays: Magical Lovely
Fridays, 18:00 UTC – 20:00 UTC with "All Night Nippon 0(ZERO) (オールナイトニッポン0(ZERO))" (aired on 11 radio stations in Japan from 18:00 UTC until 19:00 UTC, and on 9 radio stations from 19:00 UTC until 20:00 UTC )
Fridays: Sanshiro
Saturdays, 14:30 UTC – 16:00 UTC with "SixTONES No All Night Nippon Saturday Special (SixTONESのオールナイトニッポンサタデースペシャル )" (aired on 34 radio stations in Japan)
SixTONES
Saturdays, 18:00 UTC – 20:00 UTC with "All Night Nippon 0(ZERO) (オールナイトニッポン0(ZERO))" (aired on 22 radio stations in Japan from 18:00 UTC until 19:00 UTC, on 6 radio stations from 19:00 UTC until 19:30 UTC, and on 5 radio stations from 19:30 UTC until 20:00 UTC )
weekly
Jingle
Before commercial breaks, a jingle is sung. The current one is performed by Gen Hoshino.
Other artists who sang the ANN Jingle are these:
kz (livetune) x HachiojiP (Vocal:Hatsune Miku)
Man with a Mission
Yu Sakai
Girl Next Door
Remark Spirits
!wagero!
Hanako Oku
Tommy February6
Sum 41
Changing My Life (.com)
savage genius (SUPER)
smorgas
Unknown
Ram Jam World
Charmysmile & Greenhead
Ken Hirai
L⇔R
Selfish
Keizo Nakanishi
To Be Continued
Crayon-sha
Hiroko Taniyama
Miyuki Nakajima
Junko Ohashi
Taeko Onuki
Toshiki Kadomatsu
Mariya Takeuchi
Tatsuro Yamashita
EPO
The Three Graces
Popular culture
In 1986, Nintendo developed All Night Nippon Super Mario Bros., a special Family Computer Disk System version of Super Mario Bros., as a contest prize for listeners. The game mostly consisted of levels from the original Super Mario Bros., though it also included some levels, graphics, and other gameplay changes from the Japanese Super Mario Bros. 2. Some enemies, characters, and level elements had their graphics changed to reflect people or symbols associated wit |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.