source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Saccharicola%20taiwanensis | Saccharicola taiwanensis is a plant pathogen infecting sugarcane.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Sugarcane diseases
Pleosporales
Fungi described in 1934 |
https://en.wikipedia.org/wiki/Marasmiellus%20stenophyllus | Marasmiellus stenophyllus is a plant pathogen that causes Marasmius sheath and shoot blight on sugarcane.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Sugarcane diseases
Marasmiaceae |
https://en.wikipedia.org/wiki/OneLink | OneLink may refer to:
AppsFlyer produce a product called OneLink
OneLink Communications, former brand of computer/cable company Liberty Puerto Rico
OneLink Transit Systems, or Metcard, an integrated ticketing system for public transport in Melbourne |
https://en.wikipedia.org/wiki/Atomic%20broadcast | In fault-tolerant distributed computing, an atomic broadcast or total order broadcast is a broadcast where all correct processes in a system of multiple processes receive the same set of messages in the same order; that is, the same sequence of messages. The broadcast is termed "atomic" because it either eventually completes correctly at all participants, or all participants abort without side effects. Atomic broadcasts are an important distributed computing primitive.
Properties
The following properties are usually required from an atomic broadcast protocol:
Validity: if a correct participant broadcasts a message, then all correct participants will eventually receive it.
Uniform Agreement: if one correct participant receives a message, then all correct participants will eventually receive that message.
Uniform Integrity: a message is received by each participant at most once, and only if it was previously broadcast.
Uniform Total Order: the messages are totally ordered in the mathematical sense; that is, if any correct participant receives message 1 first and message 2 second, then every other correct participant must receive message 1 before message 2.
Rodrigues and Raynal and Schiper et al. define the integrity and validity properties of atomic broadcast slightly differently.
Note that total order is not equivalent to FIFO order, which requires that if a process sent message 1 before it sent message 2, then all participants must receive message 1 before receiving message 2. It is also not equivalent to "causal order", where if message 2 "depends on" or "occurs after" message 1 then all participants must receive message 2 after receiving message 1. While a strong and useful condition, total order requires only that all participants receive the messages in the same order, but does not place other constraints on that order.
Fault tolerance
Designing an algorithm for atomic broadcasts is relatively easy if it can be assumed that computers will not fail. For example, if there are no failures, atomic broadcast can be achieved simply by having all participants communicate with one "leader" which determines the order of the messages, with the other participants following the leader.
However, real computers are faulty; they fail and recover from failure at unpredictable, possibly inopportune, times. For example, in the follow-the-leader algorithm, what if the leader fails at the wrong time? In such an environment achieving atomic broadcasts is difficult. A number of protocols have been proposed for performing atomic broadcast, under various assumptions about the network, failure models, availability of hardware support for multicast, and so forth.
Equivalent to consensus
In order for the conditions for atomic broadcast to be satisfied, the participants must effectively "agree" on the order of receipt of the messages. Participants recovering from failure, after the other participants have "agreed" an order and started to receive the |
https://en.wikipedia.org/wiki/Hexafluoroethane%20%28data%20page%29 | This page provides supplementary chemical data on Hexafluoroethane.
Material Safety Data Sheet
The handling of this chemical may incur notable safety precautions. It is highly recommend that you seek the Material Safety Datasheet (MSDS) for this chemical from a reliable source such as SIRI, and follow its directions.
MSDS at Airgas
MSDS at Mathesontrigas
MSDS at Air Liquide
Structure and properties
Thermodynamic properties
Spectral data
References
Chemical data pages
Chemical data pages cleanup |
https://en.wikipedia.org/wiki/List%20of%20Brazilian%20films%20of%20the%201960s | An incomplete list of films produced in Brazil in the 1960s. For an A-Z list of films currently on Wikipedia see :Category:Brazilian films
External links
Brazilian film at the Internet Movie Database
1960s
Brazilian
Films |
https://en.wikipedia.org/wiki/Henry%20Spencer%20%28disambiguation%29 | Henry Spencer is a Canadian computer programmer and space enthusiast.
Henry Spencer may also refer to:
People
Henry Spencer, 1st Earl of Sunderland (1620–1643), English nobleman and soldier
Lord Henry Spencer (1770–1795), British diplomat and politician
Henry Elvins Spencer (1882–1972), Canadian politician
Henry Spencer (fl.1402), MP for Totnes
Henry Spencer (MP for Wallingford), 15th century, see Wallingford
Henry C. Spencer (1915–1999), American businessman
Henry E. Spencer (1807–1882), mayor of Cincinnati
Characters
Henry Spencer, the main character from the film Eraserhead
Henry Spencer, Shawn's father in the TV series Psych
See also
Harry Spencer (disambiguation) |
https://en.wikipedia.org/wiki/DVD%20X%20Copy | DVD X Copy is a consumer software program that enabled novice computer users to copy any DVD movie to any blank DVD. Most commercial DVD movies include Content Scrambling System (CSS), a copy-protection technology designed to prevent DVD movies from being copied. This controversial DVD copy software program included technology that decrypts the CSS copy protection mechanism on DVD movie discs. DVD X Copy products are still being sold on the DVD X Copy website, although it was previously believed to be no longer sold or supported.
This DVD copy software program was created by 321 Studios. The DVDXCopy product line included DVD X Copy, DVD X Copy Xpress, DVD X Copy Gold and DVD X Copy Platinum. DVD X Copy Xpress enabled consumers to make a perfect "1Click DVD copy" of any DVD movie in under 30 minutes. The product upgrade path to the premium priced DVD X Copy Platinum provided advanced features that give users increased control over the DVD backup process. The highly popular DVD X Copy line of products were sold through major North American and International retailers and online via the official website.
Legal battle
Anticipating a lawsuit by the major Hollywood motion picture studios, in April 2002, 321 Studios filed a pre-emptive complaint against eight Hollywood studios contending that the Digital Millennium Copyright Act (DMCA), a law that prohibits the circumvention of copy protection technology, violates consumer rights as provided in the Fair Use doctrine of the Copyright Act of 1976. The Fair Use doctrine provides individuals with limited rights to copy certain forms of copyrighted material. The complaint named MGM Studios, Tristar Pictures, Columbia Pictures, Sony Pictures Entertainment, Time Warner Entertainment, Disney Enterprises, Inc., Universal City Studios, The Saul Zaentz Company and Pixar as defendants.
In May 2003 seven of the Hollywood studios including MGM Studios, Tristar Pictures, Columbia Pictures, Time Warner Entertainment, Disney, Universal City Studios and The Saul Zaentz Company countersued 321 Studios by filing a series of claims alleging that the DVD X Copy products violated the DMCA.
On February 23, 2004, Judge Susan Illston of the Northern District Federal Court for California ruled that 321 Studios' products violated copyright law and ordered an injunction that prohibited the sale of DVD X Copy products in the United States within seven days of the injunction. 321 Studios proceeded to remove all products from the US retail channel and from the http://www.dvdxcopy.com website. The ruling caused 321 Studios to shut down with the company finally ceasing operations in August 2004.
See also
DVD ripper type of software with similar feature
AnyDVD
DVD-Cloner
External links
PC Mag article on DVD X Copy
DVD
DVD rippers
United States Internet case law |
https://en.wikipedia.org/wiki/Sphere%201 | The Sphere 1 was a personal computer completed in 1975 by Michael Donald Wise and Monroe Tyler of Sphere Corporation, of Bountiful, Utah. The Sphere 1 featured a Motorola 6800 CPU, onboard ROM, a full-sized CRT monitor, 4 KB of RAM, and a keyboard with a numeric keypad.
The Sphere 1 was among the earliest complete all-in-one microcomputers that could be plugged in, turned on, and was fully functional. Michael touted it as the first "true PC" because it had a keyboard, a number pad, a monitor, external storage, and did not run on a punch tape. In this respect, it is pre-dated by the 1973 MCM/70, among others, but the Sphere included a full-sized display that these generally lacked. When BYTE Magazine did its annual history of the computer, it always included Sphere 1, showing that prior microcomputers lacked the user I/O interface built into the Sphere 1.
The Sphere 1 also included a keyboard-operated reset feature consisting of two keys wired in series that sent a reset signal to the CPU triggering a hard reboot. Wise considered this to be the first keyboard activated reset a predecessor to the now-common Control-Alt-Delete combination.
It is not clear how many systems were sold; production models were sent to computer stores, but the company disappeared shortly thereafter.
References
External links
Sphere 1 Vintage Computer - Buy First "True" PC 1975
(PDF's) Newsletters, Schematics, User manual
Personal computers
Computer-related introductions in 1975
68xx-based computers |
https://en.wikipedia.org/wiki/Coniella%20castaneicola | Coniella castaneicola is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Melanconidaceae |
https://en.wikipedia.org/wiki/Coniella%20diplodiella | Coniella diplodiella is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Melanconidaceae
Taxa named by Carlo Luigi Spegazzini |
https://en.wikipedia.org/wiki/Melanconis%20carthusiana | Melanconis carthusiana is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Diaporthales
Fungi described in 1856 |
https://en.wikipedia.org/wiki/Melanconium%20juglandinum | Melanconium juglandinum is a fungal pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Diaporthales |
https://en.wikipedia.org/wiki/Schizoparme%20straminea | Schizoparme straminea is a plant pathogen infecting strawberries.
References
External links
Index Fungorum
USDA ARS Fungal Database
Diaporthales
Fungal strawberry diseases
Fungi described in 1923 |
https://en.wikipedia.org/wiki/Asteridiella%20perseae | Asteridiella perseae is a plant pathogen that causes black mildew on avocado.
References
External links
USDA ARS Fungal Database
Fungal tree pathogens and diseases
Avocado tree diseases
Meliolaceae |
https://en.wikipedia.org/wiki/Meruliopsis%20ambigua | Meruliopsis ambigua is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Phanerochaetaceae |
https://en.wikipedia.org/wiki/Usenet%20personality | A Usenet personality was a particular kind of Internet celebrity, being an individual who gained a certain level of notoriety from posting on Usenet, a global network of computer users with a vast array of topics for discussion. The platform is usually anonymous, although users can get celebrity status, usually by being deemed different from other posters in some way.
Since its inception, Usenet newsgroups have attracted a wide variety of people posting all manner of fact, fiction, theories, opinions, and beliefs. Some Usenet posters achieved a certain amount of fame (or infamy) and celebrity within Usenet circles because of their unusual, non-mainstream ideas, or because their writings and responses are considered especially humorous or bizarre.
Some Usenet communities became infamous on Usenet as a whole and/or on the wider Internet for posting "indecent material."
Eccentric believers
These individuals (or user-IDs, or pseudonyms) are noted for their eccentric beliefs and theories.
Alexander Abian (1923–1999) – American mathematician who taught for many years at Iowa State University and became an Internet legend for his incessant and frequently bizarre posts to various Usenet newsgroups. In particular, he gained international notoriety for his claims that blowing up the Moon would eliminate virtually all natural disasters, and that mass and time are equivalent. (With regard to the second claim, it was suggested on the "sci.astro.amateur" newsgroup that his demise be observed with a gram of silence.) Another of Dr. Abian's hypotheses was the challenge to the Big Bang Theory with the Big Suck Theory. Despite his eccentric views, Abian (who in 1965 authored The theory of sets and transfinite arithmetic) often contributed productively and settled debates on sci.math.
Robert E. McElwaine (1948?–2008) – self-described Bachelor of Science in physics who wrote a series of ranting fringe science essays characteristically peppered with capitalized words for emphasis. Each essay covered topics such as alien influence on violence, free energy, coming UFO landings, and cancer cures, often carrying a message that there existed a conspiracy to suppress the information. The essays often concluded with the signature "UN-altered REPRODUCTION and DISSEMINATION of this IMPORTANT Information is ENCOURAGED, ESPECIALLY to COMPUTER BULLETIN BOARDS." McElwaine's writings stopped appearing on Usenet after 1998, although he continued writing essays up to 2003. He died at age 59 in his home in Eau Claire, Wisconsin, on 12 February 2008.
Archimedes Plutonium (current legal name, born Ludwig Poehlmann in 1950, raised as Ludwig Hansen, also known as Ludwig van Ludvig and Ludwig Plutonium) – noted for his many posts about his own theories of physics, mathematics, and stock market investing, and in particular his "Plutonium Atom Totality" theory, which posits that the universe is a giant plutonium atom and that galaxies are "dots" in the electron dot cloud of this at |
https://en.wikipedia.org/wiki/Dimiter%20Skordev | Dimiter Skordev () (born 1936 in Sofia) is a professor in the Department of Mathematical Logic and Applications, Faculty of Mathematics and Computer Science at the University of Sofia. Chairman of the department in 1972-2000. Doyen and pioneer of mathematical logic research in Bulgaria who developed a Bulgarian school in the theory of computability, namely the algebraic (or axiomatic) recursion theory. He was the 1981 winner of Acad. Nikola Obreshkov Prize, the highest Bulgarian award in mathematics, bestowed for his monograph Combinatory Spaces and Recursiveness in Them.
Skordev's field of scientific interests include computability and complexity in analysis, mathematical logic, generalized recursion theory, and theory of programs and computation.
Skordev has more than 45 years of lecturing experience in calculus, mathematical logic, logic programming, discrete mathematics, and computer science. He has authored about 90 scientific publications including two monographs, and was one of the authors of the new Bulgarian phonetic keyboard layout proposed (but rejected) to become a state standard in 2006.
Notes
References
Dimiter Skordev
Historical notes on the development of mathematical logic in Sofia
1936 births
Living people
20th-century Bulgarian mathematicians
21st-century Bulgarian mathematicians
Mathematical logicians
Bulgarian logicians
Bulgarian philosophers
Scientists from Sofia |
https://en.wikipedia.org/wiki/Zhengtu | Zhengtu Online () was a MMORPG developed and run by Shanghai based Zhengtu Network.
It was released in 2007 and it became a success in that same year, with a monthly profit of $15.52 million.
Also in 2007, the game recorded 2.8 million daily active players and 860,265 peak concurrent users (PCU) on March 23.
In 2008 it reached 1.52 million peak concurrent users, becoming the second most popular online game, after Fantasy Westward Journey with 1.66 million peak concurrent users.
Zhengtu ceased operations on 26 December 2018.
Loot box pioneer
The game pioneered loot box predatory monetisation mechanics. It featured the now-canonical lock-and-key system made famous by Counter-Strike, but would also show you all the loot that a chest could contain on a circle reminiscent of Wheel of Fortune. According to the Southern Weekly article that describes ZT: "Chests will frequently contain the high-class equipment that gamers desire, but the spinning light wheel always passes over them."
References
External links
Official website
Chinese-language-only video games
Inactive massively multiplayer online games
Massively multiplayer online role-playing games
Video games developed in China |
https://en.wikipedia.org/wiki/Pseudomicrostroma%20juglandis | Pseudomicrostroma juglandis is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Ustilaginomycotina |
https://en.wikipedia.org/wiki/Lopharia%20crassa | Lopharia crassa is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Phanerochaetaceae
Taxa named by Joseph-Henri Léveillé
Fungi described in 1844 |
https://en.wikipedia.org/wiki/Camarotella%20acrocomiae | Camarotella acrocomiae is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Phyllachorales
Fungi described in 1999 |
https://en.wikipedia.org/wiki/Phyllachora%20sacchari | Phyllachora sacchari is a plant pathogen infecting sorghum.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Sorghum diseases
Phyllachorales |
https://en.wikipedia.org/wiki/Trifluoroiodomethane%20%28data%20page%29 | This page provides supplementary chemical data on trifluoroiodomethane.
Material Safety Data Sheet
The handling of this chemical may incur notable safety precautions. It is highly recommend that you seek the Material Safety Datasheet (MSDS) for this chemical from a reliable source such as SIRI, and follow its directions.
Structure and properties
Thermodynamic properties
Spectral data
References
Chemical data pages
Chemical data pages cleanup |
https://en.wikipedia.org/wiki/List%20of%20programs%20broadcast%20by%20MyNetworkTV | This is a list of programming which has been or will be carried on the American broadcast programming service MyNetworkTV.
Current programming
Acquired programming
Dramas
Law & Order: Special Victims Unit (2011–18; 2019–present)
Chicago P.D. (2018–present)
Chicago Fire (2021–present)
Reality/non-scripted
Dateline (2017–present)
Former programming
Original programming
Dramas
Desire (2006)
Fashion House (2006)
Watch Over Me (2006–07)
Wicked Wicked Games (2006–07)
American Heiress (2007)
Saints & Sinners (2007)
Comedies
Under One Roof (2008–09)
Reality/non-scripted
Celebrity Exposé (2007–09)
Control Room Presents (2007–08)
Decision House (2007–08)
IFL Battleground (2007–08)
Paradise Hotel (2008)
Street Patrol (2008–09)
The Tony Rock Project (2008–09)
WWE SmackDown (2008–10)
Masters of Illusion (2009)
Acquired programming
Dramas
The Twilight Zone (2008–09)
Law & Order: Criminal Intent (2009–11; 2013–15; 2017–21)
The Unit (2009–10)
Burn Notice (2010–12)
Without a Trace (2010–12)
Monk (2010–14)
Cold Case (2011–12)
House (2012–14)
Numb3rs (2012–13)
White Collar (2012–13)
Bones (2013–17)
The Mentalist (2014–16)
The Walking Dead (2014–16)
The Closer (2015–16)
Agents of S.H.I.E.L.D. (2016–17)
The X-Files (2016–18)
CSI: Miami (2018–20)
The Good Wife (2018–19)
Reality/non-scripted
The Academy (2007)
America's Funniest Home Videos (some affiliates + O&Os) (2009–13)
American Ninja Warrior (2016–18)
Are You Smarter than a 5th Grader? (2009–11)
Breaking the Magician's Code (2007–09)
Comics Unleashed (2008–09)
Deal or No Deal (2009–10)
Don't Forget the Lyrics! (2010–11)
The Best of In Living Color (2007–08)
Jail (2007–09)
Meet My Folks (2007–08)
NFL Total Access (2007–08)
Whacked Out Videos (2008–09)
World's Funniest Moments (2008–09)
Vice Squad (2009)
External links
MyNetworkTV.com - Official Website
MyNetworkTV |
https://en.wikipedia.org/wiki/List%20of%20computer%20system%20emulators | This article lists software and hardware that emulates computing platforms.
The host in this article is the system running the emulator, and the guest is the system being emulated.
The list is organized by guest operating system (the system being emulated), grouped by word length. Each section contains a list of emulators capable of emulating the specified guest, details of the range of guest systems able to be emulated, and the required host environment and licensing.
64-bit guest systems
ARM aarch64
AlphaServer
IBM
Silicon Graphics
UltraSPARC
x86-64 platforms (64-bit PC and compatible hardware)
60-bit guest systems
60-bit CDC 6000 series and Cyber mainframe
48-bit guest systems
English Electric KDF9
36-bit guest systems
DEC PDP-10
GE-600 series / Honeywell 6000 series
IBM 7094
32-bit guest systems
Acorn Archimedes, A7000, RiscPC, Phoebe
While the ARM processor in the Acorn Archimedes is a 32-bit chip, it only had 26-bit addressing making an ARM/Archimedes emulator, such as Aemulor or others below, necessary for 26-bit compatibility, for later ARM processors have mostly dropped it.
Amiga
Android
BlueStacks
Genymotion
LeapDroid
App Inventor for Android
Android Studio
MEmu
Android-x86
Nox App Player
Windows Subsystem for Android
Apple iOS
touchHLE
Apple Lisa
Apple Macintosh with 680x0 CPU
Macintosh with PowerPC CPU
Atari ST/STE/Falcon
AT&T UNIX PC
Cobalt Qube
Corel NetWinder
DEC VAX
DECstation
IBM mainframe (32-bit)
Motorola 88000
Sharp X68000
Sinclair QL
SPARCstation
x86 platforms (32-bit PC and compatible hardware)
24-bit guest systems
ICL 1900
SDS 900-series
20-bit guest systems
GE-200 series
PERQ
18-bit guest systems
DEC PDP-1
DEC PDP-4/7/9/15
16-bit guest systems
Apple IIGS
NEC PC-9800 series
DEC PDP-11
Mera 400
Polish minicomputer Mera 400. Also in development hardware emulator in FPGA.
TI-99/4 and TI-99/4A
Texas Instruments TI-980
Texas Instruments TI-990
Varian Data Machines
x86-16 IBM PC/XT/AT compatible
12-bit guest systems
DEC PDP-8
8-bit guest systems
Acorn Atom
Acorn Electron
Altair 8800
Amstrad CPC
Apple-1
Apple II
Apple ///
Atari 8-bit family
BBC Micro
Commodore 64
Commodore Plus/4
VIC-20
Enterprise 64/128
Fairlight CMI IIx
Jupiter ACE
Mattel Aquarius
MicroBee
MSX
NEC PC-8800 series
Oric
SAM Coupé
Sharp MZ
Sinclair ZX80
Sinclair ZX81
Sinclair ZX Spectrum and clones
For Sinclair ZX Spectrum and clones
Tandy 1000
Thomson MO5
TRS-80
PDA and smartphone guest systems
Pocket PC
Calculator guest systems
Hewlett-Packard calculators
Texas Instruments calculators
See also
Comparison of platform virtualization software
List of emulators
List of video game console emulators
References
Emulators, Computer system
Computer system emulators |
https://en.wikipedia.org/wiki/Lost%20%28season%205%29 | The fifth season of the American serial drama television series Lost commenced airing on the ABC network in the United States and on A in Canada in January 2009, and concluded with a two-hour season finale on May 13, 2009. The season continues the stories of the survivors of the crash of the fictional Oceanic Airlines Flight 815, after some of them are rescued and those still stranded seemingly disappear to an unknown location and time with the island that they inhabit.
According to Lost co-creator/executive producer/writer/show runner Damon Lindelof, the season "is about why [the people who have left the island] need to get back". Lost returned on January 21, 2009, on ABC with a three-hour premiere consisting of a clip-show and two back-to-back new episodes. The remainder of the season aired on Wednesdays at 9:00 pm EST. The season began in the UK and Ireland on January 25, 2009, on Sky1 and RTÉ Two, respectively. The season was released on DVD and Blu-ray Disc under the title Lost: The Complete Fifth Season – The Journey Back, Expanded Edition on December 8, 2009.
Crew
The season was produced by Bad Robot Productions and Grass Skirt Productions and was aired on the American Broadcasting Company network in the United States. The show was primarily filmed in Hawaii with post-production in Los Angeles. Damon Lindelof and Carlton Cuse continued to serve as the show runners. Lindelof and Cuse's fellow executive producers were co-creator J. J. Abrams, Bryan Burk, Jack Bender, Edward Kitsis and Adam Horowitz. The staff writers were Lindelof, Cuse, Kitsis, Horowitz, co-executive producer Elizabeth Sarnoff, supervising producer Paul Zbyszewski, producer Brian K. Vaughan, co-producer Melinda Hsu Taylor and Kyle Pennington. The regular directors are Bender, co-executive producer Stephen Williams and Paul Edwards.
Cast
The cast features 14 major roles with star billing, all of whom return from the fourth season. Because the storyline follows two different time periods, the cast is largely broken into two groups. The first storyline follows the group of people who have left the island: the survivors' leader Dr. Jack Shephard (Matthew Fox), ex-fugitive Kate Austen (Evangeline Lilly), mentally unstable millionaire Hugo "Hurley" Reyes (Jorge Garcia), former torturer Sayid Jarrah (Naveen Andrews), grieving wife Sun-Hwa Kwon (Yunjin Kim), three-year islander Desmond Hume (Henry Ian Cusick) and Ben Linus (Michael Emerson), former leader of the island's native population, known as the Others. The second follows those who remain on the island as they erratically jump through time, following the island being moved in the fourth-season finale. They are crash survivor and con man James "Sawyer" Ford (Josh Holloway), former Other and fertility specialist Dr. Juliet Burke (Elizabeth Mitchell), crash survivor and former enforcer Jin Kwon (Daniel Dae Kim), who survived the explosion of the freighter, and three members of a science team from a freighter offshore, who ha |
https://en.wikipedia.org/wiki/BAYSWAN | Bay Area Sex Worker Advocacy Network (BAYSWAN) is a non-profit organization in the San Francisco Bay Area which works to improve working conditions, increase benefits, and eliminate discrimination on behalf of individuals working within both legal and criminalized adult entertainment industries. The organization provides advice and information to social service, policy reformers, media outlets, politicians, including the San Francisco Task Force on Prostitution and Commission on the Status of Women (COSW), and law enforcement agencies dealing with sex workers.
Origins
BAYSWAN was founded as a collaborative project sponsored by the San Francisco-area Exotic Dancers Alliance and the Coalition on Prostitution and Street Outreach Services Consortium, which included the Asian AIDS Project, the Haight Ashbury Free Clinics, Inc., the Institute for Community Health Outreach, New Leaf Community Services, Proyecto ContraSIDA por Vida, and Tenderloin AIDS Resource Center. Its purpose at founding was to create a network of social service organizations, service providers, and community members to advocate on behalf of sex workers, massage parlor employees, escorts, exotic dancers, and other sex industry workers to protect their civil, human, and workplace rights as well as to improve communication between sex industry workers and government agencies, social service providers, and other organizations throughout the Bay Area. BAYSWAN's efforts encompassed the financial, housing, social support, mental health, and medical needs of sex industry workers, including HIV/STD prevention, substance abuse issues, harm reduction, and protection from violence.
Activities
BAYSWAN's principal work is to make available resources provided by sex workers' and other human rights-based organizations about the rights of sex workers and others employed in the adult entertainment and sex industries, including prostitution and exotic dancing. Information is provided through the organization's website and through the media as a source for stories or opinion pieces relating to sex workers and sex industries. Bayswan also works to improve working conditions and to eliminate discrimination against workers within both the legal and criminalized adult entertainment industries, and organizes sex worker rights advocates who work at various agencies as outreach workers.
BAYSWAN sponsors the Prostitutes' Education Network (PENet), an educational website on sex workers' rights and issues. and works to educate the general public about sex work, and promotes education about safe sex, AIDS and sexually transmitted disease amongst sex workers, their clients, and the general public, including organizing events and sponsoring conferences such as the San Francisco Sex Worker Film and Arts Festival.
Prostitutes' Education Network
BAYSWAN sponsors the Prostitutes' Education Network (PENet), an educational website on sex workers' rights and issues. PENet provides online access to studies and docum |
https://en.wikipedia.org/wiki/Vugraph | Vugraph (or Viewgraph) is a method of displaying the bidding and play of bridge hands on a screen for viewing by an audience. The basis of the current computer-generated display was originally developed by Fred Gitelman for the American Contract Bridge League in 1991 under a grant from the estate of Peter Pender, a champion player. Then known as PenderGraph, the software program was first used at the 1991 Summer North American Bridge Championships at Las Vegas. The program was substantially revised in 1993 to work under the Microsoft Windows operating system. Archived Vugraph data can be found from various databases and the most complete collection of bridge data is the Vugraph Project.
The term and practice date back at least to 1959, when its use was reported in The New York Times.
See also
Bridge-O-Rama
References
External links
Bridge Base Online Vugraph.
Bridge Base Online Vugraph Client.
The Vugraph Project.
The copyright debate on vugraph data.
Contract bridge |
https://en.wikipedia.org/wiki/History%20of%20automated%20adaptive%20instruction%20in%20computer%20applications | Within the field of human-computer interaction there has long been interest in developing adaptive automated instruction software to facilitate learning of application programs. This software would monitor a computer user's behavior while using the application program, and then provide optimized and personalized instruction to help the user become more skilled with the application. This form of instruction could be performed by a stand-alone tutoring application, or it could be carried out by special routines built into the application program itself (as with the Microsoft Office Assistant discussed below). Note that the history of adaptive learning approaches to education in general, some of which is summarized in the Wikipedia articles on spaced repetition and electronic learning, lies beyond the scope of this entry.
Chronology of developments in the field
A variety of different strategies for automated instruction in computer applications have been discussed and tried over a period of at least 25 years, although at present the technology does not appear to enjoy very wide application. Some of the notable developments in this field are listed here:
1956. Gordon Pask and Robin McKinnon-Wood develop SAKI, the first adaptive instruction system to go into commercial production. SAKI taught keyboard skills and it optimized the rate by which a trainee keyboard operator learned by making the difficulty level of the tasks contingent on the learner's performance. As the learner's performance improved the rate of teaching increased and instructional support was delayed.
1992. C. Thomas and M. Krogsaeter describe an adaptable extension to Microsoft Excel called Flexcel. Flexcel records and studies the user's command history using Excel and "analyzes the user's interaction style and presents adaptation suggestions." (p. 123) For example, the program notes when a user repeatedly fails to utilize an available shortcut and reminds the user about the existence of the shortcut.
1996. S. Bhavnani and colleagues describe an Active Assistant for Computer-Aided Design (CAD) programs, for which they constructed a prototype versione. The Active Assistant records the history of a CAD user's usage of the program, and monitors for "symptoms of suboptimal and incorrect CAD usage" (p. 253). Upon discovering such cases, it might provide "textual notification that there is a better way to perform a task executed by the user" (p. 251) or it might provide "graphic remediation" utilizing a tutorial window.
1996. Microsoft introduces the Office Assistant—often referred to as "Clippy"—to provide personalized assistance in the use of Office 97 products. Depending upon user-set options governing Clippy's behavior, the animated agent can provide a variety of forms of advice to users, based on inspection of the user history and comparison with optimal prototypes. Clippy becomes relatively notorious among some Office users, who complain that the agent is intrusive and annoy |
https://en.wikipedia.org/wiki/Positive%20train%20control | Positive train control (PTC) is a family of automatic train protection systems deployed in the United States. Most of the United States' national rail network mileage has a form of PTC. These systems are generally designed to check that trains are moving safely and to stop them when they are not.
Positive train control restricts the train movement to an explicit allowance; movement is halted upon invalidation. A train operating under PTC receives a movement authority containing information about its location and where it is allowed to safely travel. PTC was installed and operational on 100% of the statutory-required trackage by December 29, 2020.
Overview
The American Railway Engineering and Maintenance-of-Way Association (AREMA) describes positive train control systems as having these primary functions:
Train separation or collision avoidance
Line speed enforcement
Temporary speed restriction enforcement
Rail worker wayside safety
Blind spot monitoring.
History
Background
In the late 1980s, interest in train protection solutions heightened after a period of stagnant investment and decline following World War II. Starting in 1990, the United States National Transportation Safety Board (NTSB) counted PTC (then known as positive train separation) among its "Most Wanted List of Transportation Safety Improvements." At the time, the vast majority of rail lines in US relied upon crew members to comply with all safety rules, and a significant fraction of accidents were attributable to human error, as evidenced in several years of official reports from the Federal Railroad Administration (FRA).
In September 2008, Congress considered a new law that set a deadline of December 15, 2015 for implementation of PTC technology across most of the US rail network. The bill, ushered through the legislative process by the Senate Commerce Committee and the House Transportation and Infrastructure Committee, was drafted in response to the collision of a Metrolink passenger train and a Union Pacific freight train at September 12, 2008, in Los Angeles, which resulted in the deaths of 25 and injuries to more than 135 passengers.
As the bill neared final passage by Congress, the Association of American Railroads (AAR) issued a statement in support of the bill. President George W. Bush signed the 315-page Rail Safety Improvement Act of 2008 into law on October 16, 2008.
Provisions of the law
Among its provisions, the law provides funding to help pay for the development of PTC technology, limits the number of hours freight rail crews can work each month, and requires the Department of Transportation to determine work hour limits for passenger train crews.
Implementation
To implement the law, the FRA published initial regulations for PTC systems on January 15, 2010. The agency published amended regulations on August 22, 2014.
In December 2010, the Government Accountability Office (GAO) reported that Amtrak and the major railroads have taken steps to install P |
https://en.wikipedia.org/wiki/Distinguishing%20attack | In cryptography, a distinguishing attack is any form of cryptanalysis on data encrypted by a cipher that allows an attacker to distinguish the encrypted data from random data. Modern symmetric-key ciphers are specifically designed to be immune to such an attack. In other words, modern encryption schemes are pseudorandom permutations and are designed to have ciphertext indistinguishability. If an algorithm is found that can distinguish the output from random faster than a brute force search, then that is considered a break of the cipher.
A similar concept is the known-key distinguishing attack, whereby an attacker knows the key and can find a structural property in the cipher, where the transformation from plaintext to ciphertext is not random.
Overview
To prove that a cryptographic function is safe, it is often compared to a random oracle. If a function were a random oracle, then an attacker is not able to predict any of the output of the function. If a function is distinguishable from a random oracle, it has non-random properties. That is, there exists a relation between different outputs, or between input and output, which can be used by an attacker for example to find (a part of) the input.
Example
Let T be a sequence of random bits, generated by a random oracle and S be a sequence generated by a pseudo-random bit generator. Two parties use one encryption system to encrypt a message M of length n as the bitwise XOR of M and the next n bits of T or S respectively. The output of the encryption using T is truly random. Now, if the sequence S cannot be distinguished from T, the output of the encryption with S will appear random as well. If the sequence S is distinguishable, then the encryption of M with S may reveal information of M.
Two systems S and T are said to be indistinguishable if there exists no algorithm D, connected to either S or T, able to decide whether it is connected to S or T.
A distinguishing attack is given by such an algorithm D. It is broadly an attack in which the attacker is given a black box containing either an instance of the system under attack with an unknown key, or a random object in the domain that the system aims to emulate, then if the algorithm is able to tell whether the system or the random object is in the black box, one has an attack. For example, a distinguishing attack on a stream cipher such as RC4 might be one that determines whether a given stream of bytes is random or generated by RC4 with an unknown key.
Examples
Classic examples of distinguishing attack on a popular stream cipher was by Itsik Mantin and Adi Shamir who showed that the 2nd output byte of RC4 was heavily biased toward zero. In another example, Souradyuti Paul and Bart Preneel of COSIC have shown that the XOR value of the 1st and 2nd outputs of RC4 is also non-uniform. Significantly, both the above theoretical biases can be demonstrable through computer simulation.
See also
Randomness test
References
External links
Source
|
https://en.wikipedia.org/wiki/Robot%20Chicken%3A%20Star%20Wars | "Robot Chicken: Star Wars" (also known as "Robot Chicken: Star Wars Episode I") is a 2007 episode of the television comedy series Robot Chicken, airing as a one-off special during Cartoon Network's Adult Swim block on June 17, 2007 (released after the original Star Wars film's 30th anniversary). It was released on DVD on July 22, 2008.
Synopsis
The 22-minute episode's sketches all relate to Star Wars.
Chapter 1
Opening sequence – Based on the end sequences of Star Wars: Episode III – Revenge of the Sith, the Mad Scientist (as Palpatine) saves Robot Chicken (RC) (as Anakin Skywalker) from the volcanic planet Mustafar and rebuilds him as Darth Vader before forcing it to watch Robot Chicken.
An AT-AT pilot sits on the toilet during the battle at the beginning of The Empire Strikes Back, as Luke Skywalker throws a grenade into the bathroom.
Palpatine gets a collect call from Vader who tells him that the Rebel Alliance blew up the Death Star, leaving Palpatine in financial turmoil. This skit is recycled from the episode "1987," although the voice of Darth Vader heard on Palpatine's phone has been redone from the original.
A Jawa orders a "Martini!" at the cantina.
A janitor sweeps up the corpse of Darth Maul on Naboo, exclaiming that he's "gotta get that transfer to Coruscant".
An advert for Admiral Ackbar's breakfast cereal.
Ponda Baba is shown to be an architect. He goes with Evazan to the cantina at lunch and there asks Luke Skywalker a question (in non-human tongue). A drunken Evazan convinces Luke that this is actually a threat, and despite Ponda's friendly intentions, Obi-Wan Kenobi slices his arm off. He returns to work, but is laid off as the chopped-off appendage was his drawing arm.
Chapter 2
C-3PO sets off the metal detector going through an airport-like security screening and assumes that it's his keys.
Qui-Gon Jinn accidentally drops his lightsaber on the Trade Federation ship; it slashes its way through the decks below.
Vader's meditation chamber attempts to put his helmet on, but accidentally lifts him up.
An Imperial officer explains to some new recruits that Vader does not actually have the power of Force strangulation, but that they should pretend to die anyway, so that Vader does not kill them with his lightsaber.
After destroying the Death Star, Luke asks R2-D2 to call his aunt and uncle, before remembering that they are dead, and R2 was damaged during the fight.
George Lucas attends a Star Wars convention and attempts to escape with a nerd dressed as a Tauntaun. After running into an army of fans, the nerd gives Lucas a "ride" to the speech platform on his back – which he later describes as the "greatest day of my entire life".
Luke complains that with the blast shield down on his helmet, during his first lesson in using the Force, he cannot see. Obi-Wan takes advantage of this and knees him in the groin.
A space slug, after failing to catch the Millennium Falcon, discusses ordering Chinese food as an alternat |
https://en.wikipedia.org/wiki/Joseph%20Boyer | Joseph E. Boyer (1848 – October 24, 1930) was a Canadian-American inventor and computer industrialist.
Boyer was President of the J. Boyer Machine Co. in St. Louis, Missouri. He helped William Seward Burroughs I develop the adding machine and was the inventor of the first successful rivet gun. As the third president of the American Arithmometer Company, in the first of a series of business moves designed to eliminate the competition, in 1903 he secretly agreed to acquire the Addograph Manufacturing Company. Then in 1905 Boyer relocated the entire company from St. Louis to Detroit, Michigan at which point the company name was changed to the Burroughs Adding Machine Company. He served as president until 1920.
Joseph Boyer, then President of the American Arithmometer Company, was quoted as saying:
There was Burroughs with his great idea, greater than any of us could fully appreciate, and with his meager capital of $300. Long before the first model was actually begun his money was gone. But as his resources dwindled, his courage grew. I used to leave him at his bench in the evening and find him still there in the morning.
When the first machine proved a failure, Burroughs made another model. Finally, the third model seemed to meet his standards. He could make it perform mathematical wonders, so a lot of 50 machines was made. However, when untrained operators ran the machines, they got the most amazing results. People began to question Burroughs' judgment and doubt his ability.
Everyone but Burroughs was ready to quit. Yet the inventor himself was undaunted, demonstrating his contempt for imperfection by tossing the 50 machines, one by one, out of a second-story window. Then he began work on a new model. Night after night he worked feverishly, 24 hours a day, 34 hours at a stretch. Then, at last, the wonderful governor that has made the machine foolproof was invented. Burroughs was jubilant. His machine was perfect. His faith had been justified.
Boyer died of pneumonia in Detroit.
References
External links
Joseph Boyer profile via Harvard Business School
1848 births
1930 deaths
Deaths from pneumonia in Michigan
Burroughs Corporation people
19th-century American inventors
20th-century American inventors
Canadian inventors |
https://en.wikipedia.org/wiki/Black%20Magic%20%28video%20game%29 | Black Magic is a multidirectional scrolling action-adventure game written for the Apple II by Peter Ward of Action Software and published by Datasoft in 1987. Commodore 64, ZX Spectrum, and Amstrad CPC versions were also released.
Plot
The evil wizard Zahgrim has turned the good wizard Aganar to stone, removed his six eyes, and scattered them across the world, though always in the same locations, d so they may view the destruction being reaped. The player's objective is to find the six eyeballs.
Gameplay
The player moves through a large, vertically and horizontally scrolling world, picking-up food, arrows, and spells. Roaming enemies can be avoided or shot with arrows; the player can only shoot arrows while moving. The game plays differently depending on the order the eyes are recovered. When one is collected, stronger types of monsters appear in the world and travel becomes more difficult.
Resources are limited. Food is always on the verge of running out and arrows are in short supply. A large bird can carry the player to a different part of the world, similar to the bat in Adventure for the Atari 2600. Shooting the bird with an arrow makes it go away temporarily.
Spells are gained by collecting scrolls. They provide alternate approaches to problems. For example, Vanish prevents damage from monsters and casting Chill on water immobilizes the creatures in it and allows the frozen surface to be walked across. The player's rank begins at apprentice and every 4000 points a new rank is awarded: wizard, sorcerer, and necromancer. New spells are unlocked with each rank.
Once all six eyes have been found and placed in the Blind Statue's empty sockets, a message appears explaining how to end Zahgrim's rule over the land once and for all. The player is then able to enter Zahgrim's castle, a difficult maze of traps and monsters.
Reception
The game was reviewed in 1987 in Dragon #124 by Hartley and Patricia Lesser in "The Role of Computers" column. The reviewers stated the "Certainly, this is one of the better games in the current crop of arcade/adventure games, as the tasks required to complete the quest are quite varied."
Reviews
ASM (Aktueller Software Markt) (Nov, 1987)
Commodore User (Sep, 1987)
References
External links
1987 video games
Action-adventure games
Amstrad CPC games
Apple II games
Commodore 64 games
Datasoft games
Fantasy video games
Video games developed in the United States
ZX Spectrum games
Single-player video games
U.S. Gold games |
https://en.wikipedia.org/wiki/Lophodermium%20schweinitzii | Lophodermium schweinitzii is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Leotiomycetes |
https://en.wikipedia.org/wiki/Achlya%20conspicua | Achlya conspicua is a plant pathogen, including of rice seedlings.
References
External links
Index Fungorum
USDA ARS Fungal Database
Water mould plant pathogens and diseases
Species described in 1923
Saprolegniales |
https://en.wikipedia.org/wiki/List%20of%20Guadeloupan%20films | This is a list of films produced in, set in, or related to Guadeloupe, in alphabetical order.
See also
Cinema of the Caribbean
External links
Guadeloupean film at the Internet Movie Database
Lists of films by country of production
Films
Guadeloupe-related lists |
https://en.wikipedia.org/wiki/Naevala%20perexigua | Naevala perexigua is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Schizophyllaceae
Taxa named by John Baptiste Henri Joseph Desmazières |
https://en.wikipedia.org/wiki/Schizopora%20flavipora | Schizopora flavipora is a plant pathogen infecting tea.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Tea diseases
Hymenochaetales |
https://en.wikipedia.org/wiki/Botrytis%20anthophila | Botrytis anthophila is a fungal plant pathogen.
References
External links
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Sclerotiniaceae
Fungi described in 1913 |
https://en.wikipedia.org/wiki/Sclerotinia%20ricini | Sclerotinia ricini is a plant pathogen infecting poinsettias.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Ornamental plant pathogens and diseases
Sclerotiniaceae
Fungi described in 1919 |
https://en.wikipedia.org/wiki/Johncouchia%20mangiferae | Johncouchia mangiferae is a fungal plant pathogen. It causes felt fungus on mango.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal tree pathogens and diseases
Mango tree diseases
Teliomycotina
Fungi described in 1956 |
https://en.wikipedia.org/wiki/Septobasidium%20pseudopedicellatum | Septobasidium pseudopedicellatum is a plant pathogen infecting mangoes.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Mango tree diseases
Teliomycotina |
https://en.wikipedia.org/wiki/Laxitextum%20bicolor | Laxitextum bicolor is a plant pathogen fungus. It is inedible.
References
External links
Index Fungorum
USDA ARS Fungal Database
Russulales
Fungal plant pathogens and diseases
Fungi described in 1801
Inedible fungi
Taxa named by Christiaan Hendrik Persoon |
https://en.wikipedia.org/wiki/The%20Foxxhole | The Foxxhole was an uncensored comedy channel on Sirius XM Radio channel 96. Presented by actor/comedian/musician Jamie Foxx, the network broadcasts a variety of comedy and urban music such as hip-hop and R&B in addition to live talk shows broadcast during the weekdays. The channel originally debuted on Sirius 106 on May 17, 2007, and began broadcasting simultaneously on XM 149 on November 12, 2008, until both services moved The Foxxhole to channel 96 on May 4, 2011.
Original programming on The Foxxhole includes talk shows such as The Jamie Foxx Show and Speedy's Comedy Corner; former programs on the network have included The Claudia Jordan Show, The Corey Holcomb 5150 Show, The B. Scott Show, and other programs.
Between programs, The Foxxhole broadcasts a nonstop stream of unedited and uncensored stand-up comedy clips from urban comedians, as well as urban contemporary, hip-hop and R&B songs.
Controversies
On the April 17, 2009 episode of The Jamie Foxx Show, Foxx and his co-hosts made several sexually suggestive and disparaging jokes regarding teenaged singer Miley Cyrus, in response to a caller's comment on a recent altercation between Cyrus and rock band Radiohead. Cyrus, who was a minor at the time, was advised by Foxx and his co-hosts to "go make a sex tape" and take drugs "like Lindsay Lohan". Foxx issued a public apology on The Tonight Show with Jay Leno several days later in response to growing public outcry as well as televised criticism by Cyrus's father, country singer Billy Ray Cyrus.
See also
List of Sirius Satellite Radio stations
List of XM Satellite Radio channels
References
Sirius Satellite Radio channels
XM Satellite Radio channels
Comedy radio stations in the United States
Jamie Foxx
Radio stations established in 2007
Defunct radio stations in the United States |
https://en.wikipedia.org/wiki/Gloeophyllum%20mexicanum | Gloeophyllum mexicanum is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Gloeophyllales
Fungi described in 1982 |
https://en.wikipedia.org/wiki/Graphiola%20phoenicis | Graphiola phoenicis is a plant pathogen of the palm Phoenix canariensis.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Ustilaginomycotina
Fungi described in 1823 |
https://en.wikipedia.org/wiki/Helicobasidium%20compactum | Helicobasidium compactum is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Teliomycotina
Fungi described in 1930
Taxa named by Karel Bernard Boedijn |
https://en.wikipedia.org/wiki/Ramulispora%20sorghi | Ramulispora sorghi is a plant pathogen infecting sorghum.
References
External links
Index Fungorum
USDA ARS Fungal Database
Brady, C.R., Noll, L.W., Saleh, A.A., and Little, C.R. 2011. Disease severity and microsclerotium properties of the sorghum sooty stripe pathogen, Ramulispora sorghi. Plant Disease 95: 853–859.
Fungal plant pathogens and diseases
Sorghum diseases
Hyaloscyphaceae |
https://en.wikipedia.org/wiki/Ramulispora%20sorghicola | Ramulispora sorghicola is a plant pathogen infecting sorghum.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Sorghum diseases
Hyaloscyphaceae |
https://en.wikipedia.org/wiki/Physalospora%20abdita | Physalospora abdita is a plant pathogen that causes cankers on pecan and avocado.
External links
USDA ARS Fungal Database
Fungal tree pathogens and diseases
Avocado tree diseases
Nut tree diseases
Xylariales
Fungi described in 1942 |
https://en.wikipedia.org/wiki/Physalospora%20perseae | Physalospora perseae is a fungal plant pathogen infecting avocados.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Avocado tree diseases
Xylariales |
https://en.wikipedia.org/wiki/Gliocladium%20vermoeseni | Gliocladium vermoeseni is a plant pathogen. It is a disease of palm species.
References
External links
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Fungi described in 1930
Hypocreaceae |
https://en.wikipedia.org/wiki/Bromoform%20%28data%20page%29 | This page provides supplementary chemical data on bromoform.
Material Safety Data Sheet
The handling of this chemical may incur notable safety precautions. It is highly recommend that you seek the Material Safety Datasheet (MSDS) for this chemical from a reliable source and follow its directions.
SIRI
Science Stuff
Structure and properties
Thermodynamic properties
Enthalpy of combustion
Spectral data
References
Chemical data pages
Chemical data pages cleanup |
https://en.wikipedia.org/wiki/Client%E2%80%93queue%E2%80%93client | A client–queue–client or passive queue system is a client–server computer network in which the server is a data queue for the clients. Instead of communicating with each other directly, clients exchange data with one another by storing it in a repository (the queue) on a server.
Like peer-to-peer, the client–queue–client system empowers hosts on the network to serve data to other hosts.
Example
Web crawlers on different hosts need to query each other to synchronize an indexed URI. Whereas one approach is to program each crawler to receive and respond to such queries, the client–queue–client approach is to store the indexed content from both crawlers in a passive queue, such as a relational database, on another host. Both web crawlers read and write to the database, but never communicate with each other.
See also
Centralized computing
Decentralized computing
Friend-to-friend
Ontology (information science)
References
Network architecture |
https://en.wikipedia.org/wiki/Inonotus%20arizonicus | Inonotus arizonicus is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
arizonicus
Fungi described in 1969 |
https://en.wikipedia.org/wiki/Inonotus%20dryophilus | Inonotus dryophilus is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
dryophilus
Fungi described in 1904 |
https://en.wikipedia.org/wiki/Phellinus%20ferreus | Phellinus ferreus is a plant pathogen infecting stone fruit trees.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal tree pathogens and diseases
Stone fruit tree diseases
Phellinus
Fungi of Europe
Fungi described in 1928 |
https://en.wikipedia.org/wiki/Phellinus%20ferruginosus | Phellinus ferruginosus is a plant pathogen. It is inedible.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Hymenochaetales
Inedible fungi
Taxa named by Heinrich Schrader (botanist) |
https://en.wikipedia.org/wiki/Fomes%20lamaensis | Fomes lamaensis is a plant pathogen of the tea plant.
See also
List of tea diseases
References
External links
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Tea diseases
Polyporaceae |
https://en.wikipedia.org/wiki/Poria%20hypobrunnea | Poria hypobrunnea is a plant pathogen infecting tea.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Tea diseases
hypobrunnea
Taxa named by Thomas Petch |
https://en.wikipedia.org/wiki/Michael%20Loceff | Michael Loceff (born 1952) was a writer and co-executive producer of the hit television series 24, which aired on the Fox television network. He worked on the show for six and a half seasons, but left after the writer's strike.
He is among the 2006 Emmy Award recipients for the 24 series. Prior to 24, he worked with fellow 24 producers Joel Surnow, Robert Cochran, Jon Cassar, Brad Turner, and Peter Lenkov on La Femme Nikita.
He is the cousin of 24 co-creator Joel Surnow
He was then a professor at Foothill College in Los Altos Hills, California, teaching computer science courses online.
In 2015, Professor Loceff also published a very detailed Volume 1 book on quantum computing called "A Course in Quantum Computing for the Community College 〈c | Q | c〉"
He is now retired.
Trivia
Loceff has sneaked in several subtle references to his teaching career on 24. Milo Pressman's CTU password is "foothill94022." 94022 is the postal code for Foothill College in Los Altos Hills, California. In a previous episode of the show, a character used the secret password "Etudes", the name of his online teaching software.
References
External links
Michael Loceff Profile, Foothill College website
Confessions of a 24 writer, Michael Loceff interview
Living people
American television producers
American male screenwriters
1952 births
Primetime Emmy Award winners |
https://en.wikipedia.org/wiki/Actrix | Actrix is an archaic synonym for actress. It may also mean:
Actrix (computer), a personal computer
Actrix (moth), a genus of moths |
https://en.wikipedia.org/wiki/TFI-5 | TFI-5 in computer networking is a standardized TDM Fabric to Framer Interface by the Optical Internetworking Forum (OIF) that allow both framer components and switch components from multiple vendors to inter-operate facilitating the development of add/drop multiplexers, TDM cross connect and grooming switches. The TFI-5 standard includes link integrity monitoring, connection management and mapping mechanisms for both SONET/SDH and non-SONET/SDH clients such as Ethernet and Fibre Channel.
The main application of TFI-5 is for Time-division multiplexing (TDM). This contrast with other OFI standards such SPI-5 which target packet/cell applications.
OFI level 5 standards that covered interfaces of 40 Gbit/s.
See also
TDM
SFI-5
Optical Internetworking Forum
Framer
References
Multiplexing |
https://en.wikipedia.org/wiki/TDM%20Fabric%20to%20Framer%20Interface | TDM Fabric to Framer Interface is abbreviated as TDM. Some commonly used TDM variants include:
TFI-4
TFI-5
See also
Optical Internetworking Forum
Multiplexing |
https://en.wikipedia.org/wiki/Low-level%20windshear%20alert%20system | A low-level windshear alert system (LLWAS) measures average surface wind speed and direction using a network of remote sensor stations, situated near runways and along approach or departure corridors at an airport. Wind shear is the generic term for wind differences over an operationally short distance (in relation to flight) which encompass meteorological phenomena including gust fronts, microbursts, vertical shear, and derechos.
Background
LLWAS compares results over its operating area to determine whether calm, steady winds, wind shifts (in relation to runways), wind gusts, divergent winds, sustained divergent winds (indicative of shear), or strong and sustained divergent winds (indicative of microbursts) are observed. A LLWAS master station polls each remote station every system cycle (nominally every ten seconds) and provides prevailing airport wind averages, runway specific winds, gusts, may set new wind shear alerts or microburst alerts and reset countdown timers of elapsed time since the last alert. By airline rules, pilots must avoid microbursts if warnings are issued by an automated wind shear detection system, and must wait until a safe time interval passes, to assure departure or landing conditions are safe for the performance of the airframe. Pilots may decide whether to land (or conduct a missed approach) after wind shear alerts are issued. LLWAS wind shear alerts are defined as wind speed gain or loss of between 20 and 30 knots aligned with the active runway direction. "Low level" refers to altitudes of or less above ground level (AGL). Arriving aircraft on descent, generally within six nautical miles of touchdown will fly within this low level, maintaining a glide slope and may lack recovery altitude sufficient to avoid a stall or flight-into-terrain if caught unaware by a microburst. LLWAS microburst alerts are issued for greater than 30 knot loss of airspeed at the runway or within three nautical miles of approach or two nautical miles of departure. Microbursts in excess of 110 knots have been observed.
Each LLWAS equipped airport may have as few as six or as many as thirty-two remote stations. Each remote station uses a tall pole with anemometer and radio-telecommunication equipment mounted on a lowerable ring. Remote station wind measurements are transmitted to a master station at the Air Traffic Control Tower (ATCT), which polls the remote stations, runs wind shear and gust front algorithms, and generates warnings when windshear or microburst conditions are detected. Current observations and warnings are displayed for approach controllers in the terminal radar approach control facility (TRACON) and for local and ground controllers in the air traffic control tower.
Air traffic controller (ATC) users at local, ground and departure positions in the ATCT relay the LLWAS runway specific alerts to pilots via voice radio communication. Recent wind shear alerts may also feature in radio broadcasts by the automated terminal i |
https://en.wikipedia.org/wiki/Gl%C3%B2ries%20station | Glòries is a station in the Barcelona Metro network, at the boundary between the Eixample and Sant Martí districts of Barcelona. It is served by TMB line L1. The station is named after the nearby Plaça de les Glòries Catalanes.
It was opened in 1951, when Line 1 was extended from Marina to Clot. It can be accessed from Carrer d'Àlaba and Glòries. It is currently being adapted for disabled people. It will be connected to a future train station in the square, which will include access to L8.
It is also an important tram station, being the terminus of Trambesòs tram routes T4 and T5.
See also
Plaça de les Glòries Catalanes
List of Barcelona Metro stations
List of tram stations in Barcelona
External links
Glòries at Trenscat.com
Railway stations in Spain opened in 1951
Barcelona Metro line 1 stations
Transport in Sant Martí (district)
Trambesòs stops |
https://en.wikipedia.org/wiki/Gio%20Wiederhold | Giovanni Corrado Melchiore Wiederhold (June 24, 1936 – December 26, 2022) was an Italian-born American computer scientist who spent most of his career at Stanford University. His research focused on the design of large-scale database management systems, the protection of their content, often using knowledge-based techniques. After his formal retirement he focused on valuation methods for intellectual property and intellectual capital.
Early life and education
Gio Wiederhold was born June 24, 1936, in Varese, Italy. He graduated C.Ae. cum laude in Aeronautical Engineering from the TMS Technicum in Rotterdam, Netherlands in 1957. From 1957 to 1958 he did graduate work at the Technische Hogeschool in Delft. He emigrated to the United States in 1958. Since 1966 he had been married to Voy Yat Jew.
Early career
Wiederhold worked on computations of short-range missile trajectories at NATO's Air Defense Technical Center (SADTC) in Wassenaar near The Hague in 1958. From 1958 to 1961 he worked at IBM's service bureau. Projects at IBM included developing numerical methods for computing the power (specific impulse) of solid rocket fuel combustion in 1959, and inserting alphabetic I/O capability into FORTRAN compilers to allow output of chemical equations in 1960.
In 1962 at the University of California, Berkeley he developed an incremental compiling technology, with a flexibility close to interpreted code, while running at high speed. He also received and completed coursework at UC Berkeley. In 1965 he developed similar techniques for the Stanford University Medical School. The next year he worked on real-time data-acquisition control and data analysis using coupled computers for clinical research, and in 1970 on transposed storage (now termed a Column-oriented DBMS) for databases for very-high speed on-line analytical processing, also at the medical school. From 1973 through 1976 he did graduate work at the University of California, San Francisco in Medical Information Science, with his Ph.D. thesis titled "A Methodology for the Design of Medical Database Systems".
An extensive study of computerized ambulatory health care systems, appeared as an appendix to his dissertation.
Stanford
In 1976 Wiederhold joined the faculty of Stanford University. He integrated knowledge base technology exploiting artificial intelligence concepts to provide intelligent and efficient access to databases which he called KBMS.
He authored a text book on quantitative aspects of database management systems, first published by McGraw-Hill in 1977. A second edition was published in 1983. In 1995 the copyright was transferred to Wiederhold, who published an expanded version of the book in 2001.
He also published a book on file organization for databases in 1987.
From 1991 through 1994 Wiederhold served as a program manager at the Defense Advanced Research Projects Agency (DARPA). He initiated the DARPA Intelligent Integration of Information (I3) program. A visible component is th |
https://en.wikipedia.org/wiki/Alex%20Hauptmann | Alexander G. Hauptmann is a Research Professor in the Language Technologies Institute at the Carnegie Mellon University School of Computer Science. He has been the leader of the Informedia Digital Library which has made seminal strides in multimedia information retrieval and won best paper awards at major conferences. He was also a founder of the international advisory committee for TRECVID.
Biography
Alex Hauptmann started at the Johns Hopkins University in 1978 and received a BA and an MA in Psychology in 1982. For two years he studied Computer Science at the Technische Universitaet Berlin. In 1991 he received a PhD in Computer Science from the Carnegie Mellon University.
From 1984 he was researcher at the Carnegie Mellon University in the CMU speech group. The next two years he was a research associate at the School of Computer Science, since 1994 a System Scientist and since 1998 a Senior System Scientist.
In 2003 he received the Allen Newell Award for Research Excellence, for the Informedia Digital Library, with H. Wactlar, M. Christel, T. Kanade and S. Stevens.
Work
His research interests are in multimedia analysis and indexing, speech recognition, speech synthesis, speech interfaces, interfaces to multimedia systems and language in general. According to Hauptmann (2008) "Over the years his research interests have led him to pursue and combine several different areas of research: man-machine communication, natural language processing and speech understanding".
In the area of man-machine communication, According to Hauptmann (2008) "he is interested in the tradeoffs between different modalities, including gestures and speech, and in the intuitiveness of interaction protocols. In natural language processing, his desire is to break through the bottlenecks that are currently preventing larger scale natural language applications. The latter theme was also the focus of my thesis, which investigated the use of machine learning on large text samples to acquire the knowledge needed for semantic natural language understanding".
References
External links
Home page
Informedia Project
American non-fiction writers
Living people
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Marinobacterium%20halophilum | Marinobacterium halophilum is a Gram-negative bacterium.
External links
Type strain of Marinobacterium halophilum at BacDive - the Bacterial Diversity Metadatabase
Alteromonadales
Bacteria described in 2007 |
https://en.wikipedia.org/wiki/Water%20levels%20of%20the%20Birmingham%20Canal%20Navigations | The Birmingham Canal Navigations (BCN), a network of narrow canals in the industrial midlands of England, is built on various water levels. The three longest are the Wolverhampton, Birmingham, and Walsall levels. Locks allow boats to move from one level to another.
Heights given are nominal elevation above sea level in feet relative to the Ordnance Datum Liverpool.
533 ft Essington Branch
A former branch of the Wyrley and Essington Canal, the Essington Branch was abandoned before 1904 and is now filled in. It was the highest level on the BCN.
511 ft Titford Summit
The highest canal currently in BCN, 1 mile of which remains navigable. It was fed from the 18th century Titford Reservoir (now under Junction 2 of the M5 motorway) originally by feeder, and since 1837 by the Titford Canal. A feeder from the Tat Bank Branch (also known as Spon Lane Branch) supplies water to Edgbaston Reservoir.
491 ft Brindley's Smethwick Summit
A historical level, no longer existing. The highest level designed by James Brindley for his Birmingham Canal (BCN Old Main Line). Removed by John Smeaton's design in 1790.
473 ft Wolverhampton Level
A total of 41.7 miles navigable without locks:
BCN Old Main Line Wolverhampton top lock to Smethwick locks, 11.6 miles
Walsall Branch Canal to Walsall top lock, 0.4 miles
Wyrley and Essington Canal 15.4 miles, + branches:
Lord Hay's Branch (now dry)
Cannock Extension Canal, 1.8 miles navigable
Daw End Branch to Rushall top lock, 5.3 miles
Anglesey Branch, 2.5 miles
Wednesbury Oak Loop, 1.9 miles
Engine Arm, 0.5 miles
Dudley Canal to Parkhead locks (including Dudley Tunnel), 2.3 miles
453 ft Birmingham Level
A total of 49.2 miles at this level (21.2 miles of which is on the BCN) navigable without locks.
BCN Main Line, 10.8 miles navigable
BCN Old Main Line, south of Smethwick Locks
BCN New Main Line - Birmingham to Tipton Factory Bottom Lock, Island line, New Line at Smethwick
Newhall Branch to Farmer's Bridge Junction, 0.2 miles
Gower Branch Canal to Brades Hall locks, 0.5 miles
Netherton Tunnel Branch Canal, 2.4 miles to Windmill End Junction
Wednesbury Old Canal and Ridgacre Branch, 1.4 miles navigable
Dudley No. 2 Canal from Parkhead locks (Blower's Green) to Hawne Basin (originally to Selly Oak), and Bumble Hole Branch Canal, 5.9 miles navigable.
Gas Street Basin
Connecting canals, not part of the BCN, but using this level:
Worcester and Birmingham Canal to Tardebigge top lock, 17 miles
Northern Stratford-upon-Avon Canal from Kings Norton Junction to Lapworth Top Lock, 11 miles
441 ft Dudley No. 1
Dudley Canal, 1.8 miles navigable without locks.
408 ft Walsall Level
A total of 13.4 miles navigable without locks.
Walsall Canal (Ryders Green bottom lock to Walsall Town Wharf), 6.5 miles, + branches:
Ocker Hill Tunnel Branch (private moorings), 0.2 miles navigable.
Gospel Oak Branch, 0.1 miles navigable.
Bradley Branch, part (abandoned)
Bilston Branch (abandoned)
Willenhall Branch (abandoned)
Anson Branch (abandoned)
Tam |
https://en.wikipedia.org/wiki/Enterprise%20service%20layer | In a service-oriented architecture business software implementation, the enterprise service layer is the highest level of abstraction.
Any application programming interface defined at the enterprise service layer can cross domain boundaries; it calls directly the domain device layer, which in turn interacts with the application service layer or the RDBMS Service Layer. Therefore, any application programming interface which must access multiple domains to execute correctly must exist at the enterprise level.
Since the enterprise service layer is the application programming interface of the entire enterprise, all the components in the enterprise can call it directly, and it can sometimes be accessed from outside the service-providing entity.
The enterprise service layer exposes a number of application programming interface considerably lower than the application service layer because it works at a higher level of abstraction.
References
Service-oriented (business computing) |
https://en.wikipedia.org/wiki/Computer%20Baseball | Computer Baseball is a simulation game published by Strategic Simulations in 1981. It was released for the Apple II, Atari 8-bit family, and later for the Commodore 64, Macintosh, DOS, and Amiga.
Gameplay
Players can manage a game between teams from 14 different World Series contests, or enter in or load the statistics for other teams. For example, players can manage either the Brooklyn Dodgers or New York Yankees in a rematch of the 1955 World Series. Two players can manage against each other, one player can manage against a computer manager, or the computer can manage both teams.
Game play is limited to managerial decisions: setting lineups, pitching changes, pinch hitters and other substitutions, defensive positioning, and offensive decisions such as when to bunt, steal or hit and run.
Reception
Computer Baseball was given the award for "Best Computer Sports Game" in 1982 at the 3rd annual Arcade Awards. Judges described the game as computerized version of the traditional statistical-replay table sports game, and praised it for its "attractive and easy-to-use form".
Computer Gaming World stated in 1985 that Computer Baseball, despite its age, "remains one of the best on the market". It cited the clear documentation and compiling and printing of individual statistics as strengths, while the weak computer opponent was a weakness. Ahoy! wrote in 1986 that the game "isn't as pretty as MicroLeague Baseball, but it may be better for those who replay entire seasons ... its mathematical model considers more statistical categories than other programs". The magazine noted the large number of supplemental disks available from SSI.
The game sold more than 30,000 copies.
Reviews
Computer Gaming World #1 (Nov-Dec 1981)
References
1981 video games
Amiga games
Apple II games
Atari 8-bit family games
Baseball video games
Commodore 64 games
DOS games
Classic Mac OS games
Strategic Simulations games
Video games developed in the United States |
https://en.wikipedia.org/wiki/Prefix%20hash%20tree | A prefix hash tree (PHT) is a distributed data structure that enables more sophisticated queries over a distributed hash table (DHT). The prefix hash tree uses the lookup interface of a DHT to construct a trie-based data structure that is both efficient (updates are doubly logarithmic in the size of the domain being indexed), and resilient (the failure of any given node in a prefix hash tree does not affect the availability of data stored at other nodes).
References
External links
https://www.eecs.berkeley.edu/~sylvia/papers/pht.pdf - Prefix Hash Tree: An Indexing Data Structure over Distributed Hash Tables
http://pier.cs.berkeley.edu - PHT was developed as part of work on the PIER project.\
See also
Prefix tree
P-Grid
Distributed data storage |
https://en.wikipedia.org/wiki/Warcraft%20III%20in%20esports | The expansion to the computer game Warcraft III: Reign of Chaos, known as The Frozen Throne, had an active professional competition scene, particularly in China, Germany, and South Korea. The game was featured at eSports festivals including the World Cyber Games, the Electronic Sports World Cup, the World e-Sports Games, the World Series of Video Games and the International E-Sports Festival. Outside of the professional circuit, the game had many active competitive circuits, with users at Battle.net ranging between 70,000 and 100,000 at any given moment. In China, in which Warcraft III was extremely popular due to it being easily available through piracy, fans and users often used an alternative client due to the country's poor internet connections to the outside world. Around 3,000,000 copies of the game were sold in the country. 500,000 Chinese competed in the Chinese qualifiers for the 2006 World Cyber Games. The amount of prize money through the years has been significant with top players winning hundreds of thousands of dollars. As usual in competitive gaming, income for Warcraft 3 professional players flowed from various sources like team salaries from pro-gaming teams and sponsorships usually computer technology related. A famous example was the Danish gaming organization known as Meet Your Makers which boasted of paying their players 300,000 on an annual basis. Similar to older games with huge competitive scenes like Starcraft:Brood War and Counter-Strike 1.6, the popularity of Warcraft 3 steadily declined and towards the end of the previous decade almost all tournaments and players were Chinese. After 2010, with Starcraft 2, League of Legends, and Dota 2 being released and becoming popular, Warcraft 3 gave up its position as one of the prime eSports titles.
Professional Warcraft III players
Sky — Li Xiaofeng
Li Xiaofeng won the 2005 and 2006 World Cyber Games representing China, regarded as Warcraft III's premier individual competition, his victories earned him a massive fanbase and turned him into an icon of China's professional gaming scene on a national and international level. He was recognized as the Warcraft III player of 2006 by competitive gaming media and is a member of the World Cyber Games hall of fame. He is known for revolutionizing the way the Human race is played in Warcraft III and has been considered the top player of the race alongside Frenchman Yoan Merlo since 2005. He has been considered China's number one player since the country's emergence as a major supporter of professional Warcraft III. He has been signed with Chinese based World Elite throughout his professional career.
ToD — Yoan Merlo
He is one of the most successful Warcraft III players ever, holding among other achievements first places at the World e-Sports Games, Blizzard Worldwide Invitational and Cyberathlete Professional League competitions. He is also a World Cyber Games silver and bronze medalist. He was recognized as the Warcraft III player of 2 |
https://en.wikipedia.org/wiki/OVGuide | OVGuide was a website aggregator which allowed users to find online video content. The company was acquired by FOTV Media Networks Inc. for over $10M in 2016. -OVGuide is no longer available-
Included sites
Sites are submitted by users and selected based on editorial review. Once a site is approved for inclusion, it is categorized according to its niche content. Editors do not review specific video titles, but look at the overall quality of a site, such as checking for enough unique video content, potential spyware, excessive ads, or other factors which would make a video site unacceptable for inclusion.
Special events
OVGuide participated as one of the exclusive live streamers of Leeza Gibbons' 'A Night to Make a Difference' at Mr. Chow, an Oscar dinner and charity celebration, which took place on Sunday, February 22, 2009. The event marked the first time an Academy Awards Oscar Party was streamed online to a live worldwide audience.
Acquisitions
In 2010 OVGuide acquired IBeatYou. IBeatYou.com is an online multimedia competition site where users challenge each other in hundreds of categories using videos, photos and text responses. Winning entries are selected by public votes. It ran primarily as a separate business venture with some integration into OVGuide. The developers at IBeatYou played key roles in redesigning an improved version of OVGuide that was released at the end of 2010. Other projects developed by the IBeatYou team include Picbeat - a photo sharing site, and Juicybooth.com, which allows users to interactively spoof pictures. The total deal was worth $2.975M, with $1.487M in earnout. IBeatYou was later acquired from OVGuide by Photobucket in an all-stock transaction.
Live Matrix was acquired by OVGuide in early 2012. They are a guide to live and upcoming scheduled events on the Web. It was seen as a strategic business move to expand OVGuide into becoming a live event guide too. As part of the deal, Sanjay Reddy, who was the CEO/co-founder of Live Matrix, replaced Peter Lee as OVGuide's new CEO. Reddy was the SVP, Business Development & Strategic Planning, at Gemstar-TV Guide International and has an extensive background in the online multimedia space. It was an all-stock deal.
See also
Eguiders
YouTube
Tubefilter
References
External links
Official website
Video hosting |
https://en.wikipedia.org/wiki/Tapout%20%28TV%20series%29 | Tapout was an American reality television series that focuses on the world of mixed martial arts. The series premiered on Versus, which is now NBC Sports Network, on June 3, 2007, before moving to its regular Wednesday night timeslot beginning June 6. The series follows Charles Lewis, Jr. - "Mask", Dan Caldwell - "Punkass", and Tim Katz "SkySkrape" of the Tapout clothing and gear line, as they travel around the country in search of promising MMA fighters to develop and possibly sponsor. Each episode follows the training and development of one fighter, culminating in a fight at a professional MMA event.
As the series progressed the focus broadened to encompass not just the scouting of new talent but also the efforts of the Tapout crew to build their business, including day-to-day operations and the inter-relationships between the crew members and other Tapout employees.
On March 11, 2009, Charles "Mask" Lewis was killed in an automobile accident in Newport Beach, California. A female companion was ejected from the car and taken for medical treatment but Lewis was pronounced dead at the scene. The driver of a second car, believed to have been traveling alongside Lewis's car, was arrested on charges of gross vehicular manslaughter while intoxicated.
Season 1
Season 2
References
External links
Official NBC Sports MMA website
2000s American reality television series
2007 American television series debuts
NBC Sports
Mixed martial arts television shows |
https://en.wikipedia.org/wiki/Paul%20Schiffer | Paul Schiffer is a native of Canton, Ohio. He is the host of the political talk show, The Schiffer Report.
Paul was a nationally syndicated conservative talk show host on the Radio America network, and more recently was broadcast on WERE (AM) 1300 AM and WHK 1220 AM in Cleveland, Ohio and WNPQ 95.9 FM in Canton, Ohio.
Paul was a candidate for U.S. Congress in Ohio's 16th congressional district in the 2008 Republican primary.
External links
Paul Schiffer's campaign website
Politicians from Canton, Ohio
Living people
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/The%20Universe%20%28TV%20series%29 | The Universe is an American documentary television series that features computer-generated imagery and computer graphics of astronomical objects in the universe plus interviews with experts who study in the fields of cosmology, astronomy, and astrophysics. The program is produced by Flight 33 Productions and Workaholic Productions.
The series premiered on May 29, 2007, on The History Channel and four subsequent seasons were aired until 2010. Starting from October 25, 2011, new episodes began airing exclusively on H2.
The series currently airs on Viceland and Story Television.
Format
The series covers topics concerning space exploration, the Solar System, and astronomical objects in the universe. It shows CGI renderings of these aforementioned, video footage, photographs, and views from scientists, project managers, engineers, advocates, writers and other experts. The episode "7 Wonders of the Solar System", and Season 6 were produced in 3D. The last two seasons focus on ancient mysteries that related to the universe and retitled as The Universe: Ancient Mysteries Solved.
Episodes
Season 1: 2007
Season 2: 2007–08
Season 3: 2008–09
Season 4: 2009
Season 5: 2010
Season 6: 2011
Season 7: 2012
Season 8: 2014
Season 9: 2015
References
General references
External links
Flight 33 Productions website
History (American TV channel) original programming
2007 American television series debuts
2000s American documentary television series
2010s American documentary television series
Documentary television series about astronomy
English-language television shows
Television series by MGM Television |
https://en.wikipedia.org/wiki/WJGA-FM | WJGA-FM (92.1 FM) broadcasts from Jackson, Georgia, on 92.1 MHz from a 285 feet above ground level tower at 5,500 watts ERP. WJGA-FM is owned by Earnhart Broadcasting Co., Inc.
Programming
WJGA-FM broadcasts a wide range of entertainment including oldies, current hits, R&B, and gospel. WJGA has a large assortment of local oriented broadcasts including Jackson High School sporting events, Local community events, and local originating news programming. Besides covering the local Butts County, Georgia, area it covers most of the southeast metro Atlanta area south to Macon, west to Thomaston, and east to Eatonton.For the past five Christmases, the station has simulcasted classic country music from its sister station WKKP 1410 AM in McDonough, Georgia for the holidays.
On-air personalities
Don Earnhart
Susanne Earnhart
Tom Lynde
Todd Wilson
Hannah Thomas
Robert Gulley
Chad Sheppard
Sonny Weaver
External links
JGA
1967 establishments in Georgia (U.S. state)
Radio stations established in 1967 |
https://en.wikipedia.org/wiki/TheGlobe.com | theGlobe.com was an internet startup founded in 1995 by Cornell students Stephan Paternot and Todd Krizelman. A social networking service, theGlobe.com made headlines by going public on November 13, 1998 and posting the largest first day gain of any IPO in history up to that date. Part of the dot-com bubble, the company's stock price collapsed the next year, and the company retrenched for several years before ceasing operations in 2008.
History
Early success
While undergraduates at Cornell, Paternot and Krizelman encountered a primitive chatroom on the university's computer network and quickly became engrossed. Realizing the business potential, the two raised $15,000 over the 1994 Christmas break and purchased an Apple Internet Server. They founded a programming company, WebGenesis, and spent the next few months programming what would become their primary website. theGlobe.com went live April 1, 1995, and attracted over 44,000 visits within the first month. They readily recruited talent from the Cornell computer science department and had 17 employees by the site's first anniversary.
The pair used the popularity of the site and the increasing interest in the internet in 1997 to secure $20 million in financing through Dancing Bear Investments. As a result, Paternot and Krizelman received salaries in excess of $100,000 and revenues from preferred shares sales of $500,000 each. Both were 23 years old at the time.
In 1998, plans were made to take the company public. On Friday, November 13, 1998, theGlobe.com issued its IPO. The stock's target share price was initially set at $9, yet the first trade was at $87 and the price climbed as high as $97 before closing at $63.50. At the end of the trading day, the company had set a record for IPOs with a 606% increase over the initial share price. The company floated 3.1 million shares, raising $27.9 million and bringing its market capitalization to over $840 million. Based on their holdings, the young founders were worth close to $100 million each.
During the late 1990s, theGlobe.com expanded into gaming, purchasing Computer Games magazine, happypuppy.com (a computer gaming site), and Chips and Bits, an online store for computer and console gaming.
Decline and downfall
As the fortunes of a number of very young people grew almost overnight, the public and the media began to scrutinize these new economy wunderkinds. In 1999, CNN filmed Paternot during a night on the town. He was shown in shiny vinyl pants, dancing on a table at a trendy Manhattan night club with his girlfriend, model Jennifer Medley. During the piece, he made the statement, "Got the girl. Got the money. Now I'm ready to live a disgusting, frivolous life." He was derisively dubbed "the CEO in the plastic pants" and became a visible symbol of the excesses of dot-com millionaires.
That year also marked the change in the momentum of the dot com boom and theGlobe.com's stock price was hit heavily. As investors grew increasing |
https://en.wikipedia.org/wiki/Adam%20Rhodes | Adam Rhodes is a fictional character from the Australian Network Ten soap opera Neighbours, played by Benjamin Hart. The character debuted on-screen during the episode airing on 14 June 2007 and left on 29 November 2007.
Creation and casting
Adam was created as part of the 2007 revamp of the serial. He was also a new long-term love interest for existing character Pepper Steiger (Nicky Whelan). A British actor was sought to play the role, a move made by producers in the hope of attracting new viewers in the UK. Former Hollyoaks actor Benjamin Hart was eventually cast. He received help in getting the part from his friend Dannii Minogue, who used her agent and negotiated a deal on a contract. Of how the casting worked Hart stated: "I was due to fly out that day back to London, but on my way to the airport I went to see Neighbours casting boss Jan Russ and within 10 minutes of leaving her office, they called and offered me the part." Regarding Minogue's involvement, he said "I was here with her in December and this time madame totally orchestrated it." In July 2007 it was announced that Whelan had cut her contract short with the serial and left. With his on-screen love interest departing, it was then revealed that Hart's six-month contract would not be renewed, but the door would be left open for his character to return in the future.
Characterisation
Network Ten describe Adam as being a tall, dark, handsome and uber-macho British backpacker. He is described as liking Australian people over fellow backpackers. The add he is "a down-to-earth bloke who tells it like it is" and "Pepper's knight in shining armour".
Storylines
Adam arrives as a construction worker who rescued Pepper from the unwanted advances of Karl Kennedy's (Alan Fletcher) new boss, Davo (Stephen Jenkins). Adam then starts to flirt with Pepper at every opportunity. She eventually admits that she is attracted to him and accepts when he asks her out on a date. When Pepper's father, Allan Steiger (Joe Clements), finds out about Pepper's involvement with Adam, he soon becomes suspicious that he may be "bad news", and soon Pepper becomes to grow wary as well, thinking he is a criminal. Adam confesses to Pepper that he was a police officer in England, and he was consumed with guilt because his negligence had resulted in his partner being shot dead during an investigation. Adam leaves town, feeling that Pepper will be better off without him. He later comes to his senses when he realises that he was running away from his problems and also how much he loves Pepper; he shows up at the Timmins farewell barbecue and tells Pepper he wants to stay and figure his life out. They want to get married so Adam can get a visa. However Christine Rodd (Trudy Hellier), Pepper's mother, convinces them it was a bad idea to get married so early on, so the pair try to think of another way to get Adam a visa.
Adam decides in order to get a visa he will rejoin the police force. He has to undergo a psych evaluat |
https://en.wikipedia.org/wiki/1%2C2-Dichloroethane%20%28data%20page%29 | This page provides supplementary chemical data on 1,2-dichloroethane.
Structure and properties
Thermodynamic properties
Vapor pressure of liquid
Table data obtained from CRC Handbook of Chemistry and Physics 44th ed. The (s) annotation indicates temperature is equilibrium of vapor over solid. Otherwise temperature is equilibrium of vapor over liquid.
Distillation data
See also:
Tetrachloroethylene (data page)
Spectral data
References
Dichloroethane
Chemical data pages cleanup |
https://en.wikipedia.org/wiki/Loop%20management%20system | In local telephone networks, a loop management system (LMS) is a kind or a part of network management system intended to maximize local loop control. Sometimes it is referred to as local loop management (LLM) or copper loop management (CLM).
Although local loop unbundling is a standard process for an incumbent (ILEC), issues remain to be solved in the local loop management process. For a CLEC which borrows lines from ILEC for DSL services provisioning process, a local loop is the most critical (and the most weak) point because of reduced management of this vital part of the network.
During the provisioning process, a CLEC can request from its serving ILEC, a new cross-connect. By agreement ILEC must fulfill this request but it's almost impossible to immediately learn a local loop's quality or monitor its activity in real time. Such steps are sometimes mandatory for loop pretesting and qualification in order to validate its good (or bad) condition. Furthermore, testing and validation steps are vital in troubleshooting process.
LMS, sometimes implemented as a part of a major network management system, views the local loop as an active network element. It speeds pre-qualification and reduces fault correction time.
A complete LMS has software and hardware components. The latter is usually a switch fabric connected both to all required lines and line equipment at either side of a line. The functionality is similar to one performed by a main distribution frame or any other distribution frame, so sometimes is referred to as automated main distribution frame. A software component implies implementing management operations.
Network management
Local loop |
https://en.wikipedia.org/wiki/SPIN%20%28software%20process%29 | A Software Process Improvement Network (SPIN) is an organization of professionals who are interested in software and systems process improvement. As of a few years ago, there were 116 SPINs in 37 countries worldwide in their individual geographical areas.
Each SPIN is a completely independent organization. The Software Engineering Institute (SEI) previously provided support to the SPINs by creating, maintaining, and distributing the SPIN Directory; connecting those software professionals with emerging or existing SPINs; and distributing the SPINs start-up information.
See also
Software Engineering Institute
ISO 15504
External links
Software Engineering Institute (SEI)
Bangalore, India SPIN
Chicago SPIN
Milwaukee SPIN
Tehran SPIN
Cape Town SPIN
Chennai SPIN, India
Software engineering organizations |
https://en.wikipedia.org/wiki/David%20Avis | David Michael Avis (born March 20, 1951) is a Canadian and British computer scientist known for his contributions to geometric computations. Avis is a professor in computational geometry and applied mathematics in the School of Computer Science, McGill University, in Montreal. Since 2010, he belongs to Department of Communications and Computer Engineering, School of Informatics, Kyoto University.
Avis received his Ph.D. in 1977 from Stanford University. He has published more than 70 journal papers and articles. Writing with Komei Fukuda, Avis proposed a reverse-search algorithm for the
vertex enumeration problem; their algorithm generates all of the vertices of a convex polytope.
Selected publications
References
External links
School of Computer Science(McGill Univ.)
David Avis’ homepage(McGill Univ.)
David Avis' homepage(Kyoto Univ.)
http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/a/Avis:David.html
1951 births
Living people
Researchers in geometric algorithms
Stanford University School of Humanities and Sciences alumni
Academic staff of McGill University
20th-century British mathematicians
21st-century British mathematicians
Anglophone Quebec people
Stanford University School of Engineering alumni |
https://en.wikipedia.org/wiki/Healia | Healia is a health vertical search engine and online health community. Healia's search engine uses algorithms to assess quality and to categorize Web documents. Healia Communities is composed of online health support groups that enable people to share health experiences, connect with others, and ask questions of peers and health professionals. Healia, Inc. is located in Bellevue, Washington, USA.
Quality Index Score and Personalization Algorithms
Healia use patent-pending Quality Index Score to judge the quality of search results.
Healia uses algorithms to assess the content and audience focus of health Web pages and allows users to filter search results by those characteristics.
Management team
President & Founder: Thomas R. Eng (VMD, MPH).
Thomas (Tom) Eng received a Small Business Innovation Research (SBIR) Award from the National Institutes of Health(NIH) in 2001 to develop this website. The National Cancer Institute (part of the NIH) assisted with research and development, and Healia was incorporated in March 2005. It became available to the public in September 2006.
Healia was acquired by Meredith Corporation in June 2007.
Healia's CTO is Mike Schultz (PhD) who runs the technology development.
AMSA Partnership
In 2009, Healia partnered with the American Medical Student Association (AMSA) to provide medical students an opportunity to answer health questions posed in Healia Communities alongside licensed professionals.
Drawbacks
The searching results are heavily US biased with many initial search results finding information from American web sites.
See also
Medical literature retrieval
References
External links
Healia.com Official website
Searcher, Healia Thyself
A conversation with Tom Eng, Founder of Healia
American health websites |
https://en.wikipedia.org/wiki/Victor%20Klee | Victor LaRue Klee, Jr. (September 18, 1925 – August 17, 2007) was a mathematician specialising in convex sets, functional analysis, analysis of algorithms, optimization, and combinatorics. He spent almost his entire career at the University of Washington in Seattle.
Life
Born in San Francisco, Vic Klee earned his B.A. degree in 1945 with high honors from Pomona College, majoring in mathematics and chemistry. He did his graduate studies, including a thesis on Convex Sets in Linear Spaces, and received his PhD in mathematics from the University of Virginia in 1949. After teaching for several years at the University of Virginia, he moved in 1953 to the University of Washington in Seattle, Washington, where he was a faculty member for 54 years.
He died in Lakewood, Ohio.
Research
Klee wrote more than 240 research papers. He proposed Klee's measure problem and the art gallery problem. Kleetopes are also named after him, as is the Klee–Minty cube, which shows that the simplex algorithm for linear programming does not work in polynomial time in the worst–case scenario.
Service and recognition
Klee served as president of the Mathematical Association of America from 1971 to 1973. In 1972 he won a Lester R. Ford Award.
Notes
Further reading
Short biography, and reminiscences of colleagues.
External links
Applied Geometry and Discrete Mathematics a volume dedicated to Klee on his 65th birthday.
Brief obituary at the Mathematical Association of America (MAA)
AMS column: People Making a Difference
MAA presidents: Victor LaRue Klee
Shapes of the Future: Some unsolved problems in geometry. Two dimensions, Three dimensions
1925 births
2007 deaths
Writers from San Francisco
University of Virginia alumni
University of Washington faculty
20th-century American mathematicians
Fellows of the American Academy of Arts and Sciences
Fellows of the American Association for the Advancement of Science
Institute for Advanced Study visiting scholars
Presidents of the Mathematical Association of America
Educators from California
American science writers
Pomona College alumni |
https://en.wikipedia.org/wiki/Pi%C3%B1ata%20%28film%29 | Piñata is a 2005 Australian computer-animated short film, produced by Act3animation in Australia, released in 2005. It received funding from the Australian Film Commission. It has screened at various festivals around the world, including the Annecy International Animation Festival and SIGGRAPH, both in 2005, and for the first time in Australia on free-to-air television in February 2007 on ABC2's short film series Short & Curly.
Plot summary
A piñata (voiced by Mark Mitchell) suspended from a rope on a tree, awakens as if coming to life for the first time. It hears the noise of children and wants to join them, but can not when it is tied to the tree). Soon though, a girl (voiced by Alice Hollands), with only her sombrero showing, wielding a large (but not quite large enough) stick approaches and begins swinging unsuccessfully at the piñata. Shortly, another child shows up with a stick that can reach it and the piñata, to its surprise, gets hit across the face. To its horror, more children (a group of sombreros) show up and attack it. This happens a few more times, until the piñata climbs up its rope out of their reach using its teeth. The children are dismayed, until an adult, represented by a larger sombrero, comes in with a stick large enough to reach the piñata. The adult winds up for the hit and begins shaking. The piñata also begins shaking. Just before the adult strikes, the piñata, in a great state of fear and panic, is struck by a vicious bout of diarrhea, which for a piñata is in the form of candy. The children rejoice and the piñata is relieved, since it is now left alone. But to its surprise, as the film finishes, it is attacked once more by the original little girl, who has acquired the large stick used by the adult.
Awards
Won
2005 - Vidfest.
Picked for
2005 - Annecy International Animated Film Festival
2005 - AFI Awards - Best Short Animation
2005 - Flickerfest
2005 - SIGGRAPH
References
External links
Piñata on Act3animation website
Piñata on Atomfilms
Piñata on Nice Shorts
Piñata on ABC2's Short & Curly
2005 films
2005 short films
2005 comedy films
2005 computer-animated films
2000s Australian animated films
2000s children's comedy films
2000s children's animated films
2000s English-language films
Australian animated short films
Australian computer-animated films
Australian children's comedy films
Animated films about children
Animated films about birthdays
Australian comedy short films |
https://en.wikipedia.org/wiki/IGMP%20snooping | IGMP snooping is the process of listening to Internet Group Management Protocol (IGMP) network traffic to control delivery of IP multicasts. Network switches with IGMP snooping listen in on the IGMP conversation between hosts and routers and maintain a map of which links need which IP multicast transmission. Multicasts may be filtered from the links which do not need them, conserving bandwidth on those links.
IGMP snooping is described in an informational IETF RFC but affects bridging operations, the purview of the IEEE. Because of a lack of an authoritative standard, the process may operate differently on different equipment.
Purpose
A switch will, by default, flood multicast traffic to all the ports in a broadcast domain (or the VLAN equivalent). Multicast can cause unnecessary load on host devices by requiring them to process packets they have not solicited. When purposefully exploited, this can form the basis of a denial-of-service attack. IGMP snooping is designed to prevent hosts on a local network from receiving traffic for a multicast group they have not explicitly joined. It provides switches with a mechanism to prune multicast traffic from links that do not contain a multicast listener (an IGMP client).
Essentially, IGMP snooping is a layer 2 optimization for the layer 3 IGMP. IGMP snooping takes place internally on switches and is not a protocol feature.
IGMP snooping allows a switch to only forward multicast traffic to the links that have solicited them. Snooping is therefore especially useful for bandwidth-intensive IP multicast applications such as IPTV.
Standard status
IGMP snooping, although an important technique, overlaps two standards organizations, namely IEEE which standardizes Ethernet switches, and IETF which standardizes IP multicast. This means that there is no clear standards body responsible for this technique. This is why on IGMP snooping carries only an informational status, despite actually being referred to in other standards work, such as , as normative.
Implementations options
IGMP querier
In order for IGMP, and thus IGMP snooping, to function, a multicast router must exist on the network and generate IGMP queries. Without a querier IGMP membership reporting may be incomplete and the tables associating member ports and multicast groups are potentially incomplete and snooping will not work reliably. Some IGMP snooping implementations include full querier capability.
IGMPv2 and IGMPv3 contain provision for selecting a querier when multiple are available. The querier with the lowest IP address is given the role.
IGMP general queries from the querier must be unconditionally forwarded by all switches involved in IGMP snooping.
Proxy reporting
IGMP snooping with proxy reporting or report suppression actively filters IGMP packets in order to reduce load on the multicast router. Joins and leaves heading upstream to the router are filtered so that only the minimal quantity of information is sent. The swit |
https://en.wikipedia.org/wiki/Coenraad%20Bron | Coenraad Bron (2 August 1937 – 15 August 2006) was a Dutch computer scientist. He worked with Edsger W. Dijkstra on the THE multiprogramming system. Together with Joep Kerbosch he invented the Bron–Kerbosch algorithm for the clique problem.
Born in Amsterdam, Bron read Chemistry at Utrecht University. After his graduation he moved to Eindhoven University where he started to work in Dijkstra's group. In 1972 he accepted an assistant professorship in Computing Science at Twente University, becoming a full professor there in 1980.
He died in Assen at age 69.
1937 births
2006 deaths
Dutch computer scientists
Scientists from Amsterdam
Utrecht University alumni
Academic staff of the University of Twente
Academic staff of the University of Groningen |
https://en.wikipedia.org/wiki/Wim%20Ebbinkhuijsen | Wim Ebbinkhuijsen (born 24 December 1939, Amsterdam) is a retired Dutch computer scientist who is considered to be one of the "fathers of COBOL".
in 1979 he initiated the International ISO COBOL Working Group.
From 1967 he was a member, and from 1978 until 2003 he was the chairman of the Dutch COBOL Committee ("Nederlandse COBOL Commissie").
From 1998 until 2001 he was also a member of the NCITS/ANSI COBOL committee X3J4. As such, he has designed and rewritten dozens parts of the current COBOL standard. He has been active for many years with Exin (EXamenINstituut, "Dutch examination Institute"), where he acted as member and later as chairman of the examining-board T2-COBOL. He has written many books about COBOL and he wrote the first International Standard for the programming language BASIC.
At October 22, 2004 he left the COBOL world after 42 years of commitment, with a valedictory symposium in the auditorium of the Vrije Universiteit of Amsterdam. For his enormous contribution to COBOL he received an IEEE award, and invested as a Knight of the Order of Orange-Nassau (Ridder in de Orde van Oranje Nassau).
External links
valedictory symposium VU, Amsterdam
1939 births
Living people
Dutch computer scientists
Scientists from Amsterdam
Knights of the Order of Orange-Nassau |
https://en.wikipedia.org/wiki/Willem%20van%20der%20Poel | Willem Louis van der Poel (born 2 December 1926) is a Dutch computer scientist, who is known for designing one of the first computers to be designed in the Netherlands, the Zeer Eenvoudige Binaire Reken Automaat (ZEBRA), translated as Very Simple Binary Automatic Calculator.
Biography
In 1950 Van der Poel obtained an engineering degree in applied science at Delft University of Technology, and in 1956 obtained his PhD degree from the University of Amsterdam. The title of his Doctor of Philosophy (Ph.D.) thesis was The Logical Principles of Some Simple Computers.
From 1950 until 1967, he worked for the Dutch Posterijen, Telegrafie en Telefonie (Nederland) (PTT, renamed KPN). From 1962 until 1988, he was a part time professor at Delft University of Technology. One of his PhD students was Gerard J. Holzmann.
He was involved with international standards in programming and informatics, as a member of the International Federation for Information Processing (IFIP) IFIP Working Group 2.1 on Algorithmic Languages and Calculi, which specified, maintains, and supports the programming languages ALGOL 60 and ALGOL 68. He was the first chairperson, from 1962 to 1968. He also contributed to developing the languages ALGOL 68 and LISP for the ZEBRA.
In 1971, Van der Poel was elected a member of the Royal Netherlands Academy of Arts and Sciences. In 1960, he received, together with H. Mol, the Visser-Neerlandia prize for the construction of a Braille translator.
Work
Van der Poel is primarily known as a Dutch computer pioneer, designer of Testudo, the PTERA, the ZERO, and the ZEBRA computers. He is said to be the originator of the zero one infinity rule, which suggests that software designs should not impose arbitrary limits on the number of instances of a particular entity: if more than one instance of it is to be allowed, then the set size should have no fixed limit.
Selected publications
Books
The Logical Principles of Some Simple Computers. Thesis, Amsterdam (1956).
SERA 69, definierend rapport. W.L. van der Poel (Ed.), Stichting Nederlands Studiecentrum voor Informatica (1970).
Een leven met computers. Afscheidsrede, TU Delft, 26 october 1988. Delft University of Technology (1988).
Articles
"A Simple Electronic Digital Computer." Applied Sci. Research (1952), p. 367-400.
"Micro-programming and Trickology." In: Digitale Informations-wandler, E.W. Hoffmann. Vieweg, Braunschweig (1961), p. 269-311.
Van der Poel, W.L., C.E. Schaap and G. van der Mey. "New Arithmetical Operators in the Theory of Combinators." Proc. Kon. Ned. Akad. v. Wetenschappen, Sept (1980) p. 271-325.
References
External links
Curriculum Vitae of Willem Louis van der Poel
1926 births
Living people
Dutch computer scientists
Scientists from The Hague
Delft University of Technology alumni
University of Amsterdam alumni
Academic staff of the Delft University of Technology
Members of the Royal Netherlands Academy of Arts and Sciences |
https://en.wikipedia.org/wiki/ACM%20Transactions%20on%20Multimedia%20Computing%2C%20Communications%2C%20and%20Applications | ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM) is a quarterly scientific journal that aims to disseminate the latest findings of note in the field of multimedia computing. It is published by the Association for Computing Machinery. In May 2014 the acronym has changed from TOMMCAP to TOMM.
The editor-in-chief is Abdulmotaleb El Saddik (Mohamed bin Zayed University of Artificial Intelligence). According to the Journal Citation Reports, the journal had a 2020 impact factor of 3.144.
See also
Association for Computing Machinery
SIGMM
References
External links
ACM SIG MultiMedia website
Computer science journals
Transactions on Multimedia Computing, Communications, and Applications
Academic journals established in 2005
Quarterly journals |
https://en.wikipedia.org/wiki/Optical%20media%20preservation | The preservation of optical media is essential because it is a resource in libraries, and stores audio, video, and computer data to be accessed by patrons. While optical discs are generally more reliable and durable than older media types, (magnetic tape, LPs and other records) environmental conditions and/or poor handling can result in lost information.
Types of media
The two broad types of optical discs are Compact Discs (CDs) and DVDs. Data is retrieved by both CDs and DVDs by devices that focus a laser light beam against the reflective layer allowing data to be read. The data layer, supported by the polycarbonate substrate can be metallic or dye-based, depending on the disc type.
The reflective and data layers of CDs are just below the label and a thin sheet of polycarbonate substrate. A much thicker layer of the substrate supports and protects the bottom of the disc. The reflective and data layers of double-sided DVDs are in the center of the disc structure, housed between two equal layers of polycarbonate substrate. Because the data layer of CDs is more exposed than double-sided DVDs, a thin lacquer layer is used to protect the surface of the CD. The top of a CD is delicate and fragile; the bottom is merely a transparent protective covering.
For preservation purposes: Gold CD-R (Compatible Disc-Recordable) and DVD-R (Digital Video Disc-Recordable or Digital Versatile Disc-Recordable) discs are preferred by experts over aluminium and silver for reliable long-term backup storage—the reflective layer of the optical disc is gold.
Permanent and long-term storage are distinct. “[D] archiving experts commonly acknowledge that no carrier is permanent. Instead, one must maintain data transferred to storage and provide access and ensure integrity of the information for the long-term.” As technology changes data can be migrated from an older to a newer type of media to avoid media failure or “format obsolescence”—a real threat for technology when it is no longer supported. If the machine required to play and read the discs is not kept in working order and maintained, data loss may result. Risks involved with optical media are covered below.
Issues which affect data longevity of nominally archival-grade discs include the following: dye failure (discs with premium organic and pthalocyanine-based long-life dyes are more suitable); bonding failure (premium bonding agents and edge-to-edge coverage improve longevity); scratches, minimised by careful handling and a scratch-resistant coating; production quality (some factories have better quality control standards, and discs from a batch known to be good may be more reliable than another batch). Testing is required since conditions vary from machine to machine and from disc to disc; environmental control is required to prevent damaging conditions. When these conditions are met it is believed that the life of an archival-quality CD-R or DVD-R can be as long as 100 years, compared to the typical five to te |
https://en.wikipedia.org/wiki/CGAL | The Computational Geometry Algorithms Library (CGAL) is an open source software library of computational geometry algorithms. While primarily written in C++, Scilab bindings and bindings generated with SWIG (supporting Python and Java for now) are also available.
The software is available under dual licensing scheme. When used for other open source software, it is available under open source licenses (LGPL or GPL depending on the component). In other cases commercial license may be purchased, under different options for academic/research and industrial customers.
History
The CGAL project was founded in 1996, as a consortium of eight research institutions in Europe and Israel:
Utrecht University, ETH Zurich, Free University of Berlin, INRIA Sophia Antipolis, Martin-Luther-University Halle-Wittenberg, Max Planck Institute for Informatics Saarbrücken, Johannes Kepler University Linz, and Tel-Aviv University. The original funding for the project came from the ESPRIT project of the European Union. Originally, its licensing terms allowed its software to be used freely for academic purposes, with commercial licenses available for other uses. CGAL Releases 3.x were distributed under the QPL license. Starting with CGAL 4.0, released in 2012, CGAL is distributed under the GPL version 3. it is managed by a thirteen-member editorial board, with an additional 30 developers and reviewers.
The project started in 1996 as the pooling of the previous efforts of several project participants:PlaGeo and SpaGeo from Utrecht University, LEDA of the Max-Planck-Institute for Informatics and C++GAL of INRIA Sophia Antipolis. The LEDA library encompasses a broader range of algorithms. A comparison of the two libraries is provided by Kettner and Näher. Three CGAL User workshops held in 2002, 2004, and 2008 highlighted research results related to CGAL, and many additional papers related to CGAL have appeared in other conferences, workshops, and journals.
In 2023 the project won the SoCG Test of Time Award
Scope
The library covers the following topics:
Geometry kernels - basic geometric operations on geometric primitives
Arithmetic and algebra
Convex hull algorithms
Polygons and polyhedra
Polygon and polyhedron operations
Arrangements
Point set triangulations
Delaunay triangulations
Voronoi diagrams
Mesh generation
Geometry processing
Search structures (k-d tree)
Shape analysis, fitting, and distances
Interpolation
Kinetic data structures
Platforms
The library is supported on a number of platforms:
Microsoft Windows (GNU G++, Microsoft Visual C++, Intel C++ Compiler)
GNU g++ (Solaris, Linux, Mac OS)
Clang
The CGAL library depends on the Boost libraries, and several CGAL packages on the Eigen C++ library.
See also
OPEN CASCADE
OpenSCAD (uses CGAL)
References
External links
CGAL Homepage
Geometric algorithms
C++ libraries
Python (programming language) libraries
Free computer libraries
Max Planck Institute for Informatics |
https://en.wikipedia.org/wiki/Bikal | Bikal () is a village in Baranya county, Hungary.
Other Meanings
BiKal is also the name of a developer of Network IP CCTV systems based in the UK. The name is derived from ancient Hindu culture as well as a combination of the creators name.
External links
Street map
BiKal IP CCTV
Populated places in Baranya County |
https://en.wikipedia.org/wiki/Amazon%20Elastic%20Compute%20Cloud | Amazon Elastic Compute Cloud (EC2) is a part of Amazon.com's cloud-computing platform, Amazon Web Services (AWS), that allows users to rent virtual computers on which to run their own computer applications. EC2 encourages scalable deployment of applications by providing a web service through which a user can boot an Amazon Machine Image (AMI) to configure a virtual machine, which Amazon calls an "instance", containing any software desired. A user can create, launch, and terminate server-instances as needed, paying by the second for active servershence the term "elastic". EC2 provides users with control over the geographical location of instances that allows for latency optimization and high levels of redundancy. In November 2010, Amazon switched its own retail website platform to EC2 and AWS.
History
Amazon announced a limited public beta test of EC2 on August 25, 2006, offering access on a first-come, first-served basis.
Amazon added two new instance types (Large and Extra-Large) on October 16, 2007. On May 29, 2008, two more types were added, High-CPU Medium and High-CPU Extra Large. There were twelve types of instances available.
Amazon added three new features on March 27, 2008, static IP addresses, availability zones, and user selectable kernels. On August 20, 2008, Amazon added Elastic Block Store (EBS)
This provides persistent storage, a feature that had been lacking since the service was introduced.
Amazon EC2 went into full production when it dropped the beta label on October 23, 2008. On the same day, Amazon announced the following features:
a service level agreement for EC2,
Microsoft Windows in beta form on EC2,
Microsoft SQL Server in beta form on EC2,
plans for an AWS management console, and
plans for load balancing, autoscaling, and cloud monitoring services.
These features were subsequently added on May 18, 2009.
Amazon EC2 was developed mostly by a team in Cape Town, South Africa led by Chris Pinkham. Pinkham provided the initial architecture guidance for EC2 and then built the team and led the development of the project along with Willem van Biljon.
Instance types
Initially, EC2 used Xen virtualization exclusively. However, on November 6, 2017, Amazon announced the new C5 family of instances that were based on a custom architecture around the KVM hypervisor, called Nitro. Each virtual machine, called an "instance", functions as a virtual private server. Amazon sizes instances based on "Elastic Compute Units". The performance of otherwise identical virtual machines may vary. On November 28, 2017, AWS announced a bare-metal instance type offering marking a remarkable departure from exclusively offering virtualized instance types.
As of January 2019, the following instance types were offered:
General Purpose: A1, T3, T2, M5, M5a, M4, T3a
Compute Optimized: C5, C5n, C4
Memory Optimized: R5, R5a, R4, X1e, X1, High Memory, z1d
Accelerated Computing: P3, P2, G3, F1
Storage Optimized: H1, I3, D2
, the following payment |
https://en.wikipedia.org/wiki/C-Netz | The Radio Telephone Network C (German: Funktelefonnetz-C, abbreviated as C-Netz), was a first generation analog cellular phone system deployed and operated in Germany (at first West Germany) by DeTeMobil (formerly of Deutsche Bundespost Telekom, currently Deutsche Telekom). It utilized the C-450 standard, originally developed by Siemens AG, and was the third and last update of a series of analog mobile phone systems used primarily within Germany, superseding the B-Netz and the A-Netz before it. It has been decommissioned, replaced by both the newer D-Netz and E-Netz systems, both based on GSM standards (which are digital) and operating on 900 MHz and 1800 MHz bands respectively.
C-Netz was active from 1985 to 2000, with certain areas until 2001. Since then, all consumer cellular phone services in Germany are digital-only.
The dialing code for the C-Netz was 0161, which is no longer in use. As a result, users were not able to transfer their numbers to GSM networks when the C-Netz was shut down. Austria used an unrelated system with the same C-Netz name which instead utilized the NMT standard. This differs from previous systems used in Austria (A-Netz, B-Netz) that were based on German standards.
Timeline
The C-Netz was officially introduced in 1985 (with unofficial trials in 1984) to replace the existing B-Netz/B2-Netz system used in Germany at the time. Due to problems with the B-Netz mobile networks, early adoption of C-Netz was very high, especially in rural areas which had lacked prior B-Netz coverage. However, like other first-generation analog systems, it suffered from poor call quality and was susceptible to eavesdropping. The system was built up in West Germany and West Berlin, but following German reunification in 1990, was rapidly built up in the new German states.
By December 1988, the service had grown to nearly 100,000 customers, and reached a peak user base of around 800,000 in the early 1990s. It remained popular throughout the decade as a preferred system for mobile car phones, particularly rural taxi services, where it enjoyed an advantage in reception. However, it was inferior in all other ways to the newer GSM networks, and by the late 1990s Deutsche Telekom stopped accepting new customers. Its user base dropped rapidly; in 1999, it went from 230,000 customers in October to 210,000 customers in November.
The C-Netz service was shut down on December 31, 2000. Some cells near the German-Dutch border remained active for several more months but were eventually discontinued as well.
Future use
The C-Netz radio spectrum in Germany (two 6 MHz wide frequency bands) was reallocated for use with Flarion's Flash-OFDM mobile networking standard which launched in 2005. It was primarily used to service Germany's rail service with Internet connectivity under the name Railnet.
Technical information
The C450 standard was developed by Siemens in 1980. It is a 1G analog cellular standard that utilized non-audible in-band signaling, audio |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.