source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/The%20Simpsons%20%28season%205%29
|
The fifth season of the American animated television series The Simpsons originally aired on the Fox network between September 30, 1993, and May 19, 1994. The showrunner for the fifth production season was David Mirkin who executive produced 20 episodes. Al Jean and Mike Reiss executive produced the remaining two, which were both hold overs that were produced for the previous season. The season contains some of the series' most acclaimed and popular episodes, including "Cape Feare", "Lisa vs. Malibu Stacy", "Homer Goes to College", "Deep Space Homer " and "Rosebud". It also includes the 100th episode, "Sweet Seymour Skinner's Baadasssss Song". The season was nominated for two Primetime Emmy Awards and won an Annie Award for Best Animated Television Program as well as an Environmental Media Award and a Genesis Award. The DVD box set was released in Region 1 on December 21, 2004, Region 2 on March 21, 2005, and Region 4 on March 23, 2005.
Production
The season was the first to be executive produced by David Mirkin, who would also run the following season. Several of the show's original writers who had worked on The Simpsons since the first season had left following the completion of season four. "Cape Feare", which was the final episode to be produced by the "original team", aired during this season as a hold over. Jay Kogen, Wallace Wolodarsky, Sam Simon and Jeff Martin wrote their final episodes for the season four production run. Show runners Al Jean and Mike Reiss left to produce their own series The Critic, but returned in subsequent seasons to produce more Simpsons episodes, and Jean again became the show runner starting with season thirteen. George Meyer and John Swartzwelder, Conan O'Brien, Frank Mula and future show runners Bill Oakley and Josh Weinstein all stayed with the show following the previous season. O'Brien would leave the series halfway through the production of the season to host his own show on NBC, Late Night with Conan O'Brien. He had been working on "Homer Goes to College" when he found out he was chosen to host Late Night and was forced to walk out on his contract. He later had a cameo appearance in "Bart Gets Famous". He recorded his part while Late Night was on the air, but O'Brien thought that his show might be canceled by the time the episode aired.
A whole new group of writers were brought in for this season. Jace Richdale was the first to be hired by Mirkin and others to receive their first writing credits were Greg Daniels and Dan McGrath. Mike Scully wrote "Lisa's Rival", which was produced for this season, but aired the next. Two freelance writers wrote episodes: David Richardson wrote "Homer Loves Flanders" while Bill Canterbury received two writing credits. Bob Anderson and Susie Dietter, who had previously worked on the show as part of the animation staff, would direct their first episodes.
The season started off with "Homer's Barbershop Quartet" which was chosen as the season premiere because it guest star
|
https://en.wikipedia.org/wiki/The%20Simpsons%20%28season%204%29
|
The fourth season of the American animated television series The Simpsons originally aired on the Fox network between September 24, 1992, and May 13, 1993, beginning with "Kamp Krusty". The showrunners for the fourth production season were Al Jean and Mike Reiss, with the season being produced by Gracie Films and 20th Century Fox Television. The aired season contained two episodes which were hold-over episodes from season three, which Jean and Reiss also ran. Following the end of the production of the season, Jean, Reiss and most of the original writing staff left the show. The season was nominated for two Primetime Emmy Awards and Dan Castellaneta would win one for his performance as Homer in "Mr. Plow". The fourth season was released on DVD in Region 1 on June 15, 2004, Region 2 on August 2, 2004, and in Region 4 on August 25, 2004.
Development
The season was executive produced by Al Jean and Mike Reiss, who had also run the previous season. Several of the show's original writers who had been with the show since the first season left following the completion of the season's production run. "Cape Feare", which was the final episode to be produced by the "original team", aired during season five as a holdover. Jay Kogen, Wallace Wolodarsky and Jeff Martin wrote their final episodes for the season four production run. David M. Stern and Jon Vitti also left but returned to write episodes for later seasons. Reiss and Jean left to produce their own series, The Critic, but later returned to produce several more The Simpsons episodes, and Jean again became the showrunner starting with season thirteen. Rich Moore, one of the show's original directors, also left to work on The Critic, but returned years later to assist with animation on The Simpsons Movie. George Meyer and John Swartzwelder stayed on, while Conan O'Brien, Frank Mula and future show runners Bill Oakley and Josh Weinstein received their first writing credits. One-time writers for the season include Adam I. Lapidus and the team of Gary Apple and Michael Carrington, although Carrington later returned to voice characters in "Simpson Tide" and "Million Dollar Abie".
Sam Simon, who had been showrunner for the show's first two seasons, assembled the original writing team, been the series' creative supervisor from its inception, and has been credited as "developing [the show's] sensibility", departed at the end of season four. Simon was involved in a series of creative disputes with the show's creator Matt Groening, producer James L. Brooks and production company Gracie Films. Simon commented that he "wasn't enjoying it anymore," and "that any show I've ever worked on, it turns me into a monster. I go crazy. I hate myself." Before leaving, he negotiated a deal that saw him receive a share of the show's profits every year and an executive producer credit despite not having worked on the show since then until his death.
This season's production run (9F) was the first to be animated by Film Roma
|
https://en.wikipedia.org/wiki/The%20Simpsons%20%28season%203%29
|
The third season of the American animated television series The Simpsons originally aired on the Fox network between September 19, 1991, and August 27, 1992. The showrunners for the third production season were Al Jean and Mike Reiss who executive produced 22 episodes for the season, while two other episodes were produced by James L. Brooks, Matt Groening, and Sam Simon, with it being produced by Gracie Films and 20th Century Fox Television. An additional episode, "Brother, Can You Spare Two Dimes?", aired on August 27, 1992, after the official end of the third season and is included on the Season 3 DVD set. Season three won six Primetime Emmy Awards for "Outstanding Voice-Over Performance" and also received a nomination for "Outstanding Animated Program" for the episode "Radio Bart". The complete season was released on DVD in Region 1 on August 26, 2003, Region 2 on October 6, 2003, and in Region 4 on October 22, 2003.
Production
Al Jean and Mike Reiss, who had written for The Simpsons since the start of the show, took over as showrunners this season. Their first episode as showrunners was "Mr. Lisa Goes to Washington" and they felt a lot of pressure about running the show. They also ran the following season and Jean would return as executive producer in season 13. There were two episodes, "Kamp Krusty" and "A Streetcar Named Marge", that were produced at the same time, but aired during season four as holdover episodes. Two episodes that aired during this season, "Stark Raving Dad" and "When Flanders Failed", were executive produced during the previous season by James L. Brooks, Matt Groening and Sam Simon.
Carlos Baeza and Jeffrey Lynch received their first directing credits this season. Alan Smart, an assistant director and layout artist, would receive his only directing credit. One-time writers from this season include Robert Cohen, Howard Gewirtz, Ken Levine and David Isaacs. Bill Oakley and Josh Weinstein, who would later become story editors, became a part of the writing staff to replace Jay Kogen and Wallace Wolodarsky both of whom had decided to leave the next season. The current arrangement of the theme song by music composer Alf Clausen was introduced during this season, corresponding with the show now being produced and broadcast in Dolby Surround.
A crossover episode with the live-action sitcom Thirtysomething, titled "Thirtysimpsons", was written by David M. Stern for this season, but was never produced because it "never seemed to work". The crossover would involve Homer meeting a group of Yuppies and hanging out with them.
The season premiere episode was "Stark Raving Dad", which guest starred Michael Jackson as the speaking voice of Leon Kompowsky. One of Jackson's conditions for guest starring was that he voiced himself under a pseudonym. While he recorded the voice work for the character, all of his singing was performed by Kipp Lennon, because Jackson wanted to play a joke on his brothers. Michael Jackson's lines were recor
|
https://en.wikipedia.org/wiki/The%20Simpsons%20%28season%202%29
|
The second season of the animated television series The Simpsons originally aired on the Fox network between October 11, 1990, and July 11, 1991, and contained 22 episodes, beginning with "Bart Gets an "F". Another episode, "Blood Feud", aired during the summer after the official season finale. The executive producers for the second production season were Matt Groening, James L. Brooks, and Sam Simon, who had also been EPs for the previous season. It was produced by Gracie Films and 20th Century Fox Television. The DVD box set was released on August 6, 2002, in Region 1, July 8, 2002 in Region 2 and in September 2002 in Region 4. The episode "Homer vs. Lisa and the 8th Commandment" won the Primetime Emmy Award for Outstanding Animated Program (for Programming Less Than One Hour), and was also nominated in the "Outstanding Sound Mixing for a Comedy Series or a Special" category.
Production
"Two Cars in Every Garage and Three Eyes on Every Fish" was the first episode produced for the season, but Bart Gets an "F" aired first because Bart was popular at the time and the producers had wanted to premiere with a Bart themed episode. The second season featured a new opening sequence, which was shortened from its original length of roughly 90 seconds. The opening sequence for the first season showed Bart stealing a "Bus Stop" sign; whilst the new sequence featured him skateboarding past several characters who had been introduced during the previous season. Starting with this season, there were three versions of the opening: a full roughly 75-second version, a 45-second version and a 25-second version. This gave the show's editors more leeway. This sequence would remain in use until the show's transfer to high definition midway through the twentieth season.
Mark Kirkland and Jim Reardon received their first directorial credits on the show while Jeff Martin and David M. Stern joined the writing staff.
Voice cast & characters
The season saw the introduction of several new recurring characters, including Mayor Quimby, Kang and Kodos, Maude Flanders, Bill and Marty, Dr. Hibbert, Roger Meyers, Jr., Sideshow Mel, Lionel Hutz, Dr. Nick Riviera, Blue Haired Lawyer, Rainier Wolfcastle, Troy McClure, Groundskeeper Willie, Hans Moleman, Professor Frink, Snake and Comic Book Guy.
Main cast
Dan Castellaneta as Homer Simpson, Grampa Simpson, Krusty the Clown, Groundskeeper Willie, Troy McClure, Barney Gumble and various others
Julie Kavner as Marge Simpson, Patty Bouvier, Selma Bouvier and various others
Nancy Cartwright as Bart Simpson, Nelson Muntz, Ralph Wiggum and various others
Yeardley Smith as Lisa Simpson
Harry Shearer as Mr. Burns, Waylon Smithers, Ned Flanders, Principal Skinner, Lenny Leonard, Kent Brockman, and Reverend Lovejoy
Hank Azaria as Moe Szyslak, Chief Wiggum, Professor Frink, Carl Carlson, Comic Book Guy and Apu
Recurring
Pamela Hayden as Milhouse van Houten, Jimbo Jones
Maggie Roswell as Maude Flanders, Helen Lovejoy and Miss Hoover
|
https://en.wikipedia.org/wiki/GOALTV
|
GOALTV was a football network offering Asia audiences coverage of European football. This included live games from three major European leagues as well as behind-the-scenes access to three Premier League clubs in England, Manchester City, Chelsea and Liverpool, in addition to FC Barcelona & Real Madrid FC of Spain.
Goal TV has closed down on 1 June 2013 in Singapore via SingTel mio TV Service and other Pay TV Providers in South East Asia with effect from 2 June 2013 and 3 June 2013 for website.
Programs on Goal TV 1
Real Madrid TV
Barça TV
City TV
Eredivisie
FCB TV
Manchester City TV
RMTV
Scottish Premier League
Football League Championship
Football League Cup
Ligue 1
Programs on Goal TV 2
Barca TV
Chelsea TV
City TV
LFC TV
Bayern Munich TV
Eredivisie
Football League Championship
On air
References
External links
Official website
Sports television networks
Defunct television channels
Cable television in Hong Kong
1993 establishments in Hong Kong
Television channels and stations established in 1993
Television channels and stations disestablished in 2013
|
https://en.wikipedia.org/wiki/Noga%20Alon
|
Noga Alon (; born 1956) is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.
Education and career
Alon was born in 1956 in Haifa, where he graduated from the Hebrew Reali School in 1974. He graduated summa cum laude from the Technion – Israel Institute of Technology in 1979, earned a master's degree in mathematics in 1980 from Tel Aviv University, and received his Ph.D. in Mathematics at the Hebrew University of Jerusalem in 1983 with the dissertation Extremal Problems in Combinatorics supervised by Micha Perles.
After postdoctoral research at the Massachusetts Institute of Technology he returned to Tel Aviv University as a senior lecturer in 1985, obtained a permanent position as an associate professor there in 1986, and was promoted to full professor in 1988. He was head of the School of Mathematical Science from 1999 to 2001, and was given the Florence and Ted Baumritter Combinatorics and Computer Science Chair, before retiring as professor emeritus and moving to Princeton University in 2018.
He was editor-in-chief of the journal Random Structures and Algorithms beginning in 2008.
Research
Alon has published more than five hundred research papers, mostly in combinatorics and in theoretical computer science, and one book, on the probabilistic method. He has also published under the pseudonym "A. Nilli", based on the name of his daughter Nilli Alon.
His research contributions include the combinatorial Nullstellensatz, an algebraic tool with many applications in combinatorics; color-coding, a technique for fixed-parameter tractability of pattern-matching algorithms in graphs; and the Alon–Boppana bound in spectral graph theory.
Selected works
Book
The Probabilistic Method, with Joel Spencer, Wiley, 1992. 2nd ed., 2000; 3rd ed., 2008; 4th ed., 2016.
Research articles
Previously in the ACM Symposium on Theory of Computing (STOC), 1996.
Awards
Alon has received a number of awards, including the following:
1989 – Erdős Prize;
2000 – George Pólya Prize in Applied Combinatorics of the Society for Industrial and Applied Mathematics
2001 – Michael Bruno Memorial Award of the Israel Institute for Advanced Studies;
2005 – Gödel Prize, with Yossi Matias and Mario Szegedy, for their paper "The space complexity of approximating the frequency moments" on streaming algorithms
2008 – Israel Prize, for mathematics.
2011 – EMET Prize, with Saharon Shelah, for mathematics.
2019 – Paris Kanellakis Award, with Phillip Gibbons, Yossi Matias and Mario Szegedy, "for foundational work on streaming algorithms and their application to large scale data analytics"
2021 – Leroy P. Steele Prize for Mathematical Exposition, with Joel Spencer, for The Probabilistic Method
2022 – Shaw Prize in Mathematical Sciences, with Ehud Hrushovski, "for their remarkable contributions to discrete mathematics and model theor
|
https://en.wikipedia.org/wiki/University%20of%20Computer%20Studies%2C%20Yangon
|
The University of Computer Studies, Yangon (UCSY) ( ), located in the outskirts of Yangon in Hlawga, is the leading IT and computer science university of Myanmar. The university, administered by the Ministry of Education, offers undergraduate and graduate degree programs in computer science and technology. The language of instruction at UCSY is English. Along with the University of Computer Studies, Mandalay, UCSY is one of two premier universities specializing in computer studies, and also one of the most selective universities in the country.
Many of the country's middle and upper level personnel in government and industry are graduates of
UCSY.
History
UCSY's origins trace back to the founding of the Universities' Computer Center (UCC) in 1971 at the Hlaing Campus of Yangon University. Equipped with ICL ICL 1902S and with the help of distinguished visiting professors from US, UK and Europe, UCC provided computer education and training to university and government employees. In 1973, it began offering a master's degree program (MSc in Computer Science), and a graduate diploma program (Diploma in Automated Computing) in cooperation with the Mathematics Department of Yangon University. The center added DEC PDP-11/70 mini-computers in 1983, and personal computers in 1990. In 1986, the center added B.C.Sc. (Bachelor of Computer Science) and B.C.Tech. (Bachelor of Computer Technology) degree programs.
In March 1988, the Institute of Computer Science and Technology (ICST) was established, and began offering bachelor's degree programs in Computer Science. In 1993, it started an internationally accepted International Diploma in Computer Studies (IDCS) program with the help of UK's the National Computing Centre (NCC). On 1 January 1997, the university's control was transferred from the Ministry of Education to the Ministry Science and Technology. On 1 July 1998, it was renamed the University of Computer Studies, Yangon. A graduate school with master's and PhD degree programs was established in May 2001.
Programs
UCSY offers five-year bachelor's and two-year master's degree programs in computer science and computer technology. The school also offers a two-year post-graduate diploma and a three-year Ph.D. program in computer science and information technology. The school's language of instruction is English.
Faculties
Faculty of Computer Systems and Technologies
Faculty of Computer Science
Faculty of Information Science
Faculty of Computing
Supporting departments
Department of Japanese
Department of English
Department of Natural Science
Department of Information Technology Operations
Research labs
Natural Language Processing Lab
Geographic Information System Lab
Image Processing Lab
Mobile and Wireless Computing Lab
Embedded System Lab
Cyber Security Research Lab
Cisco Network Lab
Cloud Computing Lab
Artificial Intelligence Lab
Computer Graphics and Visualization
Database System Lab
Software Engineering Lab
Numerical Analysis
|
https://en.wikipedia.org/wiki/The%20Cage%20%28radio%20show%29
|
The Cage is the name of two different breakfast shows on Australian radio network Triple M, broadcasting in Brisbane and Melbourne. Previously Sydney and Adelaide received the Melbourne version, however these cities now have their own individual shows.
The Melbourne Cage finished up at the end of 2007. They broadcast the last show after 6 years in November. It was announced that the team and Triple M have decided not to continue after longtime member James Brayshaw decided not to return. From 2008, comedian Peter Helliar took over the Melbourne breakfast spot with co-host Myf Warhurst. On 7 September 2009, The Hot Breakfast with Eddie McGuire took over the Melbourne breakfast slot.
The Cage (Brisbane)
The breakfast show on Triple M Brisbane is The Cage. Breakfast begins from 5:30am weekdays with The Cage with Ian Skippen, Marto, Sully and Emily Jade O'Keefe on 104.5 Triple M. In September 2011, after six years the show finished due to lackluster ratings.
The Cage (Melbourne)
The Melbourne version of The Cage was made up of Peter Berner, Brigitte Duclos, James Brayshaw, Matt Parkinson & Mike Fitzpatrick, however they were often referred to by their nicknames: "Pete", "Brig", "JB", "Parko" & "Fitzy" respectively. The show ran from 6:00 am to 9:00 am weekdays (AEDST) and contained regular segments such as Jason Donovans Autobiography, Parko's Idiot Box, JB's Spin On Sport, The Duclos Report, JB's Internet Joke, Happy News, The Great Cage Debate and the Scared Weird Little Guys doing Song of the Week.
As well as celebrity interviews, snap phone polls, music and comical chatter. It featured characters created by Matt Parkinson including Nurry from Frankston, Ivan Inkling of Special Squad, Dr. G.I. Low, Keith McKorkin, Nicky Knuckles, Hugh Jorgen, Gene Creamer, Gavin Spotsworth, Randy Buff, Antonio Banderas, Captain Speaking, Mike Tyson and David "Becks" Beckham. Duclos also contributed her own character in one episode, to gender-balance the characters on the show. Her character was known as Pretty McClitty and Duclos basically talked in a drawn-out bogan style voice.
Regular celebrity guests included Jason Dunstall, Laura Csortan, Peter Rowsthorn and Garry Lyon. Previous regular Cage members were Tim Smith ("Timbo"), Matthew Quartermaine ("Quarters"), Russell Gilbert ("Gilbo") and Trevor Marmalade ("Trev").
History
The show began in Melbourne at the start of 2002, when Tim Smith was given free rein to put together a new drive time show. When the breakfast show at the time flopped, The Cage was moved to the vacant breakfast slot only three months after it began. A relay of the breakfast show, with about 20% new content, was played in the drive slot. Triple M eventually decided in July 2002 to concentrate The Cage on breakfast only. In October 2006, Sydney radio ratings had 2Day FM winning the FM market and Triple M, with The Cage breakfast team slipping to 6.8 per cent, down 1.2 points and reigniting speculation over whether the show would con
|
https://en.wikipedia.org/wiki/Papakura%20railway%20station
|
Papakura railway station is a railway station in Papakura, New Zealand, on the Southern Line of the Auckland railway network.
History
The station was opened on 20 May 1875, as part of the Auckland and Mercer Railway on 20 May 1875, built by Brogden & Co, when it was extended from Penrose. On 2 October 1874 a deputation asked for the contractor to run trains from Penrose to Papakura and some services were available from October 1874. For example, Brogden & Sons ran excursion trains to Drury that month.
Initially Papakura was served by 2 trains a day. By 1879 there were 3 trains a day, the fastest taking 1hr 9mins for the from Auckland. Papakura became the terminus of an improved suburban service in 1913. WAB Class locomotives were introduced to suburban services in 1922, but the coaching stock appears from photos to have been unchanged in 1966. With double tracking, suburban trains were speeded up in 1931, the fastest taking 49 minutes. Suburban Sunday trains at low fares were introduced in 1933. From 1938 to 1950 many trains carried troops to and from the Military Camp. Trains calling at Papakura have included The Overlander, Northerner (in 1975 the platform was extended to for the Northerner), Northern Explorer, Silver Fern (from 19 September 1977), Waikato Connection, Geyserland Express, Thames Express (from 1921), Taneatua Express and Kaimai Express.
Plantations were established near many railway stations for beautification and, possibly, to provide timber for railway construction. Papakura's railway reserve was planted in 1883, with oaks and blue gums, and was protected in 1935. It was renamed Massey Park in 1939. Some of the trees remain.
By 1884 Papakura had a 4th class station, platform, cart approach, by goods shed (extended by in 1921), loading bank, cattle yards, stationmaster's house, urinals and a passing loop for 37 wagons (extended to 70 in 1905). From 1882 to 1913 a Post Office was run by railway staff. In 1885 the station was moved to the other side of the line. A verandah was added in 1905, sheep yards in 1911 and an engine shed between 1913 and 1917.
In 1920 the first sod was turned for a new station. In 1921 a new yard came into use, with a siding capacity of 450 wagons, together with an island platform, station building, a turntable replaced by one of by 1988) and several railway houses. By 1922 only the overhead footbridges were unfinished and the old building was being removed. Electric replaced oil lamps in 1926. With increasing suburban traffic, work started in 1938 on a new ticket office, carpark, bridge and platform. On 9 September 1940 a new suburban platform on the west of the station was brought into use. The station building was again rebuilt in 1983.
Tablet instruments were installed in 1904, fixed signals in 1905, distant signals in 1916 and electric interlocked signalling in 1927.
Duplication of the tracks between Papatoetoe and Papakura started in 1929 as an employment relief scheme and was compl
|
https://en.wikipedia.org/wiki/Homai%20railway%20station
|
Homai railway station is on the Southern Line of the Auckland railway network in New Zealand. It has an island platform layout. A bus stop and a park and ride facility are located adjacent to the station.
History
The North Island Main Trunk Line through South Auckland opened in 1875. However, Homai Station didn't open until 15 August 1924, after local farmers John Dreadon, Alexander and Masters lobbied Prime Minister William Massey. In line with other stations opened in Auckland suburbs at the time, it was partly financed by local developers. In the case of Homai, John Dreadon donated £500 and land for the station and the bridge, which replaced a level crossing. Three other landowners also contributed. As a result, it was decided to name the station using the Māori word for 'gift', homai, rather than Browns Rd, as it was initially referred to.
Daily boardings were measured as 338 in 2003. This figure had jumped to 936 by 2010. The station was upgraded in 2006 with a modern shelter, platform lighting and a much longer platform installed.
Services
Auckland One Rail, on behalf of Auckland Transport, operates suburban services to Britomart, Papakura and Pukekohe via Homai. The typical weekday off-peak timetable is:
3 tph to Britomart, via Penrose and Newmarket
3 tph to Papakura
Homai station is served by bus route 365 while bus route 361 also passes close by.
Access
There are three ways to access the platform. There is a ramp down from the Browns Road Overbridge to the south end of the platform. There is a pedestrian level crossing from the park and ride carpark (which is on Dalgety Drive) to the south end of the platform, and there is another pedestrian level crossing from McVilly Road to the north end of the platform.
See also
List of Auckland railway stations
References
Rail transport in Auckland
Railway stations in New Zealand
Railway stations in New Zealand opened in the 1920s
|
https://en.wikipedia.org/wiki/Takaanini%20railway%20station
|
Takaanini railway station, formerly spelt Takanini, is on the Southern Line of the Auckland railway network in New Zealand. The station has an island platform layout and is accessed from Manuroa Road, Station Road and Taka Street in the Takanini suburb of Auckland.
History
The station, originally known as Lupton's Crossing, was opened in October 1913. Goods services were closed on 29 April 1980.
Proposed upgrade
A proposal was made by the former Papakura District Council to create a new station and Park and Ride facility at Glenora Road, next to the new Southgate shopping centre, to coincide with the new Addison residential development taking place on the former horse training track land.
In 2012, the Papakura Local Board requested a new station and park and ride be built at Walters Road. This proposal was listed in Auckland Transport's draft land transport plan.
On 19 October 2018, Auckland Transport renamed the station to Takaanini in line with Auckland Council's Te Reo Māori policy to reflect the correct spelling of Ihaka Wirihana Takaanini after whom the area is named.
Services
Auckland One Rail, on behalf of Auckland Transport, operates suburban services to Britomart, Papakura and Pukekohe via Takaanini. Since 17 November 2019, the basic weekday off-peak timetable is:
3 tph to Britomart, via Penrose and Newmarket
3 tph to Papakura
Bus route 365 serves Takaanini Station and route 33 passes close by.
See also
List of Auckland railway stations
References
Rail transport in Auckland
Railway stations in New Zealand
Buildings and structures in Auckland
Railway stations opened in 1913
Railway stations in New Zealand opened in the 1910s
|
https://en.wikipedia.org/wiki/Monitor%20filter
|
A monitor filter is an accessory to the computer display to filter out the light reflected from the smooth glass surface of a CRT or flat panel display. Many also include a ground to dissipate static buildup. A secondary use for monitor filters is privacy as they decrease the viewing angle of a monitor, preventing it from being viewed from the side; in this case, they are also called privacy screens.
The standard type of anti-glare filter consists of a coating that reduces the reflection from a glass or plastic surface. These are manufactured from polycarbonate or acrylic plastic. An older variety of anti-glare filter used a mesh filter that had the appearance of a nylon screen. Although effective, a mesh filter also caused degradation of the image quality.
Marketing names of privacy filters:
HP's "SureView"
Lenovo's "PrivacyGuard"
Dell's "SafeScreen"
Support for privacy screen is available since Linux kernel 5.17 that expose it through Direct Rendering Manager and is used by GNOME 42.
References
Display technology
Ergonomics
|
https://en.wikipedia.org/wiki/Multiseat%20configuration
|
A multiseat, multi-station or multiterminal system is a single computer which supports multiple independent local users at the same time.
A "seat" consists of all hardware devices assigned to a specific workplace at which one user sits at and interacts with the computer. It consists of at least one graphics device (graphics card or just an output (e.g. HDMI/VGA/DisplayPort port) and the attached monitor/video projector) for the output and a keyboard and a mouse for the input. It can also include video cameras, sound cards and more.
Motivation
Since the 1960s computers have been shared between users. Especially in the early days of computing when computers were extremely expensive the usual paradigm was a central mainframe computer connected to numerous terminals. With the advent of personal computing this paradigm has been largely replaced by personal computers (or one computer per user).
Multiseat setups are a return to this multiuser paradigm but based around a PC which supports a number of zero-clients usually consisting of a terminal per user (screen, keyboard, mouse).
In some situations a multiseat setup is more cost-effective because it is not necessary to buy separate motherboards, microprocessors, RAM, hard disks and other components for each user. For example, buying one high speed CPU, usually costs less than buying several slower CPUs.
History
In the 1970s, it was very commonplace to connect multiple computer terminals to a single mainframe computer, even graphical terminals. Early terminals were connected with RS-232 type serial connections, either directly, or through modems. With the advent of Internet Protocol based networking, it became possible for multiple users to log into a host using telnet or – for a graphic environment – an X Window System "server". These systems would retain a physically secure "root console" for system administration and direct access to the host machine.
Support for multiple consoles in a PC running the X interface was implemented in 2001 by Miguel Freitas, using the Linux operating system and the X11 graphical system (at the time maintained by XFree86). This was done using a patch in the display server to execute several instances of X at the same time such that each one captures specific mouse and keyboard events and the graphical content. This method received the name of multiseat or multiterminal.
In 2001, Thinsoft BeTwin offered a multiseat solution for Windows, utilizing multiple graphics cards and peripherals attached to a single host PC.
In 2002 a Canadian company, Userful Corporation, released Userful Multiplier, a multiseat Linux software solution that enables up to 10 users to simultaneously share one computer. Earlier they worked on a kernel-based approach to a multi-station platform computer, but abandoned the idea due to a problem with multiple video card support.
Other solutions appeared in 2003, such Svetoslav Slavtchev, Aivils Stoss and James Simmons worked, with the evdev and
|
https://en.wikipedia.org/wiki/Feminists%20Against%20Censorship
|
Feminists Against Censorship (FAC) is a large network of women founded in 1989 in the United Kingdom to present the feminist arguments against censorship, particularly of sexual materials, and to defend individual sexual expression.
FAC originally came together in response to the passage of a resolution by the annual general meeting of the National Council for Civil Liberties in 1989 condemning pornography. Spearheaded by British activists Linda Semple and Roz Kaveney, meetings of feminists were organised in London to begin producing documents and speaking up for the feminist position in support of free expression.
FAC is unfunded and has no paid staff or offices. Individual members write submissions to government bodies, letters, and other publications. FAC and its members have produced several books presenting research reviews, analysis, and personal experiences related to censorship and pornography. They are also available to speak to the public and have joined university debates as well as appearing on television and participating in radio discussions.
They are a member of Backlash, which was formed in 2005 in order to oppose a new law criminalising possession of "extreme pornography". FAC responded to the Government consultation on this law.
See also
Civil libertarianism
Civil liberties
Sex-positive feminism
Sex-positive movement
References
External links
Feminists Against Censorship web presence:
Facebook group
Former homepage (archived August 2015)
Censorship in the United Kingdom
Organizations established in 1989
Freedom of expression organizations
Feminist organisations in the United Kingdom
Sexuality in the United Kingdom
Third-wave feminism
Women's organisations based in the United Kingdom
1989 establishments in the United Kingdom
|
https://en.wikipedia.org/wiki/File%20exchange
|
File exchange can refer to
File eXchange Protocol, a protocol for remotely connecting two computers.
File exchange service sites for exchanging files that are too large for email attachments.
|
https://en.wikipedia.org/wiki/Spartan%20%28video%20game%29
|
Spartan is a computer wargame developed by Slitherine Strategies in 2004. The game is set in ancient Greece and Asia Minor. Spartan is a turn-based game; however, when armies encounter each other in battle the game switches to real time combat available in both 2D and 3D visuals. Most reviewers were positive about the extent of simulated real history present in the game but were critical of how timid the AI is which hampered the playing experience.
Gameplay
Tactical game
The player deploys their forces behind a start line, usually with the benefit of some information about the enemy deployment. They are also able to give some limited orders such as hold or advance. When the battle is started the player has very limited control over events - something which was very much the case for generals of the period it depicts. Philip Veale has said that the designers wanted to avoid the game becoming a click race but conceded that though deployment did affect the outcome of battles this was often not apparent to players. The player may sound an attack signal which will cause all troops with a hold order to move to the attack and also the retreat for when all hope is lost. Winning battles is then a question of anticipating how the troops are going to behave and so ensuring that when the troops clash it is in a way favorable to you.
Strategic game
The player controls a faction picked from a massive selection, which may be Greek (such as Athens or Thessaly), tribal (such as Thracian Asti), or some Eastern (such as the Lydians or Mysians). All factions have a different number of cities to conquer and specific victory conditions to win each with their own special unique buildings and units.
Resources play a role in the game economy. There are number of resources, and they are not available to all cities; trade allows for imports and exports. Silver is used as currency, in trade, and to pay soldiers. All cities will produce some silver (through taxes, etc.), but only a few have the ability to have silver mines constructed. Food is needed to feed the population, but only a few areas have enough farmland to feed a larger faction (small factions can get by simply importing the necessary food, larger factions may find the cost too large unless they have at least some cities that can produce food). Bricks are used for construction of most buildings, as well as their upkeep. Other resources are used for training warriors or the construction of advanced buildings.
Diplomacy is carried out by sending the limited number of diplomats to whatever factions one deem they would be most useful to influence where they can be given various orders, ranging from those beneficial to the players relations with that faction like seeking asylia for merchants or gifting horses, or actions that hurt them, or just recalling them to send them somewhere else. If the enemy dislike the players actions they may decide to expel or kill the player's diplomat (and the player may do likewis
|
https://en.wikipedia.org/wiki/World%20Championship%20Rugby
|
World Championship Rugby is a computer and video game developed after the 2003 Rugby World Cup. It was developed by Swordfish Studios and published by Acclaim Entertainment.
As well as all the teams and games from the 2003 Rugby World Cup, the game includes a number of other tournaments, such as Six Nations, Tri Nations, custom leagues and cups, classic matches and tour games. There is also a feature to beat the all- stars with every team in the game and a survival game. The only licensed teams in the game are England and Wales, however, included is a name editor that allows the fake player names to be changed.
Development
Following England Rugby's success at the 2003 Rugby World Cup in Australia, Acclaim Entertainment International announced in November 2003 that they would be releasing World Championship Rugby for PlayStation 2, Xbox and PC in Europe the following year. It is a fast-paced rugby game, with the emphasis on scoring many tries. Commentary was provided by Miles Harrison and Stuart Barnes. The game was developed at the United Kingdom-based Swordfish Studios, by a team which included several staff who had worked on Jonah Lomu Rugby.
See also
Jonah Lomu Rugby
References
2004 video games
Acclaim Entertainment games
Mobile games
PlayStation 2 games
Rugby union video games
Video games developed in the United Kingdom
Windows games
Xbox games
Multiplayer and single-player video games
Juice Games
Swordfish Studios games
|
https://en.wikipedia.org/wiki/European%20route%20E79
|
European route E 79 is a road part of the International E-road network. It begins in Miskolc, Hungary and ends in Thessaloniki, Greece, also running through Romania and Bulgaria. The road is long.
Itinerary
The E 79 routes through four European countries:
: Miskolc (Start of Concurrency of ) - Igrici
: Igrici (End of Concurrency of ) - Görbeháza
: Görbeháza - Debrecen () - Berettyóújfalu
: Berettyóújfalu (Start of Concurrency of ) - Nagykereki
: Borș - Oradea (End of Concurrency of )
: Oradea - Beiuș - Deva
: Deva bypass ()
: Deva - Petroșani - Târgu Jiu - Filiași
: Filiași (Start of Concurrency of ) - Craiova (End of Concurrency of )
: Craiova - Calafat
: Vidin - Montana - Vratsa - Botevgrad
: Botevgrad - Sofia
:
: West (Western arc)
: Sofia - Pernik – Blagoevgrad
: Blagoevgrad - Kulata
: Promachonas - Serres - Thessaloniki ()
Route description
Hungary
The Hungarian section of E79 shares parts of its path with other E-roads, such as E60, E573 and E71.
Romania
The Romanian section of the road is mostly new asphalt, as can be seen on the map with Romanian road quality. Although only in the region of the road itself has many curves as it goes directly through 2 major mountain groups of the Carpathian range: the Apuseni Mountains and the Meridionali Mountains. With a restriction when passing through the many minor villages, and a large part of its length in the Carpathian mountains (about 40-50% of its length in Romania), the average speed is generally in the 50–60 km/h range.
Especially in the mountainous parts, the road can be considered as more suitable for tourism than for high speed traveling, but as it has been in a very poor state up until a couple of years ago, touristic infrastructure is still poorly developed (road side hotels, restaurants). Plan ahead if you consider staying overnight in hotels on this route (best options are outside of the cities, with few exceptions - Oradea, Deva - but there are not so many decent locations for accommodation).
Since 2012, work has begun to improve the quality of this road:
A. Oradea – Deva (Șoimuș) [under construction on approx. 2-3 % of its length]: Most of the road in this section has been modernized (as of August 2021, about 95% is in good condition). Drive carefully, especially during the night or in bad weather conditions, as many safety elements may be missing (there are many parts with good asphalt, but no traffic signs and road marks). Parts of the road are still under construction, while other parts have been finished and are good (some excellent). In August 2021, 3 traffic lights were still in place on this section.
Contracts were signed in late 2012 to improve this section. Status of work progress is December 2017, by section, North to South:
- Oradea-Beiuș (cca. 60 km): This section has been recently re-done completely. There may still be areas with poor or no road markings, so travel carefully especially during the night.
- Beiuș-Ștei (cca. 28 km): This section has be
|
https://en.wikipedia.org/wiki/Samedan
|
Samedan (, ) is a town and municipality in the Maloja Region in the Swiss canton of Grisons. It is served by Samedan railway station on the Rhaetian Railway network and by the Samedan Airport.
History
Samedan is first mentioned in 1137–1139 as Samadene, and in 1156 as Samadn. For 1288 there is evidence of a residential tower in the upper part of the village. In 1462 Samedan became the seat of lower jurisdiction. In the Swabian War of 1499, the village burned down. In 1551 the parish of Samedan, one of three large parishes in the Upper Engadin, converted to Protestantism. From the 16th century onwards, some families, especially the von Salis and von Planta, became very wealthy and had magnificent houses built in the village. They owed their financial success, among other things, to their political offices, but also to emigration and mercenary service abroad.
In the 19th century, trade and commerce developed earlier and faster in Samedan than anywhere else in the Engadin. Tourism began circa 1830: Hotels were built, mountains were climbed for the first time, and English tourists had an English church erected in 1872 (it was demolished in 1965). A golf course was built in 1893; the Muottas-Muragl-Bahn (a funicular railway) was constructed in 1907.
The first power station was built in 1888 and a major hospital in 1895. Banks and a printer settled in Samedan. In 1903 the town was connected to the Rhaetian Railway; it soon became the most important railway junction in the Engadin. The airfield was opened in 1937; the Protestant school, today's Academia Engiadina, in 1943. On 1 October 1943, Samedan was mistakenly bombed by American planes. Luckily, nobody was hurt. From the 1980s, the formerly Romansh farming village developed into a modern service centre, in which German speakers outnumber Romansh speakers.
Geography
Samedan has an area, (as of the 2004/09 survey) of . Of this area, about 15.5% is used for agricultural purposes, while 9.7% is forested. Of the rest of the land, 1.9% is settled (buildings or roads) and 72.9% is unproductive land. Over the past two decades (1979/85-2004/09) the amount of land that is settled has increased by and the agricultural land has decreased by .
Before 2017, the municipality was located in the Oberengadin sub-district of the Maloja district in the central Oberengadin valley along the Inn river. After 2017 it was part of the Maloja Region. It consists of the village of Samedan and the hamlet of Punt Muragl, the upper section of the Val Bever as well as an exclave that includes nearly the entire Val Roseg, a valley surrounded by the highest mountains of the canton: Piz Bernina, Piz Scerscen and Piz Roseg. Until 1943 Samedan was known as Samaden.
Demographics
Samedan has a population () of . , 23.6% of the population are resident foreign nationals. Over the last 3 years (2010–2013) the population has changed at a rate of 1.31%. The birth rate in the municipality, in 2013, was 8.3 while the death ra
|
https://en.wikipedia.org/wiki/Brian%20Carney%20%28editorialist%29
|
Brian M. Carney is a senior executive at Rivada Networks. He is formerly an editor, journalist and member of the Editorial Board at The Wall Street Journal.
From August 2009 until early 2014 , he lived in London and served as editorial page editor of The Wall Street Journal Europe. He is the coauthor, with Isaac Getz, of Freedom, Inc., published by Crown Business on October 13, 2009. He has won the Gerald Loeb Award for business journalism and the Frederic Bastiat Journalism Prize.
Biography
Brian Carney attended Yale College, where he majored in philosophy and was the 93rd Chairman of the Party of the Right (Yale). He was also involved in the Yale Political Union. He then went on to receive a master's degree in philosophy from Boston University. After college, he spent a winter working as a sternman on a lobster boat on Monhegan Island, Maine. Before becoming a Wall Street Journal Editorial Board member he was the editorial page editor of The Wall Street Journal Europe. Prior to that he worked for the "Innovations in American Government" program at Harvard University.
Awards
2009 Gerald Loeb Award for Commentary for "Fannie Mae and Freddie Mac"
Books
Freedom, Inc.: Free Your Employees and Let Them Lead Your Business to Higher Productivity, Profits, and Growth, Brian M. Carney, Isaac Getz, New York, Crown Business/Random House, 2009, 304 p. () (revised and expanded edition, Freedom, Inc.: How Corporate Liberation Unleashes Employee Potential and Business Performance, Argo Navis/Perseus Books, 2016), 400 p. (); translated into more than a dozen languages.
References
External links
"Brian Carney", The Wall Street Journal
Living people
Year of birth missing (living people)
The Wall Street Journal people
Yale College alumni
Boston University Graduate School of Arts & Sciences alumni
Harvard University staff
Bastiat Prize winners
Gerald Loeb Award winners for Columns, Commentary, and Editorials
|
https://en.wikipedia.org/wiki/Escape%20analysis
|
In compiler optimization, escape analysis is a method for determining the dynamic scope of pointers where in the program a pointer can be accessed. It is related to pointer analysis and shape analysis.
When a variable (or an object) is allocated in a subroutine, a pointer to the variable can escape to other threads of execution, or to calling subroutines. If an implementation uses tail call optimization (usually required for functional languages), objects may also be seen as escaping to called subroutines. If a language supports first-class continuations (as do Scheme and Standard ML of New Jersey), portions of the call stack may also escape.
If a subroutine allocates an object and returns a pointer to it, the object can be accessed from undetermined places in the program the pointer has "escaped". Pointers can also escape if they are stored in global variables or other data structures that, in turn, escape the current procedure.
Escape analysis determines all the places where a pointer can be stored and whether the lifetime of the pointer can be proven to be restricted only to the current procedure and/or thread.
Optimizations
A compiler can use the results of escape analysis as a basis for optimizations:
Converting heap allocations to stack allocations. If an object is allocated in a subroutine, and a pointer to the object never escapes, the object may be a candidate for stack allocation instead of heap allocation. In garbage-collected languages this can reduce how often the collector needs to run.
Synchronization elision. If an object is found to be accessible from one thread only, operations on the object can be performed without synchronization.
Breaking up objects or scalar replacement. An object may be found to be accessed in ways that do not require the object to exist as a sequential memory structure. This may allow parts (or all) of the object to be stored in CPU registers instead of in memory.
Practical considerations
In object-oriented programming languages, dynamic compilers are particularly good candidates for performing escape analysis. In traditional static compilation, method overriding can make escape analysis impossible, as any called method might be overridden by a version that allows a pointer to escape. Dynamic compilers can perform escape analysis using the available information on overloading, and re-do the analysis when relevant methods are overridden by dynamic code loading.
The popularity of the Java programming language has made escape analysis a target of interest. Java's combination of heap-only object allocation, built-in threading, the Sun HotSpot dynamic compiler, and OpenJ9's just-in-time compiler (JIT) creates a candidate platform for escape analysis related optimizations (see Escape analysis in Java). Escape analysis is implemented in Java Standard Edition 6. Some JVMs support a stronger variant of escape analysis called partial escape analysis that makes scalar replacement of an allocated object p
|
https://en.wikipedia.org/wiki/Area%20navigation
|
Area navigation (RNAV, usually pronounced as "ar-nav") is a method of instrument flight rules (IFR) navigation that allows an aircraft to choose any course within a network of navigation beacons, rather than navigate directly to and from the beacons. This can conserve flight distance, reduce congestion, and allow flights into airports without beacons. Area navigation used to be called "random navigation", hence the acronym RNAV.
RNAV can be defined as a method of navigation that permits aircraft operation on any desired course within the coverage of station-referenced navigation signals or within the limits of a self-contained system capability, or a combination of these.
In the United States, RNAV was developed in the 1960s, and the first such routes were published in the 1970s. In January 1983, the Federal Aviation Administration revoked all RNAV routes in the contiguous United States due to findings that aircraft were using inertial navigation systems rather than the ground-based beacons, and so cost–benefit analysis was not in favour of maintaining the RNAV routes system. RNAV was reintroduced after the large-scale introduction of satellite navigation.
Background
The continuing growth of aviation increases demands on airspace capacity, making area navigation desirable due to its improved operational efficiency.
RNAV systems evolved in a manner similar to conventional ground-based routes and procedures. A specific RNAV system was identified and its performance was evaluated through a combination of analysis and flight testing. For land-based operations, the initial systems used very high frequency omnidirectional radio range (VOR) and distance measuring equipment (DME) for estimating position; for oceanic operations, inertial navigation systems (INS) were employed. Airspace and obstacle clearance criteria were developed based on the performance of available equipment, and specifications for requirements were based on available capabilities. Such prescriptive requirements resulted in delays to the introduction of new RNAV system capabilities and higher costs for maintaining appropriate certification. To avoid such prescriptive specifications of requirements, an alternative method for defining equipment requirements has been introduced. This enables the specification of performance requirements, independent of available equipment capabilities, and is termed performance-based navigation (PBN). Thus, RNAV is now one of the navigation techniques of PBN; currently the only other is required navigation performance (RNP). RNP systems add on-board performance monitoring and alerting to the navigation capabilities of RNAV. As a result of decisions made in the industry in the 1990s, most modern systems are RNP.
Many RNAV systems, while offering very high accuracy and possessing many of the functions provided by RNP systems, are not able to provide assurance of their performance. Recognising this, and to avoid operators incurring unnecessary expense
|
https://en.wikipedia.org/wiki/Jon%20Bing
|
Jon Bing (30 April 1944 – 14 January 2014) was a Norwegian writer and law professor at the Norwegian Research Center for Computers and Law (NRCCL), and the Faculty of Law at the University of Oslo. Bing was considered a pioneer in international IT and information law. He held honorary doctorates from the University of Stockholm and the University of Copenhagen, and was a visiting professor at Kings College, University of London. Bing was part of The Protection of Privacy Committee. From 1979 to 1981 he was head of Norsk Filmråd. Between 1981 and 1982, he was the head of The Council of Europe Committee on Legal Data Processing. Between 1993 and 2000, he headed Norsk kulturråd.
Biography
Bing grew up in Trondheim, Norway. After graduating with a degree at Trondheim Cathedral School, Bing began studying at the University of Oslo. Bing was awarded his PhD in law in 1982. Together with Tor Åge Bringsværd and other students at the University of Oslo, Jon Bing started the Aniara society, a club for science fiction fans. He was often profiled in the media around the topic. He published several books, both fiction and non-fiction specialist literature. His first published work was the short story collection Around the sun in a circle (Rundt solen i ring) co-written with Bringsværd, and published in 1967. Bing was a prolific author, and he often collaborated with other authors. He was a member of the Norwegian Academy of Science and Letters.
Bing was engaged with many subjects, especially in the field of technology. He was featured on television on the anniversary of the first Personal Computer in Norway, for example. He was a much-loved public figure, often offering opinions on digital media, copyright, science fiction, etc. He was outspoken about cases concerning ethics in technology, copyright, and the future in general.
He published numerous books, both fiction and non-fiction. His style of writing was calm, and at times dreamy. He wrote about people who stand outside of ordinary society but attempt the impossible. In the short story Riestopher Josef from Around the Sun in a Circle he wrote about a boy who can't leave his house due to skin disease. The short story is about Riestopher who builds himself a spaceship and goes to the sun to capture a sunbeam.
His first drama was staged at Det Norske Teatret in 1971. In 1975 he received the Dammprisen and the Ministry of Culture's award for best youth book for Azur - Planet of the Captains (Azur – kapteinens planet) and in 1979 he received The International Board on Books for the Young People Award, and the Ministry of Culture's award for best translation of children's book. Bing and Bringsværd received the Rivertonprisen in 1979 for the television series Marco Polo ( Blindpassasjer) and the 1980 Ministry of Culture's award for best cartoon.
He died at the age of 69 in 2014.
Bibliography
Fiction
1967 – Around the sun in a circle (short stories, with Tor Åge Bringsværd)
1969 – Komplex (short storie
|
https://en.wikipedia.org/wiki/Virtual%20reality%20therapy
|
Virtual reality therapy (VRT), also known as virtual reality immersion therapy (VRIT), simulation for therapy (SFT), virtual reality exposure therapy (VRET), and computerized CBT (CCBT), is the use of virtual reality technology for psychological or occupational therapy and in affecting virtual rehabilitation. Patients receiving virtual reality therapy navigate through digitally created environments and complete specially designed tasks often tailored to treat a specific ailment; and is designed to isolate the user from their surrounding sensory inputs and give the illusion of immersion inside a computer-generated, interactive virtual environment. This technology has a demonstrated clinical benefit as an adjunctive analgesic during burn wound dressing and other painful medical procedures. Technology can range from a simple PC and keyboard setup, to a modern virtual reality headset. It is widely used as an alternative form of exposure therapy, in which patients interact with harmless virtual representations of traumatic stimuli in order to reduce fear responses. It has proven to be especially effective at treating PTSD, and shows considerable promise in treating a variety of neurological and physical conditions. Virtual reality therapy has also been used to help stroke patients regain muscle control, to treat other disorders such as body dysmorphia, and to improve social skills in those diagnosed with autism.
Description
Virtual reality therapy (VRT) uses specially programmed computers, visual immersion devices and artificially created environments to give the patient a simulated experience that can be used to diagnose and treat psychological conditions that cause difficulties for patients. In many environmental phobias, reaction to the perceived hazards, such as heights, speaking in public, flying, close spaces, are usually triggered by visual and auditory stimuli. In VR-based therapies, the virtual world is a means of providing artificial, controlled stimuli in the context of treatment, and with a therapist able to monitor the patient's reaction. Unlike traditional cognitive behavioral therapy, VR-based treatment may involve adjusting the virtual environment, such as for example adding controlled intensity smells or adding and adjusting vibrations, and allow the clinician to determine the triggers and triggering levels for each patient's reaction. VR-based therapy systems may allow replaying virtual scenes, with or without adjustment, to habituate the patient to such environments. Therapists who apply virtual reality exposure therapy, just as those who apply in-vivo exposure therapy, can take one of two approaches concerning the intensity of exposure. The first approach is called flooding, which refers to the most intense approach where stimuli that produce the most anxiety are presented first. For soldiers who have developed PTSD from combat, this could mean first exposing them to a virtual reality scene of their fellow troops being shot or
|
https://en.wikipedia.org/wiki/WFXV
|
WFXV (channel 33) is a television station in Utica, New York, United States, serving as the Fox affiliate for the Mohawk Valley. It is owned by Nexstar Media Group alongside low-power MyNetworkTV affiliate WPNY-LD (channel 11); Nexstar also provides certain services to ABC affiliate WUTR (channel 20) under joint sales and shared services agreements (JSA/SSA) with Mission Broadcasting. The stations share studios on Smith Hill Road in Deerfield (with a Utica mailing address), where WFXV's transmitter is also located.
History
A construction permit for a new television station on analog channel 33 in Utica was granted in 1982 and issued the call letters WTUV; construction began in the spring of 1983. The new station attempted to affiliate with CBS, but the network refused, citing that the new station would not attract new viewers, and that the area was sufficiently covered by Syracuse-based WTVH. A petition filed by WTUV's owner, Mohawk Valley Broadcasting, against both the network and WTVH was rejected by the Federal Communications Commission (FCC) in 1984. (Utica would not receive a local CBS affiliate until November 22, 2015, when rival NBC affiliate WKTV, channel 2, affiliated its second digital subchannel with the network.) WTUV finally signed-on October 12, 1986, as an affiliate of the then-new Fox network, and has been with Fox ever since. However, as with other Fox affiliates, WTUV considered itself an independent station until Fox began its prime-time schedule in April 1987. The station adopted the current call sign WFXV on February 1, 1990, in reference to the network. The call letters can also be interpreted as "Fox Utica", since the "V" looks like "U". Channel 33's studios were originally located on Greenfield Road in Rome.
At some point in time, translator station W11BS licensed to Little Falls became a sister station to WFXV and began to be housed at the Rome facility. In 1996, WFXV and what had become WUPN-LP were sold to Sullivan Broadcasting, which would itself be bought out by the Sinclair Broadcast Group only two years later. Instead of being acquired by that company, WFXV and the low-power station (by then WPNY-LP) were purchased by Quorum Broadcasting founded by former Sullivan head Dan Sullivan. The station was acquired by current owner Nexstar in 2003.
In December of that year, Mission Broadcasting, a company with connections to Nexstar, announced it would acquire ABC affiliate WUTR from Clear Channel Communications (now iHeartMedia). The deal was closed on April 1, 2004when local marketing and joint sales agreements were established between the two stations. Although the ABC affiliate was the junior partner, WFXV and WPNY-LP were consolidated into WUTR's studios in Deerfield.
This station aired The Bill Keeler Show (a local late-night comedy series) from April 1, 2003, to 2005 when the program moved to WKTV. Prior to the DTV transition, WFXV filed an application with the FCC to relocate its transmitter southwest of Utica t
|
https://en.wikipedia.org/wiki/Carol%3A%20A%20Day%20in%20a%20Girl%27s%20Life
|
Carol: A Day in a Girl's Life is the 6th album by Japanese rock band TM Network, released on December 9, 1988 under Epic Records.
Other media
Book
Carol is a novel written by Naoto Kine, one of a member of TM Network on 1989 April 15.
Anime
Carol is an anime OVA featuring character designs by Yun Kōga and Toshiki Yoshida, based on story by Naoto Kine. It was the biggest selling anime video of the year in Japan.
Plot
Carol was born in a family revolving around music, since she is the daughter of famous musician Lionel Mudagolas. She realizes that something unusual is happening to the world, as her father is having a harder time playing his cello and also her favorite band is unable to perform as they did before. She is teleported into a world connected to hers to fight a demon lord called Gigantica. Fighting alongside her are three heroes who have been awaiting Carol eagerly.
Cast
Japanese voice actor
Aya Hisakawa as Carol Mue Douglas
Takashi Utsunomiya as Flash
Nobuo Tobita as Tico Brani
Kaneto Shiozawa as Clark Maxwell
Show Hayami as Quepri
Hideyuki Tanaka as Ryman Mue Douglas
Mika Doi as Reet
Masaru Ikeda as Tios
Eiko Yamada as Domos
Tomoko Maruo as Alice
Kazue Ikura as Eddie
Masashi Hirose as U4
Sakiko Tamagawa as Fairy
Miki Itō as Therese
Michitaka Kobayashi as Rydah
Theme music
"Just One Victory"
Lyrics, Composition Arrangement: Tetsuya Komuro
Artist: TM Network
References
External links
1990 anime OVAs
Magic Bus (studio)
Yun Kōga
|
https://en.wikipedia.org/wiki/Data%20Protection%20API
|
Data Protection Application Programming Interface (DPAPI) is a simple cryptographic application programming interface available as a built-in component in Windows 2000 and later versions of Microsoft Windows operating systems. In theory, the Data Protection API can enable symmetric encryption of any kind of data; in practice, its primary use in the Windows operating system is to perform symmetric encryption of asymmetric private keys, using a user or system secret as a significant contribution of entropy. A detailed analysis of DPAPI inner-workings was published in 2011 by Bursztein et al.
For nearly all cryptosystems, one of the most difficult challenges is "key management" in part, how to securely store the decryption key. If the key is stored in plain text, then any user that can access the key can access the encrypted data. If the key is to be encrypted, another key is needed, and so on. DPAPI allows developers to encrypt keys using a symmetric key derived from the user's logon secrets, or in the case of system encryption, using the system's domain authentication secrets.
The DPAPI keys used for encrypting the user's RSA keys are stored under %APPDATA%\Microsoft\Protect\{SID} directory, where {SID} is the Security Identifier of that user. The DPAPI key is stored in the same file as the master key that protects the users private keys. It usually is 64 bytes of random data.
Security properties
DPAPI doesn't store any persistent data for itself; instead, it simply receives plaintext and returns ciphertext (or conversely).
DPAPI security relies upon the Windows operating system's ability to protect the master key and RSA private keys from compromise, which in most attack scenarios is most highly reliant on the security of the end user's credentials. A main encryption/decryption key is derived from user's password by PBKDF2 function. Particular data binary large objects can be encrypted in a way that salt is added and/or an external user-prompted password (aka "Strong Key Protection") is required. The use of a salt is a per-implementation option i.e. under the control of the application developer and is not controllable by the end user or system administrator.
Delegated access can be given to keys through the use of a COM+ object. This enables IIS web servers to use DPAPI.
Active Directory backup keys
When a computer is a member of a domain, DPAPI has a backup mechanism to allow data deprotection in case the user's password is lost, which is named "Credential Roaming".
When installing a new domain on a domain controller, a public and private key pair is generated, associated with DPAPI.
When a master key is generated on a client workstation, the client communicates through an authenticated RPC call with a domain controller to retrieve a copy of the domain's public key. The client encrypts the master key with the domain controller's public key. Finally, it stores this new backup master key in its AppData directory, just like traditional mas
|
https://en.wikipedia.org/wiki/Compiler%20%28manga%29
|
is a Japanese manga series written and illustrated by Kia Asamiya. It was originally serialized in Kodansha's magazine Monthly Afternoon.
The manga was adapted into a three-part anime original video animation that was licensed in the North America by ADV Films.
The opening theme is called "I Was Born to fall in Love" and the end theme is called "Full Up Mind", both by Masami Okui. As well as the soundtrack, a single of the opening theme and three image albums - Compiler, Assembler and Interpreter - were released.
Plot
Compiler (as in a source code compiler) features two girls, Compiler and Assembler, who arrived on earth from 2-D cyberspace to play a "game" in which they will delete the real world and reform it. However, they move in with two young men called Toshi and Nachi and lose interest in the game. After Toshi is injured and the game is cancelled, two beings called Plasma and Compiler 2 are sent in to erase the girls.
References
External links
1991 manga
1994 anime OVAs
1995 anime OVAs
ADV Films
Kia Asamiya
Kodansha manga
Seinen manga
Studio Fantasia
|
https://en.wikipedia.org/wiki/WPNY-LD
|
WPNY-LD (channel 11) is a low-power television station in Utica, New York, United States, affiliated with MyNetworkTV. It is owned by Nexstar Media Group alongside Fox affiliate WFXV (channel 33); Nexstar also provides certain services to ABC affiliate WUTR (channel 20) under joint sales and shared services agreements (JSA/SSA) with Mission Broadcasting. The stations share studios on Smith Hill Road in Deerfield (with a Utica mailing address), where WPNY-LD's transmitter is also located.
The station broadcast on VHF analog channel 11 until the FCC-mandated shutdown of analog LPTV stations on July 13, 2021. It was licensed for digital broadcasting on the same channel effective July 23, 2021, and began digital operations later that year on November 30. Due to WPNY-LD's very low-power signal, its broadcasting radius only covers the immediate Utica area. Therefore, it is simulcast on WUTR's second digital subchannel (20.2)—which transmits from a separate facility on Smith Hill Road, shared with WFXV—in order to reach the entire market.
History
The station signed on January 1, 1988, with the call sign W11BS licensed to Little Falls. It was a low-power translator and general entertainment independent outlet. The station joined UPN as a charter affiliate on January 16, 1995. On December 22 of that year, W11BS upgraded to low-power status and adopted the WUPN-LP calls. However, less than a year later, the station became WPNY-LP after a full power outlet in Greensboro, North Carolina, took the call letters.
At some point in time, WPNY became a sister outlet to WFXV and began to be housed at the latter's facility on Greenfield Road in Rome. In 1996, both stations were sold to Sullivan Broadcasting which would itself be bought out by the Sinclair Broadcast Group only two years later. Instead of being acquired by that company, WPNY and WFXV were purchased by Quorum Broadcasting founded by former Sullivan head Dan Sullivan.
The stations were acquired by current owner Nexstar in 2003. It was announced in December of that year that Clear Channel Communications would sell WUTR to Nexstar partner company Mission Broadcasting. The sale was approved by the Federal Communications Commission (FCC) on April 1, 2004, at which point Nexstar took over operations of WUTR under local marketing and joint sales agreements through the company's operational arrangement with Mission. Although the ABC affiliate was the subordinate entity, WPNY and WFXV were consolidated into WUTR's Deerfield studios.
In 2006, The WB and UPN merged into one network called The CW Television Network. Several weeks later, Fox announced the establishment of another network called MyNetworkTV, for the benefit of those UPN or WB affiliates that did not earn a CW affiliation. Since "WBU", the cable-only WB affiliate operated by NBC affiliate WKTV through The WB 100+, was the default choice to take the CW affiliation, WPNY-LP chose to associate with MyNetworkTV, and promptly did so on September 5, 2
|
https://en.wikipedia.org/wiki/FDB%20%28file%20format%29
|
Font Definition Block (abbreviation: FDB, filename extension .fdb) is a file format for computer fonts used by the Ming library.
An FDB file is a wrapper containing an SWF DefineFont2 block which describes a font.
Font formats
Adobe Flash
|
https://en.wikipedia.org/wiki/Laboratoire%20d%27informatique%20pour%20la%20m%C3%A9canique%20et%20les%20sciences%20de%20l%27ing%C3%A9nieur
|
The Computer Science Laboratory for Mechanics and Engineering Sciences (LIMSI) was a CNRS pluri-disciplinary science laboratory in Orsay, France.
LIMSI academics and scholars come primarily from the Engineering and Information Sciences fields, but also from Cognitive Science and Linguistics. LIMSI is associated with the Paris-Sud University. LIMSI also collaborates with other universities and engineering schools within the University Paris-Saclay.
History
LIMSI was created in 1972 under the leadership of Lucien Malavard, with an initial focus on numerical fluid mechanics, acoustics, and signal processing. Its research themes have progressively been expanded to Speech and Image Processing, then to a growing number of themes related to human-computer communication and interaction on the one hand; to thermics and energetics on the other hand.
In January 2021, LIMSI was merged with the Laboratory for Research in Computer Science (LRI) into the new Interdisciplinary Laboratory for Numerical Sciences.
Research themes
LIMSI research is organized in four main themes, spanning the activities of nine research groups:
Fluid Mechanics remains one of LIMSI's main research areas, with an expertise in the development of advanced numerical methodologies associated to experiments in academic configurations: the AERO and ETCM groups both contribute activities related to large-scale numerical simulations, to uncertainty quantification, to the characterization of fluid dynamics (instabilities, turbulence), to the control of flows, and to multiphysic couplings;
The Energetics and study of Mass and Heat Transfer theme carries out fundamental research aimed at a better understanding of transfer phenomena in convection and radiation, in multiphasic and oscillating conditions, and at extremely low temperatures. The ETCM and TSF groups also study the analysis of large thermic systems with application to housing and solar energy.
The Natural Language Processing applied to spoken, written, and signed language is another main research theme at LIMSI. Three groups, TLP, ILES and AA contribute to a wide spectrum of activities ranging from acoustic signal processing, automatic speech recognition and synthesis, to semantic modeling and fine-grained question answering. It also includes multimedia indexing, machine translation, the analysis and generation of emotions in speech and text, and information extraction;
The research in Human-Machine Interaction theme aims at a deeper understanding and modeling of interactions between humans and artificial systems in various contexts, and along various modalities. Four research teams are concerned: AMI focuses mostly on tangible, haptic, gestural and ambient interactions, whereas CPU is more focused on verbal and non-verbal interactions with virtual agents; interactions in virtual and augmented reality environments are studied primarily in the AMI, VENISE and AA research groups.
Many research groups share similar or related int
|
https://en.wikipedia.org/wiki/Georeferencing
|
Georeferencing or georegistration is a type of coordinate transformation that binds a digital raster image or vector database that represents a geographic space (usually a scanned map or aerial photograph) to a spatial reference system, thus locating the digital data in the real world. It is thus the geographic form of image registration. The term can refer to the mathematical formulas used to perform the transformation, the metadata stored alongside or within the image file to specify the transformation, or the process of manually or automatically aligning the image to the real world to create such metadata. The most common result is that the image can be visually and analytically integrated with other geographic data in geographic information systems and remote sensing software.
A number of mathematical methods are available, but the process typically involves identifying several sample ground control points with known locations on the image and the ground, then using curve fitting techniques to generate a parametric (or piecewise parametric) formula to transform the rest of the image. Once the parameters of the formula are stored, the image may be transformed dynamically at drawing time, or resampled to generate a georeferenced raster GIS file or orthophoto.
The term georeferencing has also been used to refer to other types of transformation from general expressions of geographic location (geocodes) to coordinate measurements, but most of these other methods are more commonly called geocoding. Because of this ambiguity, Georegistration is preferred by some to refer to the image transformation. Occasionally, this process has been called rubbersheeting, but that term is more commonly applied to a very similar process applied to vector GIS data.
Motivation
Georeferencing is crucial to make aerial and satellite imagery, usually raster images, useful for mapping as it explains how other data, such as the above GPS points, relate to the imagery.
Very essential information may be contained in data or images that were produced at a different point of time. It may be desired either to combine or compare this data with that currently available. The latter can be used to analyze the changes in the features under study over a period of time.
Different maps may use different projection systems. Georeferencing tools contain methods to combine and overlay these maps with minimum distortion.
Mathematics
The registration of an image to a geographic space is essentially the transformation from an input coordinate system (the inherent coordinates of pixels in the images based on row and column number) to an output coordinate system, a spatial reference system of the user's choice, such as the geographic coordinate system or a particular Universal Transverse Mercator zone. It is thus the extension of the typical task of curve fitting a relationship between two variables to four dimensions. The goal is to have a pair of functions of the form:
Such that for e
|
https://en.wikipedia.org/wiki/Solihten%20Institute
|
Solihten Institute (formerly known as The Samaritan Institute) is a non-profit organization based in Denver, Colorado which manages an international network of faith-based counseling centers (Member Centers) that specialize in evidence-based, integrated healing. Counselors and mental health professionals accredited by Solihten Institute receive theological training in addition to typical licensing in psychology, psychiatry and counseling, enabling an approach which combines "mind, body, spirit, and community." Services offered include outpatient counseling, wellness programs, and consultation and training for clergy and other professionals. This is a 12-step organization.
History
Founded in Elkhart, Indiana in 1972 by a physician, two parish ministers and a seminary professor as The Samaritan Institute, the philosophy sought to emphasize the unity of mind, body, spirit, and community in counseling through the collaboration of clergy, therapists and physicians. The program first formed as a part of First Presbyterian Church of Elkhart as part of the church's counseling center. Following the expansion of the Samaritan Institute name and model to other churches, in 1979, the Samaritan Institute was formed as a non-profit corporation seeking to unite and develop existing and future counseling centers. In anticipation of continued growth, in 1983, the Institute relocated its headquarters to Denver, Colorado, where it could better manage its nationwide network.
Today, Solihten Institute and its Member Centers are one of the largest national providers of faith-based counseling. Nearly fifty Solihten Member Centers exist in over 200 locations throughout the United States. Solihten Member Centers, which are the independently run affiliates of Solihten Institute, use facilities provided by sponsor churches — about 4,000 congregations of 26 denominations support the Solihten program. The model is cost-effective in practice and is capable of offering counseling at lower rates than many other programs. Annually, Solihten Member Centers donate more than $20,000,000 in subsidized counseling to individuals in need of assistance.
Solihten Institute is a 501(c)(3) organization, governed by a board of directors in consultation with a national council of Center executive directors. Bob Johnson currently serves as president.
The Solihten Institute Counseling Model
As a spiritually integrated (or faith-based) therapy program, counselors and professionals in the Solihten program represent various disciplines, including psychology, clinical social work, marriage and family therapy, pastoral counseling and psychiatry. In addition, counselors are trained in theology and are better able to address the religious perspectives of clients, incorporating them into the therapeutic process. Declaration of any particular religious belief is not a requirement for treatment, however, and counselors do not impose personal theological beliefs upon those being treated, but instead
|
https://en.wikipedia.org/wiki/MediaMan
|
MediaMan is a general purpose collection organizer software for establishing a personal database of media collections (DVDs, CDs, books, etc.) developed by He Shiming.
Debuted in 2004 as freeware, MediaMan is the first software in its genre to create the concept of general purpose organizer, as people usually have to pay two licenses for a book organizer and a video organizer.
The license of MediaMan was freeware until late 2006, when the author decided to switch to shareware with a price of $39.95 for each license.
Amazon Web Services (later called E-Commerce Service and Product Advertising API) was used to retrieve product information automatically during the import process in MediaMan, which means it is also a part of the Amazon Associates program. However, the latest version of MediaMan (v3.10 series) no longer uses this API due to the efficiency guidelines introduced in October 2010.
MediaMan is also known as a Windows alternative to Mac OS X's Delicious Library.
Software development seems to have stalled with the last release of a beta of MediaMan 4.0 back in December 2013. There have been a growing number of bugs in the software that has made the program unusable for some. Communications with the developer have stopped, development and bug fixes have ceased, and the site has gone offline.
Product history
See also
Delicious Library
References
External links
MediaMan
Neowin review
Softpedia review
Music By Mail Canada review
Windows multimedia software
Personal information manager software for Windows
Personal information managers
|
https://en.wikipedia.org/wiki/Service-orientation
|
Service-orientation is a design paradigm for computer software in the form of services. The principles of service-oriented design stress the separation of concerns in the software. Applying service-orientation results in units of software partitioned into discrete, autonomous, and network-accessible units, each designed to solve an individual concern. These units qualify as services.
History of service-orientation principles and tenets
Service-orientation has received a lot of attention since 2003 due to the benefits it promises. These include increased return on investment, organisational agility and interoperability as well as a better alignment between business and IT. It builds heavily on earlier design paradigms and enhances them with standardisation, loose coupling and business involvement. The paradigm lost momentum in 2009; since 2014, renewed interest can be observed under the Microservices moniker. In technology, different vendor SOA platforms have used different definitions of service-orientation. Some vendors promote different principles and tenets over others, but a fair amount of commonality exists.
Service-orientation inherits a small number of principles from earlier paradigms including object-oriented programming, component-based software engineering and open distributed processing. It is commonly acknowledged that several service-orientation principles have their roots in the object-oriented design paradigm: the two are complementary paradigms and there will always be a need for both. Services also inherit a number of features of software components, including
Multiple-use
Non-context-specific
Composable
Encapsulated i.e., non-investigable through its interfaces
A unit of independent deployment and versioning
Open Distributed Processing (ODP) combines the concepts of open systems and distributed computing, which are essential characteristics of service-orientation. The key features of ODP are all inherited by service-orientation, including federation, interoperability, heterogeneity, transparency and trading/broking.
Essential characteristics
Don Box was one of the first to provide a set of design guidelines referred to as his "four tenets of service-orientation", which he described primarily in relation to the Microsoft Indigo (subsequently Windows Communication Foundation) platform that was emerging at the time:
Boundaries are explicit
Services are autonomous
Services share schema and contract, not class
Service compatibility is based on policy
Other vendors and independent consultants have published their definitions of service-orientation and SOA, for instance, N. Josuttis in "SOA in Practice" and D: Krafzig et al. in "Enterprise SOA". An article in the December 2005 edition of the IBM System Journal entitled "Impact of service orientation at the business level" provided a study of how the service-orientation paradigm relates to fundamental componentization and the IBM Component Business Model (CBM).
Paul Allen
|
https://en.wikipedia.org/wiki/FreeOTFE
|
FreeOTFE is a discontinued open source computer program for on-the-fly disk encryption (OTFE). On Microsoft Windows, and Windows Mobile (using FreeOTFE4PDA), it can create a virtual drive within a file or partition, to which anything written is automatically encrypted before being stored on a computer's hard or USB drive. It is similar in function to other disk encryption programs including TrueCrypt and Microsoft's BitLocker.
The author, Sarah Dean, went absent as of 2011. The FreeOTFE website is unreachable as of June 2013 and the domain name is now registered by a domain squatter. The original program can be downloaded from a mirror at Sourceforge. In June 2014, a fork of the project now named LibreCrypt appeared on GitHub.
Overview
FreeOTFE was initially released by Sarah Dean in 2004, and was the first open source code disk encryption system that provided a modular architecture allowing 3rd parties to implement additional algorithms if needed. Older FreeOTFE licensing required that any modification to the program be placed in the public domain. This does not conform technically to section 3 of the Open Source definition. Newer program licensing omits this condition. The FreeOTFE license has not been approved by the Open Source Initiative and is not certified to be labeled with the open-source certification mark.
This software is compatible with Linux encrypted volumes (e.g. LUKS, cryptoloop, dm-crypt), allowing data encrypted under Linux to be read (and written) freely. It was the first open source transparent disk encryption system to support Windows Vista and PDAs.
Optional two-factor authentication using smart cards and/or hardware security modules (HSMs, also termed security tokens) was introduced in v4.0, using the PKCS#11 (Cryptoki) standard developed by RSA Laboratories.
FreeOTFE also allows any number of "hidden volumes" to be created, giving plausible deniability and deniable encryption, and also has the option of encrypting full partitions or disks (but not the system partition).
Portable use
FreeOTFE can be used in "portable" (or "traveller") mode, which allows it to be kept on a USB drive or other portable media, together with its encrypted data, and carried around. This allows it to be used under Microsoft Windows without installation of the complete program to "mount" and access the encrypted data through a virtual disk.
The use of this mode requires installing device drivers (at least temporarily) to create virtual disks, and as a consequence administrator rights are needed to start this traveller mode. As with most open source software that uses device drivers, the user must enable test signing when running Windows Vista x64 and Windows 7 x64 systems.
Driverless operation
Packaged with FreeOTFE is another program called "FreeOTFE Explorer", which provides a driverless system that allows encrypted disks to be used without administrator rights.
This allows FreeOTFE encrypted data to be used on (for example) public
|
https://en.wikipedia.org/wiki/HTTP%20compression
|
HTTP compression is a capability that can be built into web servers and web clients to improve transfer speed and bandwidth utilization.
HTTP data is compressed before it is sent from the server: compliant browsers will announce what methods are supported to the server before downloading the correct format; browsers that do not support compliant compression method will download uncompressed data. The most common compression schemes include gzip and Brotli; a full list of available schemes is maintained by the IANA.
There are two different ways compression can be done in HTTP. At a lower level, a Transfer-Encoding header field may indicate the payload of an HTTP message is compressed. At a higher level, a Content-Encoding header field may indicate that a resource being transferred, cached, or otherwise referenced is compressed. Compression using Content-Encoding is more widely supported than Transfer-Encoding, and some browsers do not advertise support for Transfer-Encoding compression to avoid triggering bugs in servers.
Compression scheme negotiation
The negotiation is done in two steps, described in RFC 2616 and RFC 9110:
1. The web client advertises which compression schemes it supports by including a list of tokens in the HTTP request. For Content-Encoding, the list is in a field called Accept-Encoding; for Transfer-Encoding, the field is called TE.
GET /encrypted-area HTTP/1.1
Host: www.example.com
Accept-Encoding: gzip, deflate
2. If the server supports one or more compression schemes, the outgoing data may be compressed by one or more methods supported by both parties. If this is the case, the server will add a Content-Encoding or Transfer-Encoding field in the HTTP response with the used schemes, separated by commas.
HTTP/1.1 200 OK
Date: mon, 26 June 2016 22:38:34 GMT
Server: Apache/1.3.3.7 (Unix) (Red-Hat/Linux)
Last-Modified: Wed, 08 Jan 2003 23:11:55 GMT
Accept-Ranges: bytes
Content-Length: 438
Connection: close
Content-Type: text/html; charset=UTF-8
Content-Encoding: gzip
The web server is by no means obligated to use any compression method – this depends on the internal settings of the web server and also may depend on the internal architecture of the website in question.
Content-Encoding tokens
The official list of tokens available to servers and client is maintained by IANA, and it includes:
br – Brotli, a compression algorithm specifically designed for HTTP content encoding, defined in and implemented in all modern major browsers.
compress – UNIX "compress" program method (historic; deprecated in most applications and replaced by gzip or deflate)
deflate – compression based on the deflate algorithm (described in ), a combination of the LZ77 algorithm and Huffman coding, wrapped inside the zlib data format ();
exi – W3C Efficient XML Interchange
gzip – GNU zip format (described in ). Uses the deflate algorithm for compression, but the data format and the checksum algorithm differ from the "deflate" content-encoding. Thi
|
https://en.wikipedia.org/wiki/PC%20Chip
|
PC Chip is a monthly Croatian computer magazine. It is one of three general computer magazines published in Croatia, along with its main competitors BUG and Vidi. The magazine is published by company A1 video d.o.o., which is also maintaining website pcchip.hr. The magazine has its headquarters in Zagreb and is also sold in Bosnia and Herzegovina, Slovenia, Serbia, but "digital sample" (pdf) is available to anybody with internet connection.
PC Chip has 194 pages and was redesigned in April 2008 (Issue 155). In November 2011, issue number 198 was published.
Article themes
First few pages in every issue is usually filled with columns and various IT news, previews, and press conference reports.
Hardver
As name suggests, this subsection covers reviews of various types of personal computer hardware. Anything that can be connected to computer is candidate for review in this section. New desktop computer parts, laptops, monitors, printers, peripherals, tablet computers, photo and video equipment, various gadgets, and other equipment that is available in Croatia are often reviewed in this subsection. Hardware editor is Slaven Pintarić.
Softver
Most PC Chip readers use Microsoft Windows operating system, so most software reviews in this subsection is aimed at Microsoft users. Linux and macOS users also get some attention, with focus on freeware and free software.
Helpdesk
This subsection is filled with various tutorials, how-to's, tips & tricks, and answers to reader's mails.
other
Few pages in every issue is usually occupied by various themes ranging anything from science fiction and computer history to business interviews, large press reports or off topic themes. 2 or 3 pages are reserved for games.
Moby
Former standalone magazine is now merged with PC Chip and usually, last 10 - 15 pages are reserved for this section. It covers new mobile phone and smartphone reviews, but also other equipment, mobile software, and known issues.
References
External links
Official website
1995 establishments in Croatia
Computer magazines published in Croatia
Croatian-language magazines
Magazines established in 1995
Mass media in Zagreb
Monthly magazines
|
https://en.wikipedia.org/wiki/Unknotting%20problem
|
In mathematics, the unknotting problem is the problem of algorithmically recognizing the unknot, given some representation of a knot, e.g., a knot diagram. There are several types of unknotting algorithms. A major unresolved challenge is to determine if the problem admits a polynomial time algorithm; that is, whether the problem lies in the complexity class P.
Computational complexity
First steps toward determining the computational complexity were undertaken in proving that the problem is
in larger complexity classes, which contain the class P. By using normal surfaces to describe the Seifert surfaces of a given knot, showed that the unknotting problem is in the complexity class NP. claimed the weaker result that unknotting is in AM ∩ co-AM; however, later they retracted this claim. In 2011, Greg Kuperberg proved that (assuming the generalized Riemann hypothesis) the unknotting problem is in co-NP, and in 2016, Marc Lackenby provided an unconditional proof of co-NP membership.
The unknotting problem has the same computational complexity as testing whether an embedding of an undirected graph in Euclidean space is linkless.
Unknotting algorithms
Several algorithms solving the unknotting problem are based on Haken's theory of normal surfaces:
Haken's algorithm uses the theory of normal surfaces to find a disk whose boundary is the knot. Haken originally used this algorithm to show that unknotting is decidable, but did not analyze its complexity in more detail.
Hass, Lagarias, and Pippenger showed that the set of all normal surfaces may be represented by the integer points in a polyhedral cone and that a surface witnessing the unknottedness of a curve (if it exists) can always be found on one of the extreme rays of this cone. Therefore, vertex enumeration methods can be used to list all of the extreme rays and test whether any of them corresponds to a bounding disk of the knot. Hass, Lagarias, and Pippenger used this method to show that the unknottedness is in NP; later researchers such as refined their analysis, showing that this algorithm can be useful (though not polynomial time), with its complexity being a low-order singly-exponential function of the number of crossings.
The algorithm of uses braid foliations, a somewhat different type of structure than a normal surface. However to analyze its behavior they return to normal surface theory.
Other approaches include:
The number of Reidemeister moves needed to change an unknot diagram to the standard unknot diagram is at most polynomial in the number of crossings. Therefore, a brute force search for all sequences of Reidemeister moves can detect unknottedness in exponential time.
Similarly, any two triangulations of the same knot complement may be connected by a sequence of Pachner moves of length at most doubly exponential in the number of crossings. Therefore, it is possible to determine whether a knot is the unknot by testing all sequences of Pachner moves of this length, starti
|
https://en.wikipedia.org/wiki/Constrained%20Shortest%20Path%20First
|
Constrained Shortest Path First (CSPF) is an extension of shortest path algorithms. The path computed using CSPF is a shortest path fulfilling a set of constraints. It simply means that it runs shortest path algorithm after pruning those links that violate a given set of constraints. A constraint could be minimum bandwidth required per link (also known as bandwidth guaranteed constraint), end-to-end delay, maximum number of links traversed, include/exclude nodes. CSPF is widely used in MPLS Traffic Engineering. The routing using CSPF is known as Constraint Based Routing (CBR).
The path computed using CSPF could be exactly same as that of computed from OSPF and IS-IS, or it could be completely different depending on the set of constraints to be met.
Example with bandwidth constraint
Consider the network to the right, where a route has to be computed from router-A to the router-C satisfying bandwidth constrained of x- units, and link cost for each link is based on hop-count (i.e., 1).
If x = 50 units then CSPF will give path A → B → C.
If x = 55 units then CSPF will give path A → D → E → C.
If x = 90 units then CSPF will give path A → D → E → F → C.
In all of these cases OSPF and IS-IS will result in path A → B → C.
However, if the link costs in this topology are different, CSPF may accordingly determine a different path. For example, suppose that as before, hop count is used as link cost for all links but A → B and B → C, for which the cost is 4. In this case:
If x = 50 units then CSPF will give path A → D → E → C.
If x = 55 units then CSPF will give path A → D → E → C.
If x = 90 units then CSPF will give path A → D → E → F → C.
References
MPLS networking
Network protocols
Internet protocols
Routing protocols
|
https://en.wikipedia.org/wiki/Caribe
|
Caribe may refer to:
Caribe (Venezuelan TV series), a Venezuelan telenovela
Caribe (American TV series), a 1975 television series produced by Quinn Martin
Caribe, or Cabir, a computer worm designed for mobile phones
Caribe (1987 film), a 1987 drama film by director Michael Kennedy
Caribe (2004 film), a 2004 Costa Rican film
The Caribe, or Kalina, an indigenous people of South America
The Caribe, or Island Caribs, an indigenous people of the Caribbean
The Carib language, the language of the Kalina people
A local term for piranhas, particularly in Venezuela
Another name for the Carib language
Caribé, an album by the Latin Jazz Quintet with Eric Dolphy
Costa Caribe, a Nicaraguan basketball team
See also
Carib (disambiguation)
Caribbean, a region of the Americas
|
https://en.wikipedia.org/wiki/Cabir
|
Cabir may refer to:
Cabeiri
Cabir (computer worm), an early Mobile virus
|
https://en.wikipedia.org/wiki/WSPX-TV
|
WSPX-TV (channel 56) is a television station in Syracuse, New York, United States, airing programming from the Ion Television network. Owned and operated by the Ion Media subsidiary of the E. W. Scripps Company, the station maintains studios on Basile Rowe in East Syracuse and a transmitter on Sevier Road in Pompey, New York.
History
WSPX-TV has been operating since November 24, 1998. From 2001 to 2005, WSPX re-aired newscasts from NBC affiliate WSTM-TV (channel 3).
Technical information
Subchannels
The station's digital signal is multiplexed:
WSPX-TV started broadcasting in high definition in May 2010.
The channel 15 frequency was short-spaced to Belleville, Ontario's CBLFT-13 and was approved on the condition that the effective radiated power of the U.S. station not exceed 100 kilowatts.
According to WSPX-TV, an early reduction in analogue power and start of digital operation needed to take place months in advance of the February 17, 2009, FCC digital transition deadline to ensure that channel 15's antenna could be installed on the top of the tower in place of the existing channel 56 antenna before the onset of winter. UHF 56 was then left operational from a secondary, side-mounted antenna at a 25% reduction in coverage area until analogue shut-off.
Analog-to-digital conversion
WSPX-TV shut down its analog signal, over UHF channel 56, on June 12, 2009, the official date on which full-power television stations in the United States transitioned from analog to digital broadcasts under federal mandate. The station's digital signal remained on its pre-transition UHF channel 15. Through the use of PSIP, digital television receivers display the station's virtual channel as its former UHF analog channel 56, which was among the high band UHF channels (52–69) that were removed from broadcasting use as a result of the transition.
References
External links
Ion Television affiliates
Court TV affiliates
Grit (TV network) affiliates
Ion Mystery affiliates
Defy TV affiliates
Scripps News affiliates
E. W. Scripps Company television stations
Television channels and stations established in 1998
1998 establishments in New York (state)
SPX-TV
|
https://en.wikipedia.org/wiki/William%20Osler%20Health%20System
|
William Osler Health System, formerly William Osler Health Centre, is a hospital network in Ontario, Canada that serves the city of Brampton and the northern portion of the western Toronto district of Etobicoke. The network is named for Canadian physician William Osler, one of the four founding professors of Johns Hopkins Hospital and developer of the concept of medical residency.
It has an annual operating budget of nearly $500 million CAD.
Hospitals and centres
The network consists of two hospitals and one ambulatory care centre:
Brampton Civic Hospital (established 2007) – a 608-bed hospital in northeast Brampton.
Etobicoke General Hospital (established 1972) – a 262-bed hospital located in Etobicoke, Toronto
Peel Memorial Centre for Integrated Health and Wellness (established 2017) - an ambulatory and urgent care centre in central Brampton
Former hospitals
Georgetown Hospital was previously part of the William Osler Health Centre, but in 2005 it was transferred to Halton Healthcare. Peel Memorial Hospital ceased operation in 2007 and was later superseded by the Peel Memorial Centre.
Executives
Ken White, former Trillium CEO, was appointed "Supervisor", which encompasses the role of both president and CEO as well as chairman of the board, by the Ministry of Health and Long-Term Care in 2007 "…to restore public confidence in the health centre". His term ended in April 2010 when Matthew Anderson became CEO.
Foundation
The William Osler Health System raises funds through the William Osler Health System Foundation. Donors to the foundation include AbbVie, Algoma University, Bell, CIBC, Mercedes-Benz, Omni Television, Pfizer, Prime Asia Television, and Toronto Metropolitan University.
In April 2022, the foundation received a $128,000 donation from Amazon to assist with recovery from the COVID-19 pandemic.
References
External links
Official website
Medical and health organizations based in Ontario
Hospital networks in Canada
William Osler
|
https://en.wikipedia.org/wiki/Concept%20virus
|
Concept virus refers to two different pieces of computer malware, each of which has acted as a proof of concept for a new method of propagation:
WM.Concept (1995), the first widely known macro virus to spread through Microsoft Word (though not the first macro virus per se)
Nimda (2001), named Concept Virus by its author, one of the first multi-vector Windows viruses.
|
https://en.wikipedia.org/wiki/ITV%20Weekend%20News
|
ITV Weekend News is the national news bulletins on the British television network ITV at a weekend.
However it is often referred to in programme guides as ITV News (morning), ITV Lunchtime News (lunchtime), ITV Evening News (evening) and ITV News (late-night) in line with the respective weekday bulletins. They are produced by ITV News/ITN.
History
On 8 March 1999, ITN News was renamed ITV Weekend News.
The four broadcasts which air morning, lunchtime, early evening and late-night feature British national and international news stories, as well as a round-up of the weekend's sports news. All bulletins, with the exception of the morning update, are followed by a national and regional ITV Weather forecast. The morning bulletin usually follows ITV's simulcast with CITV.
The ITV Weekend News is presented by a pool of on air staff from across the ITV News portfolio.
The ITV Weekend News presenter also fronts the impending ITV News London evening bulletin only on Saturdays.
On air staff
Present newscasters
Sameena Ali-Khan (2006, 2021–)
Yasmin Bodalbahi (2023–)
Paul Brand (2022–)
Andrea Byrne (2010–)
Gamal Fahnbulleh (2021–)
Duncan Golestani (2019–)
Jonathan Hill (2013–)
James Mates (2002–)
Lucrezia Millarini (2015–)
Rageh Omaar (2013–)
Chris Ship (2009–)
Geraint Vincent (2006–2012, 2021–)
Lucy Watson (2021–)
Romilly Weeks (2006–)
Former newscasters
Fiona Armstrong (1985–1992)
Pamela Armstrong (1982–1986)
Mark Austin (1986–2015)
Matt Barbet (2013–2014)
Carol Barnes (1975–1999)
Felicity Barr (2001–2005)
Reginald Bosanquet (1967–1978)
Alastair Burnet (1964–1991)
Sue Carpenter (1988–1992)
David Cass (1987–1988)
Andrea Catherwood (1999–2006)
Christopher Chataway (1955–1960)
Robin Day (1956–1969)
Katie Derham (1998–2010)
Julie Etchingham (2009–2015)
Anna Ford (1978–1980)
Sandy Gall (1980–1992)
Shiulie Ghosh (1998–2006)
Andrew Harvey (2000–2001)
Nina Hossain (2004–2015)
Natasha Kaplinsky (2011–2015)
Martyn Lewis (1980–1986)
Daisy McAndrew (2006–2011)
Trevor McDonald (1980–2003)
Lucy Meacock (2007–2009, 2011–2015)
Graham Miller (1993–2001)
Dermot Murnaghan (1991–2001)
Bill Neely (2002–2006)
Mary Nightingale (2001-2015)
Lucy Owen (2004–2007)
Nicholas Owen (1987–2006)
Leonard Parkin (1976–1987)
Kylie Pentelow (2014–2023)
Steve Scott (2005–2015)
Ranvir Singh (2014–2016)
Peter Sissons (1965–1982)
Jon Snow (1980–1987)
Julia Somerville (1984–1985)
Alastair Stewart (1981–1992, 2003–2020)
John Suchet (1980–2004)
Huw Thomas (1960–1964)
Owen Thomas (1993–2003)
Jeremy Thompson (1983–1988)
Denis Tuohy (1994–1999)
Mark Webster (2002–2004)
Charlene White (2014–2019)
Kirsty Young (2000–2001)
References
External links
1955 British television series debuts
1950s British television series
1960s British television series
1970s British television series
1980s British television series
1990s British television series
2000s British television series
2010s British television series
2020s British television series
British television news shows
English-language te
|
https://en.wikipedia.org/wiki/Digistar
|
Digistar is the first computer graphics-based planetarium projection and content system. It was designed by Evans & Sutherland and released in 1983. The technology originally focused on accurate and high quality display of stars, including for the first time showing stars from points of view other than Earth's surface, travelling through the stars, and accurately showing celestial bodies from different times in the past and future. Beginning with the Digistar 3 the system now projects full-dome video.
Projector
Unlike modern full-dome systems, which use LCD, DLP, SXRD, or laser projection technology, the Digistar projection system was designed for projecting bright pinpoints of light representing stars. This was accomplished using a calligraphic display, a form of vector graphics, rather than raster graphics. The heart of the Digistar projector is a large cathode-ray tube (CRT). A phosphor plate is mounted atop the tube, and light is then dispersed by a large lens with a 160 degree field of view to cover the planetarium dome. The original lens bore the inscription: "August 1979 mfg. by Lincoln Optical Corp., L.A., CA for Evans and Sutherland Computer Corp., SLC, UT, Digital planetarium CRT projection lens, 43mm, f2.8, 160 degree field of view".
The coordinates of the stars and wire-frame models to be displayed by the projector were stored in computer RAM in a display list. The display would read each set of coordinates in turn and drive the CRT's electron beam directly to those coordinates. If the electron beam was enabled while being moved a line would be painted on the phosphor plate. Otherwise, the electron beam would be enabled once at its destination and a star would be painted. Once all coordinates in the display list had been processed, the display would repeat from the top of the display list.
Thus, the shorter the display list the more frequently the electron beam would refresh the charge on a given point on the phosphor plate, making the projection of the points brighter. In this way, the stars projected by Digistar were substantially brighter than could be achieved using a raster display, which has to touch every point on the phosphor plate before repeating. Likewise, the calligraphic technology allowed Digistar to have a darker black-level than full-dome projectors, since the portions of the phosphor plate representing dark sky were never hit by the electron beam. As it is only one tube, with no pixelated color filter screen, the Digistar projector is monochromatic. The Digistar projects a bright, phosphorescent green, though many (including both visitors and planetarians) report they cannot distinguish between this green and white.
Additionally, unlike a raster display, the calligraphic display is not discretized into pixels, so the displayed stars were a more realistic single spot of light, without the blocky or ropy artifacts that are hard to avoid with raster graphics. Due to the use of vector graphics, as opposed to raster im
|
https://en.wikipedia.org/wiki/Stochastic%20diffusion%20search
|
Stochastic diffusion search (SDS) was first described in 1989 as a population-based, pattern-matching algorithm. It belongs to a family of swarm intelligence and naturally inspired search and optimisation algorithms which includes ant colony optimization, particle swarm optimization and genetic algorithms; as such SDS was the first Swarm Intelligence metaheuristic. Unlike stigmergetic communication employed in ant colony optimization, which is based on modification of the physical properties of a simulated environment, SDS uses a form of direct (one-to-one) communication between the agents similar to the tandem calling mechanism employed by one species of ants, Leptothorax acervorum.
In SDS agents perform cheap, partial evaluations of a hypothesis (a candidate solution to the search problem). They then share information about hypotheses (diffusion of information) through direct one-to-one communication. As a result of the diffusion mechanism, high-quality solutions can be identified from clusters of agents with the same hypothesis. The operation of SDS is most easily understood by means of a simple analogy – The Restaurant Game.
The restaurant game
A group of delegates attends a long conference in an unfamiliar town. Every night each delegate must find somewhere to dine. There is a large choice of restaurants, each of which offers a large variety of meals. The problem the group faces is to find the best restaurant, that is the restaurant where the maximum number of delegates would enjoy dining. Even a parallel exhaustive search through the restaurant and meal combinations would take too long to accomplish. To solve the problem delegates decide to employ a stochastic diffusion search.
Each delegate acts as an agent maintaining a hypothesis identifying the best restaurant in town. Each night each delegate tests his hypothesis by dining there and randomly selecting one of the meals on offer. The next morning at breakfast every delegate who did not enjoy his meal the previous night, asks one randomly selected colleague to share his dinner impressions.
If the experience was good, he also adopts this restaurant as his choice. Otherwise he simply selects another restaurant at random from those listed in `Yellow Pages'. Using this strategy it is found that very rapidly significant number of
delegates congregate around the 'best' restaurant in town.
Applications
SDS has been applied to diverse problems such as text search [Bishop, 1989], object recognition [Bishop, 1992], feature tracking [Grech-Cini, 1993], mobile robot self-localisation [Beattie, 1998] and site selection for wireless networks [Whitaker, 2002].
Analysis
Unlike many Nature Inspired Search techniques there is a comprehensive mathematical framework describing the behaviour of SDS. Analysis of SDS has investigated its global optimality and convergence [Nasuto, 1998], linear time complexity [Nasuto et al., 1999], robustness [Myatt, 2004], and resource allocation [Nasuto, 1999] under a v
|
https://en.wikipedia.org/wiki/J.%20Brendan%20Ryan
|
J. Brendan Ryan is the vice chairman of FCB Worldwide, a global advertising agency network.
Career
Ryan graduated from Regis High School in Manhattan and holds a B.A. in history from Fordham University and an M.B.A. from Wharton. He spent nearly a decade in product management at General Foods and then began a 14-year career at Ogilvy & Mather. He served in a variety of senior posts including head of the New York office and executive vice president, executive director of client services worldwide. He came to international prominence for his work as Ogilvy & Mather’s executive director for all global activities on the American Express and Kraft Foods accounts. Earlier, Ryan spent nearly a decade in product management at General Foods. He also served as vice president of marketing at Citibank.
Ryan joined Foote, Cone & Belding (FCB) 1991 as President and CEO of FCB New York. Under his leadership, FCB New York's billings doubled to surpass $1 billion. In 1996, he was promoted to Chairman and CEO of FCB Worldwide. In 2004, Steve Blamer assumed the responsibilities of CEO and Ryan continues in his role as FCB’s Chairman. In June 2006 FCB merged with Draft Direct Worldwide to form DraftFCB, where Ryan was named vice chairman.
External links
NY Sun - Draft FCB's Unique Style Lands Wal-Mart Account
Fast Company - How Brendan Ryan Got His Groove Back
Fordham University alumni
Living people
Year of birth missing (living people)
|
https://en.wikipedia.org/wiki/LView
|
LView Pro (LVP) is a bitmap graphics editor for computers running the Microsoft Windows operating system developed by Leonardo H. Loureiro, who owns the copyright to the software and the LView registered trademark. LView Pro is distributed by CoolMoon Corp.
Commercial history
The first version of LView software, 1.0, was released as freeware on the Internet in early 1993, and was the Windows based image viewer bundled with the pioneer web browser Mosaic.
In 1994, the first version of LView Pro was sold as a shareware product by MMedia Research. Retail versions of LView Pro, 2.0 and newer, were introduced in 1997. LView quickly gained popularity and was frequently ranked above Corel Paint Shop Pro, McAfee VirusScan, Netscape Communicator, Internet Explorer, Quake II, and others, on CNET's Download.com list of the most popular downloads in all categories.
In 2001, versions of LView Pro started being titled using the year of release, the current version - as of May 2006 - is labeled LView Pro 2006.
In June 2005, after a 12-year run with MMedia Research, distribution rights to LView Pro were transferred to CoolMoon Corp.
In October 2017, after a 12-year run with CoolMoon Corp, registration fees for the use of LView Pro 2006 were waived by the author of the software.
Version history
LView software started as a pioneer JPEG viewer, one of the first to be available for download on the Internet. Major versions 1.* (1.0 to 1.D2) offered limited image editing capabilities (crop, rotate, color adjustments, etc.) in addition to
common image viewing operations (zooming, slideshows, etc.).
Major versions 2.x (2.0 to 2.85) featured more extensive editing capabilities (brushes, selections, histograms, gradients, etc.) as well as new editors for Web Picture Galleries, Contact Sheets, and others. Versions from 2001 to the
current, support advanced image editing tools (layers, transparency, objects, etc.), similar to those found on commercial titles like Adobe Photoshop.
References
Notes
List of selected books referencing LView software
Raster graphics editors
1993 software
|
https://en.wikipedia.org/wiki/NTP%20pool
|
The NTP pool is a dynamic collection of networked computers that volunteer to provide highly accurate time via the Network Time Protocol to clients worldwide. The machines that are "in the pool" are part of the pool.ntp.org domain as well as of several subdomains divided by geographical zone and are distributed to NTP clients via round-robin DNS. Work is being done to make the geographic zone selection unnecessary via customized authoritative DNS servers that utilize geolocation software.
, the pool consists of 3,126 active servers on IPv4 and 1,534 active servers on IPv6. Because of the decentralization of this project, accurate statistics on the number of clients cannot be obtained, but according to the project's website, the pool provides time to 5–15 million systems. Because of client growth, the project is in perpetual need of more servers.
The more time servers there are in the pool, the lower the resource demand on each member. Joining the pool requires at least a broadband connection to the Internet, a static IP address, and accurate time from another source (for example, another NTP server, a DCF77 receiver, a WWVB receiver, or a GNSS receiver).
This project was started by Adrian von Bidder in January 2003 after a discussion on comp.protocols.time.ntp about abuse of the public stratum 1 servers. The system has been maintained and developed by Ask Bjørn Hansen since July 2005.
References
External links
Pool
Free software programmed in Perl
Perl software
|
https://en.wikipedia.org/wiki/Paul%20Buchheit
|
Paul T. Buchheit (born November 7, 1977) is an American computer engineer and entrepreneur who created the email service Gmail. He developed the original prototype of Google AdSense as part of his work on Gmail. He also suggested Google's former company motto Don't be evil in a 2000 meeting on company values, after the motto was initially coined in 1999 by engineer Amit Patel.
Early life and education
Buchheit was born on November 7, 1977, in Webster, New York. He attended the Case Western Reserve University in Cleveland, Ohio where he studied computer science and was part of the college's rowing crew.
Career
Buchheit worked at Intel and later became the 23rd employee at Google. At Google he began developing Gmail in 2001, with its innovations in search and storage. He also prompted what would become AdSense. Leaving Google in 2006, Buchheit started FriendFeed, which was launched in 2007 with partner Bret Taylor. FriendFeed was acquired by Facebook in 2009 in a private transaction that resulted in Buchheit being a Facebook employee.
In 2010, Buchheit left Facebook to become a partner at the investment firm Y Combinator. From 2006 (when he started investing) until 2008, Buchheit invested about $1.21 million in 32 different companies..
He continues to oversee angel investments of his own in "about 40" startups (by his own estimate) and is active with Y Combinator.
Buchheit won the 2011 The Economist innovation awards for the Computing and telecommunications field.
References
American computer programmers
American bloggers
Living people
Gmail
Facebook employees
Google employees
Case Western Reserve University alumni
People from Webster, New York
Intel people
Sun Microsystems people
Microsoft employees
Winners of The Economist innovation awards
Y Combinator people
1977 births
|
https://en.wikipedia.org/wiki/LVP
|
LVP may refer to:
Science, mathematics, and computing
Laser voltage prober, a tool for analysing integrated circuits
Left ventricular pressure, blood pressure in the heart
Large volume parenterals, a type of injectable pharmaceutical product
Lithium vanadium phosphate battery, a proposed type of lithium ion battery
Low voltage programming, see
LView Pro, a bitmap graphics editor for Microsoft Windows
Political parties
Liberal Vannin Party, a political party on the Isle of Man founded in 2006
Lithuanian Peasants Party (1990–2001), a former party
Latvian Unity Party (1992–2001), a former party
Other
LView, image editing software
Lakshmi Vilas Palace, Vadodara, Gujarat, India, a palace
An abbreviation for works by Dutch composer Leopold van der Pals
An abbreviation for actress and television personality Lisa Vanderpump
Limited Validity Passport, a type of Australian passport
Learner Variability Project, an education research translation initiative of Digital Promise that focuses on whole learner education practices
Luxury vinyl plank, vinyl composition tile with a wood-like appearance
|
https://en.wikipedia.org/wiki/Leading%20Edge%20Products
|
Leading Edge Products, Inc., was a computer manufacturer in the 1980s and the 1990s. It was based in Canton, Massachusetts.
History
Leading Edge was founded in 1980 by Thomas Shane and Michael Shane. At the outset, they were a PC peripherals company selling aftermarket products such as Elephant Memory Systems brand floppy disk media ("Elephant. Never forgets") and printer ribbons, and acting as the sole North American distributor/reseller of printers from the Japanese manufacturer C. Itoh, the most memorable being the popular low-end dot-matrix printer, "The Gorilla Banana". In 1984 the company sold the computer aftermarket product line and sales division to Dennison Computer Supplies, a division of Dennison Manufacturing. In 1984, they began to use Daewoo parts, and in 1989, they were acquired by Daewoo, as part of their recovery from Chapter 11 bankruptcy. (Shane declared that the costs of a legal dispute with Mitsubishi led to its bankruptcy). In January 1990, Daewoo hired Al Agbay, a veteran executive from Panasonic to lead the company out of Chapter 11 Bankruptcy. In the three years that followed, Agbay and his executive team repaid dealers approximately $16 million and increased annual revenues to over $250 million before a contract dispute severed Agbay and Daewoo's relationship. In October, 1995, Daewoo sold the company to Manuhold Investment AG, a Swiss electronics company. Leading Edge had sold 185,000 of its PC clones in the United States in 1994, but in 1995 sales fell from 90,000 in the first half to almost none in the second half. By 1997 the company was defunct.
Products
Hardware
The first known computer to be produced by Leading Edge is the Model M, released in 1982. By 1986 it sold for $1695 (US) with a monitor and two floppy drives. It used an Intel 8088-2 processor, running at a maximum of 7.16 MHz on an 8 bit bus, compared to 6 MHz for the IBM PC-AT on a 16 bit bus. The 'M' stands for Mitsubishi, their parts provider.
They began producing the Leading Edge Model D in June, 1985, when they began to use Daewoo parts. That model was described as "the quality is good and the price is right." It was a Consumer Reports "Best Buy." It was IBM compatible, using the same Intel 8088 16 bit processor as the IBM PC, with two floppy disc drives, 256K of RAM, and an amber monitor. The machine sold for $1495 (US). They sold 125,000 in the first 13 months, then reduced the price to $1295 (US).
When IBM started supplying 20 MB hard drives as standard for its newer PC-XT's, Leading Edge supplied a 30 meg hard drive standard. They later released a Model D86 (an Intel 8086), Model D2 in 1988 with a 65 MB hard drive for $2495(US) and a 10 MHz processor (an Intel 80286) and Model D3 (an Intel 80386).
In 1993, Leading Edge marketed the WinPro Series of computers. These computers had then an i486 or Intel 80486 processors. The low end model had an i486 SX25 processor—which lacked an FPU. The i486 DX33 Processor had the FPU in. The compute
|
https://en.wikipedia.org/wiki/Charles%20Faulkner%20%28author%29
|
Charles Faulkner (born January 12, 1952) is an American practitioner of neuro-linguistic programming (NLP), life coach, motivational speaker, trader and author. He has written several books and audio tapes on NLP, which is largely considered a pseudoscience
Biography
In 1981, Faulkner read a book about neuro-linguistic programming called The Structure of Magic I: A Book About Language and Therapy by Richard Bandler and John Grinder. The book's methodology described ways of affecting immediate and positive life changes by reprogramming speech, movement and thought patterns. As a result, Faulkner began NLP training. Faulkner began developing decision-making strategy models based on the thought-patterns and behaviors of successful people. He mapped strategies for physicians, international negotiators, and accelerated learners.
In 1990 after years of observing the decision-making strategies of traders such as Richard Dennis, Jim Rogers, Paul Tudor Jones and Tom Baldwin, Faulkner became a trader, himself. His first trade in 1992 was a failure, though he closed the year at a profit. Three years later, Jack D. Schwager included a profile of Faulkner in The New Market Wizards: Conversations with America's Top Traders.
In the late 1990s, Faulkner moved to England, where he felt the economy would be more stable. He, along with other NLP trainers, has modelled strategies for industries including rehabilitation, finance, medicine, sports, and bereavement. As of 2008, Faulkner is a resident of Kingston-Upon-Thames, UK, and works as Director of Programs for NLP Comprehensive.
Career
As of 2008, he was the author and co-author of 10 books (see Published works), one of which is NLP: The New Technology of Achievement, the number one selling NLP book on Amazon.com.
Neurolinguistic programming
Early NLP models
In 1985, Faulkner modelled the Metaphors of Identity. This model states that an individual's strategies and behavior patterns are informed by deeply structured metaphors for life, self, desired outcomes and challenges. By adopting new metaphors, an individual can create new pathways to transformation.
The academic research of cognitive linguists, George Lakoff and Mark Johnson and Faulkner's experience with Metaphors support his hypothesis that cognitive processes are mostly metaphoric, and unconscious. Therefore, conscious desires with functional qualities have parallel metaphors that sustain them. Twenty years later, Faulkner would write about this phenomenon in a two-part article entitled "Outcomes, Decisions & 'Levels' of Meaning." In the years that followed, Faulkner continued to develop additional models, such as Physician Decision Strategies in 1986, Futures Trading in 1987, and finally System Structure (a simultaneous strategies model) in 1990.
Modeler
In 2003, Faulkner co-wrote with Steve Andreas NLP: The New Technology of Achievement. In the book, they wrote, “Lengthy struggle without success is a sign that what we’re doing isn’t workin
|
https://en.wikipedia.org/wiki/NSA%20Suite%20A%20Cryptography
|
NSA Suite A Cryptography is NSA cryptography which "contains classified algorithms that will not be released." "Suite A will be used for the protection of some categories of especially sensitive information (a small percentage of the overall national security-related information assurance market)."
Incomplete list of Suite A algorithms:
ACCORDION
BATON
CDL 1
CDL 2
FFC
FIREFLY
JOSEKI
KEESEE
MAYFLY
MEDLEY
MERCATOR
SAVILLE
SHILLELAGH
WALBURN
WEASEL
See also
Commercial National Security Algorithm Suite
NSA Suite B Cryptography
References
General
NSA Suite B Cryptography / Cryptographic Interoperability
Cryptography standards
National Security Agency cryptography
Standards of the United States
|
https://en.wikipedia.org/wiki/Error%20bar
|
Error bars are graphical representations of the variability of data and used on graphs to indicate the error or uncertainty in a reported measurement. They give a general idea of how precise a measurement is, or conversely, how far from the reported value the true (error free) value might be. Error bars often represent one standard deviation of uncertainty, one standard error, or a particular confidence interval (e.g., a 95% interval). These quantities are not the same and so the measure selected should be stated explicitly in the graph or supporting text.
Error bars can be used to compare visually two quantities if various other conditions hold. This can determine whether differences are statistically significant. Error bars can also suggest goodness of fit of a given function, i.e., how well the function describes the data. Scientific papers in the experimental sciences are expected to include error bars on all graphs, though the practice differs somewhat between sciences, and each journal will have its own house style. It has also been shown that error bars can be used as a direct manipulation interface for controlling probabilistic algorithms for approximate computation. Error bars can also be expressed in a plus–minus sign (±), plus the upper limit of the error and minus the lower limit of the error.
A notorious misconception in elementary statistics is that error bars show whether a statistically significant difference exists, by checking simply for whether the error bars overlap; this is not the case.
See also
Box plot
Information graphics
Model selection
Significant figures
References
Statistical charts and diagrams
|
https://en.wikipedia.org/wiki/CD-i%20Ready
|
CD-i Ready is a compact disc format for mixing audio and data content on a CD. It was developed by Phillips in 1991, based on the CD-i format.
The CD-i Ready format uses a certain technique to get audio CD players to skim over the CD-i software and data. CD-i Ready places the software and data in the pregap of track 1 (index 0). Since most CD players assume that the pregap area contains only silence, they skip it. Because of this, CD-i Ready was presented as an alternative to CD-i (which stores data in the regular indexes of the first tracks of a disc), which was more compatible with audio CD players.
The term "enhanced CD" is sometimes used to refer to different CD formats that support a mix of audio and data content. Apart from CD-i Ready and CD-i, these formats include mixed mode CDs and the Enhanced Music CD format.
References
Compact disc
|
https://en.wikipedia.org/wiki/CMake
|
In software development, CMake is cross-platform free and open-source software for build automation, testing, packaging and installation of software by using a compiler-independent method. CMake is not a build system itself; it generates another system's build files. It supports directory hierarchies and applications that depend on multiple libraries. It is used in conjunction with native build environments such as Make, Qt Creator, Ninja, Android Studio, Apple's Xcode, and Microsoft Visual Studio. It has minimal dependencies, requiring only a C++ compiler on its own build system.
CMake is distributed as free and open-source software under a permissive BSD-3-Clause license.
History
CMake development began in 1999, in response to the need for a cross-platform build environment for the Insight Segmentation and Registration Toolkit (ITK). The project is funded by the United States National Library of Medicine as part of the Visible Human Project. It was partially inspired by , a predecessor to CMake, which was made by Ken Martin and other developers to support building of the Visualization Toolkit (VTK). pcmaker was a C program that converted Make files into MS Windows' NMake counterparts. At Kitware, Bill Hoffman blended components of pcmaker with his own ideas, striving to mimic the functionality of Unix configure scripts. CMake was first implemented in 2000 and further developed in 2001.
Historically CMake was conceived with the following major features in mind:
depending only on system C++ compiler, meaning no third-party libraries
to be able to generate VS Studio IDE input files
capable of producing executable and linkable binary libraries (static and shared)
to be able to run build-time code generators
separate source/build file trees
system checks and introspection (similar to Autotools): what system could and could not do
automatically scan C/C++ deps
cross-platform
Because of these constraints CMake didn't choose to use Tcl (popular at the time) scripting language as its default and instead, developers decided to create a simpler scripting language.
Continued development and improvements were fueled by the incorporation of CMake into developers’ own systems, including the VXL Project, the CABLE features added by Brad King, and GE Corporate R&D for support of DART. Additional features were created when VTK transitioned to CMake for its build environment and for supporting ParaView.
Version 3.0 was released in June 2014. It has been described as the beginning of "Modern CMake". Experts now advise to avoid variables in favor of targets and properties. The commands , , , that were at the core of CMake 2 should now be replaced by target-specific commands.
Features
Separate build tree
One of its major features is the ability to place compiler outputs (such as object files) into a build tree which is located outside of the source tree. This enables multiple builds from the same source tree and cross-compilation. Separate source
|
https://en.wikipedia.org/wiki/Initng
|
Initng is a full replacement of the UNIX System V init, the first process spawned by the kernel in Unix-like computer operating systems, which is responsible for the initialization of every other process. Initng's website calls initng "The next generation init system".
Purpose
Many implementations of init (including Sysvinit used in many Linux distributions) start processes in a pre-determined order, and only start a process once the previous process finishes its initialization.
Initng starts a process as soon as all of its dependencies are met. It can start several processes in parallel. Initng is designed to significantly increase the speed of booting a Unix-compatible system by starting processes asynchronously. Initng's supporters claim that it also gives the user more statistics and control over the system.
Development
Despite being still considered beta, it was chosen as the default init system for Pingwinek, Enlisy, Berry Linux and Bee.
Also there are packages for many distributions such as Ubuntu and Fedora, as well as ebuilds for Gentoo and spells for Source Mage.
Contrary to other similar projects, it features a portable and flexible code base, more suited for embedded usage, and has been already ported to other operating systems like Haiku and FreeBSD.
It was created by Jimmy Wennlund. The current maintainer and project lead is Ismael Luceno.
Awards
In Linux Formats Issue 72, in November 2005, InitNG received the Hottest Pick Award.
Process (computing)
|
https://en.wikipedia.org/wiki/Windows%20Live%20Favorites
|
Windows Live Favorites (codenamed Roaming Favorites) was a part of Microsoft's Windows Live range of services. It allowed users to access and edit their favorites from any computer. Users could import their bookmarks from Internet Explorer and MSN Explorer, add favorites by dragging and dropping, clicking the "Add Favorite" button on Windows Live Toolbar, or using the right-click menu. It also allowed users to find favorites more quickly using name, address, folders or tags. Windows Live Favorites allowed a total of 1000 favorites and folders per user account. Users were required to sign in with their Windows Live ID in order to use this service.
On April 14, 2009, Windows Live Favorites was integrated into Windows Live SkyDrive. All existing favorites were migrated to the "Favorites" and "Shared Favorites" folders on Windows Live SkyDrive.
Features
Windows Live Favorites had the following features:
Add and organize favorites for access anytime, anywhere
Import existing local favorites by clicking the "Import" option
There are a number of ways to add a favorite:
Click the Add option in the Add menu at the top of the page
Click on the "QuickAdd for Windows Live Favorites" Link to save it to the root directory of the user's favorites (available if a user has added the Favorites bookmarklet to their Links)
Right-click on a link in a web page and choose the "Add to Windows Live Favorites" option (available if a user has imported their Internet Explorer favorites)
In-Line Preview allows users to preview their favorite web pages from within Windows Live Favorites
Right-click enabled for any favorite to edit its properties
Browse by Tags allow users to see a list of their tags and browse by them
Real-time search allows users to start typing a search based on a favorite's name, folders, tags, and address and have their favorites filtered on the fly
Integration
Windows Live Toolbar
Windows Live Favorites was available as an add-on to Windows Live Toolbar. This client allowed users to synchronize their favorites between Internet Explorer and Windows Live Favorites. However, this functionality has been removed since Windows Live Toolbar Wave 3 was released. Favorites syncing has since been replaced by Windows Live SkyDrive and Windows Live Mesh.
Windows Live Spaces
Using the Windows Live Favorites module in Windows Live Spaces, users were able to share their favorites to the public. Viewers can use the built-in search box to quickly find the favorites the users have shared.
Windows Live Messenger
A "Favorites Star" tab was available in Windows Live Messenger for users to easily access their favorites within the program. It supported folders and real-time search, and allows users to manage their favorites directly from the program.
Live.com
The Live.com Favorites gadget allowed users to access all of their favorites directly from their personalized Live.com page. Using this gadget it is possible to:
Access favorites right from the Live.com personalize
|
https://en.wikipedia.org/wiki/Temporal%20Process%20Language
|
In theoretical computer science, Temporal Process Language (TPL) is a process calculus which extends Robin Milner's CCS with the notion of multi-party synchronization, which allows multiple process to synchronize on a global 'clock'. This clock measures time, though not concretely, but rather as an abstract signal which defines when the entire process can step onward.
Informal definition
TPL is a conservative extension of CCS, with the addition of a special action called σ representing the passage of time by a process - the ticking of an abstract clock. As in CCS, TPL features action prefix and it can be described as being patient, that is to say a process will idly accept the ticking of the clock, written as
Key to the use of abstract time is the timeout operator, which presents two processes, one to behave as if the clock ticks, one to behave as if it can't, i.e.
provided process E does not prevent the clock from ticking.
provided E can perform action a to become E'.
In TPL, there are two ways to prevent the clock from ticking. First is via the presence of the ω operator, for example in process the clock is prevented from ticking. It can be said that the action a is insistent, i.e. it insists on acting before the clock can tick again.
The second way in which ticking can be prevented is via the concept of maximal-progress, which states that silent actions (i.e. τ actions) always take precedence over and thus suppress σ actions. Thus is two parallel processes are capable of synchronizing at a given instant, it is not possible for the clock to tick.
Thus a simple way of viewing multi-party synchronization is that a group of composed processes will allow time to pass provided none of them prevent it, i.e. the system agrees that it is time to move on.
Formal definition
Syntax
Let a be a non-silent action name, α be any action name (including τ, the silent action) and X be a process label used for recursion.
References
Matthew Hennessy and Tim Regan : A Process Algebra for Timed Systems. Information and Computation, 1995.
Process calculi
|
https://en.wikipedia.org/wiki/Source%20data
|
Source data is raw data (sometimes called atomic data) that has not been processed for meaningful use to become Information.
Examples
Data entered at a till in a store
A list of information about customers used in a mail merge in Word Processing
Handwritten notes or printed documents, before they are typed in, such as an order form or CV
Research data such as air temperature measurements
Risks
Often when data is captured in one electronic system and then transferred to another, there is a loss of audit trail or the inherent data cannot be absolutely verified. There are systems that provide for absolute data export but then the system imported into has to allow for all available data fields to be imported. Similarly, there are transaction logs in many modern database systems. The acceptance of these transaction records into any new system could be very important for any verification of such imported data.
In research, gaining access to source data may be cumbersome. Particularly where sensitive personal data is involved, security and redaction (obscuring information) may be an issue.
See also
Computer Assisted Auditing Techniques
Cooked data
Information
Information technology audit process
Primary data and Secondary data
References
Digital media
Computer data
|
https://en.wikipedia.org/wiki/Innovations%20in%20Systems%20and%20Software%20Engineering
|
Innovations in Systems and Software Engineering: A NASA Journal is a peer-reviewed scientific journal of computer science covering systems and software engineering, including formal methods. It is published by Springer Science+Business Media on behalf of NASA. The editors-in-chief are Michael Hinchey (University of Limerick) and Shawn Bohner (Rose-Hulman Institute of Technology).
Abstracting and indexing
The journal is abstracted and indexed in:
References
External links
Academic journals established in 2005
Computer science journals
Systems engineering
Software engineering publications
Springer Science+Business Media academic journals
Formal methods publications
Quarterly journals
NASA mass media
Hybrid open access journals
|
https://en.wikipedia.org/wiki/Martin%20Brennan
|
Martin Brennan may refer to:
Martin Brennan (Irish politician) (1903–1967), Irish medical practitioner and Fianna Fáil politician, TD from 1938 to 1948
Martin Brennan (engineer), computer engineer who worked for Sinclair Research and Atari
Martin A. Brennan (1879–1941), U.S. Representative from Illinois
Martin Brennan (hurler) (born 1946), Irish retired sportsperson
Martin Stanislaus Brennan (1845–1927), American Roman Catholic priest and scientist
Martin Brennan (footballer) (born 1982), English footballer
|
https://en.wikipedia.org/wiki/Roger%20Gregory%20%28programmer%29
|
Roger Everett Gregory is a US computer programmer, technologist, and scientist. Gregory's work in project Xanadu made him one of the earliest pioneers of hypertext technology, which helped lay the foundations for the hyperlink technology that underlies the World Wide Web.
Gregory attended the University of Michigan as a mathematics major. In the 1970s, he founded the Ann Arbor Computer Club, similar to the West Coast's Home Brew Computer Club.
In 1974 Gregory met Theodore Holm (Ted) Nelson, the author of Computer Lib/Dream Machines, and the thinker who coined the term "hypertext".
The pair became friends. In 1979 Nelson convinced Gregory to move from Michigan and join him in Swarthmore, Pennsylvania, the small, sleepy college town outside of Philadelphia where Nelson earned his undergraduate degree, and first conceived the concept of a hypertext. Gregory's first summer in Swarthmore, characterized by Xanadu insiders as the "Swarthmore Summer", was a productive time, where Nelson and Gregory enjoyed the collaboration of other volunteers, including Stuart Greene and Mark S. Miller.
In 1988 Nelson, Gregory, and other members of their team, all moved to Sausalito, California, when Autodesk, a manufacturer of Computer aided design software, purchased a controlling interest in the Xanadu Project.
Later, as founder, CEO, CTO and Chairman of the Board of Xanadu Operating Company, Gregory led design and development of a hypertext technology that includes quotable documents with version control, fine-grained, bidirectional links, the ability to track intellectual property rights, and a mechanism to pay royalties. Gregory is also co-designer of a rotary rocket engine design based on the posthumous patents of Robert Goddard (U.S. patent 6212876 from 2001). Today he is a cofounder of Eyegorithm.
In 2010 Gregory was interviewed by the Internet Archive.
References
External links
Letter detailing information on project Xanadu: https://www.fourmilab.ch/autofile/www/chapter2_64.html
Roger Gregory Interview at Ted Nelson Book Launch
Udanax, the open-source release of the Xanadu code base for Squeak, a Smalltalk implementation
Roger's site documenting the rotary rocket engine
Year of birth missing (living people)
Living people
American computer programmers
University of Michigan College of Literature, Science, and the Arts alumni
|
https://en.wikipedia.org/wiki/OEO
|
OEO may refer to:
Office of Economic Opportunity
Optical-electrical-optical conversion of data, often with respect to an optical communications repeater
Opto-electronic oscillator, a type of photonic oscillator that relies upon a locked laser source
The Cambodian Orphan and Education Organization
The OE-O Modding team.
|
https://en.wikipedia.org/wiki/Share%20%28command%29
|
In computing, share is a command for DOS that allows software to perform file locks. Locking files became necessary when MS-DOS began allowing files to be accessed simultaneously by multiple programs, either through multitasking or networking.
Implementations
On MS-DOS, the command is available in versions 3 and later. The command is also available in FreeDOS, PTS-DOS, and SISNE plus. The FreeDOS version was developed by Ron Cemer and is licensed under the GPL. DR DOS 6.0 and Datalight ROM-DOS include an implementation of the command.
Windows XP and later versions include 16-bit commands (nonnative) for the MS-DOS subsystem that are included to maintain MS-DOS compatibility. The share MS-DOS subsystem command performs functions that are now inherent to Microsoft Windows. It is available to preserve compatibility with existing files, but has no effect at the command line because the functionality is automatic. The 16-bit MS-DOS subsystem commands are not available on 64-bit editions of Windows.
Design
There were five locking modes:
Deny None
Deny Read
Deny Write
Deny All
Compatibility (designed for backward compatibility with existing MS-DOS programs)
The program runs as a terminate-and-stay-resident program and is typically loaded at boot-up.
Syntax
share [/F:space] [/L:locks]
/F:space Allocates file space (in bytes) for file-sharing information.
/L:locks Sets the number of files that can be locked at one time.
See also
List of DOS commands
References
Further reading
External DOS commands
|
https://en.wikipedia.org/wiki/North%20and%20South%20%28miniseries%29
|
North and South is the title of three American television miniseries broadcast on the ABC network in 1985, 1986, and 1994. Set before, during, and immediately after the American Civil War, they are based on the 1980s trilogy of novels North and South by John Jakes. The 1985 first installment, North and South, remains the seventh-highest rated miniseries in TV history. North and South: Book II (1986) was met with similar success, while 1994's Heaven and Hell: North and South Book III was poorly received by both critics and audiences.
The saga tells the story of the enduring friendship between Orry Main of South Carolina (Patrick Swayze) and George Hazard of Pennsylvania (James Read), who become best friends while attending the United States Military Academy at West Point but later find themselves and their families on opposite sides of the war. The slave-owning Mains are rural planters from outside Charleston, South Carolina, while the Hazards, who reside in a small Pennsylvania mill town, profit from ownership of iron manufacturing and industry capital, their differences reflecting the divisions between North and South that eventually led to the Civil War.
Cast
The initial 1985 miniseries cast Patrick Swayze as Orry Main and James Read as George Hazard with Lesley-Anne Down as Orry's love interest Madeline and Wendy Kilbourne as George's future wife Constance. Kirstie Alley played George's outspoken abolitionist sister Virgilia, with Genie Francis as Orry's "good" sister Brett and Terri Garber as his selfish and wicked sister Ashton, as well as Philip Casnoff as Elkanah Bent, George and Orry's nemesis. All of these actors returned for the 1986 sequel, and the roles of George's brother Billy Hazard and sister-in-law Isabel Hazard were recast with Parker Stevenson and Mary Crosby.
North and South (1985) also featured many well-known actors as guest stars, including Elizabeth Taylor as bordello proprietor Madam Conti, David Carradine as the sadistic Justin LaMotte, Hal Holbrook as U.S. President Abraham Lincoln, Gene Kelly as Bent's father Senator Charles Edwards, Robert Mitchum as Colonel Patrick Flynn, M.D., Johnny Cash as abolitionist John Brown, Jean Simmons as Orry's mother Clarissa Main, Mitchell Ryan as Orry's father Tillet Main, John Anderson as George's father William Hazard, Jonathan Frakes as George's older brother Stanley Hazard, Inga Swenson as George's mother Maude Hazard, Robert Guillaume as abolitionist Frederick Douglass, Morgan Fairchild as Burdetta Halloran, David Ogden Stiers as Representative Sam Greene, and Olivia Cole as Madeline's devoted but doomed servant Maum Sally. John Jakes' wife Rachel also made an appearance in Episode 6 as Lincoln's wife Mary. North and South: Book II (1986) saw the return of Carradine as LaMotte, Holbrook as Lincoln, and Stiers as Greene, as well as new guests Lloyd Bridges as Confederate President Jefferson Davis, Anthony Zerbe as Ulysses S. Grant, Nancy Marchand as Dorothea Dix, James Ste
|
https://en.wikipedia.org/wiki/Annotea
|
In metadata, Annotea was designed as an RDF standard sponsored by the W3C to enhance document-based collaboration via shared document metadata based on tags, bookmarks, and other annotations.
In this case document metadata includes:
Keywords
Comments
Notes
Explanations
Errors
Corrections
In general, Annotea associates text strings to a web document or selected parts of a web document without actually needing to modify the original document.
Users that access any web documents can also load the metadata associated with it from a selected annotation server (or groups of servers) and see a peer group's comments on the document. Similarly shared metadata tags can be attached to web documents to help in future retrieval.
Annotea is an extensible standard and is designed to work with other W3C standards when possible. For instance, Annotea uses an RDF Schema for describing annotations as metadata and XPointer for locating the annotations in the annotated document. Similarly a bookmark schema describes the bookmark and topic metadata.
Annotea is part of the W3C Semantic Web efforts.
An example implementation of Annotea is W3C's Amaya editor/browser. The current Amaya user interface for annotations is presented in the Amaya documentation. Other projects consists of Plugins for Firefox/Mozilla or Annotatio Client which interacts with most browsers per JavaScript.
Active development of Annotea seems to have been discontinued after 2003, as a W3C standard for annotation of documents on the webs, it is superseded by Web Annotation.
See also
Web annotation
Metadata
Folksonomy
World Wide Web
References
External links
W3C Annotea web site
Annotea.org web site
Annotatio - Java implementation of Server and Client
Annozilla - Plugin for Firefox/Mozilla
Metadata
|
https://en.wikipedia.org/wiki/Offline%20reader
|
An offline reader (sometimes called an offline browser or offline navigator) is computer software that downloads e-mail, newsgroup posts or web pages, making them available when the computer is offline: not connected to a server. Offline readers are useful for portable computers and dial-up access.
Variations
Website-mirroring software
Website mirroring software is software that allows for the download of a copy of an entire website to the local hard disk for offline browsing. In effect, the downloaded copy serves as a mirror of the original site. Web crawler software such as Wget can be used to generate a site mirror.
Offline mail and news readers
Offline mail readers are computer programs that allow users to read electronic mail or other messages (for example, those on bulletin board systems) with a minimum of connection time to the server storing the messages. BBS servers accomplished this by packaging up multiple messages into a compressed file, e.g., a QWK packet, for the user to download using, e.g., Xmodem, Ymodem, Zmodem, and then disconnect. The user reads and replies to the messages locally and packages up and uploads any replies or new messages back to the server upon the next connection. Internet mail servers using POP3 or IMAP4 send the messages uncompressed as part of the protocol, and outbound messages using SMTP are also uncompressed. Offline news readers using NNTP are similar, but the messages are organized into news groups.
Most e-mail protocols, like the common POP3 and IMAP4 used for internet mail, need be on-line only during message transfer; the same applies to the NNTP protocol used by Usenet (Network news). Most end-user mailers, such as Outlook Express and AOL, can be used offline even if they are mainly intended to be used online, but some mailers such as Juno are mainly intended to be used offline.
Off-line mail readers are generally considered to be those systems that did not originally offer such functionality, notably on bulletin board systems where toll charges and tying up telephone lines were a major concern. Users of large networks such as FidoNet regularly used offline mail readers, and it was also used for UseNet messages on the internet, which is also an on-line system. The two most common formats for FidoNet BBS's were Blue Wave and QWK. Less well-known examples include Silver Xpress's OPX, XRS, OMEM, SOUP and ZipMail.
List
See also
Online and offline
Cache manifest in HTML5 (deprecated in favor of service workers)
Progressive web application
Kiwix, Wikipedia offline reader
WebWhacker
Comparison of software saving Web pages for offline use
Notes
References
Email
Web applications
|
https://en.wikipedia.org/wiki/Computer%20port%20%28hardware%29
|
In computer hardware, a port serves as an interface between the computer and other computers or peripheral devices. In computer terms, a port generally refers to the part of a computing device available for connection to peripherals such as input and output devices. Computer ports have many uses, to connect a monitor, webcam, speakers, or other peripheral devices. On the physical layer, a computer port is a specialized outlet on a piece of equipment to which a plug or cable connects. Electronically, the several conductors where the port and cable contacts connect, provide a method to transfer signals between devices.
Bent pins are easier to replace on a cable than on a connector attached to a computer, so it was common to use connectors for the fixed side of an interface.
Computer ports in common use cover a wide variety of shapes such as round (PS/2, etc.), rectangular (FireWire, etc.), square (Telephone plug), trapezoidal (D-Sub — the old printer port was a DB-25), etc. There is some standardization to physical properties and function. For instance, most computers have a keyboard port (currently a Universal Serial Bus USB-like outlet referred to as USB Port), into which the keyboard is connected.
Physically identical connectors may be used for widely different standards, especially on older personal computer systems, or systems not generally designed according to the current Microsoft Windows compatibility guides. For example, a 9-pin D-subminiature connector on the original IBM PC could have been used for monochrome video, color analog video (in two incompatible standards), a joystick interface, or a MIDI musical instrument digital control interface. The original IBM PC also had two identical 5 pin DIN connectors, one used for the keyboard, the second for a cassette recorder interface; the two were not interchangeable. The smaller mini-DIN connector has been variously used for the keyboard and two different kinds of mouse; older Macintosh family computers used the mini-DIN for a serial port or for a keyboard connector with different standards than the IBM-descended systems.
Electrical signal transfer
Electronically, hardware ports can almost always be divided into two groups based on the signal transfer:
Analog ports
Digital ports:
Parallel ports send multiple bits at the same time over several sets of wires.
Serial ports send and receive one bit at a time via a single wire pair (Ground and +/-).
After ports are connected, they typically require handshaking, where transfer type, transfer rate, and other necessary information is shared before data is sent.
Hot-swappable ports can be connected while equipment is running. Almost all ports on personal computers are hot-swappable.
Plug-and-play ports are designed so that the connected devices automatically start handshaking as soon as the hot-swapping is done. USB ports and FireWire ports are plug-and-play.
Auto-detect or auto-detection ports are usually plug-and-play, but they offe
|
https://en.wikipedia.org/wiki/Port%20%28computer%20networking%29
|
In computer networking, a port or port number is a number assigned to uniquely identify a connection endpoint and to direct data to a specific service. At the software level, within an operating system, a port is a logical construct that identifies a specific process or a type of network service. A port at the software level is identified for each transport protocol and address combination by the port number assigned to it. The most common transport protocols that use port numbers are the Transmission Control Protocol (TCP) and the User Datagram Protocol (UDP); those port numbers are 16-bit unsigned numbers.
A port number is always associated with a network address of a host, such as an IP address, and the type of transport protocol used for communication. It completes the destination or origination address of a message. Specific port numbers are reserved to identify specific services so that an arriving packet can be easily forwarded to a running application. For this purpose, port numbers lower than 1024 identify the historically most commonly used services and are called the well-known port numbers. Higher-numbered ports are available for general use by applications and are known as ephemeral ports.
Ports provide a multiplexing service for multiple services or multiple communication sessions at one network address. In the client–server model of application architecture, multiple simultaneous communication sessions may be initiated for the same service.
Port number
For TCP and UDP, a port number is a 16-bit unsigned integer, thus ranging from 0 to 65535. For TCP, port number 0 is reserved and cannot be used, while for UDP, the source port is optional and a value of zero means no port. A process associates its input or output channels via an internet socket, which is a type of file descriptor, associated with a transport protocol, a network address such as an IP address, and a port number. This is known as binding. A socket is used by a process to send and receive data via the network. The operating system's networking software has the task of transmitting outgoing data from all application ports onto the network, and forwarding arriving network packets to processes by matching the packet's IP address and port number to a socket. For TCP, only one process may bind to a specific IP address and port combination. Common application failures, sometimes called port conflicts, occur when multiple programs attempt to use the same port number on the same IP address with the same protocol.
Applications implementing common services often use specifically reserved well-known port numbers for receiving service requests from clients. This process is known as listening, and involves the receipt of a request on the well-known port potentially establishing a one-to-one server-client dialog, using this listening port. Other clients may simultaneously connect to the same listening port; this works because a TCP connection is identified by a tuple consisting o
|
https://en.wikipedia.org/wiki/Ethernet%20over%20SDH
|
Ethernet Over SDH (EoS or EoSDH) or Ethernet over SONET refers to a set of protocols which allow Ethernet traffic to be carried over synchronous digital hierarchy networks in an efficient and flexible way. The same functions are available using SONET.
Ethernet frames which are to be sent on the SDH link are sent through an "encapsulation" block (typically Generic Framing Procedure or GFP) to create a synchronous stream of data from the asynchronous Ethernet packets. The synchronous stream of encapsulated data is then passed through a mapping block which typically uses virtual concatenation (VCAT) to route the stream of bits over one or more SDH paths. As this is byte interleaved, it provides a better level of security compared to other mechanisms for Ethernet transport.
After traversing SDH paths, the traffic is processed in the reverse fashion: virtual concatenation path processing to recreate the original synchronous byte stream, followed by decapsulation to converting the synchronous data stream to an asynchronous stream of Ethernet frames.
The SDH paths may be VC-4, VC-3, VC-12 or VC-11 paths. Up to 64 VC-11 or VC-12 paths can be concatenated together to form a single larger virtually concatenated group. Up to 256 VC-3 or VC-4 paths can be concatenated together to form a single larger virtually concatenated group. The paths within a group are referred to as "members". A virtually concatenated group is typically referred to by the notation -v, where is VC-4, VC-3, VC-12 or VC-11 and X is the number of members in the group.
A 10-Mbit/s Ethernet link is often transported over a VC-12-5v which allows the full bandwidth to be carried for all packet sizes.
A 100-Mbit/s Ethernet link is often transported over a VC-3-2v which allows the full bandwidth to be carried when smaller packets are used (< 250 bytes) and Ethernet flow control restricts the rate of traffic for larger packets. But does only give ca. 97Mbit/s, not full 100Mb.
A 1000-Mbit/s (or 1 GigE) Ethernet link is often transported over a VC-3-21v or a VC-4-7v which allows the full bandwidth to be carried for all packets.
EoS also drops the "idle" packets of the Ethernet frame before encapsulating the Ethernet frame to GFP, which is recreated at the other end during decapsulation process. Hence this provide a better throughput compared to native Ethernet transport.
An additional protocol, called link capacity adjustment scheme (LCAS), allows the two endpoints of the SDH paths to negotiate which paths are working and can carry traffic versus which paths should not be used to carry traffic.
See also
Packet over SONET
SDH
Synchronous optical networking
Network protocols
|
https://en.wikipedia.org/wiki/State%20of%20the%20Climate
|
The State of the Climate is an annual report that is primarily led by the National Oceanic and Atmospheric Administration National Climatic Data Center (NOAA/NCDC), located in Asheville, North Carolina, but whose leadership and authorship spans roughly 100 institutions in about 50 countries.
Release
The report appears as a supplement to a summer issue of the Bulletin of the American Meteorological Society (BAMS), a publication of the American Meteorological Society. The State of the Climate report, known until 2001 as the Climate Assessment, is an international effort.
State of the Climate in 2010
The 2010 edition (released June 28, 2011) contained submissions from 368 authors from 45 nations and covered 41 climate indicators. The 2010 edition contained a highlights document that summarized the major findings of the report. The State of the Climate summarizes the global and regional climate of the preceding calendar year and places it into a historical context. In addition, notable climatic anomalies and events are discussed.
Major findings in the 2010 report were:
2010 was one of the two warmest years of the instrumental temperature record
The El Niño-Southern Oscillation transitioned from El Niño to La Niña
Changes in the Arctic and Greenland continued to outpace those across the rest of the planet, on average
The 2010 issue included a sidebar detailing the multiple lines of evidence (major variables besides global temperature) consistent with the conclusion of a warming planet. An image associated with this sidebar has been recreated many times since, as the 11 (or ten) indicators of a warming planet.
State of the Climate in 2011
The 2011 edition contained submissions from 376 authors from 46 nations/territories. The La Nina event of that year was a major focus of the report. The cover featured East African women walking to retrieve water in a dust storm. East African drought is not atypical of La Nina episodes.
State of the Climate in 2012
The 2012 edition contained submissions from 394 authors from 54 nations/territories. Its cover featured an Arctic scene, reflecting major events in that region during the year.
Major findings in the 2012 report were:
Average global sea level reached a record high (at the time) in 2012.
Arctic sea ice reached a record-small minimum annual value during September 2012.
State of the Climate in 2013
The 2013 edition has been released on July 17, 2014. The American Meteorological Society published a supplemental paper online. The report was compiled by 425 scientists from 57 countries.
Major findings in the 2013 report include:
The climate is changing faster than at any other point in recorded history.
State of the Climate in 2014
A report was released for the year of 2014.
State of the Climate in 2015
A report was released in August 2016 for 2015.
2015 was the hottest year to date. Greenhouse gases were highest on record. Global upper ocean heat content was highest on record. Global sea
|
https://en.wikipedia.org/wiki/Bailando%20por%20un%20Sue%C3%B1o%20%28Mexican%20TV%20series%29
|
Bailando por un Sueño ("Dancing for a dream") is a reality series on the Mexican television network Canal de las Estrellas, in which many famous Latin American actors and actresses and celebrities are partnered with common, everyday people who have a dream they want to fulfill with the help of this program. Each week, the pairs of contestants compete against each other to impress a panel of judges. After each show, the two couples who receive the lowest scores compete against each other to avoid being eliminated from the competition. Through a telephone poll, viewers can also contribute to the success of the dancers. The votes of the viewers are combined with the panel's scores to decide on the ranking of the dancers. The process continues until there are only two couples standing. Rather than the promise of a large cash prize, the winner gets a previously stated wish granted. The show is also broadcast in the US on Univision.
On Air
Hosts
Adal Ramones Bailando Por Un Sueño(1-2); Show de Los Sueños (1-2)
Liza Echeverría Bailando Por Un Sueño(1-2)
Alessandra Rosaldo Bailando Por la Boda de Mis Suenos
Monica Sanchez Bailando Por la boda de mis suenos (first 4 weeks)
Marco Antonio Regil Bailando Por la Boda de Mis Suenos
Paty Manterola Show de los Suenos
Dance Judges
Edith González (1-3)
Roberto Mitzuko(1-3,5)
Emma Pulido (All)
Felix Greco (1-3,5)
Bibi Gaytán (4-5)
Singing Judges (El Show de Los Sueños)
Fato All
Amanda Miguel All
Lupita D'Lessio (4)
Kiko Campos All
Contestants
Season 1
Latin Lover, actor/luchador (partnered with Mariana Vallejo) - Winners
Adrián Uribe, actor/comedian (partnered with Bethzy Zamorano) - Runners-up
Ana Layevska, actress (partnered with Juan Muñiz) - Eliminated - Eliminated 6th (Day 49)
Patricia Navidad, actress/singer (partnered with Víctor Rivera) - Eliminated 5th (Day 42)
Carlos Bonavides, actor/comedian (partnered with Athalía Giménez) - Eliminated 4th (Day 35)
Cynthia Klitbo, actress (partnered with Fernando Rodríguez) - Eliminated 3rd (Day 28)
María Rojo, actress/politician (partnered with Carlos Pastrana) - Eliminated 2nd (Day 21)
René Casados, actor (partnered with Indira Domínguez) - Eliminated 1st ( Day 13)
Contestants Cycle 2
Season 2
Alessandra Rosaldo, actress/singer (partnered with Israel Aquino) - Winners
Imanol Landeta, actor/singer (partnered with Cinthya Díaz) - Runners-up
Adriana Fonseca, actress (partnered with Luis Colorado) - Eliminated 8th (Day 63))
Galilea Montijo, actress/TV hostess (partnered with Miguel Ángel Monfort) - Eliminated 7th (Day 56)
Gabriel Soto, actor/model (partnered with Pamela Marrun) - Eliminated 6th (Day 49)
Sylvia Pasquel, actress (partnered with Óscar Ramírez) - Eliminated 5th (Day 42)
Pilar Montenegro, actress/singer (partnered with Alfredo Ramírez) - Eliminated 4th (Day 35)
Enrique "Perro" Bermudez, sports commentator (partnered with Yesenia Hernández) - Eliminated 3rd (Day 28)
Jorge "Travieso" Arce, boxer (partnered with Verónica Carrillo) -
|
https://en.wikipedia.org/wiki/Demography%20of%20London
|
The demography of London is analysed by the Office for National Statistics and data is produced for each of the Greater London wards, the City of London and the 32 London boroughs, the Inner London and Outer London statistical sub-regions, each of the Parliamentary constituencies in London, and for all of Greater London as a whole. Additionally, data is produced for the Greater London Urban Area. Statistical information is produced about the size and geographical breakdown of the population, the number of people entering and leaving country and the number of people in each demographic subgroup. The total population of London as of 2021 is 8,799,800.
History
Creation of Greater London - 1965
Through the London Government Act of 1963, the Greater London region was established officially in 1965.
Migration boom - 1997 to today
From 1997 onwards, London has experienced a drastic change in the composition of the city's population, which has off set the decline of the population which had been occurring. In 1991, 21.7% of the city was foreign born but by 2011 this had risen to 36.7%.
In 2011, a historic tipping point occurred with the release of the 2011 census indicating that the White British population, which had before been the majority, was now no longer a majority of the city's population, although it remained by far the largest single ethnic group.
Population
The historical population for the current area of Greater London, divided into the statistical areas of Inner and Outer London is as follows:
Age
Fertility
In 2021, a total of 110,961 live births occurred within the city. The fertility rate of London in 2021 was 1.52, which is below replacement.
Population density
The population density of London was 5,727 per km2 in 2011.
Urban and metropolitan area
At the 2001 census, the population of the Greater London Urban Area was 8,278,251. This area does not include some outliers within Greater London, but does extend into the adjacent South East England and East of England regions. In 2004 the London Plan of the Mayor of London defined a metropolitan region with a population of 18 million. Eurostat has developed a harmonising standard for comparing metropolitan areas in the European Union and the population of the London Larger Urban Zone is 11,917,000; it occupies an area of . Another definition gives the population of the metropolitan area as 13,709,000.
Ethnicity
For the overwhelming majority of London's history, the population of the city was ethnically homogenous with the population being of White British ethnic origin, with small clusters of minority groups such as Jewish people, most notably in areas of the East End. From 1948 onwards and especially since the Blair government in the late 1990s and 2000s, the population has diversified in international terms at an increased rate. In 2011, it was reported for the first time that White British people had become a minority within the city, establishing it was a majority-minor
|
https://en.wikipedia.org/wiki/Personal%20wiki
|
A personal wiki is wiki software that allows individual users to organize information on their desktop or mobile computing devices in a manner similar to community wikis, but without collaborative software or multiple users.
Personal wiki software can be broadly divided into two categories:
Multi-user applications with personal editions (such as MoinMoin or TWiki), installed for standalone use and inaccessible to outside users, which may require additional software such as a web server, database management system and/or WAMP/LAMP bundle
Applications designed for single users, not dependent on a database engine or web server
Some personal wikis are public, but password-protected, and run on dedicated web servers or are hosted by third parties.
Multi-user wiki software
Multi-user wiki applications with personal editions include:
MoinMoin desktop edition (written in Python)
TWiki for Windows Personal and Certified TWiki (both written in Perl)
MediaWiki (powers Wikipedia and many other wikis, written in PHP)
DokuWiki on a Stick (written in PHP), which utilizes plain text files (and thus does not need a database like MediaWiki) and a syntax similar to MediaWiki
Single-user wiki software
There are also wiki applications designed for personal use, apps for mobile use, and apps for use from USB flash drives. They often include more features than traditional wikis, including:
Dynamic tree views of the wiki
Drag-and-drop support for images, text and video, mathematics
Use of OLE or Linkback to allow wikis to act as relational superstructures for multiple desktop-type documents
Multimedia embedding, with links to internal aspects of movies, soundtracks, notes and comments
Macros and macro scripting
Notable examples include:
ConnectedText, a commercial Windows-based personal wiki system that includes full-text searches, a visual link tree, a customizable interface, image and file control, CSS-based page display, HTML and HTML Help exporting, and plug-ins
Gnote, a port of Tomboy to C++ (although not all plug-ins have been ported)
MyInfo, a Windows-based free form personal information manager that includes wiki-style linking between notes, full-text search, different views of the note list, and web-site export
Obsidian is a knowledge base and note-taking software application that operates on Markdown files.
org-mode, an Emacs mode that can create documents that are interlinked, converted to HTML, and automatically uploaded to a web server
TiddlyWiki, a highly customizable personal wiki written in HTML and JavaScript; it is provided as a single HTML file or multiple Node-js files, features many tools and plugins, and has been in active development since 2004 as free and open-source (BSD) software
Tomboy, a (LGPL) free software wiki-style note-taking program that allows easy organisation of any hierarchical data, hosted on GNOME CVS
Vim, which can be used as a personal wiki via plugins such as Vimwiki
Zim, a free, open-source standalon
|
https://en.wikipedia.org/wiki/Anemic%20domain%20model
|
The anemic domain model is described as a programming anti-pattern where the domain objects contain little or no business logic like validations, calculations, rules, and so forth. The business logic is thus baked into the architecture of the program itself, making refactoring and maintenance more difficult and time-consuming.
Overview
This anti-pattern was first described by Martin Fowler, who considers the practice an anti-pattern. He says:
In an anemic domain design, business logic is typically implemented in separate classes which transform the state of the domain objects. Fowler calls such external classes transaction scripts. This pattern is a common approach in Java applications, possibly encouraged by technologies such as early versions of EJB's Entity Beans, as well as in .NET applications following the Three-Layered Services Application architecture where such objects fall into the category of "Business Entities" (although Business Entities can also contain behavior).
Fowler describes the transaction script pattern thus:
In his book "Patterns of Enterprise Application Architecture", Fowler noted that the transaction script pattern may be proper for many simple business applications, and obviates a complex OO-database mapping layer.
An anemic domain model might occur in systems that are influenced from Service-Oriented Architectures, where behaviour does not or tends to not travel, such as messaging/pipeline architectures, or SOAP/REST APIs. Architectures like COM+ and Remoting allow behaviour, but increasingly the web has favoured disconnected and stateless architectures.
Criticism
There is some criticism as to whether this software design pattern should be considered an anti-pattern, since many see also benefits in it, for example:
Clear separation between logic and data.
Works well for simple applications.
Results in stateless logic, which facilitates scaling out.
Avoids the need for a complex OO-Database mapping layer.
More compatibility with mapping and injection frameworks expecting dumb properties rather than a specific constructor or property population order.
A common criticism is the idea that anemic domain model makes it easier to follow the SOLID principles: "The ‘S’ refers to the Single Responsibility Principle, which suggests that a class should do one thing, and do it well (...)" . But, according to Robert C. Martin, this is a misunderstanding of that principle: "Of all the SOLID principles, the Single Responsibility Principle (SRP) might be the least well understood. That’s likely because it has a particularly inappropriate name. It is too easy for programmers to hear the name and then assume that it means that every module should do just one thing. Make no mistake, there is a principle like that. A function should do one, and only one, thing. We use that principle when we are refactoring large functions into smaller functions; we use it at the lowest levels. But it is not one of the SOLID principles—it is n
|
https://en.wikipedia.org/wiki/PPDS
|
PPDS may refer to:
Personal Printer Data Stream, a computer printer language
Partito Progressista Democratico Sammarinese or Sammarinese Democratic Progressive Party, a political party in San Marino
Područja od posebne državne skrbi or Areas of Special State Concern, a Croatian government designation for regional development
Precision Payload Delivery System, a type of unmanned aerial vehicle
|
https://en.wikipedia.org/wiki/Manu%20Rere
|
Manu Rere is a weekly New Zealand television educational show hosted by Kaa Williams.
References
External links
Manu Rere at Māori Television
Māori Television original programming
2004 New Zealand television series debuts
|
https://en.wikipedia.org/wiki/Enhanced%20Variable%20Rate%20Codec%20B
|
Enhanced Variable Rate Codec B (EVRC-B) is a speech codec used by CDMA networks. EVRC-B is an enhancement to EVRC and compresses each 20 milliseconds of 8000 Hz, 16-bit sampled speech
input into output frames of one of the four different sizes:
Rate 1 - 171 bits,
Rate 1/2 - 80 bits,
Rate 1/4 - 40 bits,
Rate 1/8 - 16 bits.
In addition, there are two zero bit codec frame types: null frames and erasure frames, similar to EVRC. One significant enhancement in EVRC-B is the use of 1/4 rate frames that were not used in EVRC. This provides lower average data rates (ADRs) compared to EVRC, for a given voice quality.
The new 4GV Codecs used in CDMA2000 are based on EVRC-B. 4GV is designed to allow service providers to dynamically prioritize voice capacity on their network as required.
The Enhanced Variable Rate Coder (EVRC) is a speech codec used for cellular telephony in cdma2000 systems. EVRC provides excellent speech quality using variable rate coding with 3 possible rates, 8.55, 4.0 and 0.8 kbit/s. However, the Quality of Service (QoS) in cdma2000 systems can significantly benefit from a codec which allows tradeoffs between voice quality and network capacity, which cannot be achieved efficiently with the EVRC.
An upgrade of the EVRC vocoder, known as EVRC-B, was recently introduced by 3GPP2. The EVRC-B speech codec is based on the 4GV concept and is the newest and most advanced speech codec for cellular applications. In addition to the Relaxed Code Excitation Linear Prediction (RCELP) used by EVRC, EVRC-B uses Prototype Pitch Period (PPP) approach for coding of stationary voice frames and Noise Excitation Linear Prediction (NELP) for efficient coding of unvoiced or noise frames. Using NELP and PPP coding at 2.0 kbit/s provides EVRC-B with superior flexibility in rate assignment, allowing it to operate at several operating points, each with a different trade-off between speech quality and system capacity. EVRC-B replaced EVRC as the main speech codec for cdma2000 and its first network commercial deployment started in 2007. A wideband extension, EVRC-WB, provides speech quality that exceeds regular wireline telephony and its standardization process was completed at the summer of 2007. EVRC-WB uses a modified discrete cosine transform (MDCT) audio coding algorithm.
EVRC-B can be also used in 3GPP2 container file format - 3G2.
References
External links
- Enhancements to RTP Payload Formats for EVRC Family Codecs
- RTP Payload Format for the Enhanced Variable Rate Wideband Codec (EVRC-WB) and the Media Subtype Updates for EVRC-B Codec
Speech codecs
|
https://en.wikipedia.org/wiki/Computer%20City
|
Computer City was a chain of United States-based computer superstores operated by Tandy Corporation; the retailer was sold to CompUSA in 1998 and was merged into the CompUSA organization.
Computer City was a supercenter concept featuring name-brand and private label computers, software and related products; at the height of its success the company had over 101 locations in the United States and five in Europe.
History
In 1981, the original Computer City was founded by Leonard and Myrna Simon in Costa Mesa, California. Len Simon sat on the original Apple Retail Council while Myrna was in charge of HR. Within the first year, Computer City had added stores in Brea and Pasadena, California, and with the help of managers Mike Mostyn, Gordon Klatt and Greg Gadbois, Computer City expanded to San Diego, Beverly Hills, Encino, Cerritos, and Torrance, California. Computer City was the first independent Los Angeles computer retailers to offer the original IBM 5150 PC along with Sears and ComputerLand.
Computer City was acquired in 1983 by Rick and Joe Inatome and, now known as Inacomp, became the second largest computer retailer in the US with sales over $500M (~$ in ) / year in computer products.
By 1985, market conditions in computer retailing had changed. As computers were less of a mystery to more people, profit margins began to drop. Retailers who offered business-to-business consultative services to sell computer systems could no longer afford expensive salespeople. Taking the name of the Los Angeles retailer they had purchased two years earlier, Rick, Vee, and Joe Inatome gave rise to the first big-box merchandising concept – Computer City. With an investment from Mitsubishi, Joe leveraged his vendor relationships at Inacomp to bring IBM, Apple, and Compaq to their first big-box merchandised store, initially privately held by Inatome and Mitsubishi.
Innovative retail practices
Computer City innovated a number of retail concepts that are now common retail practices. First begun at the Costa Mesa Incomp, the store hosted a professional service bureau called The Graphic Zone, that provided film and graphic services for the nascent desktop publishing industry, the store operated a cafe which served coffee and sandwiches to prolong shopping visits, and the store featured a product training center that included an Electrosonic Video Wall, with 16 32" monitors which served as digital signage for the store, when training wasn't in session. The store also made heavy use of vendor managed inventory, vendor shops, and CO-OP funded retail displays which are now common practice throughout the retail industry.
Acquisition by Tandy
Ultimately, Tandy bought the Computer City concept and store in 1991 and launched Computer City as a national chain (as well as Incredible Universe). Alan Bush, a Radio Shack executive, was named president of the new company.
The stores resembled CompUSA's super center concepts, but lacked the financial backing CompUS
|
https://en.wikipedia.org/wiki/Cantando%20por%20un%20sue%C3%B1o
|
Cantando por un Sueño (Singing for a Dream) is a television contest produced by the Mexican television network Canal de las Estrellas which also aired on Univision in the United States. As with its twin show Bailando por un sueño (Dancing for a Dream), celebrities are paired with common, everyday people. However, in Cantando por un Sueño, contestants have to sing, rather than dance to impress the panel of judges and win. The panel of judges is made up of famous Latin American singers.
Prizes generally include costly interventions to help people in unfortunate situations including blindness, deafness, paralysis, mortal diseases, bankruptcy, etc.
Mexican singer Thalía is the "godmother" of this contest, and she sings the title song of the show too.
Cantando por un Sueño had three seasons of about seven episodes each and concluded in a final fourth season Called "Reyes de la Canción" (Song's Royalty) where the winners, runners-up and 3rd-place finishers of the first three seasons compete in a final showdown. (In the third season, 4th place went to "Reyes", because before being eliminated, they received the highest score).
On air
Hosts
Adal Ramones
Liza Echeverría
Alessandra Rosaldo
Judges
Yuri
Ricardo Montaner
Adrian Posse (1st and 2nd season)
Susana Zabaleta (1st and 2nd season)
Manuel Mijares (3rd season)
Kiko Campos (3rd season)
Substitutes:
Amanda Miguel (3rd season) (substituting Yuri)
Contestants
Season 1
Season 2
Season 3
Rubén Cerda, actor/humorist (partnered with Leydi Diana) teacher: Margarita "la diosa de la cumbia" eliminated third
Luis Roberto Guzmán, actor (partnered with Argelia González) teacher: María Conchita Alonso eliminated second
Gustavo Munguía, humorist (partnered with Jacqueline Carrillo) teacher:Nelson Ned eliminated fourth
Maya, model (partnered with Everardo Ramírez)
Everardo Ramirez, One of the finalists teacher: Napoleón eliminated sixth
Alejandra Ávalos, actress (partnered with Moisés Sierra) teacher: Diego Verdaguer eliminated first
Arturo Peniche, actor/TV host (partnered with Norma Irene Carbajal) teacher: Karinna eliminated fifth
Chantal Andere, actress (partnered with Gerardo Urquiza) teacher: Ednita Nazario third place
Alan, actor (partnered with Lorena Schlebach) – Runner up teacher: second place
Rocío Banquells, actress (partnered with Carlos García) – WINNER teacher: Francisco Céspedes WINNER
Reyes De La Canción
Everyone against everyone; no teams were selected for this season. The final 3 groups from all previous seasons were featured in this season, "Kings/Queens of The Song".
Rocío Banquells
Carlos García
Alan
Lorena Schlebach
Chantal Andere
Gerardo Urquiza
Raquel Bigorra
Francisco Castillo – Male Winner
Patricio Borghetti
Samia Karima
Maya
Marco Antonio Gutierrez
Sheyla – Female Winner
Everardo Ramírez
Cipriano Hernández
Kika Edgar – Female Runner-Up
Raúl Juárez
Ernesto D'Alesio -Male Runner-Up
Ruth Vázquez
Argentine version: Cantando por un Sueño
For the Argentine version, visit
|
https://en.wikipedia.org/wiki/Hot%20Potato
|
Hot Potato may refer to:
Hot potato, a party game involving tossing a small object
Hot Potato (video game), a 2001 Game Boy Advance video game
Computing
Hot potato routing, a networking strategy
Film and television
Hot Potato (1976 film), a 1976 American action movie
Hot Potato (1979 film), a 1979 Italian comedy movie
Hot Potato (game show), a 1984 American TV show
The Hot Potato, a 2011 British crime thriller movie
Music
Live Hot Potatoes!, by The Wiggles
Hot Potatoes: The Best of Devo, by Devo
"Hot Potato" (song), by La Toya Jackson
"Hot Potato", by The Wiggles
See also
Baked potatoes
|
https://en.wikipedia.org/wiki/AdvFS
|
AdvFS, also known as Tru64 UNIX Advanced File System, is a file system developed in the late 1980s to mid-1990s by Digital Equipment Corporation for their OSF/1 version of the Unix operating system (later Digital UNIX/Tru64 UNIX). In June 2008, it was released as free software under the GPL-2.0-only license. AdvFS has been used in high-availability systems where fast recovery from downtime is essential.
Functionality
AdvFS uses a relatively advanced concept of a storage pool (called a file domain) and of logical file systems (called file sets). A file domain is composed of any number of block devices, which could be partitions, LVM or LSM devices. A file set is a logical file system created in a single file domain. Administrators can add or remove volumes from an active file domain, providing that there is enough space on the remaining file domain, in case of removal. This was one of the trickier original features to implement because all data or metadata residing on the disk being removed had to first be migrated, online, to other disks, prior to removal.
File sets can be balanced, meaning that file content of file sets be balanced across physical volumes. Particular files in a file set can be striped across available volumes.
Administrators can take a snapshot (or clone) of any active or inactive file set. This allows for easy on-line backups and editing.
Another feature allows administrators to add or remove block devices from a file domain, while the file domain has active users. This add/remove feature allows migration to larger devices or migration from potentially failing hardware without a system shutdown.
Features
Its features include:
a journal to allow for fast crash recovery
undeletion support
high performance
dynamic structure that allows an administrator to manage the file system on the fly
on the fly creation of snapshots
defragmentation while the domain has active users
Under Linux, AdvFS supports an additional ‘’syncv’’ system call to atomically commit changes to multiple files.
History
AdvFS, also known as Tru64 UNIX Advanced File System, was developed by Digital Equipment Corporation engineers in the late 1980s to mid-1990s in Bellevue, WA (DECwest). They had previously worked on the earlier (cancelled) MICA and OZIX projects there.
It was first delivered on the DEC OSF/1 system (later Digital UNIX/Tru64 UNIX). Over time, development moved to teams located in Bellevue, WA and Nashua, NH. Versions were always one version number behind the operating system version. Thus, DEC OSF/1 v3.2 had AdvFS v2.x, Digital UNIX 4.0 had AdvFS v3.x and Tru64 UNIX 5.x had AdvFS v4.x. It is generally considered that only AdvFS v4 had matured to production level stability, with a sufficient set of tools to get administrators out of any kind of trouble. The original team had enough confidence in its log based recovery to release it without an "fsck" style recovery utility on the assumption that the file system journal would alway
|
https://en.wikipedia.org/wiki/Entity%20Bean
|
An "Entity Bean" is a type of Enterprise JavaBean, a server-side Java EE component, that represents persistent data maintained in a database. An entity bean can manage its own persistence (Bean managed persistence) or can delegate this function to its EJB Container (Container managed persistence). An entity bean is identified by a primary key. If the container in which an entity bean is hosted crashes, the entity bean, its primary key, and any remote references survive the crash.
In EJB 3.0, entity beans were superseded by the Java Persistence API (which was subsequently completely separated to its own spec as of EJB 3.1). Entity Beans have been marked as a candidate for pruning as of Java EE 6 and are therefore considered a deprecated technology.
Entity Beans before EJB 2.0 should not be used in great numbers because each entity bean was in fact a RMI stub with its own RMI connection to the EJB server. Obtaining 1000 entity beans as a single operation would result in 1000 simultaneous internet connections to the RMI back-end . Since TCP/IP only supports 65536 ports you are essentially limited to using 65536 entity beans at a time. For example, if a client application wanted to monitor the state of 1024 database entries it would take 1024 entity bean references and thus 1024 RMI connections to the EJB server, the EJB server would in turn need to support all 1024 connections from each client application, and would be limited to serving at most 64 client applications at which point all further internet connections would be ignored. These limitations are impossible to overcome when using entity beans over RMI.
References
External links
What is an Entity Bean? (Sun's J2EE Tutorial)
Enterprise Beans lifecycle
Life Cycle State Diagram of Entity Beans
Java enterprise platform
|
https://en.wikipedia.org/wiki/HSMM
|
HSMM is an acronym that can have multiple meanings:
Hidden semi-Markov model, a statistical model.
High Speed Multimedia, an amateur radio project using 802.11 wireless networking hardware.
|
https://en.wikipedia.org/wiki/Data%20format
|
Data format in information technology may refer to:
Data type, constraint placed upon the interpretation of data in a type system
Signal (electrical engineering), a format for signal data used in signal processing
Recording format, a format for encoding data for storage on a storage medium
File format, a format for encoding data for storage in a computer file
Container format (digital), a format for encoding data for storage by means of a standardized audio/video codecs file format
Content format, a format for representing media content as data
Audio format, a format for encoded sound data
Video format, a format for encoded video data
|
https://en.wikipedia.org/wiki/Strip%20Search%20%28film%29
|
Strip Search is a drama film made for the HBO network, first aired on April 27, 2004. The film explores the status of individual liberties in the aftermath of the September 11, 2001 attacks and the approval of the USA PATRIOT Act. The film was directed by Sidney Lumet and written by Oz creator Tom Fontana. It stars Glenn Close, Maggie Gyllenhaal, Ken Leung, Bruno Lastra and Dean Winters. The film initially was screened at the Monaco International Film Festival with Lumet presenting it in the presence of Fontana.
Different cuts of the film exist. There is supposedly a two-hour version. German TV showed an 86-minute version. The version released on DVD in the U.S. is 56 minutes.
Plot
The film is built around two main parallel stories, each containing almost identical dialogues. One story line involves Linda Sykes (Gyllenhaal), an American woman detained in the People's Republic of China, being interrogated by a military officer (Leung). In the other storyline, Sharif Bin Said (Lastra), an Arab man detained in New York City, is interrogated by two FBI agents (Winters and Close). Both characters are graduate students detained with no hard evidence and interrogated about unspecified activities which may or may not be related to terrorist plots.
In the course of the increasingly brutal interrogations, both Sykes and Bin Said are strip searched against their will by their interrogators and are subjected to a cavity search. In both cases the protagonists appear to have only tenuous connections with the suspected terrorist plots.
The film ends with the question: "Must security and safety come at the price of freedom?"
Cast
Glenn Close as Karen Moore
Maggie Gyllenhaal as Linda Sykes
Ken Leung as Liu Tsung-Yuan
Bruno Lastra as Sharif Bin Said
Dean Winters as Ned McGrath
Peter Jacobson as John Scanlon
Austin Pendleton as James Perley
Tom Guiry as Gerry Sykes
Fred Kohler as Jimmy Briggs
Christopher McCann as Nicholas Hudson
Nelson Lee as Xiu-Juan Chang
Ramsey Faragallah as Abdul Amin
Daniel May Wong as Arresting Officer
References
External links
Strip Search DVD on Amazon.com
2004 television films
American political drama films
2004 drama films
2004 films
Films shot in New Jersey
War on terror
Films directed by Sidney Lumet
HBO Films films
2000s American films
2000s English-language films
|
https://en.wikipedia.org/wiki/Color%20quantization
|
In computer graphics, color quantization or color image quantization is quantization applied to color spaces; it is a process that reduces the number of distinct colors used in an image, usually with the intention that the new image should be as visually similar as possible to the original image. Computer algorithms to perform color quantization on bitmaps have been studied since the 1970s. Color quantization is critical for displaying images with many colors on devices that can only display a limited number of colors, usually due to memory limitations, and enables efficient compression of certain types of images.
The name "color quantization" is primarily used in computer graphics research literature; in applications, terms such as optimized palette generation, optimal palette generation, or decreasing color depth are used. Some of these are misleading, as the palettes generated by standard algorithms are not necessarily the best possible.
Algorithms
Most standard techniques treat color quantization as a problem of clustering points in three-dimensional space, where the points represent colors found in the original image and the three axes represent the three color channels. Almost any three-dimensional clustering algorithm can be applied to color quantization, and vice versa. After the clusters are located, typically the points in each cluster are averaged to obtain the representative color that all colors in that cluster are mapped to. The three color channels are usually red, green, and blue, but another popular choice is the Lab color space, in which Euclidean distance is more consistent with perceptual difference.
The most popular algorithm by far for color quantization, invented by Paul Heckbert in 1979, is the median cut algorithm. Many variations on this scheme are in use. Before this time, most color quantization was done using the population algorithm or population method, which essentially constructs a histogram of equal-sized ranges and assigns colors to the ranges containing the most points. A more modern popular method is clustering using octrees, first conceived by Gervautz and Purgathofer and improved by Xerox PARC researcher Dan Bloomberg.
If the palette is fixed, as is often the case in real-time color quantization systems such as those used in operating systems, color quantization is usually done using the "straight-line distance" or "nearest color" algorithm, which simply takes each color in the original image and finds the closest palette entry, where distance is determined by the distance between the two corresponding points in three-dimensional space. In other words, if the colors are and , we want to minimize the Euclidean distance:
This effectively decomposes the color cube into a Voronoi diagram, where the palette entries are the points and a cell contains all colors mapping to a single palette entry. There are efficient algorithms from computational geometry for computing Voronoi diagrams and determining which
|
https://en.wikipedia.org/wiki/CLIWOC
|
The Climatological database for the world's oceans (CLIWOC) was a research project to convert ships' logbooks into a computerised database. It was funded by the European Union, and the bulk of the work was done between 2001 and 2003. The database draws on British, Dutch, French and Spanish ships' logbook records for the immediate pre-instrumental period, 1750 to 1850.
Logbooks in review
Logbooks from the eighteenth and early nineteenth century had previously been used in case studies of individual events of historic or climatic interest.
CLIWOC established early ships' logbooks as another source for those seeking to understand climate change, to be used alongside proxy and instrument data. The observations were made at local noon every single day, and cover most of the world's oceans - only the Pacific Ocean lacks detailed coverage. This volume of data was not available by any other means.
Interpreting the data
In researching the data, CLIWOC staff found that the data need to be treated with caution, and subjected to careful scrutiny. The range of information - wind force terms and directions, and general weather descriptions - is consistent between the different national sources. The data was primarily based on observations made by experienced officers.
Though each book used consistent terms to refer to wind speeds, these values were not always consistent between logbooks. The researchers chose to standardise the terms into their Beaufort scale equivalents. The vocabulary used also differed between the national sources - British mariners used a relatively narrow range of terms, while sailors from the Netherlands, Spain, and France used a wider set of descriptions. Researchers found that the majority of wind force entries were accounted for by twelve or so terms, allowing the group to prepare a dictionary defining most wind force terms in use. This multi-lingual dictionary has also been published.
Data verification
In order to establish the reliability of logbook records, the researchers looked at readings taken where ships were in convoy or travelling in close company. These voyages often lasted several weeks, giving large samples. The research showed that there was a consistently high degree of correlation in recorded wind forces and recorded wind directions.
On a number of occasions, the records showed small but persistent differences between absolute wind force records prepared on ships of different sizes. This was adjudged not to materially influence the scientific outcome of the project, but remains a matter for further investigation.
It was also necessary to correct the data to modern norms, both for wind speed and for wind direction - some books recorded data by reference to magnetic north, rather than true north. Precise navigational methods were not widely used until late in the study period, so it was necessary to correct latitude and longitude using specifically designed software.
The database
An initial version of the
|
https://en.wikipedia.org/wiki/Cutter%20location
|
A cutter location (CLData) refers to the position which a CNC milling machine has been instructed to hold a milling cutter by the instructions in the program (typically G-code).
Each line of motion controlling G-code consists of two parts: the type of motion from the last cutter location to the next cutter location (e.g. "G01" means linear, "G02" means circular), and the next cutter location itself (the cartesian point (20, 1.3, 4.409) in this example). "G01 X20Y1.3Z4.409"
The fundamental basis for creating the cutter paths suitable for CNC milling are functions that can find valid cutter locations, and stringing them together in a series.
There are two broad and conflicting approaches to the problem of generating valid cutter locations, given a CAD model and a tool definition: calculation by offsets, and calculation against triangles. Each is discussed in a later section of this article.
The most common example of the general cutter location problem is cutter radius compensation (CRC), in which an endmill (whether square end, ball end, or bull end) must be offset to compensate for its radius.
Since the 1950s, CRC calculations finding tangency points on the fly have been done automatically within CNC controls, following the instructions of G-codes such as G40, G41, and G42. The chief inputs have been the radius offset values stored in the offset registers (typically called via address D) and the left/right climb/conventional distinction called via G41 or G42 (respectively). With the advent of CAM software, which added a software-aided option to complement the older manual-programming environment, much of the CRC calculations could be moved to the CAM side, and various modes could be offered for how to handle CRC.
Although 2-axis or 2.5-axis CRC problems (such as calculating toolpaths for a simple profile in the XY plane) are quite simple in terms of computational power, it is in the 3-, 4-, and 5-axis situations of contouring 3D objects with a ball-endmill that CRC becomes rather complex. This is where CAM becomes especially vital and far outshines manual programming. Typically the CAM vector output is postprocessed into G-code by a postprocessor program that is tailored to the particular CNC control model. Some late-model CNC controls accept the vector output directly, and do the translation to servo inputs themselves, internally.
By offsets
Start with a UV parametric point in a freeform surface, calculate the xyz point and the normal, and offset from the point along the normal in a way consistent with the tool definition so that the cutter is now tangent to the surface at that point.
Problems: may collide or gouge with the model elsewhere, and there is no way to tell this is happening except with a full implementation of the triangulated approach.
Most published academics believe this is the way to find cutter locations, and that the problem of collisions away from the point of contact is soluble. However, nothing printed so far com
|
https://en.wikipedia.org/wiki/Tjurk%C3%B6%20bracteates
|
The Tjurkö Bracteates, listed by Rundata as DR BR75 and DR BR76, are two bracteates (medals or amulets) found on Tjurkö, Eastern Hundred, Blekinge, Sweden, bearing Elder Futhark runic inscriptions in Proto-Norse.
Description
The Tjurkö bracteates were discovered in 1817 near Tjurkö when cultivating, for the first time, a field on a stony hill. The bracteates were found in the roots of the grass among the rocks. Also discovered with the bracteates was a gold coin of the Emperor Theodosius II of the Eastern Roman Empire that has been dated to 443 AD.
The Tjurkö 1 bracteate is dated to the Germanic Iron Age between 400 and 650 AD and is now at the Swedish Museum of National Antiquities (SHM 1453:25). It is a typical C-bracteate, similar to the Vadstena bracteate, and shows a stylized head in the center above a horse and beneath a bird. This iconography is usually interpreted as depicting an early form of the Norse pagan god Odin with his associated animals, a horse and a raven.
Inscription
Tjurkö 1 bracteate
The inscription of the Tjurkö 1 bracteate (DR BR75, IK184) reads:
Transliteration:
wurte runoz an walhakurne heldaz kunimundiu
Proto-Norse transcription:
Wurte runoz an walhakurne Heldaz Kunimundiu
English translation:
Heldaz wrought runes on 'the foreign grain' for Kunimunduz.
There is a consensus that walha-kurne is a compound word referring to the bracteate itself, and that walha (cognate with Modern English Welsh) means "foreign, non-Germanic" - here perhaps more specifically "Roman" or "Gallic." However, differing explanations have been proposed for the second element kurne. According to one interpretation, kurne is the dative singular of kurna (cognate with Modern English corn), and walha-kurne "Roman or Gallic grain" is a kenning for "gold;" cf. the compounds valhöll, valrauðr and valbaugar in the Old Norse poem Atlakviða. This may refer to the melting of solidi as source of the gold for the bracteate. An alternative interpretation of the second element sees kurne as an early loan from Latin corona "crown," but this is now considered to be unlikely since "crowns" as currency appear only in medieval times, from images of crowns minted on the coins' faces. The personal name Heldaz is derived from *held- "battle" (Old English hild, Old Norse hildr, etc.), while Kunimundiu (dative singular of Kunimunduz) is from kuni- "kin" (which appears with connotations of royalty as the first element of Old English compounds, cf. Modern English king) and mund- "protection."
Tjurkö 2 bracteate
The Tjurkö 2 bracteate (DR BR76, IK185) is dated to the same period and has an inscription of just three runes that read ota, which translates as "fear." This formulistic word is also used on other bracteates such as DR IK55 (Fjärestad), DR IK152 (unknown location in Skåne), and DR IK578 (Gadegård).
Notes
References
External links
Danske Brakteater, Arild Hauge website
Tjurkö 1 bracteate - Map and Rundata
Photograph of Tjurkö 2 bracteate
Bracteates
Eld
|
https://en.wikipedia.org/wiki/Multimedia%20computer
|
A multimedia computer is a computer that is optimized for multimedia performance.
Early home computers lacked the power and storage necessary for true multimedia. The games for these systems, along with the demo scene were able to achieve high sophistication and technical polish using only simple, blocky graphics and digitally generated sound.
The Amiga 1000 from Commodore International has been called the first multimedia computer. Its groundbreaking animation, graphics and sound technologies enabled multimedia content to flourish. Famous demos such as the Boing Ball and Juggler showed off the Amiga's abilities. Later the Atari ST series and Apple Macintosh II extended the concept; the Atari integrated a MIDI port and was the first computer under US$1000 to have 1 megabyte of RAM which is a realistic minimum for multimedia content and the Macintosh was the first computer able to display true photorealistic graphics as well as integrating a CD-ROM drive, whose high capacity was essential for delivering multimedia content in the pre-Internet era.
While the Commodore machines had the hardware to present multimedia of the kinds listed above, it lacked a way to create it easily. A computer system consists of hardware and software, so the earliest known system for creating and deploying multimedia content can be found the archives of the Smithsonian Institution and is called VirtualVideo. It consisted of a standard PC with a added digital imaging board, a added digital audio capture board (that was sold as a phone answering device), and the DOS authoring software, VirtualVideo Producer. The system stored content on a local hard drive, but could use networked computer storage as well. The name for the software was used because at the time, the mid 1980's, the term multimedia was used to describe slide shows with sound. This software was later sold as Tempra and in 1993, was included with Tay Vaugh's first edition of Multimedia: Making It Work.
Multimedia capabilities were not common on IBM PC compatibles until the advent of Windows 3.0 and the MPC standards in the early 1990s. The original PCs were devised as "serious" business machines and colorful graphics and powerful sound abilities weren't a priority. The few games available suffered from slow video hardware, PC speaker sound and limited color palette when compared to its contemporaries. But as PCs penetrated the home market in the late 1980s, a thriving industry arose to equip PCs to take advantage of the latest sound, graphics and animation technologies. Creative's SoundBlaster series of sound cards, as well as video cards from ATI, Nvidia and Matrox soon became standard equipment for most PCs sold.
most PCs have good multimedia features. They have dual or more core CPUs clocked at 2.0 GHz or faster, at least 4 GB of RAM and an integrated graphics processing unit. Popular graphics cards include Nvidia GeForce or AMD Radeon. The Intel Core and AMD Ryzen platform, and Microsoft Windows 1
|
https://en.wikipedia.org/wiki/Fermat%20%28computer%20algebra%20system%29
|
Fermat (named after Pierre de Fermat) is a program developed by Prof. Robert H. Lewis of Fordham University. It is a computer algebra system, in which items being computed can be integers (of arbitrary size), rational numbers, real numbers, complex numbers, modular numbers, finite field elements, multivariable polynomials, rational functions, or polynomials modulo other polynomials. The main areas of application are multivariate rational function arithmetic and matrix algebra over rings of multivariate polynomials or rational functions. Fermat does not do simplification of transcendental functions or symbolic integration.
A session with Fermat usually starts by choosing rational or modular "mode" to establish the ground field (or ground ring) as or . On top of this may be attached any number of symbolic variables thereby creating the polynomial ring and its quotient field. Further, some polynomials involving some of the can be chosen to mod out with, creating the quotient ring Finally, it is possible to allow Laurent polynomials, those with negative as well as positive exponents. Once the computational ring is established in this way, all computations are of elements of this ring. The computational ring can be changed later in the session.
The polynomial gcd procedures, which call each other in a highly recursive manner, are about 7000 lines of code.
Fermat has extensive built-in primitives for array and matrix manipulations, such as submatrix, sparse matrix, determinant, normalize, column reduce, row echelon, Smith normal form, and matrix inverse. It is consistently faster than some well known computer algebra systems, especially in multivariate polynomial gcd. It is also space efficient.
The basic data item in Fermat is a multivariate rational function or quolynomial. The numerator and denominator are polynomials with no common factor. Polynomials are implemented recursively as general linked lists, unlike some systems that implement polynomials as lists of monomials. To implement (most) finite fields, the user finds an irreducible monic polynomial in a symbolic variable, say and commands Fermat to mod out by it. This may be continued recursively, etc. Low level data structures are set up to facilitate arithmetic and gcd over this newly created ground field. Two special fields, and are more efficiently implemented at the bit level.
History
With Windows 10, and thanks to Bogdan Radu, it is now possible (May 2021) to run Fermat Linux natively on Windows. See the main web page http://home.bway.net/lewis
Fermat was last updated on 20 May 2020 (Mac and Linux; latest Windows version: 1 November 2011).
In an earlier version, called FFermat (Float Fermat), the basic number type is floating point numbers of 18 digits. That version allows for numerical computing techniques, has extensive graphics capabilities, no sophisticated polynomial gcd algorithms, and is available only for Mac OS 9.
Fermat was originally written in Pascal for
|
https://en.wikipedia.org/wiki/Get%20a%20Mac
|
The "Get a Mac" campaign is a television advertising campaign created for Apple Inc. (Apple Computer, Inc. at the start of the campaign) by TBWA\Media Arts Lab, the company's advertising agency, that ran from 2006 to 2009. The advertising campaign ran worldwide in the United States, Canada, Australia, New Zealand, the United Kingdom, Japan, and Germany.
Synopsis
The Get a Mac advertisements follow a standard template. They open to a plain white background, and a man dressed in casual clothes introduces himself as an Apple Macintosh computer ("Hello, I'm a Mac."), while a man in a more formal suit-and-tie combination introduces himself as a Microsoft Windows personal computer ("And I'm a PC.").
The two then act out a brief vignette, in which the capabilities and attributes of Mac and PC are compared, with PC—characterized as formal and somewhat polite, though uninteresting and overly concerned with work—often being frustrated by the more laid-back Mac's abilities. The earlier commercials in the campaign involved a general comparison of the two computers, whereas the later ones mainly concerned Windows Vista and Windows 7.
The original American advertisements star actor Justin Long as the Mac, and author and humorist John Hodgman as the PC, and were directed by Phil Morrison. The American advertisements also aired on Canadian, Australian, and New Zealand television, and at least 24 of them were dubbed into Spanish, French, German, and Italian. The British campaign stars comedic duo Robert Webb as Mac and David Mitchell as PC, while the Japanese campaign features the comedic duo Rahmens. Several of the British and Japanese advertisements, although based on the originals, were slightly altered to better target the new audiences. Both the British and Japanese campaigns also feature several original ads not seen in the American campaign.
The Get a Mac campaign is the successor to the Switch ads which were first broadcast in 2002. Both campaigns were filmed against a plain white background. Apple's former CEO, Steve Jobs, introduced the campaign during a shareholder's meeting the week before the campaign started. The campaign also coincided with a change of signage and employee apparel at Apple retail stores detailing reasons to switch to Macs.
The Get a Mac campaign received the Grand Effie Award in 2007. The song in the commercial is called "Having Trouble Sneezing" by Mark Mothersbaugh.
Advertisements
The advertisements play on perceived weaknesses of non-Mac personal computers, especially those running Microsoft Windows, of which PC is clearly intended to be a parody, and corresponding strengths possessed by the Mac OS (such as immunity to circulating viruses and spyware targeted at Microsoft Windows). The target audience of these ads is not devoted PC users but rather, those who are more likely to "swing" towards Apple. Apple realizes that many consumers who choose PCs do so because of their lack of knowledge of the Apple brand. With this ca
|
https://en.wikipedia.org/wiki/Financial%20News%20Network
|
The Financial News Network (FNN) was an American financial and business news television network that was launched November 30, 1981. The purpose of the network was to broadcast programming nationwide, five days a week for seven hours a day on thirteen stations, in an effort to expand the availability of business news for public dissemination. FNN was founded by Glen H. Taylor, a former minister of the Christian Church from 1950 to 1956, and producer of films for the California Department of Education. The channel was purchased by NBC in February 1991, and operations were integrated with rival cable financial news network, CNBC, on May 21, 1991.
Early history
Founding
Financial News Network (FNN) was founded in 1981 by Glen Taylor, chairman of the newly created five-member Board of Directors. Other board members included Karen Tyler, Head of Production, Rob Fisher, VP Business Affairs, and Rodney Buchser (who had been general manager of independent station KWHY-TV in Los Angeles. The concept originated in the late 1960s as Quotron (a quotation ticker vendor) supported WCIU Chicago and KWHY with the initial limited 'ticker scroll'. In 1969, Registered Investment Advisor Eugene Inger, joined Channel 22, and expanded financial television in Los Angeles with reporting, analysis and broader coverage. Inger expanded service to the San Francisco area in 1970 on KOFY, Channel 20. He also provided financial TV programming to KDNL in St. Louis, and pioneered WKID Channel 51 serving South Florida. During this time, FNN began programming on Channel 18 in Los Angeles in competition with Inger and KWHY.
Later, in 1975 via Newark, New Jersey-based WBTB (later WWHT)-TV (channel 68, now UniMás owned-and-operated station WFUT-DT), an independent station – owned at the time by Blonder-Tongue Broadcasting – which served the New York City market, was 'dark'. Inger revived the station by investing in Channel 68, and served as General Manager, as well as hosting a daily Wall Street programming block on WBTB (then titled Stock Market Today during market hours and Wall Street Perspective in the evening) starting in the fall of 1975. Keith Houser, the station's assistant general manager, worked with vendors to facilitate the ticker tape crawl across the bottom of the screen with a delay (mistakenly attributed at a 2 hour delay in a TV Guide reference), as was required at the time. The ticker ran across the lower third of the screen, with stock prices on the top (white) band and index prices on the bottom (blue) band. After the first year of programming, the SEC permitted just a twenty-minute delay. The concept was well-established both by WCIU Chicago, KWHY Los Angeles, Inger's day-long market coverage in Miami/Fort Lauderdale. (The 'specialty programming' did not encounter regulatory hurdles TV Guide suggested.) During the years, FNN also grew affiliates that generally not overlapping Inger's targeted markets. However, Inger eventually
"affiliated" with FNN, via an ar
|
https://en.wikipedia.org/wiki/Trams%20in%20Europe
|
Europe has an extensive number of tramway networks. Some of these networks have been upgraded to light rail standards, called Stadtbahn in Germany, premetros in Belgium, sneltram in the Netherlands, trem ligeiro in Portugal and fast trams in some other countries.
Overview
The introduction of trams in all the major cities of the late 19th century forced users and non-users alike to adjust to this intrusive, but clean and efficient form of transportation. Many early trams were horse-drawn, but electric trams followed. By the mid-1910s, the urban population were fully accustomed to trams as a fashionable mode of transport for work and leisure, and as a very positive and visual sign of the prosperity and prestige of the city. Visitors from the farms, villages and small towns sometimes made a trip on the tram a high priority when they came to the big city. A number of cities have retained - but also expanded - their original 19th century tram network, notably Warsaw (1866), Lisbon (1872), Gothenburg (1879), Budapest (1887), Prague (1891), Kyiv (1892), Milan and Genoa (1893), Rome, Bucharest and Belgrade (1894), Porto (1895), Vienna (1897), Helsinki (1899), and Gdańsk and Sarajevo (1895).
After World War 2, trams were seen as advantageous in many countries because, unlike buses, they did not use scarce petrol resources. However many tramways closed in the mid 20th century, as they were seen as less effective in terms of costs and use of the roadway than other forms of street transport. However, in recent decades tram networks in many countries in Europe have grown considerably. The Netherlands, which already makes extensive use of trams, has plans to expand tram services to two additional cities.
In Germany, many cities retain their original tram networks. In some places, tram networks have been added or expanded through the introduction of hybrid tram-train or stadtbahn systems which may combine standard railway, on-street and underground operations. Notable examples are the systems in Cologne and Karlsruhe. In Frankfurt-am-Main, many tram lines were transferred to U-Bahn operation.
In the United Kingdom, investment in public transport in the late 1980s turned to light rail as an alternative to more costly underground railway solutions, with the opening of the Tyne & Wear Metro in Newcastle (1980) and the Docklands Light Railway in London (1987) systems. However, the first British city to reintroduce on-street trams was Manchester, with the opening of its Metrolink network in 1992. Several other UK cities followed with their own modern tram systems, including Sheffield (Supertram, opened 1994), Birmingham and Wolverhampton (West Midlands Metro, opened 1999), London (Tramlink, opened 2000, albeit in a small part of Greater London), Nottingham (Nottingham Express Transit, opened 2004) and Edinburgh (Edinburgh Trams, opened 2014). Cardiff is currently building a system of 4 Light Rail Lines due to open in 2024. Many of these cities are planning
|
https://en.wikipedia.org/wiki/Eugene%20McDonnell
|
Eugene Edward McDonnell (October 18, 1926 – August 17, 2010) was a computer science pioneer and long-time contributor to the programming language siblings APL and J.
He was a graduate of Brooklyn Technical High School. After serving as an infantry corporal in the U.S. Army in World War II, he attended the University of Kentucky, graduating in 1949 summa cum laude, and was elected to Phi Beta Kappa. He was awarded a First Year Graduate Fellowship to Harvard University, where he studied comparative literature, particularly Dante's Divine Comedy.
Studying the poems of Robert Frost, he noticed that the first two poems in Frost's book West-Running Brook, "Spring Pools" and "The Freedom of the Moon", not only discuss reflecting, but the rhyme schemes of the two reflect each other: AABCBC and CBCBAA. When he met Frost, he was delighted to find that they had both committed the 193 lines of John Milton's "Lycidas" to memory.
His first work at IBM was in the design of IBM's first time-sharing system, which became a very early host to IVSYS (for Iverson system), a predecessor of APL. In 1968, he became a colleague of Ken Iverson, used Iverson notation before APL was named, and was active in the very earliest days of APL. He holds (3 September 1968) "Information Transfer Control System" allowing communication between two users. In 1978, he left IBM and joined I. P. Sharp Associates, retiring therefrom in 1990.
At IBM, McDonnell devised the notation for the signum and circle functions in APL, designed the complex floor function, and proposed the extension of or and and to GCD and LCM. With Iverson he was responsible for including hooks and forks in J. The result of zero divided by zero in J is as he proposed in 1976. In 1987, he won the Iverson Award.
McDonnell was the publisher of the APL Press, producing "A Source Book in APL" and "APL Quote Quad, the Early Years". He was the editor and principal contributor of the Recreational APL column in APL Quote-Quad for many years. He wrote dozens of the "At Play with J" columns in Vector, the journal of the British APL Association. He contributed to Sloane's On-Line Encyclopedia of Integer Sequences.
He was a member of the Jane Austen Society of North America (JASNA), and gave a talk "Classical Persuasion" at the JASNA meeting at Lake Louise in 1993. He was active in the Bay area Jane Austen group, and wrote a topical index to the Dierdre Le Faye edition of Austen's letters, which can be seen at the Republic of Pemberley website.
McDonnell died peacefully at his home in Palo Alto on August 17, 2010.
Conference Papers
IBM69 Boston, A Formal Description of JCL
APL73 Toronto, The Variety of Alternative Definitions of a Simple Function
APL73 Copenhagen, Complex Floor
APL74 Anaheim, The Caret Functions
APL75 Pisa, A Notation for the GCD and LCM Functions
APL76 Ottawa, Zero Divided By Zero
IBM78 Los Altos, organizer
APL79 Rochester, NY, Fuzzy Residue
APL80 Noordwijkerhout, Netherlands, Extending APL to Infinity,
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.