source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/I%C2%B2S | I²S (Inter-IC Sound, pronounced "eye-squared-ess"), is an electrical serial bus interface standard used for connecting digital audio devices together. It is used to communicate PCM audio data between integrated circuits in an electronic device. The I²S bus separates clock and serial data signals, resulting in simpler receivers than those required for asynchronous communications systems that need to recover the clock from the data stream. Alternatively I²S is spelled I2S (pronounced eye-two-ess) or IIS (pronounced eye-eye-ess). Despite the similar name, I²S is unrelated to the bidirectional I²C (IIC) bus.
History
This standard was introduced in 1986 by Philips Semiconductor (now NXP Semiconductors) and was first revised June 5, 1996. The standard was last revised on February 17, 2022 and updated terms master and slave to controller and target.
Details
The I²S protocol outlines one specific type of PCM digital audio communication with defined parameters outlined in the Philips specification.
The bus consists of at least three lines:
Bit clock line
Officially "continuous serial clock (SCK)". Typically written "bit clock (BCLK)".
Word clock line
Officially "word select (WS)". Typically called "left-right clock (LRCLK)" or "frame sync (FS)".
0 = Left channel, 1 = Right channel
At least one multiplexed data line
Officially "serial data (SD)", but can be called SDATA, SDIN, SDOUT, DACDAT, ADCDAT, etc.
It may also include the following lines:
Master clock (typically 256 x LRCLK)
This is not part of the I2S standard, but is commonly included for synchronizing the internal operation of the analog/digital converters.
A multiplexed data line for upload
The bit clock pulses once for each discrete bit of data on the data lines. The bit clock frequency is the product of the sample rate, the number of bits per channel and the number of channels. So, for example, CD Audio with a sample frequency of 44.1 kHz, with 16 bits of precision and two channels (stereo) has a bit clock frequency of:
44.1 kHz × 16 × 2 = 1.4112 MHz
The word select clock lets the device know whether channel 0 or channel 1 is currently being sent, because I²S allows two channels to be sent on the same data line. It is a 50% duty-cycle signal that has the same frequency as the sample frequency. For stereo material, the I²S specification states that left audio is transmitted on the low cycle of the word select clock and the right channel is transmitted on the high cycle. It is typically synchronized to the falling edge of the serial clock, as the data is latched on the rising edge. The word select clock changes one bit clock period before the MSB is transmitted. This enables, for example, the receiver to store the previous word and clear the input for the next.
Data is signed, encoded as two's complement with the MSB (most significant bit) first. This allows the number of bits per frame to be arbitrary, with no negotiation required between transmitter and receiver.
As a |
https://en.wikipedia.org/wiki/Reminder%20software | Reminder software is a type of time management computer software that is designed to alert the user of important events that they have input to the program. Most programs provide a calendar or list view of events, as well as a reminding technique. Most common reminding techniques are pop-up dialog boxes and auditory alarms.
Events may include birthdays, holidays, anniversaries, various one-time events. Often the software comes with a set of pre-installed events (such as holidays) and allows the user to create custom events.
As software has made the transition to web services, a number of online reminder services have appeared. Users subscribed to those services usually receive their reminders by email or SMS. Context-aware reminder systems can set reminders based on the user's current location.
See also
Reminders (Apple)
Cortana Reminders
Notification system
Digital calendar
Personal information manager
References
External links
Calendaring software |
https://en.wikipedia.org/wiki/Data%20dredging | Data dredging (also known as data snooping or p-hacking) is the misuse of data analysis to find patterns in data that can be presented as statistically significant, thus dramatically increasing and understating the risk of false positives. This is done by performing many statistical tests on the data and only reporting those that come back with significant results.
The process of data dredging involves testing multiple hypotheses using a single data set by exhaustively searching—perhaps for combinations of variables that might show a correlation, and perhaps for groups of cases or observations that show differences in their mean or in their breakdown by some other variable.
Conventional tests of statistical significance are based on the probability that a particular result would arise if chance alone were at work, and necessarily accept some risk of mistaken conclusions of a certain type (mistaken rejections of the null hypothesis). This level of risk is called the significance. When large numbers of tests are performed, some produce false results of this type; hence 5% of randomly chosen hypotheses might be (erroneously) reported to be statistically significant at the 5% significance level, 1% might be (erroneously) reported to be statistically significant at the 1% significance level, and so on, by chance alone. When enough hypotheses are tested, it is virtually certain that some will be reported to be statistically significant (even though this is misleading), since almost every data set with any degree of randomness is likely to contain (for example) some spurious correlations. If they are not cautious, researchers using data mining techniques can be easily misled by these results. The term p-hacking (in reference to p-values) was coined in a 2014 paper by the three researchers behind the blog Data Colada, which has been focusing on uncovering such problems in social sciences research.
Data dredging is an example of disregarding the multiple comparisons problem. One form is when subgroups are compared without alerting the reader to the total number of subgroup comparisons examined.
Types
Drawing conclusions from data
The conventional statistical hypothesis testing procedure using frequentist probability is to formulate a research hypothesis, such as "people in higher social classes live longer", then collect relevant data. Lastly, a statistical significance test is carried out to see how likely the results are by chance alone (also called testing against the null hypothesis).
A key point in proper statistical analysis is to test a hypothesis with evidence (data) that was not used in constructing the hypothesis. This is critical because every data set contains some patterns due entirely to chance. If the hypothesis is not tested on a different data set from the same statistical population, it is impossible to assess the likelihood that chance alone would produce such patterns.
For example, flipping a coin five times with a result of 2 |
https://en.wikipedia.org/wiki/List%20of%20television%20series%20based%20on%20video%20games | This page is a list of television programs based on video games, technically both computer and console games based on. The Witcher and its spinoff The Witcher: Blood Origin were not included as a basis of video game adaptation due to being adapted from novels.
Animated shows
Japanese anime
Afterlost (2019)
Air (2005)
Arc the Lad (1999)
Ace Attorney (2016–2019)
Azur Lane (2019–2020)
Bible Black (2003–2008)
Blue Dragon (2007–2009)
Bomberman B-Daman Bakugaiden (1998–1999)
Bomberman Jetters (2002–2003)
Canvas 2 (2005–2006)
Chaos;Head (2008)
Steins;Gate (2011)
Steins;Gate 0 (2015)
Clannad (2007–2008)
Clannad After Story (2008–2009)
Comic Party/Comic Party Revolution (2001, 2005)
Cyberpunk: Edgerunners (2022)
D.C. ~Da Capo~ (2003–2005)
Danganronpa: The Animation (2013)
Danganronpa 3: The End of Hope's Peak High School (2016)
Devil May Cry (2007)
Digimon (1997–present)
Digimon Adventure (2020–2021)
Dinosaur King (2007–2008)
Dragon Quest (1989–1991)
Dragon Quest: The Adventure of Dai (1991–1992)
Ef: A Tale of Memories. (2007)
Fate/stay night (2006)
Final Fantasy: Legend of the Crystals (1994) - A sequel to Final Fantasy V
Final Fantasy: Unlimited (2001–2002)
F-Zero: GP Legend (2003–2004)
Gakuen Heaven (2006)
Galaxy Angel (2001–2004)
Gungrave (2003–2004)
Harukanaru Toki no Naka de Hachiyō Shō (2004–2005)
Higurashi No Naku Koro Ni (2006–2007)
Higurashi When They Cry (2020–2021)
Hyperdimension Neptunia: The Animation (2013)
Inazuma Eleven (2008–2011)
The Idol Master (2011)
Kanon (2002, 2006–2007)
Rumbling Hearts (2003–2004)
The King of Fighters: Another Day (2005–2006)
Kiniro no Corda (2006–2014)
Kirby: Right Back at Ya! (2001–2003)
Koisuru Tenshi Angelique (2006–2008)
Layton Mystery Tanteisha: Katori no Nazotoki File (2018–2019)
The Legend of Heroes: Trails of Cold Steel – Northern War (2023)
Magical Girl Lyrical Nanoha series - Based on Triangle Hearts 3 Lyrical Toybox (2004–2016)
Medabots (1999–2001)
Mega Man NT Warrior (2002–2006)
Mega Man Star Force (2006–2008)
Mix Master (2005–2006)
Monster Rancher (1999–2001)
Nightwalker: The Midnight Detective (1998)
Pac-Man and the Ghostly Adventures (2013–2015)
Parappa the Rapper (2001–2002)
Persona
Persona: Trinity Soul (2008) - A spin-off of Persona 3
Persona 4: The Animation (2011–2012) & Persona 4: The Golden Animation (2014)
Persona 5: The Animation (2018–2019)
Pokémon (1997–present)
Pokémon Chronicles (2002–2004)
Power Stone (1999)
Resident Evil: Infinite Darkness (2021)
Sakura Wars (2000)
Saru Get You -On Air- (2006–2007)
School Days (2007–2008)
Sentimental Journey (1998)
Shenmue (2022)
Shuffle! (2005–2007)
Sister Princess (2001)
Sister Princess ~ RePure (2002)
Sonic X (2003–2005)
Star Ocean EX (2001) - Based on Star Ocean: The Second Story
Street Fighter II V (1995)
Suki na Mono wa Suki Dakara Shouganai (2005)
Taiko no Tatsujin (2005)
Tales
Tales of Eternia: The Animation (2001)
Tales of the Abyss: The Animation (2008–2009)
Tekken: Bloodline (2022)
ToHeart (1999)
ToHeart Remember my Memories (2004)
To H |
https://en.wikipedia.org/wiki/UNIVAC%20EXEC%20I | EXEC I is UNIVAC's original operating system developed for the UNIVAC 1107 in 1962. EXEC I is a batch processing operating system that supports multiprogramming.
See also
UNIVAC EXEC II
List of UNIVAC products
History of computing hardware
References
External links
EXEC 1 |
https://en.wikipedia.org/wiki/UNIVAC%20EXEC%20II | EXEC II is a discontinued operating system developed for the UNIVAC 1107 by Computer Sciences Corporation (CSC) while under contract to UNIVAC to develop the machine's COBOL compiler. They developed EXEC II because Univac's EXEC I operating system development was late. Because of this the COBOL compiler was actually designed to run under EXEC II, not EXEC I as specified in the original contract.
EXEC II is a batch processing operating system that supports a single job stream with concurrent spooling.
See also
List of UNIVAC products
History of computing hardware
References
External links
EXEC 2 |
https://en.wikipedia.org/wiki/Serial%20decimal | In computers, a serial decimal numeric representation is one in which ten bits are reserved for each digit, with a different bit turned on depending on which of the ten possible digits is intended. ENIAC and CALDIC used this representation.
See also
Bit-serial architecture
Digit-serial architecture
1-of-10 code
One-hot code
References
Computer arithmetic |
https://en.wikipedia.org/wiki/Semiconductor%20memory | Semiconductor memory is a digital electronic semiconductor device used for digital data storage, such as computer memory. It typically refers to devices in which data is stored within metal–oxide–semiconductor (MOS) memory cells on a silicon integrated circuit memory chip. There are numerous different types using different semiconductor technologies. The two main types of random-access memory (RAM) are static RAM (SRAM), which uses several transistors per memory cell, and dynamic RAM (DRAM), which uses a transistor and a MOS capacitor per cell. Non-volatile memory (such as EPROM, EEPROM and flash memory) uses floating-gate memory cells, which consist of a single floating-gate transistor per cell.
Most types of semiconductor memory have the property of random access, which means that it takes the same amount of time to access any memory location, so data can be efficiently accessed in any random order. This contrasts with data storage media such as hard disks and CDs which read and write data consecutively and therefore the data can only be accessed in the same sequence it was written. Semiconductor memory also has much faster access times than other types of data storage; a byte of data can be written to or read from semiconductor memory within a few nanoseconds, while access time for rotating storage such as hard disks is in the range of milliseconds. For these reasons it is used for primary storage, to hold the program and data the computer is currently working on, among other uses.
, semiconductor memory chips sell annually, accounting for % of the semiconductor industry. Shift registers, processor registers, data buffers and other small digital registers that have no memory address decoding mechanism are typically not referred to as memory although they also store digital data.
Description
In a semiconductor memory chip, each bit of binary data is stored in a tiny circuit called a memory cell consisting of one to several transistors. The memory cells are laid out in rectangular arrays on the surface of the chip. The 1-bit memory cells are grouped in small units called words which are accessed together as a single memory address. Memory is manufactured in word length that is usually a power of two, typically N=1, 2, 4 or 8 bits.
Data is accessed by means of a binary number called a memory address applied to the chip's address pins, which specifies which word in the chip is to be accessed. If the memory address consists of M bits, the number of addresses on the chip is 2M, each containing an N bit word. Consequently, the amount of data stored in each chip is N2M bits. The memory storage capacity for M number of address lines is given by 2M, which is usually in power of two: 2, 4, 8, 16, 32, 64, 128, 256 and 512 and measured in kilobits, megabits, gigabits or terabits, etc. the largest semiconductor memory chips hold a few gigabits of data, but higher capacity memory is constantly being developed. By combining several integrat |
https://en.wikipedia.org/wiki/Blades%20of%20Steel | Blades of Steel, later released in Japan as , is an ice hockey video game released by Konami for North American arcades in 1987, and ported to the Family Computer Disk System and Nintendo Entertainment System in 1988. All teams are fictional but based out of real Canadian and American cities. The game is known for its fast-paced hockey action and especially for the fighting. It is a one or two player game. When playing against the computer, there are three difficulty levels to choose from: Junior, College, and Pro (with Pro being the most difficult and Junior being the easiest). Each team consists of three forwards, two defencemen, and a goaltender.
Two sequels were released: NHL Blades of Steel '99 and NHL Blades of Steel 2000. The NES version was re-released on Nintendo's Virtual Console service on December 24, 2007. The arcade version was re-released on Microsoft's Game Room service on November 24, 2010.
Gameplay
At the beginning of the game, players can select either "Exhibition" or "Tournament" matches. An exhibition match is just one game played against either the computer or another player. Tournament matches are similar to the NHL playoffs. It starts out as one team of the player's choice going against other teams in a playoff style tournament. The team that is successful in beating all of the opposing teams is awarded the Cup.
Fighting in the game is initiated whenever two players bump into each other three times in a row without hitting another player. The two players will stop skating and engage in pre-fight confrontation where they are able to exchange punches if they choose. If a player rapidly punches their opponent during the pre-fight, there is a chance they will knock their opponent down and neither player suffers a penalty. If mutual punches are thrown during the pre-fight sequence, then a voice yells "fight", the fight screen appears, and the gamers take control of their players. During the fight a player can punch high, punch low, block high, or block low and is given a health bar of five hits. The loser, the first person to get hit five times, is given a penalty and sent to the penalty box (the winner is not punished), creating a power play opportunity of 5-on-4 skaters. Up to four players can be penalized, for a maximum of a 5-on-1 advantage. If a fight occurs close to one of the nets, the referee may break up the fight and call a penalty shot.
During the second intermission, either a playable mini-game will appear for Player One to play or a Konami ad will appear featuring a bear shooting the puck into a net mouthing the words "Nice Shot!" The mini-game is actually an advertisement for Contra and other Konami games, in which (at one point) a little spaceship is trying to destroy a much larger spaceship, this being a reference to Gradius.
If the score is tied at the end of the game, a shoot out (similar to a penalty shot) is used to determine the winner. Each team gets five shots. The team with the most goals after fi |
https://en.wikipedia.org/wiki/Mooers | Mooers may refer to:
People
Benjamin Mooers (1758–1838), American general from the American Revolution and New York state legislator
Calvin Mooers (1919–1994), American computer scientist known for his work in information retrieval and for the programming language TRAC
Places
Mooers, New York, a town named after Benjamin Mooers
Mooers (CDP), New York, a hamlet and census-designated place in the town |
https://en.wikipedia.org/wiki/D%27oh-in%27%20in%20the%20Wind | "D'oh-in' in the Wind" is the sixth episode of the tenth season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on November 15, 1998. In the episode, Homer Simpson travels to a farm owned by Seth and Munchie, two aged hippies who were friends with Homer's mother. After finding out his middle name is "Jay", Homer is drawn to the carefree lifestyle of hippies, and decides to become one himself.
The episode was written by Donick Cary and directed by Mark Kirkland, who was going through a divorce at the time of its production. Due to personal circumstances, Kirkland assigned his assistant director, Matthew Nastuk, to take over the directing duties for a couple of scenes in the episode. However, after Nastuk had directed a scene, Kirkland felt better and returned to direct the rest of the episode. The episode features the revelation of Homer's middle name, "Jay", which is a tribute to characters from The Rocky and Bullwinkle Show who got their middle initial from Jay Ward.
The episode features comic actors George Carlin as Munchie and Martin Mull as Seth. Carlin was suggested by Simpsons writer Ron Hauge, who "really wanted to meet him", although he did not attend the recording session with Carlin and Mull.
In its original broadcast, the episode was seen by approximately 8.4 million viewers. Following the tenth season's home release on August 7, 2007, "D'oh-in' in the Wind" received mixed reviews from critics.
Plot
After starring in a low-quality commercial by Mr. Burns for the Springfield Nuclear Power Plant, Homer decides to be an actor. As he fills out a Screen Actors Guild application at home, Lisa points out that he has only written his middle initial, J, in the blank for his middle name. Neither Homer nor Grampa knows that name, but Grampa takes Homer to a farm where Mona, Grampa's wife and Homer's mother, spent some time during her days as a hippie. The farm is run by two middle-aged hippies, Seth and Munchie, who were friends of Mona. They point out a mural that she painted based on an incident at Woodstock, which is dedicated to Homer and reveals his middle name as "Jay".
Seeing how carefree his life would have been as a hippie, Homer decides to become one. He dons a dirty old poncho left behind by Mona and begins to carry a frisbee, but is dismayed to learn that Seth and Munchie are using the farm as headquarters for an organic juice company, the largest in Springfield. He persuades them to accompany him on a "freak-out" ride through Springfield, disrupting the citizens' daily lives with silly antics. When the three return to the farm afterward, though, they find that Homer's frisbee has jammed the juicing machinery and caused the loss of an entire shipment of the farm's products. Seth and Munchie angrily order Homer to leave.
To set things right, Homer sneaks back to the farm at night, picks and processes all the vegetables he can find, and delivers the juice shipment to |
https://en.wikipedia.org/wiki/Inverse%20quadratic%20interpolation | In numerical analysis, inverse quadratic interpolation is a root-finding algorithm, meaning that it is an algorithm for solving equations of the form f(x) = 0. The idea is to use quadratic interpolation to approximate the inverse of f. This algorithm is rarely used on its own, but it is important because it forms part of the popular Brent's method.
The method
The inverse quadratic interpolation algorithm is defined by the recurrence relation
where fk = f(xk). As can be seen from the recurrence relation, this method requires three initial values, x0, x1 and x2.
Explanation of the method
We use the three preceding iterates, xn−2, xn−1 and xn, with their function values, fn−2, fn−1 and fn. Applying the Lagrange interpolation formula to do quadratic interpolation on the inverse of f yields
We are looking for a root of f, so we substitute y = f(x) = 0 in the above equation and this results in the above recursion formula.
Behaviour
The asymptotic behaviour is very good: generally, the iterates xn converge fast to the root once they get close. However, performance is often quite poor if the initial values are not close to the actual root. For instance, if by any chance two of the function values fn−2, fn−1 and fn coincide, the algorithm fails completely. Thus, inverse quadratic interpolation is seldom used as a stand-alone algorithm.
The order of this convergence is approximately 1.84 as can be proved by Secant Method analysis.
Comparison with other root-finding methods
As noted in the introduction, inverse quadratic interpolation is used in Brent's method.
Inverse quadratic interpolation is also closely related to some other root-finding methods.
Using linear interpolation instead of quadratic interpolation gives the secant method. Interpolating f instead of the inverse of f gives Muller's method.
See also
Successive parabolic interpolation is a related method that uses parabolas to find extrema rather than roots.
References
James F. Epperson, An introduction to numerical methods and analysis, pages 182-185, Wiley-Interscience, 2007.
Root-finding algorithms |
https://en.wikipedia.org/wiki/Apache%20Avalon | Apache Avalon is a computer software framework developed in 1999 as a project to provide a reusable component framework for container (server) applications. Avalon pioneered the use of design patterns such as separation of concerns (SoC) and inversion of control (IoC).
By 2004 Avalon had grown into several subprojects which have since separated into the following:
Excalibur: Apache Excalibur houses the Avalon 4.x framework, the Fortress IoC container, and several Avalon related components and utilities such as LogKit and the Cornerstone Component Collection.
Loom: Codehaus Loom continues development of a microkernel container after the design of Avalon Phoenix.
Metro: DPML Metro project develops the next generation of the Merlin Service Platform using the Open Participation Software model.
Castle: an IoC Framework and Container for C# and the .NET platform. Based on the C# Avalon implementation.
Excalibur, and consequently the Avalon framework, was retired on 15 December 2010, and both projects are in the Apache Attic.
See also
References
External links
Apache Avalon Official Website (featuring only old source code)
Servers (computing)
Java platform |
https://en.wikipedia.org/wiki/NPN | NPN may refer to:
Science and technology
Next Protocol Negotiation, in computer networking
Non-protein nitrogen, an animal feed component
NPN transistor
Normal Polish notation, in mathematics
Organisations
National Party of Nigeria, a former political party
New Politics Network, a UK think tank
Other uses
Natural Health Product Number, required by the Canadian Natural Health Products Directorate |
https://en.wikipedia.org/wiki/Non-broadcast%20multiple-access%20network | A non-broadcast multiple access network (NBMA) is a computer network to which multiple hosts are attached, but data is transmitted only directly from one computer to another single host over a virtual circuit or across a switched fabric.
Examples of non broadcast technologies
Asynchronous Transfer Mode (ATM)
Frame Relay
X.25
home power line networking
Wireguard
Replication broadcasts
Some NBMA network devices support multicast and broadcast traffic replication (pseudo-broadcasts).
This is done by send multiple copies of a broadcast packet, one through virtual circuit, so that the broadcast gets to all intended recipients.
Power line networks
The ITU-T G.hn standard provides a specification for creating a high-speed (up to 1 Gigabit/s) local area network using existing home power lines, phone lines and coaxial cables.
Because of multipath propagation, power lines use frequency-selective channels. Channel frequency response is different for each pair of transmitter and receiver, so modulation parameters are unique for each transmitter and receiver pair. Since each pair of devices uses a different modulation scheme for communication, other devices may not be able to demodulate the information sent between them.
Split horizon route advertisement
In NBMA networks a special technique called split horizon route advertisement must be disabled by distance-vector routing protocols in order to route traffic in a hub and spoke topology. The reason being is that split horizon dictates that a router cannot send a routing table update out of the same interface from which it received it. Thus eliminating the proper propagation from one location to another. This family of protocols relies on link layer broadcasting for route advertisement propagation, so when this feature is absent, it has to be emulated with a series of unicast transmissions, which may result in a receiver node sending a route advertisement back to the node it has just received it from.
See also
Open Shortest Path First
Routing protocol
References
Network protocols |
https://en.wikipedia.org/wiki/Full-text%20search | In text retrieval, full-text search refers to techniques for searching a single computer-stored document or a collection in a full-text database. Full-text search is distinguished from searches based on metadata or on parts of the original texts represented in databases (such as titles, abstracts, selected sections, or bibliographical references).
In a full-text search, a search engine examines all of the words in every stored document as it tries to match search criteria (for example, text specified by a user). Full-text-searching techniques appeared in the 1960s, for example IBM STAIRS from 1969, and became common in online bibliographic databases in the 1990s. Many websites and application programs (such as word processing software) provide full-text-search capabilities. Some web search engines, such as the former AltaVista, employ full-text-search techniques, while others index only a portion of the web pages examined by their indexing systems.
Indexing
When dealing with a small number of documents, it is possible for the full-text-search engine to directly scan the contents of the documents with each query, a strategy called "serial scanning". This is what some tools, such as grep, do when searching.
However, when the number of documents to search is potentially large, or the quantity of search queries to perform is substantial, the problem of full-text search is often divided into two tasks: indexing and searching. The indexing stage will scan the text of all the documents and build a list of search terms (often called an index, but more correctly named a concordance). In the search stage, when performing a specific query, only the index is referenced, rather than the text of the original documents.
The indexer will make an entry in the index for each term or word found in a document, and possibly note its relative position within the document. Usually the indexer will ignore stop words (such as "the" and "and") that are both common and insufficiently meaningful to be useful in searching. Some indexers also employ language-specific stemming on the words being indexed. For example, the words "drives", "drove", and "driven" will be recorded in the index under the single concept word "drive".
The precision vs. recall tradeoff
Recall measures the quantity of relevant results returned by a search, while precision is the measure of the quality of the results returned. Recall is the ratio of relevant results returned to all relevant results. Precision is the ratio of the number of relevant results returned to the total number of results returned.
The diagram at right represents a low-precision, low-recall search. In the diagram the red and green dots represent the total population of potential search results for a given search. Red dots represent irrelevant results, and green dots represent relevant results. Relevancy is indicated by the proximity of search results to the center of the inner circle. Of all possible results shown, those that |
https://en.wikipedia.org/wiki/Java%20Telephony%20API | The Java Telephony API (JTAPI) supports telephony call control. It is an extensible application programming interface (API) designed to scale for use in a range of domains, from first-party call control in a consumer device to third-party call control in large distributed call centers.
External links
JTAPI
Open Source JTAPI Implementation with multiple pluggable service providers
Java APIs |
https://en.wikipedia.org/wiki/Marc%20Ewing | Marc Ewing is an American computer engineer and entrepreneur. He is the creator and originator of the Red Hat brand of software, most notably the Red Hat range of Linux operating system distributions. He was involved in the 86open project in the mid-1990s.
Early life
The son of an IBM programmer, Marc Ewing attended computer camps as a child, and spent time learning to write programs for Apollo and Commodore computers. He graduated from Carnegie Mellon University in 1992. While at CMU, he was known to wear a red hat. Because of his computer expertise, people would ask for help from the "man in the red hat".
Career
Following his college education, Ewing began work as engineer at IBM. While at IBM, he spent substantial time customizing Linux workstation installations. From this work, he began the Red Hat Linux Project. Ewing and co-founder Bob Young named their software Red Hat after Ewing's red hat.
At the height of the dot com bubble in 1999, Ewing briefly had a net worth of 900 million dollars.
Ewing left Red Hat, and co-founded the mountaineering-focused Alpinist quarterly publication in 2002. He later began competing in desert racing, and co-founded the Riot Racing team in 2008.
References
External links
http://www.salon.com/tech/view/1999/10/04/marc_ewing/
Red Hat people
Open source people
Living people
Carnegie Mellon University alumni
IBM employees
1969 births |
https://en.wikipedia.org/wiki/List%20of%20Billboard%20Hot%20100%20number%20ones%20of%202005 | The Billboard Hot 100 is a chart that ranks the best-performing singles of the United States. Published by Billboard magazine, the data are compiled by Nielsen SoundScan based collectively on each single's weekly physical and digital sales, and airplay. In 2005, there were eight singles that topped the chart in fifty-three issues of the magazine, the lowest of any year.
During the year, five acts achieved their first US number-one single, either as a lead artist or featured guest: Mario, Olivia, Gwen Stefani, Carrie Underwood, and Chris Brown. Stefani earned her first number-one single in the United States this year, although she had been with band the No Doubt since 1986. Hip hop artist Kanye West gained his first number-one single, "Gold Digger", as lead artist; West previously had a number-one single with "Slow Jamz", a 2004 song by rapper Twista. Two acts, Underwood and Brown, scored a number-one debut single this year. Mariah Carey was the only act to have more than one number one song, with her earning two.
Mariah Carey's "We Belong Together" is the longest-running single of 2005, topping the Billboard Hot 100 for 14 non-consecutive weeks. The single is tied with "I Gotta Feeling" by American group The Black Eyed Peas for the longest-running number-one single of the decade. As of 2018, "We Belong Together" was tied for the second longest-running number-one single in the entire Hot 100 era behind Boyz II Men's and Carey's 1995 single "One Sweet Day", which spent sixteen weeks at number one. Despite being surpassed by three other songs during the years, "We Belong Together" still is one of the songs with the most weeks spent at number one in the entire Hot 100 history. West's "Gold Digger" is the second longest-running, having peaked the chart for 10 consecutive weeks. Other singles with extended chart runs include R&B singer Mario's "Let Me Love You", his best-performing song to date, and rapper 50 Cent's "Candy Shop", each spent nine straight weeks at number one.
Carey is the only artist to have earned two number-one singles in 2005 after "Don't Forget About Us" topped the chart in the final calendar issue of Billboard Hot 100. "Don't Forget About Us" is Carey's 17th number-one single, placing her second in the list of acts with most number ones in the United States, tying with Elvis Presley. "We Belong Together" is the best-performing single of the chart year, topping the Top Hot 100 Hits of 2005; this gave Carey her first number-one single in the year-end chart.
Chart history
Number-one artists
See also
2005 in music
List of Billboard number-one singles
Billboard Year-End Hot 100 singles of 2005
References
Additional sources
Fred Bronson's Billboard Book of Number 1 Hits, 5th Edition ()
Joel Whitburn's Top Pop Singles 1955-2008, 12 Edition ()
Joel Whitburn Presents the Billboard Hot 100 Charts: The 2000s ()
Additional information obtained can be verified within Billboard's online archive services and print editions of the magazin |
https://en.wikipedia.org/wiki/ICMP%20Router%20Discovery%20Protocol | In computer networking, the ICMP Internet Router Discovery Protocol (IRDP), also called the Internet Router Discovery Protocol, is a protocol for computer hosts to discover the presence and location of routers on their IPv4 local area network. Router discovery is useful for accessing computer systems on other nonlocal area networks. The IRDP is defined by the IETF RFC 1256 standard, with the Internet Control Message Protocol (ICMP) upon which it is based defined in IETF RFC 792. IRDP eliminates the need to manually configure routing information.
Router discovery messages
To enable router discovery, the IRDP defines two kinds of ICMP messages:
The ICMP Router Solicitation message is sent from a computer host to any routers on the local area network to request that they advertise their presence on the network.
The ICMP Router Advertisement message is sent by a router on the local area network to announce its IP address as available for routing.
When a host boots up, it sends solicitation messages to IP multicast address 224.0.0.2. In response, one or more routers may send advertisement messages. If there is more than one router, the host usually picks the first message it gets and adds that router to its routing table. Independently of a solicitation, a router may periodically send out advertisement messages. These messages are not considered a routing protocol, as they do not determine a routing path, just the presence of possible gateways.
Extensions
The IRDP strategy has been used in the development of the IPv6 neighbor discovery protocol. These use ICMPv6 messages, the IPv6 analog of ICMP messages. Neighbor discovery is governed by IETF standards RFC 4861 and RFC 4862.
IRDP plays an essential role in mobile networking through IETF standard RFC 3344. This is called MIPv4 Agent discovery.
See also
Dynamic Host Configuration Protocol
References
External links
: ICMP Router Discovery Messages
Internet Standards
Internet protocols |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Arkansas | The following is a list of FCC-licensed radio stations in the U.S. state of Arkansas, which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats. NOAA Weather Radio stations are not listed.
List of radio stations
Defunct
KAMD-AM
KAPZ
KAWX-LP
KBHC
KBRI
KBRS
KCCL
KCLA
KCON
KDDA
KDEW
KENB-LP
KESP
KGED
KGPL
KHAM
KHBR-LP
KHEE-LP
KGKO
KJQS
KKIP
KLCN
KLRG (1450 AM)
KMOA
KOKY
KOSY
KOTN
KPBA (1270 AM)
KPBQ-FM
KPCA
KPJN-LP
KPWH-LP
KRKD
KRMN
KSIP
KSRB
KSSP
KSYP
KTPA
KTPV-LP
KUEC
KVSA
KXKY
KXXA
KYDE
KZHS
KZOT
KZTD
KZYP
KZYQ
WETI
See also
Arkansas media
List of newspapers in Arkansas
List of television stations in Arkansas
Media of cities in Arkansas: Fayetteville, Fort Smith, Hot Springs, Little Rock, Rogers
References
Bibliography
External links
(Directory ceased in 2017)
Arkansas Broadcasters Association
Images
Arkansas
Radio stations |
https://en.wikipedia.org/wiki/Idiot%20Savants%20%28game%20show%29 | Idiot Savants was an American television game show on the MTV network which ran from December 9, 1996, to April 25, 1997. It was created by Michael Dugan and Chris Kreski, directed by Steve Paley, and hosted by comedian Greg Fitzsimmons.
The show's title refers to a label historically directed toward autistic people with savant syndrome.
Format
Four contestants competed through an entire week of shows (Monday through Friday), answering questions in a variety of categories. In each of the first four shows of the week, contestants were eliminated one by one, and the day's top scorer played a bonus round for a prize. However, all four contestants returned to start each new episode, and each contestant's scores from the Monday through Thursday episodes were added together to create a total that served as his/her starting point for Friday's game. The contestant who had the highest total at the end of the Friday episode won the week's grand prize, usually a vacation or a car.
Before appearing on the show, each contestant chose a specific topic in which he/she was particularly knowledgeable as his/her "savant category." These categories covered a broad range of fields such as entertainment, academics, and popular culture.
Many of the questions were asked (or performed) by the "savant contestants", a group of actors who acted out comical sketches that led to the questions. Many of these actors were also writers on the show, including senior writer Tom Cohen, along with Jason Nash, Paul Kozlowski, Eric Friedman, and Shonda Farr.
Monday–Thursday
The contestants' scores were set to zero at the start of each day. On Monday episodes, initial control of Round 1 was determined first by a toss-up question, and later by a random draw.
Round 1
The contestant in control chose one of eight categories from a board. A toss-up question was asked, and the first contestant to buzz in with the right answer received 100 points and the chance to answer a bonus question worth 200 points. If that contestant answered the bonus correctly, he/she then had the right to try for a 300-point "Big Gamble" question, the last in the category. No points were deducted for a miss on the toss-up or bonus questions, but an incorrect response on the Big Gamble deducted 300. Whenever a contestant answered a question incorrectly or ran out of time, the other contestants could buzz in and give the correct answer to steal the points, after which the category would be closed and the contestant in control would choose another one. A category would also end if the same contestant answered the toss-up and bonus, but declined the Big Gamble.
The round ended when either time ran out or all eight categories had been used. At this point, the lowest scorer was labeled as the day's "dunce" and made to sit in a corner of the stage, separate from the other contestants.
Round 2
The question format remained the same, but all point values were doubled (200, 400, +/-600 points), and category selection w |
https://en.wikipedia.org/wiki/Inquizition | Inquizition is an American game show created by Game Show Network and Sande Stewart Television that ran on the network's schedule from October 5, 1998 to October 19, 2001. The game, hosted by an unknown figure named "The Inquizitor", features four contestants competing in a quiz competition against four home viewers who participated by telephone calls.
Gameplay
Four players competed in a studio which, from the opening credits sequence, appeared to be a large airplane hangar. In reality, the show was recorded in a small studio, using a blue screen backdrop on which images of the hangar were superimposed. Additionally, four more contestants played along at home against each other in a parallel game over the telephone (one of several shows on GSN that did this). Studio players wore black T-shirts under smocks in various colors, and would bow to the Inquizitor when first introduced.
The game was played in three rounds, each consisting of approximately 20-25 multiple-choice questions depending on the time available. Each question had three possible answers (A, B, or C; "C" was almost always "none of the above"). The contestants had three seconds to lock in an answer by pressing one of the buttons on their podiums, their answers visible only to the Inquizitor and viewing audience. Each correct response awarded one point, with no penalty for wrong answers; the scores were displayed on the podiums after each question, but were not announced at any point during gameplay.
When time expired at the end of each round, the contestant with the lowest score was eliminated and dismissed by the Inquizitor. The losing player turned around, as if to walk away, and the screen faded to white. The scores were reset for each new round. After Round 3, the remaining contestant collected his/her "papers" (a prop sometimes seen briefly on-camera, similar to a diploma) and a $500 cash prize ($250 in Season 1). Telephone contestants played for the same prize as the studio contestants, with some also winning online gift certificates.
In the case of a tie in either the show or the telephone game, additional questions were asked until the tie was broken.
The Inquizitor
Inquizitions mysterious anti-host, the Inquizitor, was not a typical game show host of the time – he was angry, cranky, and had little patience for wrong answers. He rarely called contestants by their first names, instead opting to use a more gentlemanly approach ("Mr. Roberts", "Miss Johnson"). During the game, he was seen only from behind as a figure in a dark business suit with shoulder-length gray hair, seated in a chair next to a table that held a glass of water and an hourglass.
Frequently, the Inquizitor would express his disdain for under-performing players during questioning and prod them to improve their game – or occasionally praise a player, while giving backhanded insults to the others ("Thank you, [contestant], for saving us from almost complete''' ignorance"). He occasionally threw in a side c |
https://en.wikipedia.org/wiki/Downgrade | In computing, downgrading refers to reverting software (or hardware) back to an older version; downgrade is the opposite of upgrade. Programs may need to be downgraded to remove introduced bugs, restore useful removed features, and to increase speed and/or ease of use. The same can occur with machinery.
An example of a downgraded program is Gmax, a downgraded version of 3ds max used by professional computer graphics artists, free to download and simplified for ease of use.
The term "downgrade" became especially popularized during the days of Windows Vista, with users wanting to return to, or downgrade to (with some even calling it an "upgrade") Windows XP because Vista had performance and familiarity issues.
Another reason could be that the user's applications do not support their new OS and they want to revert to an older version.
See also
Backporting
References
Software industry |
https://en.wikipedia.org/wiki/Model%20204 | Model 204 (M204) is a database management system for IBM and compatible mainframe computers developed and commercialized by Computer Corporation of America. It was announced in 1965, and first deployed in 1972. It incorporates a programming language and an environment for application development. Implemented in assembly language for IBM System/360 and its successors, M204 can deal with very large databases and transaction loads of 1000 TPS.
Product description
Model 204 relies on its own type of bitmap index, originally devised by Bill Mann, and combines the use of hash table, B-tree, and partitioned record list technologies to optimize speed and efficiency of database access.
It has been described as "one of the three major inverted-list [database
systems] ... the other two being" ADABAS and ADR's Datacom/DB.
Although M204 is a pre-SQL (and pre-relational) database product, it is possible to manually map the files of an M204 database to approximate SQL equivalents and provide some limited SQL functionality using Model 204 SQL Server.
Users
Model 204 is commonly used in government and military applications.
It is used commercially in the UK by Marks & Spencer. It is also used at the Ventura County Property Tax system in California, the Harris County, Texas, Justice Information Management System, and in the New York City Department of Education's Automate The Schools system. An informal list of past and present Model 204 users, compiled in 2010, identified more than 140 organizations worldwide. Beginning in 1986, it was used by the US Navy Fleet Intelligence Center Europe and Atlantic (FICEURLANT).
Model 204 has been a central part of Australian social security for decades. Services Australia have used it for their ISIS system that pays over $110 billion in welfare payments to around 6 million Australians. A 1.5 billion Australian dollar project to replace ISIS was expected to be completed in 2022 but has experienced delays. The project was scrapped in July 2023 having spent AUD 191 million, with the complexity of encoding social security entitlement rules into Model 204 cited as one of the reasons for its failure.
Corporate information
Add-on products for Model 204 database were formerly available from Sirius Software, Inc.
Sirius, located in Cambridge, Massachusetts, USA, was acquired by Rocket Software in 2012.
See also
Entity-attribute-value model
References
External links
Model 204 at Rocket Software
Model 204 at Sirius Software
An example of Model 204 User Language programming
Proprietary database management systems
IBM mainframe software |
https://en.wikipedia.org/wiki/Eustis | Eustis may refer to:
People
Abraham Eustis, American Army officer and lawyer
Charles Eustis Bohlen (1904–1974), American ambassador
Collin Eustis, American Cyber Security Expert
Dorothy Harrison Eustis, dog breeder and philanthropist
George Eustis Jr. (1828–1872), United States Representative from Louisiana
James Biddle Eustis, United States Senator from Louisiana
Oskar Eustis (1958-), United States theatre director
William Eustis, (1753–1825), early American statesman
William Corcoran Eustis (1862–1921), American Army captain
William Henry Eustis (1845–1928), American mayor of Minneapolis
Places
In the United States:
Eustis, Florida
Eustis, Maine
Eustis, Nebraska
Fort Eustis, United States military base located in Newport News, Virginia
Lake Eustis, lake in Central Florida near the towns of Eustis and Tavares
See also
Eustace (disambiguation) |
https://en.wikipedia.org/wiki/Architecture%20of%20Btrieve | Btrieve is a database developed by Pervasive Software. The architecture of Btrieve has been designed with record management in mind. This means that Btrieve only deals with the underlying record creation, data retrieval, record updating and data deletion primitives. Together with the MicroKernel Database Engine it uses ISAM, Indexed Sequential Access Method, as its underlying storage mechanism.
Btrieve is essentially a database that uses keys and indexes to organise data. However, the file structure itself is largely built around smaller units of data, called "pages" in Btrieve. Though the structure has changed over the various versions of Btrieve, the file structure still revolves around a File Control Record (FCR) — which defines the configuration of pages — and pages in the Btrieve file that contain data. Historically, Btrieve used "physical pages", or pages that were located at fixed positions in the file. Beginning with version 6.0 "logical pages" started to be used, which were mapped to page allocation tables (PATs) — this allowed Btrieve to change their record update technique from what was later known as "pre-image paging" to a technique called "shadow-paging".
Btrieve is committed to backward compatibility, as versions of Btrieve until version 6.15 use a standard file format and, until Btrieve 6.0 was released, were completely backwards compatible. Btrieve 6.0 introduced new features and had to break compatibility with older versions of the software to implement more advanced features. The API likewise remained backwards compatible, with only one feature (split files to separate media) being dropped. At one point, Btrieve's former CEO Ron Harris stated that "The version 1.0 API is still supported in version 6.15, and we're going to keep it forever!".
Database terminology
Pervasive initially used the term "navigational database" to describe Btrieve, but later changed this to "transactional database". The use of the term navigational database was unusual because a navigational database uses "pointers" and "paths" to navigate among data records, and these pointers are contained in the record itself; ISAM, which is the fundamental structure of Btrieve, uses a secondary index table to store these pointers to decrease search times. Thus, the two types of database are different, and may or may not explain why Pervasive started using different terminology for classifying their database.
Micro-Kernel Database Engine
Starting with version 6.15, Pervasive started using a new modular method of separating the database backend from the interface that developers used. They separated the core database operations (like update, write and delete records) from the Btrieve and Scalable SQL modules. By separating the Micro-Kernel Database Engine (MKDE) from the other functions it allowed programmers to use several methods of accessing the database simultaneously. For instance, an application may be created using the Btrieve API and another application t |
https://en.wikipedia.org/wiki/List%20of%20closed%20railway%20stations%20in%20South%20Australia | This lists closed, demolished or otherwise defunct railway stations, lines or branches in Adelaide and South Australia.
Adelaide suburban network
Closed stations
There are two closed stations on the passenger railway network in the city of Adelaide, South Australia that have not been demolished, both along the Belair line:
Clapham (closed 28 April 1995)
Hawthorn (closed 28 April 1995)
Demolished stations
There are several stations along current railway routes that have been closed and demolished:
Belair railway line
Keswick (closed and demolished 2013; replaced by nearby Adelaide Showground)
Mile End Goods (closed 1994)
Showground Central (seasonal-use temporary structure, used 2003–2013; replaced by Adelaide Showground)
Sleeps Hill
Flinders railway line
Clovelly Park (closed and demolished 2020; replaced by nearby relocated Tonsley)
Tonsley (original station closed and demolished 2019; relocated station opened 2020)
Gawler railway line
GMH (at the end of a spur just north of Nurlutta)
Grand Junction (closed 1859)
Islington Works (closed 2000 and demolished )
Tube Mills
Grange railway line
Golf Links (closed 1961)
Holdens (closed 1992)
Outer Harbor railway line
Cheltenham Racecourse siding (closed 1953)
Cheltenham Racecourse (closed 2009, demolished 2012; replaced with nearby St Clair)
Largs Jetty (closed 1908; spur at Largs traversing Jetty Road to the Largs Pier Hotel and the jetty)
Torrens Bridge (opened 1883, closed 1888)
Yerlo (closed 13 September 1981; replaced by North Haven)
Seaford railway line
Keswick (closed and demolished 2013; replaced by nearby Adelaide Showground)
Mile End Goods (closed 1994)
Showground Central (temporary structure; used 2003–2013)
South Brighton (closed 1976)
Closed railway lines (and their closed stations)
Several complete lines have been closed, with the rails removed, all of the station infrastructure removed, and some of the stations demolished:
Jubilee Exhibition Railway (closed 1925)
Serviced the Adelaide Jubilee International Exhibition, Torrens Parade Ground and original location of Adelaide Showground direct from Adelaide railway station.
Holdfast Bay railway line (closed 14 December 1929)
Thebarton
Hilton
Richmond
Kurralta Park
Plympton Coursing Ground (closed c.1925)
Plympton
Morphettville
Camden
Novar Gardens
Macdonalds
Golf Links (closed by 1929)
St Leonards (closed 1926)
Glenelg
St Leonards–Grange railway line
Glenelg railway line (closed 1929 and converted to Glenelg tram line)
Victoria Square (closed 1914)
South Terrace
Wayville
Goodwood Road
Forestville
Black Forest
Hayhurst
South Plympton
Morphettville
Helmsdale
Miller's Corner
Glenelg
Closed branch lines
Branches from Adelaide-Wolseley railway line
Mount Pleasant railway line (closed 1964, now Amy Gillett Bikeway)
Branched from the Adelaide-Wolseley line at Balhannah.
Oakbank
Mappinga
Riverview
Woodside
Kayannie
Charleston
Muralappie
Mount Torrens
Milkappa
Birdwood
Crane Road
Narcoonah
Mount Pleasant
Branches from Belair railway |
https://en.wikipedia.org/wiki/Microsoft%20DNS | Microsoft DNS is the name given to the implementation of domain name system services provided in Microsoft Windows operating systems.
Overview
The Domain Name System support in Microsoft Windows NT, and thus its derivatives Windows 2000, Windows XP, and Windows Server 2003, comprises two clients and a server. Every Microsoft Windows machine has a DNS lookup client, to perform ordinary DNS lookups. Some machines have a Dynamic DNS client, to perform Dynamic DNS Update transactions, registering the machines' names and IP addresses. Some machines run a DNS server, to publish DNS data, to service DNS lookup requests from DNS lookup clients, and to service DNS update requests from DNS update clients.
The server software is only supplied with the server versions of Windows.
DNS lookup client
Applications perform DNS lookups with the aid of a DLL. They call library functions in the DLL, which in turn handle all communications with DNS servers (over UDP or TCP) and return the final results of the lookup back to the applications.
Microsoft's DNS client also has optional support for local caching, in the form of a DNS Client service (also known as DNSCACHE). Before they attempt to directly communicate with DNS servers, the library routines first attempt to make a local IPC connection to the DNS Client service on the machine. If there is one, and if such a connection can be made, they hand the actual work of dealing with the lookup over to the DNS Client service. The DNS Client service itself communicates with DNS servers, and caches the results that it receives.
Microsoft's DNS client is capable of talking to multiple DNS servers. The exact algorithm varies according to the version, and service pack level, of the operating system; but in general all communication is with a preferred DNS server until it fails to answer, whereupon communication switches to one of several alternative DNS servers.
The effects of running the DNS Client service
There are several minor differences in system behavior depending on whether the DNS Client service is started:
Parsing of the "hosts" file: The lookup functions read only the hosts file if they cannot off-load their task onto the DNS Client service and have to fall back to communicating with DNS servers themselves. In turn, the DNS Client service reads the "hosts" file once, at startup, and only re-reads it if it notices that the last modification timestamp of the file has changed since it last read it. Thus:
With the DNS Client service running: The "hosts" file is read and parsed only a few times, once at service startup, and thereafter whenever the DNS Client service notices that it has been modified.
Additionally, running the DNS Client service in conjunction with a “large” HOSTS file can cause it to put a 100% load on the CPU/core on which it is running until it is stopped.
Without the DNS Client service running: The "hosts" file is read and parsed repeatedly, by each individual application pr |
https://en.wikipedia.org/wiki/Australia%27s%20Brainiest | Australia's Brainiest is a television game show series produced in Australia by Crackerjack Productions, a FremantleMedia company. It originally aired on the Seven Network before moving to Network Ten. The format was taken from the British series Britain's Brainiest Kid.
The first season of Australia's Brainiest Kid was produced in May 2004, airing on the Seven Network on Sundays, starting 28 November 2004. It was hosted by Anna Coren. It was publicised through Australian primary schools, with children sitting an online test, followed by a selection of them taking a supervised written test. Of those that scored highly on these written tests, some of the highest scoring children appeared on the show as contestants. A second season was produced in 2005, and was broadcast on Network Ten at 6:30 pm on Sundays, starting 25 September 2005. It was hosted by Ten News newsreader Sandra Sully and co-hosted by Samuel Shaed.
The second season of Australia's Brainiest Kid was followed by a series of specials on Network Ten featuring celebrities, reality TV contestants and sports stars, under the Australia's Brainiest Specials title. After the broadcast of the specials no further series have been commissioned.
Australia's Brainiest Kid
The format of Australia's Brainiest Kid went unchanged during its transition from Seven Network to Network Ten, except for the number of rounds and contestants. In Seven Network's version, there were 4 heats and a final, and 12 children per show; in Network Ten's version, there were 7 heats and a final, and 9 children per show.
Season 1
The first season aired on the Seven Network in 2004. Over 5000 children sat the online test, 800 were selected to sit the supervised test. All of them won copies of the 2004 CD-ROM edition of Encyclopædia Britannica.
Everybody in the third round went on to the final; they were competing for an Apple Computer iBook. The winner of the first series final, Aaron Chong, won the title of "Australia's Brainiest Kid" and A$20,000 to be held in trust until he turns 18.
Season 2
The second season aired on Network Ten in 2005. 12,000 children sat the online test for the second season of Australia's Brainiest Kid, aired on Network Ten. Some of them were selected to sit the supervised test. The seven winners of the heats, plus two others who made it into the final rounds of the heats played in the final. This series had considerably more children participating, mainly due to the popularity of the first series.
All contestants received a Mathemagic computer tutor from the Australian Institute of Mathematics as a "participation" prize. The heat winners received ASUS laptops. The winner of the second series final, William Xi, won the title of "Australia's Brainiest Kid" and a trust fund worth A$20,000 that he cannot touch before his 18th birthday.
Commentators noted that children of Asian descent dominated the preliminary televised rounds during this series. The Chaser's War on Everything parodied th |
https://en.wikipedia.org/wiki/Santy | Santy is a computer worm created in Perl to exploit a vulnerability in phpBB software which used Google to spread across the Internet.
Overview
Within 24 hours of its release on 20 December 2004, about 30,000 to 40,000 websites were attacked by Santy. The worm holds a record of spreading worldwide within three hours of its release. It caused writable files (of formats such as .php and .html) on the infected servers to display the message "This site is defaced!!! This site is defaced!!! NeverEverNoSanity WebWorm generation X", where X is a number representing the generation of the worm.
There have been variants of the worm, some that use alternative search engines after Google blocked queries from the Santy worm, and an anti-Santy anti-worm that attempts to patch vulnerable installations.
The phpBB Group had released a patch for the vulnerability a month before the attacks, in phpBB 2.0.11.
References
External links
BBC news report
The patch from phpBB
Kaspersky Lab page on Santy
Google search for Santy infected sites
Computer worms
Hacking in the 2000s |
https://en.wikipedia.org/wiki/Catmull%E2%80%93Clark%20subdivision%20surface | The Catmull–Clark algorithm is a technique used in 3D computer graphics to create curved surfaces by using subdivision surface modeling. It was devised by Edwin Catmull and Jim Clark in 1978 as a generalization of bi-cubic uniform B-spline surfaces to arbitrary topology.
In 2005, Edwin Catmull, together with Tony DeRose and Jos Stam, received an Academy Award for Technical Achievement for their invention and application of subdivision surfaces. DeRose wrote about "efficient, fair interpolation" and character animation. Stam described a technique for a direct evaluation of the limit surface without recursion.
Recursive evaluation
Catmull–Clark surfaces are defined recursively, using the following refinement scheme.
Start with a mesh of an arbitrary polyhedron. All the vertices in this mesh shall be called original points.
For each face, add a face point
Set each face point to be the average of all original points for the respective face
For each edge, add an edge point.
Set each edge point to be the average of the two neighbouring face points (AF) and the midpoint of the edge (ME)
For each original point (P), take the average (F) of all n (recently created) face points for faces touching P, and take the average (R) of all n edge midpoints for original edges touching P, where each edge midpoint is the average of its two endpoint vertices (not to be confused with new edge points above). (Note that from the perspective of a vertex P, the number of edges neighboring P is also the number of adjacent faces, hence n)
Move each original point to the new vertex point (This is the barycenter of P, R and F with respective weights (n − 3), 2 and 1)
Form edges and faces in the new mesh
Connect each new face point to the new edge points of all original edges defining the original face
Connect each new vertex point to the new edge points of all original edges incident on the original vertex
Define new faces as enclosed by edges
Properties
The new mesh will consist only of quadrilaterals, which in general will not be planar. The new mesh will generally look "smoother" (i.e. less "jagged" or "pointy") than the old mesh. Repeated subdivision results in meshes that are more and more rounded.
The arbitrary-looking barycenter formula was chosen by Catmull and Clark based on the aesthetic appearance of the resulting surfaces rather than on a mathematical derivation, although they do go to great lengths to rigorously show that the method converges to bicubic B-spline surfaces.
It can be shown that the limit surface obtained by this refinement process is at least at extraordinary vertices and everywhere else (when n indicates how many derivatives are continuous, we speak of continuity). After one iteration, the number of extraordinary points on the surface remains constant.
Exact evaluation
The limit surface of Catmull–Clark subdivision surfaces can also be evaluated directly, without any recursive refinement. This can be accomplished by means of |
https://en.wikipedia.org/wiki/Memory%20segmentation | Memory segmentation is an operating system memory management technique of dividing a computer's primary memory into segments or sections. In a computer system using segmentation, a reference to a memory location includes a value that identifies a segment and an offset (memory location) within that segment. Segments or sections are also used in object files of compiled programs when they are linked together into a program image and when the image is loaded into memory.
Segments usually correspond to natural divisions of a program such as individual routines or data tables so segmentation is generally more visible to the programmer than paging alone. Segments may be created for program modules, or for classes of memory usage such as code segments and data segments. Certain segments may be shared between programs.
Segmentation was originally invented as a method by which system software could isolate software processes (tasks) and data they are using. It was intended to increase reliability of the systems running multiple processes simultaneously.
Hardware implementation
In a system using segmentation, computer memory addresses consist of a segment id and an offset within the segment. A hardware memory management unit (MMU) is responsible for translating the segment and offset into a physical address, and for performing checks to make sure the translation can be done and that the reference to that segment and offset is permitted.
Each segment has a length and set of permissions (for example, read, write, execute) associated with it. A process is only allowed to make a reference into a segment if the type of reference is allowed by the permissions, and if the offset within the segment is within the range specified by the length of the segment. Otherwise, a hardware exception such as a segmentation fault is raised.
Segments may also be used to implement virtual memory. In this case each segment has an associated flag indicating whether it is present in main memory or not. If a segment is accessed that is not present in main memory, an exception is raised, and the operating system will read the segment into memory from secondary storage.
Segmentation is one method of implementing memory protection. Paging is another, and they can be combined. The size of a memory segment is generally not fixed and may be as small as a single byte.
Segmentation has been implemented several ways on various hardware, with or without paging. Intel x86 memory segmentation does not fit either model and is discussed separately below, and also in greater detail in a separate article.
Segmentation without paging
Associated with each segment is information that indicates where the segment is located in memory— the segment base. When a program references a memory location, the offset is added to the segment base to generate a physical memory address.
An implementation of virtual memory on a system using segmentation without paging requires that entire segments be swapped |
https://en.wikipedia.org/wiki/IP%20tunnel | An IP tunnel is an Internet Protocol (IP) network communications channel between two networks. It is used to transport another network protocol by encapsulation of its packets.
IP tunnels are often used for connecting two disjoint IP networks that don't have a native routing path to each other, via an underlying routable protocol across an intermediate transport network. In conjunction with the IPsec protocol they may be used to create a virtual private network between two or more private networks across a public network such as the Internet. Another prominent use is to connect islands of IPv6 installations across the IPv4 Internet.
In IP tunnelling, every IP packet, including addressing information of its source and destination IP networks, is encapsulated within another packet format native to the transit network.
At the borders between the source network and the transit network, as well as the transit network and the destination network, gateways are used that establish the end-points of the IP tunnel across the transit network. Thus, the IP tunnel endpoints become native IP routers that establish a standard IP route between the source and destination networks. Packets traversing these end-points from the transit network are stripped from their transit frame format headers and trailers used in the tunnelling protocol and thus converted into native IP format and injected into the IP stack of the tunnel endpoints. In addition, any other protocol encapsulations used during transit, such as IPsec or Transport Layer Security, are removed.
IP in IP, sometimes called ipencap, is an example of IP encapsulation within IP and is described in RFC 2003. Other variants of the IP-in-IP variety are IPv6-in-IPv4 (6in4) and IPv4-in-IPv6 (4in6).
IP tunneling often bypasses simple firewall rules transparently since the specific nature and addressing of the original datagrams are hidden. Content-control software is usually required to block IP tunnels.
History
The first specification of IP tunneling was in RFC 1075, which described DVMRP, the first IP multicast routing protocol. Because multicast used special IPv4 addresses, testing DVMRP required a way to get IP datagrams across portions of the Internet that did not yet recognize multicast addresses. This was solved by IP tunneling. The first approach to IP tunneling used an IP Loose Source Route and Record (LSRR) Option to hide the multicast address from the non-multicast aware routers. A multicast-aware destination router would remove the LSRR option from the packet and restore the multicast IP address to the packet's IP destination field. The other approach in the DVMRP specification was IP in IP, as described above. IP in IP soon became the preferred approach, and was later put to use in the Mbone.
See also
Tunnel Setup Protocol
Tunnel Broker
Generic Routing Encapsulation
References
Networking standards
Tunneling protocols |
https://en.wikipedia.org/wiki/Quarky%20%26%20Quaysoo%27s%20Turbo%20Science | Quarky & Quaysoo's Turbo Science is an educational computer game developed by Jeff Tunnell Productions and published by Sierra On-Line for MS-DOS in early 1992. It was designed to teach scientific concepts to children.
The game centers on Quarky and Quaysoo O'Gandi, two space "elfs" that are green and yellow respectively. With the help of the player they race through a town in vehicles ranging from cars to jet packs. To purchase vehicles, the player answers questions relating to science at stops along the way. Each stop has a theme: the construction site is simple machines, Clown College is chemistry, etc. There are three opposing teams: two tough street fighters, a pair of alien siblings, and a know-it-all named Odessa King. The game also featured an information book that ran over one-hundred pages long and taught science topics such as optics (via a run-in with the light police) and energy (with the help of Sheik Oil Slick).
Reception
Quarky & Quaysoo's Turbo Science was reviewed in the Oppenheim Toy Portfolio Guide Book where it was described as a set of "fun science problems". Noting that the problems orient toward "energy, chemistry, magnetism, and air and water pressure", the authors assessed the game as best suited for children aged 9 years and older.
References
External links
1992 video games
DOS games
DOS-only games
Science educational video games
Children's educational video games
Quiz video games
Sierra Entertainment games
Sierra Discovery games
Video games developed in the United States |
https://en.wikipedia.org/wiki/Markov%20random%20field | In the domain of physics and probability, a Markov random field (MRF), Markov network or undirected graphical model is a set of random variables having a Markov property described by an undirected graph. In other words, a random field is said to be a Markov random field if it satisfies Markov properties. The concept originates from the Sherrington–Kirkpatrick model.
A Markov network or MRF is similar to a Bayesian network in its representation of dependencies; the differences being that Bayesian networks are directed and acyclic, whereas Markov networks are undirected and may be cyclic. Thus, a Markov network can represent certain dependencies that a Bayesian network cannot (such as cyclic dependencies ); on the other hand, it can't represent certain dependencies that a Bayesian network can (such as induced dependencies ). The underlying graph of a Markov random field may be finite or infinite.
When the joint probability density of the random variables is strictly positive, it is also referred to as a Gibbs random field, because, according to the Hammersley–Clifford theorem, it can then be represented by a Gibbs measure for an appropriate (locally defined) energy function. The prototypical Markov random field is the Ising model; indeed, the Markov random field was introduced as the general setting for the Ising model. In the domain of artificial intelligence, a Markov random field is used to model various low- to mid-level tasks in image processing and computer vision.
Definition
Given an undirected graph , a set of random variables indexed by form a Markov random field with respect to if they satisfy the local Markov properties:
Pairwise Markov property: Any two non-adjacent variables are conditionally independent given all other variables:
Local Markov property: A variable is conditionally independent of all other variables given its neighbors:
where is the set of neighbors of , and is the closed neighbourhood of .
Global Markov property: Any two subsets of variables are conditionally independent given a separating subset:
where every path from a node in to a node in passes through .
The Global Markov property is stronger than the Local Markov property, which in turn is stronger than the Pairwise one. However, the above three Markov properties are equivalent for positive distributions (those that assign only nonzero probabilities to the associated variables).
The relation between the three Markov properties is particularly clear in the following formulation:
Pairwise: For any not equal or adjacent, .
Local: For any and not containing or adjacent to , .
Global: For any not intersecting or adjacent, .
Clique factorization
As the Markov property of an arbitrary probability distribution can be difficult to establish, a commonly used class of Markov random fields are those that can be factorized according to the cliques of the graph.
Given a set of random variables , let be the probability of a particular field config |
https://en.wikipedia.org/wiki/Wired%20For%20Sex | Wired For Sex is a television program on the former TechTV network showcasing how technology and the Internet have affected sex, including topics ranging from pornography to cyber sex. It was cancelled shortly before TechTV was bought by G4 Media in May 2004 and merged with G4 to form G4techTV. G4 contacted World of Wonder Productions, who originally produced Wired for Sex for TechTV, and ordered an entirely new season. The series ended in 2008.
External links
Detailed Information - http://worldofwonder.net/productions/wired-for-sex/
TechTV original programming |
https://en.wikipedia.org/wiki/Virgin%20Mobile%20USA | Virgin Mobile USA ( was a no-contract Mobile Virtual Network Operator. It used Sprint's network for coverage. It licensed the Virgin Mobile brand from United Kingdom-based Virgin Group. Virgin Mobile USA was headquartered in Kansas City, Missouri, and provided service to approximately 6 million customers.
Founded in 2001 as a joint venture between Virgin Group and Sprint Corporation, Virgin Mobile USA commenced operations in June 2002 as a mobile virtual network operator (MVNO), providing services via the Sprint 1900 MHz CDMA network. In 2009, Sprint Nextel bought out joint-venture partner Virgin Group, becoming the sole owner of Virgin Mobile USA.
In June 2017, Virgin Mobile dropped all Android and began to only offer iPhones to new customers under its new "Inner Circle" unlimited plan. Following the discontinuation of the plan in 2018, it began to restore Android devices to its lineup.
In January 2020, Virgin Mobile announced that it would shut down, and transfer its remaining customers to Boost Mobile the following month in preparation for the Sprint and T-Mobile merger.
History
Foundation
Virgin Mobile USA was formed in 2000 in San Francisco. In July 2000, John Tantum and Dave Whetstone pitched Richard Branson on entering the U.S. market after Virgin had successfully launched Virgin Mobile in the United Kingdom in 1999. At that point, the U.S. team began pitching the U.S. mobile operators on the concept of an MVNO, which at the time was not well understood. The MVNO concept Virgin Mobile was pitching to mobile operators was a joint venture, where both parties would have aligned incentives, rather than the often-contentious relationship that mobile operators had with resellers. A joint venture was created between Virgin Group and Sprint Corporation, and Dan Schulman was brought in to run the business. Virgin Mobile USA began operating in the summer of 2002. Because prepaid mobile had a downmarket perception at the time, Virgin Mobile USA called its service "pay as you go."
Initial public offering
In May 2007, Virgin Mobile USA, Inc. initiated an initial public offering (IPO) by filing with the United States Securities and Exchange Commission.
On October 10, 2007, Virgin Mobile's sold 27.5 million shares at US$15 per share, at the low end of the original $15–$17 prediction.
On November 15, 2007, approximately one month after the IPO, Virgin Mobile USA announced earnings for the three-month period ended September 30, 2007. The company reported that its third-quarter loss widened to $7.3 million, compared with a loss of $5.1 million in the year-ago quarter. The company also reported a pro-forma loss of 15¢ per share, compared with a loss of 10¢ per share in the year-ago period. , shares of the company's common stock had declined to $9.19 per share.
The company reported in 2007 that it held an exclusive license for the Virgin Mobile brand in the United States, U.S. Virgin Islands and Puerto Rico until the end of 2027. In exchange, Virgi |
https://en.wikipedia.org/wiki/The%20Sound%20of%20Jazz | "The Sound of Jazz" is a 1957 edition of the CBS television series The Seven Lively Arts and was one of the first major programs featuring jazz to air on American network television.
Overview
The one-hour program aired on Sunday, December 8, 1957, live from CBS Studio 58, the Town Theater at 851 Ninth Avenue in New York City. The show was hosted by New York Herald Tribune media critic John Crosby, directed by Jack Smight, and produced by Robert Herridge. Jazz writers Nat Hentoff and Whitney Balliett were consultants.
The Sound of Jazz features performances by musicians from the swing era, including Count Basie, Lester Young, Ben Webster, Billie Holiday, Jo Jones, and Coleman Hawkins; Chicago-style players of the same era, such as Henry "Red" Allen, Vic Dickenson, and Pee Wee Russell; and modern jazz musicians such as Gerry Mulligan, Thelonious Monk, and Jimmy Giuffre. These players played separately but also joined to combine styles in one group, such as Red Allen's group and the group backing Billie Holiday on "Fine and Mellow". The show's performance of "Fine and Mellow" reunited Holiday with her friend Lester Young for the final time. Jazz critic Nat Hentoff recalled that during rehearsals Holiday and Young kept to opposite sides of the room. Young was very weak, and Hentoff told him to skip the big band section of the show and that he could sit while performing in the group with Holiday.
During the performance of "Fine and Mellow", Webster played the first solo. "Then", Hentoff remembered:Lester got up, and he played the purest blues I have ever heard, and [he and Holiday] were looking at each other, their eyes were sort of interlocked, and she was sort of nodding and half–smiling. It was as if they were both remembering what had been—whatever that was. And in the control room we were all crying. When the show was over, they went their separate ways.Within two years, both Young and Holiday had died.
Noting that the cameras were employed as "straight reportorial tools", Jack Gould observed in a review in The New York Times, "It was the art of video improvisation wedded to the art of musical improvisation; the effect was an hour of enormously creative and fresh TV."
The album version of The Sound of Jazz telecast is derived from a rehearsal (recorded on December 4) that preceded the telecast held at Columbia's 30th Street studios) and is not the soundtrack. The album was released by Columbia in 1958. The recording does not include all of the performers present on the telecast (Mulligan refused to participate because no additional payment was involved) and includes several who were not on the show. Bassist Walter Page rehearsed and is featured on the album, but he collapsed on the way to the studio for the telecast.
Personnel
Trumpet – Red Allen, Emmett Berry, Doc Cheatham, Roy Eldridge, Joe Newman, Rex Stewart, Joe Wilder
Trombone – Bob Brookmeyer, Vic Dickenson, Benny Morton, Frank Rehak (LP only), Dickie Wells
Clarinet – Jimmy Giuffr |
https://en.wikipedia.org/wiki/Dissent%21 | Dissent! was the name taken for an international network of local groups, which came together to organise opposition to the G8 summit held in Gleneagles Hotel, Perthshire, Scotland in July 2005. Most groups shared an anti-capitalist orientation and anti-authoritarian organizing methods and the network declares itself to be open to anyone prepared to work within the Hallmarks of Peoples' Global Action, an international co-ordination of radical social movements and grassroots campaigns. Dissent acted as a networking tool and created infrastructure which was used by groups with methods of protest ranging from anti-border city tours and street parties to road blockades, graffiti and confrontations with the police.
The network was formed in the autumn of 2003 by a group of people who have previously been involved in radical ecological direct action, Peoples' Global Action, the anti-war movement and the global anti-capitalist movement which has emerged around meetings of those that rule over us.
In the run-up to the summit itself, groups associated with Dissent! organised actions targeting a number of the preparatory meetings which brought together ministers from the G8 countries. Among these were the Environment and Development Ministerial in Derbyshire (March 17–18) and the Justice and Interior Ministerial in Sheffield (June 15–18).
The network set-up an "eco-camp" known as HoriZone in the town of Stirling to host protesters. This was organised along non-hierarchical lines conforming with the principles of direct democracy and broken down into largely autonomous "barrios". The camp was also run in such a way as to minimise its environmental impact; recycling, conserving water and utilising biodiesel in its vehicles.
The Dissent! Network in Germany was one of the networks mobilising against the 33rd G8 summit in Heiligendamm, Germany, since 2005. Since that time other Dissent! Networks were started in Sweden, Netherlands, Spain, Belgium and France.
See also
31st G8 summit
G8 Alternatives
Make Poverty History
External links
Dissent! Homepage
Eco-village 'is model for us all' BBC article on "eco-camp"
Advocacy groups
Dissent
Anti-globalization organizations
Organizations established in 2005
G7 summits |
https://en.wikipedia.org/wiki/Venera%202 | Venera 2 ( meaning Venus 2), also known as 3MV-4 No.4 was a Soviet spacecraft intended to explore Venus. A 3MV-4 spacecraft launched as part of the Venera programme, it failed to return data after flying past Venus.
Venera 2 was launched by a Molniya carrier rocket, flying from Site 31/6 at the Baikonur Cosmodrome. The launch occurred at 05:02 UTC on 12 November 1965, with the first three stages placing the spacecraft and Blok-L upper stage into a low Earth parking orbit before the Blok-L fired to propel Venera 2 into heliocentric orbit bound for Venus, with perihelion of 0.716 AU, aphelion of 1.197 AU, eccentricity of 0.252, inclination of 4.29 degrees and orbital period of 341 days.
The Venera 2 spacecraft was equipped with cameras, as well as a magnetometer, solar and cosmic x-ray detectors, piezoelectric detectors, ion traps, a Geiger counter and receivers to measure cosmic radio emissions. The spacecraft made its closest approach to Venus at 02:52 UTC on 27 February 1966, at a distance of .
During the flyby, all of Venera 2's instruments were activated, requiring that radio contact with the spacecraft be suspended. The probe was to have stored data using onboard recorders, and then transmitted it to Earth once contact was restored. Following the flyby the spacecraft failed to reestablish communications with the ground. It was declared lost on 4 March 1966. An investigation into the failure determined that the spacecraft had overheated due to a radiator malfunction.
See also
List of missions to Venus
References
Spacecraft launched in 1965
1965 in the Soviet Union
Venera program
Derelict satellites in heliocentric orbit
3MV |
https://en.wikipedia.org/wiki/Venera%205 | Venera 5 ( meaning Venus 5) was a space probe in the Soviet space program Venera for the exploration of Venus.
Venera 5 was launched towards Venus to obtain atmospheric data. The spacecraft was very similar to Venera 4 although it was of a stronger design. The launch was conducted using a Molniya-M rocket, flying from the Baikonur Cosmodrome.
When the atmosphere of Venus was approached, a capsule weighing and containing scientific instruments was jettisoned from the main spacecraft. During satellite descent towards the surface of Venus, a parachute opened to slow the rate of descent. For 53 minutes on 16 May 1969, while the capsule was suspended from the parachute, data from the Venusian atmosphere were returned. It landed at . The spacecraft also carried a medallion bearing the State Coat of Arms of the Soviet Union and a bas-relief of Lenin to the night side of Venus.
Given the results from Venera 4, the Venera 5 and Venera 6 landers contained new chemical analysis experiments tuned to provide more precise measurements of the atmosphere's components. Knowing the atmosphere was extremely dense, the parachutes were also made smaller so the capsule would reach its full crush depth before running out of power (as Venera 4 had done).
Instruments
Spaceship
Instrument KS-18-3M to study the flows of cosmic particles;
Instrument LA-2U to determine the distribution of oxygen and hydrogen in the planet's atmosphere.
Lander
Pressure sensors MDDA A to measure atmospheric pressure in the range of ;
G-8 gas analyzers to determine the chemical composition of the atmosphere;
TTI unit to determine the density of the atmosphere at an altitude;
FD-69 for atmospheric lighting measurements;
CE-164D to determine the temperature at the height of the atmosphere.
Mission
Venera 5 was launched into an Earth parking orbit on 5 January 1969 at 06:28:08 UT and then from a Tyazheliy Sputnik (69-001C) towards Venus. After a mid-course maneuver on 14 March 1969, the probe was released from the bus on 16 May 1969 at a distance of from Venus. The probe entered the nightside atmosphere at 06:01 UT and when the velocity slowed to 210 m/s the parachute deployed and transmissions to Earth began. The probe sent read-outs every 45 seconds for 53 minutes before finally succumbing to the temperature and pressure at roughly and .
The photometer detected a light level of 250 watts per square meter and confirmed the high temperatures, pressures, and carbon dioxide composition of the atmosphere found by Venera 4.
See also
List of missions to Venus
References
External links
Astronautix.com
Venera program
Derelict landers (spacecraft)
Spacecraft launched in 1969
1969 in the Soviet Union
2MV |
https://en.wikipedia.org/wiki/Message%20passing | In computer science, message passing is a technique for invoking behavior (i.e., running a program) on a computer. The invoking program sends a message to a process (which may be an actor or object) and relies on that process and its supporting infrastructure to then select and run some appropriate code. Message passing differs from conventional programming where a process, subroutine, or function is directly invoked by name. Message passing is key to some models of concurrency and object-oriented programming.
Message passing is ubiquitous in modern computer software. It is used as a way for the objects that make up a program to work with each other and as a means for objects and systems running on different computers (e.g., the Internet) to interact. Message passing may be implemented by various mechanisms, including channels.
Overview
Message passing is a technique for invoking behavior (i.e., running a program) on a computer. In contrast to the traditional technique of calling a program by name, message passing uses an object model to distinguish the general function from the specific implementations. The invoking program sends a message and relies on the object to select and execute the appropriate code. The justifications for using an intermediate layer essentially falls into two categories: encapsulation and distribution.
Encapsulation is the idea that software objects should be able to invoke services on other objects without knowing or caring about how those services are implemented. Encapsulation can reduce the amount of coding logic and make systems more maintainable. E.g., rather than having IF-THEN statements that determine which subroutine or function to call a developer can just send a message to the object and the object will select the appropriate code based on its type.
One of the first examples of how this can be used was in the domain of computer graphics. There are various complexities involved in manipulating graphic objects. For example, simply using the right formula to compute the area of an enclosed shape will vary depending on if the shape is a triangle, rectangle, ellipse, or circle. In traditional computer programming this would result in long IF-THEN statements testing what sort of object the shape was and calling the appropriate code. The object-oriented way to handle this is to define a class called Shape with subclasses such as Rectangle and Ellipse (which in turn have subclasses Square and Circle) and then to simply send a message to any Shape asking it to compute its area. Each Shape object will then invoke the subclass's method with the formula appropriate for that kind of object.
Distributed message passing provides developers with a layer of the architecture that provides common services to build systems made up of sub-systems that run on disparate computers in different locations and at different times. When a distributed object is sending a message, the messaging layer can take care of issues such as:
|
https://en.wikipedia.org/wiki/Dataflow%20architecture | Dataflow architecture is a dataflow-based computer architecture that directly contrasts the traditional von Neumann architecture or control flow architecture. Dataflow architectures have no program counter, in concept: the executability and execution of instructions is solely determined based on the availability of input arguments to the instructions, so that the order of instruction execution may be hard to predict.
Although no commercially successful general-purpose computer hardware has used a dataflow architecture, it has been successfully implemented in specialized hardware such as in digital signal processing, network routing, graphics processing, telemetry, and more recently in data warehousing, and artificial intelligence (as: polymorphic dataflow Convolution Engine, structure-driven, dataflow scheduling). It is also very relevant in many software architectures today including database engine designs and parallel computing frameworks.
Synchronous dataflow architectures tune to match the workload presented by real-time data path applications such as wire speed packet forwarding. Dataflow architectures that are deterministic in nature enable programmers to manage complex tasks such as processor load balancing, synchronization and accesses to common resources.
Meanwhile, there is a clash of terminology, since the term dataflow is used for a subarea of parallel programming: for dataflow programming.
History
Hardware architectures for dataflow was a major topic in computer architecture research in the 1970s and early 1980s. Jack Dennis of MIT pioneered the field of static dataflow architectures while the Manchester Dataflow Machine and MIT Tagged Token architecture were major projects in dynamic dataflow.
The research, however, never overcame the problems related to:
Efficiently broadcasting data tokens in a massively parallel system.
Efficiently dispatching instruction tokens in a massively parallel system.
Building content-addressable memory (CAM) large enough to hold all of the dependencies of a real program.
Instructions and their data dependencies proved to be too fine-grained to be effectively distributed in a large network. That is, the time for the instructions and tagged results to travel through a large connection network was longer than the time to do many computations.
Nonetheless, out-of-order execution (OOE) has become the dominant computing paradigm since the 1990s. It is a form of restricted dataflow. This paradigm introduced the idea of an execution window. The execution window follows the sequential order of the von Neumann architecture, however within the window, instructions are allowed to be completed in data dependency order. This is accomplished in CPUs that dynamically tag the data dependencies of the code in the execution window. The logical complexity of dynamically keeping track of the data dependencies, restricts OOE CPUs to a small number of execution units (2-6) and limits the execution window size |
https://en.wikipedia.org/wiki/Standard%20Radio%20%26%20Telefon%20AB | Standard Radio & Telefon AB (SRT) was a Swedish telecommunications and computer manufacturer, at one time part of the ITT Corporation.
The factory was located in Bromma, north of Stockholm. They developed a range of HF radio products.
They developed an advanced mainframe as well as a computer terminal called Alfaskop that became an export success. A bit much of a success, since an export of a system for air traffic control to Moscow caused a diplomatic incident.
More products :
VFT - Voice Frequency Telegraph system
ARTRAC - Automatic Radio TRAffic Controller
AEC 90 - Modem for SITOR, Simplex Teleprinting over Radio
TD 90 - HF Transmitter Driver
TD 91 - HF Transmitter Driver
CR 90 - HF Communication receiver
CR 91 - HF Communication receiver
SSA 400 - 400W HF Solid State Power Amplifier
SSA 420 - 400W HF Solid State Power Amplifier
SSA 1000 - 1000W Solid State Power Amplifier
SSA 1020 - 1000W Solid State MOSFET Power Amplifier
ATM 1000 - Automatic Antenna Coupler
BBD-367 - HF Broadband Dipole Antenna
Ra 200 - 8W HF Manpack Receiver-Transmitter for the Swedish military
***
List of customers :
* Swiss embassies
* Turkish embassies
* Malaysian embassies
* Algeria Civil Aviation Administration
* Interpol Stockholm and Zurich
* Ministry of Foreign Affairs, Stockholm. ( small system, they used Drake)
* HF system for Istanbul airport
* Selcall for Hercules aircraft, Arlanda
* Receivers and transmitters for the Danish Navy, still in use
* Receivers and transmitters for the Swedish Army,Navy and Air Force
* Receivers and transmitters for fixed, air/ground and maritime services, Swedish Telecommunications Administration, still in use
***
Some details about the Turkish Embassy Radio system :
The transmitter was the old driver CTD 500 with SSA 400 or SSA 1000. Receiver was the CR 300, two of them in the cabinet. The intention was to use space diversity. No place for two "real" Antennas, the second receiver got an active antenna AA300. Each receiver had a FSK demodulator, CRFD 1000.
The main use for the second receiver became a broadcast receiver. The system used FEC, equipment from Siemens, FEC 100. It could handle a total loss of signal for 1,5 second.
Antennas used was a logper from Granger, 6- 30 MHz. This Antenna used wires instead of solid elements. Some stations got an ATU 1000 with a 10m whip.
The teleprinter came from SAGEM, similar to Siemens T100.
Some 30-40 embassies was installed, from Washington in the West to Beijing in the East. The main station in Ankara had 12 Transmitters, remote controlled. some 400W some 1000 W. Remote control was via " Voice Frequency Telegraph" VFT system made by SRT.
Before SRT got the order a test system was set up between Berne and Ankara, everything worked fine and MOFA in Ankara signed the order.
References
Defunct manufacturing companies of Sweden
Telecommunications companies of Sweden
Electronics companies of Sweden |
https://en.wikipedia.org/wiki/SMIL | SMIL or Smil may refer to:
SMIL (computer), a Swedish first-generation computer
Synchronized Multimedia Integration Language, a www-standard markup language for multimedia presentations, including playlists and animated SVGs
Vaclav Smil (born 1943), Czech-Canadian scientist and policy analyst
smil.mil, an access to SIPRNet
Izmail, a town in Ukraine sometimes known in Romanian as
See also
Smile (disambiguation) |
https://en.wikipedia.org/wiki/AppleTalk%20Remote%20Access | AppleTalk Remote Access, or ARA, was a protocol stack that allowed AppleTalk to be run over modems. It became a fairly major product for Apple Computer in the early to mid-1990s when their first portable and laptop computers were available (and very popular). ARA slowly disappeared in the late 1990s when TCP/IP took over the vast majority of networking needs, notably remote access.
Most networking protocols have strong "layering" that separates the various jobs inside the protocol into different pieces of software. This allows them to be run on top of any hardware by replacing the low lowest-delftware, the hardware drivers. For instance, IP can be made to run on a variety of Ethernet cards or even Token Ring with little effort. For slower speeds, like on modems, things become somewhat more difficult, as the protocols often have "invisible" assumptions about timing and performance that make it inefficient with very limited bandwidth.
AppleTalk included miniatures that made this even more difficult. In particular, AppleTalk had several internal tasks for discovery and naming that ran all the time and made the protocol "chatty". This added to the bandwidth problems, making it even less efficient in this case.
Thus ARA was considerably more complex than similar solutions for IP, replacing many parts of the AppleTalk stack and seriously modifying others. As a result, ARA was quite large, larger than the basic AppleTalk stack, and somewhat memory hungry. It was also slow, a problem it shared with IP at similar speeds.
Nevertheless, ARA was the only protocol available, and also shared the typical Apple properties of being easy to install, set up and run. It became a fairly profitable product on its own, and was sold widely in stores. However the introduction of SLIP and the increased use of IP on the Macintosh led to some infighting within Apple as the profits from ARA were reduced. This led Apple to place their IP remote access software in ARA as well, although this had the side effect of making various freeware implementations much more popular. As support for TCP/IP was added, the product line became known as Apple Remote Access. Later versions supported AppleTalk connections over ARAP and TCP/IP connections over PPP.
ARA remained important, if somewhat less so, product for Apple into the late 1990s. In Mac OS X it is no longer required, as Apple has migrated the vast majority of its networking software to IP, and includes remote access software for free.
Apple Inc. software |
https://en.wikipedia.org/wiki/Deflection%20routing | Deflection routing is a routing strategy for networks based on packet switching which can reduce the need of buffering packets. Every packet has preferred outputs along which it wants to leave the router, and when possible, a packet is sent along one of these outputs. However, two or more packets may want to leave along the same output (which is referred to as a contention among packets), and then only one of the packets may be sent along the link, while the others are sent along available outputs, even though the other links are not preferred by the packets (because, for instance, those links do not yield shortest paths).
Depending on the rate of incoming packets and the capacity of the outgoing links, deflection routing can work without any packet buffering. Of course, it is always possible to simply drop packets in a network with a best-effort delivery strategy.
See also
Cut-through switching
Dynamic Alternative Routing
Hot-potato routing
References
Routing |
https://en.wikipedia.org/wiki/Sun%20RPC |
Open Network Computing (ONC) Remote Procedure Call (RPC), commonly known as Sun RPC is a remote procedure call system. ONC was originally developed by Sun Microsystems in the 1980s as part of their Network File System project.
ONC is based on calling conventions used in Unix and the C programming language. It serializes data using the External Data Representation (XDR), which has also found some use to encode and decode data in files that are to be accessed on more than one platform. ONC then delivers the XDR payload using either UDP or TCP. Access to RPC services on a machine are provided via a port mapper that listens for queries on a well-known port (number 111) over UDP and TCP.
ONC RPC was described in RFC 1831, published in 1995. RFC 5531, published in 2009, is the current version. Authentication mechanisms used by ONC RPC are described in RFC 2695, RFC 2203, and RFC 2623.
Implementations of ONC RPC exist in most Unix-like systems. Microsoft supplies an implementation for Windows in their Microsoft Windows Services for UNIX product; in addition, a number of third-party implementation of ONC RPC for Windows exist, including versions for C/C++, Java, and .NET (see external links).
In 2009, Sun relicensed the ONC RPC code under the standard 3-clause BSD license and then reconfirmed by Oracle Corporation in 2010 following confusion about the scope of the relicensing.
ONC is considered "lean and mean", but has limited appeal as a generalized RPC system for WANs or heterogeneous environments. Systems such as DCE, CORBA and SOAP are generally used in this wider role.
See also
XDR - The grammar defined in RFC 1831 is a small extension of the XDR grammar defined in RFC 4506
DCE
XML-RPC
References
Notes
External links
RFC 1050 - Specifies version 1 of ONC RPC
RFC 5531 - Specifies version 2 of ONC RPC
Remote Procedure Calls (RPC) — A tutorial on ONC RPC by Dr Dave Marshall of Cardiff University
Introduction to RPC Programming — A developer's introduction to RPC and XDR, from SGI IRIX documentation.
Sun ONC Developer's guide
Netbula's PowerRPC for Windows (ONC RPC for Windows with extended IDL)
Netbula's JRPC (ONC RPC for Java)(supports J2SE, J2ME and Android
ONC/RPC Implementation of the University of Aachen (Germany)
Remote Tea (LGPL Java Implementation)
Remote Tea .Net (LGPL C# Implementation)
Distinct Corporation's ONC RPC for Windows
Linux Journal article on ONC RPC
Java NIO based ONC RPC library
Application layer protocols
Internet Standards
Remote procedure call
Sun Microsystems software
Unix software |
https://en.wikipedia.org/wiki/Telecoms%20%26%20Internet%20converged%20Services%20%26%20Protocols%20for%20Advanced%20Networks | The Telecoms & Internet converged Services & Protocols for Advanced Networks (TISPAN) is a standardization body of ETSI, specializing in fixed networks and Internet convergence. It was formed in 2003 from the amalgamation of the ETSI bodies Telecommunications and Internet Protocol Harmonization Over Networks (TIPHON) and Services and Protocols for Advanced Networks (SPAN).
TISPAN's focus is to define the European view of the Next Generation Networking (NGN), though TISPAN also includes much participation from regions outside Europe.
TISPAN NGN Release 1 was published in December 2005 and contained the architectural foundations and basic specifications required in support of PSTN replacement. The TISPAN NGN architecture is based on sharing common components between cooperating subsystems. The TISPAN NGN architecture complies with the general reference model for next generation networks defined in ITU-T Recommendation Y.2011 [1] and is therefore layered with a service stratum and a transport stratum. Each of these layers is further decomposed into sub-systems that perform specific roles within the overall architecture. This allows new subsystems to be added over time to cover new demands and service classes. By making network resources, applications, and user equipment common to all subsystems, it ensures mobility of users, terminals and services as much as possible, even across administrative boundaries. A key subsystem is based on the architectures of 3rd Generation Partnership Project (3GPP) IP Multimedia Subsystem (IMS). TISPAN has been working with 3GPP to extend the IMS architecture with capabilities required in support of wire-line access.
TISPAN NGN Release 2 was finalized early 2008, and added support for IPTV services and Business Communications over the IMS.
Since early 2008, TISPAN has begun work on the third release of its NGN specifications with prime focus on IPTV enhancements, Content Delivery Networks (CDN) and home networking. In 2011, TISPAN published the specification of a functional architecture for Content Delivery Networks (CDN) and is now working on the specification of the protocols applicable to the reference points identified in this architecture (See ETSI TS 182 019)
The ETSI website on Next Generation Networking states:
"Standards for fixed NGN were developed by the now closed ETSI technical committee TISPAN. The TC has adopted the 3GPP™ core IMS specifications using Internet (SIP) protocols to allow features such as Presence, IPTV, Messaging, and Conferencing to be delivered irrespective of the network in use. Maintenance of NGN standards are now the responsibility of TC NTECH."
References
External links
Official TISPAN web site
An introduction to the TISPAN architecture
Standards organizations |
https://en.wikipedia.org/wiki/AXS%20TV | AXS TV is an American cable television channel. Majority-owned by Anthem Sports & Entertainment, it is devoted primarily to music-related programming (such as concert films, documentaries, and reality series involving musicians) and combat sports – including boxing, mixed martial arts and professional wrestling.
The network was originally established in 2001 as HDNet, with investor Mark Cuban as a founding partner. HDNet was originally intended as an exclusively-high-definition network, carrying films and acquired television series, concerts, news programming, and sporting events produced in the format.
HDNet's original niche became increasingly redundant as more cable networks established their own HD feeds. In 2012, HDNet sold ownership stakes to Anschutz Entertainment Group (AEG), Creative Artists Agency, and Ryan Seacrest, with Cuban retaining a majority stake. It then relaunched under its current name–taken from AEG's online ticket platform AXS.com–on July 2, 2012, pivoting to a format based on music and popular culture. In September 2019, Canadian broadcaster Anthem Sports & Entertainment acquired a majority stake in AXS TV, with AEG and Cuban retaining minority stakes.
AXS TV is available to 50 million households in the United States as of December 2020.
History
The network originally launched as HDNet on September 6, 2001, designed as a high definition-exclusive service under the ownership of HDNet, LLC, which then was co-owned by Mark Cuban, owner of the Dallas Mavericks, and Philip Garvin, owner of Colorado Studios and Mobile TV Group. Originally, the network aired a variety of programming, much of it male-oriented, prominently featuring series, sports events, and concert performances. In December 2001 and January 2002, HDNet aired exclusive HD coverage of the U.S. invasion of Afghanistan with former CNN correspondent Peter Arnett. In February 2002, the network originated eight daily hours of high definition content from the 2002 Winter Olympics in Salt Lake City; this feed was picked up by NBC and aired in 24-hour rotation on the digital signals of NBC's stations. Later on that year, it signed a deal with Paramount Domestic Television to provide high-definition versions of the Paramount library.
The channel gradually expanded its carriage to the satellite providers DirecTV and Dish Network, as well as the cable providers Charter Communications, Insight Communications, Mediacom, Suddenlink Communications, Verizon FiOS, and AT&T U-verse. On September 4, 2008, Cuban announced that the network had reached an agreement with Comcast to carry both HDNet and HDNet Movies in various markets. The provider began to carry HDNet in many major markets on September 30, 2010. In November 2009, DirecTV became the first provider to offer video-on-demand services of HDNet and HDNet Movies.
AXS TV
On January 18, 2012, HDNet, LLC entered into a joint venture with entertainment company/promoter Anschutz Entertainment Group, media personality Ryan S |
https://en.wikipedia.org/wiki/Control%20panel | Control panel may refer to:
Control panel (engineering), a flat, often vertical, area where control instrumentation is mounted
Control panel (software), the tool in the operating system which allows most or all of the settings to be changed through a user interface
Control Panel (Windows)
System Preferences, a computer program in the macOS operating system
Web hosting control panel
Plugboard, also called a control panel
See also
Telephone switchboard, a manual exchange
Patch panel
Dashboard |
https://en.wikipedia.org/wiki/Kansai%20Telecasting%20Corporation | JODX-DTV, virtual channel 8 (UHF digital channel 17), branded as or , is the Kansai region key station of the Fuji News Network (FNN) and Fuji Network System (FNS), operated by the . Kansai TV is a company affiliated in Hankyu Hanshin Holdings Group of Hankyu Hanshin Toho Group.
History
In 1952, when the Ministry of Posts announced the first channel plan for Tokyo, Osaka, and Nagoya, "TV Osaka" (テレビ大阪, not the current TV Osaka) initiated by the Sankei Shimbun, as well as Kyoto Broadcasting and Kobe Broadcasting, applied for a TV license in the Osaka area. However, the TV license in the Osaka area was later obtained by Osaka TV Broadcasting, a joint operation of Asahi Broadcasting and New Japan Broadcasting (now Mainichi Broadcasting). Afterwards, when the Ministry of Posts and Telecommunications released a new channel frequency plan again, the Sankei Shimbun and Hankyu Electric Railway applied for a TV license in the name of "Kansai TV Broadcasting" (Japanese: 関西テレビ放送) to apply for a TV license in its name. The two were integrated into "Dai Kansai TV Broadcasting" (大関西テレビ放送) in June 1957, and obtained a TV license on July 8 of the same year. On February 1, 1958, the Great Kansai TV Broadcasting Formally established, and changed the company name to "Kansai Telecasting Corporation" in July of the same year. With the completion of the signal launch station in September 1958 and the completion of the headquarters building in October, the conditions for Kansai TV to start broadcasting were ripe.
At 16:30 on November 22, 1958, Kansai TV Station officially started broadcasting. The first program broadcast was "This is Commercial" (これがコマーシャルだ) which lasted for one and a half hours, introducing the general situation of Kansai TV and the information from East and West House. The History of Advertising From Beginning to Broadcast TV Advertising. On the evening of the first day of the broadcast, the commemorative performance held at the Umeda Theater, as well as movies and news programs were broadcast. At the beginning of the broadcast, since Kansai TV did not join any network, 95% of Kansai TV's programs were self-made except for news. It was not until Tokai TV in December of the same year and Fuji TV and Kyushu Asahi Broadcasting in March of the following year that Kansai TV had the support of a network, and was able to reduce the number of self-produced programs to save costs, and the proportion of self-produced programs was also reduced to about 40%. Kansai TV also participated in the 1959 broadcast of the wedding of the crown prince (the current emperor) Akihito and Michiko Masada. This wedding also became a major opportunity for the popularization of television in Japanese households[8]:14. Kansai TV also achieved the first program broadcast from the seabed in the Japanese private TV industry in this year, and won the People's Congress Award for this. were broadcast. At the beginning of the broadcast, since Kansai TV did not join any network, 95% of |
https://en.wikipedia.org/wiki/WFM | WFM may refer to:
Science and technology
Waveform monitor a type of oscilloscope used to monitor video signals
Wired for Management, an Intel standard for managing computer systems
Wideband FM, a form of frequency modulated radio
Organisations
Western Federation of Miners, an American labor union
Whole Foods Market, an American foods supermarket
World Federalist Movement/Institute for Global Policy, a global citizens movement
Other
Wallace Fard Muhammad, founder of the Nation of Islam
Woman FIDE Master, a title awarded by FIDE to women chess players after fulfilling certain requirements
Workforce management, the activities related to a company's employees
WFM (motorcycle), defunct Polish motorcycle manufacturer |
https://en.wikipedia.org/wiki/Tohoku%20Broadcasting%20Company | is a Japanese TV and radio network affiliated with the Japan News Network (JNN). Its headquarters are located in Miyagi Prefecture, Tōhoku region.
History
Tohoku Shimbun established "Kita Nippon Commercial Broadcasting Co., Ltd." in December 1947, which was the first attempt to establish a private radio station in northeastern Japan. However, the occupied government of the time didn't permit private broadcasters to begin operating, causing the plan to collapse. After the "Three Radio Laws" were passed in 1950, three companies in Miyagi Prefecture, Tohoku Shinpo, Tohoku Broadcasting and Sendai Municipal Broadcasting, applied to establish private radio stations. The latter three companies were integrated into "Radio Sendai Co., Ltd.", and the company name was changed to Sendai Broadcasting on February 22, 1951, and a preliminary license was obtained on April 21.
On December 10, Sendai Broadcasting officially registered as a company, but still used the name "Sendai Radio" when broadcasting. On April 5 of the following year, Sendai Radio began trial broadcasting. On May 1, Radio Sendai officially launched, becoming the first private radio station in the Tohoku region and the 11th private radio station in Japan. In January 1953, Sendai Broadcasting Tohoku the company name to Tohoku Broadcasting. In the same year, Northeast Broadcasting implemented stock dividends for the first time.
Northeast Broadcasting received its preliminary television license on November 22, 1957. In order to prepare for broadcasting television, Northeast Broadcasting began to build a television headquarters in 1958. On March 14, 1959, TBC began its pilot TV service. On April 1, TBC officially started broadcasting TV programs, becoming the first private TV station in Tohoku. Shortly after the broadcast, Tohoku Broadcasting participated in the broadcast of the wedding of Crown Prince Akihito and Masada Michiko. Tohoku Broadcasting joined JNN in the same year as the TV broadcast and was one of the founding members of JNN. On the occasion of its 10th anniversary, Tohoku Broadcasting adopted a new logo designed by Yusaku Kamekura in 1961. The following year, Tohoku Broadcasting donated a fountain to the Sendai City Hall. Tohoku Broadcasting decided to build a new headquarters, Tohoku Broadcasting Hall, in Yagiyama in 1961. This building has 5 floors and is adjacent to the existing TV headquarters. The total floor area is 11,111 square meters. It was completed on May 6, 1963. Starting from August 1 of the same year, the Northeast Broadcasting Department began to operate in the Tohoku Broadcasting Hall.
TBC began broadcasting color TV on October 1, 1964, and was the first private TV station in Tohoku to start broadcasting color TV. Later, Tohoku Broadcasting realized full-color broadcast of the 1964 Tokyo Olympics. In 1967, on the occasion of the 15th anniversary of the launch of the station, Tohoku Broadcasting went to various parts of the West Coast of the United States to coll |
https://en.wikipedia.org/wiki/Mel%20Bush | Melanie "Mel" Bush is a fictional character played by Bonnie Langford in the long-running British science fiction television series Doctor Who. A computer programmer from the 20th century who is a companion of the Sixth and Seventh Doctors, she was a regular in the programme from 1986 to 1987. Mel appeared in six stories (20 episodes), and is the penultimate companion of the classic series.
Character biography
Mel first appears in the serial Terror of the Vervoids, part of the 14-part story The Trial of a Time Lord. At this point, she and the Sixth Doctor have been travelling together for some time. The events of Vervoids are shown as part of a Matrix projection of future events being shown by the Sixth Doctor to the court, so, from his point of view, he is seeing an adventure he will have with Mel even before he meets her in his own timeline. She is subsequently summoned to the courtroom herself. At the end of Trial, the Sixth Doctor leaves with this future Mel, intending to return her to her correct time. (This scenario is portrayed by The Trial of a Time Lord screenwriters Pip and Jane Baker in their novelisation of the final segment of that season, The Ultimate Foe.)
Mel is at present the only one of the Doctor's companions never to have her actual first adventure with the Doctor chronicled on screen. Series producer John Nathan-Turner indicated his intent to chronicle this adventure in Season 24, which would have followed Trial of a Time Lord. However, the subsequent departure of lead actor Colin Baker prior to production of the new season made this impossible.
Mel is a computer programmer from the 20th century who originates from the village of Pease Pottage in West Sussex, England. She has an eidetic memory, and a cheery, almost perky personality. She greets most situations with a warm smile and good humour, and is an optimist whose views extend to believing the best of people's natures, but can also scream with the best of them. She is a health enthusiast and a vegetarian, often encouraging the slightly portly Sixth Doctor to exercise more and drink carrot juice. She is present (albeit unconscious at the time) when the Sixth Doctor regenerates into his seventh incarnation, and continues to travel with him.
In the serial Dragonfire, she reunites with the galactic confidence trickster, Sabalom Glitz, whom she met in The Trial of a Time Lord and decides to travel with him aboard the Nosferatu II, leaving the Seventh Doctor with new companion Ace.
Langford reprised her role as Mel in the 2022 special, "The Power of the Doctor", alongside several other former companions who have gathered together as a support group to talk of their experiences with the Doctor. In October 2023, it was revealed that Langford would appear in the 60th anniversary specials alongside David Tennant's Fourteenth Doctor. This followed on from an announcement in June 2023 when it was announced that she would return again to the role in 2024 in the fourteenth series |
https://en.wikipedia.org/wiki/RCC%20Broadcasting | RCC Broadcasting Company (株式会社中国放送 Kabushiki Gaisha Chugoku Hoso; later name: RCC) is a Japanese broadcaster which serves the Hiroshima region. It is a member of JRN and NRN networks for radio and JNN for television.
History
Early history
Alongside the planned expansion of private broadcasting across Japan after the passage of the "Three Radio Laws" in 1950, two companies, "Hiroshima Heiwa Broadcasting" and "Radio Hiroshima" applied for the establishment of private radio stations. Later, the two companies merged after the Radio Supervisory Committee's advice. On April 21, 1951, Hiroshima Broadcasting (the new company after two companies merged) was granted a license and on February 25 the following year, they held the promoters' meeting and received funding from newspapers Asahi Shimbun and Mainichi Shimbun.
On August 8, 1952, Hiroshima Broadcasting was renamed to Radio Chugoku after a general meeting of shareholders. Radio Chugoku started broadcasting on October 1, 1952, at 6:30 am operating for at least 16 hours and 30 minutes every day.
Expansion to TV broadcasting and further developments
In 1954, Radio Chugoku applied for a TV license, and received a preliminary TV license on October 22, 1957. On March 17, 1959, Radio Chugoku began TV broadcast trials. Radio Chugoku started TV broadcasts on April 1, 1959 Also in the same year, it joined the Japan News Network.
During its early operations, the broadcaster didn't have any professional TV studios which resulted its radio studio being multipurposed for TV broadcasts. It was then decided that a new headquarters will be built in Motomachi (which started on November 5, 1960), adjacent to the Hiroshima Castle. On October 19, 1960, Radio Chugoku started broadcasting on its newly built headquarters.
On March 20, 1966, Chugoku Radio and Television began TV broadcasting in color. On April 1 of the same year, it started uninterrupted TV broadcasts. The company was then renamed to Chugoku Broadcasting on April 1, 1967 to reflect its TV and radio operations.
Since the mid-60s, RCC produced documentaries with foreign productions. These include a documentary about Japanese immigrants in Hawaii in 1965 and about Hiroshima City and Volgograd becoming sister cities in 1968.
On April 15, 1970, NPB Opening Day, RCC aired the first color Hiroshima Toyo Carp local game broadcasts for its broadcast markets. Chugoku Broadcasting became an official broadcaster for airing highlights of the Hiroshima Flower Festival since it started in 1977.
On October 1, 2006, RCC started digital broadcasting and ended analog broadcasts on July 24, 2011.
Network
TV
Japan News Network (JNN) and TBS Network
Radio
Japan Radio Network (JRN)
National Radio Network (NRN)
Station list
TV
Analog
Hiroshima JOER-TV 4CH
Onomichi JOEE-TV 10CH
Fukuyama 7CH
Miyoshi, Kure, Higashihiroshima-Saijo 9CH
Higashihiroshima-Kurose 60CH
Digital (Button 3)
Hiroshima JOER-DTV 18CH
Kure 18CH
Fukuyama 16CH
AM Radio
Stereo
Hiro |
https://en.wikipedia.org/wiki/Nippon%20News%20Network | Nippon News Network (NNN) is a Japanese commercial television network owned by Nippon Television (NTV), which itself is controlled by The Yomiuri Shimbun Holdings. The network's responsibility includes the syndication of national television news bulletins to its regional affiliates, and news exchange between the stations.
NNN also operates NTV News24, a 24-hour news channel available on subscription television platforms and also aired on select NNN affiliates during overnights.
Distribution of non-news television programmes is handled by Nippon Television Network System (NNS), another network set up by NTV.
Overview
In the early days of the development of commercial terrestrial broadcasting in Japan, the allocation of broadcast frequencies had a major impact on the selection of core bureaus by broadcasters outside the Kanto Region. Therefore, all commercial broadcasters in the Shikoku Region chose to be part of the Nippon TV network while those in Kyushu Region chose to be part of the Japan News Network. After the launch of Nippon TV in 1953, the broadcaster then aired its first proper news bulletins which includes NNN Today's Events (first aired in 1954), NNN News Flash (first aired in 1956), and Nippon TeleNews (first aired 1958).
On April 1, 1960, Japan News Network (where Tokyo Broadcasting System is part of) was established, being the first proper commercial group of networks in the country.
NNN was formed on April 1, 1966, centering on Nippon Television (NTV) and Yomiuri Television (ytv).
Osaka Television Broadcasting (OTV, current Asahi Broadcasting Television/ANN member), an early network station of NTV, Chubu Nippon Broadcasting (CBC, current CBC Television), Hokkaido Broadcasting (HBC), Radio Kyushu (RKB, current RKB) Mainichi Broadcasting Corporation) received 'Tokyo Telenews' from Radio Tokyo (→ Tokyo Broadcasting, now TBS Television) networked, so there was no network news at NTV until the opening of West Japan Broadcasting (RNC).
When NNN was launched, there were no affiliated stations throughout Kyushu, including Fukuoka Prefecture (At the time NNN was launched, Nippon Television set up a Kyushu branch office in Fukuoka). Also, in the Chukyo area, secondary affiliations continued for a long time (Nagoya TV → Chukyo TV), and it took more time to create a system than JNN and FNN (The first stations in the Sea of Japan area of Tohoku, Toyama, Fukui, Yamanashi, 4 prefectures of Shikoku, Tottori and Yamaguchi are all NNN affiliates).
Kagoshima Yomiuri Television joined in 1994, completing the current system. It consists of 27 full stations and 3 cross-net stations (Fukui Broadcasting as a primary NNN affiliate, NNN secondary, TV Oita as an FNN/NNN station, TV Miyazaki as a triple FNN/NNN/ANN station) for a total of 30 stations, making it the largest in Japan. There are no NNN (NNS) affiliated stations in Saga Prefecture and Okinawa Prefecture. In addition, there are 11 stations operating radio and television simultaneously.
The |
https://en.wikipedia.org/wiki/All-Nippon%20News%20Network | All-Nippon News Network (ANN; ) is a Japanese commercial television network run by TV Asahi Corporation (TV Asahi) in Tokyo, which is controlled by The Asahi Shimbun Company. The network's responsibility includes the syndication of national television news bulletins to its regional affiliates, and news exchange between the stations. Its affiliate stations also broadcast non-news programs originating from TV Asahi. Founded on 1 January 1970, and formalised on 1 April 1974, ANN is made up of 26 affiliates, including two stations that are double- or triple-affiliated with rival networks.
Between 1989 and 2013, it also operated the 24-hour satellite and cable news channel Asahi Newstar.
List of affiliates
Stations are listed mostly in Japanese order of prefectures which is mirrored in ISO 3166-2:JP, with exceptions for the Kantō region, Aichi-Gifu-Mie, Kansai region (except Mie) and Okayama-Kagawa, which form single wide broadcasting markets respectively.
Areas without an ANN station
Former affiliate stations
Single asterisk (*) indicates former primary affiliate
Affiliates that initially wanted to join but later withdrew
JapaNews24
Since at least 2018, ANN operates JapaNews24 (), an around-the-clock online feed aimed mainly at Japanese people abroad, available on ANN's official YouTube channel. JapaNews24 airs continuously news stories from ANN newscasts and programmes such as Hōdō Station, as well as content from sister service AbemaNews, on tape delay without a fixed schedule.
References
External links
News at TV Asahi
Television channels and stations established in 1970 |
https://en.wikipedia.org/wiki/Hearts%20of%20Iron%20II | Hearts of Iron II is a grand strategy computer war game for Microsoft Windows based upon its predecessor, Hearts of Iron, which was developed by Paradox Development Studio and published by Paradox Interactive.
It takes place in the time period from 1 January 1936 (1933 with an expansion) through 30 December 1947 (1964 with an expansion), and allows the player to assume control of any one of over 175 nations of the time and guide its development through the years before, during and after the Second World War. It was developed by Paradox Interactive and released in 2005. The lead game programmer was Johan Andersson.
A sequel, Hearts of Iron III, was released in August 2009.
Arsenal of Democracy, a grand strategy wargame based on Hearts of Iron II, was released in February 2010. Iron Cross, a Hearts of Iron II expansion, was released on October 7, 2010, and Darkest Hour, a stand-alone strategy game based on Hearts of Iron II, was released on April 5, 2011.
Gameplay
Hearts of Iron II is a grand strategy game. The player can build land divisions, aircraft squadrons, and naval ships/fleets, and combine these into corps and armies. The player also has the ability to control the appointment of commanders of forces under their nation's flag or that of controlled nations as well as to control the appointment of individual government ministers and military commanders in key General Staff positions. The player also has a broader ability to control the heads of state and government; however, this option is only available to democracies and only then through elections, in which the player chooses the winner. Technological research is controlled by the player. All this is on a global scale, with the player simultaneously dealing and interacting with nations across the world. The game can be paused at any point.
Playable nations
The player can choose to play almost any nation from the time period, apart from some very small states such as Andorra, Monaco, Vatican City or others (and mods exist that make even these playable). The player can also play as a new nation that gains its independence as the game progresses, but should wait until the nation actually declares independence in the game before it can be played. However, many smaller nations do not have strong tech teams, nor do they possess a strong industrial base.
Politics
The player is able to manage their nation's foreign and internal policies on the Diplomacy page. The player can declare war, annex territories and make alliances. The player can also alter the social and economic policies of their nation using sliders, such as democratic versus authoritarian, free market versus central planning and so on. Moving the sliders will result in different bonuses and penalties, allowing for a range of choices and strategies.
On the same page, the player can appoint leaders and ministers, with some exceptions. The Head of State and Head of Government can only be changed through moving the political lef |
https://en.wikipedia.org/wiki/Hokuriku%20Broadcasting%20Company | , also known as MRO, is a Japanese broadcast network affiliated with the Japan News Network (JNN). Their headquarters is located in Ishikawa Prefecture.
The "MRO" abbreviation is taken from the last letters of the call signs "JOMR" and "JOMO" of the Kanazawa and Nanao broadcasting stations, respectively. JOMO is no longer operational.
MRO functions as the default Japan News Network affiliate for the Fukui Prefecture, as that area doesn't have a JNN affiliate of its own.
Network
TV: Japan News Network (JNN)
RADIO: Japan Radio Network (JRN), National Radio Network (NRN)
History
Early history
On December 24, 1948, the Ishikawa Prefectural government applied for a license to operate a commercial broadcaster under the name Hokuriku Cultural Broadcasting, and was the fourth Japanese company to apply to operate a commercial broadcaster. This application was later rejected due to Supreme Commander for the Allied Powers' media censorship.
After the establishment of the "Three Radio Laws" (Radio Law, Broadcasting Law, and Radio Supervisory Committee Establishment Law) in 1950, multiple license to operate a commercial broadcasting applications appear in various parts of Japan. The local newspaper Hokkoku Shimbun in Ishikawa Prefecture revived its plans to operate a new broadcaster.On February 10, 1951, Hokkoku Shimbun took the lead and the founders meeting were held.In April 21 of the same year, the Ministry of Posts granted 16 of the broadcast licenses and Hokuriku Cultural Broadcasting was listed. However, the broadcast area is limited to Ishikawa Prefecture, and does not include Toyama and Fukui prefectures, which are within the scope of the application.
Start as radio broadcaster
Two test radio broadcasts were launched: on April 22, 1952 at 9amand on May 1 of the same year.At 6am on May 10, 1952, Hokuriku Cultural Broadcasting was officially launched, becoming the first commercial radio broadcaster along the Sea of Japan.The broadcaster was initially located in the 4th floor of the Marukoshi Department Store in Kanazawa City.
On November 28, 1956, Hokuriku Culture Broadcasting changed its company name to Hokuriku Broadcasting. In order to strengthen the advertising business, Hokuriku Broadcasting, together with Kita Nippon Broadcasting and Fukui Broadcasting , formed the "Hokuriku Radio Alliance" on February 1, 1953, to increase income and reduce expenditure. Hokuriku Broadcasting achieved uninterrupted broadcasting throughout the day on May 1 of the same year, and achieved profit for the first time in June. In February 1954, Hokuriku Broadcasting realized its first stock dividend. At the end of 1955, Hokuriku Broadcasting set up a relay station in Nanao at the northern end of the Noto Peninsula, covering most of Ishikawa Prefecture. According to the first listening rate survey in November 1955, the listening rate of Hokuriku Broadcasting reached 56.8%, far exceeding the 39.3% of the first frequency of NHK broadcasting. Hokuriku Broadcastin |
https://en.wikipedia.org/wiki/Mainichi%20Broadcasting%20System | , or MBS, is a radio and television broadcasting company headquartered in Osaka, Japan, affiliated with Japan Radio Network (JRN), National Radio Network (NRN), Japan News Network (JNN) and TBS Network, serving in the Kansai region.
It is a parent company of a television station named and a radio station named . MBS is also one of the major stockholders of TBS Holdings, BS-TBS, RKB Mainichi Broadcasting, i-Television, TV-U Fukushima, Hiroshima Home Television, WOWOW., and FM802.
History
Early years
The was founded on December 27, 1950.
After the end of World War II , Mainichi Shimbun intended to establish a private radio station, and the establishment of the radio station was placed in charge of the then editor-in-chief, Shinzo Takahashi. At the same time, Kansai businessmen Shinyoshi Terada and Aiji Iwasaki are also interested in getting involved in the broadcasting industry. The two hit it off immediately, and held a symposium on December 11, 1945, and decided to establish the "New Japan Broadcasting" company. However, at that time, the Commander-in-Chief of the Allied Forces in Japan preferred to continue the Japanese broadcasting industry's monopoly system of the Japan Broadcasting Corporation (NHK) (among the four Allied countries, especially the Soviet Union, NHK preferred to monopolize it), and did not allow private radio stations to be established, so this idea wasn't quickly achieved.
From October 1947, the occupied government gradually began to favor allowing the establishment of private broadcasters. The "New Japan Broadcasting" plan was revived as a result, and received support from Keihanshin Kyuko Electric Railway (now Hankyu Electric Railway), Nippon Electric and other companies. On December 27, 1948, New Japan Broadcasting once again submitted an application for a broadcasting license, which was accepted on January 25 of the following year. With the passing of the "Three Radio Laws" (after the passing of the Radio Law, the Broadcasting Law, and the Law on the Establishment of the Radio Supervisory Committee) in 1950, the establishment of private broadcasting was officially permitted. On June 10 of the same year, New Japan Broadcasting held its first promoter meeting. On December 16, New Japan Broadcasting held a founding meeting and registered the company on December 27. At that time, 12 operators in the Kinki area, supported by Mainichi Shimbun, were most likely to obtain a license. Since Tokyo had successfully integrated various applicants into one company at that time, the Radio Supervision Committee also intended to replicate this process in Osaka, but it encountered strong opposition from both New Japan Broadcasting and Asahi Broadcasting. On April 21, 1951, New Japan Broadcasting received a preliminary license. On July 8, New Japan Broadcasting launched its first experimental radio wave. From August 15th to 31st, New Japan Broadcasting conducted a trial broadcast. At 11:59:30 on September 1, 1951, New Japan Broadcasti |
https://en.wikipedia.org/wiki/Tara%20Sands | Tara Jayne Sands is an American voice actress and co-host of Cartoon Network's Fridays from 2005 to 2007. Sands has voiced in anime dubs and cartoons, including Bulbasaur in the Pokémon anime series, Spyler in I Spy, Kari Kamiya in Digimon Adventure tri., Anna Kyoyama in Shaman King, Mokuba Kaiba in Yu-Gi-Oh! Duel Monsters, as well as Chase on Fighting Foodons and Filia Ul Copt in Slayers. She also provides narration on audio books.
Biography
Much of Sands' work is in anime dubbing, with multiple roles in franchises such as Pokémon, Slayers, Yu-Gi-Oh!, Digimon Adventure Tri, and Hunter x Hunter. She has worked for 4Kids Entertainment, Bang Zoom!, Funimation, TAJ Productions, NYAV Post, Studiopolis, Central Park Media, and VSI Los Angeles.
Sands has narrated over 300 audio books, including Wendelin Van Draanen's Sammy Keyes series, After I Do by Taylor Jenkins Reid, and two books in the Goosebumps series by R. L. Stine: Welcome to Dead House and One Day at HorrorLand.
In addition to providing voice-overs for commercials, Sands was co-host of Cartoon Network Fridays for over 100 episodes.
As of 2021, Sands provides the voice for "sidekick" Joan of Arc in the Forever Dog podcast Godcast.
Filmography
Live action
Disjointed - Sadie, Plants (voice)
Fridays (Cartoon Network) - Co-Host
Everybody Hates Chris - Hotel Clerk, Waitress
The Fresh Beat Band - Interviewer
The Sarah Silverman Program - Campaign Manager
The Newsroom - Secretary
Anime
Agent Aika - Ria
Angel Sanctuary - Sara Mudo
Anohana: The Flower We Saw That Day - Jinta "Jintan" Yodomi (Child)
Beyblade Burst Turbo - Tobisuke
Descendants of Darkness - Princess Tsubaki
Digimon Adventure: - Biyomon
Dinosaur King - Michelle
Domain of Murder - Keita Toyama
Durarara!! - Masaomi Kida (Young), Additional Voices
Fencer of Minerva - Diana
Fighting Foodons - Chase
Geobreeders - Eiko Rando
Ghost Talker's Daydream - Anzai
Girls Bravo - Nanase Koh Haruka, Reporter (Ep. 21)
The God of High School - Sai, Sumi Yoo
High School Prodigies Have It Easy Even In Another World - Winona
Hunter × Hunter - Biscuit Krueger
Isekai Cheat Magician - Lemia, Aerial
JoJo's Bizarre Adventure - Death 13, Old Hag (Bastet arc)
Jujutsu Kaisen - Utahime Iori, Momo Nishimiya
Jungle Emperor Leo - Lune/Rune
Knights of Ramune - PQ
Kirby: Right Back at Ya! - Fololo, Falala (4Kids Version)
Legend of Himiko - Tadami
Little Witch Academia - Woodward, Lotte's Mother, Party Guest
Maze - Solude Schfoltzer
Mobile Suit Gundam Thunderbolt - Karla Mitchum
My Hero Academia - Curious
Naruto Shippuden - Yota, Tamao, Young Kabuto (Ep. 335 and 336)
No Guns Life - Anne
One Piece - Miss Kaya (4Kids dub)
One Punch Man - Kombu Infinity
Patlabor: The Mobile Police - Takeo Kumagami
Photon - Aun Freya
Pokémon (anime) - multiple characters (seasons 1-8) including Bulbasaur, Phanpy, Larvitar, Clefairy, Bugsy, Jasmine, Cissy, Ritchie
Pretty Guardian Sailor Moon Crystal - Kotono Sarashina (Eps. 15 and 18)
Rayeart |
https://en.wikipedia.org/wiki/Yomiuri%20Telecasting%20Corporation | JOIX-DTV (channel 10), branded as , is the Kansai region flagship station of the Nippon News Network and the Nippon Television Network System, owned by the subsidiary of the eponymous Yomiuri Shimbun Holdings, Japan's largest media conglomerate; Yomiuri TV forms part of Yomiuri's main television broadcasting arm alongside Kantō region flagship Nippon TV, which owns a 15.89% share in the company. Founded as on February 13, 1958, and renamed Yomiuri Telecasting Corporation on August 1, the station started broadcasting on August 28 as the first TV station to be affiliated with Nippon Television Network Corporation. Its studios are located in the Osaka Business Park district of Osaka.
History
Early years
Nippon TV applied for TV broadcasting licenses in Osaka and Nagoya after it began broadcasting in 1953, but the Ministry of Post declined the application on the grounds that "Nippon TV is a Tokyo channel, and applying for licenses in other regions is an act of crossing the boundary." At the time, Osaka had only one privately owned television station, Osaka TV Broadcasting (later merged with Asahi Broadcasting). However, because the majority of its programming mostly came from KRT (now TBS), Nippon Television and its parent company, Yomiuri Shimbun Group, began to try to establish their own television station in Osaka. Yomiuri Shimbun filed for a broadcasting license as Shin-Osaka TV in November 1956. In addition to Yomiuri Shimbun, eight other newspapers, including those from Asahi, Mainichi, Sankei, Kobe, and Kyoto, applied for TV broadcasting licenses in the Kansai region at the time, and only two licenses were issued, indicating that rivalry was fierce.
To ease the overheated competition, the Ministry of Post decided to grant an additional broadcasting license in the Osaka area, and on October 22, 1957, the new Osaka TV station was granted a broadcasting license. On August 1, 1958, Shin-Osaka TV changed its name to Yomiuri TV.
1958–1985
At 9:00 a.m. on August 28, 1958, Yomiuri TV was launched as the second privately owned television station in Osaka. Since Yomiuri TV is licensed as a quasi-educational station, they are required to dedicate 20%-30% of its airtime to educational programming, which resulted in being the only broadcaster at that time to air educational programs the most. At that time, Yomiuri TV produced "The Tales of Genji" which received positive reviews. Yomiuri TV started broadcasting color TV programming in September 1960, making it the first TV station in the Kansai region to do so. In April 1968, 30% of daytime and 45% of evening programs were broadcast in color. When Yomiuri TV renewed its broadcast license in 1965, the license category was changed from quasi-educational to general programming, which meant that a greater percentage of entertainment programming could be broadcast. In Spring of 1970, 100% of Yomiuri TV's programming were broadcast in color.
Yomiuri TV's ratings gradually rose after the 1970s, and by the |
https://en.wikipedia.org/wiki/VR.5 | VR.5 is an American science-fiction television series first broadcast on the Fox network from March 10 to May 12, 1995. Ten of its thirteen episodes were aired during its original run. The title of the show refers to the degree of immersion the protagonist experiences in virtual reality.
Plot
Prior to the events of the series, Sydney Bloom was the daughter of Dr. Joseph Bloom, a computer scientist who was working on developing virtual reality. His wife Nora Bloom, a neurochemist, was also involved in the project. Sydney's father, and her sister Samantha, died in a car accident in 1978.
Now in 1995, Sydney is a telephone lineworker and computer hobbyist. One day, she accidentally discovers that she can enter an advanced type of virtual reality, where she can interact with other people. Her actions in the virtual world have an effect on the real world. She subsequently agrees to use her abilities to help a mysterious secret organization called the Committee. She receives her covert assignments from Frank Morgan, and later from Oliver Sampson. Sydney's friend Duncan advises her and helps her when he can.
The show frequently uses inconsistencies in continuity and a distinctive color scheme as clues to suggest what is actually happening at various points throughout the series.
Cast
Lori Singer as Sydney Bloom
Michael Easton as Duncan
Will Patton as Frank Morgan (episodes 1-4)
Anthony Head as Oliver Sampson (episodes 5-13)
David McCallum as Joseph Bloom
Louise Fletcher as Nora Bloom
Tracey Needham as Samantha Bloom
Production
Development
VR.5, a mid-season replacement, debuted shortly after the rise to popularity of The X-Files, and executive producer Thania St. John stated that "VR will try to capture that same, creepy feeling."
Filming
The show's visual effects for when characters were inside virtual reality were created by shooting on black-and-white film and then manually adding color to each image. This effect took four weeks to create for each episode and added to the cost of the show, which was about U.S. $1.5 million per episode. While distributor Rysher Entertainment never confirmed it, the high cost of the production, coupled with a difficult time slot, contributed to the show's commercial failure.
Music
The music for VR.5 was created by composer John Frizzell. The opening theme music came to Frizzell in a dream. Dee Carstensen and Eileen Frizzell provided the vocals in the opening theme. The music supervisor of the series was Abby Treloggen. A soundtrack CD was released in 1995 on the Zoo Entertainment/BMG Music label.
Episodes
"Sisters," "Send Me An Angel," and "Parallel Lives" were not broadcast on Fox. They are called the "missing episodes" and were broadcast in countries such as Canada, Norway, France and the United Kingdom. The series was eventually shown in its entirety on the Sci Fi Channel. The episode "Sisters" was not aired in the UK to make room for an "X-Files" documentary.
Legacy
The series was broadcast on CBS Dram |
https://en.wikipedia.org/wiki/Joseph%20Segel | Joseph Myron Segel (January 9, 1931 – December 21, 2019) was an American entrepreneur. He was the founder of over 20 American companies, most notably QVC, an American television network, and the Franklin Mint, a producer of mail-order collectibles. Segel was named to the Direct Marketing Association's Hall of Fame in 1993. He was honored with a Lifetime Achievement Award from the Electronic Retailing Association and an honorary doctorate from Drexel University.
He was awarded the Philip H. Ward, Jr. Medal from The Franklin Institute in 1977. In 2005, the Harvard Business School published their selection of The Greatest Business Leaders of the Twentieth Century. Then, in 2007, the Wharton School of the University of Pennsylvania published their selection of The Most Influential Wharton Alumni and Faculty in the Wharton School's 125-year history. Segel was one of only 10 people who was on both of these lists.
Early life
Born to a Jewish family, Segel, at the age of 13, started a successful printing business. At 16, he entered the Wharton School of the University of Pennsylvania in Philadelphia. In 1951 he received a Bachelor of Science degree in Economics. As a graduate student, he taught introductory marketing classes while running the "Advertising Specialty Institute", his first significant business. A first in the industry, it published a centralized directory of promotional materials and their suppliers, the Advertising Specialty Register.
In 1964, Segel took note of two concurrent events – the passing of General Douglas MacArthur and people lining up at banks to buy up the last U.S. silver dollars. In response, he founded the National Commemorative Society, which introduced a monthly series of limited edition, sterling silver commemorative coin-like medals honoring events and heroes in American history, starting with a medal commemorating General Douglas MacArthur. Later that year, dissatisfied with the quality of the coin-medals produced by a subcontractor, he recruited Gilroy Roberts, then Chief Engraver of the U.S. Mint, to join him in starting the General Numismatics Corporation. GNC became the Franklin Mint in 1965, shortly after going public. The Franklin Mint quickly expanded to produce not only coin-like medals and casino tokens, but other collectibles, including car models, luxury board-game editions, and porcelain dolls.
Segel retired as chairman of Franklin Mint Corporation in 1973.
National Software Testing Laboratories
Segel founded the National Software Testing Laboratories aka NSTL in 1983. The company published several monthly newsletters including "Software Digest". The publications were often subscribed by IT departments of major corporations, as a basis to evaluate and consider products for their company. PC Hardware and software publishers often contracted the company to perform compatibility and performance tests. NSTL passed through a series of owners, including publisher McGraw-Hill, before being acquired by Int |
https://en.wikipedia.org/wiki/Diane%20Gilman%20%28environmentalist%29 | Diane Gilman (1945–1998), was a painter, potter, writer and co-founder of the Context Institute. She played a key role in the initial development and coordination of the Global Ecovillage Network, a support network for model communities to show how to live more sustainably on the planet, in urban, rural, developed and less developed situations. In 1991, she and her husband, Robert Gilman co-wrote Eco-Villages and Sustainable Communities, a seminal study of ecovillages for Gaia Trust.
Biography
Gilman attended the University of California at Santa Barbara, graduating with a Bachelor of Arts in Art. A professional watercolor painter and potter, she founded the Context Institute with her husband, Robert in 1979. She was Associate Publisher of In Context magazine from 1983–1995 and coordinated citizen diplomacy work with the USSR for the Institute. She and Robert Gilman co-founded the Foundation for Russian/American Economic Cooperation, in Seattle, Washington.
Gilman directed the Context Institute's Sustainable Community Program and coauthored a 1991 report on Ecovillages and Sustainable Communities around the world. The report included guidelines for the development of sustainable communities, along with case studies. Gilman co-facilitated a major Sustainable Community and Ecovillage Conference held at Findhorn, Scotland, in October 1995. This conference was instrumental in giving shape to the ecovillage movement.
She was on the advisory board of the Ecovillage Training Center in Summertown, Tennessee as well as other organizations working to provide positive solutions for living in our times.
Diane Gilman died of cancer in 1998.
Notes
1945 births
1998 deaths
American environmentalists
American women environmentalists
20th-century American women
20th-century American people |
https://en.wikipedia.org/wiki/Getent | getent is a Unix command that helps a user get entries in a number of important text files called databases. This includes the passwd and group databases which store user information – hence is a common way to look up user details on Unix. Since uses the same name service as the system, will show all information, including that gained from network information sources such as LDAP.
The databases it searches in are: ahosts, ahostsv4, ahostsv6, aliases, ethers (Ethernet addresses), group, gshadow, hosts, netgroup, networks, passwd, protocols, rpc, services, and shadow.
The general syntax is:
getent database [key ...]
Thorsten Kukuk wrote the getent utility for the GNU C Library.
Examples
Fetch list of user accounts on a Unix system (stored in a database called 'passwd'). This will show all user accounts, regardless of the type of name service used. For example, if both local and LDAP name service are used for user accounts, the results will include all local and LDAP users:
$ getent passwd
root:x:0:0:root:/root:/bin/bash
daemon:x:1:1:daemon:/usr/sbin:/bin/sh
bin:x:2:2:bin:/bin:/bin/sh
sys:x:3:3:sys:/dev:/bin/sh
sync:x:4:65534:sync:/bin:/bin/sync
games:x:5:60:games:/usr/games:/bin/sh
man:x:6:12:man:/var/cache/man:/bin/sh
lp:x:7:7:lp:/var/spool/lpd:/bin/sh
mail:x:8:8:mail:/var/mail:/bin/sh
Fetch details for a particular user called joe:
$ getent passwd joe
joe:x:1000:1000:Joe,,,:/home/joe:/bin/bash
Fetch list of group accounts on a Unix system (stored in a database called 'group'):
$ getent group
root:x:0:
daemon:x:1:
bin:x:2:
sys:x:3:
adm:x:4:stefan
tty:x:5:
disk:x:6:
lp:x:7:
mail:x:8:
External links
The getent manpage
Unix user management and support-related utilities |
https://en.wikipedia.org/wiki/Dashboard%20%28macOS%29 | Dashboard is a discontinued feature of Apple Inc.'s macOS operating systems, used as a secondary desktop for hosting mini-applications known as widgets. These are intended to be simple applications that do not take time to launch. Dashboard applications supplied with macOS included a stock ticker, weather report, calculator, and notepad; while users could create or download their own.
Before Mac OS X 10.7 Lion, when Dashboard is activated, the user's desktop is dimmed and widgets appear in the foreground. Like application windows, they can be moved around, rearranged, deleted, and recreated (so that more than one of the same Widget is open at the same time, possibly with different settings). New widgets can be opened, via an icon bar on the bottom of the layer, loading a list of available apps similar to the iOS home screen or the macOS Launchpad. After loading, the widget is ready for use.
Dashboard was first introduced in Mac OS X 10.4 Tiger. It can be activated as an application, from the Dock, Launchpad, or Spotlight. It can also be accessed by a dashboard key. Alternatively, the user can choose to make Dashboard open on moving the cursor into a preassigned hot corner or keyboard shortcut. Starting with Mac OS X 10.7 Lion, the Dashboard can be configured as a space, accessed by swiping four fingers to the right from the Desktops either side of it.
From OS X 10.10 Yosemite onward, the Dashboard was disabled by default, with the Notification Center becoming the primary method of displaying widgets. As of macOS 10.15 Catalina, Dashboard has been removed from macOS.
Widget support is reintroduced in macOS Sonoma, the latest macOS version. In macOS Sonoma, Apple has integrated the Dashboard with the Desktop. Users are still able to keep widgets in the Notification Center.
Widget functions and capabilities
Dashboard widgets, like web pages, are capable of many different things, including of performing tasks that would be complicated for the user to access manually. One example is the Google Search widget, which simply opens up the user's web browser and performs a Google search. Other widgets, like Wikipedia, grab the contents of web pages and display them within Dashboard. Some widgets can also serve as games, using Adobe Flash (or another multimedia authoring program) to create games just as if they were in a web browser. It is also possible for Mac users to create their own widgets using built-in software.
Graphics
Dashboard uses a variety of graphical effects for displaying, opening, and using widgets. For instance, a 3-D flip effect is used to simulate the widget flipping around, by clicking on a small i icon in the right bottom corner, the user can change the preferences on the reverse side; other effects include crossfading and scaling from icon to body (when opening widgets), a "spin-cycle effect" when a widget is focused and the user presses Command-R or a suck-in effect when they are closed. On sufficiently powered Macs, widgets w |
https://en.wikipedia.org/wiki/Point-to-Point%20Protocol%20daemon | PPPD is the Point-to-Point Protocol daemon which is used to
manage network connections between two nodes on Unix-like operating systems. It is configured using command-line arguments and configuration files.
While it has initially been used to manage only dial-up access, it is also used to manage broadband connections such as DSL, if Point-to-Point Protocol over Ethernet (PPPoE) or Point-to-Point Protocol over ATM (PPPoA) is used.
The role of pppd is managing PPP session establishment and session termination.
During session establishment, pppd has the role of:
Looped link detection: PPP detects looped links using magic numbers. When PPPD sends PPP LCP messages, these messages include a magic number. If a line is looped, the node receives an LCP message with its own magic number, instead of getting a message with the peer's magic number.
Automatic self configuration: Using Link Control Protocol it has to negotiate protocol features like Address-and-Control-Field-Compression (ACFC), escaped characters, and the compression, encryption (like MPPE) and authentication methods to use.
Access control and authentication: Using protocols like Challenge-handshake authentication protocol (CHAP) or Password authentication protocol (PAP) it has to provide and check authentication data.
Layer 3 configuration: If using Internet Protocol Control Protocol (IPCP), it will negotiate or determine IP parameters such as the IP addresses, the maximum transmission unit, and name server addresses. Some versions may also support Internetwork Packet Exchange Control Protocol (IPXCP) and AppleTalk Control Protocol (ATCP) for routing IPX or AppleTalk over the link.
After negotiation is complete, it has to set up the required network interfaces and routes, so that the connection is run by the kernel.
pppd terminates a PPP link when:
too many frames with invalid frame check sequence (FCS) field have been received
the link is considered "idle" (if configured)
another program or the peer requests link termination.
Some newer versions of pppd are also capable of handling Dial-on-demand routing, where pppd sets up a virtual network, captures the packages it receives and establishes a PPP connection and forwards the captured and not-yet transmitted packages over the link.
Frontends and configurators
kppp – A kde GUI frontend for pppd.
gnome-ppp – A gnome GUI frontend for pppd.
pppconfig – It uses the standard ppp configuration files and sets ppp up so that the standard pon and poff commands (to connect and disconnect) and plog (to list the log) can be used to control ppp. It includes modem detection.
wvdial – A CLI tool which is used for modem initialisation before starting pppd.
References
Manual page: pppd(8) (man pppd in a Unix terminal or pppd man page at ppp.samba.org).
Further reading
Linux PPP HOWTO
FAQ about ppp configuration
Use of pon, poff and plog
Understanding debug ppp negotiation Output
pppd(8): Point-to-Point Protocol Daemon
External links
L |
https://en.wikipedia.org/wiki/Hibernate%20%28framework%29 | Hibernate ORM (or simply Hibernate) is an object–relational mapping tool for the Java programming language. It provides a framework for mapping an object-oriented domain model to a relational database. Hibernate handles object–relational impedance mismatch problems by replacing direct, persistent database accesses with high-level object handling functions.
Hibernate is free software that is distributed under the GNU Lesser General Public License 2.1.
Hibernate's primary feature is mapping from Java classes to database tables, and mapping from Java data types to SQL data types. Hibernate also provides data query and retrieval facilities. It generates SQL calls and relieves the developer from the manual handling and object conversion of the result set.
Mapping
The mapping of Java classes to database tables is implemented by the configuration of an XML file or by using Java Annotations. When using an XML file, Hibernate can generate skeleton source code for the persistence classes. This is auxiliary when annotations are used. Hibernate can use the XML file or the Java annotations to maintain the database schema.
There are provided facilities to arrange one-to-many and many-to-many relationships between classes. In addition to managing associations between objects, Hibernate can also manage reflexive associations wherein an object has a one-to-many relationship with other instances of the class type.
Hibernate supports the mapping of custom value types. This makes the following scenarios possible:
Overriding the default SQL type when mapping a column to a property.
Mapping Java Enums to columns as though they were regular properties.
Mapping a single property to multiple columns.
Definition:
Objects in an object-oriented application follow OOP principles, while objects in the back-end follow database normalization principles, resulting in different representation requirements. This problem is called "object–relational impedance mismatch". Mapping is a way of resolving the object–relational impedance mismatch problem.
Mapping informs the ORM tool of what Java class object to store in which database table.
Hibernate Query Language (HQL)
Hibernate provides a SQL inspired language called Hibernate Query Language (HQL) for writing SQL-like queries against Hibernate's data objects. Criteria Queries are provided as an object-oriented alternative to HQL. Criteria Query is used to modify the objects and provide the restriction for the objects.
HQL (Hibernate Query Language) is the object-oriented version of SQL. It generates database independent queries so that there is no need to write database-specific queries. Without this capability, changing the database would require individual SQL queries to be changed as well, leading to maintenance issues.
Persistence
Hibernate provides transparent persistence for Plain Old Java Objects (POJOs). The only strict requirement for a persistent class is a no-argument constructor, though not necessarily . Prope |
https://en.wikipedia.org/wiki/RoboCop%202 | RoboCop 2 is a 1990 American cyberpunk action film directed by Irvin Kershner and written by Frank Miller and Walon Green. It stars Peter Weller, Nancy Allen, Dan O'Herlihy, Belinda Bauer, Tom Noonan and Gabriel Damon. It is the sequel to the 1987 film RoboCop, the second entry in the RoboCop franchise, the last to feature Weller as RoboCop until he returned in Mortal Kombat 11 and other media, and the last film Kershner directed before his death in 2010.
Set in a dystopian Detroit, the plot follows RoboCop (Weller) as he becomes embroiled in a scheme made by Omni Consumer Products to bankrupt and take over the city while also fighting the spread of a street drug and its gang of dealers led by Cain (Noonan). The film was shot on-location in Houston.
The film received mixed reviews upon its release and earned a moderate box office return, grossing $45 million worldwide, compared to the previous film's $53 million gross on a significantly smaller production budget. It was nominated for three Saturn Awards, including Best Science Fiction Film, Best Performance by a Younger Actor (for Damon), and Best Special Effects (for Phil Tippett, Rob Bottin and Peter Kuran). A sequel, RoboCop 3, was released in 1993.
Plot
In a near dystopian future, Detroit is close to bankruptcy after failing to pay off its debts to conglomerate Omni Consumer Products (OCP). The OCP chairman intends to have the city default on its debt, then foreclose on all public property, effectively taking over its government and allowing for OCP's on-going, radical urban-redevelopment plan (as established in the first film). To rally public opinion behind the project, OCP deliberately sparks an increase in street crime by terminating the privatized Detroit Police Department's pension plans and cutting salaries, triggering a police strike.
RoboCop remains on duty with his partner, Anne Lewis. They raid a manufacturing plant of Nuke, a new designer drug plaguing Detroit. The cartel's leader Cain and his prepubescent accomplice Hob escape. RoboCop has flashbacks to his previous life as Alex Murphy, and has begun watching his wife and son outside their new home. Still grieving over the death of her husband, his wife brings litigation against OCP, complaining of harassment. After his handlers dress him down, RoboCop tells his wife that Murphy is dead and he does not know her.
OCP struggles to develop RoboCop 2, a police droid fitted with the brains of legally-dead police officers, intended for mass production to replace the striking police force. The resurrected cops keep committing suicide upon activation. Morally-warped psychologist Dr. Juliette Faxx theorizes that Murphy's strong moral code and strict Catholic upbringing were critical in his initial success; she convinces the chairman to let her lead the project to recover their 90-million dollar research and development investment. The research staff are later horrified to learn that she seeks to use death row inmates, who desire powe |
https://en.wikipedia.org/wiki/Shizuoka%20Broadcasting%20System | Shizuoka Broadcasting System, Inc. (SBS, 静岡放送株式会社) is a Japanese broadcaster in Shizuoka. Its radio station is affiliated with Japan Radio Network (JRN) and National Radio Network (NRN), and its TV station is affiliated with JNN (Japan News Network).
History
Shizuoka Broadcasting applied for a license on April 20, 1951, and was founded on October 10, 1952, with Mitsunosuke Oishi as its first president.
As Radio Shizuoka, broadcasts started on November 1, 1952, as the seventeenth commercial radio station to open in Japan. Initially it broadcast on 1450kc, but on August 1, 1953, the station moved to 1400kc. On September 12, it applied for a television license. Said station signed on for the first time on November 1, 1958, as the twelfth overall.
The abbreviation, SBS, has been used since September 22, 1960. Color broadcasts started on September 26, 1965, for networked programming and on September 1, 1966, for local programming. On October 1, 1969, less than a year after TV Shizuoka signed on, most of the Fuji TV programming moved to the station as it joined FNS.
On October 3, 2011, SBS joined radiko.
Broadcasting
Radio
SBS Radio
Shizuoka 1404 kHz JOVR; 93.9 MHz FM
Hamamatsu 1404 kHz; 94.7 MHz FM
Mishima 1404 kHz; 90.1 MHz FM
Digital TV (ID:6)
JOVR-DTV - SBS Digital Television
Shizuoka – channel 15
Hamamatsu – channel 21
Analog TV
JOVR-TV - SBS Television (analog ended July 24, 2011)
Shizuoka – channel 11
Hamamatsu – channel 6
Supplement
Shizuoka Broadcasting System has no connection with the South Korean network SBS.
Although SBS radio doubled the output of a key station in 10 kW at 1990 October 1, the stereophonic broadcast is not started yet.
Programs
Radio
Smile for You (:ja:ほのぼのワイド 中村こずえのsmile for You) – hosted by Kozue Nakamura (中村こずえ, former Tokyo FM announcer)
Gogo wide Raburaji (:ja:GOGOワイドらぶらじ) – hosted by Mikihito Tetsuzaki (鉄崎幹人), Tetsu Sugihara (杉原徹), Yasuharu Katsuyama (勝山康晴)
G1 (ended)
Monday Soccer Stadium (ended)
Television
SBS TV Evening paper (ended)
Sole!Iine (from Monday to Wednesday 9:55-11:00, Thursday and Friday 9:55-11:00 )
Eve Ai Shizuoka (4:45-7:00 [JST])
Item
Shizuoka Shimbun (Shizuoka's local newspaper)
References
External links
SBS website
Shizushin SBS Group website
Japan News Network
Television stations in Japan
Radio stations established in 1952
Television channels and stations established in 1958
Mass media in Shizuoka (city)
1958 establishments in Japan |
https://en.wikipedia.org/wiki/Data%20broker | A data broker is an individual or company that specializes in collecting personal data (such as income, ethnicity, political beliefs, or geolocation data) or data about companies, mostly from public records but sometimes sourced privately, and selling or licensing such information to third parties for a variety of uses. Sources, usually Internet-based since the 1990s, may include census and electoral roll records, social networking sites, court reports and purchase histories. The information from data brokers may be used in background checks used by employers and housing.
There are varying regulations around the world limiting the collection of information on individuals; privacy laws vary. In the United States there is no federal regulation protection for the consumer from data brokers, although some states have begun enacting laws individually. In the European Union, GDPR serves to regulate data brokers' operations. Some data brokers report to have large numbers of population data or "data attributes". Acxiom purports to have data from 2.5 billion different people.
Overview
Information broker is sometimes abbreviated to IB, and other terms used for information brokers include data brokers, independent information specialists, information or data agents, data providers, data suppliers, information resellers, data vendors, syndicated data brokers, or information product companies. Information consultants, freelance librarians, and information specialists are also sometimes termed information brokers.
Credit scores were first used in the 1950s, and information brokering emerged as a career for individuals during that decade. However the business of information brokering did not become widely known or specifically regulated until the 1990s. During the 1970s, "information brokers" often had a library science degree; however, towards the end of the 20th century, people with degrees in science, law, business, medicine, or other disciplines entered the profession, and the line between the terms information professional and information broker became more blurred. In 1977, Kelly Warnken published the first fee-based information directory, followed by the Journal of Fee-Based Information Services in 1979 and the book The Information Brokers: How to Start and Operate Your Own Fee-based Service in 1981.
Beginning in the late twentieth century, technological developments such as the development of the Internet, increasing computer processing power, and declining costs of data storage made it much easier for companies to collect, analyze, store and transfer large amounts of data about individuals. This gave rise to the information broker or data broker industry. , there is no required academic qualification for the job of information broker; some people may have a bachelor's degree in business or marketing, while others may have a background in library science, or may have worked for a database provider.
Services
Information brokering has been describe |
https://en.wikipedia.org/wiki/Broadcasting%20System%20of%20San-in | Broadcasting System of San-in, Inc. (BSS, 株式会社山陰放送) is a Japanese radio station and TV station broadcast in Tottori Prefecture and Shimane Prefecture.
It is affiliated with Japan Radio Network (JRN), National Radio Network (NRN) and Japan News Network (JNN).
Head office
1-1-71, Nishi-Fukuhara, Yonago, Tottori Prefecture
Broadcasting
Radio
BSS Radio
Yonago JOHF 900 kHz
Tottori JOHL 1431 kHz; 92.2 MHz FM ("flagship station")
Kurayoshi 1557 kHz
Izumo 1431 kHz
Ota 1485 kHz
Hamada JOHM 1557 kHz
Masuda JOHN 1431 kHz
TV
BSS Television
Matsue JOHF-TV 10Ch
Tottori 22Ch
Kurayoshi 56Ch
Hamada 5Ch
Ota 1Ch
Masuda 26Ch
Gotsu 44Ch
Okinoshima 39Ch
Kamo 8Ch
Misumi 46Ch etc ...
Supplement
Although this broadcasting station belongs to JNN/JRN/NRN, it was also once associated with Asahi Shimbun. Therefore, on BSS radio, the Asahi Shimbun news of independence work are broadcast during the morning. That key stations differ on radio and television Since the system of the area of the television station opened from the second half of the 1950s to the second half of the 1960s was 1 prefecture 1 wave in principle when beginning television broadcasting of this broadcasting station, In Tottori Prefecture in which Nihonkai TV (日本海テレビ) which had already begun broadcast at this time exists, it is because its service cannot be started, but it is Shimane Prefecture which had not prepared the television station yet then and its service was to be started first. And already, the request of a start of television broadcasting was replied to Tottori Prefecture, and Tottori Prefecture has also started television broadcasting at last in September, 1972. Simultaneous broadcast of the program besides the series which Nihonkai TV, such as a "morning news show" and Doraemon, and San-in Chuo TV (山陰中央テレビ) are treating to one time in television broadcasting till September, 1989 might be carried out also by BSS.
Program
Radio
Ongaku no Kazaguruma
Moritani Kana's Hakidasa NIGHT!
Gogo ha dokidoki! etc ...
TV
Music Station (produced by TV Asahi)
Saturday Raw egg
Teleport San-in etc ...
Kamen Rider Series (produced by TV Asahi)
Pretty Cure (produced by ABC)
External links
BSS HomePage
Japan News Network
Radio in Japan
Television stations in Japan
Radio stations established in 1954
Television channels and stations established in 1959
Companies based in Tottori Prefecture |
https://en.wikipedia.org/wiki/Aomori%20Broadcasting%20Corporation | Aomori Broadcasting Corporation (RAB, 青森放送株式会社, Aomori Hōsō Kabushiki Gaisha) is a television and radio broadcaster in Aomori, Japan. It is affiliated with Japan Radio Network (JRN), National Radio Network (NRN), Nippon News Network (NNN) and Nippon Television Network System (NNS).
As the prefecture doesn't have an FNN/FNS affiliate, RAB alongside ATV & ABA air certain Fuji TV programming.
History
Launch as radio broadcaster
There were initial attempts to establish a commercial broadcaster in the prefecture in December 1947, which was then supported with the passage of the "Three Radio Laws" (Radio Law, Broadcasting Law, and Radio Supervisory Committee Establishment Law) in 1950.
At that time, there were competition for private broadcasting license between Radio Tohoku (not related to the former name of Akita Broadcasting), an unnamed local newspaper in Aomori, and Tohoku Broadcasting. In April 1953, Tohoku Radio and Tohoku Broadcasting made a settlement, and Tohoku Broadcasting cancelled its application for a broadcasting license in Aomori Prefecture, and the two cooperated fully. In August of the same year, Radio Tohoku received its broadcasting license which was then renamed to Radio Aomori on September 26.
Radio Aomori was then established on September 30, 1953. A day before its establishment, they conducted trial radio broadcasts. On October 12, 1953, Radio Aomori officially started broadcasting. Upon its launch, Radio Aomori wasn't receivable to southern parts of the prefecture. This was later resolved when the Hirosaki relay transmitter was opened in 1956. According to a survey conducted by the local government of Aomori Prefecture in 1957, Radio Aomori accounted for 76.2% in audience share compared to NHK Radio 1's 21%.
Expansion to TV broadcasting and further developments on radio
Radio Aomori started preparing to broadcast on TV since August 1955, and obtained a TV broadcast license in October 1957. They conducted trial broadcasts on September 14, 1959, and officially started TV broadcasting on October 1 of the same year. RAB initially intended to join JNN. However, before it started broadcasting it was discovered that Nippon TV were the most favorable. In October 1961 to reflect the rapid development of their television broadcasting, Aomori Radio changed its name to Aomori Broadcasting. In 1965, RAB joined the JRN and NRN networks at the same time, avoiding costs of having another AM radio station in the prefecture.
RAB started color TV broadcasting in 1966 and expanded to uninterrupted sign-on to sign-off broadcasts in May 1970. On April 1, 1975, RAB started airing TV Asahi programming as it joined ANN after ATV withdrew from being an ANN affiliate. RAB then withdrew from airing ANN programming when Asahi Broadcasting Aomori opened on October 1, 1991, and continued to air Fuji TV programming.
In 1991, RAB won 7 awards in the 1991 Japan Commercial Broadcasters Association Award. Since Video Research started conducting rat |
https://en.wikipedia.org/wiki/Akita%20Broadcasting%20System | Akita Broadcasting System, Inc. (ABS, 株式会社秋田放送) is a Japanese broadcaster in Akita Prefecture. Its radio station is affiliated with Japan Radio Network (JRN) and National Radio Network (NRN), and its TV station is affiliated with Nippon News Network (NNN) and Nippon TV Network System (NNS).
Headquarters
1-2 1 Banchi, Nakadori 7-chome, Akita city Akita Japan. 010-8611
Tel. +81-18-824-8533 (Main desk)
Channels
Radio
ABS Radio
Akita 936 kHz JOTR 5 kW; 90.1 MHz FM 1 kW
Odate 1557 kHz JOTE
Asamai(Yokote) 1485 kHz JOTO
Kazuno 801 kHz
Honjo 1557 kHz
Analog TV
JOTR-TV - ABS Television
Akita 11Ch
Odate 6Ch
Honjo 10Ch
etc...
Digital TV(ID:4)
JOTR-DTV - ABS Digital Television
Akita(Main Station) 35ch
Omagari 25ch
Odate 17ch
Programs
Radio
Asadori Wide Akitabin
Gokujo Radio
Fureai Request etc...
TV
Yudoki
NNN News Realtime Akita etc...
Announcers
Jennifer Wooden
Item
Akita Sakigake Shimpo
Rival Stations
Akita Television(AKT)
Akita Asahi Broadcasting(AAB)
External links
ABS HomePage
Akita Northern Happinets
Companies based in Akita Prefecture
Television stations in Japan
Radio in Japan
Nippon News Network
Mass media in Akita (city)
Television channels and stations established in 1960 |
https://en.wikipedia.org/wiki/Keith%20Geddes | Keith Oliver Geddes (born 1947) is a professor emeritus in the David R. Cheriton School of Computer Science within the Faculty of Mathematics at the University of Waterloo in Waterloo, Ontario. He is a former director of the Symbolic Computation Group in the School of Computer Science. He received a BA in Mathematics at the University of Saskatchewan in 1968; he completed both his MSc and PhD in Computer Science at the University of Toronto.
Geddes is probably best known for co-founding the Maple computer algebra system, now in widespread academic use around the world. He is also the Scientific Director at the Ontario Research Centre for Computer Algebra, and is a member of the Association for Computing Machinery, as well as the American and Canadian Mathematical Societies.
Research
Geddes' primary research interest is to develop algorithms for the mechanization of mathematics. More specifically, he is interested in the computational aspects of algebra and analysis. Currently, he is focusing on designing hybrid symbolic-numeric algorithms to perform definite integration and solve ordinary and partial differential equations.
Much of his work currently revolves around Maple.
Teaching
Geddes retired from teaching in December 2008.
Geddes taught a mixture of both senior-level symbolic computation courses, at both the undergraduate and graduate level, as well as introductory courses on the principles of computer science.
See also
Maple computer algebra system
Waterloo Maple
Gaston Gonnet — the co-founder of Waterloo Maple
Risch algorithm
Symbolic integration
Derivatives of the incomplete gamma function
List of University of Waterloo people
External links
Keith Geddes' home page
The Symbolic Computation Group
1947 births
Living people
Canadian mathematicians
University of Toronto alumni
Academic staff of the University of Waterloo |
https://en.wikipedia.org/wiki/Yamagata%20Broadcasting%20Company | Yamagata Broadcasting Co., Ltd. (YBC Television, 山形放送株式会社) is a Japanese broadcaster in Yamagata. Its radio station is affiliated with Japan Radio Network (JRN) and National Radio Network (NRN), and its television station is affiliated with Nippon News Network (NNN) and Nippon TV Network System (NNS).
History
In the early 1950s, commercial broadcasters began to appear throughout Japan. On February 20, 1953, Yamagata Broadcasting held its first founders' meeting, and Yamagata Shimbun, a local newspaper, had an important role in the establishment of Yamagata Broadcasting, as did most of the first commercial broadcasters in Japan. At that time, the head office of Yamagata Broadcasting was located in Yamagata Shimbun with a capital of 50 million yen.
Broadcasting
YBC Radio
YBC Radio 918 kHz
Yamagata 5 kW JOES
Tsuruoka 1 kW (Old call sign:JOEL JOEF)
Yonezawa 1 kW
Shinjo 1 kW
Sakata 500 W
Oguni 100 W
Analog TV
JOEF-TV - YBC Television Yamagata
Yamagata 10Ch 3 kW
Yonezawa 54Ch 100 W
Shinjo 11Ch 50 W
Oguni 11Ch 30 W
JOEL-TV - YBC Television Tsuruoka
Tsuruoka 1Ch 1 kW
Atsumi 44Ch 30 W
Digital TV(ID:4)
JOES-DTV - YBC Digital Television Yamagata
Yamagata 16ch 1 kW
Program
Radio
Goo-t Mornin!!
Music Brunch
GeTukinradiopanpakapaan!
Saturday Radio Heaven
Weekend Scramble
Guidance on One point for Farmers
TV
Piyotama Wide 430
YBC News RealTime
Item
Yamagata News Paper
References
External links
YBC HomePage
Radio in Japan
Television stations in Japan
Nippon News Network
Television channels and stations established in 1960
Mass media in Yamagata, Yamagata
Television channels and stations disestablished in 2011 |
https://en.wikipedia.org/wiki/NewsNight%20with%20Aaron%20Brown | NewsNight with Aaron Brown is a live international news program which aired on the CNN and CNN International networks from 2001 to 2005. It aired at 10 PM ET on weeknights and was hosted by Aaron Brown. In its final year, Anderson Cooper co-hosted the show.
The show focused on investigative journalism and had a strong emphasis on interviews. It included segments such as The Whip (which quickly previewed segments from four reporters at large), On the Rise, and Segment 7. The Morning Papers segment, known as The Rooster, featured a brief preview of compelling or interesting headlines from the next day's newspapers around the world. The segment concluded with the weather forecast in Chicago as provided in the Chicago Sun-Times.
To cover the increased amount of news generated by Hurricane Katrina and its aftermath in September 2005, CNN expanded NewsNight to two hours and added Anderson Cooper as a co-host. (Cooper's coverage of the natural disaster elsewhere on the network had given him strong ratings.) These changes were intended to last for the duration of the hurricane's aftermath, but CNN later announced that it would keep the new format and make Cooper a permanent co-host.
On November 2, 2005, CNN announced that it was canceling NewsNight and that Brown would leave the network. As of November 7, 2005, the timeslot was given to Cooper's show, Anderson Cooper 360°.
References
External links
"'Newsnight With Aaron Brown' Premieres Monday" (Time Warner press release, October 30, 2001)
Sample CNN.com page for Newsnight with Aaron Brown (from November 10, 2004, via Internet Archive)
CNN anchor's away
Sure, Anderson Cooper is cute and young, but get a grip, CNN
The NewsNighters - The 1st and best online club for Aaron Brown of CNN's NewsNight
CNN original programming
2001 American television series debuts
2005 American television series endings |
https://en.wikipedia.org/wiki/Data%20Discman | The Data Discman is an electronic book player introduced to the Western market in late 1991 or early 1992 by Sony Corporation. It was marketed in the United States to college students and international travelers, but had little success outside Japan. The Discman product name had originally been applied to Sony's range of portable CD players such as the Sony Discman D-50, first released in 1984.
The Data Discman was designed to allow quick access to electronic reference information on a pre-recorded disc. Searching terms were entered using a QWERTY-style keyboard and utilized the "Yes" and "No" keys.
A typical Data Discman model has a low resolution small grayscale LCD (256x200 early on, later models would have up to 320x240 and in colour), CD drive unit (either Mini CD or full size), and a low-power computer. Early versions of the device were incapable of playing audio CDs. Software was prerecorded and usually featured encyclopedias, foreign language dictionaries and novels. It was typically created using the Sony Electronic Book Authoring System (SEBAS).
A DD-1EX Data Discman is in the permanent collection of the Victoria and Albert Museum and is currently displayed in the V&A's 20th Century Gallery. This early model did not include the ability to play sound.
An updated model, the DD-10EX, was released in 1992 or 1993. The accompanying manual gives a copyright date of 1992. Unlike the DD-1EX, the DD-10EX also had the ability to play audio files. The British version came with a disc containing the Thomson Electronic Directory for April 1992, plus another containing the Pocket Interpreter 5-language conversation book for travelers. A DD-10EX was included in an exhibition entitled The Book and Beyond: Electronic Publishing and the Art of the Book, held at the Victoria and Albert Museum, London, from April to October 1995. The exhibition also included a CD-ROM designed to be played on the Data Discman, entitled The Library of the Future and published in 1993.
The DD-1EX and DD-10EX both made use of a flip or clamshell form, while the flat, rectangular design of the DD-8 was closer to later e-book readers such as the Amazon Kindle.
See also
Sony Multimedia CD-ROM Player - a concurrent portable CD-ROM-based reader by Sony, incompatible with Data Discman media
References
External links
Techmoan: e-books in the '90s with Sony's Data Discman, YouTube, published on 5 July 2018
Sony products
Audiovisual introductions in 1992
Electronic paper technology |
https://en.wikipedia.org/wiki/Osaka%20Broadcasting%20Corporation | is an AM radio station of National Radio Network (NRN) in Osaka, Japan, and it is known as "Radio Osaka (ラジオ大阪 Rajio Ōsaka)". It is also a company of Sankei Shimbun Group in Fujisankei Communications Group. Radio Osaka started broadcasting on July 1, 1958.
Offices of Radio Osaka
The Headquarters - ORC200, 2-4, Benten Itchome, Minato-ku, Osaka, Osaka Prefecture, Japan
Tokyo office - Musashi 7 Building, 2-4, Ginza Nanachome, Chūō, Tokyo
Changing Frequency of Radio Osaka
1958 - 1971: 1380 kHz, 3 kW
1971 - 1978: 1310 kHz, 50 kW
1978–Present: 1314 kHz, 50 kW
Broadcasting
JOUF
Osaka - 1314 kHz, 50 kW; 91.9 MHz FM
Kyoto - 1314 kHz, 300W
Total:50.3 kW to 55 kW
Time signal
880 Hz (A5)
Supplement
The "OBC Song (OBCソング)" (lyrics by Akiyuki Nosaka (野坂 昭如), music by Taku Izumi (いずみ たく)) is Japan's first commercial broadcasting station's song produced in 1961.
The present headquarters and performance place are located on the fourth floor of the harp hall of the large-sized building "ORC200" near Bentencho Station in Benten Itchome, Minato-ku, Osaka, Japan, and the stereophonic broadcast is performed from the time transferred here.
Programs
Yes! This is Toshiharu Harada (ほんまもん!原田年晴です)
Beppin Radio (高岡美樹のべっぴんラジオ)
Radio Yoshimoto Genki Super (ラジオよしもとむっちゃ元気スーパー)
5 up Yoshimoto Gachimori (5upよしもと ガチモリ)
OBC Dramatic Keiba (OBCドラマティック競馬)
Sankei Express News (news bulletin)
1314 V-STATION, etc.
Programs from other radio stations via network
A Wake-up Call for You (あなたへモーニングコール, produced by TBS Radio & Communications, Inc. (TBS R&C), from 5 (JST) until 6 (JST) every day)
All Night Nippon (オールナイトニッポン, produced by Nippon Broadcasting System, Inc. (LF), from 25 (JST) until 27 (JST) every Monday to Saturday)
Item
Kansai TV
Other radio stations in Osaka
Asahi Broadcasting Corporation (ABC, 朝日放送)
Mainichi Broadcasting System, Inc. (MBS, 毎日放送)
FM OSAKA (851, FM大阪)
FM802 (802, FM802)
FM COCOLO (COCOLO, 関西インターメディア)
External links
The official website of Radio Osaka (OBC)
Companies based in Osaka Prefecture
Radio stations in Japan
Mass media in Osaka
Fujisankei Communications Group |
https://en.wikipedia.org/wiki/Electronic%20program%20guide | Electronic programming guides (EPGs) and interactive programming guides (IPGs) are menu-based systems that provide users of television, radio and other media applications with continuously updated menus that display scheduling information for current and upcoming broadcast programming (most commonly, TV listings). Some guides also feature backward scrolling to promote their catch up content. They are commonly known as guides or TV guides.
Non-interactive electronic programming guides (sometimes known as "navigation software") are typically available for television and radio, and consist of a digitally displayed, non-interactive menu of programming scheduling information shown by a cable or satellite television provider to its viewers on a dedicated channel. EPGs are transmitted by specialized video character generation (CG) equipment housed within each such provider's central headend facility. By tuning into an EPG channel, a menu is displayed that lists current and upcoming television shows on all available channels.
A more modern form of the EPG, associated with both television and radio broadcasting, is the interactive [electronic] programming guide (IPG, though often referred to as EPG). An IPG allows television viewers and radio listeners to navigate scheduling information menus interactively, selecting and discovering programming by time, title, channel or genre using an input device such as a keypad, computer keyboard or television remote control. Its interactive menus are generated entirely within local receiving or display equipment using raw scheduling data sent by individual broadcast stations or centralized scheduling information providers. A typical IPG provides information covering a span of seven or 14 days.
Data used to populate an interactive EPG may be distributed over the Internet, either for a charge or free of charge, and implemented on equipment connected directly or through a computer to the Internet.
Television-based IPGs in conjunction with Programme Delivery Control (PDC) technology can also facilitate the selection of TV shows for recording with digital video recorders (DVRs), also known as personal video recorders (PVRs).
History
Key events
North America
In 1981, United Video Satellite Group launched the first EPG service in North America, a cable channel known simply as The Electronic Program Guide. It allowed cable systems in the United States and Canada to provide on-screen listings to their subscribers 24 hours a day (displaying programming information up to 90 minutes in advance) on a dedicated cable channel. Raw listings data for the service was supplied via satellite to participating cable systems, each of which installed a computer within its headend facility to present that data to subscribers in a format customized to the system's unique channel lineup. The EPG Channel would later be renamed Prevue Guide and go on to serve as the de facto EPG service for North American cable systems throughout the rema |
https://en.wikipedia.org/wiki/Sapporo%20Television%20Broadcasting | is a TV station of Nippon News Network (NNN) and Nippon Television Network System (NNS) in Hokkaidō, Japan. Headquartered in Sapporo, the capital city of Hokkaidō prefecture, the TV station was established on April 8, 1958. It is usually called "STV" for short, which is used as a name in a number of TV programs.
Since December 15, 1962, the company has worked as both television and radio station until July 12, 2005, when the radio section was split into the was established. Currently, the STV Radio is a radio station of National Radio Network (NRN) in Hokkaidō, Japan. The license of the radio broadcasting was succeeded to the STV Radio, and started radio broadcasting on October 1, 2005.
History
Early stages
In early 1957, Youzo Kurosawa (then president of the Hokkai Shimbun), Yoshjiro Kikuchi (then president of the Hokkaido Charcoal Steamship Company), and Yoshitaro Hagiwara (president of the Hokkaido Charcoal Steamship Company), considered the formation of a second private television station in Hokkaido. Japan's national newspapers (Yomiuri Shimbun, Asahi Shimbun, Mainichi Shimbun, and Sankei Shimbun) attempted to enter the Hokkaido market at the time by combining two major sectors, television and newspapers, with the goal of creating a private television station.
This is unquestionably a serious danger to Hokkaido's native newspaper, the Hokkai Shimbun. Hokkai Shimbun and an unnamed Hokkaido firm sought for a commercial TV broadcasting license under the name "Sapporo TV" in April 1957. And received their license on October of the same year.
Founding and early years
The company was founded on April 8, 1958.STV began its TV broadcasts on April 1 the following year airing for at least 9 and a half hours a day. STV started as a dual affiliated station with NNN as their primary affiliate and FNN as their secondary affiliate. The network also aired certain programming from Nippon Educational Television (currently TV Asahi) alongside HBC. Since Sapporo TV initially obtained a quasi-educational station license, the station had to follow educational quotas for a substantnial proportion of its programming. Sapporo TV's first self-produced program is also an educational program "Television Fudoki". In the first year of broadcasting, Sapporo TV's corporate income entered the top ten in Hokkaido. In 1960, the Sapporo TV Broadcasting Hall was completed, enabling Sapporo TV to have its own TV studio. In the same year, the Sapporo Television Union also announced its establishment. In 1961, STV's turnover reached 1.27 billion yen, and the average monthly turnover exceeded 100 million yen.
Prior to its official TV broadcasts, STV also applied a radio broadcasting license in 1958 (which was later rejected). The broadcaster applied for a license again on February 17, 1961 and was granted on July 10, 1962 becoming the only broadcaster in Japan to start TV broadcasts then radio broadcasts (STV Radio started broadcasting on December 15, 1962). NET TV stopp |
https://en.wikipedia.org/wiki/Parental%20controls | Parental controls are features which may be included in digital television services, computers and video games, mobile devices and software that allow parents to restrict the access of content to their children. These controls were created to assist parents in their ability to restrict certain content viewable by their children. This may be content they deem inappropriate for their age, maturity level or feel is aimed more at an adult audience. Parental controls fall into roughly four categories: content filters, which limit access to age inappropriate content; usage controls, which constrain the usage of these devices such as placing time-limits on usage or forbidding certain types of usage; computer usage management tools, which enforces the use of certain software; and monitoring, which can track location and activity when using the devices.
Content filters were the first popular type of parental controls to limit access to Internet content. Television stations also began to introduce V-Chip technology to limit access to television content. Modern usage controls are able to restrict a range of explicit content such as explicit songs and movies. They are also able to turn devices off during specific times of the day, limiting the volume output of devices, and with GPS technology becoming affordable, it is now possible to easily locate devices such as mobile phones. UNICEF emphases the responsibility of parents and teachers in this role.
The demand for parental control methods that restrict content has increased over the decades due to the rising availability of the Internet. A 2014 ICM survey showed that almost a quarter of people under the age of 12 had been exposed to online pornography. Restricting especially helps in cases when children are exposed to inappropriate content by accident. Monitoring may be effective for lessening acts of cyberbullying within the internet. It is unclear whether parental controls will affect online harassment in children, as little is known about the role the family plays in protecting children from undesirable experiences online. Psychologically, cyberbullying could be more harmful to the victim than traditional bullying. Studies done in the past have shown that about 75% of adolescents were subjected to cyberbullying. A lack of parental controls in the household could enable kids to be a part of cyberbullying or be the victim of cyberbullying.
Overview
Behavioral control consists of controlling the amount of time a child spends online, or how much the child can view. Psychological control involves parents trying to influence children's behavior.
Several techniques exist for creating parental controls for blocking websites. Add-on parental control software may monitor API in order to observe applications such as a web browser or Internet chat application and to intervene according to certain criteria, such as a match in a database of banned words. Virtually all parental control software includes a password |
https://en.wikipedia.org/wiki/Computer%20programs%20and%20the%20Patent%20Cooperation%20Treaty | There are two provisions in the regulations annexed to the Patent Cooperation Treaty (PCT) that relate to the search and examination of patent applications concerning computer programs. These two provisions are present in the PCT, which does not provide for the grant of patents but provides a unified procedure for filing, searching and examining patent applications, called international applications. The question of patentability is touched when conducting the search and the examination, which is an examination of whether the invention appears to be patentable.
These two provisions are and , and, in conjunction respectively with and , may have a concrete impact on the procedure under the PCT, in the search and examination performed under the PCT. Indeed, depending on the patent office which is in charge of the search or examination under the PCT, the application filed for an invention relating to a computer program may or may not be searched or examined. In addition, the ISA and IPEA (see background section) that do not search such applications to a certain extent have diverging practices with respect to determinations of exclusions as to computer programs.
In addition to the consequences these legal provisions may have in practice, is also significant from an interpretive perspective to understand the origin of the much debated (see Software patents under the European Patent Convention (EPC) and Article 52 EPC). The computer program exclusion was indeed inserted in the EPC in line with Rule 39.1 PCT, so that Rule 39.1 predates Art. 52(2) and (3) EPC.
Background
The Patent Cooperation Treaty (PCT) is an international patent law treaty, which provides a unified procedure for filing patent applications. A patent application filed under the PCT is called an international application or a PCT application.
The filing of an international application results in an international search performed by a patent office, accompanied with a written opinion regarding the patentability of the invention which is the subject of the application. An applicant may also request an international preliminary examination performed by a patent office. The PCT does not provide that the searches and examinations are to be performed by one central patent office, as the WIPO does not perform searches and examinations. In contrast, the European Patent Convention (EPC) places the European Patent Office (EPO) in charge of performing searches and examinations for European patent applications.
Under the PCT, the international search and the optional international preliminary examination are conducted by different national or regional patent offices, referred to as the International Searching Authorities (ISA) and the International Preliminary Examining Authority (IPEA) Applicants, based on nationality and on the Receiving Office where the application was filed, may have an opportunity to have the search performed by one of the ISAs.
The relevant provisions in the regula |
https://en.wikipedia.org/wiki/Document%20classification | Document classification or document categorization is a problem in library science, information science and computer science. The task is to assign a document to one or more classes or categories. This may be done "manually" (or "intellectually") or algorithmically. The intellectual classification of documents has mostly been the province of library science, while the algorithmic classification of documents is mainly in information science and computer science. The problems are overlapping, however, and there is therefore interdisciplinary research on document classification.
The documents to be classified may be texts, images, music, etc. Each kind of document possesses its special classification problems. When not otherwise specified, text classification is implied.
Documents may be classified according to their subjects or according to other attributes (such as document type, author, printing year etc.). In the rest of this article only subject classification is considered. There are two main philosophies of subject classification of documents: the content-based approach and the request-based approach.
"Content-based" versus "request-based" classification
Content-based classification is classification in which the weight given to particular subjects in a document determines the class to which the document is assigned. It is, for example, a common rule for classification in libraries, that at least 20% of the content of a book should be about the class to which the book is assigned. In automatic classification it could be the number of times given words appears in a document.
Request-oriented classification (or -indexing) is classification in which the anticipated request from users is influencing how documents are being classified. The classifier asks themself: “Under which descriptors should this entity be found?” and “think of all the possible queries and decide for which ones the entity at hand is relevant” (Soergel, 1985, p. 230).
Request-oriented classification may be classification that is targeted towards a particular audience or user group. For example, a library or a database for feminist studies may classify/index documents differently when compared to a historical library. It is probably better, however, to understand request-oriented classification as policy-based classification: The classification is done according to some ideals and reflects the purpose of the library or database doing the classification. In this way it is not necessarily a kind of classification or indexing based on user studies. Only if empirical data about use or users are applied should request-oriented classification be regarded as a user-based approach.
Classification versus indexing
Sometimes a distinction is made between assigning documents to classes ("classification") versus assigning subjects to documents ("subject indexing") but as Frederick Wilfrid Lancaster has argued, this distinction is not fruitful. "These terminological distinctions,” he |
https://en.wikipedia.org/wiki/William%20Wilson%20Hunter | Sir William Wilson Hunter (15 July 18406 February 1900) was a Scottish historian, statistician, a compiler and a member of the Indian Civil Service.
He is most known for The Imperial Gazetteer of India on which he started working in 1869, and which was eventually published in nine volumes in 1881, then fourteen, and later as a twenty-six volume set after his death.
Early life and education
William Wilson Hunter was born on 15 July 1840 in Glasgow, Scotland, to Andrew Galloway Hunter, a Glasgow manufacturer. He was the second of his father's three sons. In 1854 he started his education at the 'Quaker Seminary' at Queenswood, Hampshire and a year later he joined The Glasgow Academy.
He was educated at the University of Glasgow (BA 1860), Paris and Bonn, acquiring a knowledge of Sanskrit, LL.D., before passing first in the final examination for the Indian Civil Service in 1862.
Career
He reached Bengal Presidency in November 1862 and was appointed assistant magistrate and collector of Birbhum, in the lower provinces of Bengal, where he began collecting local traditions and records, which formed the materials for his publication, entitled The Annals of Rural Bengal, which influenced the historical romances of Bankim Chandra Chattopadhyay.
He also compiled A Comparative Dictionary of the Non-Aryan Languages of India, a glossary of dialects based mainly upon the collections of Brian Houghton Hodgson, which according to the Encyclopædia Britannica Eleventh Edition, "testifies to the industry of the writer but contains much immature philological speculation".
In 1869 Lord Mayo, the then governor-general, asked Hunter to submit a scheme for a comprehensive statistical survey of India. The work involved the compilation of a number of local gazetteers, in various stages of progress, and their consolidation in a condensed form upon a single and uniform plan. There was unhappiness with the scope and completeness of the earlier surveys conducted by administrators such as Buchanan, and Hunter determined to model his efforts on the Ain-i-Akbari and Description de l'Égypte. Hunter said that "It was my hope to make a memorial of England's work in India, more lasting, because truer and more complete, than these monuments of Mughal Empire and of French ambition."
In response to Mayo's question on 30 May 1871 of whether the Indian Muslims are "bound by their religion to rebel against the Queen" Hunter completed his influential work The Indian Musalmans in mid-June 1871 and later published it as a book in mid-August of the same year. In it, Hunter concluded that the majority of the Indian Muslim scholars rejected the idea of rebelling against the Government because of their opinion that the condition for religious war, i.e. the absence of protection and liberty between Muslims and infidel rulers, did not exist in British India; and that "there is no jihad in a country where protection is afforded".
In 1872 Hunter published his history of Orissa. The third Int |
https://en.wikipedia.org/wiki/Daegu%20Cyber%20University | Daegu Cyber University is an accredited South Korean online university. Its physical headquarters is located near Daegu in neighboring Gyeongsan City, North Gyeongsang province in South Korea.
Daegu Cyber University is specialized in courses for psychology, special education, therapy, and social work, etc. And it was the first accredited online university by Korean Ministry of Education in Gyeongsang province in South Korea.
The current president is Kun Yong Rhee (이근용), who has served since the school's foundation. Although administratively distinct, the university has close ties with Daegu University.
Academics
Courses offered
Department of Special Education
Department of Art Therapy
Department of Speech Language Pathology
Department of Behavior Therapy
Department of Play Therapy
Department of Counseling Psychology
Department of Clinical Psychology
Department of Social Welfare
Department of Social Welfare Counseling
Department of Rehabilitation Counseling
Department of Public Administration
Department of Electronic & Information Communication Engineering
Department of Korean Language and Multicultural Studies
Department of Influencer
History
The school was opened in 2002 that is part of the Yeong Gwang School Academy founded by Reverend Seongsan Rhee Young Shik with his founding spirit of "Love, Light, and Freedom."
Sister schools
A cooperative graduate program is offered with Nova Southeastern University, in the United States.
See also
List of colleges and universities in South Korea
Online education
Distance education
Education in South Korea
External links
Official school website, in Korean
Official school website, in English
Universities and colleges in North Gyeongsang Province
Distance education institutions based in South Korea
2002 establishments in South Korea
Universities and colleges established in 2002 |
https://en.wikipedia.org/wiki/Three%20Gays%20of%20the%20Condo | "Three Gays of the Condo" is the seventeenth episode of the fourteenth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on April 13, 2003. The episode was written by Matt Warburton and directed by Mark Kirkland. The title is a pun on the 1975 film Three Days of the Condor. In the episode Homer finds out that while dating, Marge did not enjoy going to Moe's Tavern while Homer got drunk. Homer notices two days later that Marge is pregnant with Bart, so he thinks that is why she stayed with him. Upset, Homer moves in with two gay men, Grady and Julio.
"Three Gays of the Condo" was The Simpsons''' second episode to revolve entirely on homosexuality, after "Homer's Phobia" in 1997, and just like the predecessor, the episode received largely positive reviews from both the critics and the LGBT community, praised for its smart comedy. The episode won the Primetime Emmy Award for Outstanding Animated Program, just as "Homer's Phobia" did in 1997.
Plot
The family is creating an enormous jigsaw puzzle. After they realize a jigsaw piece is missing, the family look for it. Homer looks through Marge's memory box and sees a poster of Moe's Tavern's opening (advertised as Meaux's Tavern) with Marge's writing on it. It says that Homer made the opening the worst day of her life due to him becoming drunk and ditching her to play Asteroids on an arcade machine with his friends, after which he was sent to the hospital with alcohol poisoning. This leaves Homer concerned about why Marge stayed with him; he then finds a hospital appointment card dated two days later, confirming she was pregnant with Bart. When Homer confronts Marge about the letter, she says she was just upset that night but is forced to admit that Homer did, and still does, things that annoy her. Homer then realizes Marge has been resenting him behind his back. The next day, they argue again and Homer leaves the house. He spends some time at Kirk Van Houten's apartment, but the generally depressive mood of the apartment complex where he lives drives him out. Homer then reads a newspaper saying that there is a place available. Finding out that the place is in Springfield's gay district, Homer moves in with a gay male couple, Grady and Julio. Homer has a visit home after taking Bart and Lisa out, but Marge and Homer still argue. At a gay bar, Homer tells Grady and Julio that his relationship with Marge is on the rocks.
The next day, Homer sees Marge and the kids, who have brought "Weird Al" Yankovic and his band, who play a song called "Homer and Marge", a parody of John Mellencamp's "Jack & Diane", to tell Homer that Marge loves him. Marge then asks Homer out on a date, but he is nervous while preparing for his date and drinks too much margarita. Meanwhile, at the venue of the date, Marge anxiously awaits Homer's arrival. When he arrives, she is upset that he is late and drunk, and leaves him. Back at the apartment, Grady trie |
https://en.wikipedia.org/wiki/INAP | INAP stands for Intelligent Network Application Protocol or Intelligent Network Application Part. It is the signalling protocol used in Intelligent Networking (IN). It is part of the Signalling System No. 7 (SS7) protocol suite, typically layered on top of the Transaction Capabilities Application Part (TCAP). It can also be termed as logic for controlling telecommunication services migrated from traditional switching points to computer based service independent platform.
Applications
The International Telecommunication Union (ITU) defines several "capability levels" for this protocol, starting with Capability Set 1 (CS-1). A typical application for the IN is a Number Translation service. For example, in the United Kingdom, 0800 numbers are freephone numbers and are translated to a geographic number using an IN platform. The Telephone exchanges decode the 0800 numbers to an IN trigger and the exchange connects to the IN.
The telephone exchange uses Transaction Capabilities Application Part (TCAP), Signaling Connection and Control Part (SCCP) and INAP and in IN terms is a service switching point (SSP). It sends an INAP Initial Detection Point (IDP) message to the service control point (SCP). The SCP returns an INAP Connect message, which contains a geographic number to forward the call to.
INAP messages are defined using ASN.1 encoding. SCCP is used for the routing. Extended form of INAP is Customised Applications for Mobile networks Enhanced Logic (CAMEL). TCAP is used to separate the transactions into discrete units.
References
Signaling System 7
Application layer protocols |
https://en.wikipedia.org/wiki/Flavors%20%28programming%20language%29 | Flavors, an early object-oriented extension to Lisp developed by Howard Cannon at the MIT Artificial Intelligence Laboratory for the Lisp machine and its programming language Lisp Machine Lisp, was the first programming language to include mixins. Symbolics used it for its Lisp machines, and eventually developed it into New Flavors; both the original and new Flavors were message passing OO models. It was hugely influential in the development of the Common Lisp Object System (CLOS).
Implementations of Flavors are also available for Common Lisp.
New Flavors replaced message sending with calling generic functions.
Flavors offers and daemons with the default method combination (called ).
Flavors and CLOS features comparison
Flavors offers a few features not found in CLOS:
Wrappers
Automatic lexical access to slots using variables within methods.
Internal flavor functions, macros and substs.
Automatically generated constructors.
options: , , .
function for sending messages.
CLOS offers the following features not found in Flavors:
Multimethods
Methods specialized on individual objects (via ).
Methods specialized on Common Lisp types (symbol, integer, ...).
Methods specialized on def-struct types.
Class slots.
Terminology
References
Further reading
"Flavors, Technical Report", MIT Artificial Intelligence Laboratory, Cambridge (Mass.), 1980
Daniel Weinreb and David A. Moon, "Flavors: Message Passing in the Lisp Machine", A.I. Memo No. 602, November 1980, MIT AI Lab
Lisp programming language family
Object-oriented programming languages |
https://en.wikipedia.org/wiki/EyeToy%3A%20Groove | EyeToy: Groove is a dancing game developed by London Studio and published by Sony Computer Entertainment. It was released on November 14, 2003 in Europe, on April 20, 2004 in North America, and on June 24, 2004 in Japan as EyeToy: FuriFuri Dance Tengoku. In EyeToy: Groove the player must hit targets with their arms on the edges of the screen to the beat of the music.
The game also includes a built-in calorie counter which estimates calories burned based on the player's weight. Players can usually burn around 5-20 calories per song. There are rewards available for high amounts of calories burned. There is also a mode that allows players to design their own moves for the songs.
Gameplay
Building on from the 'Beat Freak' mode from EyeToy: Play, players must hit targets on the edges of the screen with their arms in time to the music. There will sometimes be stars that require players to follow it from one position to the other. There are also freestyle segments in which players earn points by freely moving about on screen.
Music
There are 28 songs from several different artists including The Cheeky Girls, Daniel Bedingfield, Mis-Teeq, Earth, Wind & Fire, 5ive, Elvis Presley, Fatboy Slim, Groove Armada, Good Charlotte, Jessica Simpson, Sugababes, Las Ketchup, Madonna, and Village People.
Reception
The game received "average" reviews according to the review aggregation website Metacritic. In Japan, Famitsu gave it a score of one seven, one five, and two sixes for a total of 24 out of 40.
See also
Dance pad
References
External links
2003 video games
Dance video games
EyeToy games
London Studio games
Multiplayer and single-player video games
Music video games
PlayStation 2 games
PlayStation 2-only games
Sony Interactive Entertainment games
Video games developed in the United Kingdom |
https://en.wikipedia.org/wiki/T-tree | In computer science a T-tree is a type of binary tree data structure that is used by main-memory databases, such as Datablitz, eXtremeDB, MySQL Cluster, Oracle TimesTen and MobileLite.
A T-tree is a balanced index tree data structure optimized for cases
where both the index and the actual data are fully kept in memory, just as a B-tree is an index structure optimized for storage on block oriented secondary storage devices like hard disks. T-trees seek to gain the performance benefits of in-memory tree structures such as AVL trees while avoiding the large storage space overhead which is common to them.
T-trees do not keep copies of the indexed data fields within the index tree nodes themselves. Instead, they take advantage of the fact that the actual data is always in main memory together with the index so that they just contain pointers to the actual data fields.
The 'T' in T-tree refers to the shape of the node data structures in the original paper which first described this type of index.
Node structures
A T-tree node usually consists of pointers to the parent node, the left and right child node, an ordered array of data pointers and some extra control data. Nodes with two subtrees are called internal nodes, nodes without subtrees are called leaf nodes and nodes with only one subtree are named half-leaf nodes. A node is called the bounding node for a value if the value is between the node's current minimum and maximum value, inclusively.
For each internal node, leaf or half leaf nodes exist that contain the predecessor of its smallest data value (called the greatest lower bound) and one that contains the successor of its largest data value (called the least upper bound). Leaf and half-leaf nodes can contain any number of data elements from one to the maximum size of the data array. Internal nodes keep their occupancy between predefined minimum and maximum numbers of elements
Algorithms
Search
Search starts at the root node
If the current node is the bounding node for the search value then search its data array. Search fails if the value is not found in the data array.
If the search value is less than the minimum value of the current node then continue search in its left subtree. Search fails if there is no left subtree.
If the search value is greater than the maximum value of the current node then continue search in its right subtree. Search fails if there is no right subtree.
Insertion
Search for a bounding node for the new value. If such a node exists then:
check whether there is still space in its data array, if so then insert the new value and finish
if no space is available then remove the minimum value from the node's data array and insert the new value. Now proceed to the node holding the greatest lower bound for the node that the new value was inserted to. If the removed minimum value still fits in there then add it as the new maximum value of the node, else create a new right subnode for this node.
If no bounding node |
https://en.wikipedia.org/wiki/Dix | DIX or Dix may refer to:
Computing
Danish Internet Exchange Point, in Copenhagen
Data Integrity Extensions, data corruption error-handling field in data storage technology
Device Independent X, part of the 2D graphics device driver in the X.Org Server
DIX Ethernet, an Ethernet frame type
People
Surname
Dix is a Jewish German originating in the Rhineland, Germany
Adrian Dix (born 1964), Canadian politician
Alan Dix, British author and university professor
Bernard Dix (1925–1995), British trade unionist
Beulah Marie Dix (1876–1970), American screenwriter, playwright and novelist
Carl Dix (born 1948), American communist
De'Audra Dix (born 1984), American football player
Dorothea Dix (1802–1887), American social worker
Dorothy Dix (1861–1951), American journalist
Drew Dennis Dix (born 1944), US Army officer awarded the Medal of Honor
Eddie Dix (born 1970), Dutch baseball player
Edwin Asa Dix (1860–1911), AKA Edwin Augustus Dix, American author
Emily Dix (1904–1972), Welsh palaeobotanist
Eulabee Dix (1878–1961), American artist
Frederick Dix (1883–966), British speed skater
Gioele Dix (born 1956), Italian actor and comedian
Gregory Dix (1902–1952), English priest and liturgical scholar
Helena Dix (born 1979), Australian operatic soprano
Jan Dix, German musician
Joan Dix (1918–1991), English figure skater
John Alden Dix (1860–1928), New York governor
John Adams Dix (1798–1879), American Secretary of the Treasury, Governor of New York and Union major general during the Civil War
John Ross Dix (1811-after 1863), British writer and poet in Great Britain and America
Margaret Dix (1902–1991), British neuro-otologist
Margaret A. Dix (born 1939), Jersey-born Guatemalan botanist
Michèle Dix, British civil engineer
Morgan Dix (1827–1908), American Episcopal priest and theologian
Otto Dix (1891–1969), German expressionist
Peter Dix (1953–1988), Irish sailor
Richard Dix (1893–1949), American actor
Richard Dix (footballer) (1924–1990), English footballer
Robert Dix (1935–2018), American actor
Ronnie Dix (1912–1998), English footballer
Roscoe D. Dix (1839–1912), American politician and Michigan Auditor General
Rose Ellen Dix, English YouTuber
Shane Dix (born 1960), Australian writer
Sophie Dix (born 1969), English actress
Ute Dix (born 1955), German speed skater
Walter Dix (born 1986), American track and field athlete
William Dix (disambiguation), various people
Given name
Dix Terne, 1950s West German bobsledder
Places
Switzerland
Lac des Dix, the reservoir created by Grande Dixence Dam
United States
Dix, Illinois
Dix, Nebraska
Dix, New York
Dix Hill, in Raleigh, North Carolina
Dix Mountain, in the Adirondacks, New York
Dix Range, in the Adirondacks, New York
Dix River, in Kentucky
Dix Dam
Dix Stadium, in Kent, Ohio
Fort Dix, an Army post in New Jersey
Other uses
D-IX, a drug cocktail developed in Germany during WW2 to relieve fatigue
Dix (steamboat), a steamboat which ran on Puget Sound, USA fr |
https://en.wikipedia.org/wiki/Mythic | Mythic may refer to:
Myth, an academic term for a sacred story concerning the origins of the world
Mythic Entertainment, a computer game development studio
See also
Myth (disambiguation) |
https://en.wikipedia.org/wiki/Today%27s%20Children | Today's Children was a name shared by two thematically related American radio soap operas created and written by Irna Phillips, the earliest of which was her first nationally networked series.
1933-1938 series
The original series, which debuted on September 11, 1933, revolved around the large Moran clan, headed by widow Mary "Mother" Moran, who was voiced by Phillips herself. Mother Moran had three adult children—Terry, Frances, and Eileen—whose troubles she dealt with using what promotional materials called "warm-hearted understanding and a common-sense philosophy."
The creation of the series was a direct result of Phillips' resignation from her pioneering WGN series Painted Dreams when the station refused to allow her to take the program to a network. As a result of the station's decision, she created Children for NBC-owned WMAQ as a thinly disguised version of the earlier series. Mother Moran was based on Mother Moynahan the mother-in-law of WGN station manager Harry Gilman, and Lucy Gilman's grandmother.
The series ended on December 31, 1937, replaced in the new year by another Phillips creation, Woman in White.
In 1937 a novel was published in book form by Pillsbury Flour Mills Company based on the radio program and given the same name ("Today's Children"). The copyright was held by the National Broadcasting Company. No author was cited in the book. The book was illustrated with line drawings depicting the action, as well as photographs of the leading characters in the show - identified by their character names only.
Characters
A 1935 Pillsbury advertising premium describes the characters as follows.
Mary "Mother" Moran: "The widowed mother of Terry, Frances and Eileen -- a typical American family of today. So big is her heart that its loving kindness has taken in all the others--the people she calls her "family of Today's Children." Her quiet old-fashioned philosophy has brought peace and understanding to all the members of her family in times of trouble, for hers is a philosophy as sound and as enduring as the eternal hills—love of family, love of home, and love of fellow man."
Frances Moran: "The elder daughter, Frances, is twenty-five, tall and very blond. An ambitious, talented and successful commercial artist, she is typical of the modern business girl. Ordinarily practical and level-headed, she has occasionally let the dictates of her heart lead her into difficulties, but has a way of regaining her balance."
Eileen Moran: "The youngest of Mother Moran's children, she is perhaps her mother's secret favorite. Petite, dark and unsophisticated Eileen, at twenty has secured a foothold on the ladder of artistic success through her beautiful singing voice. Yet today she is not quite so sure that her first ambition--to have a career--is more worthwhile than love, family and a home."
Terry Moran: "Mother Moran's 'first born,' Terry is thirty-three, tall, and like his sister Eileen, dark. He has had his ups and downs, but is now well esta |
https://en.wikipedia.org/wiki/Scientific%20Computing%20%26%20Instrumentation | Scientific Computing (SC) (formerly Scientific Computing & Instrumentation - SC&I) is a trade publication of Advantage Business Media. It focuses on the scientific applications of computers for automating laboratory and instrument operations. While all aspects of scientific automation are covered, special emphasis is given to the areas of laboratory information management systems (LIMS), laboratory information systems (LIS), chromatography data systems (CDS), and Scientific data management systems (SDMS). It is published monthly, and currently has a global circulation of ~70k, mostly scientific and technical professionals. Subscriptions are free to qualified recipients (those working in the field).
The feature making this publication most useful to those working in the field is its annual supplements, many of which contain detailed vendor responses regarding their systems design. All of these questionnaires are posted on the publication's Web site, along with all articles, focus columns, and vendor submissions. It also provides a focus for vendor advertising, so that those looking to acquire one of these systems will have a starting point for research.
SC has recently started hosting online technical seminars, Web conferences, and expositions.
References
External links
Official website
WorldCat record
Computer science journals
Publications with year of establishment missing
Laboratory information management system |
https://en.wikipedia.org/wiki/Cydrome | Cydrome (1984−1988) was a computer company established in San Jose of the Silicon Valley region in California. Its mission was to develop a numeric processor. The founders were David Yen, Wei Yen, Ross Towle, Arun Kumar, and Bob Rau (the chief architect).
History
The company was originally named ”Axiom Systems". However another company in San Diego called "Axiom" was founded earlier. Axiom Systems called its architecture "SPARC". It sold the rights to the name (but not the architecture) to Sun Microsystems and used the money to hire NameLab to come up with a new company name. They came up with "Cydrome" from "cyber" (computer) "drome" (racecourse).
Cydrome moved from an office in San Jose to a business park in Milpitas on President's Day 1985. This site was used to host meetings of the Bay Area ACM chapter's Special Interest Group in Large Scale Systems (SIGBIG), in contrast to then SIGSMALL for microcomputers which are now called "PCs" and its present-day national SIGHPC.
Late in its history, Cydrome received an investment from Prime Computers and OEMed the Cydra-5 through Prime. The system sold by Cydrome had white skins. The skins for the Prime OEM system was black. In the Summer of 1988 Prime was set to acquire Cydrome. At the last minute the board of Prime decided not to go through with the deal. That sealed the fate of Cydrome.
The company closed after roughly 4 years of operation in 1988. Many of the ideas in Cydrome were carried on in the Itanium architecture.
Product
In order to improve performance in a new instruction set architecture, the Cydrome processors were based on a very long instruction word (VLIW) containing instructions from parallel operations. Software pipelining in a custom Fortran compiler generated code that would run efficiently.
The numeric processor used a 256 bit-wide instruction word with seven "fields". In most cases the compiler would find instructions that could run in parallel and place them together in a single word. It also had a special mode where each of the operations could be executed sequentially. It implemented register rotation to aid in software pipelining of loops. There was an instruction cache only, since it was felt that a data cache would be inefficient on sparse array operations.
The numeric processor also incorporated memory management and consequently employed virtual memory concepts. The memory subsystem implemented a 64 way interleaved 4-port memory. To ensure that there would be no "hot spots" within the memory system, the addresses to the memory were hashed to spread the accesses evenly across the 64 way memory system.
It was implemented in ECL running at 25 MHz. Major functional modules were implemented using AMCC ECL ASICs. The project grew beyond its original definition to include a front-end general purpose processor ensemble based on the multiple 68020 processors running Unix System V. The numeric processor ran a small kernel that would allow it to receive job submiss |
https://en.wikipedia.org/wiki/Stamford%20Brook | Stamford Brook was a tributary of the Tideway stretch of the River Thames in west London supplied by three headwaters. Historically used as an irrigation ditch or dyke the network of small watercourses had four lower courses and mouths.
History
Etymology
The name Stamford Brook may be a corruption of "stony ford", for a crossing by King Street. It has given its name to the surrounding area between Hammersmith and Chiswick, and to the local London Underground station, Stamford Brook.
The county of London created in 1889 was bounded by the westernmost course of Stamford Brook; it formed the boundary separating London Boroughs of Hammersmith and Acton in the new county from the Chiswick and Brentford Urban Districts in Middlesex.
By 1900, all six strands of the brook and drainage dykes had been covered over and formed the most useful depressions available to site the neighbourhood's sewers, and many diversionary surface water drains had been created closer to the surface to drain the catchment basin.
Disambiguation
Stamford Brook has no known connection with Stamford Bridge, the site of a bridge which carries the Kings Road over the stream to the east called Counter's Creek which rose to the immediate west of Notting Hill. The West London bridge gives its name to Chelsea Football Club's adjoining ground.
Course
Headwaters
A western headwater, the Bollo Brook or Bollar Brook was the westernmost brook feeding the channels running through Chiswick and Hammersmith. This rose on the site of Ealing Common Underground station, midway between Ealing and Acton and travelled south, then southeast, then divided, part was channelled south to Chiswick House and Chiswick; the remainder was channelled into four mouths described below. The main flow travelled east to the north of King Street, Hammersmith.
Surface water and foul water drains beside and under short stretches of Piccadilly and District lines followed by the rear of numbers up to 438 Chiswick High Road, then turn ENE follow the lowest depression of that watercourse, cutting across Chiswick Common, crossing the District Line at Turnham Green tube station to reach the formerly seasonally waterlogged, low-lying area of Stamford Brook Common.
Fresh water features such as the fishponds by the London Transport Museum Depot on the current location of Acton Town Underground station have been lost due to use of the depression for separate drainage systems.
An eastern headwater rose on Old Oak Common in Acton. north east of the Old Acton Wells, also known as Acton Wells
and flowed south down Old Oak Common Road and Old Oak Road then SSE down Askew Road. This course, now overtaken by segregation of surface water drainage and sanitary sewers afterwards ran the line of Paddenswick Road where it was joined by a flow emerging from Ravenscourt Park.
A middle headwater formed in North Acton near the interchange of the A40 and was known locally as the "Warple" — this ran southwards just west of Horn L |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.