source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/News%209%20Now%20and%20News%20on%206%20Now
|
News 9 Now and News on 6 Now are American regional digital broadcast television networks that are owned by Griffin Media. The channels simulcast and rebroadcast local news programming seen on Griffin-owned CBS affiliates KWTV-DT (channel 9) in Oklahoma City and KOTV-DT (channel 6) in Tulsa, Oklahoma in their respective markets, along with select other programs. News 9 Now is broadcast on KWTV digital subchannel 9.2 in the Oklahoma City market, while News on 6 Now is broadcast on KOTV digital subchannel 6.3 in the Tulsa market. On cable, the individual channels are available on Cox Communications channel 53 in their respective markets.
The services were developed out of News Now 53, a regional cable news channel that operated from December 1996 to April 2011, which was operated by Cox Communications Oklahoma in conjunction with Griffin Communications, and was carried on cable systems within Cox's Oklahoma service area.
Background
News Now 53
The concept of the channel dates back to the August 1993 extension of a retransmission consent agreement made between KWTV and Oklahoma City area cable providers Cox Cable (which rebranded as Cox Communications in 1996) and Multimedia Cablevision (whose systems in suburban areas of the city were acquired by Cox in 2000) to continue carriage of the station's signal; as part of the deal, KWTV announced that it would create a locally originated cable channel providing news, sports and weather information for the two providers.
The service, which was named News Now 53, first launched on December 3, 1996, exclusively on Cox's systems in Oklahoma City and certain inner suburbs; it aired both live airings and rebroadcasts of KWTV's daily local news programs as well as occasional specials produced by the station's news department. Following Griffin's 2000 acquisition of KOTV from the Belo Corporation, News Now 53 expanded to Cox's Tulsa service area, carrying live daily newscasts and news replays from KOTV.
Until the mid-2000s, News Now 53 carried live telecasts of KWTV – and later KOTV's newscasts – in the event that either station was unable to air its regularly scheduled evening newscasts due to CBS sports telecasts that run into that timeslot. In 2008, the channel underwent a graphical revamp, with the introduction of a new logo and the implementation of a new "L" bar (which was an expansion to the graphical display that featured only the current time and temperature as well as notifications regarding the newscast that was being rebroadcast at that time), displaying five-day forecasts for the respective markets, along with banner advertisements for Cox Communications and local area businesses. This "L" bar – which evolved into its current format displaying current conditions and 24-hour forecasts for various weather observation sites around Oklahoma on the lower portion of the screen with banner ads remaining on the right-hand portion – only appears during rebroadcasts of KWTV/KOTV newscasts and is removed fo
|
https://en.wikipedia.org/wiki/The%20MySpace%20Movie
|
The MySpace Movie, also known as Myspace: the movie, is a 2006 short film and viral video. Its name refers to Myspace, the social networking website, which it parodies.
Two years later, a new video by Lehre was released, but instead of Myspace, focused on Facebook.
Plot and outline
The MySpace Movie explores the basics of life as well as disputed territories located within the Myspace site in a humorous and parodic fashion. Themes of this movie include:
Capturing profile images.
Dating on Myspace.
Excessive chain bulletins.
MySpace's "Top 8" feature.
A humorous portrayal of Tom Anderson, the "creator" of Myspace.
The blind date
This story opens with two males sitting in front of a computer and the first male attempts to show off his prize catch, a woman named Yeta, whose profile they are both examining. His friend believes that the woman has "The Angles", a term referring to the practice of taking photographs from such extreme angles as to obscure or distort the person in question, thus implying that the user is insecure about their image and, presumably, unattractive. He also insists that the woman's name is not Yeta, but Yeti. Shortly afterwards the first male receives a telephone call from the woman in question, whose audible voice bears a close resemblance to that of Chewbacca from Star Wars. They arrange a date for the evening, with the friend insisting upon chaperoning. Once the two meet, the man is horrified to observe that his date is masculine, grunting, and lurching. She immediately rubs up against him, asking "Do you want to see the Angry Beaver?", a now popular quote.
David Lehre (the creator) stars in this chapter.
The bulletin
This begins with a man reading a bulletin, and having to scroll down excessively. It then reads that if he doesn't repost, he will first hear a duck call, then be killed by a crazy drunken hunter asking for circus peanuts. This is commonly found in many Myspace bulletins today. Finally, during his last moments of life he will see a singing fish. He casually ignores the bulletin as a joke, and is soon thereafter killed precisely as described. The scene takes place in Reese Serra's apartment.
The password
A prominent feature of Myspace is that of the "Top 8" (Although you may have a "top" of as many as 40), which is essentially the ability to display upon a user's profile page a link to 40 of his chosen friends. In this scene a couple at a computer are arguing; the woman is complaining about her partner's choice of Top 8 friends, expressing dissatisfaction at the fact that she is not among them, as well as questioning the integrity of those present. After demanding his password, she is able to log in and see the rest of his pictures, which include photographs of his participation in lewd activities, including that of judging a wet T-shirt competition. In this scene one can see the email address joejoe227@yahoo.com.
The party
This short segment proposes a humorous theory as to the origin of Myspace creat
|
https://en.wikipedia.org/wiki/David%20R.%20Cheriton%20School%20of%20Computer%20Science
|
The David R. Cheriton School of Computer Science is a professional school within the Faculty of Mathematics at the University of Waterloo. QS World University Rankings ranked the David R. Cheriton School of Computer Science 24th in the world, 10th in North America and 2nd in Canada in Computer Science in 2014. U.S. News & World Report ranked the David R. Cheriton School of Computer Science 42nd in world and second in Canada.
History
In 1965, when Mathematics was still a department within the Faculty of Arts, four third-year mathematics students (Richard Shirley, Angus German, James G. Mitchell, and Bob Zarnke) wrote the WATFOR compiler for the FORTRAN programming language, under the direction of lecturer Peter Shantz. "Within a year it would be adopted by computing centres in over eight countries, and the number of student users at UW increased to over 2500." Later on in 1966, two mathematics lecturers (Paul Dirksen and Paul H. Cress) led a team that developed WATFOR 360, for which they received the 1972 Grace Murray Hopper Award from the Association for Computing Machinery.
UW's Faculty of Mathematics was later established in 1967. As a result, the Department of Applied Analysis and Computer Science (AA&CS) was created. By 1969, AA&CS had become the largest department in the faculty. At that point, the first two PhD degrees in computer science were awarded, to Byron L. Ehle, for a thesis on numerical analysis, and to Hugh Williams, for a thesis on computational number theory. In 1975 the department dropped the words "Applied Analysis" and became simply the Department of Computer Science.
In 1982, the Institute for Computer Research (ICR) was established. Its goals were "to foster computer research..., facilitate interaction with industry, and encourage advanced education in computer science and engineering." Also that year, the Ontario government announced plans to build the Davis Centre, current home of the School of Computer Science. The groundbreaking was in April 1985 and the Davis Centre was formally dedicated on November 10, 1988.
On May 1, 2002, the department officially became the School of Computer Science. On November 18, 2005, it was renamed again to the David R. Cheriton School of Computer Science, in recognition of the establishment of the David R. Cheriton Endowment for Excellence in Computer Science. Cheriton had recently donated $25 million to the university.
Support for computing within the School of Computer Science had been historically provided by the Computer Science Computing Facility (CSCF) and ICR.
Programs
The David R. Cheriton School of Computer Science offers several diverse undergraduate programs including:
Bachelor of Computer Science
Honours Computer Science
Business Option
Bioinformatics Option
Digital Hardware Option
Software Engineering Option
Honours Data Science
Bachelor of Mathematics
Honours Computer Science
Business Option
Digital Hardware Option
Bachelor of Software Engineering
Bache
|
https://en.wikipedia.org/wiki/NASCAR%20on%20Fox
|
NASCAR on Fox, also known as Fox NASCAR, is the branding used for broadcasts of NASCAR races produced by Fox Sports and have aired on the Fox television network in the United States since 2001. Speed, a motorsports-focused cable channel owned by Fox, began broadcasting NASCAR-related events in February 2002, with its successor Fox Sports 1 taking over Fox Sports' cable event coverage rights when that network replaced Speed in August 2013. Throughout its run, Fox's coverage of NASCAR has won thirteen Emmy Awards.
Background
On November 11, 1999, NASCAR signed a contract that awarded the U.S. television rights to its races to four networks (two that would hold the broadcast television rights and two that would hold the cable television rights), split between Fox and sister cable channel FX, and NBC and TBS (whose rights were later assumed by TNT) starting with the 2001 season. Fox and FX would alternate coverage of all races held during the first half of the season, while NBC and TNT would air all races held during the second half.
Beginning in 2001, Fox alternated coverage of the first and most preeminent race of the season, the Daytona 500, with Fox televising the race in odd-numbered years and NBC airing it in even-numbered years through 2006. For balance, the network that did not air the 500 in a given year during the contract would air Daytona's summer night race, the Pepsi 400. Valued at $2.4 billion, Fox/FX held the rights to this particular contract for eight years (through 2008) and NBC/TNT having the rights for six years (through 2006). Further on the cable side, in October 2002, Speed Channel – which was owned by the Fox broadcast network's parent subsidiary Fox Entertainment Group – obtained the rights to televise all of the races in the Craftsman Truck Series, a contract it bought out from ESPN.
During the first half of the season, FX served as the primary broadcaster of the Busch Series, airing all but the most prestigious races, which were instead shown on Fox. FX was also home to most of the NASCAR Cup Series night races, The Winston/All-Star Race, and the June race at Dover International Speedway.
Inclement weather policy
In the early years, should a Fox-scheduled race be rained out on their scheduled race day and rescheduled to resume the following Monday, FX would air the race and selected FOX stations would pick it up if syndicators permitted it. Rained out races now air in their entirety on the network it originally was scheduled for, unlike NBC, which puts it's rained out races to other NBCUniversal properties such as CNBC (if on a weekend) or USA Network.
Coverage on FOX Sports Net
Fox Sports Net covered the 2001 Gatorade Twin 125's at Daytona International Speedway, the only time it ever covered a race.
Contract
Contract extensions
On December 7, 2005, NASCAR signed a new eight-year broadcast deal effective with the 2007 season, and valued at $4.48 billion, with Fox and Speed Channel, which would also share event righ
|
https://en.wikipedia.org/wiki/KREN-TV
|
KREN-TV (channel 27) is a television station in Reno, Nevada, United States, affiliated with the Spanish-language Univision network. It is owned by Entravision Communications alongside low-power, Class A UniMás affiliate KRNS-CD (channel 46). The two stations share studios on Wells Avenue in Reno; KREN-TV's transmitter is located on Slide Mountain between SR 431 and I-580/US 395/US 395 ALT in unincorporated Washoe County.
History
The station was founded on March 1, 1982, and first signed on in October 1986 as a Univision affiliate owned by the Sainte Broadcasting Group, a company that was partially related to the present-day Sainte Partners II, L.P. Pappas Telecasting acquired the station at the end of 1994 and converted it to an English-language general entertainment station, taking the WB affiliation when that network launched on January 11, 1995. When Paxson Communications launched Pax TV in 1998, KREN took on a secondary affiliation with that network. In 2000, KREN lost the WB affiliation to the newly launched cable-only The WB 100+ channel known by the fictitious call letters KWBV ("WB6"). In 2002, the WB affiliation was moved back to KREN, effectively merging the two channels since KREN then took over the channel 6 position on cable. Pax TV's successor, Ion Television, would not return to Reno until 2018, when KTVN (channel 2) began carrying it on its third subchannel. The cable channel 6 position is now used by KRNS-CD.
When The WB merged with UPN to create The CW in 2006, KREN became one of the charter affiliates of that network, with most of its programming provided by The CW Plus. On May 10, 2008, 13 of Pappas' stations, including KREN-TV and KAZR-CA, filed for Chapter 11 bankruptcy protection. Pappas cited "the extremely difficult business climate for television stations across the country" in papers filed with the U.S. Bankruptcy Court in Wilmington, Delaware. The company reported in court filings that it has more than $536 million in debt and $460 million in assets. Problems that led to bankruptcy included poor performance of The CW network, its now-former involvement with Azteca América, and preparations for the 2009 analog shutdown.
On September 17, 2008, bankruptcy trustee E. Roger Williams put KREN under contract to Entravision Communications for $4 million, which doubled as a minimum bid for the station as it went up for auction in late October. Since that time, there were no suitable bids for either KREN or KAZR-CA, and Entravision officially assumed ownership on April 1, 2009. On that day, Entravision moved Univision programming from KNVV-LP back to KREN's main channel while it moved The CW to what was then KAZR-CA (now KRNS-CD), thus displacing that station's former TuVision affiliation. That station had been rebroadcast on KREN's second digital subchannel for some time before the sale to Entravision was finalized (and this arrangement continues to this day under Entravision). The affiliation switch effectively returned KR
|
https://en.wikipedia.org/wiki/Radio%20SHARK
|
radio SHARK (the capitalization is a trademarked logotype) is a computer-controlled radio designed by Griffin Technology, introduced in late 2004. A second generation (radio SHARK 2) superseded it in 2007; they are distinguishable by color (the first model is white, the second is black). The radio connects the computer through a USB interface, which also supplies power to the radio. The device is shaped like a shark fin, which includes four internal LED lights attached to three pieces of clear plastic on each side of the device's case, two LEDs of which glow blue when plugged in, the other two of which glow red when recording radio.
Software designed for radio SHARK allows users to record radio programs at specific times and frequencies. The software also facilitates listening of "live" radio using time-shifting technology. Using the time-shifting features of the software, users can pause, rewind, and fast-forward "live" radio, in a manner similar to how users of TiVo or other digital video recorders can time-shift video. The radio SHARK uses the computer's hard drive to store audio files that allow for the time-shifting functionality.
The radio SHARK tunes in (Standard mode) 87.5 through 108.0 MHz FM, (Japanese mode) 76.0 through 90.0 MHz FM, and 522 through 1710 kHz AM. radio SHARK can tune both odd and even increments of FM frequencies, and either 9 or 10 kHz increments on AM.
Currently, radio SHARK is compatible with both Macintosh and Microsoft Windows. The Macintosh version of the radio SHARK software can load recorded audio files directly into iTunes, facilitating easy transfer of recorded radio programs to an iPod or CD. The product has now been discontinued by the manufacturer, who also says, "We do not support the use of this product in Lion, Mac OS 10.7 and later."
External links
radio Shark - official site
radio Shark 2 - official site
Macworld review
Ars Technica review
iLounge review of version 2
Computer peripherals
|
https://en.wikipedia.org/wiki/UnixWorld
|
UnixWorld (Unixworld: McGraw-Hill's magazine of open systems computing.) is a defunct magazine about Unix systems, published from May 1984 until December 1995.
References
Defunct computer magazines published in the United States
Magazines established in 1984
Magazines disestablished in 1995
Magazines published in California
Unix history
|
https://en.wikipedia.org/wiki/Michael%20Howard%20%28Microsoft%29
|
Michael Howard (born 1965) is a software security expert from Microsoft. He is the author of several computer security books, the most famous being Michael Howard is a frequent speaker at security-related conferences and frequently publishes articles on the subject.
Books
Michael Howard, David LeBlanc : Writing Secure Code (2nd edition).
Michael Howard, John Viega, David LeBlanc: The 19 Deadly Sins of Software Security.
Michael Howard: Designing Secure Web-Based Applications for Microsoft(r) Windows(r) 2000.
External links
Michael Howard's Blog
Microsoft employees
Living people
Writers about computer security
1965 births
|
https://en.wikipedia.org/wiki/Digital%20Research%20Labs
|
There are several companies with Digital Research Labs in their name or that are otherwise similarly named:
Digital Research, a defunct microcomputer operating system (CP/M, DR-DOS) vendor founded by Gary Kildall
Threshold Digital Research Labs, a digital animation studio
DEC Systems Research Center, the research arm of Digital Equipment Corporation
See also
Digital Research Systems Group (disambiguation)
|
https://en.wikipedia.org/wiki/Ukkonen%27s%20algorithm
|
In computer science, Ukkonen's algorithm is a linear-time, online algorithm for constructing suffix trees, proposed by Esko Ukkonen in 1995. The algorithm begins with an implicit suffix tree containing the first character of the string. Then it steps through the string, adding successive characters until the tree is complete. This order addition of characters gives Ukkonen's algorithm its "on-line" property. The original algorithm presented by Peter Weiner proceeded backward from the last character to the first one from the shortest to the longest suffix. A simpler algorithm was found by Edward M. McCreight, going from the longest to the shortest suffix.
Implicit suffix tree
While generating suffix tree using Ukkonen's algorithm, we will see implicit suffix tree in intermediate steps depending on characters in string S. In implicit suffix trees, there will be no edge with $ (or any other termination character) label and no internal node with only one edge going out of it.
High level description of Ukkonen's algorithm
Ukkonen's algorithm constructs an implicit suffix tree T for each prefix S[1...i] of S (S being the string of length n). It first builds T using 1 character, then T using 2 character, then T using 3 character, ..., T using the n character. You can find the following characteristics in a suffix tree that uses Ukkonen's algorithm:
Implicit suffix tree T is built on top of implicit suffix tree T .
At any given time, Ukkonen's algorithm builds the suffix tree for the characters seen so far and so it has on-line property, allowing the algorithm to have an execution time of O(n).
Ukkonen's algorithm is divided into n phases (one phase for each character in the string with length n).
Each phase i+1 is further divided into i+1 extensions, one for each of the i+1 suffixes of S[1...i+1].
Suffix extension is all about adding the next character into the suffix tree built so far. In extension j of phase i+1, algorithm finds the end of S[j...i] (which is already in the tree due to previous phase i) and then it extends S[j...i] to be sure the suffix S[j...i+1] is in the tree. There are three extension rules:
If the path from the root labelled S[j...i] ends at a leaf edge (i.e., S[i] is last character on leaf edge), then character S[i+1] is just added to the end of the label on that leaf edge.
if the path from the root labelled S[j...i] ends at a non-leaf edge (i.e., there are more characters after S[i] on path) and next character is not S[i+1], then a new leaf edge with label S[i+1] and number j is created starting from character S[i+1]. A new internal node will also be created if S[1...i] ends inside (in between) a non-leaf edge.
If the path from the root labelled S[j..i] ends at a non-leaf edge (i.e., there are more characters after S[i] on path) and next character is S[i+1] (already in tree), do nothing.
One important point to note is that from a given node (root or internal), there will be one and only one edge starting from one c
|
https://en.wikipedia.org/wiki/ISWC
|
ISWC may refer to:
International Semantic Web Conference
International Symposium on Wearable Computers
International Standard Musical Work Code
International Speed Windsurfing Class
|
https://en.wikipedia.org/wiki/Sort%20%28C%2B%2B%29
|
sort is a generic function in the C++ Standard Library for doing comparison sorting. The function originated in the Standard Template Library (STL).
The specific sorting algorithm is not mandated by the language standard and may vary across implementations, but the worst-case asymptotic complexity of the function is specified: a call to must perform no more than comparisons when applied to a range of elements.
Usage
The function is included from the header of the C++ Standard Library, and carries three arguments: . Here, is a templated type that must be a random access iterator, and and must define a sequence of values, i.e., must be reachable from by repeated application of the increment operator to . The third argument, also of a templated type, denotes a comparison predicate. This comparison predicate must define a strict weak ordering on the elements of the sequence to be sorted. The third argument is optional; if not given, the "less-than" () operator is used, which may be overloaded in C++.
This code sample sorts a given array of integers (in ascending order) and prints it out.
#include <algorithm>
#include <iostream>
int main() {
int array[] = { 23, 5, -10, 0, 0, 321, 1, 2, 99, 30 };
std::sort(std::begin(array), std::end(array));
for (size_t i = 0; i < std::size(array); ++i) {
std::cout << array[i] << ' ';
}
std::cout << '\n';
}
The same functionality using a container, using its and methods to obtain iterators:
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::vector<int> vec = { 23, 5, -10, 0, 0, 321, 1, 2, 99, 30 };
std::sort(vec.begin(), vec.end());
for (size_t i = 0; i < vec.size(); ++i) {
std::cout << vec[i] << ' ';
}
std::cout << '\n';
}
Genericity
is specified generically, so that it can work on any random-access container and any way of determining that an element of such a container should be placed before another element .
Although generically specified, is not easily applied to all sorting problems. A particular problem that has been the subject of some study is the following:
Let and be two arrays, where there exists some relation between the element and the element for all valid indices .
Sort while maintaining the relation with , i.e., apply the same permutation to that sorts .
Do the previous without copying the elements of and into a new array of pairs, sorting, and moving the elements back into the original arrays (which would require temporary space).
A solution to this problem was suggested by A. Williams in 2002, who implemented a custom iterator type for pairs of arrays and analyzed some of the difficulties in correctly implementing such an iterator type. Williams's solution was studied and refined by K. Åhlander.
Complexity and implementations
The C++ standard requires that a call to performs comparisons when applied to a range of elements.
In previous versions of C++, such as C++03, only average complexity was requir
|
https://en.wikipedia.org/wiki/Pud%20Pud%20in%20Weird%20World
|
Pud Pud in Weird World (also known simply as Pud Pud) is a computer game published by Ocean Software in 1985 for the ZX Spectrum. It was written by Jonathan Smith. Smith was paid £1000 for Pud Pud by Ocean Software and was given a job at Ocean as a direct result of the game.
Plot
Pud Pud is trapped in Weird World and needs to escape. He must explore Weird World looking for ten puddings and avoiding the deadly kiss of Mrs Pud Pud.
Gameplay
The player controls Pud Pud (who resembles a round pudding with wings or feet depending on whether he's walking or flying) and must explore the mazelike Weird World. Pud Pud has a limited amount of energy which needs to be topped up by eating certain creatures that live in Weird World although other creatures, which drain his energy if eaten, must be avoided. If Pud Pud runs out of energy he loses one of his three lives.
Mrs Pud Pud occasionally appears on the screen and is similar to Pud Pud, but white and wearing high heels. If she touches Pud Pud he loses a life instantly, regardless of his energy status although the player will receive a bonus score based on how much energy was remaining when Mrs Pud Pud delivered her kiss.
Pud Pud can obtain an extra life by collecting all ten hidden puddings.
The puddings are spread randomly throughout the maze with only one being in the maze at a time. When all ten are collected, Pud Pud can escape Weird World.
References
External links
1985 video games
Maze games
Ocean Software games
ZX Spectrum games
ZX Spectrum-only games
Single-player video games
Video games developed in the United Kingdom
|
https://en.wikipedia.org/wiki/NAT%20Port%20Mapping%20Protocol
|
NAT Port Mapping Protocol (NAT-PMP) is a network protocol for establishing network address translation (NAT) settings and port forwarding configurations automatically without user effort. The protocol automatically determines the external IPv4 address of a NAT gateway, and provides means for an application to communicate the parameters for communication to peers. Apple introduced NAT-PMP in 2005 by as part of the Bonjour specification, as an alternative to the more common ISO Standard Internet Gateway Device Protocol implemented in many NAT routers. The protocol was published as an informational Request for Comments (RFC) by the Internet Engineering Task Force (IETF) in RFC 6886.
NAT-PMP runs over the User Datagram Protocol (UDP) and uses port number 5351. It has no built-in authentication mechanisms because forwarding a port typically does not allow any activity that could not also be achieved using STUN methods. The benefit of NAT-PMP over STUN is that it does not require a STUN server and a NAT-PMP mapping has a known expiration time, allowing the application to avoid sending inefficient keep-alive packets.
NAT-PMP is the predecessor to the Port Control Protocol (PCP).
See also
Port Control Protocol (PCP)
Internet Gateway Device Protocol (UPnP IGD)
Universal Plug and Play (UPnP)
NAT traversal
STUN
Zeroconf
References
Apple Inc. services
Network protocols
Network address translation
|
https://en.wikipedia.org/wiki/The%20Movie%20Monster%20Game
|
The Movie Monster Game is a computer game released by Epyx for the Apple II and Commodore 64 in 1986. The game offers a variety of scenarios, playable monsters, and cities to demolish (complete with famous landmarks, such as Tokyo Tower, Eiffel Tower, Statue of Liberty, Golden Gate Bridge, Saint Basil's Cathedral and Big Ben). The monsters are based on popular movie monsters such as The Blob, Mothra, the Stay Puft Marshmallow Man, and the Transformers, and Epyx was able to officially license Godzilla.
Gameplay
The gameplay is depicted on a movie screen in front of a movie theater crowd simulating an actual monster movie. Each scenario even starts off with an advertisement, (for popcorn and "Gummi Glogs"; in the Apple II version "Godzilla Mouthwash" is also featured), and other attractions, (such as promotions for Epyx's own Summer Games) before the "Feature Presentation" of the game begins.
The game includes 5 different scenarios for the player to play through:
Berserk. The player must accumulate a certain number of points by destroying as many buildings and vehicles as possible.
Escape. The player must flee the city before being killed by the military.
Search. The player must use the monster to rescue its offspring hidden in a building. Godzilla's son is depicted as Minilla.
Destroy Landmark. The player must destroy a specific landmark within the city such as the Statue of Liberty in New York City, the Tokyo Tower in Tokyo, Big Ben in London, etc.
Lunch. The player must satisfy the monster's hunger by eating vehicles and civilians until the monster's hunger meter is depleted.
The monsters are Godzilla, Sphectra (a giant wasp), The Glog (a huge green blob with red eyes), Tarantus (a giant Tarantula), Mr. Meringue (a knock-off of the Stay Puft Marshmallow Man), and Mechatron (a knock-off of Topspin from Transformers).
The cities featured in the game are New York City, San Francisco, London, Tokyo, Moscow, and Paris.
Reception
In Dragon #114's "The Role of Computers" column, reviewers Hartley and Pattie Lesser stated that "This is a game that is a great deal of fun to play!"
Computer Gaming World said that The Movie Monster Game "gets a little tedious after a while".
Reviews
Zzap! (Dec, 1986)
Happy Computer (Dec, 1986)
Commodore User (Dec, 1986)
Computer Gamer (Jan, 1987)
See also
Crush, Crumble and Chomp!
References
External links
1986 video games
Apple II games
Commodore 64 games
Epyx games
Godzilla games
Kaiju video games
Video games developed in the United States
Single-player video games
|
https://en.wikipedia.org/wiki/Tridiagonal%20matrix%20algorithm
|
In numerical linear algebra, the tridiagonal matrix algorithm, also known as the Thomas algorithm (named after Llewellyn Thomas), is a simplified form of Gaussian elimination that can be used to solve tridiagonal systems of equations. A tridiagonal system for n unknowns may be written as
where and .
For such systems, the solution can be obtained in operations instead of required by Gaussian elimination. A first sweep eliminates the 's, and then an (abbreviated) backward substitution produces the solution. Examples of such matrices commonly arise from the discretization of 1D Poisson equation and natural cubic spline interpolation.
Thomas' algorithm is not stable in general, but is so in several special cases, such as when the matrix is diagonally dominant (either by rows or columns) or symmetric positive definite; for a more precise characterization of stability of Thomas' algorithm, see Higham Theorem 9.12. If stability is required in the general case, Gaussian elimination with partial pivoting (GEPP) is recommended instead.
Method
The forward sweep consists of the computation of new coefficients as follows, denoting the new coefficients with primes:
and
The solution is then obtained by back substitution:
The method above does not modify the original coefficient vectors, but must also keep track of the new coefficients. If the coefficient vectors may be modified, then an algorithm with less bookkeeping is:
For do
followed by the back substitution
The implementation in a VBA subroutine without preserving the coefficient vectors:
Sub TriDiagonal_Matrix_Algorithm(N%, A#(), B#(), C#(), D#(), X#())
Dim i%, W#
For i = 2 To N
W = A(i) / B(i - 1)
B(i) = B(i) - W * C(i - 1)
D(i) = D(i) - W * D(i - 1)
Next i
X(N) = D(N) / B(N)
For i = N - 1 To 1 Step -1
X(i) = (D(i) - C(i) * X(i + 1)) / B(i)
Next i
End Sub
Derivation
The derivation of the tridiagonal matrix algorithm is a special case of Gaussian elimination.
Suppose that the unknowns are , and that the equations to be solved are:
Consider modifying the second () equation with the first equation as follows:
which would give:
Note that has been eliminated from the second equation. Using a similar tactic with the modified second equation on the third equation yields:
This time was eliminated. If this procedure is repeated until the row; the (modified) equation will involve only one unknown, . This may be solved for and then used to solve the equation, and so on until all of the unknowns are solved for.
Clearly, the coefficients on the modified equations get more and more complicated if stated explicitly. By examining the procedure, the modified coefficients (notated with tildes) may instead be defined recursively:
To further hasten the solution process, may be divided out (if there's no division by zero risk), the newer modified coefficients, each notated with a prime, will be:
This gives the following
|
https://en.wikipedia.org/wiki/Bruce%20Ellis
|
Bruce Ellis (born 1960, nicknamed Brucee) is a computer scientist who worked at Bell Labs during the 1980s and 90s. He was educated at the University of Sydney, Australia, where he earned First Class Honours with the University Medal. He worked there on the Basser branch of UNIX/32V.
This work continued at Bell Labs where he was involved in the development of the later research versions of Unix, software for the Blit terminal, the Plan 9 from Bell Labs and Inferno operating systems, as well as ventures into network processing (the Froggie).
Recreationally he has also dabbled with computer go, computational linguistics, and with Rob Pike was responsible for the infamous Mark V Shaney in the early 1980s.
After leaving Bell Labs he has been consulting and lecturing around the world while working on the OzInferno operating system as a continuation of the work he had done on the research version of Inferno. He is currently living in Sydney.
Other works of his include the mash shell, 64 bit support for the Plan 9 cross compilers suite, Plan9 Emulation Environment (9ee) for disparate platforms, and various PostScript interpreters currently used by commercial printer manufacturers.
External links
Home page
Froggie
The 1984 Usenix Computer Go Tournament
IWP9 2006
Invited Talk
Using Inferno to Execute Java on Small Devices by Bruce Ellis et al.
9ee
Computer programmers
Unix people
Plan 9 people
Inferno (operating system) people
Scientists at Bell Labs
Living people
1960 births
|
https://en.wikipedia.org/wiki/Championship%20Manager%205
|
Championship Manager 5 is the fifth installment of the popular Championship Manager series of football management computer games. It is the first game in the series to be developed by Eidos, after the much publicised split between Eidos and Sports Interactive.
Early difficulties
The game was originally due for release in October 2004. However, the release date slipped to March, 2005, due to difficulties in coding the game from scratch. This allowed new rival, Sports Interactive's Football Manager 2005 a clear run to establish itself ahead of the release of CM5.
A release on the Macintosh platform was cancelled prior to release, again giving headway to its rival, Football Manager, which was made available for Mac as standard on a dual format CD-ROM (with the PC version).
Upon its release, the game contained an unusually high number of bugs. Even though BGS published a downloadable patch on the day of release, many users felt that CM5 was unplayable. Key problems included difficulties transferring players (either in or out of a club) and a very unrealistic match engine. Perhaps one of the biggest issues discovered by people purchasing CM5 was the fact that the player database was not particularly reliable. The database had been made 'for the fans by the fans' in previous games. This was probably the biggest strength of the CM brand. BGS had employed a professional firm to create much of the player database and they had apparently failed, despite the best efforts of the in-house research team.
Other issues also arose shortly after CM5 was released. Features like hotseat multiplayer games which, although confirmed as being included in CM5, disappointed some by their absence when the game arrived. Other small things such as player histories were also missing from the final product. Two patches are available that contain significant improvements to the game.
Console versions
A scaled-down version of Championship Manager 5 was released on Xbox and PlayStation 2 in March 2005 along with a PlayStation Portable version, simply called Championship Manager. These are known to contain many of the same bugs and data errors as the PC version. All 3 console versions were developed by Gusto Games.
See also
Championship Manager (PSP)
Football Manager 2005
External links
2005 video games
Association football management video games
Beautiful Game Studios games
Eidos Interactive games
PlayStation 2 games
Single-player video games
Video game sequels
Video games developed in the United Kingdom
Windows games
Xbox games
Gusto Games games
|
https://en.wikipedia.org/wiki/Meanings%20of%20minor%20planet%20names%3A%2097001%E2%80%9398000
|
97001–97100
|-id=069
| 97069 Stek || || Stefano Klett (born 1964) is a Swiss computer scientist and amateur astronomer who observes minor planets from his home town of Camorino. He is the promoter of the Ticino section of Dark Sky Switzerland. ||
|}
97101–97200
|-id=186
| 97186 Tore || || Salvatore Silanus (born 1961), nicknamed Tore, is a friend of Swiss astronomer Stefano Sposetti who discovered this minor planet. ||
|}
97201–97300
|-id=268
| 97268 Serafinozani || || The Serafino Zani Astronomical Observatory (Osservatorio astronomico Serafino Zani) in Italy was built by Serafino Zani and his family on San Bernardo hill in the commune of Lumezzane in Brescia, Lombardy, and then given to the local amateur astronomers. ||
|}
97301–97400
|-id=336
| 97336 Thomasafleming || || Thomas Anthony Fleming (born 1960) is an American x-ray astronomer and educator at the University of Arizona's Steward Observatory. He discovered that DA-type white dwarfs were not copious x-ray sources, and he is known for creating and expanding interactive computer-based astronomy education. ||
|}
97401–97500
|-id=472
| 97472 Hobby || || The Hobby Foundation supports museums and educational organizations throughout Texas. Ten thousand schoolchildren and members of the public a year view the wonders of the heavens through the Hobby telescope at the Houston Museum of Natural Science's George Observatory. ||
|}
97501–97600
|-id=508
| 97508 Bolden || || Charles Frank Bolden Jr. (born 1946) is a former American astronaut who flew on four space shuttle missions (two as the pilot and two as the commander). From 2009 to 2017, he was the NASA Administrator. ||
|-id=512
| 97512 Jemison || || Mae Carol Jemison (born 1956) is a retired American astronaut who flew on the space shuttle in 1992. On the space shuttle she conducted scientific experiments. She was the first African American woman to travel into space and the first African American woman admitted into the astronaut training program. ||
|-id=582
| 97582 Hijikawa || || Hijikawa River is a 103-km-long river in the Japanese Ehime prefecture. It has its source near the Tosaka Pass in Seiyo City and flows into the Seto Inland Sea. With more than 470 tributaries, the river has supplied its abundant water to the people in the southern part of Ehime, especially for irrigation. ||
|}
97601–97700
|-id=631
| 97631 Kentrobinson || || Ernest Kent Robinson (born 1939), an member of the advisory board at Lowell Observatory, enthusiastically spearheaded the capital campaign for a collection center and library to protect, preserve and make available the historic archives of that institution. ||
|-id=637
| 97637 Blennert || || John Blennert (born 1951) is a meteorite hunter in Tucson, Arizona, one of three co-discoverers of the Gold Basin Meteorite Strewn Field ||
|-id=677
| 97677 Rachelfreed || || Rachel Freed (born 1972) is a teacher, an education curriculum specialist, and an avid long-distance runne
|
https://en.wikipedia.org/wiki/Bombardier%20Voyager
|
The Bombardier Voyager is a family of high-speed 125 mph diesel-electric multiple units built in Belgium by Bombardier Transportation, for service on the railway network of the United Kingdom. Construction of the Voyager family took place between 1999 and 2005, consisting of three classes - the Voyager (currently operated by CrossCountry), the Super Voyager (currently operated by Avanti West Coast, CrossCountry and Grand Central) and the Meridian (currently operated by East Midlands Railway).
Bombardier Voyagers are used on various intercity services throughout Great Britain, including the longest direct rail service in the United Kingdom, which is a CrossCountry service from Aberdeen to Penzance that takes over 13 hours to complete.
Variants
Class 220
The Class 220 Voyager DEMUs were built to operate Cross Country intercity services. Virgin CrossCountry received 34 four-car sets in 2000/01. All passed with the CrossCountry franchise to Arriva CrossCountry in November 2007.
Class 221
[[File:Virgin trains 221113 glasgow.jpg|left|thumb|Class 221 Super Voyager in Virgin Trains livery]]
The Class 221 Super Voyager DEMUs were built as a tilting version of the Class 220. Although visually similar, they were fitted with a tilting mechanism and heavier bogies. Virgin CrossCountry received 40 five-car and four four-car sets. All passed with the CrossCountry franchise to Arriva CrossCountry in November 2007.
With the removal of West Coast Main Line services from the CrossCountry franchise in December 2007, 16 were transferred to Virgin Trains West Coast for use on InterCity West Coast services. A further five moved from CrossCountry to Virgin Trains West Coast in December 2008. CrossCountry removed the tilting equipment from its Class 221s to improve reliability and lower cost of maintenance.
On 8 December 2019, all of the West Coast sets passed to Avanti West Coast, the new operator of the West Coast Partnership franchise.
Avanti West Coast sent two of their Class 221 Super Voyagers off lease in 2022.
In 2023 Grand Central leased the above two sets to operate services between London Kings Cross and Bradford, with the first of these two units entering service in later that year.
Class 222
The Class 222 Meridian DEMUs are broadly similar to the original Voyager units, but feature a number of reliability improvements and different internal layout.
The Class 222 was built in the light of experience gained with the 220 and 221 units; in particular, many more components were installed under the floor so as to increase space for passengers. Twenty-seven sets were built:
Midland Mainline ordered 23 Meridians, to replace 17 Class 170 Turbostars and provide stock for a later cancelled London St Pancras to Leeds service. Originally configured as 16 four-car seven and nine-car sets, they were later re-formed into a combination of four, five and eight-car units. All were transferred to the new franchise holder East Midlands Trains (EMT) in November 20
|
https://en.wikipedia.org/wiki/Alex%20Wallau
|
Alex Wallau (born January 11, 1945) is a former president of the ABC television network.
Wallau began his career with ABC in 1976, when he joined the network's Sports division under Roone Arledge, then head of ABC Sports. Wallau went on to become a two-time Emmy Award-winning producer and director of ABC's sports coverage. He worked primarily on ABC's boxing coverage with announcer Howard Cosell. In 1986, after Cosell's retirement, Wallau became ABC's boxing analyst. He was honored by the Boxing Writers Association of America as the top television boxing journalist in his first year.
Wallau moved into management under Bob Iger in 1993 and was named President of ABC in 2000, with oversight of 11 divisions, including Entertainment, News, Sports, Finance & Sales. In 2007, he joined The Walt Disney Company's Corporate Strategy, Business Development & Technology Group as Senior Strategic Advisor. In 2017, he moved to the new DTCI division which created new streaming services including Disney+. He retired in 2020.
He has served on the Board of Directors of ESPN, the Ad Council and the Paley Center for Media. In 2006, Wallau was honored by UCLA's Jonsson Comprehensive Cancer Center with their Humanitarian Award. Wallau is a cancer survivor.
References
http://articles.latimes.com/1988-04-15/sports/sp-1613_1_alex-wallau
Living people
American television executives
1945 births
Boxing commentators
Boxing writers
American Broadcasting Company executives
Presidents of the American Broadcasting Company
ESPN executives
|
https://en.wikipedia.org/wiki/Abox
|
In computer science, the terms TBox and ABox are used to describe two different types of statements in knowledge bases. TBox statements are the "terminology component", and describe a domain of interest by defining classes and properties as a domain vocabulary. ABox statements are the "assertion component" — facts associated with the TBox's conceptual model or ontologies.
Together ABox and TBox statements make up a knowledge base or a knowledge graph.
ABox statements must be TBox-compliant: they are assertions that use the vocabulary defined by the TBox.
TBox statements are sometimes associated with object-oriented classes and ABox statements associated with instances of those classes.
Examples of ABox and TBox statements
ABox statements typically deal with concrete entities. They specify what category an entity belongs to, or what relation one entity has to another entity.
Item A is-an-instance-of Category C
Item A has-this-relation-to Item B
Examples:
Niger is-a country.
Chad is-a country
Niger is-next-to Chad.
Agadez is-a city.
Agadez is-located-in Niger.
TBox statements typically (or definitions of domain categories and implied relations) such as:
An entity X can be a country or a city
So Dagamanet is-a neighbourhood is not a fact you can specify, though it is a fact in real life.
A is-next-to B if B is-next-to A
So Niger is-next-to Chad implies Chad is-next-to Niger.
X is a place if X is-a city or X is-a country.
So Niger is-a country implies Niger is-a place.
place A contains place B if place B is-located-in A.
So Agadez is-located-in Niger implies Niger contains Agadez.
TBox statements tend to be more permanent within a knowledge base and are used and stored as a schema or a data model. In contrast, ABox statements are much more dynamic in nature and tend to be stored as instance data within transactional systems within databases. With the newer, NoSQL databases and especially with RDF databases (see Triplestore) the storage distinction may no longer apply. Data and models can be stored using the same approach. However, models continue to be more permanent, have a different lifecycle and are typically stored as separate graphs within such database.
See also
Description logic#Modeling
Metadata
Web Ontology Language
References
Ontology (information science)
de:ABox
|
https://en.wikipedia.org/wiki/ToonTalk
|
ToonTalk is a computer programming system intended to be programmed by children. The "Toon" part stands for cartoon. The system's presentation is in the form of animated characters, including robots that can be trained by example. It is one of the few successful implementations outside academia of the concurrent constraint logic programming paradigm.
It was created by Kenneth M. Kahn in 1995, and implemented as part of the ToonTalk IDE, a software package distributed worldwide between 1996 and 2009. Since 2009, its specification is scholarly published and its implementation is freely available.
Beginning 2014 a JavaScript HTML5 version of ToonTalk called ToonTalk Reborn for the Web has been available. It runs on any modern web browser and differs from the desktop version of ToonTalk in a few ways. ToonTalk programs can run on any DOM element and various browser capabilities (audio, video, style sheets, speech input and output, and browser events) are available to ToonTalk programs. Web services such as Google Drive are integrated. ToonTalk Reborn is free and open source.
Beyond its life as a commercial product, ToonTalk evolved via significant academic use in various research projects, notably at the London Knowledge Lab and the Institute of Education - projects Playground and WebLabs, which involved research partners from Cambridge (Addison Wesley Longman through their Logotron subsidiary), Portugal (Cnotinfor and the University of Lisbon), Sweden (Royal Institute of Technology), Slovakia (Comenius University), Bulgaria (Sofia University), Cyprus (University of Cyprus), and Italy (Institute for Educational Technology of the Consiglio Nazionale delle Ricerche). It was also source of academic interest in Sweden, where Mikael Kindborg proposed a static representation of ToonTalk programs and in Portugal, where Leonel Morgado studied its potential to enable computer programming by preliterate children.
ToonTalk was influenced by the Janus computer programming language and the Actor model. The main communication abstraction in ToonTalk is the bird/nest pair. When you (the programmer or a robot) give a thing to a bird, she flies to her nest and puts the thing in it, then returns. If one or more things already occupy the nest, the bird puts the new one underneath the others.
A ToonTalk program is a sequence of rules, where each rule has a head and a tail. The head is a pattern that can be matched against the argument, which must be a tuple. In ToonTalk's presentation, a rule appears as a robot, a program as a team of robots, and a tuple as a box that can have any number of holes or compartments in which things may be placed. The alphabet of things includes number pads, text pads, other boxes, robot teams, birds, nests, and things from some other categories. A process consists of a box with a team of robots working on it. If none of the patterns matches the box, the process suspends. Otherwise, the first rule that matches, fires. The en
|
https://en.wikipedia.org/wiki/Argus%20Media
|
Argus (formerly known as Petroleum Argus Ltd) is an independent provider of price information, consultancy services, conferences, market data and business intelligence for the global petroleum, natural gas, electricity, emissions, biofuels, biomass, LPG, metals, chemicals, fertilizers, agriculture and coal industries.
Overview
Argus is a privately held UK-registered company which produces price assessments and analysis of international energy and other commodity markets, and also offers consulting services and conferences.
Argus was the first price-reporting agency to apply an IOSCO audit for its energy benchmarks.
Argus was owned by the family of its founder Jan Nasmyth and its senior staff, but in September 2016 a majority-stake was sold to the equity firm General Atlantic valuing the company at $1.4 billion.
Argus's headquarters are in London, with major offices in Houston, Dubai, Singapore, Paris, Seoul, Amsterdam, Hamburg, Riga, Kyiv, Astana, Calgary, San Francisco, Mexico City, Washington DC, Pittsburgh, New York, Sao Paulo, Tokyo, Shanghai, Beijing, Mumbai, Sydney, Granada, Brussels, Lagos, and Cape Town.
Prices assessed by Argus for energy, fertilizer, metals, petrochemicals and agriculture markets are widely used as benchmarks to settle futures contracts and as indexes for short or long term physical supply contracts.
History
Argus was established in 1970 by former Daily Telegraph journalist Jan Nasmyth. In 1979, Argus became the first reporting agency to quote crude oil prices and published the first ever daily crude market wire.
In 2011, Argus bought FMB Consultants Ltd (FMB) - a price reporting agency for international fertilizer markets. FMB was founded in 1982 and focused on nitrogen, phosphate, sulphur, potash and ammonia.
In 2012, Argus also acquired US petrochemical market intelligence, pricing and consulting firm DeWitt & Co, and European power and gas fundamental data provider Fundalytics. In 2013, Argus bought petrochemical market specialists TABrewer Consulting and Jim Jordan & Associates.
Argus launched coverage of the global iron ore market with daily report Argus Steel Feedstocks in February 2013. Argus expanded its metals coverage further in 2015, after acquiring MetalPrices.com - a specialist pricing, news and analysis service focusing on speciality metals, rare earths and ferro-alloys.
In 2018, Argus purchased Integer Research a London-based market intelligence, conference and consulting firm.
In 2019, Argus acquired German oil reporting specialist O.M.R.
In 2020, Argus bought French agricultural intelligence company Agritel.
In 2021, Argus acquired the renewable chemicals specialist Oleochem Analytics.
In 2022, Argus acquired Pipe Logix, a US-based provider of pipe and tube market information.
In 2023, Argus acquired Mercaris, a US-based provider of organic and non-GMO commodity prices.
Awards
Argus won the Queen's Award for Enterprise: International Trade (Export) in the UK in 2002, 2009 and 2015.
|
https://en.wikipedia.org/wiki/Electrics
|
Electrics may mean:
Electric vehicle which is propelled by one or more electric motors, using energy stored in rechargeable batteries
Electrical wiring installed in a building
Electrical network or circuit of any kind
In music
"Electrics", a song on Listen, A Flock of Seagulls album
|
https://en.wikipedia.org/wiki/Data%20architecture
|
Data architecture consist of models, policies, rules, and standards that govern which data is collected and how it is stored, arranged, integrated, and put to use in data systems and in organizations. Data is usually one of several architecture domains that form the pillars of an enterprise architecture or solution architecture.
Overview
A data architecture aims to set data standards for all its data systems as a vision or a model of the eventual interactions between those data systems. Data integration, for example, should be dependent upon data architecture standards since data integration requires data interactions between two or more data systems. A data architecture, in part, describes the data structures used by a business and its computer applications software. Data architectures address data in storage, data in use, and data in motion; descriptions of data stores, data groups, and data items; and mappings of those data artifacts to data qualities, applications, locations, etc.
Essential to realizing the target state, data architecture describes how data is processed, stored, and used in an information system. It provides criteria for data processing operations to make it possible to design data flows and also control the flow of data in the system.
The data architect is typically responsible for defining the target state, aligning during development and then following up to ensure enhancements are done in the spirit of the original blueprint.
During the definition of the target state, the data architecture breaks a subject down to the atomic level and then builds it back up to the desired form. The data architect breaks the subject down by going through three traditional architectural stages:
Conceptual - represents all business entities.
Logical - represents the logic of how entities are related.
Physical - the realization of the data mechanisms for a specific type of functionality.
The "data" column of the Zachman Framework for enterprise architecture –
In this second, broader sense, data architecture includes a complete analysis of the relationships among an organization's functions, available technologies, and data types.
Data architecture should be defined in the planning phase of the design of a new data processing and storage system. The major types and sources of data necessary to support an enterprise should be identified in a manner that is complete, consistent, and understandable. The primary requirement at this stage is to define all of the relevant data entities, not to specify computer hardware items. A data entity is any real or abstract thing about which an organization or individual wishes to store data.
Physical data architecture
Physical data architecture of an information system is part of a technology plan. The technology plan is focused on the actual tangible elements to be used in the implementation of the data architecture design. Physical data architecture encompasses database architecture. Database a
|
https://en.wikipedia.org/wiki/MAD%20TV%20%28TV%20channel%29
|
MAD TV (also known as MAD) is a Greek television network that broadcasts music related programming including video clips, music news, and interviews as well as concert footage. It was the first music station in Greece, launched on June 6, 1996, and is run by Andreas Kouris.
History
In May 2000, MAD TV launched the first Greek music portal, which provides its users with the most up to date worldwide music information along with brand new Internet services.
MAD TV also offers a wide range of Retail and B2B services to the public: Go MAD (interactive service) and MAD Music (5 music-interactive audio channels) available on Nova (DTH satellite platform in Greece), MAD Shop (online CD shop) through their website, Nova and i-mode mobile telephony, MAD Scanner (mobile service for acoustic fingerprint) through Vodafone Greece, Real-time video streaming of MAD TV’s program for 2G and 3G mobile phones, mobile content (ring-tones, logos and MMS) to all the top mobile telephony companies in Greece, music content to internet sites and portals (news, events, artists’ CVs, charts, photos and wallpapers, audio and video streaming, polyphonic audio ring-tones, etc.), and many more.
Since June 26, 2004, MAD TV organizes each year the MAD Video Music Awards, a unique Greek music production and awards ceremony, which allows the public to vote for their favorite artists and video clip. On May 26 and 27 of 2005, MAD TV held the 1st conference for the music industry in Greece, Athens Music Forum, which focuses on bringing together representatives from all professional fields that are directly and indirectly related to the music industry. MAD also organizes Secret Concerts, a series of famous artist’s live appearances in front of a small audience in a private and secret place, which gives the opportunity to artists to present a special performance with a different repertoire.
From 2013-2015, MAD produced the Greek selection to the Eurovision Song Contest, called Eurosong – A MAD Show.
MAD TV’s target group ranges from 15 to 24 years old. 90% of its daily program includes all the latest pop, electronic, rock, hip hop, rhythm and blues releases and 30 live shows per week. All shows deal with different subjects, ranging from worldwide music news, artist news, Internet, video games, cinema, clubbing, concerts, interviews and documentaries, concerning the majority of the Greek and International artist community.
Programs
OK!
Loca Report
Cooler Lists
Insta News
30 Best Videos
All Hits Non-Stop
All New Mixer
Breakfast
Mixer
Zone M
MAD World and Blue
In December 2005, MAD established, in cooperation with UBI World TV, the first international Greek music channel MAD World which targets Greeks abroad. MAD World is on air 24 hours a day, broadcasting all genres of Greek Music with special daily shows, rockumentaries dedicated to famous Greek artists, and special shows that keep the audience informed about the events that take place in Greece. In July 2006, MAD partnered up w
|
https://en.wikipedia.org/wiki/Malcolm%20Evans%20%28computer%20programmer%29
|
Malcolm Evans (born 10 April 1944) is a British computer game programmer, best known for his games 3D Monster Maze for the Sinclair ZX81 and Trashman for the ZX Spectrum, released in 1982 and 1984 respectively.
He and his twin brother, Rod, were born in Romford, but his family soon moved to Portsmouth. He has a B.Sc. in electronics from Portsmouth Polytechnic and joined Marconi, where he worked on high-powered projects, such as satellite technology. Then in the mid-1970s he moved to work for Smiths Aviation, where he designed hardware to implement computer control systems for jet engines.
In 1979 he moved again, to Sperry Gyroscope in Bristol, where he joined its micro-processor applications group. There he found himself using Zilog Z80 and Intel 8088 machine code language for small applications of a classified nature for the Ministry of Defence. The Bristol factory was closed in 1981 but by then Malcolm had received a ZX81 from his wife, Linda, for his thirty-seventh birthday in April 1981. Malcolm developed 3D Monster Maze to test what the computer was capable of, and completed it by November.
In the spring of 1982, Evans founded his own company, New Generation Software, which continued to produce games for the ZX Spectrum and pioneer the 3D gaming industry.
As of 2016 Evans was no longer writing games, but he is the author of a travelogue about New Zealand.
References
British video game designers
British computer programmers
1944 births
Living people
Alumni of the University of Portsmouth
|
https://en.wikipedia.org/wiki/Kosaraju%27s%20algorithm
|
In computer science, Kosaraju-Sharir's algorithm (also known as Kosaraju's algorithm) is a linear time algorithm to find the strongly connected components of a directed graph. Aho, Hopcroft and Ullman credit it to S. Rao Kosaraju and Micha Sharir. Kosaraju suggested it in 1978 but did not publish it, while Sharir independently discovered it and published it in 1981. It makes use of the fact that the transpose graph (the same graph with the direction of every edge reversed) has exactly the same strongly connected components as the original graph.
The algorithm
The primitive graph operations that the algorithm uses are to enumerate the vertices of the graph, to store data per vertex (if not in the graph data structure itself, then in some table that can use vertices as indices), to enumerate the out-neighbours of a vertex (traverse edges in the forward direction), and to enumerate the in-neighbours of a vertex (traverse edges in the backward direction); however the last can be done without, at the price of constructing a representation of the transpose graph during the forward traversal phase. The only additional data structure needed by the algorithm is an ordered list of graph vertices, that will grow to contain each vertex once.
If strong components are to be represented by appointing a separate root vertex for each component, and assigning to each vertex the root vertex of its component, then Kosaraju's algorithm can be stated as follows.
For each vertex of the graph, mark as unvisited. Let be empty.
For each vertex of the graph do , where is the recursive subroutine:
If is unvisited then:
Mark as visited.
For each out-neighbour of , do .
Prepend to .
Otherwise do nothing.
For each element of in order, do where is the recursive subroutine:
If has not been assigned to a component then:
Assign as belonging to the component whose root is .
For each in-neighbour of , do .
Otherwise do nothing.
Trivial variations are to instead assign a component number to each vertex, or to construct per-component lists of the vertices that belong to it. The unvisited/visited indication may share storage location with the final assignment of root for a vertex.
The key point of the algorithm is that during the first (forward) traversal of the graph edges, vertices are prepended to the list in post-order relative to the search tree being explored. This means it does not matter whether a vertex was first visited because it appeared in the enumeration of all vertices or because it was the out-neighbour of another vertex that got visited; either way will be prepended to before is, so if there is a forward path from to then will appear before on the final list (unless and both belong to the same strong component, in which case their relative order in is arbitrary).
This means, that each element of the list can be made to correspond to a block , where the block consists of all the vertices reachable from vertex using just
|
https://en.wikipedia.org/wiki/Malcolm%20Evans
|
Malcolm Evans may refer to:
Sir Malcolm Evans (academic lawyer), British jurist
Malcolm Evans (cartoonist), New Zealand cartoonist
Malcolm Evans (computer programmer), British computer programmer
Mal Evans, road manager for The Beatles
|
https://en.wikipedia.org/wiki/NASCAR%20on%20ESPN
|
NASCAR on ESPN is the now-defunct former package and branding of coverage of NASCAR races on ESPN, ESPN2, and ABC. ABC, and later the ESPN family of networks, carried NASCAR events from the sanctioning body's top three divisions at various points from the early 1960s until 2000, after the Truck Series rights were lost. However, ESPN resumed coverage of NASCAR with the Nationwide Series race at Daytona in February 2007 and the then-Nextel Cup Series at Indianapolis in July 2007. ESPN's final race was the Ford EcoBoost 400 at the Homestead–Miami Speedway on November 16, 2014, with Kevin Harvick winning that year's NASCAR Sprint Cup Series championship.
History
1961–2000: ABC
ABC's involvement with NASCAR began in the days of ABC's Wide World of Sports in the 1960s, in which it presented some of the biggest races in stock car racing. One of its events was the Daytona 500. ABC showed the last half of the race, except in 1976, when it showed the first 30 laps, went to the Olympics and then came back for the wild finish, in which David Pearson edged out Richard Petty with both cars sliding sideways across the track. The race TV rights went to CBS Sports in 1979, who reportedly pioneered live flag-to-flag NASCAR race coverage. For much of the 1970s and 1980s, ABC broadcast NASCAR races on tape delay. The commentary was added later in post production. They would actually sit in the booth and call something live if they needed to for the satellite feed. Otherwise, ABC would do all the editing afterwards for the final telecast.
1981–2000: ESPN
ESPN began showing NASCAR races in 1981, with the first event being at North Carolina Speedway. The last of its 265 Cup telecasts (that number includes some on ABC Sports) was the 2000 NAPA 500 in Atlanta (now the Folds of Honor QuikTrip 500). Even though Fox, FX, NBC, and TNT were the exclusive broadcasters of the Winston/Nextel Cup Series and the Busch Series from 2001 to 2006, the ESPN networks still carried the Craftsman Truck Series in 2001 and 2002 because the Truck races were under a separate contract; ESPN had been broadcasting Truck races since the inaugural race in 1995. Speed Channel took over the Truck broadcasts in 2003.
2007–2014
The TV show promo of NASCAR on ESPN, ESPN2 and ABC in 2007 can be seen as a sneak peek in the 2006 Disney/Pixar animated film Cars on DVD and VHS in the 2.39:1 widescreen and 1.33:1 fullscreen versions. ESPN (and ABC) regained rights to air NASCAR races in 2007 after NBC Sports dropped NASCAR at the end of 2006. Each race telecast began with the pre-race show NASCAR Countdown. As of the 2011 season Nicole Briscoe was the usual host, with Brad Daugherty and Rusty Wallace providing commentary. It was typically 1 hour for Sprint Cup and major Nationwide races and a half-hour for all other Nationwide races. In addition to the races, ESPN2 aired a daily show called NASCAR Now, which was similar to Baseball Tonight and NFL Primetime. It aired daily on ESPN2 and was h
|
https://en.wikipedia.org/wiki/L-reduction
|
In computer science, particularly the study of approximation algorithms, an
L-reduction ("linear reduction") is a transformation of optimization problems which linearly preserves approximability features; it is one type of approximation-preserving reduction. L-reductions in studies of approximability of optimization problems play a similar role to that of polynomial reductions in the studies of computational complexity of decision problems.
The term L reduction is sometimes used to refer to log-space reductions, by analogy with the complexity class L, but this is a different concept.
Definition
Let A and B be optimization problems and cA and cB their respective cost functions. A pair of functions f and g is an L-reduction if all of the following conditions are met:
functions f and g are computable in polynomial time,
if x is an instance of problem A, then f(x) is an instance of problem B,
if y' is a solution to f(x), then g(y' ) is a solution to x,
there exists a positive constant α such that
,
there exists a positive constant β such that for every solution y' to f(x)
.
Properties
Implication of PTAS reduction
An L-reduction from problem A to problem B implies an AP-reduction when A and B are minimization problems and a PTAS reduction when A and B are maximization problems. In both cases, when B has a PTAS and there is an L-reduction from A to B, then A also has a PTAS. This enables the use of L-reduction as a replacement for showing the existence of a PTAS-reduction; Crescenzi has suggested that the more natural formulation of L-reduction is actually more useful in many cases due to ease of usage.
Proof (minimization case)
Let the approximation ratio of B be .
Begin with the approximation ratio of A, .
We can remove absolute values around the third condition of the L-reduction definition since we know A and B are minimization problems. Substitute that condition to obtain
Simplifying, and substituting the first condition, we have
But the term in parentheses on the right-hand side actually equals . Thus, the approximation ratio of A is .
This meets the conditions for AP-reduction.
Proof (maximization case)
Let the approximation ratio of B be .
Begin with the approximation ratio of A, .
We can remove absolute values around the third condition of the L-reduction definition since we know A and B are maximization problems. Substitute that condition to obtain
Simplifying, and substituting the first condition, we have
But the term in parentheses on the right-hand side actually equals . Thus, the approximation ratio of A is .
If , then , which meets the requirements for PTAS reduction but not AP-reduction.
Other properties
L-reductions also imply P-reduction. One may deduce that L-reductions imply PTAS reductions from this fact and the fact that P-reductions imply PTAS reductions.
L-reductions preserve membership in APX for the minimizing case only, as a result of implying AP-reductions.
Examples
Dominating
|
https://en.wikipedia.org/wiki/WHDF
|
WHDF (channel 15) is a television station licensed to Florence, Alabama, United States, serving as the CW outlet for the Huntsville area. It is owned and operated by network majority owner Nexstar Media Group alongside CBS affiliate WHNT-TV (channel 19). Both stations share studios on Holmes Avenue Northwest in downtown Huntsville, while WHDF's transmitter is located southeast of Minor Hill, Tennessee.
In addition to its own digital signal, WHDF is simulcast in 720p high definition on WHNT-TV's second digital subchannel (19.2) from a transmitter on Monte Sano Mountain.
History
The station began on October 28, 1957 as WOWL-TV, based in Florence. The station was owned by Richard "Dick" Biddle's TV Muscle Shoals, Inc. Up until late 1999, that station broadcast NBC programs to northwestern Alabama and portions of southern middle Tennessee and northeastern Mississippi; it also carried some popular CBS shows like the soap opera As the World Turns.
WOWL-TV always faced competing NBC affiliates in Huntsville/Decatur (in later years WAFF, channel 48) or even Tupelo (WTVA), whose signals reached much of its broadcast area. However, it retained viewership in northwest Alabama (Florence, Sheffield, Muscle Shoals, Tuscumbia and areas known as "The Shoals" in recent times and referred to as "The Quad Cities" years ago) by offering local newscasts, which for most of the station's 40-plus years were the only newscasts concerned specifically with northwestern Alabama. Over time, though, with the Huntsville stations, especially WAFF, expanding news bureaus of their own into the Shoals in the 1980s and 1990s, WOWL-TV lost much of its traditional advantage.
By the late 1990s, this duplication had progressed to the point that the station could no longer focus solely on northwest Alabama and remain viable. The owners opted to sell to outside interests, who dropped NBC in favor of UPN in the fall of 1999, making WAFF the sole NBC outlet in north Alabama. Shortly before that, on July 19, the call letters were changed to the current WHDF, with a move of the transmitter and tower to Giles County, Tennessee. The new tower transmitted from a location high enough to provide a coverage area comparable to the other north Alabama stations, while remaining within of Florence as required by FCC regulations.
In 2004, Lockwood Broadcast Group acquired WHDF. Lockwood provided content delivery and back-office function from the company's headquarters in Virginia. Completed in 2007, the "hub" facility has remotely operated WHDF since that year.
In September 2006, both UPN and The WB ceased operations. A single new network, The CW, replaced those two struggling entities. WHDF, the UPN affiliate, was granted the northern Alabama affiliation rights for the new network earlier that year, and rebranded as The Valley's CW at midnight on July 27, 2006. (The former WB affiliate, meanwhile, became WAMY-TV, affiliated with MyNetworkTV.)
Local employees at WHDF's Florence and Huntsville f
|
https://en.wikipedia.org/wiki/NASCAR%20on%20NBC
|
NASCAR on NBC (visually branded as NBC NASCAR in logos shown within on-air graphics and network promotions) is the branding used for broadcasts of NASCAR races that are produced by NBC Sports, and televised on several NBCUniversal-owned television networks, including the NBC broadcast network in the United States. The network originally aired races, typically during the second half of the season, from 1999 to 2006.
On July 23, 2013, NBC signed a new agreement with NASCAR to obtain the rights to races from the NASCAR Cup Series, NASCAR Xfinity Series, ARCA Menards Series East, ARCA Menards Series West and NASCAR Whelen Modified Tour seasons starting in 2015. In addition, NBC Universal also gained the rights to the NASCAR Toyota Series starting in 2014, airing on its Spanish-language network channels initially for selected races, with NBC obtaining Spanish-language rights to all NASCAR series starting in 2015.
History
Prior to the original 1999 contract between NASCAR and NBC, the network aired races such as the National 500 at Charlotte Motor Speedway from 1979 to 1981, the 1981 Mountain Dew 500 at Pocono International Raceway, the Winston 500 at Alabama International Motor Speedway from 1983 to 1985, and the Miami 300 and Pennzoil 400 at Homestead-Miami Speedway in both 1999 and 2000.
During the 1970s and 1980s, NBC often pre-recorded coverage of NASCAR races, with the edited broadcasts airing as part of the network's sports anthology series Sportsworld.
Original run (2001–2006)
Background
On November 11, 1999, NASCAR signed a five-year, US$2.48 billion contract which split the American television rights for NASCAR races between Fox, its cable partner FX, NBC and Turner Sports. The contract began in 2001 and went as follows.
Fox and FX would air races in the first half of the season, with their slate of events coming to an end with the Sonoma event most years.
NBC would partner with TBS, Turner's long time home for NASCAR, and cover the remainder of the season beginning with the July races.
As part of the contract, the Daytona 500 would be shared between Fox and NBC. Fox had the rights to the race, as well as the Budweiser Shootout, the Busch Series event, and all qualifying events including the qualifying races, in odd numbered years while NBC would air those events in even numbered years. The network that did not air the Daytona 500 would instead air the Pepsi 400.
As 2001 began, however, Turner Sports decided to make a change to its broadcast arrangement. At the time, Turner Broadcasting was in the midst of a format change for its cable channel TNT that was to make it a drama-centric network. To keep with the branding the network took on, "We Know Drama", Turner Sports decided to make TNT be NBC's cable partner and end the seventeen-year relationship TBS had with NASCAR.
The initial NBC/TNT broadcast team consisted of Allen Bestwick on play-by-play. Bestwick had been tabbed by NBC for its coverage of the first two Cup Series race we
|
https://en.wikipedia.org/wiki/UKNC
|
UKNC () is a Soviet PDP-11-compatible educational micro computer, aimed at teaching school informatics courses. It is also known as Elektronika MS-0511. UKNC stands for Educational Computer by Scientific Centre.
Hardware
Processor: KM1801VM2 1801 series CPU @ 8 MHz, 16 bit data bus, 17 bit address bus
Peripheral processor: KM1801VM2 @ 6.25 MHz
CPU RAM: 64 KiB
PPU RAM: 32 KiB
ROM: 32 KiB
video RAM: 96 KiB (3 planes 32 KiB each, each 3-bit pixel had a bit in each plane)
Graphics: max 640×288 with 8 colors in one line (16 or 53 colors on whole screen), it is possible to set an individual palette, resolution (80, 160, 320, or 640 dots per line) and memory address for each of 288 screen lines; no text mode.
Keyboard: 88 keys (MS-7007), JCUKEN layout
built-in LAN controller
built-in controller for common or special tape-recorder with computer control (to use for data storage, usually 5-inch FDD's were used)
One unique part of the design is the usage of a peripheral processing unit (PPU). Management of peripheral devices (display, audio, and so on) was offloaded to the PPU, which can also run user programs.
The computer was released in 3 sub-models: 0511, 0511.1, 0511.2. The 0511.1 model, intended for home use, has a power supply for 220 V AC, while others use 42 V AC. The 0511.2 features new firmware with extended functionality and changed the marking of the keyboard's gray keys, compared to the initial version. The photo shows an 0511.2 variant.
There is no active cooling, and at least the 0511.2 variant tends to overheat and halt after several hours of operation.
The design of the case, the layout of the keyboard, the location and the shape of expansion slots are inspired by the Yamaha MSX system, which was purchased by the Soviet Union in the early 1980s for use in schools. The same case, with changed markings, is found with the IBM PC clone called Elektronika MS-1502. The same case and keyboard are found on another educational computer called Rusich (i8085 based).
Software
Operating system: RAFOS, FODOS (RT-11 clones), or RT-11SJ/FB
LAN control program
Programming languages:
BASIC (Vilnius BASIC)
Fortran
Pascal
Modula-2
C
Assembler
Rapira
E-practicum
Logo
Prolog
Forth
FOCAL
See also
DVK
Elektronika BK-0010
SM EVM
External links
UKNC emulator project; contains RT-11 images
Archive software and documentation for Soviet computers UK-NC, DVK, and BK0010.
Microcomputers
Ministry of the Electronics Industry (Soviet Union) computers
PDP-11
|
https://en.wikipedia.org/wiki/MAD%20World
|
MAD World is the international television service of MAD TV that broadcasts the 'best of MAD' programming to Greeks abroad. Unlike its counterpart in Greece, MAD World airs only Greek music content, no international music.
Mad World is on the air 24 hours a day, broadcasting all genres of Greek music (pop, hip hop, rock, etc.), 'rockumentaries' dedicated to famous Greek artists, and daily live shows that keep the audience informed about the events that take place in Greece. Mad World also focuses on the classic Greek hits of the last decade that are very popular among the Greeks worldwide.
Mission
Mad TV's production team is behind all the creative new formulas of Mad World and its ultimate goal is to make it the best satellite music channel. Mad TV wishes to spread Greek music all over the world through Mad World. What is more, it truly hopes to bring together Greek emigrants by informing their audience about current music events that take place in Greece, and/or the live appearances of the Greek artists abroad, thus benefiting both the Greek artists/singers and Greek songwriters.
Availability
It launched in December 2005 in Asia, Africa and Australia on UBI World TV and launched in New Zealand in 2008 when UBI World TV expanded their services to New Zealand. In June 2012, UBI World TV ceased operations, resulting in MAD World going off the air as UBI was the only provider (at the time) offering the channel anywhere in the world.
In December 2013, Mad World re-launched on Bell Fibe TV in Canada via a partnership with Canadian ethnic broadcaster Ethnic Channels Group.
Programs
Mad World features programs that are tailored specifically for the station:
MAD Video Requests is a show that lets viewers request their favourite music video via email and SMS.
MAD TOP 10 - The Top 10 Music videos from Greece.
MAD News has the latest music news on the hour.
POP World - Pop music and popular music videos.
3 apo 1 - three video clips from the same artist.
Κlassika - Classic hits from that last 20 years.
Jukebox - Viewers select their favourite from among two video clips.
Mad4Bouzoukia - Live performances.
Μousiko Κouti - All the latest news from the world of music and showbiz.
Polu Dunata - All the latest Greek pop hits.
Rythmos Εllinikos - Non-stop music mix of the latest hits from Greece.
Τa Εrotika - Ballads from the world of pop, rock, techno and modern Greek music.
Τop 5 has Five of the biggest hits from a specific artist, interspersed with interviews.
Trash Me - Late night segment with a logo of a dog, an innuendo for the derogatory Skiladiko (Dog music) genre, which features lower budget "trash" clips that did not traditionally enjoy much broadcasting. Also includes songs that established a cult following in the nightlife.
External links
Official site
Television channels in Greece
MAD TV (Greece)
Greek-language television stations
Television channels and stations established in 2005
|
https://en.wikipedia.org/wiki/The%20Mark%20Riley%20Show
|
The Mark Riley Show is a weekday radio show on the Air America Radio network hosted by long-time talk radio host Mark Riley.
Background
Originally it was part of a larger Air America Mornings program, but as of September 18, 2006 the show was billed on its own. The show features news items read by Riley and his commentary on each of them. Riley interviews a wide variety of guests, though these segments are often pre-recorded due to the early airtime of the show. Riley often takes listener calls on a specific topic in a rapid-fire fashion.
The show began on January 2, 2006, originally airing weekdays from 5AM - 7AM ET. It now airs on weekdays from 5AM - 6AM ET on some Air America affiliates.
The show came to an end on May 11, 2007.
Regular features
Sunrise Soundbites - audio clips from some of yesterdays important news stories
Last Night's Clips - audio clips from the late-night television comedy shows
Overseas Live - Riley talks with an overseas reporter on the day's major international story
On the Grapevine - entertainment news
Nice Try of the Week - a political figure's failed attempt to justify their actions
Weekly Conversation with Robert Reich - Riley and Reich discuss the week's economic news
Winners and Losers - Friday roundup
Wayne Gillman - the morning AAR newscaster joins the show during the second hour
Common Sense Commentary - Jim Hightower's daily commentary
The Numbers - A list of numerical facts similar to Harper's Index
Music
Theme: "Float On" by Modest Mouse
Bumpers: various jazz tunes
Staff
Host: Mark Riley
Producer: Ron Dodd
Producer: John Crimmings
Sports reporter: Larry Hardesty
Sound Engineer: Kris Lo Presto
External links
Air America (radio network)
American talk radio programs
|
https://en.wikipedia.org/wiki/Cycle%20stealing
|
In computing, traditionally cycle stealing is a method of accessing computer memory (RAM) or bus without interfering with the CPU. It is similar to direct memory access (DMA) for allowing I/O controllers to read or write RAM without CPU intervention. Clever exploitation of specific CPU or bus timings can permit the CPU to run at full speed without any delay if external devices access memory not actively participating in the CPU's current activity and complete the operations before any possible CPU conflict.
Cycle stealing was common in older platforms, first on supercomputers which used complex systems to time their memory access, and later on early microcomputers where cycle stealing was used both for peripherals as well as display drivers. It is more difficult to implement in modern platforms because there are often several layers of memory running at different speeds, and access is often mediated by the memory management unit. In the cases where the functionality is needed, modern systems often use dual-port RAM which allows access by two systems, but this tends to be expensive.
In older references, the term is also used to describe traditional DMA systems where the CPU stops during memory transfers. In this case the device is stealing cycles from the CPU, so it is the opposite sense of the more modern usage.
In the smaller models of the IBM System/360 and System/370, the control store contains microcode for both the processor architecture and the channel architecture. When a channel needs service, the hardware steals cycles from the CPU microcode in order to run the channel microcode.
Common implementations
Some processors were designed to allow cycle stealing, or at least supported it easily. This was the case for the Motorola 6800 and MOS 6502 systems due to a design feature which meant the CPU only accessed memory every other clock cycle. Using RAM that was running twice as fast as the CPU clock allowed a second system to interleave its accesses between the CPUs by timing themselves on every other clock cycle. This was widely used for updating the display using main memory as a framebuffer. Common RAM of the late 1970s ran at 2 MHz, so most machines had a CPU running around 1 MHz. The BBC Micro secured a supply of 4 MHz RAM which allowed its CPU to run at 2 MHz.
Another common solution was to use separate banks of memory that stored instructions vs. data, or more than one pool of data. In these cases the I/O systems can access their data memory while the processor is using a different bank. One example is the Zilog Z80, whose M1 line indicates that the processor is reading instructions; if those instructions are in a different bank, or more commonly ROM, the I/O systems can access RAM without interfering with the processor.
Modern architecture
Cycle stealing is difficult to achieve in modern systems due to many factors such as pipelining, where pre-fetch and concurrent elements are constantly accessing memory, leaving few predictable
|
https://en.wikipedia.org/wiki/List%20of%20awards%20and%20nominations%20received%20by%20The%20Sopranos
|
The Sopranos, an American crime drama television series created by David Chase that aired on the premium cable network HBO between 1999 and 2007, won and was nominated for a variety of different awards. The show won 21 Primetime Emmy Awards in 111 nominations. The series was nominated for the Primetime Emmy Award for Outstanding Drama Series seven times, in every year eligible, winning in 2004 (as the first series on a cable network to do so) and 2007. It also won five Golden Globe Awards in 23 nominations, including a win for Best Drama Series for its first season in 2000. The series was honored with two consecutive Peabody Awards in 2000 and 2001, and also won several major guild awards for its actors, directors, producers, and writers.
Additionally, because of the long hiatuses between certain seasons, the series was intermittently ineligible for awards.
Lead actor James Gandolfini and lead actress Edie Falco received the most nominations and wins of the ensemble cast, including three wins each for the Primetime Emmy Award, in their respective categories; as well as Falco winning the Golden Globe Award in 2000 and 2003, and Gandolfini winning in 2000. David Chase also received numerous accolades for his work on the series as a director, producer and writer, including the Primetime Emmy Award for Outstanding Writing for a Drama Series on three occasions. The Sopranos received 16 Directors Guild of America Award nominations, winning two of them; its four nominations in 2000 set a record for most nominations for a series in one category in a year. It received six Producers Guild of America Award nominations, winning three of them. At the Screen Actors Guild Awards, Gandolfini and Falco were honored three times each, and the entire cast also won for Outstanding Performance by an Ensemble in a Drama Series in 2000 and 2008. The show won four Writers Guild of America Awards from 11 nominations and 12 TCA Awards from 24 nominations. Its five nominations and four wins at the TCA Awards in 1999 set records for most nominations and wins in a year.
Awards and nominations
Notes
Nominees for awards
Other
References
External links
Awards for The Sopranos at Internet Movie Database
Awards
Lists of awards by television series
|
https://en.wikipedia.org/wiki/Apple%20Media%20Tool
|
The Apple Media Tool was a multimedia authoring tool and associated programming environment sold by Apple in the late 1990s. It was primarily aimed at producing multimedia presentations for distribution on CD-ROM and was aimed at graphic designers who did not have programming experience. It featured an advanced user interface with an object-oriented user model that made production of rich and complex presentations easy. Its competitors were Macromedia Director, Quark Immedia, mTropolis, and Kaleida Labs ScriptX.
History
The AMT system was developed by Patrick Soquet, a developer in Belgium working for Arborescence - a French company that was later acquired by Havas. From 1993 onwards it was marketed by Apple but all development was done by the independent team led by Soquet. In 1996, the development of the tool was taken over by Apple and the 2.1 version of the program was developed in-house by a team of engineers in California led by Dan Crow. In 1997 Apple decided to concentrate its multimedia offerings on QuickTime and HyperCard and the rights to AMT returned to Havas. Patrick Soquet acquired these rights and co-founded Tribeworks and developed a new tool based on AML, called iShell.
Features
The major features of the Apple Media Tool were a graphical authoring tool (AMT itself) and an associated programming environment - the Apple Media Tool Programming Environment (AMTPE) which was a compiler and debugger for the underlying Apple Media Language (AML - also known as the Key language). AMT was notable as one of the first authoring systems to support embedding Apple's pioneering QTVR movie format.
AML is an object-oriented programming language based on Eiffel but specialized for multimedia programming. Although the AMT did not require any programming experience to use, it produced complete AML programs which were then compiled into byte code and interpreted by a runtime interpreter. The AMPTE could be used to enhance the AML code to create more complex programs, for example accessing a database to retrieve media. AML is conceptually similar to Java, with a "write once, run anywhere" approach to cross-platform development: it had runtime interpreters for both the classic Mac OS and Windows platforms.
Awards
1993 MacUser Editor's Choice Award for Best New Multimedia Software
References
External links
Apple Media Tool 2.0 Read Me file
Domain-specific programming languages
Hypertext
Macintosh multimedia software
Authoring systems
Media Tool
|
https://en.wikipedia.org/wiki/Use%20of%20social%20network%20websites%20in%20investigations
|
Social network services are increasingly being used in legal and criminal investigations. Information posted on sites such as Twitter, Instagram, and Facebook has been used by police and university officials to prosecute users of said sites. In some situations, content posted on Myspace has been used in court to determine an appropriate sentence based on a defendant's attitude.
The U.S. DOT National Highway Traffic Safety Administration (NHTSA) has made federal grants available to states to train law enforcement officers to use social media sites to identify events that may result in impaired driving or consumption by minors. As of 2012, Michigan spent over $4.5 million through this program, and has trained over 100 local police officers to use social media sites to identify and target events. In more recent years, a majority of police departments have some sort of social media-based strategy in place.
Social media can be used as an investigative tool to obtain probable cause for a search warrant. Agencies can surveil social media sites via software programs, such as X1 Social Discovery, MediaSonar, and Geofeedia.
How police use social media
In 2015 the international Association of Chiefs of Police reported that about 94% of police agencies have some form of Facebook related strategy in place. Among other things, this includes using Facebook to encourage a more positive perception of the police and monitor public gatherings. Social media is considered public space, therefore anything posted is considered public, unless you set your privacy settings to private, and don't accidentally accept friend requests from undercover police. This means that if you post something on Facebook or twitter, police have access to it and have the right to use and monitor it. Police may use tactics such as "Ghosting" where they create undercover profiles and friend requesting suspects in order to keep a closer eye on the daily lives of those suspects. This helps them know when large gatherings are going to occur and possibly increase police presence in that area to ensure public safety. these tactics provide police with otherwise unavailable information on key suspects and people of interest while taking up less time, money and resources. In 2020, when asked police mentioned Facebook (And Facebook live), Instagram, Myspace, Periscope, Xbox Live with Friends, and YouTube. They would be on the lookout for planned gatherings or post flashing guns or weaponry as well as sudden escalation of violence.
In addition to monitoring criminals, police can use social media to seek assistance from their communities. one such example is with missing persons or wanted suspects. In 2019, Police in Toronto, Ontario (Canada) posted on twitter seeking help locating four missing children. their post was shared over 300 times and the children were located and returned home. Between the year 2017 and 2019, 373 posts were made by 15 police agencies in Canada. They used a technique cal
|
https://en.wikipedia.org/wiki/LaunchBar
|
LaunchBar is an application launcher for macOS. It provides access to user's applications and files, by entering short abbreviations of the searched item's name. It uses an adaptive algorithm that 'learns' a user's preferred abbreviations for a particular application. For example, after training, Adobe Photoshop may be launched by simply typing 'pho' and Time Machine can be opened by typing 'tm' even though that sequence of characters does not appear anywhere in the name of the application.
LaunchBar also provides capabilities beyond application launching, such as file management and piping the current selection to a command line utility, along with clipboard management and a built-in calculator.
LaunchBar is distributed as crippleware shareware - full usage of the application requires paying the registration fee, but up to 7 abbreviations may be used per session without paying anything.
According to user interface researcher Bruce Tognazzini, "LaunchBar should be able to outperform a visual interface for complex, repetitive switching sequences by an expert user".
History
LaunchBar began as a series of shell scripts for the NeXTSTEP platform, then migrated to OPENSTEP where it was developed into a full-fledged application. It was ported to Mac OS X in 2001 as LaunchBar 3.
In 2005, Apple introduced Spotlight, which took over LaunchBar's default position at the top-right corner of the screen. In response, LaunchBar was changed to display its window at the center of the screen, below the menu bar.
In 2014, LaunchBar 6 was released with a redesigned interface, additional indexing rules and built-in actions, live web searches and usage statistics.
See also
Comparison of application launchers
External links
Official site
Interview with Norbert Heger, LaunchBar's developer
LaunchBar demo screencast
MacWorld review
References
Utilities for macOS
Application launchers
MacOS-only proprietary software
|
https://en.wikipedia.org/wiki/KKYK-CD
|
KKYK-CD (channel 30) is a low-power, Class A television station in Little Rock, Arkansas, United States, affiliated with the Spanish-language network Telemundo. Owned by KTV Media, KKYK-CD maintains studios on Shackelford Drive in the Beverly Hills section of Little Rock, and its transmitter is located on Shinall Mountain, near the city's Chenal Valley neighborhood.
History
The station first signed on the air on May 15, 1995 as K58FA; its calls were changed to KKRK-LP in 1997. In 1999, the station was acquired by the Equity Broadcasting Corporation, which was based in Little Rock, and changed its call letters to KLRA-LP (the KLRA callsign originally belonged to a popular country music AM radio station in Little Rock; it was known for its morning DJ Hal Webber, whose on-air senior-citizen character was called "Brother Hal"; Equity commonly used the call signs of old Little Rock radio stations for its television stations; such as KKYK and KBBL).
The station became an affiliate of Spanish-language network Univision in 2001. On May 8, 2004, Equity began simulcasting the station's programming on sister station KUOK in Woodward, Oklahoma as well as its three translators (K69EK (now KOCY-LD) and KCHM-LP (now KUOK-CD) in Oklahoma City; KUOK-CA (now defunct) in Norman; and KOKT-LP (also now defunct) in Sulphur), forming a regional mini-network known as Univision Arkansas-Oklahoma. Local commercials from the Little Rock area that were inserted by that station during national commercial breaks and KLRA-LP's station identification bumpers were broadcast through this simulcast to Oklahoma viewers (the Oklahoma City repeaters were identified only through text-only IDs placed at the bottom of the screen each half-hour). In March 2005, the simulcast between KLRA-LP and KUOK was discontinued, with both stations – which continued to be programmed via satellite from Equity's headquarters in Little Rock – relaying Univision programming through separate feeds with KUOK carrying advertising for businesses within the Oklahoma City market and separate station promotions (KUOK's schedule now mirrors the national feed outside of local advertising, news inserts and occasional paid programming substitutions). KLRA-LP rebranded as Univision Arkansas shortly afterward.
After failing to find a buyer at a bankruptcy auction, KLRA was sold to Pinnacle Media in August 2009 (after having initially been included in Silver Point Finance's acquisition on June 2 of several Equity stations), with Pinnacle assuming control of the station under a local marketing agreement on August 5. In 2013, the station changed its call letters to KKYK-CD (a callsign that was formerly used on a repeater of former sister station KMYA-DT, channel 49, which also once bore the KKYK calls); in addition to swapping call letters, the station also swapped affiliations with KKYK-CD (channel 20), which adopted the KLRA-CD calls and became the market's Univision affiliate; the new KKYK-CD moved to UHF channel
|
https://en.wikipedia.org/wiki/Ethernet%20crossover%20cable
|
An Ethernet crossover cable is a crossover cable for Ethernet used to connect computing devices together directly. It is most often used to connect two devices of the same type, e.g. two computers (via their network interface controllers) or two switches to each other. By contrast, straight through patch cables are used to connect devices of different types, such as a computer to a network switch.
Intentionally crossed wiring in the crossover cable connects the transmit signals at one end to the receive signals at the other end.
Many network devices today support auto MDI-X (aka "auto crossover") capability, wherein a patch cable can be used in place of a crossover cable, or vice versa, and the receive and transmit signals are reconfigured automatically within the device to yield a working connection.
Motivation
The 10BASE-T and 100BASE-TX Ethernet standards use one wire pair for transmission in each direction. This requires that the transmit pair of each device be connected to the receive pair of the device on the other end. The 10BASE-T standard was devised to be used with existing twisted pair cable installations with straight-through connections.
When a terminal device (with an MDI port) is connected to a switch or hub, this crossover is done internally in the switch or hub (MDI-X port). A standard straight-through cable is used for this purpose where each pin of the connector on one end is connected to the corresponding pin on the other connector.
One terminal may be connected directly to another without the use of a switch or hub, but in that case, the crossover must be done in the cabling. Since 10BASE-T and 100BASE-TX use pairs 2 and 3, these two pairs must be swapped in the cable. This wiring scheme constitutes a crossover cable. A crossover cable may also be used to connect two hubs or two switches on their upstream ports.
Because the only difference between the T568A and T568B pin and pair assignments are that pairs 2 and 3 are swapped, a crossover cable may be envisioned as a cable with one modular connector following T568A and the other T568B (see TIA/EIA-568 wiring). Such a cable will work for 10BASE-T or 100BASE-TX.
The polarity of each pair is not swapped, but the pairs crossed as a unit: the two wires within each pair are not crossed.
Automatic crossover
Introduced in 1998, this made the distinction between uplink and normal ports and manual selector switches on older hubs and switches obsolete. If one or both of two connected devices has the automatic MDI/MDI-X configuration feature, there is no need for crossover cables.
Although Auto MDI-X was specified as an optional feature in the 1000BASE-T standard, in practice it is implemented widely on most interfaces.
Besides the eventually agreed upon Automatic MDI/MDI-X, this feature may also be referred to by various vendor-specific terms including: Auto uplink and trade, Universal Cable Recognition and Auto Sensing.
1000BASE-T and faster
In a departure from both
|
https://en.wikipedia.org/wiki/Actor%20model%20middle%20history
|
In computer science, the Actor model, first published in 1973 , is a mathematical model of concurrent computation. This article reports on the middle history of the Actor model in which major themes were initial implementations, initial applications, and development of the first proof theory and denotational model. It is the follow on article to Actor model early history which reports on the early history of the Actor model which concerned the basic development of the concepts. The article Actor model later history reports on developments after the ones reported in this article.
Proving properties of Actor systems
Carl Hewitt [1974] published the principle of Actor induction which is:
Suppose that an Actor has property when it is created
Further suppose that if has property when it processes a message, then it has property when it processes the next message.
Then always has the property .
In his doctoral dissertation, Aki Yonezawa developed further techniques for proving properties of Actor systems including those that make use of migration. Russ Atkinson and Carl Hewitt developed techniques for proving properties of Serializers that are guardians of shared resources. Gerry Barber's doctoral dissertation concerned reasoning about change in knowledgeable office systems.
Garbage collection
Garbage collection (the automatic reclamation of unused storage) was an important theme in the development of the Actor model.
In his doctoral dissertation, Peter Bishop developed an algorithm for garbage collection in distributed systems. Each system kept lists of links of pointers to and from other systems. Cyclic structures were collected by incrementally migrating Actors (objects) onto other systems which had their addresses until a cyclic structure was entirely contained in a single system where the garbage collector could recover the storage.
Henry Baker developed an algorithm for real-time garbage collection in his doctoral dissertation. The fundamental idea was to interleave collection activity with construction activity so that there would not have to be long pauses while collection takes place. See incremental garbage collection.
Henry Lieberman and Carl Hewitt [1983] developed a real time garbage collection based on the lifetimes of Actors (Objects). The fundamental idea was to allocate Actors (objects) in generations so that only the latest generations would have to be examined during a garbage collection. See generational garbage collection.
Actor programming languages
Henry Lieberman, Dan Theriault, et al. developed Act1, an Actor programming language. Subsequently for his masters thesis, Dan Theriault developed Act2. These early proof of concept languages were rather inefficient and not suitable for applications. In his doctoral dissertation, Ken Kahn developed Ani, which he used to develop several animations. Bill Kornfeld developed the Ether programming language for the Scientific Community Metaphor in his doctoral disse
|
https://en.wikipedia.org/wiki/Actor%20model%20later%20history
|
In computer science, the Actor model, first published in 1973 , is a mathematical model of concurrent computation. This article reports on the later history of the Actor model in which major themes were investigation of the basic power of the model, study of issues of compositionality, development of architectures, and application to Open systems. It is the follow on article to Actor model middle history which reports on the initial implementations, initial applications, and development of the first proof theory and denotational model.
Power of the Actor Model
Investigations began into the basic power of the Actor model. Carl Hewitt [1985] argued that because of the use of Arbiters that the Actor model was more powerful than logic programming (see indeterminacy in concurrent computation).
A family of Prolog-like concurrent message passing systems using unification of shared variables and data structure streams for messages were developed by Keith Clark, Hervé Gallaire, Steve Gregory, Vijay Saraswat, Udi Shapiro, Kazunori Ueda, etc. Some of these authors made claims that these systems were based on mathematical logic. However, like the Actor model, the Prolog-like concurrent systems were based on message passing and consequently were subject to indeterminacy in the ordering of messages in streams that was similar to the indeterminacy in arrival ordering of messages sent to Actors. Consequently Carl Hewitt and Gul Agha [1991] concluded that the Prolog-like concurrent systems were neither deductive nor logical. They were not deductive because computational steps did not follow deductively from their predecessors and they were not logical because no system of mathematical logic was capable of deriving the facts of subsequent computational situations from their predecessors
Compositionality
Compositionality concerns composing systems from subsystems. Issues of compositionality had proven to be serious limitations for previous theories of computation including the lambda calculus and Petri nets. E.g., two lambda expressions are not a lambda expression and two Petri nets are not a Petri net and cannot influence each other.
In his doctoral dissertation Gul Agha addressed issues of compositionality in the Actor model. Actor configurations have receptionists that can receive messages from outside and may have the addresses of the receptionists of other Actor configurations. In this way two Actor configurations can be composed into another configuration whose subconfigurations can communicate with each other. Actor configurations have the advantage that they can have multiple Actors (i.e. the receptionists) which receive messages from outside without the disadvantage of having to poll to get messages from multiple sources (see issues with getting messages from multiple channels).
Open Systems
Carl Hewitt [1985] pointed out that openness was becoming a fundamental challenge in software system development. Open distributed systems are required to mee
|
https://en.wikipedia.org/wiki/International%20Alliance%20of%20Research%20Universities
|
The International Alliance of Research Universities (IARU) was launched on 14 January 2006 as a co-operative network of 10 leading, international research-intensive universities who share similar visions for higher education, in particular the education of future leaders. The IARU Chair is elected from among the IARU Presidents for a period of 2 years. Past IARU Chairpersons: At the launch the presidents elected Professor Ian Chubb, 2005 - 2008 (Australian National University); Professor Tan Chorh Chuan, 2009 - 2012 (National University of Singapore); Professor Ralph Eichler, 2013 - 2014 (ETH Zurich); Professor Ralf Hemmingsen, 2015 - 2016 (University of Copenhagen); Professor Nicholas Dirks, 2017 (University of California, Berkeley); Chancellor Carol Christ, 2017 - 2018 (University of California, Berkeley); President Makoto Gonokami, 2018 - 2020 (University of Tokyo). The present Chair of IARU is the Vice-Chancellor of the University of Cambridge, Professor Stephen Toope.
In January 2016, the University of Cape Town joined as the 11th member.
Its Presidents meet annually at a host university venue to discuss joint initiatives under the following categories:
Global education initiatives, which includes the flagship Global Summer Program ;
Institutional joint networking;
Grand Challenge, and most notably its Campus Sustainability; and,
Research initiatives.
List of institutions
Australian National University
ETH Zurich
National University of Singapore
Peking University
University of California, Berkeley
University of Cambridge
University of Cape Town
University of Copenhagen
University of Oxford
University of Tokyo
Yale University
External links
IARU website
International college and university associations and consortia
|
https://en.wikipedia.org/wiki/Super%20G%20%28disambiguation%29
|
Super G may refer to:
Super Giant Slalom skiing, abbreviated to Super G
Commercial names:
Super G (wireless networking), Atheros' proprietary enhancements to IEEE 802.11g wireless LAN performance
Super G is also a brand formerly used by Giant Food of Landover, Maryland
Lockheed L-1049G Super Constellation, a propeller driven airliner often referred to as the "Super G"
|
https://en.wikipedia.org/wiki/System%20Contention%20Scope
|
In computer science, The System Contention Scope is one of two thread-scheduling schemes used in operating systems. This scheme is used by the kernel to decide which kernel-level thread to schedule onto a CPU, wherein all threads (as opposed to only user-level threads, as in the Process Contention Scope scheme) in the system compete for the CPU. Operating systems that use only the one-to-one model, such as Windows, Linux, and Solaris, schedule threads using only System Contention Scope.
References
Operating system kernels
Processor scheduling algorithms
|
https://en.wikipedia.org/wiki/Macintosh%20128K/512K%20technical%20details
|
The original Macintosh was a relatively simple machine, now of interest for its simplicity and for the fact that it was the first computer produced by Apple under the name Macintosh. The Macintosh used standard off-the-shelf components to the greatest extent possible, achieving a moderate price point by mixing complex LSI chips, readily customizable programmable array logic, and off-the-shelf components.
Overall architecture
The Macintosh used the Motorola 68000. The 68000's bus was wired directly to the other programmable components of the computer: the IWM floppy controller, the Zilog 8530 SCC, and the MOS Technology 6522.
The bus also connected the 68000 to the 128 or 512 KiB of main memory (DRAM), which was shared between the processor and the multimedia circuits in a direct memory access (DMA) arrangement. Either the processor or the video/sound engine could access the memory, but not both, resulting in up to a 10% loss in performance; the DMA circuit also performed necessary maintenance on the RAM which would otherwise add overhead, a trick previously used in the Apple II.
Precise timing information was relayed to the 68000 by interrupts. The 68000 provides three interrupt inputs, which in the Macintosh 128K/512K were connected to the 6522, the 8530, and a human input designed for programmers, in order of increasing priority. Thus typing on the keyboard (attached to the 6522) did not reduce serial data (8530) performance, yet the program controlling the serial bus could be debugged by the programmer.
To further reduce the cost of manufacture, as compared with its predecessor the Lisa, Apple did not include an MMU. As a result, the Macintosh did not support protected memory, and this feature remained absent from the OS until 2001 with the Mac OS X operating system.
According to Andy Hertzfeld the Macintosh used for the introduction demo on January 24, 1984, was a prototype with 512k RAM, even though the first model offered for sale implemented just 128k of non-expandable memory. This prototype was used to provide adequate RAM to run the memory-intensive demo, which showcased speech synthesis software intended to impress the crowd.
Components
This is a comprehensive list of the integrated circuits in the original Macintosh:
a Motorola MC68000 microprocessor at clock speed 7.8336 MHz
64 or 128 KB of ROM in two chips containing parts of the operating system
128 KB of RAM in 16 chips
eight TTL chips implementing a video and sound DMA controller, plus
two TTL chips providing a 16-bit video buffer (74166 type)
one PAL chip generating video timing signals (LAG)
two TTL chips providing an 8-bit Pulse-width modulation sound driver (74LS161 type)
two analog chips providing sound amplification (MC14016 switch, LF353 op-amp)
a Zilog 8530 chip controlling two RS-422 buses through two driver chips
an Integrated Woz Machine 400 KB floppy-disk controller plus support PAL (ASG)
a 6522 VIA bridge chip connecting to the keyboard and clock
a
|
https://en.wikipedia.org/wiki/11AM%20%28TV%20program%29
|
11AM (also known as Eleven AM) is an Australian news magazine television program that aired on the Seven Network from 11 am AEST to midday from 1975 to 1999.
Overview
The hour-long news magazine program started on 13 October 1975 with Roger Climpson presenting, with a number of high-profile presenters since, including Clive Robertson, Steve Liebmann, Vincent Smith, Paul Lyneham, Kerry O'Brien, Don Willesee, Helen Wellings, Richard Zachariah, Ann Sanders and Sonia Kruger, among others. Ross Symonds, Darren McDonald, Melissa Doyle and Cameron Williams all featured as news presenters throughout the shows life.
Its most famous presenter was comedian Graham Kennedy.
It last aired on 28 May 1999, presented by Melissa Doyle, who was filling in for Anne Fulwood (who had already moved to Seven News Melbourne) and Andrew Daddo. Fulwood went on to co-anchor Seven News in Melbourne with David Johnston, and Daddo to present entertainment programs. 11AM was the forerunner to Seven Morning News, Sunrise and The Morning Show.
References
1970s Australian television series
1982 Australian television series debuts
1999 Australian television series endings
Australian television news shows
Seven News
|
https://en.wikipedia.org/wiki/Beeman%27s%20algorithm
|
Beeman's algorithm is a method for numerically integrating ordinary differential equations of order 2, more specifically Newton's equations of motion . It was designed to allow high numbers of particles in simulations of molecular dynamics. There is a direct or explicit and an implicit variant of the method. The direct variant was published by Schofield in 1973 as a personal communication from Beeman. This is what is commonly known as Beeman's method. It is a variant of the Verlet integration method. It produces identical positions, but uses a different formula for the velocities. Beeman in 1976 published a class of implicit (predictor–corrector) multi-step methods, where Beeman's method is the direct variant of the third-order method in this class.
Equation
The formula used to compute the positions at time in the full predictor-corrector scheme is:
Predict from data at times
.
Correct position and velocities at time from data at times by repeated evaluation of the differential equation to get the acceleration and of the equations of the implicit system
In tests it was found that this corrector step needs to be repeated at most twice. The values on the right are the old values of the last iterations, resulting in the new values on the left.
Using only the predictor formula and the corrector for the velocities one obtains a direct or explicit method which is a variant of the Verlet integration method:
This is the variant that is usually understood as Beeman's method.
Beeman also proposed to alternatively replace the velocity update in the last equation by the second order Adams–Moulton method:
where
is present time (i.e.: independent variable)
is the time step size
is the position at time t
is the velocity at time t
is the acceleration at time t, computed as a function of
the last term is the error term, using the big O notation
Predictor–corrector modifications
In systems where the forces are a function of velocity in addition to position, the above equations need to be modified into a predictor–corrector form whereby the velocities at time are predicted and the forces calculated, before producing a corrected form of the velocities.
An example is:
The velocities at time are then calculated (predicted) from the positions.
The accelerations at time are then calculated from the positions and predicted velocities, and the velocities are corrected.
Error term
As shown above, the local error term is for position and velocity, resulting in a global error of . In comparison, Verlet is for position and velocity. In exchange for greater accuracy, Beeman's algorithm is moderately computationally more expensive.
Memory requirements
The simulation must keep track of position, velocity, acceleration and previous acceleration vectors per particle (though some clever workarounds for storing the previous acceleration vector are possible), keeping its memory requirements on par with velocity Verlet and slightly more expe
|
https://en.wikipedia.org/wiki/List%20of%20Ben%2010%20characters
|
This is a list of characters in the universe of Cartoon Network's Ben 10 franchise.
Main characters
Ben Tennyson
Voiced by:
Tara Strong – Ben 10, Ben 10: Secret of the Omnitrix, Ben 10: Ultimate Alien (as 10 years old in "Forge Of Creation"), Ben 10: Omniverse (11 years old), and Ben 10 (2016) and various commercials, shorts and video games
Yuri Lowenthal – Ben 10: Alien Force, Ben 10: Ultimate Alien, Ben 10: Omniverse and Ben 10 (2016) (as an elderly Ben in "The 11th Alien: Part 1" and as the teenage Bens in "Alien X-Tinction"), various commercials and video games
Portrayed by:
Graham Phillips – Ben 10: Race Against Time
Ryan Kelley – Ben 10: Alien Swarm
Benjamin Kirby "Ben" Tennyson (alias "Ben 10") is the main protagonist of the franchise and wielder of the Omnitrix, a powerful watch-like device allowing him to turn into many different aliens. He is the cousin of Gwen Tennyson and best friend of Kevin Levin.
Gwen Tennyson
Voiced by:
Meagan Smith – Ben 10
Ashley Johnson – Ben 10: Alien Force, Ben 10: Ultimate Alien, and Ben 10: Omniverse
Montserrat Hernandez – Ben 10 (2016)
Portrayed by:
Haley Ramm – Ben 10: Race Against Time
Galadriel Stineman – Ben 10: Alien Swarm
Gwendolyn "Gwen" Tennyson is Ben's paternal cousin and Kevin's love interest, a skilled sorceress who inherited her magical "spark" from her Anodite grandmother, Verdona.
Max Tennyson
Voiced by:
Paul Eiding – Ben 10, Ben 10: Alien Force, Ben 10: Ultimate Alien, and Ben 10: Omniverse
Adam Wylie – Ben 10 (as a kid in "Don't Drink the Water")
Jason Marsden – Ben 10: Ultimate Alien (as a young adult in "Moonstruck")
David Kaye – Ben 10 (2016)
Portrayed by:
Lee Majors – Ben 10: Race Against Time
Barry Corbin – Ben 10: Alien Swarm
Maxwell "Max" Tennyson is a retired Plumber and the paternal grandfather of Ben and Gwen.
Kevin Levin
Voiced by:
Michael Reisz – Ben 10 (in the episode "Kevin 11")
Charlie Schlatter – Ben 10 (in later episodes)
Greg Cipes – Ben 10: Alien Force, Ben 10: Ultimate Alien, Ben 10: Omniverse, and Ben 10 (2016)
Portrayed by:
Nathan Keyes – Ben 10: Alien Swarm
Kevin Ethan Levin is an Osmosian, a mutant subspecies of human, who first appeared as one of Ben's enemies. However, he later reformed and is now his friend and Gwen's love interest.
Rook Blonko
Voiced by:
Bumper Robinson – Ben 10: Omniverse
Rook Blonko is a Revonnahgander Plumber from the planet Revonnah, who serves as Ben's partner throughout Omniverse after Gwen and Kevin leave the team. He has advanced combat knowledge and wields the multi-purpose Proto-Tool.
Supporting characters
Professor Paradox
Voiced by: David McCallum
Professor Paradox is a character who debuts in Alien Force and later appears in Ultimate Alien and Omniverse. Following a lab accident, he was displaced from space and time for millennia, eventually gaining complete understanding and control over it. Unable to remember his original name, he took the moniker "Professor Paradox".
Azmuth
Voiced by:
R
|
https://en.wikipedia.org/wiki/SOP%20%28TV%20program%29
|
SOP is a Philippine television variety show broadcast by GMA Network. It premiered on February 2, 1997, replacing GMA Supershow. The show concluded on February 28, 2010, with a total of 672 episodes. It was replaced by Party Pilipinas in its timeslot.
History
SOP started airing on February 2, 1997, with a live episode from the GMA Broadway studios. Regular dancers include the VIP Dancers, Universal Motion Dancers, Abstract Dancers and Kidz at Work; with Al Quinn as the director and German Moreno as a production consultant.
In 2005, the cast of SOP and SOP Gigsters together with Mel Tiangco, Joey de Leon, Richard Gomez and German Moreno went to San Francisco, California, United States, for the launch of GMA Pinoy TV.
The show moved to a new set at GMA Network Center Annex, Studio 7 in November 2008. It is one of the biggest studios in the Philippines accommodating 1,000-member audiences.
Cast
Ogie Alcasid
Janno Gibbs
Vina Morales
G. Toengi
Cacai Velasquez
Regine Velasquez
Gary Valenciano
Jaya
Co-hosts and performers
604
Carla Abellana
Aljur Abrenica
Marvin Agustin
Marco Alcaraz
Bernadette Allyson-Estrada
Bobby Andrews
Aryana
Roxanne Barcelo
Kris Bernal
James Blanco
Nancy Castiglione
Billy Crawford
Chico and Delamar
Glaiza de Castro
Chris Cayzer
Ryza Cenon
Marky Cielo
Jake Cuenca
Anne Curtis
Rita Daniela
Dingdong Dantes
Angelika dela Cruz
Maybelyn dela Cruz
Joshua Desiderio
Joshua Dionisio
Mylene Dizon
Sunshine Dizon
Cogie Domingo
Gabby Eigenmann
Mart Escudero
Brenan Espartinez
Heart Evangelista
Frencheska Farr
Barbie Forteza
Joross Gamboa
Maricris Garcia
Toni Gonzaga
Carlo Guevarra
Matteo Guidicelli
Raymond Gutierrez
Richard Gutierrez
Ruffa Gutierrez
Mark Herras
Eugene Herrera
Jerome John Hughes
Dion Ignacio
Joseph Izon
Jay-R
Karylle
Bianca King
Kitty Girls
Yasmien Kurdi
Kyla
Kris Lawrence
Lilet
Angel Locsin
Francis Magalona
Maxene Magalona
Gian Magdangal
Jolina Magdangal
Malik
Karel Marquez
Jennylyn Mercado
Lani Misalucha
K. C. Montero
Vaness del Moral
Champagne Morales
Jan Nieto
Nina
Chynna Ortaleza
Amanda Page
Paolo Paraiso
Tyron Perez
Lovi Poe
Yassi Pressman
Rufa Mae Quinto
Radha
Jolo Revilla
Cristine Reyes
LJ Reyes
Tricia Roman
Jake Roxas
Julie Anne San Jose
Aicelle Santos
Gerald Santos
Danica Sotto
Miko Sotto
South Border
Stags
Miggy Tanchangco
Antoinette Taus
Geoff Taylor
Bryan Termulo
Dennis Trillo
TJ Trinidad
Brad Turvey
Greg Turvey
Mo Twister
Kevin Vernal
April Villanueva
Jonalyn Viray
Trina Zuñiga
Ratings
According to AGB Nielsen Philippines' Mega Manila household television ratings, the final episode of SOP scored a 13% rating.
Accolades
References
External links
1997 Philippine television series debuts
2010 Philippine television series endings
Filipino-language television shows
GMA Network original programming
Philippine vari
|
https://en.wikipedia.org/wiki/Stone%27s%20method
|
In numerical analysis, Stone's method, also known as the strongly implicit procedure or SIP, is an algorithm for solving a sparse linear system of equations. The method uses an incomplete LU decomposition, which approximates the exact LU decomposition, to get an iterative solution of the problem. The method is named after Harold S. Stone, who proposed it in 1968.
The LU decomposition is an excellent general-purpose linear equation solver. The biggest disadvantage is that it fails to take advantage of coefficient matrix to be a sparse matrix. The LU decomposition of a sparse matrix is usually not sparse, thus, for a large system of equations, LU decomposition may require a prohibitive amount of memory and number of arithmetical operations.
In the preconditioned iterative methods, if the preconditioner matrix M is a good approximation of coefficient matrix A then the convergence is faster. This brings one to idea of using approximate factorization LU of A as the iteration matrix M.
A version of incomplete lower-upper decomposition method was proposed by Stone in 1968. This method is designed for equation system arising from discretisation of partial differential equations and was firstly used for a pentadiagonal system of equations obtained while solving an elliptic partial differential equation in a two-dimensional space by a finite difference method. The LU approximate decomposition was looked in the same pentadiagonal form as the original matrix (three diagonals for L and three diagonals for U) as the best match of the seven possible equations for the five unknowns for each row of the matrix.
Algorithm
method stone is
For the linear system
calculate incomplete factorization of matrix
set a guess
while ( ) do
evaluate new right hand side
solve by forward substitution
solve by back substitution
end while
Footnotes
References
- the original article
Numerical linear algebra
Articles with example pseudocode
|
https://en.wikipedia.org/wiki/List%20of%20Vietnamese%20actors
|
This list includes actors of Vietnamese descent or nationality that have appeared in a full-length feature film or a television series broadcast on a national network. Although it includes some actors that have performed in films produced in Vietnam, it is not a comprehensive list of all Vietnamese actors who have performed in Vietnamese movies.
Notable actors
References
Vietnamese
Actors
|
https://en.wikipedia.org/wiki/Cyber%20Force%20%28comics%29
|
Cyber Force (sometimes stylized as CyberForce or CYBERFORCE) is a comic book series created by writer and artist Marc Silvestri in 1992 through his publishing studio, Top Cow Productions, and published by Image Comics.
Publication history
Volume 1
Cyber Force was first published as a mini-series in October 1992 by Image Comics in association with Malibu Comics. Created by and illustrated by Marc Silvestri, the series was written by his brother, Eric Silvestri: "When the guys at Image and I were starting out, we weren't really sure what the reaction would be to our characters. So, just to play it safe, we decided to put out our projects as mini-series to test out the public reaction".
The first story titled "Tin Men of War", follows Carin Taylor, a mutant otherwise known as Velocity as she attempts to escape the forces of Cyberdata, a corrupt mega-corporation. Her attempts to evade Cyberdata's task force, led by her sister, Cassandra Taylor aka "Ballistic" bring her into contact with the Cyber Force, a group of cybernetically enhanced mutant escapees from Cyberdata, consisting of Col. Stryker, Cyblade, Heatwave, Impact and Ripclaw. After Velocity is rescued, the team explains to her that they were created by Cyberdata to enhance their mutant abilities, turning them into super-soldiers known as S.H.O.C.s (Special Hazardous Operation Cyborgs), but they escaped and formed Cyber Force, making it their mission to bring down Cyberdata for good.
Volume 2
After high sales for the mini-series, an ongoing series was launched in October 1993 with the Cyber Force #0 one-shot, which contained a script and art by Walter Simonson based on a plot by Marc and Eric Silvestri. The new monthly series was published by Image through Silvestri's Top Cow Productions beginning in November 1993, running 35 issues. The series crossed over with Wild C.A.T.s for the "Killer Instinct" storyline spanning Wild C.A.T.S #5-7 and Cyber Force vol. 2 #1-3.
Silvestri later turned his duties over to other artists, including David Finch. The original comic book focused on a team of mutants who were captured by Cyberdata, an enormous corporation planning to take over the world. The mutants were experimented on and had their abilities enhanced with cybernetic implants in hopes of making them S.H.O.C.s (Special Hazardous Operations Cyborgs). The mutants subsequently escaped and banded together as Cyber Force, determined to defeat Cyberdata.
Volume 3
The series was revived in a third volume in 2006 (April-September) as a six issue limited series written by Ron Marz and drawn by Pat Lee titled Rising From the Ashes. This series continues with Ripclaw and Velocity's travel to Antartica to find a cure against a doomsday virus, which was created as a failsafe by Cyberdata to destroy all mutants. Along with dealing with the virus and greedy sailors, Velocity uncovers the true origin of Cyberdata while being brought to a long-crashed sentient alien ship inside a frozen cave. It is reve
|
https://en.wikipedia.org/wiki/Hayao%20Miyazaki%27s%20Daydream%20Data%20Notes
|
is the collective name for Hayao Miyazaki's annotated manga and illustrated essays he contributed, very sporadically, to the hobby magazine Model Graphix in the 1980s and early ’90s. The name has also been translated into English as Hayao Miyazaki's Random Thoughts Notebook. Game designer Kazuma Kujo stated in a 2012 Retro Gamer article that the book served as inspiration during development of Metal Slug.
Development
The Daydream Notes began as private sketches that can be traced back to Miyazaki's earliest childhood. Born in 1941 he, like war babies all over Europe, drew almost exclusively planes, tanks and battleships.
Media
Magazine
Installments of Daydream Notes were irregularly printed. Episodes occasionally appeared in the November 1984 through May 1990 issues of the monthly magazine Model Graphix.
Books
Selections from his Daydream Notes have been bundled in book form, published by Dainippon Kaiga in December 1992. In August 1997 a revised and expanded edition was released by the same publisher. The first edition does not contain Hikōtei Jidai.
The annotated manga is not included in either edition but appears in a different collection, , published, by Dainippon Kaiga, in August 2002.
Installments / Contents
Shirarezaru Kyojin no Mattei
Kōtetsu no Ikuji
Tahōtō no Deban
Noufu no Me
Ryū no Kōtetsu
Kyūshū Jōkū no Jūgōsakuki
Kōshahōtō
Q-ship
Anshōmaru Monogatari
London Jōkuu 1918-nen
Saihin Zensen
Hikōtei Jidai, an early version of Porco Rosso
Buta no Tora
Radio broadcast
In 1995, Miyazaki's Daydream Notes was turned into a series of radio broadcasts for Nippon Broadcasting System. When commenting on this dramatisation in an interview for Tokuma Shoten's Animage magazine, Miyazaki explains his political stance as an opponent of Japan's rearmament and contrasts this with his lifelong interests in war, military affairs and military hardware. He explains that he expresses this fascination by drawing the fantastical craft, which are then published in Model Graphix, a magazine for scale model creation. He said that he did his best drawings when he was serializing his manga Nausicaä, "After staying up till dawn drawing the last manga pages to meet the printer's deadline, I would draw these models the next day; each would take a week. […] In essence it is my hobby to draw seemingly real vehicles, it works as my psychological release valve."
Notes
References
Bibliography
.
.
External links
Comics by Hayao Miyazaki
|
https://en.wikipedia.org/wiki/Vongo%20%28video%20on%20demand%20service%29
|
Vongo was a video on demand service, owned by Liberty Media/The Weinstein Company's Starz Entertainment, parent company of the Starz network, that allowed users to download and view movies for a fixed price per month. As of August 1, 2008, Vongo stopped accepting new subscribers and was discontinued on September 30, 2008.
Service provided
"Vongo" was a service that allowed users to rent movies by download. It provided access to the Starz television channel, and contained a small library of movies. It also included a Pay Per View option. Starz Vongo had a small and growing selection of titles; more movies added weekly; satisfactory video quality; compatible with Portable Media Center 2.0 devices; some movies available with DVD-like bonus materials.
In October 2007, Starz Entertainment acquired Internet distribution rights for more than 100 feature films from Screen Media Ventures including films starring Will Ferrell, Angelina Jolie, Ralph Fiennes, Peter O'Toole and Mariel Hemingway.
The statistical make-up of Vongo video offerings during January 2008:
1526 titles provided
88% provided for download in portable format
9% provided in widescreen format
8% provided with a Pay-Per-View fee
By Genre: 40% Drama, 24% Comedy, 13% Action, 12% Westerns, 10% Music, 8% Family/Kids, 8% Romantic, 8% Sci-Fi/Horror (Note: same title can appear in multiple genres)
By Rating: 25% R, 17% TV14, 14% TVPG, 13% PG-13, 12% TVMA, 11% PG, 4% TVG, 3% G
53% are rated under the MPAA rating system
47% are rated for TV broadcast
Technical overview
Vongo used Adobe/Macromedia Flash software. The software was compatible with PCs running Windows XP or Vista and eventually supported Windows XP X64 and Vista X64 edition. Movies could be transferred and played on up to three devices but could not be transferred to external drives or other storage media.
Movies downloaded through Vongo were viewable within the confines of a certain time period; most newer movies were available for 4–6 months, while other programming could be as long as 12–24 months. Once a movie expired, it was automatically deleted from the user's hard drive. There was an average download time of 30 to 40 minutes on a 90-minute movie.
Vongo also ran inside Windows Media Center. Vongo films were then available on Microsoft's Xbox 360 and other Windows Media Center Extenders.
Vongo had a tiered support structure. Initial support was provided through the website through "Ask Vongo" which provided answers from the support knowledge base.
Criticism
Vongo was preinstalled on HP and Compaq computers during the time of its existence, and users found the program to be nearly impossible to remove without making registry edits. This difficulty has led to its classification as a virus by many users.
Vongo also tried to keep accessing the Internet every two minutes if it is blocked. When this was combined with design errors in the Symantec firewall, which did not support a "Block Always" choice, a user c
|
https://en.wikipedia.org/wiki/Windows%20Media%20Connect
|
Windows Media Connect (WMC) is a UPnP AV server from Microsoft for Windows XP and later Windows operating systems, to share and stream media on a Windows computer to WMC clients. The first two releases of WMC were made available as stand-alone software, and included a client as well. Following that, it was renamed to Home Media Ecosystem (HME) and the media server component was integrated into Windows Media Player and Windows Home Server. WMC version 2.0 can be manually installed on Windows Server 2008 or Windows Server 2008 R2 32bit or 64bit operating system but this type of installation is not officially supported by Microsoft and requires manual tweaking of NT Services' dependencies in order to run.
Version history
WMC 1.0 was originally released as an out-of-band update to Windows XP, which could stream only Windows Media files. Version 2.0 added support for UNC paths and removable devices as well as enhanced support for media formats, including ASF. Future versions were not released as stand-alone applications, but integrated into Windows Media Player, where it powers the Network Sharing Service feature. WMP 11 in Windows XP contains WMC 3.0, and in Windows Vista it contains WMC 4.0; the Windows Vista version of WMP 11 includes a WMC client as well. While WMC 3.0 and WMC 4.0 offer similar feature-set, they are built using different codebases. With WMP integration, WMC can make available the entire media library managed by WMP. When a shared library is browsed by the WMP client, it can be browsed, filtered and sorted like a regular WMP media library. On Windows XP by default, Windows Media Connect 2.0 does not work after Windows Media Player 11 has been installed, although Windows Media Player 11 only includes the UPnP AV server and does not include the client.
Overview
WMC is a UPnP AV server that can make media files stored on a computer available to UPnP AV-compatible digital media receiver clients over a local area network. WMC advertises itself to the clients, so there is no need to manually configure the client to connect to the WMC server. Multiple WMC instances can run at a time, all will be accessible to a client. Any UPnP AV client can be used to access WMC shared media. The client can query WMC for the list of files shared, the result of the query is formatted using XML. Once it chooses from the list the media to be played, the media file is streamed to the client for playing. Pictures are streamed using HTTP, different protocols are used for music and video. A client supporting the UPnP Media Renderer standard will be able to render the stream.
While any UPnP AV client can act as a client, using a dedicated WMC client, like the Xbox 360 and PlayStation 3, Zune music player, WMP 11 in Windows Vista or the WMC standalone client (available as part of WMC 2.0) can give an enhanced experience. The query results for the list of media contain certain metadata about the files as well, including media type, dates, rating, keywords for
|
https://en.wikipedia.org/wiki/Expressways%20of%20Shanghai
|
Shanghai has an expansive grade-separated highway and expressway network consisting of 16 municipal express roads, 10 provincial-level expressways, and 8 national-level expressways. Three municipal expressways and four provincial-level expressways are also under construction.
Municipal express roads
Most municipal express roads are found in the inner districts of Shanghai, including several elevated highways which run directly above surface-level roadways. In Chinese, these expressways are literally termed city high-speed roadways (), and their maximum speed is typically . These are still considered expressways or controlled-access highways because of the presence of ramps, grade-separated junctions, and the absence of traffic lights. Most of these expressways are elevated and run above a lower-speed roadway. The Inner Ring Road is a beltway, while the Middle Ring Road, once fully constructed, will also be a beltway.
Primary express roads
These are primary express roads that form a major backbone of expressways within the city core. Of these four, the Inner Ring, North–South, and Yan'an Elevated Roads form a 申 (a Chinese abbreviation for Shanghai) shape. The Middle Ring forms a second orbital surrounding the Inner Ring Elevated Road, but is not yet fully complete.
Auxiliary express roads
These are other express roads that serve as part of the municipal expressway network. Of these, six belong to the Hongqiao Comprehensive Transportation Hub, a network of municipal expressways serving Shanghai Hongqiao Railway Station and Shanghai Hongqiao International Airport.
Provincial expressways
Designations for provincial-level and federal-level expressways in Shanghai had the letter prefix A before the number of the expressway. Starting at the Yingbin Expressway, which was designated the number 1, the numbers increased clockwise around the city. For ring expressways, the designations A20, A30, A40, etc., were used. For expressways connecting to other provinces which already had national designations (beginning with the letter G), designations with the letter A were attached.
In August 2009, Shanghai replaced its system of naming expressways with the prefix A with the letter prefix S, in order to conform to the standard designations for provincial-level highways within China. The S means Shengdao, or provincial-level roads. The letter prefix A was abolished.
National expressways
National highways and expressways in Shanghai both have the prefix G, an abbreviation for Guodao (), which literally means National roads. It is important to note that both grade-separated, controlled-access expressways and normal at-grade highways both have the prefix G. Only the national-level expressways are mentioned here. National-highways which are at grade and not controlled-access are also found in Shanghai, and these include G204, G312, G318, and G320. Expressways also have green-coloured signs while their highway counterparts have red-coloured signs.
Yangtze Riv
|
https://en.wikipedia.org/wiki/Data%20transformation%20%28computing%29
|
In computing, data transformation is the process of converting data from one format or structure into another format or structure. It is a fundamental aspect of most data integration and data management tasks such as data wrangling, data warehousing, data integration and application integration.
Data transformation can be simple or complex based on the required changes to the data between the source (initial) data and the target (final) data. Data transformation is typically performed via a mixture of manual and automated steps. Tools and technologies used for data transformation can vary widely based on the format, structure, complexity, and volume of the data being transformed.
A master data recast is another form of data transformation where the entire database of data values is transformed or recast without extracting the data from the database. All data in a well designed database is directly or indirectly related to a limited set of master database tables by a network of foreign key constraints. Each foreign key constraint is dependent upon a unique database index from the parent database table. Therefore, when the proper master database table is recast with a different unique index, the directly and indirectly related data are also recast or restated. The directly and indirectly related data may also still be viewed in the original form since the original unique index still exists with the master data. Also, the database recast must be done in such a way as to not impact the applications architecture software.
When the data mapping is indirect via a mediating data model, the process is also called data mediation.
Data transformation process
Data transformation can be divided into the following steps, each applicable as needed based on the complexity of the transformation required.
Data discovery
Data mapping
Code generation
Code execution
Data review
These steps are often the focus of developers or technical data analysts who may use multiple specialized tools to perform their tasks.
The steps can be described as follows:
Data discovery is the first step in the data transformation process. Typically the data is profiled using profiling tools or sometimes using manually written profiling scripts to better understand the structure and characteristics of the data and decide how it needs to be transformed.
Data mapping is the process of defining how individual fields are mapped, modified, joined, filtered, aggregated etc. to produce the final desired output. Developers or technical data analysts traditionally perform data mapping since they work in the specific technologies to define the transformation rules (e.g. visual ETL tools, transformation languages).
Code generation is the process of generating executable code (e.g. SQL, Python, R, or other executable instructions) that will transform the data based on the desired and defined data mapping rules. Typically, the data transformation technologies generate this code base
|
https://en.wikipedia.org/wiki/Identity%20transform
|
The identity transform is a data transformation that copies the source data into the destination data without change.
The identity transformation is considered an essential process in creating a reusable transformation library. By creating a library of variations of the base identity transformation, a variety of data transformation filters can be easily maintained. These filters can be chained together in a format similar to UNIX shell pipes.
Examples of recursive transforms
The "copy with recursion" permits, changing little portions of code, produce entire new and different output, filtering or updating the input. Understanding the "identity by recursion" we can understand the filters.
Using XSLT
The most frequently cited example of the identity transform (for XSLT version 1.0) is the "copy.xsl" transform as expressed in XSLT. This transformation uses the xsl:copy command to perform the identity transformation:
<xsl:stylesheet version="1.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform">
<xsl:template match="@*|node()">
<xsl:copy>
<xsl:apply-templates select="@*|node()"/>
</xsl:copy>
</xsl:template>
</xsl:stylesheet>
This template works by matching all attributes (@*) and other nodes (node()), copying each node matched, then applying the identity transformation to all attributes and child nodes of the context node. This recursively descends the element tree and outputs all structures in the same structure they were found in the original file, within the limitations of what information is considered significant in the XPath data model. Since node() matches text, processing instructions, root, and comments, as well as elements, all XML nodes are copied.
A more explicit version of the identity transform is:
<xsl:stylesheet version="1.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform">
<xsl:template match="@*|*|processing-instruction()|comment()">
<xsl:copy>
<xsl:apply-templates select="*|@*|text()|processing-instruction()|comment()"/>
</xsl:copy>
</xsl:template>
</xsl:stylesheet>
This version is equivalent to the first, but explicitly enumerates the types of XML nodes that it will copy. Both versions copy data that is unnecessary for most XML usage (e.g., comments).
XSLT 3.0
XSLT 3.0 specifies an on-no-match attribute of the xsl:mode instruction that allows the identity transform to be declared rather than implemented as an explicit template rule. Specifically:
<xsl:stylesheet version="3.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform">
<xsl:mode on-no-match="shallow-copy" />
</xsl:stylesheet>
is essentially equivalent to the earlier template rules. See the XSLT 3.0 standard's description of shallow-copy for details.
Finally, note that markup details, such as the use of CDATA sections or the order of attributes, are not necessarily preserved in the output, since this information is not part of the XPath data model. To show CDATA markup in the output, the XSLT stylesheet that contains t
|
https://en.wikipedia.org/wiki/Arnold%20Lynch
|
Arnold Lynch (3 June 1914 – 13 November 2004) was an English engineer, known for his work on an optical tape reader which was used in the construction of the Colossus, the first electronic computer. By 1944 ten Colossus computers were installed at Bletchley Park and used to read high-level (Fish or Tunny) German ciphers.
Lynch joined the Post Office Research Station in 1936, specialising in the measurement of the electrical and magnetic properties of materials. He retired in 1974, but continued to come to work at NPL in the dielectric area of RF and microwave electromagnetism up to the year of his death.
The Maths, Art and Design Technology Department at Dame Alice Owen's School was named after Lynch, in thanks for his work during his time at the school and his success as a scientist.
He married Edith Taylor in 1953. Their children are Cedric Lynch and two daughters.
References
External links
Times Obituary
The Times February 01, 2005
1914 births
2004 deaths
Bletchley Park people
English electrical engineers
Scientists of the National Physical Laboratory (United Kingdom)
|
https://en.wikipedia.org/wiki/WLP
|
The initials WLP may stand for several things, such as the following:
Wafer-level packaging, a type of integrated circuit (microchip) packaging
Weakest liberal precondition, a computer programming concept
WebSphere Liberty Profile, a computer software version
Windows Logo Program, a Microsoft Windows branding and certification program
Women's Learning Partnership for Rights, Development, and Peace, an international non-profit, non-governmental organization that is dedicated to women's leadership and empowerment.
Wikileaks Party, an Australian political party
World Library Publications, A former major publisher of Catholic liturgical music in the United States, now a division of GIA Publications
|
https://en.wikipedia.org/wiki/Graffiti%20%28program%29
|
Graffiti is a computer program which makes conjectures in various subfields of mathematics (particularly graph theory) and chemistry, but can be adapted to other fields. It was written by Siemion Fajtlowicz and Ermelinda DeLaViña at the University of Houston. Research on conjectures produced by Graffiti has led to over 60 publications by other mathematicians.
References
External links
Graffiti & Automated Conjecture-Making
Siemion Fajtlowicz
Chemistry software
Mathematical software
|
https://en.wikipedia.org/wiki/Championship%20Manager%2093/94
|
Championship Manager 93/94 is the second installment in the Championship Manager series of football management computer games. It was released a year after the original Championship ManagerNew features
This game improved on the original in many ways - by far the most significant change was the use of real player names for the first time. This was the one major feature which the game had lacked in comparison to its rivals.
Other key features to be introduced in this game included the following:
A list of selected foreign-based players that could be bought
Much more in-match commentary
Injury time
More player awards
Eight different background pictures
Improved loading times
The implementation of the FA Premier League
Alternative versions
The CM93/94 engine was the basis for Championship Manager Italia. This was a version that simulated the top two divisions of Italian football (Serie A and Serie B). There was also a 1995 seasonal update released for this game.
The 1993/94 Season Data Up-Date Disk was a seasonal update disk that updated the game's database to reflect player and club changes for the 1993/94 season.
The End of 1994 Season Data Up-Date Disk was an end of season update disk that updated the game's database to reflect player and club changes for the end of 1993/94 season.
There was also a little-known Norwegian-language version called Championship Manager Norge or CM Norge which simulated the Norwegian League.
SalesChampionship Manager 93/94 and Championship Manager Italia sold a reported 90,000 collectively.
Trivia
The Championship Manager '94 - End of Season Data Disk'', which was available on the Amiga, contained two fictional players added by developers of the game, Mark Collis and Ferah Orosco. They were a striker and a defender, respectively, for Cambridge United in Division 3 and are regarded as the first ever fictional super-players in the CM series.
References
1993 video games
Amiga games
Domark games
DOS games
Multiplayer hotseat games
Association football management video games
Video games developed in the United Kingdom
|
https://en.wikipedia.org/wiki/The%20Family%20Channel
|
The Family Channel or Family Channel may refer to:
The Family Channel (American TV network, founded 1990), the third former name of Freeform
The Family Channel (American TV network, founded 2008), formerly My Family TV
The Family Channel (British TV channel), a British game show television channel now known as Challenge
Family Channel (Canadian TV channel), a Canadian premium children television channel
See also
Fox Family (disambiguation)
Freeform (disambiguation)
|
https://en.wikipedia.org/wiki/Format%20shifting
|
Format shifting is the conversion of media files into different file format or data compression (video coding format and audio coding format). This may be required to play the media on different devices, for example when converting or ripping audio files on CDs into digital formats such as MP3. Other media shifting processes include time shifting (also known as place shifting), a process whereby a radio or television broadcast is recorded to disk storage and played back at a different time, and space shifting where media is stored on one device and can be accessed from another place through another device which is normally located at another location.
Archiving and preservation
Format shifting is central to preservation and archiving, particularly for sound recordings and films. In addition to efforts to preserve works created in deteriorating formats format shifting is also necessary to keep works accessible. As technology develops the technical formats get outdated and the technology necessary for accessing original formats is no longer available. Copyright law of the United Kingdom does not allow libraries and archives to format shift for preservation and archiving purposes. By the time copyright term in a work ends the original work may have disintegrated or deteriorated to such an extent that the cost of preservation increases.
See also
Media server (Consumer)
Space shifting (also known as place shifting)
Time shifting
Copyright
Private copying
References
Copyright law
Digital rights
Ripping
|
https://en.wikipedia.org/wiki/Japan-US%20%28cable%20system%29
|
Japan-US (or Japan-US Cable Network – JUSCN or JUCN or J-US or JUS) is a submarine telecommunications cable system in the North Pacific Ocean linking the United States and Japan.
It has landing points in:
Shima, Mie Prefecture, Japan
Maruyama, Chiba Prefecture, Japan
Kitaibaraki, Ibaraki Prefecture, Japan
Mākaha, Oahu, Hawaii, United States
Point Arena, Manchester, Mendocino County, California, United States
Morro Bay, San Luis Obispo, San Luis Obispo County, California, United States
It has a design transmission capacity of 640 Gbit/s, starting operation at 80 Gbit/s and a total cable length of 21,000 km. It started operation in August 2001. It was upgraded to be capable of 1.28 Tbit/s operation in March 2008.
See also
References
Submarine communications cables in the Pacific Ocean
Mendocino County, California
Japan–United States relations
2001 establishments in California
2001 establishments in Hawaii
2001 establishments in Japan
|
https://en.wikipedia.org/wiki/Hopcroft
|
Hopcroft is a surname. Notable people with the surname include:
John Hopcroft (born 1939), American theoretical computer scientist
Ron Hopcroft (1918–2016), British ultrarunner
See also
Holcroft
Howcroft
|
https://en.wikipedia.org/wiki/Ivan%20Damg%C3%A5rd
|
Ivan Bjerre Damgård (born 1956) is a Danish cryptographer and currently a professor at the Department of Computer Science, Aarhus University, Denmark.
Academic background
In 1983, he obtained a master's degree in mathematics (with minors in music and computer science) at Aarhus University. He began his PhD studies in 1985 at the same university, and was for a period a guest researcher at CWI in Amsterdam in 1987. He earned his PhD degree in May, 1988, with the thesis Ubetinget beskyttelse i kryptografiske protokoller (Unconditional protection in cryptographic protocols) and has been employed at Aarhus University ever since. Damgård became full professor in 2005.
Research
Damgård co-invented the Merkle–Damgård construction, which is used in influential cryptographic hash functions such as SHA-2, SHA-1 and MD5. He discovered the structure independently of Ralph Merkle and published it in 1989.
Ivan Damgård is one of the founders of the Cryptomathic company. In 2010, he was selected as IACR Fellow.
In 2020, he received the Public Key Cryptography (PKC) conference Test of Time Award for the paper "A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System", which was published in PKC 2001 by Damgård and Jurik.
In 2021, Damgård received the ACM Symposium on Theory of Computing (STOC) Test of Time Award for the paper "Multiparty unconditionally secure protocols", which was published in STOC 1988 by Chaum, Crépeau, and Damgård.
References
External links
Home page of Ivan Damgård
A list of publications of Ivan Damgård
Danish scientists
Danish computer scientists
Modern cryptographers
Living people
1956 births
International Association for Cryptologic Research fellows
Academic staff of Aarhus University
|
https://en.wikipedia.org/wiki/Championship%20Manager%202
|
Championship Manager 2 is a football management computer game in the Sports Interactive's Championship Manager series. It was released in September 1995 for PC. An Amiga version was released in 1997.
New features
Championship Manager 2 introduced a far better quality of graphics compared to previous versions. The game included SVGA graphics and photorealistic background pictures. Possibly the most notable new feature was the audio commentary engine. As well as the traditional text-based match commentary, there was also optional voice commentary on CD ROM, provided by famous British football commentator Clive Tyldesley. The game greatly expanded the number of stats and tactical possibilities, and made transfers and contract negotiations more realistic, with the Bosman ruling included in future updates.
Another milestone was the inclusion of playable Scottish leagues, albeit only in the PC version. For the first time in the series there was a selection of leagues to choose from at the start of the game - only one could be run at a time, however.
Gameplay
In terms of the underlying gameplay, not a great deal had been changed since the original Championship Manager. The look and feel had been improved but it was still very much a text-based, menu-driven game and the user interface was almost identical to previous games, albeit at a much higher resolution.
Versions
Two new versions of Championship Manager 2 were later released allowing users to play leagues from across Europe. One version contained the Spanish, Belgian and Dutch leagues, the other contained French, German and Italian, leagues. Only one league could be run at a time but this was still a big milestone for the series and signalled the intent of Sports Interactive to expand the Championship Manager universe across the globe.
The Amiga port was developed by Sterling Games. The Amiga version did not include all the features of the PC version, including the Scottish League, international management, player histories and backgrounds). Furthermore, it could not be installed to a hard drive.
Reception
The new game brought critical reviews including 49% from PC Gamer who urged the series to "stop plastering its face with make-up" and "allow itself to be led quietly off to the old people's home, where it will be remembered kindly".
References
External links
Official Championship Manager website
- Information for the Amiga Version of CM2 and CM2 96/97
1995 video games
Amiga games
Domark games
Eidos Interactive games
Multiplayer hotseat games
Video game sequels
Windows games
Association football management video games
Video games developed in the United Kingdom
Multiplayer and single-player video games
|
https://en.wikipedia.org/wiki/Sphaerotheca%20%28frog%29
|
Sphaerotheca is a genus of true frogs. They can be found in South Asia. Molecular data suggest that they are closely related to Fejervarya, perhaps as a monophyletic group within a paraphyletic Fejervarya.
Species
There are currently 11 described species in Sphaerotheca:
Spaerotheca bengaluru
Sphaerotheca breviceps (Schneider, 1799)
Sphaerotheca dobsoni (Boulenger, 1882)
Sphaerotheca leucorhynchus (Rao, 1937)
Sphaerotheca magadha Prasad, Dinesh, Das, Swamy, Shinde, and Vishnu, 2019
Sphaerotheca maskeyi (Schleich and Anders, 1998)
Sphaerotheca pashchima Padhye, Dahanukar, Sulakhe, Dandekar, Limaye, and Jamdade, 2017
Sphaerotheca pluvialis (Jerdon, 1853)
Sphaerotheca rolandae (Dubois, 1983)
Sphaerotheca strachani (Murray, 1884)
Sphaerotheca swani (Myers and Leviton, 1956)
References
Dicroglossidae
Amphibian genera
Frogs of Asia
Taxa named by Albert Günther
|
https://en.wikipedia.org/wiki/Championship%20Manager%202006
|
Championship Manager 2006 is a computer game in Eidos' Championship Manager series. It is essentially a seasonal update for Championship Manager 5. The game was developed by Beautiful Game Studios (BGS) and was released on Windows on March 31, 2006.
Key features
Possibly the most anticipated new feature for CM 2006 is the updated "Gameplan" 3D match engine, which Eidos/BGS describe as a "3D representation of a football match" . It is not the FIFA/PES-style 3D match engine that some fans have been crying out for but it is another step along from the top-down 2D view. The developers have improved on CM5's single isometric view by promising 11 different camera angles to view the match from.
Player interaction has also been improved greatly, offering 32 different types of interaction - things such as player fines, homesickness and relationships with other players in the team.
The game also includes a more accurate and fully up-to-date database of players and clubs. It does not feature any additional playable leagues to the 26 found CM5, but while this will be a disappointment for some fans, the developers insist that this will help them to improve the quality of data found in the existing playable leagues.
Other versions
A handheld version of the game has been released for Sony's PlayStation Portable on April 7, 2006.
A console version developed by Gusto Games has been released on Xbox and PlayStation 2 in May 2006.
A mobile version of the game, Championship Manager 2006 Mobile was developed by BAFTA award-winning developer Dynamo Games
International update
On 2 June 2006, to tie in with the 2006 FIFA World Cup, an update pack was released on the Championship Manager website, for the PC. This pack fixed minor problems with the original release of the game, and also included a new mode, as never seen before since Beautiful Game Studios took over the series: International Management Mode. The mode allows players to take control of international teams, and take them through their international competitions, such as the world cup.
Glitches
Before the International Update, there were many glitches and problems in the game. A few players playing for Forest Green Rovers had extremely high attributes, but they were still worth only about £40,000. The most famous players were Alex Meechan and Bruno Teixeira. There was also another glitch that let the player buy players without paying wages, among others.
There are also several South American players whose value is far less than the statistics of the player when first bought.
On the Xbox version there are fake players on Manchester United, Chelsea F.C., Plymouth Argyle to name a few.
Some players, such as Cesar Daniel Caceres Canete and Danilo Belic, were the wrong age in the game. Canete started the game as an eight-year-old and Belic 14, meaning that they keep improving for several years.
Some player histories failed to show transfers and instead shows the player's whole career at the one club.
A
|
https://en.wikipedia.org/wiki/Face%20to%20Face%20%28Australian%20TV%20program%29
|
Face to Face was a Sunday morning political talk program. It first ran on Network Ten in August 1988 and was hosted by the then Political Editor Kerry O'Brien and produced by Chris Doig. The program was originally broadcast from the studios of CTC Canberra, ATV Melbourne and TEN Sydney – each with identical sets. Network Ten cancelled the program in 1989.
From 19 November 1995 and in 1999 Face to Face became a segment of Sunday Sunrise on the Seven Network.
In November 1995 assumed a format closer to its origins as a small-budget national political interview show, which featured an interview with a guest about the week's most important national issue. It aired late Sunday night (following the Sunday night movie) hosted by Neil Mercer.
In October 1996, the show moved to Sunday mornings and began screening live at , up against Network Ten's Meet the Press and the second half of Nine Network's Business Sunday. Guests were interviewed live in the studio, instead of pre-recording.
In 1997, Stan Grant became the host until mid year when Chris Bath took over. In 1998, Bath moved to Witness and Glenn Milne took over.
In 1999 it became a segment of Sunday Sunrise and ceased to be a stand-alone programme. During that year the segments changed from being live with Glenn Milne (flown to Sydney each every Sunday) to being a Friday night pre-record by Stan Grant.
References
Australian television news shows
Australian television talk shows
1995 Australian television series debuts
1998 Australian television series endings
|
https://en.wikipedia.org/wiki/The%20Times%20%28TV%20program%29
|
The Times is an Australian midweek current affairs program hosted by Paul Barry that was broadcast on the Seven Network. It aired from March 1994 until November 1995.
Overview
It began in March 1994 airing late night on Wednesdays, and included regular contributions from Neil Mercer, and Seven's senior Canberra reporter, Glenn Milne. The program later moved to Sunday nights where it would screen after the Sunday night movie, and then in August 1995 it moved to Tuesday nights.
Unlike most current affairs programs, The Times made heavy use of short cuts, subtitles and fast-paced music, resulting in an energetic style aimed at younger viewers.
It was axed in November 1995, but the program's staff moved on to work on the new 10:30 pm news bulletin hosted by Anne Fulwood.
See also
List of Australian television series
External links
The Times at the National Film and Sound Archive
1994 Australian television series debuts
1995 Australian television series endings
Australian non-fiction television series
Seven Network original programming
|
https://en.wikipedia.org/wiki/Novasports
|
Novasports is a Greek sports pay television network owned by Nova, a subsidiary of Greek telecommunications company of the same name. It was launched in 1994 as SuperSport and at the time was the first premium sports service in Greece. It is available exclusively on Nova, a DTH satellite service. It is available terrestrially and via satellite only on Nova.
Nova Sports covers most major national and international sports, such as first division soccer, the top leagues in Europe and around the world (EuroLeague basketball) and exclusive coverage of the EFL Cup. Nova Sports also broadcasts other sports such as volleyball and table tennis. Nova Sports also features extensive Tennis coverage.
Nova Sports 1 broadcasts on terrestrial television timeshifting with Nova Cinema 1 at night and earlier with Disney XD (children's channel) during the day. A decoder is required in order to receive the services as well as a monthly fee. Repeaters have been set up across the country that enables more than 77% of the population to receive these services. The multiplex channels (Nova Sports 2–7) are available only through Nova.
SuperSport era
From 1994 until 1 June 2008, Nova Sports was known as SuperSport.
The SuperSport brand is still prevalent in South Africa as the name is used thereby DStv which is a satellite television provider owned by MultiChoice South Africa, the previous owners of Greece's SuperSport as well.
Some events shown on Nova Sports are still taken directly from SuperSport (South Africa) broadcast feeds, complete with SuperSport logos and on-screen promotions. These normally include Golf and Rugby Union matches, and occasionally result in the second audio feed, which usually broadcasts English alongside Greek, broadcasting commentary in Afrikaans.
Channels and content
Novasports operates fourteen (14) multiplex channels, all of which are of 1080p (HD) quality:
Novasports News
Novasports Start
Novasports Prime
Novasports 1
Novasports 2
Novasports 3
Novasports 4
Novasports 5
Novasports 6
Novasports Premier League
Novasports Extra 1
Novasports Extra 2
Novasports Extra 3
Novasports Extra 4
Original programs
Time of the Champions - Football show covering Super League Greece with news, interviews, statistical analysis and highlights (pre- and postgame).
Playmakers - Basketball show covering EuroLeague Basketball with news, interviews, statistical analysis and highlights (pre- and postgame).
Monday Football Club (Monday FC) - Football show covering the reviews and highlights of past weekend matches (Super League, Premier League, LaLiga, Bundesliga, Ligue 1 and Eredivisie). The program is being aired on Monday nights. When it is shown in different weekdays, it is called ,,Novasports Football Club,, (Novasports FC).
Novasports Challenge - Mini interviews with former legends (players and coaches) of the Greek football championship.
Novasports Moments - Flashback moments from retro games of the Greek football championship that were left unattended
|
https://en.wikipedia.org/wiki/Two-way%20finite%20automaton
|
In computer science, in particular in automata theory, a two-way finite automaton is a finite automaton that is allowed to re-read its input.
Two-way deterministic finite automaton
A two-way deterministic finite automaton (2DFA) is an abstract machine, a generalized version of the deterministic finite automaton (DFA) which can revisit characters already processed. As in a DFA, there are a finite number of states with transitions between them based on the current character, but each transition is also labelled with a value indicating whether the machine will move its position in the input to the left, right, or stay at the same position. Equivalently, 2DFAs can be seen as read-only Turing machines with no work tape, only a read-only input tape.
2DFAs were introduced in a seminal 1959 paper by Rabin and Scott, who proved them to have equivalent power to one-way DFAs. That is, any formal language which can be recognized by a 2DFA can be recognized by a DFA which only examines and consumes each character in order. Since DFAs are obviously a special case of 2DFAs, this implies that both kinds of machines recognize precisely the class of regular languages. However, the equivalent DFA for a 2DFA may require exponentially many states, making 2DFAs a much more practical representation for algorithms for some common problems.
2DFAs are also equivalent to read-only Turing machines that use only a constant amount of space on their work tape, since any constant amount of information can be incorporated into the finite control state via a product construction (a state for each combination of work tape state and control state).
Formal description
Formally, a two-way deterministic finite automaton can be described by the following 8-tuple: where
is the finite, non-empty set of states
is the finite, non-empty set of input symbols
is the left endmarker
is the right endmarker
is the start state
is the end state
is the reject state
In addition, the following two conditions must also be satisfied:
For all
for some
for some
It says that there must be some transition possible when the pointer reaches either end of the input word.
For all symbols
It says that once the automaton reaches the accept or reject state, it stays in there forever and the pointer goes to the right most symbol and cycles there infinitely.
Two-way nondeterministic finite automaton
A two-way nondeterministic finite automaton (2NFA) may have multiple transitions defined in the same configuration. Its transition function is
.
Like a standard one-way NFA, a 2NFA accepts a string if at least one of the possible computations is accepting. Like the 2DFAs, the 2NFAs also accept only regular languages.
Two-way alternating finite automaton
A two-way alternating finite automaton (2AFA) is a two-way extension of an alternating finite automaton (AFA). Its state set is
where .
States in and are called existential resp. universal. In an existential state a 2A
|
https://en.wikipedia.org/wiki/Australian%20Payments%20Network
|
Australian Payments Network Limited (AusPayNet), formerly the Australian Payments Clearing Association (APCA) is the self-regulatory body set up by the payments industry to improve the safety, reliability, equity, convenience and efficiency of payment systems in Australia.
AusPayNet has over 140 members which include Australia's leading financial institutions, such as banks, building societies and credit unions, as well as major retailers and other service providers.
AusPayNet administers a number of payment systems in Australia. AusPayNet sets, manages and develops regulations, procedures and standards governing payments clearing and settlement within Australia. Payments systems covered by AusPayNet's rules include cheques, direct debits and credits, aspects of ATM and EFTPOS transactions, high value payments and the distribution of wholesale cash. Its role includes strategic direction and regulatory policy for the Australian payments system.
AusPayNet provides a venue for collaboration and cross-industry innovation on these issues and works closely with government, regulators, payments stakeholders and individuals to improve the payments system.
AusPayNet is also the official issuer and custodian of Bank State Branch (BSB) numbers, the bank code system used in Australia. AusPayNet assigns the bank code to a financial institution who then allocates the other digits, in line with guidelines set by AusPayNet. AusPayNet also manages the Magnetic ink character recognition (MICR) cheque encoding standards in Australia.
Objectives
The objective of AusPayNet is to improve the Australian payments system through:
enabling competition and innovation
promoting efficiency
controlling risk.
AusPayNet's roles include providing:
thought leadership and advocacy
industry collaboration
self-regulation
system-wide standards.
History
AusPayNet was called APCA when established on 18 February 1992 as a self-regulatory industry body charged with carrying forward the process of payments reform. In its early years, it focused on re-grouping payment services into distinct clearing systems and developing and managing rules and procedures for their day-to-day operation. In its next phase, the company took responsibility for managing projects and for contingency planning, certification and accreditation. These kinds of activities remain core business for AusPayNet.
It took over the regulation and management of the BSB system, which had been in operation since the 1970s. In 2017, the company celebrated its 25th anniversary as the payments industry's self-regulatory body and changed its name to Australian Payments Network (AusPayNet).
On 1 January 2014, it adopted a new Constitution designed to recognise the growing diversity of interests in payments arising from structural and technological change and to provide a more inclusive and representative association of the Australian payments system. The new Constitution opened AusPayNet membership to participant
|
https://en.wikipedia.org/wiki/Caller%20ID%20spoofing
|
Caller ID spoofing is a spoofing attack which causes the telephone network's Caller ID to indicate to the receiver of a call that the originator of the call is a station other than the true originating station. This can lead to a display showing a phone number different from that of the telephone from which the call was placed.
The term is commonly used to describe situations in which the motivation is considered malicious by the originator.
One effect of the widespread availability of Caller ID spoofing is that, as AARP published in 2019, "you can no longer trust call ID."
History
Caller ID spoofing has been available for years to people with a specialized digital connection to the telephone company, called an ISDN PRI circuit. Collection agencies, law-enforcement officials, and private investigators have used the practice, with varying degrees of legality. The first mainstream caller ID spoofing service was launched U.S.-wide on September 1, 2004 by California-based Star38.com. Founded by Jason Jepson, it was the first service to allow spoofed calls to be placed from a web interface. It stopped offering service in 2005, as a handful of similar sites were launched.
In August 2006, Paris Hilton was accused of using caller ID spoofing to break into a voicemail system that used caller ID for authentication. Caller ID spoofing also has been used in purchase scams on web sites such as Craigslist and eBay. The scamming caller claims to be calling from Canada into the U.S. with a legitimate interest in purchasing advertised items. Often the sellers are asked for personal information such as a copy of a registration title, etc., before the (scammer) purchaser invests the time and effort to come see the for-sale items. In the 2010 election, fake caller IDs of ambulance companies and hospitals were used in Missouri to get potential voters to answer the phone. In 2009, a vindictive Brooklyn wife spoofed the doctor's office of her husband's lover in an attempt to trick the other woman into taking medication which would make her miscarry.
Caller ID spoofing has been used for prank calls, sometimes with devastating consequences. In December 2007, a hacker used a caller ID spoofing service and was arrested for sending a SWAT team to a house of an unsuspecting victim. In February 2008, a Collegeville, Pennsylvania, man was arrested for making threatening phone calls to women and having their home numbers appear "on their caller ID to make it look like the call was coming from inside the house."
In March 2008, several residents in Wilmington, Delaware, reported receiving telemarketing calls during the early morning hours, when the caller had apparently spoofed the caller ID to evoke Tommy Tutone's 1981 hit "867-5309/Jenny". By 2014, an increase in illegal telemarketers displaying the victim's own number, either verbatim or with a few digits randomized, was observed as an attempt to evade caller ID-based blacklists.
In the Canadian federal election of Ma
|
https://en.wikipedia.org/wiki/Culligan
|
Culligan is a United States based global water treatment company with network of dealers and direct operations in 90 countries with 1,000 dealers, over 600 in North America alone, and more than 7,500 employees.
History
Culligan was founded in 1936 by Emmett Culligan. With $50 and with additional financing by his brother Dr. John M. Culligan, and his sister, Anna V. Culligan, Emmett established the Culligan Zeolite Company with his brothers Drs. John and Leo Culligan as partners. They started the business in Jack McLaughlin's Blacksmith Shop at Northbrook, Illinois. Emmett perforated the bottom of a coffee can and used greensand to make a water filter. Upon running water through his device, he discovered that the filter acted as a water softener. By 1938, the first Culligan franchised dealership opened in Wheaton, Illinois, followed by another in Hagerstown, Maryland. In 1945, Emmett dissolved the partnership with his brothers and a new company was incorporated. Emmett was president until 1950 when he became chairman of the board and Harold Werhane was made President. In 1962, the name was changed to Culligan, Incorporated. The company now has its international headquarters in Rosemont, Illinois. To date, there are more than 1,000 dealerships and business offices in over 90 countries. For further information refer to the company magazine, "Topics" of July, 1970. Later on, Beatrice Foods acquired the company.
In 1986, Beatrice Foods, newly acquired by Kohlberg Kravis Roberts, spun off its specialty foods and non-food brands as E-II Holdings. E-II attempted to take over American Brands in 1988. Instead, American Brands purchased E-II. American Brands later sold the majority of the E-II brands to Meshulam Riklis. Riklis soon left the company, and E-II filed for bankruptcy in 1992. After a takeover battle from Carl Icahn, E-II emerged from bankruptcy in 1993 under the name Astrum International. Culligan was spun off in 1995, and Astrum was renamed Samsonite.
Culligan was acquired by United States Filter in 1998. US Filter was acquired by Vivendi in 1999. Vivendi spun off its water business in 2000, and the resulting company, Veolia Environnement, sold Culligan to Clayton, Dubilier & Rice in 2003. In 2004, Entrepreneur Magazine named Culligan the number one franchise in its industry. In 2007, Culligan's headquarters relocated from Northbrook, IL to its current home in Rosemont, Illinois with the only state-of-the-art analytical laboratory certified by the State of Illinois Environmental Protection Agency to be compliant with National Environmental Laboratory Accreditation Conference standards, reflecting the company's commitment to advancements in water treatment. Centerbridge Partners acquired Culligan in 2012.
In 2021, during a bid to buy out the UK supermarket chain Morrisons, in a lawsuit, Culligans accused Clayton, Dubilier & Rice of Asset Stripping, leaving the firm 'saddled with over $850 million of debt', CD&R denied the accusations.
|
https://en.wikipedia.org/wiki/KUNP
|
KUNP (channel 16) is a television station licensed to La Grande, Oregon, United States, affiliated with the Spanish-language Univision network. It is owned by Sinclair Broadcast Group alongside Portland-based ABC affiliate KATU (channel 2). Both stations share studios on NE Sandy Boulevard in Portland, while KUNP's transmitter is located east of Cove atop Mount Fanny, within eastern Oregon's Wallowa–Whitman National Forest.
Because of the location of its transmitter facilities from Downtown Portland, KUNP's over-the-air signal is unable to reach Portland proper. To overcome this, its signal is relayed on a low-power translator station, KUNP-LD (channel 47), which serves the immediate Portland area from a transmitter on NW Willamette Stone Park Road (near NW Skyline Boulevard) in the Sylvan-Highlands section of Portland, along with cable and satellite coverage folded into KATU's retransmission consent agreements to cover the market, along with some outlying areas. It also previously relayed its signal via analog translator KABH-LP (channel 15) in Bend. KABH was owned by WatchTV, Inc., alongside its crosstown Portland HSN affiliate KORK-CA, but was operated by Sinclair under a local marketing agreement (LMA). KABH's license was canceled by the Federal Communications Commission (FCC) on March 19, 2015, for failure to file a license renewal application.
History
The station was founded on August 6, 1999, and formally signed on the air on December 3, 2001 as KBPD; it changed its call letters to KPOU on May 14, 2002. The call letters changed again to the current KUNP on December 15, 2006. KABH-LP was founded on June 1, 1992 as K15DO, but did not take to the air until November 3, 1993.
KUNP was originally owned by Equity Broadcasting Corporation; it was acquired by Fisher Communications on November 3, 2006, along with KUNS-TV in Seattle. Fisher would associate the two stations with the ABC affiliates it already owned in those markets, KATU and KOMO-TV. At one point, KUNP also had KKEI-CA as another translator prior to the Fisher acquisition. That station now serves Portland as a Telemundo affiliate. That station is also owned by WatchTV, Inc., owner of the now-defunct KABH-LP.
On August 21, 2012, Fisher Communications signed an affiliation agreement with MundoFox, a Spanish-language competitor to Univision that was owned as a joint venture between Fox International Channels and Colombian broadcaster RCN TV, for KUNP and Seattle sister station KUNS to be carried on both stations as digital subchannels starting in late September. On April 11, 2013, Fisher announced that it would sell its television and radio station properties, including KUNP, to the Sinclair Broadcast Group. The deal was completed on August 8, 2013. MundoFox would eventually rebrand as MundoMax in 2015 before ending all operations on December 1, 2016. This left KUNP-DT2 vacant until mid-February 2017, when it became a charter carrier of Sinclair's English language network TBD.
On M
|
https://en.wikipedia.org/wiki/City%20of%20Sydney%20Library
|
The City of Sydney Library network consists of nine branch libraries and two 'library links', located in Australia within the City of Sydney Council administrational area.
History
A free public lending library service has existed in Sydney since 1877 when the New South Wales state government opened a lending branch of the State Library of New South Wales on Macquarie Street. By the end of the same year there were over one thousand registered borrowers. In 1899 the lending library moved to the second floor of the Queen Victoria Building and in 1909 control passed from State to the City of Sydney Council. In 1918 the library moved again, this time to the old concert hall of the Queen Victoria Building. This provided space for a separate children's library to open in the same year. The first branch libraries opened in 1949 which also provided book deposit stations at a number of local schools. In 1970, the City library moved to yet larger premises within the Queen Victoria Building before taking up residence at 321 Pitt Street in 1984. High rent fees prompted it to move again in 1994 to Town Hall House. In 2005 the Town Hall branch moved to its current location at Customs House at Circular Quay.
Locations
Customs House - 31 Alfred St, Sydney NSW 2000
Glebe - 186 Glebe Point Rd, Glebe NSW 2037
Green Square - 355 Botany Rd, Zetland NSW 2017
Haymarket - The Exchange, levels 1 and 2, 1 Little Pier St, Haymarket NSW 2000
Kings Cross - 1/50-52 Darlinghurst Rd, Potts Point NSW 2011
Newtown - 8-10 Brown St, Newtown NSW 2042
Surry Hills - 405 Crown St, Surry Hills NSW 2010
Ultimo - Level 1, Ultimo Community Centre, 40 William Henry St, Ultimo NSW 2007
Waterloo - 770 Elizabeth St, Waterloo NSW 2017
Library Link
Town Hall House
Pyrmont
Collections and services
In addition to the network's collection of over 400,000 books the libraries provide for
the loan of CDs, DVDs, magazines, newspapers, toys and non-English books. The libraries also provide internet,
copying and printing services.
In the Sydney Subject Specialisation Scheme, a Sydney-wide collection development policy which facilitated interlibrary loans prior to computerised union catalogues, the City of Sydney Library maintained a focus on life sciences, engineering and French literature.
The City of Sydney library had a total stock of 461,253 items as of June 2015.
Library Link
A Library Link has existed in Town Hall House, close to the location of the library's previous premises, since its relocation to Customs House in 2005. The Library Link makes available a number of current newspapers and magazines, a fiction collection, a self-operated check-in and check-out machine and a telephone to contact library staff. Members can pick up books and other material held at other branches at the Library Link by contacting staff. In 2006 a link opened at Pyrmont offering a limited services. People are able to drop off books and pick up items they have asked for during the time that the volunteers
|
https://en.wikipedia.org/wiki/Saudi%20Payments%20Network
|
The Saudi Payments Network () or mada (, formerly SPAN) is the only and major payment system in the kingdom of Saudi Arabia established by Ministry of Finance under the supervision of Saudi Central Bank. It connects all ATM and Point of Sale (PoS) terminals throughout the country to a central payment switch which in turn re-routes the financial transactions to the card issuer (local bank, Visa, American Express or MasterCard). All banks in Saudi Arabia are required by the Saudi Central Bank (SAMA) to issue ATM cards fully compatible with the network. All services are provided to the customer free of charge, regardless of the ATM used, its operator, or the customer's card issuer.
Mada provides its services through over than 17,000 ATM machines and over 225,000 POS terminals in the Kingdom. In cooperation with global payment systems such as Visa, MasterCard, and Maestro, mada allows access to millions of ATMs and POS terminals worldwide.
The network has recently been upgraded to SPAN2 which is compliant with EMV standards and implements a higher capacity infrastructure and therefore less processing time, especially at POS terminals, resolving a major problem of the first generation SPAN system.
Member banks in the network
Al-Rajhi Bank
Al Bilad Bank
Arab National Bank
Bank AlJazira
Emirates International Bank
National Commercial Bank
Riyad Bank
SABB
AlAwal Bank
Banque Saudi Fransi
Saudi Investment Bank
Samba Financial Group
National Bank of Kuwait
Bank Muscat
National Bank of Bahrain
Alinma Bank
Gulf International Bank
See also
Smart card
Visa Inc.
American Express
MasterCard
References
External links
SPAN home page
Banks of Saudi Arabia
Interbank networks
Payment networks
|
https://en.wikipedia.org/wiki/Getsu%20F%C5%ABma%20Den
|
is an action role-playing video game developed and published by Konami for the Family Computer in 1987 exclusively in Japan. It has been referenced in many subsequent Konami titles throughout the years. The game is structurally similar to Castlevania II: Simon's Quest, The Goonies II and Teenage Mutant Ninja Turtles (NES).
A hack-and-slash "roguevania" sequel, titled Getsu Fūma Den: Undying Moon, was released on the Nintendo Switch on February 9, 2022 and left Early Access on Steam on February 17. A sequel titled Shin Getsu Fūma Den was planned for the PlayStation 2, but was cancelled.
Gameplay
The player controls Fūma, whose goal is to locate the three Pulse Blades that have been stolen from his clan in order to gain access to Ryūkotsuki's lair. Each of the Pulse Blades have been hidden away in the three neighboring islands surrounding Kyōki-tō, which are , and . Each of these islands requires Fūma to be in possession of a different .
The game starts off from an overhead view where the player guides Fūma to his next destination. When Fūma enters a gate, the game switches to a side-scrolling action scene where the player must go from one end of the area to the next while fending off enemies and avoiding pitfalls in the usual matter in order to return to the main field and proceed to the next scene. In addition to these action scenes, there are also small shrines featuring villagers who will provide hints to Fūma and shops where he can purchase new items and weapons using the money he has accumulated from defeated enemies. The player switches items by pausing the game during an action sequence and then pressing A to select a defensive item or B to change weapons. Experience points are accumulated by defeating enemies, which will fill out Fūma's sword gauge, increasing the strength of his attacks.
When the player reaches the main dungeon in each of the islands, the game switches to a pseudo-3D perspective which follows Fūma from behind. The player must proceed through a labyrinth in order to reach the boss holding one of the Pulse Swords. Each labyrinth is filled with numerous enemies who will confront Fūma, along with allies who will provide him with hints and helpful items. A candle is required to light these labyrinths, as well as a compass which shows Fūma's current direction. When the player reaches the boss's lair, the game switches back to a side-scrolling perspective before the actual confrontation.
The game uses a lives system like most action games. The player loses a life when he runs out of health or falls into a pitfall. When the player runs out of lives, he can continue from where he left off or quit and resume at a later point using a password. The player is penalized by having his money reduced by half.
Plot
In the distant future of 14672 A.D., the first year of the , the demon lord escaped from hell and plotted to conquer the surface world ruled by the . The Getsu brothers fought against Ryūkotsuki, each wielding one of the
|
https://en.wikipedia.org/wiki/Javier%20Santiso
|
Javier Santiso is the CEO and General Partner of Mundi Ventures www.mundiventures.com, an international 450M VC fund, based in Madrid. He invests in deep tech companies, IoT, cyber, AI, industrial internet and also insurtech and fintech in Europe & USA, in Paris, London, Berlin, Amsterdam, Stockholm, Madrid, Barcelona, Tel Aviv and also New York, Palo Alto, Singapore. He run in the past the tech investments of Khazanah, the US$50 billion Asian sovereign fund, and invested in multi billion tech unicorns like Farfetch (London, a startup exited and listed in the Nasdaq), Skyscanner (Edinburgh, a startup also exited and bought by Ctrip) and others like Auto1 (Berlin, now listed in Francfort). He is an independent board member of Paris Based listed company FNAC Darty and also a member of the board of Madrid based Prisa, the owner or El Pais, La Ser and Santillana. He invested in a dozen of unicorns included Wefox in Berlin, Bolttech in Singapore, Shift Technology in Paris, Job&Talent in Madrid or Betterfly in Santiago de Chile.
He is a Young Global Leader (YGL) of the World Economic Forum (Davos), and founder of the Club Mundi, a +750 network of Spanish and Foreign executives both working abroad and in Spanish multinationals or foreigners linkedin with Spain. Formerly he has been also managing director at Telefónica where he worked with the current chairman, José María Alvarez Pallete and set up the venture capital fund of funds (Amerigo, 400M Euros), worked on Wayra, the startup accelerators network worldwide and created Talentum, the hackers program. He is the Founder of Start Up Spain, the leading platform on startups and ventures powered in cooperation with Rafael del Pino Foundation. He is also interested in the interactions between artificial intelligence and emotional intelligence and plans a Forum where corporate leaders, startups founders and visual artists will be brought together, around art & technology.
Javier holds both Spanish and French nationalities,. He is a leading economist on emerging markets, startups and venture capitals. He has authored several books (listed below) and papers published in leading referee journals and edited books published by Columbia University Press, Oxford University Press or Routledge. He is a member of the World Economic Forum Global Council on Latin America. In 2011 he was named as one of the most influential iberoamerican thinkers by Foreign Policy. He has been professor at Johns Hopkins University (Washington), Sciences Po (Paris), ESADE Business School (Barcelona) and IE Business School (Madrid).
In 2010, he joined Telefónica International as a Director where he is charge of the strategy and development of Latin American Innovation Funds focused on Venture Capital and Growth Capital. He later became Director of Innovation Funds at Telefónica SA; managing director of Telefónica Europe Chairman's & CEO Office; and managing director of Global Affairs and New Ventures. He also joined ESADE Business Scho
|
https://en.wikipedia.org/wiki/Canadian%20Environmental%20Network
|
The Canadian Environmental Network (RCEN) is an umbrella organization for environmental non-governmental organizations (ENGOs) located across Canada. This non-profit organization was mainly funded by Environment Canada and helped to facilitate networking and communication between environmental organizations, and coordinate ENGO participation in consultations with government. A portion of the funding flowed through to affiliated provincial environmental networks before it was cancelled in 2011. The RCEN also works to educate the public on major issues and policy-making in regards to the environment.
The RCEN is independent and non-partisan, which means it does not take positions on environmental issues, although its members do. It was established in 1977 by six environmental organizations, and today connects more than 700 ENGOs through its eleven regional networks. The Manitoba Eco-Network is an example of one of the provincial umbrella groups in the network that have members from only that province.
Organization
The RCEN facilitates and promotes sharing of knowledge, resources and collaborative efforts to influence domestic and international practices, policies, laws and agreements affecting the environment. An annual general meeting is held each year to elect a governing board of directors and national council which represent the network's diverse membership. A Conference on the Environment is also organized to allow staff, members from all the regional networks and the public to meet, plan and discuss environmental issues. This increases public participation in the democratic process and to helps Canadian citizens communicate more effectively with the federal government.
Several national caucus groups allow individual members to work collaboratively on issues. These caucuses also choose delegates to participate in government consultations
through a transparent democratic selection process.
Goals
The organization's principal mandate is to Protect the Earth and Promote Ecologically Sound Ways of Life by helping its member groups preserve and protect the natural beauty, diversity, habitats, landscapes, regions, forests, ecological integrity, quality of water, quality of air and health of all species and their interdependent relationships.
References
External links
RCEN website
Environmental organizations based in Ontario
Non-profit organizations based in Ottawa
|
https://en.wikipedia.org/wiki/B.A.T.%20II%20%E2%80%93%20The%20Koshan%20Conspiracy
|
B.A.T. II – The Koshan Conspiracy is a futuristic point and click adventure game written by Computer's Dream and published by Ubi Soft in 1992. It is the sequel to the 1990 game B.A.T.
It is a futuristic role-playing game in which the player explores the city, talks to non-player characters, tries to solve puzzles, travels to new cities by use of a mini-game, buys weapons and ammo, engages in fire fights (also by way of a mini-game), buys a spaceship, and enters space. The player can even re-wire a wrist computer (B.O.B) in the game to perform different functions. It has a very open, non-linear play style.
The Amiga and Atari ST versions shipped with a physical dongle to prevent piracy.
The box art was painted by Luis Royo.
Reception
Computer Gaming World stated that Koshan "was clearly a superior product" to its predecessor, with a much larger game world and both strategic and action combat options. The magazine concluded that it was "an enormous game, offering a richly textured, futuristic gameworld that gamers can find themselves easily drawn into".
References
External links
1992 video games
Adventure games
Amiga games
Atari ST games
DOS games
Video game sequels
Cyberpunk video games
Video games developed in France
Ubisoft games
Single-player video games
|
https://en.wikipedia.org/wiki/Third%20World%20Resurgence
|
Third World Resurgence is the flagship magazine of Third World Network, an international network of organizations and individuals involved in issues relating to environment, development and the Third World and North-South issues. The magazine was started in 1990. According to their website, the aim of the magazine is to give a Third World perspective to the whole range of issues confronting the Third World namely, the environment, health and basic needs, international affairs, politics, economics, culture, and so on. The magazine is published on a monthly basis and is headquartered in Penang, Malaysia. It has also a Spanish version.
References
External links
Website of Third World Resurgence
WorldCat record
1990 establishments in Malaysia
English-language magazines
Magazines established in 1990
Magazines published in Malaysia
Monthly magazines
Political magazines
Spanish-language magazines
Political magazines published in Malaysia
|
https://en.wikipedia.org/wiki/Terry%20Meeuwsen
|
Terry Anne Meeuwsen Friedrich (born March 2, 1949) is an American television personality, co-host of the Christian Broadcasting Network (CBN)'s 700 Club, author and singer. Meeuwsen is the founder of Orphan’s Promise, a philanthropic organization leading charity efforts for orphans, especially advocating for help in Ukraine.
Meeuwsen was the 1972 Miss Appleton, 1972 Miss Wisconsin and the winner of the Miss America pageant in 1973, taking both the talent and swimsuit competitions. She was the first Miss Wisconsin delegate to hold the Miss America title.
Early life
Meeuwsen was born in 1949 in Green Bay, Wisconsin to Joseph and Beverly (née Anderson). She was the eldest of four children. Her father worked for the Wisconsin Public Service Corporation, while her mother worked for the Wisconsin Telephone Company in her early years then worked until retirement for the Superintendent of Schools.
At De Pere High School, Meeuwsen was selected homecoming queen, and was also a cheerleader for three years. She enrolled at the private liberal arts college, St. Norbert College in fall of 1967. She studied music and drama, but didn’t earn a degree. Between 1969 and 1971, Meeuwsen performed and traveled with the singing group The New Christy Minstrels, but left the group to enter the Miss America pageant preliminary competitions.
After winning the 1972 Miss Appleton and 1972 Miss Wisconsin competitions, Meeuwsen competed in the 1973 Miss America Competition. A fellow competitor included Cynthia Sikes (Miss Kansas; known at the time as Cindy Lee Sikes), who would later become an actress, starring on the NBC medical drama St. Elsewhere. Meeuwsen also competed against Jane Badler, who would become an actress on the 1983 science-fiction miniseries, V. During the competition, Meeuwsen won both the Lifestyle and Fitness and Talent awards, before ultimately winning the title of Miss America 1973.
Career
Early career
Following her reign as Miss America, Meeuwsen began television work at WTMJ-TV in Milwaukee in 1978, co-hosting (with Pete Wilson) a daily morning news and feature program, "A New Day." She left the station in 1986.
Christian Broadcasting Network
In 1981, Meeuwsen accepted a position at The Christian Broadcasting Network (CBN) in Virginia Beach, VA, as co-host of United States Mornings ("USAM"), a proposed news and features program, with veteran newsman Brian Christie joining her as co-host. The 30-minute daily morning show was sold to network affiliates (ABC, CBS, NBC) for access via satellite as a lead-in to their popular morning network shows. (At the time, affiliates typically aired color bars from the previous night's sign-off until the morning network feed began; offering high-profile personality programming to early morning viewers soon led to networks developing their own proprietary lead-ins.)
After appearing on The 700 Club several times in the late 1980s and early 1990s as a guest co-host, she became a permanent co-host in 1993, sittin
|
https://en.wikipedia.org/wiki/HSTCP
|
HighSpeed TCP (HSTCP) is a congestion control algorithm protocol defined in RFC 3649 for Transport Control Protocol (TCP). Standard TCP performs poorly in networks with a large bandwidth-delay product. It is unable to fully utilize available bandwidth. HSTCP makes minor modifications to standard TCP's congestion control mechanism to overcome this limitation.
Algorithm
When an ACK is received (in congestion avoidance), the window is increased by and when a loss is detected through triple duplicate acknowledgments, the window equals , where w is the current window size. When the congestion window is small, HSTCP behaves exactly like standard TCP so a(w) is 1 and b(w) is 0.5. When TCP's congestion window is beyond a certain threshold, a(w) and b(w) become functions of the current window size. In this region, as the congestion window increases, the value of a(w) increases and the value of b(w) decreases. This means that HSTCP's window will grow faster than standard TCP and also recover from losses more quickly. This behavior allows HSTCP to be friendly to standard TCP flows in normal networks and also to quickly utilize available bandwidth in networks with large bandwidth delay products.
HSTCP has the same slow start/timeout behavior as standard TCP.
Since only the congestion control mechanism is modified, HSTCP can be used with other TCP options like SACK. In real implementations, determining the increase and decrease parameters given a current window size is implemented as a lookup table.
See also
TCP congestion avoidance algorithm
Transmission Control Protocol#Development of TCP
References
External links
HSTCP Home Page.
TCP congestion control
|
https://en.wikipedia.org/wiki/Windows%20Image%20Acquisition
|
Windows Image Acquisition (WIA; sometimes also called Windows Imaging Architecture) is a proprietary Microsoft driver model and application programming interface (API) for Microsoft Windows Me and later Windows operating systems that enables graphics software to communicate with imaging hardware such as scanners, digital cameras, and digital video equipment. It was first introduced in 2000 as part of Windows Me, and continues to be the standard imaging device and API model through successive Windows versions. It is implemented as an on-demand service in Windows XP and later Windows operating systems.
Overview
WIA is a very significant superset of the support for digital still imaging drivers that was provided by the Still Image Architecture (STI) in Windows 98. Whereas STI only provided a low-level interface for doing basic transfers of data to and from the device (as well as the invocation of an image scan process on the Windows machine through the external device), WIA provides a framework through which a device can present its unique capabilities to the operating system, and applications can invoke those features.
According to Microsoft, WIA drivers are made up of a user interface (UI) component and a driver core component, loaded into two different process spaces: UI in the application space and the driver core in the WIA service space.
Certain scanners support WIA.
Additional information
In 2002, Microsoft released the Windows Image Acquisition Automation Library Tool, which provides access to WIA functionality through programming languages and scripting environments that support OLE Automation.
In Windows XP, WIA runs in the LocalSystem context. Because of the security ramifications of running a service as LocalSystem whereby a buggy driver or malicious person would have unrestricted access to the system, the WIA service in Windows Server 2003 and Windows Vista operates in the LocalService context. This can result in compatibility issues when using a driver designed for Windows XP.
In Windows XP, support was added for automatic document feeder scanners, scroll-feed scanners without preview capabilities and multi-page TIFF generation. For WIA video, a snapshot filter driver is introduced that allows still frames to be captured from the video stream.
Windows Vista introduced Windows Image Acquisition 2.0. Windows Vista also has the WIA Automation library built-in. WIA2 supports push scanning and multi-image scanning. Push scanning allows initiating scans and adjusting scanning parameters directly from the scanner control panel. Multi-image scanning allows one to scan several images at once and save them directly as separate files. However, video content support is removed from WIA for Windows Vista.
Applications that use WIA
Photoshop
Paint.net
ACDSee
Chasys Draw IES
IrfanView
FastStone Image Viewer
Naps2 (Not Another PDF Scanner 2)
ORPALIS PaperScan
ScanSnap Home
ScanSnap Manager
Windows Scanner and Camera Wizard
Serif Phot
|
https://en.wikipedia.org/wiki/Packet%20loss%20concealment
|
Packet loss concealment (PLC) is a technique to mask the effects of packet loss in voice over IP (VoIP) communications. When the voice signal is sent as VoIP packets on an IP network, the packets may (and likely will) travel different routes. A packet therefore might arrive very late, might be corrupted, or simply might not arrive at all. One example case of the last situation could be, when a packet is rejected by a server which has a full buffer and cannot accept any more data. Other cases include network congestion resulting in significant delay. In a VoIP connection, error-control techniques such as automatic repeat request (ARQ) are not feasible and the receiver should be able to cope with packet loss. Packet loss concealment is the inclusion in a design of methodologies for accounting for and compensating for the loss of voice packets.
PLC techniques
Zero insertion: the lost speech frames are replaced with silence.
Waveform substitution: the missing gap is reconstructed by repeating a portion of already received speech. The simplest form of this would be to repeat the last received frame. Other techniques account for fundamental frequency, gap duration etc. Waveform substitution methods are popular because of their simplicity to understand and implement. An example of such an algorithm is proposed in International Telecommunication Union (ITU) recommendation G.711 Appendix I.
Model-based methods: algorithms that take advantage of speech models of interpolating and extrapolating speech gaps have been introduced and developed.
Use
PLC is used with the codecs Internet Low Bitrate Codec (iLBC) and SILK in Skype, in Jitsi with the SILK and Opus codecs, and in the pjsip stack used by CSipSimple. Google Duo uses WaveNetEQ, a generative model based on DeepMind/Google AI’s WaveRNN.
See also
Error concealment
References
External links
VoIP Troubleshooter: Packet Loss Concealment
Voice over IP
|
https://en.wikipedia.org/wiki/Federal%20Office%20for%20Information%20Security
|
The Federal Office for Information Security (, abbreviated as BSI) is the German upper-level federal agency in charge of managing computer and communication security for the German government. Its areas of expertise and responsibility include the security of computer applications, critical infrastructure protection, Internet security, cryptography, counter eavesdropping, certification of security products and the accreditation of security test laboratories. It is located in Bonn and as of 2020 has about 1,100 employees. Its current president, since 1 February 2016, is former business executive Arne Schönbohm, who took over the presidency from Michael Hange.
BSI's predecessor was the cryptographic department of Germany's foreign intelligence agency (BND). BSI still designs cryptographic algorithms such as the Libelle cipher and initiated the development of the Gpg4win cryptographic suite.
Similar agencies
The BSI has a similar role as the
Computer Security Division (CSD) of Information Technology Laboratory (ITL) of NIST (United States)
CESG (United Kingdom)
National Cybersecurity Institute (INCIBE) (Spain)
Unlike those organizations, BSI is focused on IT security rather than being part of an organisation with a more general IT standards remit. BSI is separate from Germany's signals intelligence, which is part of the military and the foreign intelligence service (BND).
Responsibilities
The BSI's scope of duties is defined by the German Federal Office for Information Security (BSI Act). The aim of the BSI is the promotion of information and cyber security in order to enable and promote the use of secure information and communication technology in government, business and society. For example, the BSI develops practice-oriented minimum standards and target group-specific recommendations for handling IT and Internet security.
The BSI is also responsible for protecting the IT systems of the federal government. This involves defending against cyber attacks and other technical threats against the IT systems and networks of the federal administration. Once a year, the BSI reports on this to the Committee on Internal Affairs of the German Bundestag.
The tasks of the BSI include:
Protection of federal networks, detection and defense of attacks on government networks
Testing, certification and accreditation of IT products and services
Warning of malware or security holes in IT products and services
IT security consulting for the federal administration and other target groups
Information and raising awareness of the public and the economy on IT and Internet security
Development of uniform and binding IT security standards
Development of cryptographic systems for the federal IT
The BSI is the central certification body for the security of IT systems in Germany (computer and data security, data protection). Testing and certification is possible with regard to the standards of the IT-Grundschutzhandbuch, the Green Book, ITSEC and the Common Cri
|
https://en.wikipedia.org/wiki/Java%20annotation
|
In the Java computer programming language, an annotation is a form of syntactic metadata that can be added to Java source code. Classes, methods, variables, parameters and Java packages may be annotated. Like Javadoc tags, Java annotations can be read from source files. Unlike Javadoc tags, Java annotations can also be embedded in and read from Java class files generated by the Java compiler. This allows annotations to be retained by the Java virtual machine at run-time and read via reflection. It is possible to create meta-annotations out of the existing ones in Java.
History
The Java platform has various ad-hoc annotation mechanisms—for example, the transient modifier, or the @Deprecated javadoc tag. The Java Specification Request JSR-175 introduced the general-purpose annotation (also known as metadata) facility to the Java Community Process in 2002; it gained approval in September 2004.
Annotations became available in the language itself beginning with version 1.5 of the Java Development Kit (JDK). The apt tool provided a provisional interface for compile-time annotation processing in JDK version 1.5; JSR-269 formalized this, and it became integrated into the javac compiler in version 1.6.
Built-in annotations
Java defines a set of annotations that are built into the language. Of the seven standard annotations, three are part of java.lang, and the remaining four are imported from java.lang.annotation.
Annotations applied to Java code:
@Override - Checks that the method is an override. Causes a compilation error if the method is not found in one of the parent classes or implemented interfaces.
@Deprecated - Marks the method as obsolete. Causes a compile warning if the method is used.
@SuppressWarnings - Instructs the compiler to suppress the compile time warnings specified in the annotation parameters.
Annotations applied to other annotations (also known as "Meta Annotations"):
@Retention - Specifies how the marked annotation is stored, whether in code only, compiled into the class, or available at runtime through reflection.
@Documented - Marks another annotation for inclusion in the documentation.
@Target - Marks another annotation to restrict what kind of Java elements the annotation may be applied to.
@Inherited - Marks another annotation to be inherited to subclasses of annotated class (by default annotations are not inherited by subclasses).
Since Java 7, three additional annotations have been added to the language.
@SafeVarargs - Suppress warnings for all callers of a method or constructor with a generics varargs parameter, since Java 7.
@FunctionalInterface - Specifies that the type declaration is intended to be a functional interface, since Java 8.
@Repeatable - Specifies that the annotation can be applied more than once to the same declaration, since Java 8.
Example
Built-in annotations
This example demonstrates the use of the @Override annotation. It instructs the compiler to check parent classes for matchi
|
https://en.wikipedia.org/wiki/Monte%20Carlo%20localization
|
Monte Carlo localization (MCL), also known as particle filter localization, is an algorithm for robots to localize using a particle filter. Given a map of the environment, the algorithm estimates the position and orientation of a robot as it moves and senses the environment. The algorithm uses a particle filter to represent the distribution of likely states, with each particle representing a possible state, i.e., a hypothesis of where the robot is. The algorithm typically starts with a uniform random distribution of particles over the configuration space, meaning the robot has no information about where it is and assumes it is equally likely to be at any point in space. Whenever the robot moves, it shifts the particles to predict its new state after the movement. Whenever the robot senses something, the particles are resampled based on recursive Bayesian estimation, i.e., how well the actual sensed data correlate with the predicted state. Ultimately, the particles should converge towards the actual position of the robot.
Basic description
Consider a robot with an internal map of its environment. When the robot moves around, it needs to know where it is within this map. Determining its location and rotation (more generally, the pose) by using its sensor observations is known as robot localization.
Because the robot may not always behave in a perfectly predictable way, it generates many random guesses of where it is going to be next. These guesses are known as particles. Each particle contains a full description of a possible future state. When the robot observes the environment, it discards particles inconsistent with this observation, and generates more particles close to those that appear consistent. In the end, hopefully most particles converge to where the robot actually is.
State representation
The state of the robot depends on the application and design. For example, the state of a typical 2D robot may consist of a tuple for position and orientation . For a robotic arm with 10 joints, it may be a tuple containing the angle at each joint: .
The belief, which is the robot's estimate of its current state, is a probability density function distributed over the state space. In the MCL algorithm, the belief at a time is represented by a set of particles . Each particle contains a state, and can thus be considered a hypothesis of the robot's state. Regions in the state space with many particles correspond to a greater probability that the robot will be there—and regions with few particles are unlikely to be where the robot is.
The algorithm assumes the Markov property that the current state's probability distribution depends only on the previous state (and not any ones before that), i.e., depends only on . This only works if the environment is static and does not change with time. Typically, on start up, the robot has no information on its current pose so the particles are uniformly distributed over the configuration space.
Overview
Giv
|
https://en.wikipedia.org/wiki/Link%20Access%20Procedure%20for%20Modems
|
Link Access Procedure for Modems (LAPM) is part of the V.42 error correction protocol for modems.
LAPM is an error control protocol defined in ITU-T recommendations V.42. Like many data link layer protocols, it is a variant of HDLC. Like the Microcom Networking Protocols that preceded it, LAPM uses cyclic redundancy checking (CRC) and retransmission of corrupted data (ARQ) to ensure data reliability.
Error control protocols such as LAPM use frames of variable lengths, each beginning with a header and ending with a frame check sequence trailer (a cyclic redundancy check). Correctly received packets are acknowledged, and unacknowledged packets are automatically retransmitted (ARQ).
The larger the payload included in each frame, the smaller the relative cost of transmitting the header and trailer bits. Usually LAPM adds only about 5 percent framing overhead. This is a noticeable improvement over the fixed 25% overhead of start and stop bits required by direct asynchronous serial communication, but obviously such large frames impose a cost in the form of communication latency.
LAPM has an optional Selective reject (SREJ) functionality which allows it to resend only the corrupted frames, providing faster recovery from an error.
The ITU-T V.42 LAPM procedure is considered more robust than the Microcom Networking Protocols (MNP) that preceded it, and has a more sophisticated and powerful data compression option in V.42bis, allowing much greater data throughput.
ITU-T V.42bis added a string compression algorithm called BTLZ (British Telecom Lempel Ziv), in which frequently occurring strings of characters are replaced by code words. The "dictionary" of strings is dynamically maintained during transmission and keeps track of changes in the data; new strings are added and old strings are deleted. As the data may not always be compressible (for example encrypted or pre-compressed data) the modem has the ability to switch between compressed and uncompressed modes of operation. Compression performance is continually monitored and, if no compression is obtained, the modem transmits the data in uncompressed form. Even while in uncompressed mode, the modem monitors the characteristics of the data and switches compression back on as soon as some benefit can be achieved.
See also
Point-to-Point Protocol (PPP)
References
Modems
Link access protocols
|
https://en.wikipedia.org/wiki/Ledberg%20stone
|
The Ledberg stone, designated as Ög 181 under Rundata, is an image-stone and runestone located in Östergötland, Sweden.
Description
The Ledberg stone is a partially surviving runestone, similar to Thorwald's Cross. It features a figure with his foot at the mouth of a four-legged beast, below which lies a legless, helmeted man, with his arms in a prostrate position. This is thought to be a depiction of Odin being devoured by the wolf Fenrir at Ragnarök, the final battle in Norse mythology, in which several gods meet their death. The battle and death of Odin are described in the poem Völuspá from the Poetic Edda.
Some scholars, however, believe that the images of the Ledberg stone depict the final story of either Þorgautr or Gunna, who are memorialized in the runic inscription. If the images are followed in the same order as the runes are written, they seem to create a chronological account. The first image is of a ship; this depicts a journey abroad. Next, there is a figure walking to the left, carrying what is most likely a shield, in preparation for departure. In the third image, the figure is carrying weapons and a shield to the right, probably marching to battle. At the top of the second side of the stone, the figure's foot is being bitten by a wolf and finally, we see the figure legless with arms sprawled, likely lying dead on the battlefield. Wolves were often used in Viking art and poetry to signify combat, so it is thought to be unlikely that the figure fell in battle due to wounds caused by a wolf.
The warrior figures have shields, one carries a spear, and all have moustaches and beards, except for the Odin figure. The helmets are conical and similar in shape to those shown on the Bayeux Tapestry.
Inscription
The runic inscription of the Ledberg stone is carved in the Younger futhark, and is dated to the 11th century. It reads:
§A ᛒᛁᛋᛁ ᛬ ᛋᛅᛏᛁ ᛬ ᛋᛏᛁ ᛬ ᚦᛁᛋᛁ ᛬ ᛁᚠᛏᛁᛦ ᛬ ᚦᚢᚱᚴᚢᛏ ᛬ ᚢ----ᚦᛁ ᛬ ᚠᛅᚦᚢᚱ
(b)isi · sati : sti[n] : þisi : iftiʀ : þurkut : u----þi : faþur
§B ᛬ ᛋᛁᚾ ᛬ ᚢᚴ ᛬ ᚦᚢ ᛬ ᚴᚢᚾᛅ ᛬ ᛒᛅᚦᛁ ᛬
: sin : uk : þu : kuna : baþi :
Translated into English:
§A Bisi placed this stone in memory of Þorgautr … his father. §B And Gunna, both.
Charm
The final part of the B-side contains a rhyming charm or spell (galdr), which reads:
ᚦᛘᚴ ᛬ ᛁᛁᛁ ᛬ ᛋᛋᛋ ᛬ ᛏᛏᛏ ᛬ ᛁᛁᛁ ᛬ ᛚᛚᛚ ᛬
þmk : iii : sss : ttt : iii : lll :
which is to be read (in normalized Old Icelandic spelling):
þistill, mistill, kistill
The three words mean thistle, mistletoe and casket respectively. This type of charm is found on a few other inscriptions, among them the runic inscription on the Gørlev runestone, DR 239, from Sjælland, Denmark. It has been noted that Pliny the Elder recorded that the Celts gathered mistletoe as a cure for infertility, and that singing a charm over herbs increased their power, which may have led to the þistill mistill kistill combination.
Of the personal names in the inscription, Þorgautr contains as a name element the Norse god Thor.
See also
Runic magic
Refe
|
https://en.wikipedia.org/wiki/Type%E2%80%93length%E2%80%93value
|
Within communication protocols, TLV (type-length-value or tag-length-value) is an encoding scheme used for informational elements. A TLV-encoded data stream contains code related to the record type, the record value's length, and finally the value itself.
Details
The type and length are fixed in size (typically 1–4 bytes), and the value field is of variable size. These fields are used as follows:
Type A binary code, often simply alphanumeric, which indicates the kind of field that this part of the message represents;
Length The size of the value field (typically in bytes);
Value Variable-sized series of bytes which contains data for this part of the message.
Some advantages of using a TLV representation data system solution are:
TLV sequences are easily searched using generalized parsing functions;
New message elements which are received at an older node can be safely skipped and the rest of the message can be parsed. This is similar to the way that unknown XML tags can be safely skipped;
TLV elements can be placed in any order inside the message body;
TLV elements are typically used in a binary format and binary protocols which makes parsing faster and the data smaller than in comparable text based protocols.
Examples
Real-world examples
Transport protocols
TLS (and its predecessor SSL) use TLV-encoded messages.
SSH
COPS
IS-IS
RADIUS
Link Layer Discovery Protocol allows for the sending of organizational-specific information as a TLV element within LLDP packets
Media Redundancy Protocol allows organizational-specific information
Dynamic Host Configuration Protocol (DHCP) uses TLV encoded options
RR protocol used in GSM cell phones (defined in 3GPP 04.18). In this protocol each message is defined as a sequence of information elements.
Data storage formats
IFF
Matroska uses TLV for markup tags
QTFF (the basis for MPEG-4 containers)
Other
ubus used for IPC in OpenWrt
Other examples
Imagine a message to make a telephone call. In a first version of a system this might use two message elements: a "command" and a "phoneNumberToCall":
command_c/4/makeCall_c/phoneNumberToCall_c/8/"722-4246"
Here command_c, makeCall_c and phoneNumberToCall_c are integer constants and 4 and 8 are the lengths of the "value" fields, respectively.
Later (in version 2) a new field containing the calling number could be added:
command_c/4/makeCall_c/callingNumber_c/14/"1-613-715-9719"/phoneNumberToCall_c/8/"722-4246"
A version 1 system which received a message from a version 2 system would first read the command_c element and then read an element of type callingNumber_c. The version 1 system does not understand
callingNumber_c, so the length field is read (i.e. 14) and the system skips forward 14 bytes to read
phoneNumberToCall_c
which it understands, and message parsing carries on.
Other ways of representing data
Core TCP/IP protocols (particularly IP, TCP, and UDP) use predefined, static fields.
Some application layer protocols, in
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.