source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/London%20Rail | London Rail was a directorate of Transport for London (TfL), involved in the relationship with the National Rail network within Greater London, UK which managed TfL's non-London Underground train services.
Rail for London, established in 2006, actually provides rail passenger transport services in London.
Operations
London Rail managed the London Overground (LO), London Trams, the Docklands Light Railway (DLR), and the Elizabeth line. As part of an internal restructure within TfL, it recently merged with the (previously separate) London Underground directorate, bringing all of Greater London local transport services on rails under one division.
The London Overground was established in 2007 when TfL took over the control of the former National Rail Silverlink franchise in 2007. It has since taken on more services through a former London Underground line and over other Network Rail lines. London Rail lets a concession to operate the Overground. Operation is contracted to Arriva Rail London (owned by Arriva UK Trains) until 2024.
London Trams is responsible only for the Croydon Tram known as Tramlink. Tramlink was set up in 2000 by a private finance initiative. It was bought by TfL in 2008 and is operated on its behalf by FirstGroup. London Trams has been working on proposals for other tram schemes in west and central London, however as of 2011 all are unfunded or cancelled.
The Docklands Light Railway was established in 1987 and has seen significant expansion since. Its operation has been contracted out as a concession to a joint venture between Keolis and Amey since 2014. There are also other concessionaires who have built and managed extensions.
The Elizabeth Line (formerly known as Crossrail) also operates as a concession from London Rail. It already operates the Shenfield Metro services, taking over from Abellio Greater Anglia on 31 May 2015, as well as the ex-Heathrow Connect route since 20 May 2018.
National Rail in Greater London
The National Rail network within Greater London carries large numbers of commuters into London and also provides many local services, especially within South London.
Under the Greater London Authority Act 1999 Transport for London was given powers to consult with the train operators and as such London Rail is therefore more of an enabler than an operator, and has developed partnerships with the Department for Transport (who are responsible for rail strategy), Network Rail (who own the infrastructure) and the various train operating companies (who operate the services) in order to further its aims.
A pilot project was launched in 2003 to promote the various services provided by train operating companies in South London under one umbrella brand, Overground Network. The scheme included station upgrades, signage and publicity, but promotion of the brand had ceased by 2007.
London Rail also influences rail freight and freight depots in Greater London. In August 2007, London Rail published its 'Rail Freight St |
https://en.wikipedia.org/wiki/BCS%20Lovelace%20Medal | The Lovelace Medal was established by the British Computer Society in 1998, and is presented to individuals who have made outstanding contributions to the understanding or advancement of computing. It is the top award in computing in the UK. Awardees deliver the Lovelace Lecture.
The award is named after Countess Ada Lovelace, an English mathematician, scientist, and writer. Lovelace was the daughter of Lord Byron. She worked with computer pioneer Charles Babbage on the proposed mechanical general-purpose computer – the Analytical Engine, in 1842 and is often described as the world's first female computer programmer.
The medal is intended to be presented to individuals, without regard to their countries of domicile, provided a direct connection to the UK. It is generally anticipated that there will be one medalist each year, but the regulation does not preclude either several medalists or no medalist.
Medal recipients
Awardees include:
2020 Ian Horrocks – for significant contributions to the advancements of reasoning systems
2020 Nick Jennings and Michael Wooldridge – for contributions to multi-agent systems
2019 Marta Kwiatkowska – for probabilistic model checking for the data-rich world
2018 Gordon Plotkin – for contributions to semantic framework for programming languages
2017 Georg Gottlob – for contributions to the logical and theoretical foundations of databases
2016 Andrew Blake – for contributions to the understanding and advancement of computing as a discipline
2015 Ross Anderson – for contributions to building security engineering into a discipline
2014 Steve Furber – for designing the ARM microprocessor architecture and contributions to computer systems
2013 Samson Abramsky – for contributions to domain theory, game semantics and categorical quantum mechanics
2012 Grady Booch – for contributions to software architecture, software engineering and collaborative environments
2011 Hermann Hauser– for entrepreneurship and for co-developing the BBC Micro Computer
2010 John C. Reynolds – for contributions to logical foundations of programs and programming languages
2009 Yorick Wilks – for contributions to meaning-based understanding of natural language
2008 Tony Storey – for contributions to Autonomic Computing
2007 Karen Spärck Jones – for contributions to natural language processing
2006 Sir Tim Berners-Lee – for inventing the World Wide Web
2005 Nick McKeown – for contributions to router hardware design
2004 John Warnock of Adobe Systems – for contributions in document processing
2002 Ian Foster and Carl Kesselman – for contributions to grid computing
2001 Douglas C. Engelbart – for inventing the computer mouse
2000 Linus Torvalds – for creating the Linux kernel operating system
1998 Michael A. Jackson and Chris Burton – for program design and structured programming
See also
List of computer science awards
Ada Lovelace Award
References
External links
1998 establishments in the United Kingdom
Awards established in 1998
Computer |
https://en.wikipedia.org/wiki/Frederator%20Studios | Frederator Studios is an American animation television production studio which is a division of Frederator Networks, Inc. It was founded by Fred Seibert in 1997 with its first series launching in 1998. Seibert remained at the company until he resigned from Frederator in August 2020 after 22 years and on February 23, 2021 announced a new cartoon production company, FredFilms. The studio focuses primarily on artists who write their own shorts, series, and movies. Their slogan is "Original Cartoons since 1998." The studio has locations in New York City, where Frederator Digital is based, and Burbank, California.
History
1983–2012
Before Frederator, in 1983, Fred Seibert founded Fred/Alan, Inc. in New York City with his college friend Alan Goodman; in 1988, Fred/Alan partnered with Albie Hecht in Chauncey Street Productions to produce television programs for Nickelodeon, MTV, A&E, and CBS. The Fred/Alan firm closed down in 1992.
Seibert became the president of Hanna-Barbera Cartoons in 1992, and created What a Cartoon!, a showcase consisting of 48 shorts that aired on Cartoon Network. In 1996, when Time Warner merged with Turner Broadcasting (owner of Hanna-Barbera), he left the studio.
Frederator Incorporated was formed on January 6, 1997 (its first cartoons were released in 1998), and was housed at a temporary location of the Nickelodeon Animation Studio, in North Hollywood, California. Frederator's debut production was the cartoon short incubator, a television series called Oh Yeah! Cartoons, which later Slapstick second series: The Fairly OddParents (their first original series), as well ChalkZone, and My Life as a Teenage Robot, in addition to 51 original short cartoons by a group of creators including the first films by creators like Butch Hartman, Rob Renzetti, Tim Biskup, Larry Huber, Pat Ventura, Seth MacFarlane, and Carlos Ramos. Oh Yeah! Cartoons was based on Seibert's What a Cartoon! series of shorts from Hanna-Barbera Cartoons and Cartoon Network, which brought Hanna-Barbera its first hit series in 10 years, Dexter's Laboratory, Johnny Bravo, Cow and Chicken, I Am Weasel, The Powerpuff Girls, and Courage the Cowardly Dog. Frederator has produced a total of 16 television series, and over 200 miniseries, including webisodes. , the company was in a producing partnership with Sony Pictures Entertainment, and YouTube.
In 2002, Frederator created a joint venture for preschoolers named Bolder Media with producer Susan Miller's Mixed Media Group, Inc. and produced their first preschool series created by Bob Boyle for Nick Jr., Wow! Wow! Wubbzy!.
Frederator Studios created a television series and competition The Nicktoons Film Festival (now known as the Nicktoons Network Animation Festival) for the Nicktoons Network, which debuted October 24, 2004.
In 2004, David Karp interned at Frederator Studios at its first Manhattan location, and built their first blogging platform. In 2007, he launched Tumblr from a rented desk at Frederator Studio |
https://en.wikipedia.org/wiki/Eye%20Drops | Eye Drops is a television program on TechTV that showcased short computer animation movies and clips made using off the shelf 3D animation software. The show claimed to showcase all different types of animation, but only a very small number of shorts featured non-CG animation. Most animations are done completely by one person or by a small group of people.
Series episodes
Season one
Episode 1, aired May 16, 2002
It's Alive by Terry Ziegelman and Paul George
Episode 2, aired May 23, 2002
Bingo by Chris Landreth
Episode 3, aired May 30, 2002
Wild Card by Van Phan
Walk by Jeff Drew
Puppet by Anzovin Studio
Tung Fu by Gregory Lemons
F8 (part one) by Jason Wen
Airheads by Mike Wheeler
Serenade by Jason Judy, Paul Downs, and Michael Berger
Episode 4, aired June 6, 2002
Pasta for War by Zach Schlappi
Animation Lab: Rendering Transparent Materials by Henrik Wann Jensen
Ruby's Saloon by Kevin "Bubba" Lombardi
F8 (part two) by Jason Wen
Considering an Exotic Pet by Skye Carlson
The Battle Concerto for Two Ninjas by Scott Bazzle
Hello, Dolly! by Mariko Hoshi
Irresolve by Tim Benedict
When Wolfy Met Helga by Mookie Weisbrod
Episode 5, aired June 13, 2002
Fishman by Dan Bransfield
Animation Lab: Phimai Temple Tour by Dr. Richard Levy
Freeware by Alex Orrelle and Mike Kaczmarek
Sad Robot by Brian Frisk
Frank 'n' Beanz by David Poole
The Frogs and the Princess by Scott Jones
The Metronome Heart by James Ross
Episode 6, aired June 20, 2002
The Jumper
Episode 7, aired June 27, 2002
Sketch Modern by Chris McDonnel
The Poultry Paradox by Carlos Pedroza
A Ride in the Country by Pat Gehlen
Stick Figures by Animusic
Snobe Birds by Jeremy Gibb
When It's All That's Left by Aaron Halifax
Episode 8, aired July 6, 2002
In the Vault by Geoffrey Clark
The Return of Dracula by Pat Chan
Cerebrium by Bryan Kolupski
Jumpman Junior by Dairy Haas, Mark Yannitell, and Scott Yannitell
Emperor Blurgg by Keith Matz
Woody by Jason Tam
Puppeteer by Cheryl Sandgren
Episode 9, aired July 11, 2002
Skating Skip
Episode 10, aired July 18, 2002
Spotlight: Fiat Lux by Paul Debevec
Don Gato by Nicholas Smith
Mortal Skin: Leviathan by Dave Mansfield
Future Retro by Animusic
Understanding Chaos part two by Terrence Walker, owner of Studio ArtFX
From Alice in Wonderland by Lewis Carroll
Unfair Competition by Joshua Rutter
Episode 11, aired July 25, 2002
The Terrible Secret of Space by Jonathon Robinson
The Halls of Montezuma by Dan Bransfield
Ship of Dream by Kai Zhang
Groove Street by Robert Winfield
Token Life by David Donar
Gawumpi by David Poole
Abuela Perfecta's Gems by Efrain Rosario
This Old Mouse by Tav Shande
Stain X by Kevin "Bubba" Lombardi
Episode 12, aired August 1, 2002
Womb Wars by Tom Newby
Animation Lab: Vesuvius Had Spoken by Danic Dabic
The Funeral by Vic Cherubini
The Emperor's New Suit by Scott Winston
Mime in a Box by Eric Kunzendorf
Robokopf by Brian Frisk
Episode 13, aired August 8, 2002
The Daydr |
https://en.wikipedia.org/wiki/Maggie%27s%20Centres | Maggie's centres are a network of drop-in centres across the United Kingdom and Hong Kong, which aim to help anyone who has been affected by cancer. They are not intended as a replacement for conventional cancer therapy, but as a caring environment that can provide support, information and practical advice. They are located near, but are detached from, existing NHS hospitals.
The Scottish registered charity (registration number SC024414) which promotes, builds and runs the centres is formally named the Maggie Keswick Jencks Cancer Caring Trust, but refers to itself simply as Maggie's. It was founded by and named after the late Maggie Keswick Jencks, who died of cancer in 1995. Like her husband, architectural writer and critic Charles Jencks, she believed in the ability of buildings to uplift people. The buildings that house the centres have been designed by leading architects, including Frank Gehry, Zaha Hadid and Richard Rogers.
Patrons of the charity include Frank Gehry, Jon Snow, Kirsty Wark, and Sarah Brown, wife of former British prime minister Gordon Brown. The charity's chief executive officer is Laura Lee, who was Maggie's cancer nurse. The President of the charity is Camilla, Duchess of Cornwall.
Locations
Edinburgh
The first Maggie's Centre opened in Edinburgh in 1996, and is located within the Western General Hospital on Crewe Road. The centre is housed in a converted stable block. The conversion, designed by Richard Murphy, was nominated for the 1997 Stirling Prize. The centre was extended, again by Murphy, in 1999.
Glasgow
Glasgow's first Maggie's Centre opened in 2002 and was located at the Western Infirmary on Dumbarton Road, near the Kelvingrove Museum. The centre was housed in a former gatehouse lodge of the University of Glasgow, renovated and altered by Page\Park Architects. Charles Jencks designed the landscaping around the site, and contributed a DNA sculpture for the garden. In 2011 a new facility opened at Gartnavel, having been designed by OMA, led by Dutch architect Rem Koolhaas and Ellen van Loon.
Dundee
Frank Gehry's first building in the United Kingdom was the Maggie's Centre at Dundee. The centre opened in September 2003 at Ninewells Hospital. Gehry's design was named "Building of the Year" by the Royal Fine Art Commission for Scotland, and was also nominated for the 2004 RIAS Andrew Doolan Award for Architecture.
Highlands
The Maggie's Centre in Inverness, Highland, is at Raigmore Hospital, and was designed by David Page of Page\Park Architects. Landscape design and sculptures were again the work of Charles Jencks. The building opened in 2005, and won the 2006 RIAS Andrew Doolan Award for Architecture.
Fife
The Maggie's Centre in Kirkcaldy, Fife, opened in November 2006 at the Victoria Hospital. The building was designed by Zaha Hadid, and is her first built work in the UK. In the building there is emphasis placed on the transition between the natural and the man-made, and on the period between the hos |
https://en.wikipedia.org/wiki/Bill%20English%20%28computer%20engineer%29 | William Kirk English (January 27, 1929July 26, 2020) was an American computer engineer who contributed to the development of the computer mouse while working for Douglas Engelbart at SRI International's Augmentation Research Center. He would later work for Xerox PARC and Sun Microsystems.
Early life
English was born on January 27, 1929, in Lexington, Kentucky. The only son of Harry English and Caroline (Gray) English, he had two half-brothers from his father's previous marriage. Harry English was an electrical engineer who managed coal mines and Caroline was a homemaker. William, or Bill as he was known, attended a boarding school in Arizona and then studied electrical engineering at the University of Kentucky.
Career
English served in the US Navy until the late 1950s, including postings in northern California and Japan. He then joined the Stanford Research Institute in the 1960s to work on magnets, and built one of the first all-magnetic arithmetic units with Hewitt Crane. In 1964, he was the first person to join Douglas Engelbart's lab, the Augmentation Research Center.
He and Douglas Engelbart share credit for creating the first computer mouse in 1963; English built the initial prototype, and was its first user, based on Engelbart's notes. English led a 1965 project, sponsored by NASA, which evaluated the best way to select a point on a computer display; the mouse was the winner. English was also instrumental at The Mother of All Demos in 1968, which showcased the mouse and other technologies developed as part of their NLS (oN-Line System). In particular, English figured out how to connect a terminal in the San Francisco Civic Auditorium to the host computer at SRI away, and also transmitted audio and video between the locations.
He left SRI in 1971 and went to Xerox PARC, where he managed the Office Systems Research Group. While working at PARC, English developed a ball mouse, in which a ball replaced the original set of wheels. It worked similarly to a moveable ball-based mouse device called Rollkugel, which had been developed by Telefunken, Germany, and was offered since 1968 as input device for their computers.
In 1989, he went to work for Sun Microsystems on internationalization efforts.
English died of respiratory failure in San Rafael, California, on July 26, 2020, aged 91.
References
1929 births
2020 deaths
Computer hardware engineers
20th-century American engineers
21st-century American engineers
Place of birth missing
SRI International people
Scientists at PARC (company)
People from Lexington, Kentucky
Scientists from Kentucky |
https://en.wikipedia.org/wiki/OpenSolaris | OpenSolaris () is a discontinued open-source computer operating system based on Solaris and created by Sun Microsystems. It was also, perhaps confusingly, the name of a project initiated by Sun to build a developer and user community around the eponymous operating system software.
OpenSolaris is a descendant of the UNIX System V Release 4 (SVR4) code base developed by Sun and AT&T in the late 1980s and is the only version of the System V variant of UNIX available as open source. OpenSolaris was developed as a combination of several software consolidations that were open sourced starting with Solaris 10. It includes a variety of free software, including popular desktop and server software.
After Oracle’s acquisition of Sun Microsystems in 2010, Oracle discontinued development of OpenSolaris in house, pivoting to focus exclusively on the development of the proprietary Solaris Express (now Oracle Solaris).
Prior to Oracle's close-sourcing Solaris, a group of former OpenSolaris developers began efforts to fork the core software under the name OpenIndiana. The illumos Foundation, founded in the wake of the discontinuation of OpenSolaris, continues to develop and maintain the kernel and userland of OpenIndiana (together renamed “illumos”), while the OpenIndiana Project (now under the auspices of the illumos Foundation) continues to maintain and develop the illumos-based OpenIndiana distribution (including its installer and build system) as the direct descendant of OpenIndiana. Since then additional illumos distributions, both commercial and non-commercial, have appeared and are under active development, combining the illumos kernel and userland with custom installers, packaging and build systems, and other distribution-specific utilities and tooling.
History
OpenSolaris was based on Solaris, which was originally released by Sun in 1991. Solaris is a version of UNIX System V Release 4 (SVR4), jointly developed by Sun and AT&T to merge features from several existing Unix systems. It was licensed by Sun from Novell to replace SunOS.
Planning for OpenSolaris started in early 2004. A pilot program was formed in September 2004 with 18 non-Sun community members and ran for 9 months growing to 145 external participants. Sun submitted the CDDL (Common Development and Distribution License) to the OSI, which approved it on January 14, 2005.
The first part of the Solaris code base to be open-sourced was the Solaris Dynamic Tracing facility (commonly known as DTrace), a tool that aids in the analysis, debugging, and tuning of applications and systems. DTrace was released under the CDDL on January 25, 2005, on the newly launched opensolaris.org website. The bulk of the Solaris system code was released on June 14, 2005. There remains some system code that is not open source and is available only as pre-compiled binary files.
To direct the newly fledged project, a Community Advisory Board was announced on April 4, 2005: two were elected by the pilot commu |
https://en.wikipedia.org/wiki/Hofstad%20Network | The Hofstad Network was an Islamist terror group composed mostly of Dutch citizens. The terror group was composed mainly of young men between the ages of 18 and 32. The name "Hofstad" was originally the codename the Dutch secret service AIVD used for the network and leaked to the media. The name likely refers to the nickname of the city of The Hague, where some of the suspected terrorists lived. The network was active throughout the 2000s.
The group was made up of Muslim immigrants living in the Netherlands, and second and third generation immigrants to the Netherlands, and Dutch converts. The majority of these immigrants came from Morocco.
The network was said to have links to networks in Spain and Belgium. Among their contacts was Abdeladim Akoudad, also known as Naoufel, one of the suspects of the 2003 Casablanca bombings. The group was influenced by the ideology of Takfir wal-Hijra, a militant offshoot of the Egyptian Muslim Brotherhood. Redouan al-Issar, also known as "The Syrian", was the suspected spiritual leader of the group. Most media attention was attracted by Mohammed Bouyeri, sentenced to life imprisonment for murdering film director Theo van Gogh in 2004 and by Samir Azzouz, suspected of planning terrorist attacks on the Dutch parliament and several strategic targets such as the national airport and a nuclear reactor. The group was also suspected of planning to kill several members of government and parliament.
History
In 2002, the Hofstad group were discovered by the Dutch General Intelligence and Security Service (AIVD). The intelligence gathered in the first years after the group was discovered was limited, revealing that the group had only been meeting together. These were informal living-room meetings held by a Syrian asylum-seeker. By the end of 2002, the AIVD began to suspect that the organization was developing extremist views and discussing mass casualty events.
On 14 October 2003, Samir Azzouz, Ismail Akhnikh, Jason Walters and Redouan al-Issar were put under arrest for planning a (according to the AIVD) "terrorist attack in the Netherlands", but were released soon after. Azzouz was eventually tried in this case, but acquitted for lack of evidence in 2005: he did possess what he thought to be a home-made bomb, but having used the wrong type of fertilizer, the device would never have exploded.
At the beginning of 2003, a Hofstad member and his friend tried to join an Islamic rebel group in Chechnya, but were discovered by authorities and arrested. During the summer, two Hofstad group members traveled to Pakistan where they received paramilitary training. In September, the two men returned and it was discovered by authorities that these same men could be traced to having talked to a man having ties to the Casablanca bombings earlier that year. On 14 October of that year, the Spanish authorities arrested a Moroccan man who was suspected to be involved in suspicious activity. Police in the Netherlands arrested five Hofst |
https://en.wikipedia.org/wiki/6600 | 6600 may refer to:
CDC 6600, a mainframe computer from Control Data Corporation, first manufactured in 1965
Nokia 6600, a Nokia smartphone released in 2003
Nokia 6600 fold, a Nokia mobile phone released in 2008
Nokia 6600 slide, a Nokia mobile phone released in 2008
, an Nvidia graphics card
Compaq Presario 6600 Desktop PC (HP) computers
Audiovox Audiovox ppc6600, a powerpc based pda/cellphone
The year in the 7th millennium |
https://en.wikipedia.org/wiki/IronPython | IronPython is an implementation of the Python programming language targeting the .NET Framework and Mono. The project is currently maintained by a group of volunteers at GitHub. It is free and open-source software, and can be implemented with Python Tools for Visual Studio, which is a free and open-source extension for Microsoft's Visual Studio IDE.
IronPython is written entirely in C#, although some of its code is automatically generated by a code generator written in Python.
IronPython is implemented on top of the Dynamic Language Runtime (DLR), a library running on top of the Common Language Infrastructure that provides dynamic typing and dynamic method dispatch, among other things, for dynamic languages. The DLR is part of the .NET Framework 4.0 and is also a part of Mono since version 2.4 from 2009. The DLR can also be used as a library on older CLI implementations.
Status and roadmap
Jim Hugunin created the project and actively contributed to it up until Version 1.0 which was released on September 5, 2006. IronPython 2.0 was released on December 10, 2008. After version 1.0 it was maintained by a small team at Microsoft until the 2.7 Beta 1 release. Microsoft abandoned IronPython (and its sister project IronRuby) in late 2010, after which Hugunin left to work at Google. The project is currently maintained by a group of volunteers at GitHub.
Release 2.0, released on December 10, 2008, and updated as 2.0.3 on October 23, 2009, targets CPython 2.5. IronPython 2.0.3 is only compatible up to .NET Framework 3.5.
Release 2.6, released on December 11, 2009, and updated on April 12, 2010, targets CPython 2.6. IronPython 2.6.1 versions is binary compatible only with .NET Framework 4.0. IronPython 2.6.1 must be compiled from sources to run on .NET Framework 3.5. IronPython 2.6.2, released on October 21, 2010, is binary compatible with both .NET Framework 4.0 and .NET Framework 3.5.
Release 2.7 was released on March 12, 2011 and it targets CPython 2.7.
Release 2.7.1 was released on October 21, 2011 and it targets CPython 2.7.
Release 2.7.2.1 was released on March 13, 2012. It enables support for ZIP file format libraries, SQLite, and compiled executables.
Release 2.7.4 was released on September 7, 2013.
Release 2.7.5 was released on December 6, 2014 and mostly consists of bug fixes.
Release 2.7.6 was released on August 21, 2016 and only consists of bug fixes.
Release 2.7.7 was released on December 7, 2016 and only consists of bug fixes.
Release 2.7.8 was released on February 16, 2018 and consists of bug fixes, reorganized code, and an updated test infrastructure (including significant testing on Linux under Mono). It is also the first release to support .NET Core.
Release 2.7.9 was released on October 9, 2018 and consists of bug fixes, reorganized code. It is intended to be the last release before IronPython 3.
Release 2.7.10 was released on April 27, 2020 and adds .NET Core 3.1 support.
Release 2.7.11 was released on November 17, 202 |
https://en.wikipedia.org/wiki/Memory%20buffer%20register | A memory buffer register (MBR) or memory data register (MDR) is the register in a computer's CPU that stores the data being transferred to and from the immediate access storage. It contains a copy of the value in the memory location specified by the memory address register. It acts as a buffer, allowing the processor and memory units to act independently without being affected by minor differences in operation. A data item will be copied to the MBR ready for use at the next clock cycle, when it can be either used by the processor for reading or writing, or stored in main memory after being written.
This register holds the contents of the memory which are to be transferred from memory to other components or vice versa. A word to be stored must be transferred to the MBR, from where it goes to the specific memory location, and the arithmetic data to be processed in the ALU first goes to MBR and then to accumulated register, and then it is processed in the ALU.
The MDR is a two-way register. When data is fetched from memory and placed into the MDR, it is written to go in one direction. When there is a write instruction, the data to be written is placed into the MDR from another CPU register, which then puts the data into memory.
The memory data register is half of a minimal interface between a microprogram and computer storage; the other half is a memory address register (MAR).
Digital registers |
https://en.wikipedia.org/wiki/British%20Rail%20Classes%20316%20and%20457 | Class 316 and Class 457 were TOPS classifications assigned to a single electric multiple unit (EMU) at different stages of its use as a prototype for the Networker series.
Project
In the late 1980s, the Network SouthEast division of British Rail, which operated the railway network in South East England, started to develop a new standard train, known as the Networker. To test out the technical arrangements for the Networker, a test train was used, converted from former Class 210 carriages, which were built in 1982 by Derby Litchurch Lane Works as prototype 'Second Generation' Diesel Electric Multiple Unit (DEMU), but were withdrawn after a few years.
Class 457
Initially the test unit was formed for trials on the system of the Southern Region, and was numbered 457001. As with all Southern Region electric multiple units only the last four digits of the unit number were actually carried.
The unit formation was:
Class 316
Later, the unit was altered to undertake trials on the overhead line system used on electrified lines north of the River Thames. The unit was renumbered as a Class 316 unit, number 316999. To enable it to work on the AC electrification, a pantograph trailer from a Class 313 unit 313034 was inserted into the set, replacing one of the intermediate trailers. This spare vehicle (no. 67400) has since been incorporated into a Class 455/9 DC suburban unit, replacing a damaged Trailer Second Open (TSO) vehicle.
The unit formation was:
Preservation
After the AC trials were complete, the set was returned to the Southern Region for storage, minus the Class 313 trailer, which returned to its previous formation. The two driving cars were preserved at the Electric Railway Museum, Warwickshire, one being resold to the Eversholt Rail Group and inserted into set 455913 in 2013 after being rebuilt at Wolverton railway works to replace a carriage destroyed in an accident. The vehicle (67301) was converted to a 455 MSO. The remaining intermediate trailer was scrapped.
Vehicle details are shown below:
Alternative uses of the Class 316 number
Class 316 was originally reserved in the British Rail Fleet List for an AC EMU for the Piccadilly to Victoria (Picc-Vic) underground line proposed for Manchester in the 1970s. The specifications and some outline design proposals for the new fleet was prepared at the Railway Technical Centre but never proceeded to tender with the project cancelled.
The Class 316 designation was also used in 1992 for a three car Class 307 EMU used as a testbed unit for new traction equipment.
References
457
457
Train-related introductions in 1989
Train-related introductions in 1990 |
https://en.wikipedia.org/wiki/The%20Weather%20Network | The Weather Network (TWN) is a Canadian English-language discretionary weather information specialty channel available in Canada, the United States and the United Kingdom. It delivers weather information on television, digital platforms (responsive websites, mobile and tablet applications) and TV apps.
The company is owned by Pelmorex Media which is headquartered in Mississauga, Ontario, Canada.
Their specialty television networks are among the most widely distributed and frequently consulted television networks in Canada. TheWeatherNetwork.com is among Canada's leading web services, and their mobile web property is ranked #1 in the weather category and the second largest mobile website in Canada.
TWN was launched on September 1, 1988 as WeatherNow by Lavalin Inc. and Landmark Communications, the owner of The Weather Channel and renamed to its present name on May 1, 1989. With ownership changes over the years, Pelmorex acquired TWC's stake in 2015.
The network offers regional feeds for Alberta, Toronto, Atlantic Canada and British Columbia. It also operates counterpart brands including MétéoMédia; Canadian, Eltiempo Spain, Wetter Plus Germany, and Clima Latin America.
History
The Weather Network was licensed by the Canadian Radio-television and Telecommunications Commission on December 1, 1987 and began broadcasting on September 1, 1988 (six years after the U.S. Weather Channel) as WeatherNow, under the ownership of engineering firm Lavalin Inc. (now known as SNC-Lavalin) and Landmark Communications. The channel gained its present name on May 1, 1989. In the early years, TWN, and its sister channel, MétéoMédia, shared a single television feed via analogue transponder on one of the Anik satellites, with computer-generated local forecasts airing on one while the video feed of a live forecaster or commercials aired on the other. At first the video section was only available during drive times on weekdays and half of the day on weekends; at other times local forecast was looped. The two services began to run separately starting in 1994, while both were still based in Montreal. Local forecasts were generated using the same systems owned by The Weather Channel in the U.S. called WeatherStar. TWN began using its own system called PMX in 1996, which is still in use today. Pelmorex purchased The Weather Network from SNC-Lavalin in 1993, two years after the merger of SNC and Lavalin. The channel launched its website in 1996.
Throughout the 1990s and early 2000s, The Weather Network's broadcasts were divided into different programming blocks. One of the most notable was "EarthWatch", which originally began as a five-minute news segment discussing environmental and weather-related issues. The show had expanded as a nighttime programming block in the mid-1990s, and the news segment later spun off as the current "WeatherWatch" segment. Other programming blocks included the "Morning Report", focusing on Eastern Canada in the mornings; "Sea to Sea", focu |
https://en.wikipedia.org/wiki/ELAN%20%28programming%20language%29 | ELAN is an interpreted educational programming language for learning and teaching systematic programming.
It was developed in 1974 by C.H.A. Koster and a group at the Technical University of Berlin as an alternative to BASIC in teaching, and approved for use in secondary schools in Germany by the "Arbeitskreis Schulsprache". It was in use until the late 1980s in a number of schools in Germany, Belgium, the Netherlands, and Hungary for informatics teaching in secondary education, and used at the Radboud University Nijmegen in the Netherlands for teaching systematic programming to students from various disciplines and in teacher courses.
The language design focuses strongly on structured programming, and has a special construction for stepwise refinement, allowing students to focus on top-down design, and bottom-up coding.
The microkernel operating system Eumel began as a runtime system (environment) for ELAN.
See also
ALGOL 68
External links
ELAN implementation built by the Radboud University Nijmegen
ELAN implementation download site
Dresden uni on ELAN
Educational programming languages
Algol programming language family
Computer-related introductions in 1974
Procedural programming languages
Programming languages created in 1974
Programming languages |
https://en.wikipedia.org/wiki/ESN | ESN may refer to:
Eastern Security Network, the armed wing of the Indigenous People of Biafra (IPOB)
Easton Airport (Maryland), United States
Echo state network in computer science
Edmonton Street News, a Canadian newspaper
Einstein summation notation, used in mathematical physics
Electronic serial number for mobile devices
Emergency Services Network, in the UK
Entertainment Studios Networks, an American cable network
Erasmus Student Network, a European student organization
European Sensory Network, studies the five senses
European Society for Neurochemistry
Salvadoran Sign Language |
https://en.wikipedia.org/wiki/Millennium%20Bureau%20of%20Canada | Millennium Bureau of Canada was a small, temporary agency of the Government of Canada, to celebrate the "millennium" during the year 2000.
The Weather Network and MétéoMédia served as partners with the agency, as the official promoters of related activities across Canada.
The 665 projects carried out by the Millennium Bureau include:
Tall Ships in Halifax, Nova Scotia
Relay 2000 of the Trans Canada Trail in Hull, Quebec on September 9, 2000
Literacy Builders
Canada Remembers 2000
Pacific Grace Replica Schooner
Meewasin Valley Trail System
Canada Dance Festival
Fisheries Museum of the Atlantic Millennium Exhibit
The Islendingur: A Timeless Adventure in L'Anse aux Meadows, Newfoundland
The CMPP received more than 10,000 applications representing more than $1.9 billion in financial assistance for millennium projects. Since it was launched in 1998, the CMPP approved 1,745 projects representing just over $149 million in funding.
Turn of the third millennium |
https://en.wikipedia.org/wiki/2003%E2%80%9304%20United%20States%20network%20television%20schedule | The following is the 2003–04 network television schedule for the six major English language commercial broadcast networks in the United States. The schedule covers primetime hours from September 2003 through June 2004. The schedule is followed by a list per network of returning series, new series, and series cancelled after the 2002–03 season. All times are Eastern and Pacific, with certain exceptions, such as Monday Night Football.
New series are highlighted in bold.
Each of the 30 highest-rated shows is listed with its rank and rating as determined by Nielsen Media Research.
Yellow indicates the programs in the top 10 for the season.
Cyan indicates the programs in the top 20 for the season.
Magenta indicates the programs in the top 30 for the season.
Other Legend
Light blue indicates local programming.
Gray indicates encore programming.
Blue-gray indicates news programming.
Light green indicates sporting events.
Light Purple indicates movies.
Red indicates series being burned off and other scheduled programs, including specials.
PBS is not included; member stations have local flexibility over most of their schedules and broadcast times for network shows may vary.
The 2003–2004 season marked the final time that the major networks scheduled substantial original scripted drama series on Saturdays. After years of declining ratings on that particular evening, beginning with the 2004–2005 season the networks ceased scheduling original dramas on Saturdays, choosing instead to fill the schedule with non-fiction programming and reruns.
From August 13 to 29, 2004, all of NBC's primetime programming was preempted in favor of coverage of the 2004 Summer Olympics.
Sunday
NOTE: On Fox, The Ortegas was supposed to air at 8:30-9, but it was cancelled.
Monday
Tuesday
{| class="wikitable" style="width:100%;margin-right:0;text-align:center"
|-
! colspan="2" style="background-color:#C0C0C0;text-align:center"| Network
! style="background-color:#C0C0C0;text-align:center"| 8:00 PM
! style="background-color:#C0C0C0;text-align:center"| 8:30 PM
! style="background-color:#C0C0C0;text-align:center"| 9:00 PM
! style="background-color:#C0C0C0;text-align:center"| 9:30 PM
! style="background-color:#C0C0C0;text-align:center"| 10:00 PM
! style="background-color:#C0C0C0;text-align:center"| 10:30 PM
|-
!rowspan="7"|ABC
! Fall
|rowspan="6"|8 Simple Rules
|rowspan="6"|I'm with Her
|rowspan="7"|According to Jim
|rowspan="3"|Less than Perfect
|colspan="2"|NYPD Blue
|-
! Winter
|colspan="2"|Line of Fire
|-
! Follow Up
|colspan="2" rowspan="3"|NYPD Blue
|-
! Spring
| It's All Relative
|-
! Follow Up
|rowspan="3"|Less than Perfect
|-
! Summer
|colspan="2"|NYPD 24/7
|-
! Mid-Summer
|colspan="2"|Extreme Makeover: Home Edition
|colspan="2"|In the Jury Room
|-
!rowspan="4"|CBS
!Fall
|bgcolor="#FF66FF" rowspan="4" colspan="2"|Navy: NCIS (#23/7.8)(Tied with The West Wing and the CBS Sunday Movie)
|colspan="2"|The Guardian
|bgcolor="#FF66FF" rowspan="3" colspan="2"|Judgin |
https://en.wikipedia.org/wiki/Premier%20Radio | Premier Radio may refer to:
Premier Christian Radio, a radio network in the United Kingdom which broadcasts Christian programming
Premiere Radio Networks, a radio network in the United States which syndicates talk and other programming to radio stations |
https://en.wikipedia.org/wiki/Addison-Wesley | Addison–Wesley is an American publisher of textbooks and computer literature. It is an imprint of Pearson plc, a global publishing and education company. In addition to publishing books, Addison–Wesley also distributes its technical titles through the O'Reilly Online Learning e-reference service. Addison–Wesley's majority of sales derive from the United States (55%) and Europe (22%).
The Addison–Wesley Professional Imprint produces content including books, eBooks, and video for the professional IT worker including developers, programmers, managers, system administrators. Classic titles include The Art of Computer Programming, The C++ Programming Language, The Mythical Man-Month, and Design Patterns.
History
Lew Addison Cummings and Melbourne Wesley Cummings founded Addison–Wesley in 1942, with the first book published by Addison–Wesley being Massachusetts Institute of Technology professor Francis Weston Sears' Mechanics.
Its first computer book was Programs for an Electronic Digital Computer, by Wilkes, Wheeler, and Gill. In 1977, Addison–Wesley acquired W. A. Benjamin Company, and merged it with the Cummings division of the company to form Benjamin Cummings. It was purchased by the global publishing and education company Pearson PLC in 1988 and became part of Addison Wesley Longman in 1994. The trade publishing division of Addison–Wesley was sold to Perseus Books Group in 1997, leaving Addison–Wesley as solely an educational publisher. Pearson acquired the educational division of Simon & Schuster in 1998, and merged it with Addison Wesley Longman to form Pearson Education and subsequently rebranded to Pearson in 2011. Pearson moved the former Addison Wesley Longman offices from Reading, Massachusetts, to Boston in 2004. Its current executives hail from the original Addison–Wesley with a storied history of their own.
Notable books
Addison–Wesley Secondary Math: An Integrated Approach: Focus on Algebra
The Art of Computer Programming by Donald Knuth
The Feynman Lectures on Physics by Richard Feynman, Robert B. Leighton, and Matthew Sands
Concrete Mathematics: A Foundation For Computer Science by Ronald Graham, Donald Knuth, and Oren Patashnik
Evolutionary Biology by Dr. Eli C. Minkoff
Programming Pearls by Jon Bentley
Design Patterns: Elements of Reusable Object-Oriented Software by Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides
The C++ Programming Language by Bjarne Stroustrup
Hacker's Delight by Henry S. Warren, Jr.
Exploratory Data Analysis (see) by John W. Tukey, based on a course taught at Princeton.
The Mythical Man-Month by Fred P. Brooks. Jr.
Advanced Programming in the UNIX Environment and TCP/IP Illustrated by W. Richard Stevens
Iron John: A Book About Men by Robert Bly
Theory Z by William G. Ouchi
The Nature of Prejudice by Gordon W. Allport
Former imprints
Merloyd Lawrence Books
References
External links
Official site (education)
Official site (professional)
Official site (Germany)
Companie |
https://en.wikipedia.org/wiki/Itoh%E2%80%93Tsujii%20inversion%20algorithm | The Itoh–Tsujii inversion algorithm is used to invert elements in a finite field. It was introduced in 1988, first over GF(2m) using the normal basis representation of elements, however, the algorithm is generic and can be used for other bases, such as the polynomial basis. It can also be used in any finite field GF(pm).
The algorithm is as follows:
Input: A ∈ GF(pm)
Output: A−1
r ← (pm − 1)/(p − 1)
compute Ar−1 in GF(pm)
compute Ar = Ar−1 · A
compute (Ar)−1 in GF(p)
compute A−1 = (Ar)−1 · Ar−1
return A−1
This algorithm is fast because steps 3 and 5 both involve operations in the subfield GF(p). Similarly, if a small value of p is used, a lookup table can be used for inversion in step 4. The majority of time spent in this algorithm is in step 2, the first exponentiation. This is one reason why this algorithm is well suited for the normal basis, since squaring and exponentiation are relatively easy in that basis.
See also
Finite field arithmetic
References
T. Itoh and S. Tsujii. A Fast Algorithm for Computing Multiplicative Inverses in GF(2m) Using Normal Bases. Information and Computation, 78:171–177, 1988.
Finite fields
Computational number theory |
https://en.wikipedia.org/wiki/ISO/IEC%208652 | ISO/IEC 8652 Information technology — Programming languages — Ada is the international standard for the computer programming language Ada. It was produced by the Ada Working Group, ISO/IEC JTC1/SC22/WG 9, of the International Organization for Standardization (ISO) and the International Electrotechnical Commission (IEC).
The latest edition is ISO/IEC 8652:2012, published 2012-12-10. The text of the earlier 1995 version of the standard, with Technical Corrigendum 1 and Amendment 1, is freely available for download and online reading.
References
External links
JTC1/SC22/WG9 home page
Ada (programming language)
08652 |
https://en.wikipedia.org/wiki/Data%20control%20language | A data control language (DCL) is a syntax similar to a computer programming language used to control access to data stored in a database (authorization). In particular, it is a component of Structured Query Language (SQL). Data Control Language is one of the logical group in SQL Commands. SQL is the standard language for relational database management systems. SQL statements are used to perform tasks such as insert data to a database, delete or update data in a database, or retrieve data from a database.
Though database systems use SQL, they also have their own additional proprietary extensions that are usually only used on their system. For Example Microsoft SQL server uses Transact-SQL (T-SQL) which is an extension of SQL. Similarly Oracle uses PL-SQL which is their proprietary extension for them only. However, the standard SQL commands such as "Select", "Insert", "Update", "Delete", "Create", and "Drop" can be used to accomplish almost everything that one needs to do with a database.
Examples of DCL commands include:
GRANT to allow specified users to perform specified tasks.
REVOKE to remove the user accessibility to database object.
The operations for which privileges may be granted to or revoked from a user or role apply to both the Data definition language (DDL) and the Data manipulation language (DML), and may include CONNECT, SELECT, INSERT, UPDATE, DELETE, EXECUTE, and USAGE.
Microsoft SQL Server
As per Microsoft SQL Server there are four groups of SQL Commands.
Data Manipulation Language (DML)
Data Definition Language (DDL)
Data Control Language (DCL)
Transaction Control Language (TCL)
DCL commands are used for access control and permission management for users in the database. With them we can easily allow or deny some actions for users on the tables or records (row level security).
DCL commands are:
GRANT We can give certain permissions for the table (and other objects) for specified groups/users of a database.
DENY bans certain permissions from groups/users.
REVOKE this command takes away permissions from groups/users.
For example: GRANT can be used to give privileges to user to do SELECT, INSERT, UPDATE and DELETE on a specific table or multiple tables.
The REVOKE command is used take back a privilege (default) or revoking specific command like UPDATE or DELETE based on requirements.
Example
GRANT in first case we gave privileges to user User1 to do SELECT, INSERT, UPDATE and DELETE on the table called employees.
REVOKE with this command we can take back privilege to default one, in this case, we take back command INSERT on the table employees for user User1.
DENY is a specific command. We can conclude that every user has a list of privilege which is denied or granted so command DENY is there to explicitly ban you some privileges on the database objects.:
Oracle Database
Oracle Database divide SQL commands to different types. They are.
Data Definition Language (DDL) Statements
Data Manipulation Language ( |
https://en.wikipedia.org/wiki/Expensive%20Typewriter | Expensive Typewriter was a pioneering text editor program that ran on the DEC PDP-1 computer which had been delivered to MIT in the early 1960s.
Description
Since the program could drive an IBM Selectric typewriter (a letter-quality printer), it may be considered the first word processing software. It was written and improved between 1961 and 1962 by Steve Piner and L. Peter Deutsch. In the spirit of an earlier editor program, named "Colossal Typewriter", it was called "Expensive Typewriter" because at that time the PDP-1 cost a lot of money (approximately ) as compared to a conventional manual typewriter.
References
See also
PDP-1
Expensive Desk Calculator
Expensive Planetarium
Expensive Tape Recorder
Text Editor and Corrector
RUNOFF
TJ-2
Word processors
History of software |
https://en.wikipedia.org/wiki/Overlapping%20subproblems | In computer science, a problem is said to have overlapping subproblems if the problem can be broken down into subproblems which are reused several times or a recursive algorithm for the problem solves the same subproblem over and over rather than always generating new subproblems.
For example, the problem of computing the Fibonacci sequence exhibits overlapping subproblems. The problem of computing the nth Fibonacci number F(n), can be broken down into the subproblems of computing F(n − 1) and F(n − 2), and then adding the two. The subproblem of computing F(n − 1) can itself be broken down into a subproblem that involves computing F(n − 2). Therefore, the computation of F(n − 2) is reused, and the Fibonacci sequence thus exhibits overlapping subproblems.
A naive recursive approach to such a problem generally fails due to an exponential complexity. If the problem also shares an optimal substructure property, dynamic programming is a good way to work it out.
Fibonacci sequence example in C
Consider the following C code:
#include <stdio.h>
#define N 5
static int fibMem[N];
int fibonacci(int n) {
int r = 1;
if (n > 2) {
r = fibonacci(n - 1) + fibonacci(n - 2);
}
fibMem[n - 1] = r;
return r;
}
void printFibonacci() {
int i;
for (i = 1; i <= N; i++) {
printf("fibonacci(%d): %d\n", i, fibMem[i - 1]);
}
}
int main(void) {
fibonacci(N);
printFibonacci();
return 0;
}
/* Output:
fibonacci(1): 1
fibonacci(2): 1
fibonacci(3): 2
fibonacci(4): 3
fibonacci(5): 5 */
When executed, the fibonacci function computes the value of some of the numbers in the sequence many times over, following a pattern which can be visualized by this diagram:
f(5) = f(4) + f(3) = 5
| |
| f(3) = f(2) + f(1) = 2
| | |
| | f(1) = 1
| |
| f(2) = 1
|
f(4) = f(3) + f(2) = 3
| |
| f(2) = 1
|
f(3) = f(2) + f(1) = 2
| |
| f(1) = 1
|
f(2) = 1
However, we can take advantage of memoization and change the fibonacci function to make use of fibMem like so:
int fibonacci(int n) {
int r = 1;
if (fibMem[n - 1] != 0) {
r = fibMem[n - 1];
} else {
if (n > 2) {
r = fibonacci(n - 1) + fibonacci(n - 2);
}
fibMem[n - 1] = r;
}
return r;
}
This is much more efficient because if the value r has already been calculated for a certain n and stored in fibMem[n - 1], the function can just return the stored value rather than making more recursive function calls. This results in a pattern which can be visualized by this diagram:
f(5) = f(4) + f(3) = 5
| |
f(4) = f(3) + f(2) = 3
| |
f(3) = f(2) + f(1) = 2
| |
| f(1) = 1
|
|
https://en.wikipedia.org/wiki/CLC | CLC may refer to:
Religion
Christian Life Centre, a number of individual and networked Pentecostal churches in Australia
Christian Life Community, an international association of lay Christians
Church of the Lutheran Confession, an American Lutheran denomination
CLC International, an international Christian literature mission committed to the distribution of the Bible
Concordia Lutheran Conference, a group of Lutheran churches
Schools
Cheltenham Ladies' College, an independent boarding and day school for girls in Cheltenham, United Kingdom.
College of Lake County, a community college in Grayslake, Illinois
Contemporary Learning Center, an alternative school district-operated school in Houston, Texas
Crystal Lake Central High School, a high school in Crystal Lake, Illinois
Science
CLC (gene), Charcot-Leyden crystal protein, gene for a human enzyme
CLC bio, a bioinformatics software company headquartered in Denmark
Chemical looping combustion
Chinese Library Classification
Transportation
Canadian Locomotive Company
Columbia and Cowlitz Railway
Cheshire Lines Committee, a railway in Great Britain
Clear Lake City STOLport, IATA code for the defunct airport formerly located in southeast Houston
Mercedes-Benz CLC-Class
Other
Campaign Legal Center, a U.S. nonprofit working to advance voting rights and transparent democratic processes
Cambodian Labour Confederation, a Cambodian national trade union centre
Cambridge Latin Course, a secondary school Latin programme
Canada Lands Company, a Canadian Crown corporation
Canadian Labour Congress, a Canadian national trade union centre
Canadian Location Code, for forecast regions
Central Land Council, an Indigenous land council in Northern Territory, Australia
CLC (group), a South Korean girl group
Collegiate Licensing Company
Combat Logistics Company, units within the United States Marine Corps
Community legal centres, independent not for profit organisations in Australia
Crazy, Lovely, Cool, Nigerian movie
Croatian Language Corpus, a text corpus of Croatian compiled at the Institute of Croatian Language and Linguistics
International Convention on Civil Liability for Oil Pollution Damage, an international maritime treaty |
https://en.wikipedia.org/wiki/Giselle%20Fern%C3%A1ndez | Giselle Fernández (born May 15, 1961) is an American television journalist and anchor for Spectrum News 1. Her appearances on network television include reporting and guest anchoring for CBS Early Show, CBS Evening News, Today, and NBC Nightly News, regular host for Access Hollywood, and contestant on Dancing with the Stars.
Early life and education
Fernández was born in Mexico City and was brought to East Los Angeles in the United States at the age of four. Her Catholic father was a flamenco dancer, while her Jewish mother was a student of Mexican folklore. She attended California State University, Sacramento, where she graduated in 1982 earning her B.A. in Journalism and Government.
Career
Her television career began in 1983 with brief stops at KRDO-TV in Colorado Springs, Colorado, and then KEYT-TV in Santa Barbara, California. In 1985 she joined KTLA in Los Angeles as a reporter and weekend anchor. She was recommended to KTLA by actor Fess Parker, who lived in the Santa Barbara area and was a friend of KTLA's news managing director at the time. Two years later Fernandez moved to CBS-owned WBBM-TV in Chicago, and in 1989 to WCIX CBS's newly owned station in Miami. In 1988 she garnered some controversy in Chicago when she went boating with John Cappas, a drug dealer being sought by authorities, then accompanied him to his arrest by federal agents.
She gained her first national news job in October 1991 for CBS News, when she moved to New York City and became a correspondent and back-up anchor for the morning, evening, and weekend news broadcasts. She later moved to NBC, where she anchored Weekend Today and the Sunday edition of NBC Nightly News, and filled in for Brian Williams on the Saturday edition, and undertook various special reporting assignments in the U.S. and elsewhere. During this period of national news coverage, Fernández reported on the crisis from Cuban immigration, unrest in Haiti, the 1989 U.S. invasion of Panama, the trial of the conspirators from the 1993 World Trade Center bombing, and a scud missile attack while covering the Persian Gulf War. She was invited to make a rare interview of Fidel Castro, then president of Cuba.
From 1996 to 1999, Fernández was the co-host for Access Hollywood, an entertainment news program on NBC. She then co-hosted the This Week in History show on the History Channel. In October 2001, she returned to Los Angeles and rejoined KTLA. She left this position in August 2003 to pursue a variety of special projects, including making a movie and writing children's books. In 2004, her book titled Gigi and the Birthday Ring was published through the Laredo Publishing Company.
She is president of Skinny Hippo Productions, her own production company, and is co-president of F Squared Productions, where she is a developer of film and television projects. Giselle now works for Charter Communications' Spectrum News 1 Southern California.
Awards
Fernández has won five Emmy Awards for journalism. She is a me |
https://en.wikipedia.org/wiki/Computational%20science | Computational science, also known as scientific computing, technical computing or scientific computation (SC), is a division of science that uses advanced computing capabilities to understand and solve complex physical problems. This includes
Algorithms (numerical and non-numerical): mathematical models, computational models, and computer simulations developed to solve sciences (e.g, physical, biological, and social), engineering, and humanities problems
Computer hardware that develops and optimizes the advanced system hardware, firmware, networking, and data management components needed to solve computationally demanding problems
The computing infrastructure that supports both the science and engineering problem solving and the developmental computer and information science
In practical use, it is typically the application of computer simulation and other forms of computation from numerical analysis and theoretical computer science to solve problems in various scientific disciplines. The field is different from theory and laboratory experiments, which are the traditional forms of science and engineering. The scientific computing approach is to gain understanding through the analysis of mathematical models implemented on computers. Scientists and engineers develop computer programs and application software that model systems being studied and run these programs with various sets of input parameters. The essence of computational science is the application of numerical algorithms and computational mathematics. In some cases, these models require massive amounts of calculations (usually floating-point) and are often executed on supercomputers or distributed computing platforms.
The computational scientist
The term computational scientist is used to describe someone skilled in scientific computing. Such a person is usually a scientist, an engineer, or an applied mathematician who applies high-performance computing in different ways to advance the state-of-the-art in their respective applied disciplines in physics, chemistry, or engineering.
Computational science is now commonly considered a third mode of science , complementing and adding to experimentation/observation and theory (see image). Here, one defines a system as a potential source of data, an experiment as a process of extracting data from a system by exerting it through its inputs and a model (M) for a system (S) and an experiment (E) as anything to which E can be applied in order to answer questions about S. A computational scientist should be capable of:
recognizing complex problems
adequately conceptualizing the system containing these problems
designing a framework of algorithms suitable for studying this system: the simulation
choosing a suitable computing infrastructure (parallel computing/grid computing/supercomputers)
hereby, maximizing the computational power of the simulation
assessing to what level the output of the simulation resembles the systems: the model is v |
https://en.wikipedia.org/wiki/GT.M | GT.M is a high-throughput key–value database engine optimized for transaction processing. (It is a type also referred to as "schema-less", "schema-free", or "NoSQL".) GT.M is also an application development platform and a compiler for the ISO standard M language, also known as MUMPS.
GT.M, an abbreviation for Greystone Technology M, was developed by the Greystone Technology Corp in the 1980s. It is an implementation of ANSI standard M for AIX and Linux. In addition to preserving the traditional features of M, GT.M also offers an optimizing compiler that produces object code that does not require internal interpreters during execution.
The database engine, made open source in 2000, is maintained by FIS. GT.M is used as the backend of their FIS Profile banking application, and it powers banks in Spain, France, Italy, the Netherlands, Romania and India; Capital One 360 in the United States; Tangerine (Scotiabank) in Canada; Atom Bank; Tandem Bank; Sainsbury's Bank; Scottish Widows and Barclays Direct in the UK. It is also used as an open source backend for the Electronic Health Record system WorldVistA and other open source EHRs such as Medsphere's OpenVista. It is listed as an open source healthcare solution partner of Red Hat. Today it consists of approximately 2 million lines of code.
Technical overview
GT.M consists of a language subsystem, a database subsystem, and utility programs. The language subsystem and database subsystem are closely integrated, but each is usable without the other. The language and database subsystems share common data organization and typing.
Data organization and typing
Like MUMPS, GT.M has no real concept of different data types, though strings (those which are not fully numeric) must be placed in quotes to differentiate them from variables. Numbers can be treated as strings of digits, or strings can be treated as numbers by numeric operators (coerced, in MUMPS terminology). Data is treated based on context and the rules of GT.M: 1+"42" yields the result 43, the first character of 43 is 4, and 20+"30 DUCKS" is 50 (as non-numeric characters are dropped during numeric operations).
There is only one data structure - multi-dimensional sparse arrays (key-value nodes, sub-trees, and associative memory are all equally valid descriptions) with up to 32 subscripts. A scalar can be thought of as an array element with zero subscripts. Nodes with varying numbers of subscripts (including one node with no subscripts) can freely co-exist in the same array. For example, if one wanted to represent the national capitals of the United States:
Set Capital("United States")="Washington"
Set Capital("United States",1774,1776)="Philadelphia"
Set Capital("United States",1776,1777)="Baltimore"
Variables are created on demand when first assigned to. Thus, the first Set command above would create the variable Capital. Variables have scope in the language, and are called local variables. A database access looks like an array acces |
https://en.wikipedia.org/wiki/International%20Community%20Radio%20Taipei | International Community Radio Taipei (ICRT; ) is Taiwan's only English-language radio station. Prior to 1979, the station served the U.S. military personnel in Taiwan as the Armed Forces Network Taiwan (AFNT). When the United States broke diplomatic ties with the Republic of China in 1979, the American business community, with the help of the ROC government, reorganized the station into ICRT.
History
Origins
From 1957 to 1979, the station served the US military community in Taiwan as the Armed Forces Network Taiwan (AFNT). After the United States broke diplomatic ties with the Republic of China on Taiwan in 1979, Rear Admiral James B. Linder, last commander of the United States Taiwan Defense Command (USTDC), informed a letter to the Taiwanese Government Information Office (GIO) pointing out that equipments of the AFNT be transferred to the ROC Government by the US Federal Government without compensation. The new radio station, under the name of ICRT, was reorganized by the American Chamber of Commerce in Taipei (AmCham) and the ROC government.
Early period
ICRT enjoyed immense popularity during its first fifteen years. The station offered two channels: AM 200 and FM 989. Both channels provided similar content of foreign pop and rock, with the difference that FM100 also had daily five-minute news at the top of every hour, one-hour morning and evening news programs, and three hours of classical music on Sunday nights.
ICRT’s news coverage was renowned. Live top-of-the-hour news segments were broadcast 24 hours-a-day. Members of the news team were often dispatched to report live from the scene of an event. ICRT’s news coverage was also noted for covering controversial or sensitive political topics at a time when Taiwan was just coming out of martial law. In a period heavily dominated by a KMT-leaning media, ICRT gave a voice to the opposition party, facilitating a fair exchange of ideas.
1990s
The station started to suffer from operating challenges in the 1990s. The ROC government liberalized the radio market, forcing ICRT to face competition from other radio stations. AM576's programming lineup became weaker and lacked DJs to cover the entire twenty-four hours of air time, resulting in an automated jukebox system to replace the DJ. Eventually AM576 only broadcast the BBC World Service and CNN Radio and then went permanently off the air in 1999. News coverage in FM100 was gradually downsized. In 2000, ICRT moved from its original location on Yangmingshan to Taipei City.
ICRT today
News and current affairs
ICRT provides news throughout the day, beginning with content from the BBC, then moving into an hour-long morning news special, in which the morning crew cover local, international, sport and business news.
Taiwan Talk
In 2012, ICRT launched a new feature called Taiwan Talk, a twice-weekly program designed to enhance ICRT’s local news coverage. Hosted by reporter Eryk Smith up until the end of 2013, the news segment features i |
https://en.wikipedia.org/wiki/GammaFax | The first personal computer fax board, GammaFax, was produced in 1985 by GammaLink.
Footnotes
Fax
Computing output devices |
https://en.wikipedia.org/wiki/Terak%208510/a | The Terak 8510/a was a graphical desktop workstation developed by the Terak Corporation in 1977. It was among the first desktop personal computers with a bitmap graphics display. It was a desktop workstation with an LSI-11 compatible processor, a graphical framebuffer, and a text mode with downloadable fonts. The combined weight of processor, display, and keyboard was approximately 50lb. Despite the lack of an MMU, it was capable of running a stripped version of UNIX version 6. It was the first personal machine on which the UCSD p-System was widely used. Various universities in the USA used it in the late 1970s through mid-1980s to teach Pascal programming. It provided immediate graphic feedback from simple programs encouraging students to learn.
Three entrepreneurs started the Terak Corporation in 1975: Brian Benzar, William Mayberry and Dennis Kodimer. Terak products were manufactured in Scottsdale, Arizona from 1976 thru 1984. Sales reached $10M and Terak was publicly traded in 1983-84. Besides the original frame-buffer-centric 8510/a, other products were developed: color graphics and a Unix workstation. A Terak computer was on display at the Boston Museum of Science and also the Jefferson Computer Museum.
References
External links
Terak information by Mark Riordan (mirror)
Terak information at
Terak information at
Computer workstations
PDP-11 |
https://en.wikipedia.org/wiki/GammaLink | GammaLink Inc. was an American computer hardware and software company founded in the 1980s in Sunnyvale, California, by Hank Magnuski and Michael Lutz. The company was the first to invent PC-to-fax communications technology, GammaFax.
The company was sold to Dialogic Corporation in 1994, which in turn was bought by Intel. It was then bought by Eicon and subsequently acquired by Open Media Labs, which now functions as Dialogic Media Labs.
Footnotes
External links
GammaLink 3rd Party FAQ Page
1984 establishments in California
1994 disestablishments in California
1994 mergers and acquisitions
American companies established in 1984
American companies disestablished in 1994
Companies based in Sunnyvale, California
Computer companies established in 1984
Computer companies disestablished in 1994
Defunct companies based in California
Defunct computer companies of the United States
Defunct computer hardware companies
Defunct software companies of the United States
Intel
Software companies established in 1984
Software companies disestablished in 1994 |
https://en.wikipedia.org/wiki/CMS-2 | CMS-2 is an embedded systems programming language used by the United States Navy. It was an early attempt to develop a standardized high-level computer programming language intended to improve code portability and reusability. CMS-2 was developed primarily for the US Navy’s tactical data systems (NTDS).
CMS-2 was developed by RAND Corporation in the early 1970s and stands for "Compiler Monitor System". The name "CMS-2" is followed in literature by a letter designating the type of target system. For example, CMS-2M targets Navy 16-bit processors, such as the AN/AYK-14.
History
CMS-2 was developed for FCPCPAC (Fleet Computer Programming Center - Pacific) in San Diego, CA. It was implemented by Computer Sciences Corporation in 1968 with design assistance from Intermetrics. The language continued to be developed, eventually supporting a number of computers including the AN/UYK-7 and AN/UYK-43 and UYK-20 and UYK-44 computers.
Language features
CMS-2 was designed to encourage program modularization, permitting independent compilation of portions of a total system. The language is statement oriented. The source is free-form and may be arranged for programming convenience. Data types include fixed-point, floating-point, boolean, character and status. Direct reference to, and manipulation of character and bit strings is permitted. Symbolic machine code may be included, known as direct code.
Program structure
A CMS-2 program is composed of statements. Statements are made up of symbols separated by delimiters. The categories of symbols include operators, identifiers, and constants. The operators are language primitives assigned by the compiler for specific operations or definitions in a program. Identifiers are unique names assigned by the programmer to data units, program elements and statement labels. Constants are known values that may be numeric, Hollerith strings, status values or Boolean.
CMS-2 statements are free form and terminated by a dollar sign. A statement label may be placed at the beginning of a statement for reference purposes.
A CMS-2 source program is composed of two basic types of statement. Declarative statements provide basic control information to the compiler and define the structure of the data associated with a particular program. Dynamic statements cause the compiler to generate executable machine instructions (object code).
Declarative statements defining the data for a program are grouped into units called data designs. Data designs consist of precise definitions for temporary and permanent data storage areas, input areas, output areas and special data units. The dynamic statements that act on data or perform calculations are grouped into procedures. Data designs and procedures are further grouped to form system elements of a CMS-2 program. The compiler combines system elements into a compile time system. A compile time system may stand alone or be part of a larger program.
Data declarative statements
Data declarative |
https://en.wikipedia.org/wiki/Mighty%20Ducks%3A%20The%20Animated%20Series | Mighty Ducks (also known as Mighty Ducks: The Animated Series) is an American animated television series that aired on ABC and the syndicated programming block The Disney Afternoon, the last show produced by the block, in the fall of 1996. The show was loosely inspired by the live-action Mighty Ducks films and the eponymous National Hockey League team, the Anaheim Mighty Ducks, as well as the affiliate American Hockey League team, the Cincinnati Mighty Ducks. Unlike the films and the hockey teams, the show was about a team of anthropomorphic hockey-playing ducks.
Twenty-six episodes were produced in total.
The series' main theme, composed by Patrick DeRemer, is performed by Starship vocalist Mickey Thomas.
Story
In another universe exists a planet populated entirely by humanoid ducks. Dubbed "Puckworld" by its inhabitants, it is an icy planet, perfectly suited to the Ducks' favorite pastime, hockey. For the citizens of Puckworld, hockey was not simply a sport, but a way of life, occupying virtually every aspect of day-to-day existence.
Legend has it that centuries ago, during an invasion by a reptilian race called Saurians, a duck named Drake DuCaine became the planet's savior over the Saurians' Overlords. The legend tells that DuCaine did so with a high-tech goalie mask which gave him the ability to see through the Saurians' cloaking technology which was a game changer for him and his people. With it, DuCaine sent the Saurians to a mysterious "Dimensional Limbo".
The last of the Saurians escape from the Dimensional Limbo and returns to Puckworld with an armada of robotic attack ships. The group of four is led by the last of the Saurian Overlords, Lord Dragaunus, who is assisted by his minions Siege, Chameleon and Wraith. They invade the planet and enslave the people of Puckworld. After some time, a resistance is formed by Canard Thunderbeak, who has found The Mask of Drake DuCaine. With it, the wearer of the Mask could see through the Saurians' invisibility cloaks. Canard forms a band of Ducks to fight Dragaunus. The members of his team consists of Wildwing Flashblade, Nosedive Flashblade, Tanya Vanderflock, Duke L'Orange, Mallory McMallard and Grin Hardwing. They go on a mission to destroy Dragaunus's fortress the Master Tower and free the planet from the Saurians' control. While the mission is successful, Dragaunus and his forces manage to escape in their ship, the Raptor. The Saurians open up a dimensional gateway to escape through, but Canard and the others follow him into the portal with the Aerowing, intent on stopping them.
Dragaunus attempts to get rid of the Ducks inside the portal by attacking them with an electromagnetic worm that will grow until it can swallow the Aerowing. In a desperate attempt to get rid of the worm, Canard sacrifices his own life by throwing himself to the worm. Before doing so, however, Canard gave the Mask, and leadership of the team, to Wildwing Flashblade, his best friend. Both the Raptor and the Aerow |
https://en.wikipedia.org/wiki/WRC-TV | WRC-TV (channel 4) is a television station in Washington, D.C., serving as the market's NBC outlet. It is owned and operated by the network's NBC Owned Television Stations division alongside Class A Telemundo outlet WZDC-CD (channel 44). WRC-TV and WZDC-CD share studios on Nebraska Avenue in the Tenleytown neighborhood of Northwest Washington. Through a channel sharing agreement, the stations transmit using WRC-TV's spectrum from a tower adjacent to their studios.
History
The station traces its roots to experimental television station W3XNB, which was put on the air by the Radio Corporation of America, the then-parent company of NBC, in 1939. A construction permit with the commercial callsign WNBW (standing for "NBC Washington") was first issued on channel 3 (60–66 MHz, numbered channel 2 prior to 1946) on December 23, 1941. NBC requested this permit to be cancelled on June 29, 1942; later, the channel 3 allocation was reassigned to Harrisonburg, Virginia, on which the former Shennandoah Valley Broadcasting Company launched WSVA-TV (now WHSV-TV) in 1953.
On June 27, 1947, WNBW was re-licensed on channel 4 and signed on the air. Channel 4 is the second-oldest commercially licensed television station in Washington, after WTTG (channel 5), which signed on seven months earlier in December 1946. WNBW was also the second of the five original NBC-owned television stations to sign-on, behind WNBT in New York City and ahead of WNBQ in Chicago, WNBK in Cleveland and KNBH in Los Angeles. The station was operated alongside WRC radio (980 AM, now WTEM, and 93.9 FM, now WKYS).
On October 18, 1954, the television station's callsign changed to the present WRC-TV to match its radio sisters. The new calls reflected NBC's ownership at the time by RCA. It has retained its "-TV" suffix to this day, nearly four decades after the radio stations were sold off and changed call letters. The WNBW call sign was later used for the NBC affiliate in Gainesville, Florida, since the station's launch in 2008.
In 1955, while in college and serving as a puppeteer on a WRC-TV program, Jim Henson was asked to create a puppet show for the station. The series he created, Sam and Friends, was the first series to feature the Muppets, and launched the Jim Henson Company.
The second presidential debate between candidates John F. Kennedy and Richard M. Nixon was broadcast from the station's studios on October 7, 1960. David Brinkley's Washington segment of the Huntley-Brinkley Report originated at WRC-TV between 1956 and 1970, as did Washington reports or commentaries by Brinkley or John Chancellor on NBC Nightly News in the 1970s.
The earliest color videotape in existence is a recording of the dedication of WRC-TV's Washington studios on May 22, 1958. President Dwight D. Eisenhower spoke at the event, introduced by NBC President Robert W. Sarnoff. Before Eisenhower spoke, Sarnoff pushed a button, which converted the previously black and white signal into color. It was also the first |
https://en.wikipedia.org/wiki/Live%20by%20Request%20%28k.d.%20lang%20album%29 | Live by Request is a live album by k.d. lang, released in 2001 (see 2001 in music). The album was recorded during the taping of the television show Live by Request on the A&E Network. The performance was on December 14, 2000 at the John Jay College of Criminal Justice in Midtown Manhattan.
Track listing
"Summerfling" (Lang, David Piltch) – 4:03
"Big Boned Gal" (Lang, Ben Mink) – 2:55
"Black Coffee" (Sonny Burke, Paul Francis Webster) – 3:44
"Trail of Broken Hearts" (Lang, Ben Mink) – 3:19
"Crying" (Joe Melson, Roy Orbison) – 4:32
"Don't Smoke in Bed" (Willard Robison) – 3:44
"The Consequences of Falling" (Marie-Claire D'Ubaldo, Rick Nowels, Billy Steinberg) – 3:55
"Miss Chatelaine" (Lang, Ben Mink) – 3:25
"Three Cigarettes in an Ashtray" (Eddie Miller, W.S. Stevenson) – 2:52
"Barefoot" (Lang, Bob Telson) – 4:20
"Constant Craving" (Lang, Ben Mink) – 4:32
"Wash Me Clean" (Lang) – 3:50
"Pullin' Back the Reins" (Lang, Ben Mink) – 4:41
"Simple" (Lang, David Piltch) – 3:29
Personnel
k.d. lang - vocals
Gregg Arreguin - guitar
Teddy Borowiecki - keyboard
Amy Keys - background vocals
Abe Laboriel Jr. - drums
Greg Leisz - guitar, pedal steel
Kate Markowitz - background vocals
David Piltch - bass
Windy Wagner (background vocals)
Production
Producer: Mitch Maketansky
Executive producers: Danny Bennett, Andy Kadison, Paul Rappaport
Mixing: David Thoener
Repertoire: Mio Vukovic
Director: Lawrence Jordan
Lighting director: Dale Lynch
Stage technician: Bobby Carlos
Art direction: Mio Vukovic
Design: Lawrence Azerrad
Charts
References
K.d. lang albums
2001 live albums
Warner Records live albums |
https://en.wikipedia.org/wiki/Rail%20transport%20in%20Victoria | Rail transport in the Australian state of Victoria is provided by a number of railway operators who operate over the government-owned railway lines. The network consists of 2,357 km of Victorian broad gauge () lines, and 1,912 km of standard gauge () freight and interstate lines; the latter increasing with gauge conversion of the former. Historically, a few experimental gauge lines were built, along with various private logging, mining and industrial railways. The rail network radiates from the state capital, Melbourne, with main interstate links to Sydney and to Adelaide, as well as major lines running to regional centres, upgraded as part of the Regional Fast Rail project.
The government-owned VicTrack owns all railway and tram lines, associated rail lands and other rail-related infrastructure in Victoria, which it leases to Public Transport Victoria which then sub-leases assets and infrastructure as appropriate to rail and tram operators. The state has four railway networks:
Metro Trains Melbourne operates Melbourne's electrified metropolitan network providing passenger services with electric multiple units,
V/Line operates the country passenger network with diesel trains,
Australian Rail Track Corporation leases from VicTrack the standard gauge tracks from Melbourne to Albury and to Serviceton to operate the interstate Melbourne-Adelaide and Melbourne-Sydney services, and
the grain network in the north west of the state, connected to the ports at Geelong and Portland. Freight services are operated by Southern Shorthaul Railroad, Pacific National and SCT Logistics (interstate and intrastate), and Qube Logistics (intrastate).
Victoria does not have a dominant mining base as with other states, and has traditionally been more dependent on agriculture for rail freight traffic. By the 1990s road transport had captured most general freight traffic, with an average of only 6.1 million tonnes of intrastate freight carried each year between 1996 and 1998; containers being the major cargo, followed by cement, logs, quarry products and steel.
History
The first railway lines in Victoria were built in the 1850s, and were privately owned and operated. These started having financial problems and were taken over by the Government Railway Department (Victorian Railways), which was established by the Colonial Government and became a vertically integrated government service. This structure remained until corporatisation began in the 1970s, followed by privatisation in the 1990s.
The rail network reached a peak in 1942 but steadily declined, as branch and cross country lines were closed until the 1980s.
First lines
Australia's first steam-operated railway was a broad gauge line between the Melbourne (or City) Terminus (on the site of modern-day Flinders Street station) and Sandridge (now Port Melbourne). It was constructed by the Melbourne and Hobson's Bay Railway Company and opened in September 1854. The first country line in Victoria was |
https://en.wikipedia.org/wiki/Provable%20security | Provable security refers to any type or level of computer security that can be proved. It is used in different ways by different fields.
Usually, this refers to mathematical proofs, which are common in cryptography. In such a proof, the capabilities of the attacker are defined by an adversarial model (also referred to as attacker model): the aim of the proof is to show that the attacker must solve the underlying hard problem in order to break the security of the modelled system. Such a proof generally does not consider side-channel attacks or other implementation-specific attacks, because they are usually impossible to model without implementing the system (and thus, the proof only applies to this implementation).
Outside of cryptography, the term is often used in conjunction with secure coding and security by design, both of which can rely on proofs to show the security of a particular approach. As with the cryptographic setting, this involves an attacker model and a model of the system. For example, code can be verified to match the intended functionality, described by a model: this can be done through static checking. These techniques are sometimes used for evaluating products (see Common Criteria): the security here depends not only on the correctness of the attacker model, but also on the model of the code.
Finally, the term provable security is sometimes used by sellers of security software that are attempting to sell security products like firewalls, antivirus software and intrusion detection systems. As these products are typically not subject to scrutiny, many security researchers consider this type of claim to be selling snakeoil.
In cryptography
In cryptography, a system has provable security if its security requirements can be stated formally in an adversarial model, as opposed to heuristically, with clear assumptions that the adversary has access to the system as well as enough computational resources. The proof of security (called a "reduction") is that these security requirements are met provided the assumptions about the adversary's access to the system are satisfied and some clearly stated assumptions about the hardness of certain computational tasks hold. An early example of such requirements and proof was given by Goldwasser and Micali for semantic security and the construction based on the quadratic residuosity problem. Some proofs of security are in given theoretical models such as the random oracle model, where real cryptographic hash functions are represented by an idealization.
There are several lines of research in provable security. One is to establish the "correct" definition of security for a given, intuitively understood task. Another is to suggest constructions and proofs based on general assumptions as much as possible, for instance the existence of a one-way function. A major open problem is to establish such proofs based on , since the existence of one-way functions is not known to follow from the conjec |
https://en.wikipedia.org/wiki/Clock%20synchronization | Clock synchronization is a topic in computer science and engineering that aims to coordinate otherwise independent clocks. Even when initially set accurately, real clocks will differ after some amount of time due to clock drift, caused by clocks counting time at slightly different rates. There are several problems that occur as a result of clock rate differences and several solutions, some being more acceptable than others in certain contexts.
Terminology
In serial communication, clock synchronization can refer to clock recovery which achieves frequency synchronization, as opposed to full phase synchronization. Such clock synchronization is used in synchronization in telecommunications and automatic baud rate detection.
Plesiochronous or isochronous operation refers to a system with frequency synchronization and loose constraints on phase synchronization. Synchronous operation implies a tighter synchronization based on time perhaps in addition to frequency.
Problems
As a result of the difficulties managing time at smaller scales, there are problems associated with clock skew that take on more complexity in distributed computing in which several computers will need to realize the same global time. For instance, in Unix systems the make command is used to compile new or modified code and seeks to avoid recompiling unchanged code. The make command uses the clock of the machine it runs on to determine which source files need to be recompiled. If the sources reside on a separate file server and the two machines have unsynchronized clocks, the make program might not produce the correct results.
Synchronization is required for accurate reproduction of streaming media. Clock synchronization is a significant component of audio over Ethernet systems.
Solutions
In a system with a central server, the synchronization solution is trivial; the server will dictate the system time. Cristian's algorithm and the Berkeley algorithm are potential solutions to the clock synchronization problem in this environment.
In distributed computing, the problem takes on more complexity because a global time is not easily known. The most used clock synchronization solution on the Internet is the Network Time Protocol (NTP) which is a layered client-server architecture based on User Datagram Protocol (UDP) message passing. Lamport timestamps and vector clocks are concepts of the logical clock in distributed computing.
In a wireless network, the problem becomes even more challenging due to the possibility of collision of the synchronization packets on the wireless medium and the higher drift rate of clocks on low-cost wireless devices.
Berkeley algorithm
The Berkeley algorithm is suitable for systems where a radio clock is not present. This system has no way of making sure of the actual time other than by maintaining a global average time as the global time. A time server will periodically fetch the time from all the time clients, average the results, and then report bac |
https://en.wikipedia.org/wiki/Motorola%206800%20family | The M6800 Microcomputer System (latter dubbed the Motorola 6800 family, M6800 family, or 68xx) was a series of 8-bit microprocessors and microcontrollers from Motorola that began with the 6800 CPU. The architecture also inspired the MOS Technology 6502, and that company started in the microprocessor business producing 6800 replacements.
The chips primarily competed against Intel's 8-bit family of chips (such as the 8080, or their relations, the Zilog Z80 range).
Motorola 6800
Motorola 6801 (includes RAM and ROM)
Motorola 6802 (includes RAM and an internal clock oscillator)
Motorola 6803 (includes RAM)
Motorola 6805
Motorola 6808 (6802 that had failed production test of its internal RAM; Its RAM enable pin was designated GND)
Motorola 6809
Hitachi 6301 used in the Psion Organiser I
Hitachi HD6303 used in the Psion Organiser II
Hitachi 6309
Motorola 68HC05
Freescale 68HC08
Freescale 68HC11
Freescale 68HC12 (16-bit)
Motorola 68HC16 (16-bit)
See also
Instruction set
References
Motorola microprocessors |
https://en.wikipedia.org/wiki/Small%20talk%20%28disambiguation%29 | Small talk is an informal type of conversation.
Small talk, Small Talk, or Smalltalk may also refer to:
Smalltalk, a computer programming language
Film and television
Small Talk (1929 film), a 1929 Our Gang short comedy film, the first with sound
Small Talk (2016 film), a 2016 Taiwanese documentary film
Chhoti Si Baat or Small Talk, a 1975 Hindi romantic comedy film
Small Talk (British game show), a 1994–1996 show hosted by Ronnie Corbett
Small Talk (American game show), a 1996–1997 show hosted by Wil Shriner
Music
Small Talk (Sly and the Family Stone album), 1974
Small Talk (Twenty Twenty album), 2011
Small Talk (EP), an EP by MNEK
"Small Talk" (song), a 2019 song by Katy Perry
"Smalltalk", a song by Ultraísta from their eponymous debut album
"Small Talk", a song from the 1954 musical The Pajama Game
"Small Talk", a song by Scritti Politti from the 1985 album Cupid & Psyche 85
"Small Talk", a song by Roxette from the 1991 album Joyride
"Small Talk", a song by Saving Aimee from the 2009 album We're the Good Guys
"Small Talk", a song by The Story So Far from the 2013 album What You Don't See |
https://en.wikipedia.org/wiki/LessTif | LessTif is a defunct free software reimplementation or clone of the Motif computer programming toolkit. The project aimed for full source- and binary-code compatibility with Motif. While this was not achieved, many Motif applications could run with LessTif or be compiled with it.
As opposed to Motif, which was distributed until October 2012 under a proprietary license that could require the payment of royalties, LessTif was developed under the GNU Lesser General Public License (LGPL). The license of Motif was the main motivation for the development of LessTif. Following the release of the original Motif toolkit as open source under the LGPL in 2012, the LessTif project was abandoned.
See also
History of free software
References
External links
LessTif at SourceForge.net
Free computer libraries
Software clones
Widget toolkits
X-based libraries |
https://en.wikipedia.org/wiki/Marco%20Dorigo | Marco Dorigo (born 26 August 1961, in Milan, Italy) is a research director for the Belgian Funds for Scientific Research and a co-director of IRIDIA, the artificial intelligence lab of the Université Libre de Bruxelles.
He received a PhD in System and Information Engineering in 1992 from the Polytechnic University of Milan with a thesis titled Optimization, learning, and natural algorithms. He is the leading proponent of the ant colony optimization metaheuristic (see his book published by MIT Press in 2004), and one of the founders of the swarm intelligence research field. Recently he got involved with research in swarm robotics: he is the coordinator of Swarm-bots: Swarms of self-assembling artifacts and of Swarmanoid: Towards humanoid robotic swarms, two swarm robotics projects funded by the Future and Emerging Technologies Program of the European Commission. He is also the founding editor and editor in chief of Swarm Intelligence, the principal peer-reviewed publication dedicated to reporting research and new developments in this multidisciplinary field.
For these contributions, in 2003 he was awarded the Marie Curie Research Excellence Award by the European Commission; on 22 November 2005, he was presented the Dr A. De Leeuw-Damry-Bourlart award in Applied Sciences by the King of Belgium, Albert II; in 2007 he received the Cajastur International Prize for Soft Computing, awarded by the European Centre for Soft Computing; and in 2015 he received the IEEE Frank Rosenblatt Award. He is the recipient of an ERC Advanced Grant (2010). He is the most cited author in three journals:
IEEE Transactions on Systems, Man, and Cybernetics,
IEEE Computational Intelligence Magazine, and
Artificial Life.
Publications (selected)
Ant Colony Optimization with Thomas Stützle, MIT Press, 2004 ().
Swarm Intelligence : From Natural to Artificial Systems with Eric Bonabeau and Guy Theraulaz, Oxford University Press, 1999 ().
Robot Shaping with Marco Colombetti, MIT Press, 1998 ().
Ant algorithms for discrete optimization with Gianni Di Caro and Luca Maria Gambardella, Artificial Life, Vol. 5, N. 2, 1999.
Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1 (1): 53–66. (This became the second most cited paper ever published by IEEE Transactions on Evolutionary Computation.)
References
External links
Home Page
21st-century Italian scientists
Italian computer scientists
Academic staff of the Université libre de Bruxelles
1961 births
Living people
Fellows of the Association for the Advancement of Artificial Intelligence
Scientists from Milan |
https://en.wikipedia.org/wiki/YAM%20%28software%29 | YAM (short for Yet Another Mailer) is a MIME-compliant E-mail client written for AmigaOS and derivative operating systems. Originally created by Marcel Beck, it currently supports multiple user accounts, encrypted communications via OpenSSL and PGP, unlimited hierarchical folders and filters, a configurable GUI based on MUI, extensive ARexx support for automating tasks, and most of the features to be expected in modern E-mail clients.
History
The initial release from 1995 arrived when the Internet was still something very new for the average Amiga user. However, as time passed and further 1.x updates were released, YAM became quickly popular thanks to its simplicity and comprehensible user interface at a time when competing products were either German only (MicroDot), required a shareware fee (MicroDot-II) or used a less intuitive GUI in comparison, such as Thor.
The early YAM 1.x series, while very usable for the most part, was relatively basic and spartan in terms of functionality. It wasn't until 2.0 that finally the program started showing its full potential, featuring a major redesign of the user interface and a plethora of new features which turned it into the de facto standard Amiga E-mail client ever since.
Released in late 2000, YAM 2.2 was the last update from Marcel Beck, who ceased Amiga development but also released the sources under the GNU GPL-2.0-or-later. A group of Amiga developers then teamed up to coordinate and resume development, and finally in 2004 the first ever open source YAM (2.3) was released. During the next decade YAM managed to become a much more mature, stable and usable program. Along that time however, the developer team also lost most of its members, but YAM still remains today as one of the most iconic and popular pieces of Amiga software.
Recognition
At the peak of his popularity, and as a token of appreciation from the Amiga community at large, Marcel Beck received in 1998 the AAA Award International. The award presentation was held at the World of Amiga show in London, UK, and it was hosted by Amiga and Cloanto with the help of several Amiga user groups. Mr. Beck could not attend, but in a phone recording he stated that he felt very honored to receive the award, and thanked all YAM users around the world.
See also
Comparison of e-mail clients
References
External links
YAM on Github
Discussion forum
Amiga software
AmigaOS 4 software
Free email software
MorphOS software
AROS software |
https://en.wikipedia.org/wiki/Interpacket%20gap | In computer networking, the interpacket gap (IPG), also known as interframe spacing, or interframe gap (IFG), is a pause which may be required between network packets or network frames. Depending on the physical layer protocol or encoding used, the pause may be necessary to allow for receiver clock recovery, permitting the receiver to prepare for another packet (e.g. powering up from a low-power state) or another purpose. It may be considered as a specific case of a guard interval.
Ethernet
Ethernet devices must allow a minimum idle period between transmission of Ethernet packets. A brief recovery time between packets allows devices to prepare for reception of the next packet. While some physical layer variants literally transmit nothing during the idle period, most modern ones continue to transmit an idle pattern signal. The standard minimum interpacket gap for transmission is 96 bit times (the time it takes to transmit 96 bits of data on the medium). The time is measured from the end of the frame check sequence of one frame to the start of the preamble for the next.
During data reception, some interpacket gaps may be smaller due to variable network delays, clock tolerances (all speeds), and the presence of repeaters (10 Mbit/s only).
Some manufacturers design adapters transmitting with a smaller interpacket gap for slightly higher data transfer rates. That can lead to data loss when mixed with standard adaptors.
Fibre Channel
For Fibre Channel, there is a sequence of primitives between successive frames, sometimes called interframe gap as well. The minimum sequence consists of six primitives, IDLE|IDLE|R_RDY|R_RDY|IDLE|IDLE. Each primitive consists of four channel words of 10 bits each for 8b/10b encoded variants (1–8 Gbit/s), equivalent to four data bytes.
References
Ethernet |
https://en.wikipedia.org/wiki/Storage%20Resource%20Broker | Storage Resource Broker (SRB) is data grid management computer software used in computational science research projects. SRB is a logical distributed file system based on a client-server architecture which presents users with a single global logical namespace or file hierarchy. Essentially, the software enables a user to use a single mechanism to work with multiple data sources.
Description
SRB provides a uniform interface to heterogeneous computer data storage resources over a network. As part of this, it implements a logical namespace (distinct from physical file names) and maintains metadata on data-objects (files), users, groups, resources, collections, and other items in an SRB metadata catalog (MCAT) stored in a relational database management system. System and user-defined metadata can be queried to locate files based on attributes as well as by name. SRB runs on various versions of Unix, Linux, and Microsoft Windows.
The SRB system is middleware in the sense that it is built on top of other major software packages (various storage systems, real-time data sources, a relational database management system, etc.) and it has callable library functions that can be utilized by higher level software. However, it is more complete than many middleware software systems as it implements a comprehensive distributed data management environment, including various end-user client applications. It has features to support the management and collaborative (and controlled) sharing, publication, replication, transfer, and preservation of distributed data collections.
SRB is sometimes used in conjunction with computational grid computing systems, such as Globus Alliance, and can utilize the Globus Alliance Grid Security Infrastructure (GSI) authentication system.
SRB can store and retrieve data in archival storage systems such as the High Performance Storage System and SAM-FS, on disk file systems (Unix, Linux, or Windows), as binary large objects or tabular data in relational database management systems, and on tape libraries.
SRB was used since 1997. In 2008 the SRB was estimated to be managing over two petabytes of data.
While licensed, SRB source distributions are freely available to academic and non-profit organizations. Nirvana SRB, a commercial version of SRB, featured capabilities specifically adapted to government and commercial use.
History
SRB development began in 1995, through the cooperative efforts of General Atomics, the Data Intensive Cyber Environments Group (DICE), and the San Diego Supercomputer Center (SDSC) at the University of California, San Diego (UCSD) with the support of the National Science Foundation (NSF).
SRB builds on the work of Reagan Moore. Moore, a doctorate in plasma physics from UCSD and former computational plasma physicist at General Atomics, joined the San Diego Supercomputer Center at its inception.
A project for a distributed object computation testbed was funded by DARPA and the US Patent and Trademark Off |
https://en.wikipedia.org/wiki/Computer-supported%20telecommunications%20applications | Computer-supported telecommunications applications (CSTA) is an abstraction layer for telecommunications applications. It is independent of underlying protocols. It has a telephone device model that enables CTI applications to work with a wide range of telephone devices.
Originally developed in 1992, it has continued to be developed and refined over the years. It is often the model that most CTI applications are built on and claim compliance with. It became an OSI standard in July 2000. It is currently being maintained by ECMA International.
The core of CSTA is a normalized Call Control model. Additional to the core there are Call Associated features and Physical Device features amongst others. An implementation of the standard need not provide all features, and so Profiles are provided. For example, the Basic Telephony profile provides such features as Make Call, Answer and Clear Connection.
History
CSTA has seen 3 major revisions to date.
Phase 1 1992
Phase 2 1994
Phase 3 1998
Recent developments
Phase 3 of the CSTA standard saw the introduction of uaCSTA, CSTA XML and CSTA Object Model extensions. These extensions are in various states of completion but all extend the scope of CSTA.
Example of Underlying Protocols
Protocols that may be used by CSTA.
SIP
H.323
ACSE/ROSE
See also
CTI
Java Telephony API
Telephony Application Programming Interface (TAPI)
External links
CSTA III Standard
ECMA International
Remote Contact Center Services
Services for Computer Supported Telecommunications Applications (CSTA) Phase III
XML Protocol for Computer Supported Telecommunications Applications (CSTA) Phase III
Web Services Description Language (WSDL) for CSTA Phase III
Open CSTA, an open source implementation of the CSTA protocol, phase III
Computer telephony integration |
https://en.wikipedia.org/wiki/Three-point%20lighting | Three-point lighting is a standard method used in visual media such as theatre, video, film, still photography, computer-generated imagery and 3D computer graphics. By using three separate positions, the photographer can illuminate the shot's subject (such as a person) however desired, while also controlling (or eliminating entirely) the shading and shadows produced by direct lighting.
Setup
Key Light
The key light, as the name suggests, shines directly upon the subject and serves as its principal illuminator; more than anything else, the strength, color and angle of the key determines the shot's overall lighting design.
In indoor shots, the key is commonly a specialized lamp, or a camera's flash. In outdoor daytime shots, the Sun often serves as the key light. In this case, of course, the photographer cannot set the light in the exact position they want, so instead arranges the shot to best capture the sunlight, perhaps after waiting for the sun to position itself just right.
Fill Light
The fill light also shines on the subject, but from a side angle relative to the key and is often placed at a lower position than the key (about at the level of the subject's face). It balances the key by illuminating shaded surfaces, and lessening or eliminating chiaroscuro effects, such as the shadow cast by a person's nose upon the rest of the face. It is usually softer and less bright than the key light (up to half), and more to a flood. Not using a fill at all can result in stark contrasts (due to shadows) across the subject's surface, depending upon the key light's harshness. Sometimes, as in low-key lighting, this is a deliberate effect, but shots intended to look more natural and less stylistic require a fill.
In some situations a photographer can use a reflector (such as a piece of white cardstock mounted off-camera, or even a white-painted wall) as a fill light instead of an actual lamp. Reflecting and redirecting the key light's rays back upon the subject from a different angle can cause a softer, subtler effect than using another lamp.
Backlight
The backlight (a.k.a. the rim, hair, or shoulder light) shines on the subject from behind, often (but not necessarily) to one side or the other. It gives the subject a rim of light, serving to separate the subject from the background and highlighting contours.
Back light or rim light is different from a kick in that a kick (or kicker) contributes to a portion of the shading on the visible surface of the subject, while a rim light only creates a thin outline around the subject without necessarily hitting the front (visible) surface of the subject at all.
Four-point lighting
The addition of a fourth light, the background light, makes for a four-point lighting setup.
The background light is placed behind the subject(s), on a high grid, or low to the ground. Unlike the other three lights, which illuminate foreground elements like actors and props, it illuminates background elements, such as walls o |
https://en.wikipedia.org/wiki/Patience%20sorting | In computer science, patience sorting is a sorting algorithm inspired by, and named after, the card game patience. A variant of the algorithm efficiently computes the length of a longest increasing subsequence in a given array.
Overview
The algorithm's name derives from a simplified variant of the patience card game. The game begins with a shuffled deck of cards. The cards are dealt one by one into a sequence of piles on the table, according to the following rules.
Initially, there are no piles. The first card dealt forms a new pile consisting of the single card.
Each subsequent card is placed on the leftmost existing pile whose top card has a value greater than or equal to the new card's value, or to the right of all of the existing piles, thus forming a new pile.
When there are no more cards remaining to deal, the game ends.
This card game is turned into a two-phase sorting algorithm, as follows. Given an array of elements from some totally ordered domain, consider this array as a collection of cards and simulate the patience sorting game. When the game is over, recover the sorted sequence by repeatedly picking off the minimum visible card; in other words, perform a -way merge of the piles, each of which is internally sorted.
Analysis
The first phase of patience sort, the card game simulation, can be implemented to take comparisons in the worst case for an -element input array: there will be at most piles, and by construction, the top cards of the piles form an increasing sequence from left to right, so the desired pile can be found by binary search. The second phase, the merging of piles, can be done in time as well using a priority queue.
When the input data contain natural "runs", i.e., non-decreasing subarrays, then performance can be strictly better. In fact, when the input array is already sorted, all values form a single pile and both phases run in time. The average-case complexity is still : any uniformly random sequence of values will produce an expected number of piles, which take time to produce and merge.
An evaluation of the practical performance of patience sort is given by Chandramouli and Goldstein, who show that a naive version is about ten to twenty times slower than a state-of-the-art quicksort on their benchmark problem. They attribute this to the relatively small amount of research put into patience sort, and develop several optimizations that bring its performance to within a factor of two of that of quicksort.
If values of cards are in the range , there is an efficient implementation with worst-case running time for putting the cards into piles, relying on a Van Emde Boas tree.
Relations to other problems
Patience sorting is closely related to a card game called Floyd's game. This game is very similar to the game sketched earlier:
The first card dealt forms a new pile consisting of the single card.
Each subsequent card is placed on some existing pile whose top card has a value no less than the new c |
https://en.wikipedia.org/wiki/Friend-to-friend | A friend-to-friend (or F2F) computer network is a type of peer-to-peer network in which users only make direct connections with people they know. Passwords or digital signatures can be used for authentication.
Unlike other kinds of private P2P, users in a friend-to-friend network cannot find out who else is participating beyond their own circle of friends, so F2F networks can grow in size without compromising their users' anonymity. Retroshare, WASTE, GNUnet, Freenet and OneSwarm are examples of software that can be used to build F2F networks, though RetroShare is the only one of these configured for friend-to-friend operation by default.
Many F2F networks support indirect anonymous or pseudonymous communication between users who do not know or trust one another. For example, a node in a friend-to-friend overlay can automatically forward a file (or a request for a file) anonymously between two friends, without telling either of them the other's name or IP address. These friends can in turn automatically forward the same file (or request) to their own friends, and so on.
Dan Bricklin coined the term "friend-to-friend network" in 2000.
Potential applications of F2F
The Bouillon project uses a friend-to-friend network to assign trust ratings to messages.
See also
Darknet
LAN messenger
Private peer-to-peer
Web of trust
References
B.C. Popescu, B. Crispo, and A.S. Tanenbaum. "Safe and Private Data Sharing with Turtle: Friends Team-Up and Beat the System." In 12th International Workshop on Security Protocols, Cambridge, UK, April 2004.
T. Chothia and K. Chatzikokolakis. "A Survey of Anonymous Peer-to-Peer File-Sharing." In Proceedings of the IFIP International Symposium on Network-Centric Ubiquitous Systems (NCUS 2005), Nagasaki, Japan, volume 3823 of Lecture Notes in Computer Science, pages 744–755. Springer, 2005.
J. Li and F. Dabek. "F2F: Reliable Storage in Open Networks." In 5th International Workshop on Peer-to-Peer Systems (IPTPS '06), Santa Barbara, CA, USA, February 2006.
M. Rogers and S. Bhatti. "How to Disappear Completely: A Survey of Private Peer-to-Peer Networks." In 1st International Workshop on Sustaining Privacy in Collaborative Environments (SPACE 2007), Moncton, NB, Canada, July 2007.
Numbered references:
External links
Friend2Friend.net, An XML scripting language for writing F2F software
Discussion about F2F involving Ian Clarke of Freenet
F2F page at altruists.org
Applications of cryptography
Internet privacy
Peer-to-peer
Authentication
2000s neologisms |
https://en.wikipedia.org/wiki/Retro%20Review | Retro Review, a retro computing magazine, was the first multiformat magazine dedicated to old computers. It was irregularly published between January 2002 and March 2004.
History
It was founded by Jorge Canelhas and Ian Gledhill who also edited and published the magazine. The first issue was published on 15 January 2002. It was a 60-page A5 magazine with a colour cover and was photocopied. From 21 January 2003 Retro Review was produced as a PDF file for subscribers in addition to print edition. On 15 March 2004 the fifth and the last issue of the magazine was published.
References
External links
Magazine Website
Defunct computer magazines published in the United Kingdom
Downloadable magazines
Irregularly published magazines published in the United Kingdom
Magazines established in 2002
Magazines disestablished in 2004 |
https://en.wikipedia.org/wiki/F2F | F2F may refer to:
Friend-to-friend, a type of private P2P computer network
Firewall-to-firewall transfers, an important part of most modern P2P network designs
FAI CLASS F2F - Diesel Powered Profile Fuselage Control Line Team Racing Model Aircraft.
F2F (TV series), a UK youth chat show
"F2F" (song) by SZA, from her 2022 album SOS
Grumman F2F, a biplane fighter aircraft
Face to Face (disambiguation)
Forecast-to-Fulfil, a term used in supply chain management, particularly in relation to cash flow or financial management
Frequency/double frequency or Aiken Biphase. See Differential Manchester encoding. |
https://en.wikipedia.org/wiki/Shotgun%20%28disambiguation%29 | A shotgun is a type of firearm.
Sawed-off shotgun
Shotgun may also refer to:
Science and technology
Shotgun hill climbing, a type of mathematical optimization algorithm in computer science
Shotgun house, a type of narrow, rectangular house
Shotgun sequencing, a method of sequencing DNA
Shotgunning (cold reading), a "mind-reading" technique
Shotgun mic, a type of microphone with a long barrel
Shotgun debugging or shotgunning, a technique in system troubleshooting, debugging, or repair
Shotgun Software, a project management software for creative studios owned by Autodesk
Slang
Riding shotgun, a passenger sitting beside the driver in a car or other vehicle
Shotgun wedding, a hasty wedding due to unplanned pregnancy
Shotgunning, a method for rapidly drinking beer out of a can by punching a hole in it
to shotgun weed or a joint, when one person forces marijuana smoke into the mouth of another person
Sport
Shotgun (shooting sports), a shooting sports discipline
Shotgun, nickname ("Escopeta" in Spanish) of Sergio Roitman (born 1979), professional tennis player from Argentina
Shotgun formation, an offensive formation in American football
"The Shotgun", a nickname for snooker player Jamie Cope
WWF Shotgun Saturday Night, a television series
Film and television
Shotgun (1955 film), an American Western film
Shotgun, 1989 film with Rif Hutton
Shotgun, retitled After Everything, a 2018 American comedy-drama film
"Shotgun" (Breaking Bad), a season four episode of Breaking Bad
Literature
"Shotgun" (comics), a fictional villain in Marvel Comics works
Shotgun (novel), a novel by Ed McBain
Shotgun News (Firearms News since 2016), an American shooting and firearms interest publication
Music
Shotgun (funk band), American funk band from Detroit, Michigan
Shotgun (rock band), 1970s American rock band from Dallas, Texas
Shotgun (Jamie J. Morgan album), 1990
Shotgun (Tony Lucca album), 2004
Songs
"Shotgun" (Christina Aguilera song), 2015
"Shotgun" (George Ezra song), 2018
"Shotgun" (Junior Walker & the All Stars song), 1965
"Shotgun" (Limp Bizkit song), 2011
"Shotgun" (Sheryl Crow song), 2014
"Shotgun" (Yellow Claw song), 2013
"Shotgun", a song by the Dave Matthews Band
"Shotgun", a song by Soccer Mommy from Sometimes, Forever
"Shotgun", a song by Reks from REBELutionary
See also
Shogun, a Japanese title
Shotgun wedding (disambiguation) |
https://en.wikipedia.org/wiki/CKCW-DT | CKCW-DT (channel 2) is a television station in Moncton, New Brunswick, Canada, part of the CTV Television Network. It serves as the network's outlet for both New Brunswick and Prince Edward Island (by way of a repeater in Charlottetown). Owned and operated by network parent Bell Media, CKCW-DT maintains studios at Halifax and George Streets in Moncton, with a PEI bureau in Charlottetown. Its transmitter is located on Wilson Road in Hillsborough.
CKCW-DT is part of the CTV Atlantic regional system in the Maritimes. It is a sister station to CKLT-DT in Saint John, which essentially operates as a CKCW rebroadcaster even though it is separately licensed.
History
The station first went on the air in 1954 and was founded by Fred A. Lynds and his company, Moncton Broadcasting, along with CKCW radio (AM 1220, now 94.5 FM). It was originally the CBC Television affiliate for central and northern New Brunswick. CKCW was part of a regional network of stations called the Lionel Television System. Its mascot was called Lionel the Lobster.
On September 21, 1969, as part of a complex realignment of television affiliations in the Maritimes, Saint John's original station, CHSJ-TV (now CBAT-DT) set up a rebroadcaster in Moncton, enabling CKCW-TV to switch to CTV. CKCW then built a full-time satellite in Saint John, CKLT. However, since CHSJ-TV needed time to build rebroadcasters in the northern part of the province, CKCW's rebroadcasters in Campbellton, Upsalquitch and Newcastle aired a mixed CBC-CTV schedule until October 1976.
The two stations were bought by CHUM Limited and merged into the Atlantic Television System, forerunner of CTV Atlantic, in 1972. At the same time, CKCW signed on a repeater in Charlottetown, making PEI the last portion of eastern Canada to receive CTV.
Although for many years the station continued to air local programming, since the mid-1990s it has been a semi-satellite of CTV Atlantic flagship CJCH-DT in Halifax, Nova Scotia, except for local news inserts and some commercials.
Transmitters
* These and a long list of CTV rebroadcasters nationwide were to shut down on or before August 31, 2009, as part of a political dispute with Canadian authorities on paid fee-for-carriage requirements for cable television operators. A subsequent change in ownership assigned full control of CTVglobemedia to Bell Canada; as of 2011, these transmitters remain in normal licensed broadcast operation.
Additionally, CKLT (and its associated rebroadcasters) is considered a full-time satellite of CKCW.
On February 11, 2016, Bell Media applied for its regular license renewals, which included applications to delete a long list of transmitters, including CKAM-TV-1, CKAM-TV-2, CKCW-TV-2, and CKCD-TV. Bell Media's rationale for deleting these analog repeaters is below:
"We are electing to delete these analog transmitters from the main licence with which they are associated. These analog transmitters generate no incremental revenue, attract little to no view |
https://en.wikipedia.org/wiki/CKLT-DT | CKLT-DT (channel 9) is a television station in Saint John, New Brunswick, Canada, part of the CTV Television Network. Owned and operated by network parent Bell Media, the station has studios on Brunswick Square in Saint John, and its transmitter is located near Whitaker Lake in Petersville. It also operates analogue rebroadcast transmitters in Woodstock and Boiestown.
CKLT-DT is part of the CTV Atlantic regional system in The Maritimes. Although separately licensed, the station (along with its two rebroadcasters) is considered a full-time satellite of CKCW-DT in Moncton. Master control and most internal operations are based at CKCW's studios on Halifax and George Streets in Moncton.
Its programming is the same as that of CTV Atlantic flagship CJCH-DT in Halifax, Nova Scotia, with commercials provided from Moncton.
History
CKLT signed on for the first time on September 21, 1969, owned by Moncton Broadcasting along with CKCW-TV. As part of a complex realignment of television affiliations in the Maritimes, Saint John's original station, CHSJ-TV (now CBAT-DT) set up a translator in Moncton, enabling CKCW-TV to switch to CTV. CHUM Limited bought CKCW-TV and CKLT-TV in 1972 and merged them into the Atlantic Television System (ATV) later that year. Along with the rest of the ATV stations, it was sold to Baton Broadcasting on February 26, 1997 (with CRTC approval given on August 28, 1997), enabling Baton to take control of CTV.
Transmitters
On July 30, 2019, Bell Media was granted permission to close down CKLT-TV-2 as part of Broadcasting Decision CRTC 2019–268. This transmitter was shut down by December 3, 2021.
References
External links
CTV Atlantic
KLT-DT
KLT-DT
Mass media in Saint John, New Brunswick
Television channels and stations established in 1969
1969 establishments in New Brunswick |
https://en.wikipedia.org/wiki/CJCB-DT | CJCB-DT (channel 4) is a television station in Sydney, Nova Scotia, Canada, part of the CTV Television Network. Owned and operated by network parent Bell Media, the station maintains studios on George Street/Trunk 22 in Sydney, and its transmitter is located on McMillan Road southwest of the city.
CJCB-DT is part of the CTV Atlantic regional system in the Maritimes, carrying the same programming as sister station CJCH-DT in Halifax at all times, except for some commercials and an annual telethon. On August 1, 2012, CJCB-DT (as CJCB-TV) became the only terrestrial broadcaster in the market, as the CBC repeater station, CBIT-TV, was closed the previous evening.
History
CJCB-TV was the first television station to broadcast in Nova Scotia, when it signed on for the first time on October 9, 1954, beating CBHT-TV in Halifax by two months. It was originally a CBC affiliate. It joined the CBC's national microwave network in 1958, linking all stations between it and British Columbia. Prior to the microwave connection, programming was either from live local studio productions or kinescope 16mm film copies of CBC network shows. The station fully converted to NTSC colour production in 1975, though it was able to transmit colour programming originated through the network starting in September 1966. It continues to broadcast an NTSC analogue terrestrial over-the-air signal, and does not currently have digital ATSC HDTV capabilities.
CJCB was originally owned by the Nathanson family, that also owned CJCB radio at the time. CHUM Limited, owner of CJCH-TV, bought CJCB-TV in 1971 and applied to the Canadian Radio-television and Telecommunications Commission (CRTC) to switch it to the CTV network. The switch occurred on September 26, 1972, when the CBC put CBIT-TV on the air in Sydney. After the switch occurred, it immediately joined the newly formed Atlantic Television Network (ATV), CHUM's network of CTV affiliates in the Maritimes.
As part of CBIT's licence, it was not allowed to show local advertising, leaving CJCB with a monopoly in local advertising. CJCB's monopoly was reaffirmed in a CRTC decision in 1985 that denied a CBIT request to enter that part of the market. CHUM continued to own CJCB-TV until February 26, 1997 (with CRTC approval given on August 28, 1997), when it swapped the entire ATV group to Baton Broadcasting in a deal that saw Baton become majority owner of CTV.
Programming
One of Canada's longest-running TV programs, Mass for Shut-ins, originates at CJCB-TV; it premiered on March 3, 1963, and is still on the air today. It is telecast across the CTV Atlantic system.
Shantytown was another TV program that originated at CJCB-TV; it was aimed at children and ran from 1978 to 1984. Like Mass for Shut-ins, it was also telecast to all three Maritime provinces. Characters include Sam the Sailor, Katie the Craft Lady, Marjorie the Music Lady and their puppet friends.
Technical information
Subchannel
Analogue-to-digital conversion
The station |
https://en.wikipedia.org/wiki/Private%20information%20retrieval | In cryptography, a private information retrieval (PIR) protocol is a protocol that allows a user to retrieve an item from a server in possession of a database without revealing which item is retrieved. PIR is a weaker version of 1-out-of-n oblivious transfer, where it is also required that the user should not get information about other database items.
One trivial, but very inefficient way to achieve PIR is for the server to send an entire copy of the database to the user. In fact, this is the only possible protocol (in the classical or the quantum setting) that gives the user information theoretic privacy for their query in a single-server setting. There are two ways to address this problem: make the server computationally bounded or assume that there are multiple non-cooperating servers, each having a copy of the database.
The problem was introduced in 1995 by Chor, Goldreich, Kushilevitz and Sudan in the information-theoretic setting and in 1997 by Kushilevitz and Ostrovsky in the computational setting. Since then, very efficient solutions have been discovered. Single database (computationally private) PIR can be achieved with constant (amortized) communication and k-database (information theoretic) PIR can be done with communication.
Advances in computational PIR
The first single-database computational PIR scheme to achieve communication complexity less than was created in 1997 by Kushilevitz and Ostrovsky and achieved communication complexity of for any , where is the number of bits in the database. The security of their scheme was based on the well-studied Quadratic residuosity problem. In 1999, Christian Cachin, Silvio Micali and Markus Stadler achieved poly-logarithmic communication complexity. The security of their system is based on the Phi-hiding assumption. In 2004, Helger Lipmaa achieved log-squared communication complexity , where is the length of the strings and is the security parameter. The security of his system reduces to the semantic security of a length-flexible additively homomorphic cryptosystem like the Damgård–Jurik cryptosystem. In 2005 Craig Gentry and Zulfikar Ramzan achieved log-squared communication complexity which retrieves log-square (consecutive) bits of the database. The security of their scheme is also based on a variant of the Phi-hiding assumption. The communication rate was finally brought down to by Aggelos Kiayias, Nikos Leonardos, Helger Lipmaa, Kateryna Pavlyk, Qiang Tang, in 2015.
All previous sublinear-communication computational PIR protocol required linear computational complexity of public-key operations. In 2009, Helger Lipmaa designed a computational PIR protocol with communication complexity and worst-case computation of public-key operations. Amortization techniques that retrieve non-consecutive bits have been considered by Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky and Amit Sahai.
As shown by Ostrovsky and Skeith, the schemes by Kushilevitz and Ostrovsky and Lipmaa use si |
https://en.wikipedia.org/wiki/PWB/UNIX | The Programmer's Workbench (PWB/UNIX) is an early, now discontinued, version of the Unix operating system that had been created in the Bell Labs Computer Science Research Group of AT&T. Its stated goal was to provide a time-sharing working environment for large groups of programmers, writing software for larger batch processing computers.
Prior to 1973 Unix development at AT&T was a project of a small group of researchers in Department 1127 of Bell Labs. As the usefulness of Unix in other departments of Bell Labs was evident, the company decided to develop a version of Unix tailored to support programmers in production work, not just research. The Programmer's Workbench was started in 1973, by Evan Ivie and Rudd Canaday to support a computer center for a 1000-employee Bell Labs division, which would be the largest Unix site for several years. PWB/UNIX was to provide tools for teams of programmers to manage their source code and collaborate on projects with other team members. It also introduced several stability improvements beyond Research Unix, and broadened usage of the Research nroff and troff text formatters, via efforts with Bell Labs typing pools that led to the -mm macros.
While PWB users managed their source code on PDP-11 Unix systems, programs were often written to run on other operating systems. For this reason, PWB included software for submitting jobs to IBM System/370, UNIVAC 1100 series, and SDS Sigma 5 computers. In 1977 PWB supported a user community of about 1100 users in the Business Information Systems Programs (BISP) group of Bell Labs.
Two major releases of Programmer's Workbench were produced. PWB/UNIX 1.0, released July 1, 1977 was based on Version 6 Unix; PWB 2.0 was based on Version 7 Unix. The operating system was advertised by Bell System Software as late as 1981 and edition 1.0 was still on an AT&T price list for educational institutions in 1984. Most of PWB/UNIX was later incorporated in the commercial UNIX System III and UNIX System V releases.
Features
Notable firsts in PWB include:
The Source Code Control System, the first revision control system, written by Marc J. Rochkind
The remote job entry batch-submission system
The PWB shell, written by John R. Mashey, which preceded Steve Bourne's Bourne shell
The restricted shell (rsh), an option of the PWB shell, used to create widely-available logins for status-checking, trouble-reporting, but made safe by restricting commands
The troff -mm (memorandum) macro package, written by John R. Mashey and Dale W. Smith
Utilities like find, cpio, expr, all three written by Dick Haight, xargs, egrep and fgrep
yacc and lex, which, though not written specifically for PWB, were available outside of Bell Labs for the first time in the PWB distribution
See also
Research Unix
Writer's Workbench ("WWB")
References
External links
Unix ad mentioning PWB, from a 1981 issue of Datamation (on Dennis Ritchie's homepage)
PWB distributions, from the Ancient UNIX Archive
|
https://en.wikipedia.org/wiki/AMD%20%28disambiguation%29 | AMD (Advanced Micro Devices) is an American semiconductor manufacturer.
AMD may also refer to:
Science/technology
Acid mine drainage
Age-related macular degeneration of the eye
Algorithmic mechanism design, a field of economics
AMD64 CPU architecture
AMD-65 Automata Módosított Deszantfegyver (Automatic Modified Descent), a Hungarian rifle
Asynchronous module definition, a JavaScript API
amd, the Berkeley Automounter, a daemon on Unix-like operating systems
Alpha-mannosidosis, a lysosomal storage disorder
Business/politics
Aircraft Manufacturing and Design
Alliance for a Democratic Mauritania, or Alliance pour une Mauritanie démocratique, a former political movement
AMD Holdings Inc., an American doll manufacturer
Certified AM Directional Specialist, in broadcasting
Armenian dram, ISO 4217 currency code AMD
Atomic Minerals Directorate for Exploration and Research, Hyderabad, India
American Micro Devices, a 1964–1965 technology company
Arbeitsstelle für Molekularelektronik Dresden, a former name for technology company ZMDI
Other
AMD Academy of Fashion and Design, Germany
A Modest Destiny, a webcomic by Sean Howard
Sardar Vallabhbhai Patel International Airport, Ahmedabad, India, IATA code AMD
See also
`Amd
Amdahl |
https://en.wikipedia.org/wiki/Geode%20%28processor%29 | Geode was a series of x86-compatible system-on-a-chip (SoC) microprocessors and I/O companions produced by AMD, targeted at the embedded computing market.
The series was originally launched by National Semiconductor as the Geode family in 1999. The original Geode processor core itself is derived from the Cyrix MediaGX platform, which was acquired in National's merger with Cyrix in 1997. AMD bought the Geode business from National in August 2003 to augment its existing line of embedded x86 processor products. Before acquiring Geode, AMD marketed the AMD Élan, a family of 32-Bit embedded SoCs based on their own Am386, Am486 and Am586 microprocessors. All of these products have been backed with a long-term supply guarantee to meet the needs of embedded processors. However, after acquiring Geode, the product was suddenly discontinued.
AMD expanded the Geode series to two classes of processor: the MediaGX-derived Geode GX and LX, and the modern Athlon-derived Geode NX.
Geode processors are optimized for low power consumption and low cost while still remaining compatible with software written for the x86 platform. The MediaGX-derived processors lack modern features such as SSE and a large on-die L1 cache but these are offered on the more recent Athlon-derived Geode NX. Geode processors tightly integrate some of the functions normally provided by a separate chipset, such as the northbridge. Whilst the processor family is best suited for thin client, set top box and embedded computing applications, it can be found in unusual applications such as the Nao robot and the Win Enterprise IP-PBX.
The One Laptop per Child project used the GX series Geode processor in OLPC XO-1 prototypes, but moved to the Geode LX for production. The Linutop (rebranded Artec ThinCan DBE61C or rebranded FIC ION603A) is also based on the Geode LX. 3Com Audrey was powered by a 200 MHz Geode GX1.
The SCxxxx range of Geode devices are a single-chip version, comparable to the SiS 552, VIA CoreFusion or Intel's Tolapai, which integrate the CPU, memory controller, graphics and I/O devices into one package. Single processor boards based on these processors are manufactured by Artec Group, PC Engines (WRAP), Soekris, and Win Enterprises.
AMD discontinued all Geode processors in 2019.
Features
National Semiconductor Geode
Geode GXm
Rebranded Cyrix MediaGXm. Returns "CyrixInstead" on CPUID.
0.35 μm four-layer metal CMOS
MMX instructions
Core speed: 180, 200, 233, 266 MHz
3.3 V I/O, 2.9 V core
16 KB four-way set associative write-back unified (I&D) L1 cache, 2 or 4 KB of which can be reserved as I/O scratchpad RAM for use by the integrated graphics core (e.g. for bitblits)
30-33 MHz PCI bus interconnect with CPU bus
64-bit SDRAM interface
Fully static design
CS5530 companion chip (implements sound and video functions)
VSA architecture
1280×1024×8 or 1024×768×16 display
Geode GXLV
Die-shrunk GXm
0.25 μm four-layer metal CMOS
Core speed: 166, 180, 200, 233, 266 MHz
3.3 |
https://en.wikipedia.org/wiki/Islam%20in%20Indonesia | Islam is the largest religion in Indonesia, with 87% of the Indonesian Population identifying themselves as Muslims, based on civil registry data in 2022. In terms of denomination, the overwhelming majority are Sunni Muslims, Pew Research Center estimating them as ~99% of the Muslim population in 2011, with the remaining 1% being Shia who are concentrated around Jakarta and about 400,000 Ahmadi Muslims as well.
In terms of schools of jurisprudence, based on demographic statistics, 99% of Indonesian Muslims mainly follow the Shafi'i school, although when asked, 56% does not adhere to any specific school. Trends of thought within Islam in Indonesia can be broadly categorized into two orientations: "modernism", which closely adheres to orthodox theology while embracing modern learning, and "traditionalism", which tends to follow the interpretations of local religious leaders and religious teachers at Islamic boarding schools (pesantren). There is also a historically important presence of a syncretic form of Islam known as kebatinan.
Islam in Indonesia is considered to have gradually spread through merchant activities by Arab Muslim traders, adoption by local rulers, and the influence of Sufism since the 13th century. During the late colonial era, it was adopted as a rallying banner against colonialism. A 2023 Pew Research Center report gave 93% of the adult Indonesian population identifying themselves as Muslim. Today, although Indonesia has an overwhelming Muslim majority, it is not an Islamic state, but constitutionally a secular state whose government officially recognizes six formal religions.
Distribution
Muslims constitute a majority in most regions of Java, Sumatra, West Nusa Tenggara, Sulawesi, coastal areas of Kalimantan, and North Maluku. Muslims form distinct minorities in Papua, Bali, East Nusa Tenggara, parts of North Sumatra, most inland areas of Kalimantan, and North Sulawesi. Together, these non-Muslim areas originally constituted more than one-third of Indonesia prior to the massive transmigration effort sponsored by the Suharto government and recent spontaneous internal migration.
Internal migration has altered the demographic makeup of the country over the past three decades. It has increased the percentage of Muslims in formerly predominantly-Christian eastern parts of the country. By the early 1990s, Christians became a minority for the first time in some areas of the Maluku Islands. While government-sponsored transmigration from the heavily-populated Java and Madura to less-populated areas contributed to the increase in the Muslim population in the resettlement areas, no evidence suggests that the government intended to create a Muslim majority in Christian areas, and most Muslim migration seemed spontaneous. Regardless of its intent, the economic and political consequences of the transmigration policy contributed to religious conflicts in Maluku, Central Sulawesi, and to a lesser extent, Papua.
Islam in Indonesia by pr |
https://en.wikipedia.org/wiki/Guard%20%28computer%20science%29 | In computer programming, a guard is a boolean expression that must evaluate to true if the program execution is to continue in the branch in question. Regardless of which programming language is used, a guard clause, guard code, or guard statement, is a check of integrity preconditions used to avoid errors during execution.
Uses
A typical example is checking that a reference about to be processed is not null, which avoids null-pointer failures.
Other uses include using a boolean field for idempotence (so subsequent calls are nops), as in the dispose pattern.public string Foo(string username)
{
if (username == null) {
throw new ArgumentNullException(nameof(username), "Username is null.");
}
// Rest of the method code follows here...
}
Flatter code with less nesting
The guard provides an early exit from a subroutine, and is a commonly used deviation from structured programming, removing one level of nesting and resulting in flatter code: replacing if guard { ... } with if not guard: return; ....
Using guard clauses can be a refactoring technique to improve code. In general, less nesting is good, as it simplifies the code and reduces cognitive burden.
For example, in Python:
# This function has no guard clause
def f_noguard(x):
if isinstance(x, int):
#code
#code
#code
return x + 1
else:
return None
# Equivalent function with a guard clause. Note that most of the code is less indented, which is good
def f_guard(x):
if not isinstance(x, int):
return None
#code
#code
#code
return x + 1
Another example, written in C:
// This function has no guard clause
int funcNoGuard(int x) {
if (x >= 0) {
//code
//code
//code
return x + 1;
} else {
return 0;
}
}
// Equivalent function with a guard clause
int funcGuard(int x) {
if (x < 0) {
return 0;
}
//code
//code
//code
return x + 1;
}
Terminology
The term is used with specific meaning in APL, Haskell, Clean, Erlang, occam, Promela, OCaml, Swift, Python from version 3.10, and Scala programming languages. In Mathematica, guards are called constraints. Guards are the fundamental concept in Guarded Command Language, a language in formal methods. Guards can be used to augment pattern matching with the possibility to skip a pattern even if the structure matches. Boolean expressions in conditional statements usually also fit this definition of a guard although they are called conditions.
Mathematics
In the following Haskell example, the guards occur between each pair of "|" and "=":
f x
| x > 0 = 1
| otherwise = 0
This is similar to the respective mathematical notation:
In this case the guards are in the "if" and "otherwise" clauses.
Multiple guards
If there are several parallel guards, they are normally tried in a top-to-bottom order, and the branch of the first to pass is chosen. Guards in a list of cases are typically parallel.
However, in Haskell list com |
https://en.wikipedia.org/wiki/Pacific%20Northwest%20Seismic%20Network | The Pacific Northwest Seismic Network, or PNSN, collects and studies ground motions from about 400 seismometers in the U.S. states of Oregon and Washington. PNSN monitors volcanic and tectonic activity, gives advice and information to the public and policy makers, and works to mitigate earthquake hazard.
Motivation
Damaging earthquakes are well known in the Pacific Northwest, including several larger than magnitude 7, most notably the M9 1700 Cascadia earthquake and the M7.0–7.3 earthquake in about 900AD on the Seattle Fault. The M6.5 1965 Puget Sound earthquake shook the Seattle, Washington, area, causing substantial damage and seven deaths. This event spurred the installation of the Pacific Northwest Seismic Network in 1969 to monitor regional earthquake activity. Early in 1980 PNSN scientists detected unrest under Mt. St. Helens and by March 1980 predicted an eruption was likely to occur "soon". On March 27 the first steam and ash explosion occurred. The PNSN expanded to better monitor Mt. St. Helens and other Cascade Volcanos leading up to the deadly May 18 eruption and in the years following.
Observations and efficacy
Earthquakes are recorded frequently beneath Mount St. Helens, Mount Rainier, and Mount Hood. After successfully using seismic activity to predict the 1980 Mt. St. Helens eruption, monitoring was expanded to other Cascade Mountains volcanoes. The PNSN, in conjunction with the Cascades Volcano Observatory of the USGS, now monitors seismicity at all the Cascade volcanoes in Washington and Oregon.
The network was significantly expanded after the damaging 2001 Nisqually earthquake. After an earthquake on January 30, 2009, the network's emergency notification system failed. A magnitude 4.3 earthquake in February 2015 showed that the present architecture of the network results in a significant delay in the early warning notification program, depending upon the location of the quake, leading to proposals to again expand the network. The early warning notification program was implemented with its reliability contingent upon unknown future funding, but with the election of Donald Trump "future funding is uncertain" according to Washington Congressman Derek Kilmer.
The president's budget for the fiscal year commencing October 1, 2018, calls for reductions in funding and staff for the early warning notification program.
Operations and data archiving
The network operates from the Earth and Space Sciences Department at the University of Washington in Seattle, and its data archiving is at the Data Management Center of the IRIS Consortium in Seattle. The network is also affiliated with the University of Oregon Department of Geology. It is the second largest of the regional seismic networks in the ANSS (Advanced National Seismic System) and has produced more data than the networks in the states of Alaska, Utah, Nevada, Hawaii and the New Madrid, Missouri-Tennessee-Kentucky-Arkansas area.
The network is funded primarily by the United |
https://en.wikipedia.org/wiki/SpinRite | SpinRite is a computer program for scanning RAS Random Access Storage devices such as hard disks, reading and rewriting data using proprietary programming methods to resolve and retrieve data that is unreadable by DOS or Windows. The first version was released in 1987 by Steve Gibson. The current version, 6.0, (available ) was released in 2004., with ongoing development open to the public at https://www.grc.com/dev/spinrite/
SpinRite is run from a bootable medium (such as a CD, DVD or USB flash drive) on a PC-compatible computer, allowing it to scan a computer's storage medium. It does not depend on the operating system installed on the computer.
History
SpinRite was originally written as a hard drive interleave tool. At the time SpinRite was designed, hard drives often had a defect list printed on the nameplate, listing known bad sectors discovered at the factory. In changing the drive's interleave, SpinRite needed to be able to remap these physical defects into different logical sectors. SpinRite therefore gained its data recovery and testing capabilities as a side-effect of its original purpose. Drive interleave has long ceased to be an issue, but SpinRite continued to be developed, now using its remapping as a data recovery tool.
Features
SpinRite tests the data surfaces of writeable magnetic disks, including IDE, SATA, and floppy disks, plus SSD Solid State Drives. It analyzes their contents and can refresh the magnetic disk surfaces or flash memory storage to allow them to operate more reliably.
SpinRite attempts to recover data from drives that the operating system cannot read. When the program encounters errors reading data, it uses proprietary programming to try to read the sector up to 2000 times, in order to determine, by comparing the successive results, the most probable value of each bit. The data is then saved to the original location or to a location on the same disk; it does not save data elsewhere. In this respect, SpinRite differs from most data recovery software, which usually provides (and recommends) an option to save the recovered data onto another disk, or onto a separate partition on the same disk.
Gibson says he designed SpinRite to fix sector problems, not failures of circuit boards, motors, or other mechanical parts. When a hard drive's ability to read data slows and or begins unreliable, SpinRite may recover data that then can be copied to another drive.
SpinRite is claimed by its developer to have certain unique features, such as disabling of disk write caching, disabling of auto-relocation, compatibility with disk compression, identification of the "data-to-flux-reversal encoder-decoder" used in a drive, and separate testing of buffered and unbuffered disk read performance, and direct hardware-level access, whereby the drive's internal controller interacts directly with the program, rather than through the operating system. This, in turn, allows dynamic head repositioning, whereby, when reading a faulty se |
https://en.wikipedia.org/wiki/Mobile%20station | A mobile station (MS) comprises all user equipment and software needed for communication with a mobile network.
The term refers to the global system connected to the mobile network, i.e. a mobile phone or mobile computer connected using a mobile broadband adapter. This is the terminology of 2G systems like GSM. In 3G systems, a mobile station (MS) is now referred to as user equipment (UE).
In GSM, a mobile station consists of four main components:
Mobile termination (MT) - offers common functions such as: radio transmission and handover, speech encoding and decoding, error detection and correction, signalling and access to the SIM. The IMEI code is attached to the MT. It is equivalent to the network termination of an ISDN access.
Terminal equipment (TE) - is any device connected to the MS offering services to the user. It does not contain any functions specific to GSM.
Terminal adapter (TA) - provides access to the MT as if it were an ISDN network termination with extended capabilities. Communication between the TE and MT over the TA takes place using AT commands.
Subscriber identity module (SIM) - is a removable subscriber identification token storing the IMSI, a unique key shared with the mobile network operator and other data.
In a mobile phone, the MT, TA and TE are enclosed in the same case. However, the MT and TE functions are often performed by distinct processors. The application processor serves as a TE, while the baseband processor serves as a MT, communication between both takes place over a bus using AT commands, which serves as a TA.
See also
GSM procedures
Radio station
Radiocommunication service
References
Mobile telecommunications user equipment
Telecommunications equipment
Telecommunications infrastructure
3GPP standards |
https://en.wikipedia.org/wiki/Social%20software%20%28research%20field%29 | In philosophy and the social sciences, social software is an interdisciplinary research program that borrows
mathematical tools and techniques from game theory and computer science in order to analyze and design social procedures. The goals of research in this field are modeling social situations, developing theories of correctness, and designing social procedures.
Work under the term social software has been going on since about 1996, and conferences in Copenhagen, London, Utrecht and New York, have been partly or wholly devoted to it. Much of the work is carried out at the City University of New York under the leadership of Rohit Jivanlal Parikh, who was influential in the development of the field.
Goals and tools
Current research in the area of social software include the analysis of social procedures and examination of them for fairness, appropriateness, correctness and efficiency. For example, an election procedure could be a simple majority vote, Borda count, a Single Transferable vote (STV), or Approval voting. All of these procedures can be examined for various properties like monotonicity. Monotonicity has the property that voting for a candidate should not harm that candidate. This may seem obvious, true
under any system, but it is something which can happen in STV. Another question would be the ability to elect a Condorcet winner in case there is one.
Other principles which are considered by researchers in social software include the concept that a procedure for fair division should be Pareto optimal, equitable and envy free. A procedure for auctions should be one which would encourage bidders to bid their actual valuation – a property which holds with the Vickrey auction.
What is new in social software compared to older fields is the use of tools from computer science like program logic, analysis of algorithms and epistemic logic. Like programs, social procedures dovetail into each other. For instance an airport provides runways for planes to land, but it also provides security checks, and it must provide for ways in which buses and taxis can take arriving passengers to their local destinations. The entire mechanism can be analyzed in the way in which a complex computer program can be analyzed. The Banach-Knaster procedure for dividing a cake fairly, or the Brams and Taylor procedure for fair division have been analyzed in this way. To point to the need for epistemic logic, a building not only needs restrooms, for obvious reasons, it also needs signs indicating where they are. Thus epistemic considerations enter in addition to structural ones. For a more urgent example, in addition to medicines, physicians also need tests to indicate what a patient's problem is.
See also
Dynamic logic
Epistemic logic
Fair division
Game theory
Mechanism design
No-trade theorem
Social procedure
Social technology
Notes
Further reading
John Searle, The Construction of Social Reality (1995) New York : Free Press, c1995.
Rohit Pari |
https://en.wikipedia.org/wiki/Australian%20Technology%20Network | The Australian Technology Network (ATN) is a network of six Australian universities, with a strong history of innovation, enterprise and working closely with industry. ATN traces its origins back to 1975 as the Directors of Central Institutes of Technology (DOCIT), and was revived in 1999 in its present form with changes to its membership announced in 2018, 2020, 2021 and 2023.
ATN is the second largest university grouping in Australia, in terms of student number and research funding.
History
The ATN originated in 1975 as the "Directors of Central Institutes of Technology (DOCIT)", a conference group consisting of the directors of Australia's leading "institutes of technology". Each of DOCIT's original member institutions (NSWIT, QIT, RMIT, SAIT and WAIT) were located in the central business district of their respective state's capital city, hence they were deemed "central institutes of technology".
DOCIT founded its original member institutes' distinctiveness on their size (they enrolled almost one third of all full-time advanced education students), on the advanced level of their teaching (most of their programs were degrees rather than the diplomas like that of other advanced education institutions) and their conduct of applied research (DEET, 1993:18). They were therefore like a "technology-focused" group.
DOCIT encountered too much opposition to its aspirations, and disbanded in 1982. The conference group was later revived in 1999 as the Australian Technology Network, consisting of: the Curtin University of Technology, Queensland University of Technology, Royal Melbourne Institute of Technology, University of South Australia and University of Technology Sydney. Each ATN member university was granted public university status between 1986 and 1992, however their antecedents make them some of the oldest tertiary institutions in Australia.
QUT departed ATN on 28 September 2018.
Deakin University was announced as a new ATN member on 8 December 2020, bringing the Network's membership back up to five universities and making the network Australia's second largest university grouping in terms of student numbers and research funding. Deakin's membership bolsters ATN's geographic footprint with a presence in the regional gateway city of Geelong and regional Victoria.
On November 2021, the University of Newcastle joined the Australian Technology Network as an Associate Member, becoming the sixth member of the network. Newcastle's membership further enahnced ATN's regional footprint into the Central Coast and Hunter regions. The University of Newcastle became a full member in 2023.
Members
See also
List of universities in Australia
Group of Eight
Innovative Research Universities Australia
Regional Universities Network
Association of American Universities
C9 League
Russell Group
National Institutes of Technology
TU9
U15 Group of Canadian Research Universities
Notes
References
External links
Australian Technology Network Homepage
College an |
https://en.wikipedia.org/wiki/Belief%20revision | Belief revision is the process of changing beliefs to take into account a new piece of information. The logical formalization of belief revision is researched in philosophy, in databases, and in artificial intelligence for the design of rational agents.
What makes belief revision non-trivial is that several different ways for performing this operation may be possible. For example, if the current knowledge includes the three facts " is true", " is true" and "if and are true then is true", the introduction of the new information " is false" can be done preserving consistency only by removing at least one of the three facts. In this case, there are at least three different ways for performing revision. In general, there may be several different ways for changing knowledge.
Revision and update
Two kinds of changes are usually distinguished:
update the new information is about the situation at present, while the old beliefs refer to the past; update is the operation of changing the old beliefs to take into account the change;
revision both the old beliefs and the new information refer to the same situation; an inconsistency between the new and old information is explained by the possibility of old information being less reliable than the new one; revision is the process of inserting the new information into the set of old beliefs without generating an inconsistency.
The main assumption of belief revision is that of minimal change: the knowledge before and after the change should be as similar as possible. In the case of update, this principle formalizes the assumption of inertia. In the case of revision, this principle enforces as much information as possible to be preserved by the change.
Example
The following classical example shows that the operations to perform in the two settings of update and revision are not the same. The example is based on two different interpretations of the set of beliefs and the new piece of information :
update in this scenario, two satellites, Unit A and Unit B, orbit around Mars; the satellites are programmed to land while transmitting their status to Earth; and Earth has received a transmission from one of the satellites, communicating that it is still in orbit. However, due to interference, it is not known which satellite sent the signal; subsequently, Earth receives the communication that Unit A has landed. This scenario can be modeled in the following way: two propositional variables and indicate that Unit A and Unit B, respectively, are still in orbit; the initial set of beliefs is (either one of the two satellites is still in orbit) and the new piece of information is (Unit A has landed, and is therefore not in orbit). The only rational result of the update is ; since the initial information that one of the two satellites had not landed yet was possibly coming from the Unit A, the position of the Unit B is not known.
revision the play "Six Characters in Search of an Author" will be performe |
https://en.wikipedia.org/wiki/Semidefinite%20embedding | Maximum Variance Unfolding (MVU), also known as Semidefinite Embedding (SDE), is an algorithm in computer science that uses semidefinite programming to perform non-linear dimensionality reduction of high-dimensional vectorial input data.
It is motivated by the observation that kernel Principal Component Analysis (kPCA) does not reduce the data dimensionality, as it leverages the Kernel trick to non-linearly map the original data into an inner-product space.
Algorithm
MVU creates a mapping from the high dimensional input vectors to some low dimensional Euclidean vector space in the following steps:
A neighbourhood graph is created. Each input is connected with its k-nearest input vectors (according to Euclidean distance metric) and all k-nearest neighbors are connected with each other. If the data is sampled well enough, the resulting graph is a discrete approximation of the underlying manifold.
The neighbourhood graph is "unfolded" with the help of semidefinite programming. Instead of learning the output vectors directly, the semidefinite programming aims to find an inner product matrix that maximizes the pairwise distances between any two inputs that are not connected in the neighbourhood graph while preserving the nearest neighbors distances.
The low-dimensional embedding is finally obtained by application of multidimensional scaling on the learned inner product matrix.
The steps of applying semidefinite programming followed by a linear dimensionality reduction step to recover a low-dimensional embedding into a Euclidean space were first proposed by Linial, London, and Rabinovich.
Optimization formulation
Let be the original input and be the embedding. If are two neighbors, then the local isometry constraint that needs to be satisfied is:
Let be the Gram matrices of and (i.e.: ). We can express the above constraint for every neighbor points in term of :
In addition, we also want to constrain the embedding to center at the origin:
As described above, except the distances of neighbor points are preserved, the algorithm aims to maximize the pairwise distance of every pair of points. The objective function to be maximized is:
Intuitively, maximizing the function above is equivalent to pulling the points as far away from each other as possible and therefore "unfold" the manifold. The local isometry constraint
Let where
prevents the objective function from diverging (going to infinity).
Since the graph has N points, the distance between any two points . We can then bound the objective function as follows:
The objective function can be rewritten purely in the form of the Gram matrix:
Finally, the optimization can be formulated as:
After the Gram matrix is learned by semidefinite programming, the output can be obtained via Cholesky decomposition.
In particular, the Gram matrix can be written as where is the i-th element of eigenvector of the eigenvalue .
It follows that the -th element of the output is .
See a |
https://en.wikipedia.org/wiki/KMDB | KMDB may refer to:
Kharkiv Morozov Machine Building Design Bureau
Korean Movie Database or KMDb |
https://en.wikipedia.org/wiki/List%20of%20undecidable%20problems | In computability theory, an undecidable problem is a type of computational problem that requires a yes/no answer, but where there cannot possibly be any computer program that always gives the correct answer; that is, any possible program would sometimes give the wrong answer or run forever without giving any answer. More formally, an undecidable problem is a problem whose language is not a recursive set; see the article Decidable language. There are uncountably many undecidable problems, so the list below is necessarily incomplete. Though undecidable languages are not recursive languages, they may be subsets of Turing recognizable languages: i.e., such undecidable languages may be recursively enumerable.
Many, if not most, undecidable problems in mathematics can be posed as word problems: determining when two distinct strings of symbols (encoding some mathematical concept or object) represent the same object or not.
For undecidability in axiomatic mathematics, see List of statements undecidable in ZFC.
Problems in logic
Hilbert's Entscheidungsproblem.
Type inference and type checking for the second-order lambda calculus (or equivalent).
Determining whether a first-order sentence in the logic of graphs can be realized by a finite undirected graph.
Trakhtenbrot's theorem - Finite satisfiability is undecidable.
Satisfiability of first order Horn clauses.
Problems about abstract machines
The halting problem (determining whether a Turing machine halts on a given input) and the mortality problem (determining whether it halts for every starting configuration).
Determining whether a Turing machine is a busy beaver champion (i.e., is the longest-running among halting Turing machines with the same number of states and symbols).
Rice's theorem states that for all nontrivial properties of partial functions, it is undecidable whether a given machine computes a partial function with that property.
The halting problem for a Minsky machine: a finite-state automaton with no inputs and two counters that can be incremented, decremented, and tested for zero.
Universality of a Nondeterministic Pushdown automaton: determining whether all words are accepted.
The problem whether a tag system halts.
Problems about matrices
The mortal matrix problem: determining, given a finite set of n × n matrices with integer entries, whether they can be multiplied in some order, possibly with repetition, to yield the zero matrix. This is known to be undecidable for a set of six or more 3 × 3 matrices, or a set of two 15 × 15 matrices.
Determining whether a finite set of upper triangular 3 × 3 matrices with nonnegative integer entries generates a free semigroup.
Determining whether two finitely generated subsemigroups of integer matrices have a common element.
Problems in combinatorial group theory
The word problem for groups.
The conjugacy problem.
The group isomorphism problem.
Problems in topology
Determining whether two finite simplicial complexes are |
https://en.wikipedia.org/wiki/Peak%20Forest%20Canal | The Peak Forest Canal is a narrow ( gauge) locked artificial waterway in northern England. It is long and forms part of the connected English/Welsh inland waterway network.
Route and features
General description
The canal consists of two level pounds, separated by a flight of 16 locks that raise the canal by over the course of .
The two pounds of the canal are generally known as the Upper Peak Forest Canal and Lower Peak Forest Canal. Whilst there is no evidence that these names were used historically, the designation Lower Peak Forest Canal was used in the British Waterways Act 1983, which redesignated the lower part of the canal as a cruising waterway.
Route
The Lower Peak Forest Canal heads south from Dukinfield Junction at Dukinfield in Greater Manchester, where it makes a junction with the Ashton Canal at the southern end of the Tame Aqueduct () through Newton, Hyde, Woodley, Bredbury and Romiley, before crossing the River Goyt on Marple Aqueduct, alongside the railway's Marple Viaduct, to the foot of Marple Locks, a distance of . The environs are largely rural, passing woods and fields, with some industrial premises encroaching towards the Dukinfield end of the pound.
Whilst the section through Marple Locks is legally a part of the Lower Peak Forest Canal it is often considered as a separate section, raising the canal through in a partly woodland, partly municipal park and partly urban setting through the centre of Marple, to connect with the Macclesfield Canal at Marple junction.
The Upper Peak Forest Canal is on the same level as that of the upper Macclesfield Canal, allowing boats to cruise from Whaley Bridge or Bugsworth all the way to the top lock at Bosley without having to use a lock. The canal is perched halfway up the valley-side with extensive views of Furness Vale, and the Peak District beyond from Marple through Strines, Disley, New Mills, Furness Vale and Bridgemont. It terminates at Bugsworth Basin, Derbyshire (), a distance of . The village was renamed Buxworth in Victorian times. Recently, the extensive basin has been reopened, and is now a popular venue for visiting boats. There is also a short branch from Bridgemont to the centre of Whaley Bridge, once the site of a connection to the Cromford and High Peak Railway, which ran across the Peak District and joined up with the Cromford Canal.
Cruising rings
The section from Dukinfield Junction to Marple Junction is part of the Cheshire Ring route.
History
Authorisation
The canal was authorised by Act of Parliament (34 Geo. 3. c. 26) in 1794 and its purpose was to provide an outlet for the vast limestone deposits around Dove Holes. As Dove Holes is over above sea level, the canal was terminated in a basin at Bugsworth in Derbyshire and the line was continued up to the quarries by means of a gravity-operated feeder tramway, known as the Peak Forest Tramway, which was long.
Construction
The construction of the canal and tramway was promoted by Samuel Oldknow (the |
https://en.wikipedia.org/wiki/Radio%20America%20%28United%20States%29 | Radio America is an American radio network specializing in conservative-oriented talk programming. A division of the American Studies Center, the network says its mission is "to produce and syndicate quality radio programs reflecting a commitment to traditional American values, limited government and the free market." The American Studies Center has funded special broadcast projects at Radio America, such as a documentary series on African American conservatives, and conservative programming like The Alan Keyes Show; What's the Story? With Fred Barnes; Common Sense Radio with Oliver North; Bob Barr's Laws of the Universe; Veterans Chronicles with Gene Pell; The G. Gordon Liddy Show; The Greg Knapp Experience; and Dateline Washington with Greg Corombos.
The network currently broadcasts a mix of general interest programming, including Doug Stephan and conservative talk host Chad Benson, during the week, and a variety of weekend talk shows on various topics (such as The Money Pit and The Pet Show with Warren Eckstein.
Radio America weekday programming airs on over 600 radio stations nationwide.
History
Radio America was founded in 1985 by its current president, James C. Roberts. In 1997, it achieved full network status, broadcasting 24 hours a day, seven days a week. Currently, Radio America distributes 15 hours of new programming each weekday. Throughout its existence, Radio America has been producing news, talk, documentary and short-features programming that has been picked up by stations around the nation.
Radio America programming is delivered to radio stations via satellite. Weekdays feature mainly news and political talk shows, while weekends offer specialty programs ranging from home finance and sports to medical advice and politics.
Radio America has a sister organization, the American Veterans Center, which is also funded by the American Studies Center.
Awards
In 1994, Radio America produced The Blues Story: Triumph of An American Musical Art Form, a six-part radio documentary that won a Keeping the Blues Alive Award from the Blues Foundation.
The network has won a host of other awards, including the New York International Radio Festival's Gold and Silver medals, the ABA Silver Gavel, Gabriel, Ohio State, and Freedom Foundation.
References
External links
Radio America's Official Website
Radio America Programming Schedule
Radio America YouTube Channel
American Veterans Center (R.A.'s Sister Organization)
National Memorial Day Parade (A project of the American Studies Center)
American radio networks
Conservative talk radio
1985 establishments in the United States |
https://en.wikipedia.org/wiki/ICE%20%28cipher%29 | In cryptography, ICE (Information Concealment Engine) is a symmetric-key block cipher published by Kwan in 1997. The algorithm is similar in structure to DES, but with the addition of a key-dependent bit permutation in the round function. The key-dependent bit permutation is implemented efficiently in software. The ICE algorithm is not subject to patents, and the source code has been placed into the public domain.
ICE is a Feistel network with a block size of 64 bits. The standard ICE algorithm takes a 64-bit key and has 16 rounds. A fast variant, Thin-ICE, uses only 8 rounds. An open-ended variant, ICE-n, uses 16n rounds with 64n bit key.
Van Rompay et al. (1998) attempted to apply differential cryptanalysis to ICE. They described an attack on Thin-ICE which recovers the secret key using 223 chosen plaintexts with a 25% success probability. If 227 chosen plaintexts are used, the probability can be improved to 95%. For the standard version of ICE, an attack on 15 out of 16 rounds was found, requiring 256 work and at most 256 chosen plaintexts.
Structure
ICE is a 16-round Feistel network. Each round uses a 32→32 bit F function, which uses 60 bits of key material.
The structure of the F function is somewhat similar to DES: The input is expanded by taking overlapping fields, the expanded input is XORed with a key, and the result is fed to a number of reducing S-boxes which undo the expansion.
First, ICE divides the input into 4 overlapping 10-bit values. They are bits 30, 31 and 0–7 of the input for the first 10-bit value and for the next values 6–15, 14–23, and 22–31.
Second is a keyed permutation, which is unique to ICE. Using a 20-bit permutation subkey, bits are swapped between halves of the 40-bit expanded input. (If subkey bit i is 1, then bits i and i+20 are swapped.)
Third, the 40-bit value is XORed with 40 more subkey bits.
Fourth, the value is fed through 4 10-bit S-boxes, each of which produces 8 bits of output. (These are much larger than DES's 8 6→4 bit S-boxes.)
Fifth, the S-box output bits are permuted so that each S-box's outputs are routed to each 4-bit field of 32-bit word, including 2 of the 8 "overlap" bits duplicated during the next round's expansion.
Like DES, a software implementation would typically store the S-boxes pre-permuted, in 4 1024×32 bit lookup tables.
References
Matthew Kwan, The Design of the ICE Encryption Algorithm, Fast Software Encryption 1997, pp. 69–82 .
Bart van Rompay, Lars R. Knudsen and Vincent Rijmen, Differential Cryptanalysis of the ICE Encryption Algorithm, Fast Software Encryption 1998, pp270–283 (PDF).
External links
The ICE Home Page
The ICE information slides
Feistel ciphers |
https://en.wikipedia.org/wiki/Enhanced%20Variable%20Rate%20Codec | Enhanced Variable Rate CODEC (EVRC) is a speech codec used in CDMA networks. It was developed in 1995 to replace the QCELP vocoder which used more bandwidth on the carrier's network, thus EVRC's primary goal was to offer the mobile carriers more capacity on their networks while not increasing the amount of bandwidth or wireless spectrum needed. EVRC uses RCELP technology.
EVRC compresses each 20 milliseconds of 8000 Hz, 16-bit sampled speech input into output frames of one of three different sizes: full rate – 171 bits (8.55 kbit/s), half rate – 80 bits (4.0 kbit/s), eighth rate – 16 bits (0.8 kbit/s). A quarter rate was not included in the original EVRC specification and eventually became part of EVRC-B.
EVRC was replaced by SMV. Recently, however, SMV itself has been replaced by the new CDMA2000 4GV codecs. 4GV is the next generation 3GPP2 standards-based EVRC-B codec. 4GV is designed to allow service providers to dynamically prioritize voice capacity on their network as required.
EVRC can be also used in 3GPP2 container file format - 3G2.
External links
3GPP2 specification
EVRC – The Savior of CDMA?
- Enhancements to RTP Payload Formats for EVRC Family Codecs
References
Speech codecs
3rd Generation Partnership Project 2 standards |
https://en.wikipedia.org/wiki/Relaxed%20code-excited%20linear%20prediction | Relaxed code-excited linear prediction (RCELP) is a method used in some advanced speech codecs. The RCELP algorithm does not attempt to match the original signal exactly. Instead, it matches a time-warped version of this original signal that conforms to a simplified pitch contour.
References
Speech codecs |
https://en.wikipedia.org/wiki/IS-641 | TIA/EIA standard IS-641 is a speech coding standard used in some computer and telecommunications networks in the U.S.A. The main usage was in the U.S. TDMA networks defined by IS-136. The bit rate of the speech codec is 7.4 kbit/s. This codec is the same as the 7.4 kbit/s mode in the AMR speech codec. The standard has been superseded by TIA/EIA-136-410.
Speech codecs
Mobile telecommunications standards |
https://en.wikipedia.org/wiki/Selectable%20Mode%20Vocoder | Selectable Mode Vocoder (SMV) is variable bitrate speech coding standard used in CDMA2000 networks. SMV provides multiple modes of operation that are selected based on input speech characteristics.
The SMV for Wideband CDMA is based on 4 codecs: full rate at 8.5 kbit/s, half rate at 4 kbit/s, quarter rate at 2 kbit/s, and eighth rate at 800 bit/s. The full rate and half rate are based on the CELP algorithm that is based on a combined closed-loop-open-loop-analysis (COLA). In SMV the signal frames are first classified as:
Silence/Background noise
Non-stationary unvoiced
Stationary unvoiced
Onset
Non-stationary voiced
Stationary voiced
The algorithm includes voice activity detection (VAD) followed by an elaborate frame classification scheme. Silence/background noise and stationary unvoiced frames are represented by spectrum-modulated noise and coded at 1/4 or 1/8 rate. The SMV uses 4 subframes for full rate and two/three subframes for half rate. The stochastic (fixed) codebook structure is also elaborate and uses sub-codebooks each tuned for a particular type of speech. The sub-codebooks have different degrees of pulse sparseness (more sparse for noise like excitation). SMV scores a high of 3.6 MOS at full rate with clean speech.
The coder works on a frame of 160 speech samples (20 ms) and requires a look ahead of 80 samples (10 ms) if noise-suppression option B is used. An additional 24 samples of look ahead is required if noise-suppression option A is used. So the algorithmic delay for the coder is 30 ms with noise-suppression option B and 33 ms with noise-suppression option A.
The next evolution of CDMA speech codecs is VMR-WB which provides much higher speech quality with wideband while fitting to the same networks.
SMV can be also used in 3GPP2 container file format – 3G2.
References
External links
- RTP Payload Format for Enhanced Variable Rate Codecs (EVRC) and Selectable Mode Vocoders (SMV)
Speech codecs
3rd Generation Partnership Project 2 standards
Mobile telecommunications standards
Code division multiple access |
https://en.wikipedia.org/wiki/Interactive%20kiosk | An interactive kiosk is a computer terminal featuring specialized hardware and software that provides access to information and applications for communication, commerce, entertainment, or education.
By 2010, the largest bill pay kiosk network is AT&T for the phone customers which allows customers to pay their phone bills. Verizon and Sprint have similar units for their customers.
Early interactive kiosks sometimes resembled telephone booths, but have been embraced by retail, food service, and hospitality to improve customer service and streamline operations. Interactive kiosks are typically placed in the high foot traffic settings such as shops, hotel lobbies, or airports.
The integration of technology allows kiosks to perform a wide range of functions, evolving into self-service kiosks. For example, kiosks may enable users to order from a shop's catalog when items are not in stock, check out a library book, look up information about products, issue a hotel key card, enter a public utility bill account number to perform an online transaction, or collect cash in exchange for merchandise. Customized components such as coin hoppers, bill acceptors, card readers, and thermal printers enable kiosks to meet the owner's specialized needs.
History
The first self-service, interactive kiosk was developed in 1977 at the University of Illinois at Urbana–Champaign by a pre-med student, Murray Lappe. The content was created on the PLATO computer system and accessible by the plasma touch-screen interface. The plasma display panel was invented at the University of Illinois by Donald L. Bitzer. Lappe's kiosk, called The Plato Hotline allowed students and visitors to find movies, maps, directories, bus schedules, extracurricular activities, and courses.
The first successful network of interactive kiosks used for commercial purposes was a project developed by the shoe retailer Florsheim Shoe Co., led by their executive VP, Harry Bock, installed circa 1985. The interactive kiosk was created, manufactured, and customized by ByVideo Inc. of Sunnyvale, CA. The network of over 600 kiosks provided images and video promotion for customers who wished to purchase shoes that were not available in the retail location. Style, size, and color could be selected, and the product paid for on the kiosk itself. The transaction was sent to the Florsheim mainframe in St, Louis, MO, via dialup lines, for next-day home or store delivery via Federal Express. The hardware (including a microcomputer, display system, touchscreen) was designed and built by ByVideo, while other components (like the CRT, floppy disk, printer, keyboard, and physical housing) were sourced from other vendors. The videodisc material was created quarterly by ByVideo at Florsheim's direction, in ByVideo's state-of-the-art video production facility in CA. This kiosk network operated for over 6 years in Florsheim retail locations.
In 1991, the first commercial kiosk with an internet connection was displayed at |
https://en.wikipedia.org/wiki/Movement%20for%20Democracy | Movement for Democracy can refer to three political parties:
Movement for Democracy (Cape Verde)
Movement for Democracy (Slovakia)
Movement for Democracy – The Network, Italy
See also
Democratic Movement (disambiguation)
Movement for Democracy and Independence
Movement for Democracy and Development (disambiguation) |
https://en.wikipedia.org/wiki/Tandy%20Pocket%20Computer | The Tandy Pocket Computer or TRS-80 Pocket Computer is one of a line of 1980s small pocket computers—calculator-sized programmable computing devices—sold by Tandy Corporation under the "Tandy" or "RadioShack TRS-80" brands.
Although named after the TRS-80 line of computers, they were not compatible with it and did not use the Z-80 CPU. Computers in the line were actually rebadged Sharp and Casio devices with different model names. They were given designations from PC-1 to PC-8. The PC-1, PC-2, PC-3 and PC-8 are Sharp devices, while the PC-4, PC-5, PC-6 and PC-7 were designed by Casio.
History, lineage and nomenclature
Although not branded as such, the original TRS-80 Pocket Computer later became known as the PC-1, as subsequent models were labelled PC-2 through PC-8. Some were made by Sharp, and the rest by Casio (PC-4 through PC-7). The PC-2 had four colored ball point pens and could print or plot on plain paper. The other print-capable models all used thermal paper, the PC-3 and PC-8 used one printer, while the PC-4, PC-5 and PC-6 used another. The PC-7 had no printer or cassette interface.
Models
The Tandy/TRS-80 model names are listed with the corresponding original Sharp or Casio model number.
TRS-80 Pocket Computer "PC-1" – Sharp PC-1211
TRS-80 Pocket Computer PC-2 – Sharp PC-1500
Tandy/TRS-80 Pocket Computer PC-3 – Sharp PC-1251
TRS-80 Pocket Computer PC-4 – Casio PB-100
Tandy Pocket Computer PC-5 – Casio FX-780P
Tandy Pocket Computer PC-6 – Casio FX-790P
Tandy Pocket Computer PC-7 – Casio FX-5200P
Tandy Pocket Computer PC-8 – Sharp PC-1246
Purpose
Pocket computers were an advancement over early programmable calculator designs. In addition to providing users with scientific math functions in a small portable package, the devices also understood a form of the BASIC programming language. They included a QWERTY keyboard, of either rubber capacitive or membrane type, to use for entering the names of scientific functions and programming commands, in addition to a traditional numeric keypad. (The exception was the PC-7, which had a rectangular and alphabetically ordered keyboard, like most scientific calculators.) On some models, the alphanumeric keypad had a different type, form factor, and location than the numeric keypad.
Design
The models provided a short one-line dot-matrix LCD display, to show the current line of input text, or a segment of it containing the cursor. Character widths in these models varied from 12 characters in the PC-4 and PC-7 to 24 characters on most of the rest. The displays also included some way of indicating operational mode, scientific mode, and other states and conditions.
The Casio models included lower-case characters. These were only for use in PRINT statements, as lower-case commands and variables were not accepted as with almost all BASIC programming machines.
In general, the two specific lines were not cross-compatible, but there were compatibilities within lines. PC-1 programs would work un |
https://en.wikipedia.org/wiki/Host-based%20intrusion%20detection%20system | A host-based intrusion detection system (HIDS) is an intrusion detection system that is capable of monitoring and analyzing the internals of a computing system as well as the network packets on its network interfaces, similar to the way a network-based intrusion detection system (NIDS) operates. This was the first type of intrusion detection software to have been designed, with the original target system being the mainframe computer where outside interaction was infrequent.
Overview
A host-based IDS is capable of monitoring all or parts of the dynamic behavior and the state of a computer system, based on how it is configured. Besides such activities as dynamically inspecting network packets targeted at this specific host (optional component with most software solutions commercially available), a HIDS might detect which program accesses what resources and discover that, for example, a word-processor has suddenly and inexplicably started modifying the system password database. Similarly a HIDS might look at the state of a system, its stored information, whether in RAM, in the file system, log files or elsewhere; and check that the contents of these appear as expected, e.g. have not been changed by intruders.
One can think of a HIDS as an agent that monitors whether anything or anyone, whether internal or external, has circumvented the system's security policy.
Monitoring dynamic behavior
Many computer users have encountered tools that monitor dynamic system behavior in the form of anti-virus (AV) packages. While AV programs often also monitor system state, they do spend a lot of their time looking at who is doing what inside a computer – and whether a given program should or should not have access to particular system resources. The lines become blurred here, as many of the tools overlap in functionality.
Some intrusion prevention systems protect against buffer overflow attacks on system memory and can enforce security policy.
Monitoring state
The principle operation of a HIDS depends on the fact that successful intruders (hackers) will generally leave a trace of their activities. In fact, such intruders often want to own the computer they have attacked, and will establish their "ownership" by installing software that will grant the intruders future access to carry out whatever activity (keystroke logging, identity theft, spamming, botnet activity, spyware-usage etc.) they envisage.
In theory, a computer user has the ability to detect any such modifications, and the HIDS attempts to do just that and reports its findings.
Ideally a HIDS works in conjunction with a NIDS, such that a HIDS finds anything that slips past the NIDS. Commercially available software solutions often do correlate the findings from NIDS and HIDS in order to find out about whether a network intruder has been successful or not at the targeted host.
Most successful intruders, on entering a target machine, immediately apply best-practice security techniques to secure t |
https://en.wikipedia.org/wiki/British%20Rail%20Class%20166 | The British Rail Class 166 Networker Turbo is a fleet of diesel multiple unit (DMU) passenger trains, built by ABB Transportation at their Holgate Road Works in York between 1992 and 1993. They were specified by and built for British Rail, the state-owned railway operator in Great Britain at the time. The trains were designed as a faster, air-conditioned variant of the Class 165 Turbo, intended for longer-distance services, and, like the 165s, belong to the Networker family of trains. They were originally known as Networker Turbos to distinguish them from the electrically propelled members of that family. Today the 166s, alongside the 165s, are normally referred to as Thames Turbos or just simply Turbos.
The Class 166s are still in service today, solely operated by Great Western Railway. Until 2017, they operated only on express and local services in the Thames Valley area alongside the Class 165 units. In this time, they were based at Reading TMD but since July 2017, the 166 units have been gradually moved over to be based at St Philip's Marsh depot to operate local and regional services around Bristol and Exeter. Nowadays, the majority of the 166s are based in Bristol while many 165s remain in the Thames Valley.
Description
These units are a modification of the Class 165 design. They have a top speed of (suitable for mainline use), are carpeted throughout, and have air-conditioning. Externally, the class 166 can be distinguished from a Class 165 by opening hoppers on every other window. Until late 2013 the presence of first class at each end was another distinguishing feature.
Other differences over a 165 are as follows:
Air conditioning
Two toilets (a 165 only has one toilet per unit)
Tables in first class and in one third of the middle carriage
Dedicated cycle/luggage storage in the middle carriage
Different interior panelling between the door and seating areas
Twenty-one 3-car units were built, numbered 166201-221. Each unit was formed of two outer driving motors, and an intermediate motor. The technical description of the formation is DMCL-MS-DMSL. Individual carriages are numbered as follows:
58101-58121 - DMCL
58601-58621 - MS
58122-58142 - DMSL (changed from DMCL in 2013)
The units were built to replace Class 117, Class 119 and Class 121 DMUs, and locomotive-hauled trains on services from London Paddington along the Great Western Main Line.
Six cars were added to the original order in 1991 after Network SouthEast acquired some of the Cotswold Line services from Regional Railways to allow Class 158 units to be converted to Class 159s for the West of England services.
Their operation in the Bristol area is slightly different. All services in the Bristol area have guards and will in the future so the trains will not be driver only operated at all in the Bristol area. The practice of the opening/closing of the doors is also different, in which the driver releases the doors which are then closed by the guard. All 166 units now have l |
https://en.wikipedia.org/wiki/Van%20Emde%20Boas%20tree | A van Emde Boas tree (), also known as a vEB tree or van Emde Boas priority queue, is a tree data structure which implements an associative array with -bit integer keys. It was invented by a team led by Dutch computer scientist Peter van Emde Boas in 1975. It performs all operations in time (assuming that an bit operation can be performed in constant time), or equivalently in time, where is the largest element that can be stored in the tree. The parameter is not to be confused with the actual number of elements stored in the tree, by which the performance of other tree data-structures is often measured.
The vEB tree has poor space efficiency. For example, for storing 32-bit integers (i.e., when ), it requires bits of storage. However, similar data structures with equally good time efficiency and space exist, where is the number of stored elements.
Supported operations
A vEB supports the operations of an ordered associative array, which includes the usual associative array operations along with two more order operations, FindNext and FindPrevious:
Insert: insert a key/value pair with an -bit key
Delete: remove the key/value pair with a given key
Lookup: find the value associated with a given key
FindNext: find the key/value pair with the smallest key which is greater than a given
FindPrevious: find the key/value pair with the largest key which is smaller than a given
A vEB tree also supports the operations Minimum and Maximum, which return the minimum and maximum element stored in the tree respectively. These both run in time, since the minimum and maximum element are stored as attributes in each tree.
Function
For the sake of simplicity, let for some integer k. Define . A vEB tree over the universe } has a root node that stores an array of length . is a pointer to a vEB tree that is responsible for the values }. Additionally, T stores two values and as well as an auxiliary vEB tree .
Data is stored in a vEB tree as follows: The smallest value currently in the tree is stored in and largest value is stored in . Note that is not stored anywhere else in the vEB tree, while is. If T is empty then we use the convention that and . Any other value x is stored in the subtree where . The auxiliary tree keeps track of which children are non-empty, so contains the value j if and only if is non-empty.
FindNext
The operation that searches for the successor of an element x in a vEB tree proceeds as follows: If then the search is complete, and the answer is . If then the next element does not exist, return M. Otherwise, let . If then the value being searched for is contained in so the search proceeds recursively in . Otherwise, we search for the successor of the value i in . This gives us the index j of the first subtree that contains an element larger than x. The algorithm then returns . The element found on the children level needs to be composed with the high bits to form a complete next element.
function |
https://en.wikipedia.org/wiki/Korean%20language%20and%20computers | The writing system of the Korean language is a syllabic alphabet of character parts () organized into character blocks () representing syllables. The character parts cannot be written from left to right on the computer, as in many Western languages. Every possible syllable in Korean would have to be rendered as syllable blocks by a font, or each character part would have to be encoded separately. Unicode has both options; the character parts (h) and (a), and the combined syllable (ha), are encoded.
Character encoding
In RFC 1557, a method known as ISO-2022-KR for seven-bit encoding of Korean characters in email was described. Where eight bits are allowed, EUC-KR encoding is preferred. These two encodings combine US-ASCII (ISO 646) with the Korean standard KS X 1001:1992 (previously named KS C 5601:1987). Another character set, KPS 9566 (similar to KS X 1001), is used in North Korea.
The international Unicode standard contains special characters for the Korean language in the hangul phonetic system. Unicode supports two methods. The method used by Microsoft Windows is to have each of the 11,172 syllable combinations as code and a preformed font character. The other method encodes letters (jamos) and lets the software combine them correctly. The Windows method requires more font memory but allows better shapes, since it is complicated to create stylistically correct combinations (preferable for documents).
Another possibility is stacking a sequence of medial(s) (jungseong) and a sequence of final(s) (jongseong) or a Middle Korean pitch mark (if needed) on top of the sequence of initial(s) (choseong) if the font has medial and final jamos with zero-width spacing inserted to the left of the cursor or caret, thus appearing in the right place below (or to the right of) the initial. If a syllable has a horizontal medial (, , , or ), the initial will probably appear further left in a complete syllable than in preformed syllables due to the space that must be reserved for a vertical medial, making aesthetically poor what may be the only way to display Middle Korean hangul text without resorting to images, romanization, replacement of obsolete jamo or non-standard encodings. However, most current fonts do not support this.
The Unicode standard also has attempted to create a unified CJK character set which can represent Chinese (Hanzi) and the Japanese (Kanji) and Korean (Hanja) derivatives of this script through Han unification, which does not discriminate by language or region in rendering Chinese characters if the typographic traditions have not resulted in major differences in what a character looks like. Han unification has been criticized.
Text input
On a Korean computer keyboard, text is typically entered by pressing a key for the appropriate jamo; the operating system creates each composite character on the fly. Depending on the Input method editor and keyboard layout, double consonants can be entered by holding the shift button. When a |
https://en.wikipedia.org/wiki/Bit%20array | A bit array (also known as bitmask, bit map, bit set, bit string, or bit vector) is an array data structure that compactly stores bits. It can be used to implement a simple set data structure. A bit array is effective at exploiting bit-level parallelism in hardware to perform operations quickly. A typical bit array stores kw bits, where w is the number of bits in the unit of storage, such as a byte or word, and k is some nonnegative integer. If w does not divide the number of bits to be stored, some space is wasted due to internal fragmentation.
Definition
A bit array is a mapping from some domain (almost always a range of integers) to values in the set {0, 1}. The values can be interpreted as dark/light, absent/present, locked/unlocked, valid/invalid, et cetera. The point is that there are only two possible values, so they can be stored in one bit. As with other arrays, the access to a single bit can be managed by applying an index to the array. Assuming its size (or length) to be n bits, the array can be used to specify a subset of the domain (e.g. {0, 1, 2, ..., n−1}), where a 1-bit indicates the presence and a 0-bit the absence of a number in the set. This set data structure uses about n/w words of space, where w is the number of bits in each machine word. Whether the least significant bit (of the word) or the most significant bit indicates the smallest-index number is largely irrelevant, but the former tends to be preferred (on little-endian machines).
A finite binary relation may be represented by a bit array called a logical matrix. In the calculus of relations, these arrays are composed with matrix multiplication where the arithmetic is Boolean, and such a composition represents composition of relations.
Basic operations
Although most machines are not able to address individual bits in memory, nor have instructions to manipulate single bits, each bit in a word can be singled out and manipulated using bitwise operations. In particular:
OR to set a bit to one: 11101010 OR 00000100 = 11101110
AND to set a bit to zero: 11101010 AND 11111101 = 11101000
AND to determine if a bit is set, by zero-testing :
11101010 AND 00000001 = 00000000 = 0
11101010 AND 00000010 = 00000010 ≠ 0
XOR to invert or toggle a bit:
11101010 XOR 00000100 = 11101110
11101110 XOR 00000100 = 11101010
NOT to invert all bits.
NOT 10110010 = 01001101
To obtain the bit mask needed for these operations, we can use a bit shift operator to shift the number 1 to the left by the appropriate number of places, as well as bitwise negation if necessary.
Given two bit arrays of the same size representing sets, we can compute their union, intersection, and set-theoretic difference using n/w simple bit operations each (2n/w for difference), as well as the complement of either:
for i from 0 to n/w-1
complement_a[i] := not a[i]
union[i] := a[i] or b[i]
intersection[i] := a[i] and b[i]
difference[i] := a[i] and (not b[i])
If we wish to iterate th |
https://en.wikipedia.org/wiki/One-time%20password | A one-time password (OTP), also known as a one-time PIN, one-time authorization code (OTAC) or dynamic password, is a password that is valid for only one login session or transaction, on a computer system or other digital device. OTPs avoid several shortcomings that are associated with traditional (static) password-based authentication; a number of implementations also incorporate two-factor authentication by ensuring that the one-time password requires access to something a person has (such as a small keyring fob device with the OTP calculator built into it, or a smartcard or specific cellphone) as well as something a person knows (such as a PIN).
OTP generation algorithms typically make use of pseudorandomness or randomness to generate a shared key or seed, and cryptographic hash functions, which can be used to derive a value but are hard to reverse and therefore difficult for an attacker to obtain the data that was used for the hash. This is necessary because otherwise, it would be easy to predict future OTPs by observing previous ones.
OTPs have been discussed as a possible replacement for, as well as an enhancer to, traditional passwords. On the downside, OTPs can be intercepted or rerouted, and hard tokens can get lost, damaged, or stolen. Many systems that use OTPs do not securely implement them, and attackers can still learn the password through phishing attacks to impersonate the authorized user.
Characteristics
The most important advantage addressed by OTPs is that, in contrast to static passwords, they are not vulnerable to replay attacks. This means that a potential intruder who manages to record an OTP that was already used to log into a service or to conduct a transaction will not be able to use it, since it will no longer be valid. A second major advantage is that a user who uses the same (or similar) password for multiple systems, is not made vulnerable on all of them, if the password for one of these is gained by an attacker. A number of OTP systems also aim to ensure that a session cannot easily be intercepted or impersonated without knowledge of unpredictable data created during the previous session, thus reducing the attack surface further.
There are also different ways to make the user aware of the next OTP to use. Some systems use special electronic security tokens that the user carries and that generate OTPs and show them using a small display. Other systems consist of software that runs on the user's mobile phone. Yet other systems generate OTPs on the server-side and send them to the user using an out-of-band channel such as SMS messaging. Finally, in some systems, OTPs are printed on paper that the user is required to carry.
In some mathematical algorithm schemes, it is possible for the user to provide the server with a static key for use as an encryption key, by only sending a one-time password.
Generation
Concrete OTP algorithms vary greatly in their details. Various approaches for the generation of OTPs incl |
https://en.wikipedia.org/wiki/List%20of%20Arrested%20Development%20characters | Arrested Development is an American television sitcom that originally aired on the Fox network from November 2, 2003 - February 10, 2006. A fourth season of 15 episodes was released on Netflix on May 26, 2013. Created by Mitchell Hurwitz, the show centers the Bluth family. The Bluths are formerly wealthy and a habitually dysfunctional family. It is presented in a continuous format, and incorporates hand-held camera work, narration, archival photos, and historical footage. The series stars Jason Bateman, Portia de Rossi, Will Arnett, Michael Cera, Alia Shawkat, Tony Hale, David Cross, Jeffrey Tambor, and Jessica Walter. In addition, Ron Howard serves as the series narrator and an executive producer on the show.
The main characters of Arrested Development can be divided into the Bluth ( ) and Fünke ( ) families.
Bluth family tree
† denotes a deceased character
Dashed lines denote adoption
Cast table
Primary characters
Michael Bluth
Michael Bluth (played by Jason Bateman) is the second oldest Bluth son and the main protagonist of Arrested Development. He is the father of George Michael Bluth and widower to Tracey Bluth.
In season 3, it is revealed that there is a typo on his birth certificate, which reads Nichael Bluth. Michael's wife Tracey died of ovarian cancer two years prior to the first season. Possibly as a result of this, he is very close to his son, George Michael, which is shown partly because, whenever an opportunity to spend more time with his son presents itself to him, he will jump at it (although this time is almost always immediately interrupted). Michael is often reluctant to date, thinking that his son would disapprove, and most of his relationships have featured misunderstandings or outright deception. His wife's death is usually the subject of tasteless and unaware jokes made by his family members. His role in the story is that he is the one son who has no choice but to keep the family together, and he serves as the straight man in the comedy series. Throughout the original run of the show, Michael is consistently the de facto president of the Bluth Company after his father's arrest. He is the only main character who appears in every episode of season 4, making him the only character to appear in every episode of the series.
Lindsay Bluth-Fünke
Lindsay Bluth-Fünke (Portia de Rossi) is the adopted daughter of George Sr. and Lucille Bluth, as well as half-sister of Lucille, who raised her and Michael to believe that they were twins. She is unhappily married to Tobias and together they are the neglectful and self-absorbed parents of Maeby.
Lindsay never finished college, believing herself to be a dedicated activist, though she is actually vain, greedy, selfish, and materialistic (much like the rest of her family), mainly supporting current trendy causes for the social status and regularly holding extravagant charity drives that waste more money than they make. These causes have included opposing circumcision, anti-Iraq War |
https://en.wikipedia.org/wiki/Transparency%20%28data%20compression%29 | In data compression and psychoacoustics, transparency is the result of lossy data compression accurate enough that the compressed result is perceptually indistinguishable from the uncompressed input, i.e. perceptually lossless.
A transparency threshold is a given value at which transparency is reached. It is commonly used to describe compressed data bitrates. For example, the transparency threshold for MP3 to linear PCM audio is said to be between 175 and 245 kbit/s, at 44.1 kHz, when encoded as VBR MP3 (corresponding to the -V3 and -V0 settings of the highly popular LAME MP3 encoder). This means that when an MP3 that was encoded at those bitrates is being played back, it is indistinguishable from the original PCM, and the compression is transparent to the listener.
The term transparent compression can also refer to a filesystem feature that allows compressed files to be read and written just like regular ones. In this case, the compressor is typically a general-purpose lossless compressor.
Determination
Transparency, like sound or video quality, is subjective. It depends most on the listener's familiarity with digital artifacts, their awareness that artifacts may in fact be present, and to a lesser extent, the compression method, bit rate used, input characteristics, and the listening/viewing conditions and equipment. Despite this, sometimes general consensus is formed for what compression options "should" provide transparent results for most people on most equipment. Due to the subjectivity and the changing nature of compression, recording, and playback technology, such opinions should be considered only as rough estimates rather than established fact.
Judging transparency can be difficult, due to observer bias, in which subjective like/dislike of a certain compression methodology emotionally influences their judgment. This bias is commonly referred to as placebo, although this use is slightly different from the medical use of the term.
To scientifically prove that a compression method is not transparent, double-blind tests may be useful. The ABX method is normally used, with a null hypothesis that the samples tested are the same and with an alternative hypothesis that the samples are in fact different.
All lossless data compression methods are transparent, by nature.
In image compression
Both the DSC in DisplayPort and the default settings of JPEG XL are regarded as visually lossless. The losslessness is usually determined by a flicker test: the display initially shows the compressed and the original side-by-side, switches them around for a tiny fraction of a second and then goes back to the original. This test is more sensitive than a side-by-side comparison ("visually almost lossless"), as the human eye is highly sensitive to temporal changes in light. There is also a panning test that is purportedly more sensitive than the flicker test.
Difference from a lack of artifacts
A perceptually lossless compression is always free of compr |
https://en.wikipedia.org/wiki/Wirral%20Railway | The Wirral Railway was a railway network in the northern part of the Wirral Peninsula, England. Its route was from Birkenhead Park in the east of the Wirral to West Kirby in the west. A branch off this line at Bidston went north to Secombe and New Brighton. It was incorporated in 1863 as the Hoylake Railway, running from Hoylake to Birkenhead Docks. After changes of name and of ownership, it was purchased by the Wirral Railway Company Limited in 1884. The network was extended to West Kirby, New Brighton, and Seacombe, and to Birkenhead Park station where it joined the Mersey Railway, enabling through trains through the Mersey Railway Tunnel to Liverpool. In the 1923 grouping the Wirral company became part of the London, Midland and Scottish Railway, which electrified the line (except the Seacombe branch) in 1938, allowing passenger services to be integrated with the Liverpool urban system. Most of the Wirral Railway network is still in use today as part of the Wirral Line of the Merseyrail rail network.
Hoylake Railway
The Chester and Birkenhead Railway opened on 23 September 1840. This was the first penetration of the Wirral by a railway, and for some years no further attempt was made to build in the peninsula.
Observing the success of the Liverpool, Crosby and Southport Railway in encouraging residential building, and travel, a group of business people led by Braithwaite Pool, a career railwayman, proposed a railway, to be called the Hoylake Railway. It was to connect Hoylake with Birkenhead. The route was soon modified to connect Seacombe (instead of Birkenhead) to Hoylake, with a branch from Bidston to Wallasey Bridge Road to serve Birkenhead docks. Parliamentary powers were obtained on 28 July 1863. Authorised capital was £100,000 with £33,000 in permitted borrowing.
The Hoylake company desposited further Bills in quick succession, showing a desire to reach far beyond the initial area and break the Great Western Railway (GWR) and London and North Western Railway (LNWR) duopoly in the Wirral; these proposals included a long viaduct over the River Dee to Mostyn. All the Bills were heavily cut back or rejected.
In the event the Seacombe portion of the line was not built at this stage as it would have been particularly expensive. Accordingly, the railway was constructed as a single line from Hoylake to Wallasey Bridge Road only, a distance of just over five miles. It was inspected by Captain Ritchie of the Board of Trade on 16 June 1866 and was opened to traffic on Monday 18 June 1866. However this apparently did not result in a regular train service until 2 July 1866, following a further inspection by Ritchie on that date. There were six trains a day, four on Sundays, running from "Birkenhead Docks" (i.e. Wallasey Bridge Road) to Hoylake; an omnibus connection was operate to Seacombe. "All the stations were of the most elementary type, having cinder platforms very scantily supplied with buildings, a state of affairs which in the case of th |
https://en.wikipedia.org/wiki/LHC%40home | LHC@home is a volunteer computing project researching particle physics that uses the Berkeley Open Infrastructure for Network Computing (BOINC) platform. The project's computing power is utilized by physicists at CERN in support of the Large Hadron Collider and other experimental particle accelerators.
The project is run with the help of over 5,400 active volunteer users contributing more than 10,000 computers processing at a combined 61 teraFLOPS . The project is cross-platform, and runs on a variety of computer hardware configurations.
Applications
The LHC@home project currently runs four applications—Atlas, CMS, SixTrack, and Test4Theory—which deal with different aspects of research conducted in LHC like calculating particle beam stability and simulating proton collisions. Atlas, CMS, and Test4Theory use VirtualBox, an x86 virtualization software package.
Atlas
Atlas uses volunteer computing power to run simulations of the ATLAS experiment. It can be run in VirtualBox or natively on Linux.
Beauty
Beauty (LHCb) compared the decay of bottom quarks () and bottom antiquarks (), which also known as beauty quarks. The participation of volunteers in the application was suspended indefinitely on 19 November 2018.
CMS
The CMS application (formerly a standalone project called CMS@Home) allows users to run simulations for the Compact Muon Solenoid experiment on their computers.
SixTrack
SixTrack was first introduced as a beta on 1 September 2004 and a record 1000 users signed up within 24 hours. The application went public, with a 5000 user limit, on September 29 to commemorate CERN's 50th anniversary. Currently there is no user limit and qualification.
SixTrack was developed by Frank Schmidt of the CERN Accelerators and Beams Department and produces results that are essential for verifying the long term stability of the high energy particles in the LHC. Lyn Evans, head of the LHC project, stated that "the results from SixTrack are really making a difference, providing us with new insights into how the LHC will perform".
Test4Theory
The Test4Theory application allows volunteers to run simulations of high energy particle collisions on their home computers. These simulations use theoretical models based on the Standard Model of particle physics, and are calculated using Monte Carlo methods. The theoretical models have adjustable parameters and the aim is that a given set of parameters (called a "tune") will fit the widest possible range of experimental results.
The Test4Theory results are therefore submitted to a database which contains a very wide set of experimental data from many accelerator experiments worldwide, including of course experiments at the Large Hadron Collider. The Theory Unit at CERN runs the MCPLots project, which run the database and the theoretical fitting process.
See also
Citizen Cyberscience Centre
List of volunteer computing projects
Worldwide LHC Computing Grid
References
Further reading
External links
Official |
https://en.wikipedia.org/wiki/British%20Rail%20Class%20165 | The British Rail Class 165 Networker Turbo is a fleet of suburban diesel multiple unit passenger trains (DMUs), originally specified by and built for the British Rail Thames and Chiltern Division of Network SouthEast. They were built by BREL York Works between 1990 and 1992. An express version was subsequently built in the form of the Class 166 Networker Turbo Express trains. Both classes are now sometimes referred to as "Networker Turbos", a name derived some three years later for the project that resulted in the visually similar and EMUs.
The class is still in service, now operated by Great Western Railway and by Chiltern Railways. When operated originally by Network SouthEast, along with that operator's Class 166 trains, the Paddington suburban units were initially known as Thames Turbos, while the units operated on the Marylebone suburban network were known as Chiltern Turbos.
Description
Externally, the class 165 can be distinguished from a Class 166 by the opening hoppers on every other window.
Class 165/0
Thirty-nine Class 165/0 Networker trains were built in 1990–91, in two batches, for the Chiltern subdivision of Network SouthEast, numbered 165001–039. Both 2-car and 3-car variants were built. Initially, thirty-three units were ordered (comprising the vehicles that made up units 165001-165022 and 165029–165039) but an additional order was placed for a further six units (165023-028). Units 165001-028 were delivered consecutively, as 2-car units, whilst units 165029-039 were delivered as 3-car units. These vehicles have a top speed of . They are now all fitted with tripcocks for working over the London Underground lines between Amersham and Harrow-on-the-Hill, although upon delivery this equipment was only fitted to 165006–028. Automatic Train Protection is also fitted, making them one of the few classes to have both these features in Britain.
Each unit was formed of two outer driving motors, with an additional intermediate motor in the 3-car units. The technical description of the formation is DMOSL+MOS+DMOS. Individual carriages are numbered as follows:
58801-58833 (units 165001-022/029-039) and 58873-58878 (units 165023–028) - DMOSL
55404-55414 (units 165029–039) - MOS
58834-58866 (units 165001-022/029-039) and 58867-58872 (units 165023–028) - DMOS
Class 165/1
Thirty-seven Class 165/1 Networker trains were built in 1992 for the Thames line subdivision of Network SouthEast, numbered 165101–137. Like the Chiltern units, both 2-car and 3-car variants were built. Units 165101-117 were delivered as 3-car units, followed by the 2-car units 165118–137. They are re-geared and fitted with bogie yaw dampers to allow a top speed of , more suitable for mainline use.
Each unit was formed of two outer driving motors, with an additional intermediate motor in the 3-car units. The technical description of the formation is DMOCL+MOS+DMOS. Although still listed on the vehicle data sheets at DMCL vehicles, the first-class area has been removed f |
https://en.wikipedia.org/wiki/EchoLink | EchoLink is a computer-based Amateur Radio system distributed free of charge that allows radio amateurs to communicate with other amateur radio operators using Voice over IP (VoIP) technology on the Internet for at least part of the path between them. It was designed by Jonathan Taylor, a radio amateur with call sign K1RFD.
The system allows reliable worldwide connections to be made between radio amateurs, greatly enhancing Amateur Radio's communications capabilities. In essence it is the same as other VoIP applications (such as Skype), but with the unique addition of the ability to link to an amateur radio station's transceiver. Thus any low-power handheld amateur radio transceiver which can contact a local EchoLink node (a node is an active EchoLink station with a transceiver attached) can then use the Internet connection of that station to send its transmission via VoIP to any other active EchoLink node, worldwide. No special hardware or software is required to relay a transmission via an EchoLink node.
Before using the system, it is necessary for a prospective user's callsign to be validated. The EchoLink system requires that each new user provide positive proof of license and identity before his or her callsign is added to the list of validated users. There is no cost for this service, and it ensures that this system is used only by licensed amateur radio operators.
The software is written to run on 32-bit and 64-bit versions of Microsoft Windows. Another edition of the software runs on Apple mobile devices (iPhone, iPod touch, and iPad), and is available from the Apple App Store. Qtel is an opensource version of the software available in many Linux repositories. An Android version is available on Google Play and several other Android app repositories.
Uses
Radio amateurs using the EchoLink software can operate it in one of two modes:
Single User Mode. If they have an Internet-connected computer, they can use the computer's microphone and speakers to connect to (or through - see below) other EchoLink-enabled computers over the Internet and talk to the amateur at the other end.
Sysop Mode. This entails connecting their own VHF or UHF transceiver to their Internet-connected PC with a simple homemade or manufactured radio-PC digital mode interface. Doing this enables another radio amateur with their own transceiver, who is within radio range of this station, to communicate with (or through) any other EchoLink-equipped station anywhere in the world. This is the unique feature of EchoLink.
Radio amateurs without the EchoLink software or a computer connected to the Internet can take advantage of the EchoLink network if they are within radio range of a sysop mode EchoLink station. It is also possible to link a sysop mode EchoLink station to a local repeater, further enhancing the communication possibilities.
Smartphone editions
Editions of EchoLink are also available for two of the major smartphone platforms. In February 2010, an edition o |
https://en.wikipedia.org/wiki/Einstein%40Home | Einstein@Home is a volunteer computing project that searches for signals from spinning neutron stars in data from gravitational-wave detectors, from large radio telescopes, and from a gamma-ray telescope. Neutron stars are detected by their pulsed radio and gamma-ray emission as radio and/or gamma-ray pulsars. They also might be observable as continuous gravitational wave sources if they are rapidly spinning and non-axisymmetrically deformed. The project was officially launched on 19 February 2005 as part of the American Physical Society's contribution to the World Year of Physics 2005 event.
Einstein@Home searches data from the LIGO gravitational-wave detectors. The project conducts the most sensitive all-sky searches for continuous gravitational waves. While no such signal has yet been detected, the upper limits set by Einstein@Home analyses provide astrophysical constraints on the Galactic population of spinning neutron stars.
Einstein@Home also searches radio telescope data from the Arecibo Observatory, and has in the past analyzed data from Parkes Observatory. On 12 August 2010, the first discovery by Einstein@Home of a previously undetected radio pulsar J2007+2722, found in data from the Arecibo Observatory, was published in Science. This was the first data-based discovery by a volunteer computing project. As of July 2022 Einstein@Home had discovered 55 radio pulsars.
The project also analyses data from the Fermi Gamma-ray Space Telescope to discover gamma-ray pulsars. On 26 November 2013, the first Einstein@Home results of the Fermi data analysis was published: the discovery of four young gamma-ray pulsars in LAT data. As of July 2022, Einstein@Home has discovered 39 previously unknown gamma-ray pulsars in data from the Large Area Telescope on board the Fermi Gamma-ray Space Telescope. The Einstein@Home search makes use of novel and more efficient data-analysis methods and discovered pulsars missed in other analyses of the same data.
The project runs on the Berkeley Open Infrastructure for Network Computing (BOINC) software platform and uses free software released under the GNU General Public License, version 2. Einstein@Home is hosted by the Max Planck Institute for Gravitational Physics (Albert Einstein Institute, Hannover, Germany) and the University of Wisconsin–Milwaukee. The project is supported by the Max Planck Society (MPG), the American Physical Society (APS), and the US National Science Foundation (NSF). The Einstein@Home project director is Bruce Allen.
Einstein@Home uses the power of volunteer computing in solving the computationally intensive problem of analyzing a large volume of data. Such an approach was pioneered by the SETI@home project, which is designed to look for signs of extraterrestrial life by analyzing radio wave data. Einstein@Home runs through the same software platform as SETI@home, the Berkeley Open Infrastructure for Network Computing (BOINC). As of July 2022, more than 487,000 volunteers in 226 countri |
https://en.wikipedia.org/wiki/Emotion%20Engine | The Emotion Engine is a central processing unit developed and manufactured by Sony Computer Entertainment and Toshiba for use in the PlayStation 2 video game console. It was also used in early PlayStation 3 models sold in Japan and North America (Model Numbers CECHAxx & CECHBxx) to provide PlayStation 2 game support. Mass production of the Emotion Engine began in 1999 and ended in late 2012 with the discontinuation of the PlayStation 2.
Description
The Emotion Engine consists of eight separate "units", each performing a specific task, integrated onto the same die. These units are: a CPU core, two Vector Processing Units (VPU), a 10-channel DMA unit, a memory controller, and an Image Processing Unit (IPU). There are three interfaces: an input output interface to the I/O processor, a graphics interface (GIF) to the graphics synthesizer, and a memory interface to the system memory.
The CPU core is tightly coupled to the first VPU, VPU0. Together, they are responsible for executing game code and high-level modeling computations. The second VPU, VPU1, is dedicated to geometry-transformations and lighting and operates independently, parallel to the CPU core, controlled by microcode. VPU0, when not utilized, can also be used for geometry-transformations. Display lists generated by CPU/VPU0 and VPU1 are sent to the GIF, which prioritizes them before dispatching them to the Graphics Synthesizer for rendering.
CPU core
The CPU core is a two-way superscalar in-order RISC processor. Based on the MIPS R5900, it implements the MIPS-III instruction set architecture (ISA) and much of MIPS-IV, in addition to a custom instruction set developed by Sony which operated on 128-bit wide groups of either 32-bit, 16-bit, or 8-bit integers in single instruction, multiple data (SIMD) fashion (i.e. four 32-bit integers could be added to four others using a single instruction). Instructions defined include: add, subtract, multiply, divide, min/max, shift, logical, leading-zero count, 128-bit load/store and 256-bit to 128-bit funnel shift in addition to some not described by Sony for competitive reasons. Contrary to some misconceptions, these SIMD capabilities did not amount to the processor being "128-bit", as neither the memory addresses nor the integers themselves were 128-bit, only the shared SIMD/integer registers. For comparison, 128-bit wide registers and SIMD instructions had been present in the 32-bit x86 architecture since 1999, with the introduction of SSE. However the internal data paths were 128bit wide, and its processors were capable of operating on 4x32bit quantities in parallel in single registers.
It has a 6-stage integer pipeline and a 15-stage floating-point (FP) pipeline. Its assortment of registers consists of 32 128-bit VLIW SIMD registers (naming/renaming), one 64-bit accumulator and two 64-bit general data registers, 8 16-bit fix function registers, 16 8-bit controller registers. The processor also has two 64-bit integer arithmetic logic units |
https://en.wikipedia.org/wiki/City%20Lights%20%281984%20TV%20series%29 | City Lights is a Scottish television sitcom made by BBC Scotland and set in Glasgow. It ran from 1984 to 1991 (networked 1987 to 1991) and was written by Bob Black. Two stage shows, featuring the original cast, toured Scotland.
Premise
It starred Gerard Kelly as Willie Melvin, a bank-teller at the fictional Strathclyde Savings Bank (whose logo was very similar to the TSB), with dreams of becoming a novelist. Most of the plots revolved around his attempts to get his book, the autobiographical My Childhood Up A Close, published, however his efforts are continually thwarted by both his own incompetence and overall gullibility. He also occasionally gets involved in the antics of best friend Chancer Andy Gray, who has a penchant for get-rich-quick schemes and dodgy dealings that backfire, and Willie often gets caught up in the resulting mess. None of this ingratiates Willie with his long suffering boss and bank manager McLelland (who is always looking for an excuse to fire him), and constantly exasperates his Mum Jan Wilson.
Cast and characters
He was held back in this by his own incompetence, the dodgy dealings of his best friend Chancer (Andy Gray), and the lack of support he gained from his mother (Jan Wilson), the bank's manager Adam McLelland (Dave Anderson) and his obsequious fellow teller, Brian (Jonathan Watson). Other recurring characters included Chancer's friend Tam (Iain McColl) and Willie's love interests, Janice (Elaine Collins, Series 1 and 2) and Fiona (Ann Bryson, Series 4 and 5).
Billy Connolly guest-starred in one episode.
References
External links
Comedy Guide
City Lights at British TV Resources
1984 Scottish television series debuts
1991 Scottish television series endings
BBC Scotland television shows
BBC television sitcoms
Scottish television sitcoms
Television shows set in Glasgow
1980s Scottish television series
1990s Scottish television series
English-language television shows
1980s British sitcoms
1990s British sitcoms |
https://en.wikipedia.org/wiki/IPR | IPR may refer to:
Law
Intellectual property rights
Inter partes review, US procedure for challenging patents
Media
Independent Public Radio network, Minnesota, US
Indie Press Revolution, a sales network for role-playing games
WBST (Indiana Public Radio), a public radio network in east central Indiana
Interlochen Public Radio, Michigan, United States
Iowa Public Radio, US
Organisations
Institute for Plasma Research, India
Institute of Pacific Relations (1925–1960)
Institute for Policy Research and Catholic Studies, Washington, DC
Institute for Public Relations, University of Florida
Northwestern University Institute for Policy Research, Evanston, IL
Mikael Ter-Mikaelian Institute for Physical Research, Armenia
Prague Institute of Planning and Development, Czech Republic
Science and mathematics
Indirect potable reuse of reclaimed water
Interproximal reduction, an orthodontic treatment
Inverse Participation Ratio, measure of localization or purity of a quantum mechanical state
Chemistry
i-Pr or iPr, abbreviations for the isopropyl group in organic chemistry
IPr, an N-heterocyclic carbene, see IMes
Others
Indicação de Proveniência Regulamentada (Indication of Regulated Origin), Portuguese wine designation |
https://en.wikipedia.org/wiki/Pi%20Studios | Pi Studios was a computer game software developer founded in 2002 by Robert Erwin, John Faulkenbury, Rob Heironimus, Dan Kramer and Peter Mack whose first commercial work can be found in Activision's Call of Duty: United Offensive. The company originated in Plano, Texas and relocated to Houston, Texas in January, 2005.
In November, 2005, Pi Studios released Call of Duty 2: Big Red One for the PlayStation 2, the Xbox, and the GameCube. Work on that project was done jointly with Activision's internal studio, Treyarch. This led to work on Call of Duty 3 in October 2006, developed jointly with Treyarch. Pi's work on the Call of Duty franchise continued with the Call of Duty 3 Bravo Map Pack (downloadable via Xbox Live Arcade) followed by Call of Duty: World at War, in which they assisted Treyarch in creating the single player mission "Blowtorch and Corkscrew".
Pi Studios helped develop the Halo 2 Vista editing toolset and exclusive multiplayer map content, which was included with the game.
Pi Studios also developed Mercenaries 2: World in Flames on PlayStation 2 which was released in the United States on August 31, 2008, and in Europe on September 5, 2008.
Pi Studios is responsible for the PlayStation 2 and Wii versions of Rock Band, which shipped December 18, 2007 and June 22, 2008, respectively. These were developed in conjunction with Harmonix. Pi Studios also worked with Harmonix to produce four Rock Band Track Packs for the Wii and PlayStation 2. The two companies' final collaborative effort was on The Beatles: Rock Band for the (Wii), released in 2009.
Bomberman Live: Battlefest for Xbox Live Arcade, released in December 2010.
Pi Studios was developing Bonk: Brink of Extinction for release on Xbox Live Arcade, PlayStation 3 and Wii but it was cancelled.
In March 2011, it was announced that Pi Studios was closed as former employees have now formed a new development team called Category 6 Studios, which currently has around 15 members including co-founder and industry veteran Kenn Hoekstra.
Games developed
Bonk: Brink of Extinction (Cancelled)
Quake Arena Arcade (2010)
Call of Duty: Black Ops (2010)
Bomberman Live: Battlefest (2010)
The Beatles: Rock Band (Wii) (2009)
Wolfenstein (2009)
Rock Band Classic Rock (PlayStation 2 / PlayStation 3 / Xbox 360 / Wii) (2009)
Call of Duty: World at War (2008)
Rock Band 2 (PlayStation 2) (2008)
Rock Band 2 (Wii) (2008)
Mercenaries 2: World in Flames (PS2) (2008)
Rock Band Track Pack Vol. 1 (PlayStation 2 / Wii) (2008)
Rock Band Track Pack Vol. 2 (PlayStation 2 / PlayStation 3 / Xbox 360 / Wii) (2008)
Rock Band AC/DC (PlayStation 2 / PlayStation 3 / Xbox 360 / Wii) (2008)
Rock Band (Wii) (2008)
Rock Band (PlayStation 2) (2007)
Halo 2 (Windows PC) (2007)
Call of Duty 3 (2006)
Call of Duty 2: Big Red One (2005)
Call of Duty: United Offensive (2004)
References
External links
Video game companies established in 2002
Video game companies disestablished in 2011
Defunct video game companies of the Un |
https://en.wikipedia.org/wiki/Linux-VServer | Linux-VServer is a virtual private server implementation that was created by adding operating system-level virtualization capabilities to the Linux kernel. It is developed and distributed as open-source software.
Details
The project was started by Jacques Gélinas. It is now maintained by Herbert Pötzl. It is not related to the Linux Virtual Server project, which implements network load balancing.
Linux-VServer is a jail mechanism in that it can be used to securely partition resources on a computer system (such as the file system, CPU time, network addresses and memory) in such a way that processes cannot mount a denial-of-service attack on anything outside their partition.
Each partition is called a security context, and the virtualized system within it is the virtual private server. A chroot-like utility for descending into security contexts is provided. Booting a virtual private server is then simply a matter of kickstarting init in a new security context; likewise, shutting it down simply entails killing all processes with that security context. The contexts themselves are robust enough to boot many Linux distributions unmodified, including Debian and Fedora.
Virtual private servers are commonly used in web hosting services, where they are useful for segregating customer accounts, pooling resources and containing any potential security breaches. To save space on such installations, each virtual server's file system can be created as a tree of copy-on-write hard links to a "template" file system. The hard link is marked with a special filesystem attribute and when modified, is securely and transparently replaced with a real copy of the file.
Linux-VServer provides two branches, stable (2.2.x), and devel (2.3.x) for 2.6-series kernels and a single stable branch for 2.4-series. A separate stable branch integrating the grsecurity patch set is also available.
Advantages
Virtual servers share the same system call interface and do not have any emulation overhead.
Virtual servers do not have to be backed by opaque disk images, but can share a common file system and common sets of files (through copy-on-write hard links). This makes it easier to back up a system and to pool disk space amongst virtual servers.
Processes within the virtual server run as regular processes on the host system. This is somewhat more memory-efficient and I/O-efficient than whole-system emulation, although memory ballooning and modern VMs allow returning unused memory and sharing disk cache with the host and other virtual servers.
Processes within the virtual server are queued on the same scheduler as on the host, allowing guest's processes to run concurrently on SMP systems. This is not trivial to implement with whole-system emulation.
Networking is based on isolation rather than virtualization, so there is no additional overhead for packets.
Smaller plane for security bugs. Only one kernel with small additional code-base compared to 2+ kernels and larg |
https://en.wikipedia.org/wiki/KMSE | KMSE (88.7 FM) is a radio station licensed to Rochester, Minnesota. The station is owned by Minnesota Public Radio (MPR), and airs MPR's "The Current" network, consisting of an Adult Album Alternative music format originating from KCMP in Northfield, Minnesota.
See also Minnesota Public Radio
External links
KMSE page at Minnesota Public Radio
thecurrent.org
Radio stations in Minnesota
Minnesota Public Radio
NPR member stations |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.