source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Binding%20corporate%20rules | Binding Corporate Rules (BCRs) were developed by the European Union Article 29 Working Party (today the European Data Protection Board) to allow multinational corporations, international organizations, and groups of companies to make intra-organizational transfers of personal data across borders in compliance with EU Data Protection Law. BCRs are a framework for having different elements (internal legal agreements, policies, trainings, audits, etc.) that allow for compliance with EU data protection regulations and privacy protection. The BCRs were developed as an alternative to the "standard contractual clauses" (SCCs) and the now defunct U.S. Department of Commerce EU Safe Harbor (which was for US organizations only, but has been declared invalid).
BCRs are required to be approved by the data protection authority in each EU member state (such as the CNIL in France and AEPD in Spain) in which the organization will rely on the BCRs. The EU has developed a mutual recognition process under which BCRs approved by one member state's data protection authority (known as the "lead" authority) and two other "co-lead" authorities, may be approved by the other relevant member states who may make comments and ask for amendments. Other members states, not part of mutual recognition process, will be also involved by the lead authority and will apply their own independent review process within a limited time-frame. The overall process for BCR acceptance takes usually between 6 and 9 months. This time frame does not include the required Data Protection setup, which should be already implemented within the company in order to comply with the current directive and its local implementation.
BCRs typically form stringent, intra-corporate global privacy policies, set of practices, processes and guidelines that satisfy EU standards and may be available as an alternative means of authorizing transfers of personal data (e.g., customer databases, HR information, etc.) outside of Europe. BCRs are considered the most "robust" and accepted regime for data transfers.
It has to be noticed that, while originally designed for providing legal ground to international transfers, BCRs became de facto a corporation demonstration of its capacity to comply "at large" with personal data processing requirements. A corporation having BCRs applies this framework independently of international transfers and should be seen as part of the "Corporate Governance" or "Data Governance".
References
External links
https://edpb.europa.eu/our-work-tools/accountability-tools/bcr_en
International business
Privacy law |
https://en.wikipedia.org/wiki/Real%20Time%20Rome | Real Time Rome is a 2006 exhibit by the MIT Senseable City Lab, directed by professor Richard Burdett. The project used anonymized cell-phone data from sponsor Telecom Italia's Lochness platform about telecom traffic and signal strength, as well as GPS data from buses and taxis, to analyze and visualize the movement of people through Rome in real time.
Prior to Real Time Rome's debut, MIT had produced a similar project in Graz, Austria. City Lab director Carlo Ratti said at the time that the City Lab planned to expand to cities including Florence and Zaragoza.
The project debuted on September 8, 2006, at the Venice Biennale, an exhibition of fine arts and urban studies technology projects. During the demo, MIT projected several animations on Plexiglass screens, with data collected about five minutes before being shown. Brighter colors on the projections indicated areas of higher traffic, and visualizations of traffic spikes in the city. These included surges in cell-phone use during Madonna's controversial 2006 performance in Rome and Italy's victory in the World Cup.
The exhibition ran until November 19. MIT later built on the exhibit with WikiCity Rome, a similar project, in 2007.
References
External links
Real Time Rome site
Video art |
https://en.wikipedia.org/wiki/EBAN | EBAN (European Business Angel Network) is an international, not-for-profit organisation whose function is to represent the pan-European early stage investor community, gathering member organisations and individuals from Europe and beyond. Originally targeted only to business angels, today EBAN is a cross sector representative of equity early stage investors.
EBAN represents a sector estimated to invest 5.1billion Euros a year and comprising 260.000 angel investors. According to its annual collection of data (2012) and exclusively though business angel networks, 2900 company were funded and 17800 jobs were created.
History
EBAN was established in 1999 by a group of pioneer angel networks in Europe with the collaboration of the European Commission and EURADA (the European Association of Development Agencies). In 1999, only 50 business angel networks were identified across Europe to support high growth start-ups, with more than half operating in the UK. Today, the number of business angel networks has risen to 460.
Activities
Setting professional standards, training, and certification for the early stage investment asset class; building the capacity of early stage investment actors to facilitate co-investment as well as increasing transparency in the market by changing the culture on reporting standards.
Benchmarking, research and networking with peers .
Lobbying, trusted and continued dialogue with European policy makers to improve the working environment of early stage investors.
Raising awareness, advocacy and capacity building.
Cross-border syndication and co-investment support.
Structure
Types of members accepted by EBAN (31/12/2013)
Business Angels
Business angels networks
Federations of business angels networks
Early stage venture capital funds
Business accelerators
Electronic funding platforms
Associate/ other early stage market players
Governance
EBAN is led by a Board of Directors elected for 2-year mandates. The Board selects a President and an Executive Committee which becomes involved in the day-to-day operations with the Secretariat.
EBAN Presidents
2018–present Peter Cowley, Martlet and Cambridge Angels, United Kingdom
2014-2018 Candace Johnson, Sophia Business Angels, France
2012-2014 Paulo Andrez, FNABA, Portugal
2010-2012 Brigitte Baumann, Go Beyond, Switzerland
2006-2010 Anthony Clarke, London Business Angels, United Kingdom
2003-2006 Peter Jungen, BAND, Germany
Before 2003, co-presidency system
Executive committee
Executive committee composition at (31-12-2013)
Paulo Andrez, FNABA, Portugal (President)
Ari Korhonen, FiBAN, Finland (Vice-President)
Albert Colomer, ESBAN, Catalunya
Baybars Altuntaş, TBAA, Turkey
Annual events and past editions
Annual Congress
Two days annual meeting organized in order to debate the role of early stage investors in Europe as key players to foster growth, learning, lobbying and networking. Different speeches, workshops, venues and the awards ceremony for the EB |
https://en.wikipedia.org/wiki/Star%20Rider | Star Rider is a racing LaserDisc video game developed by Computer Creations and Williams Electronics, and released for arcades in 1983. The object of the game is to win a futuristic motorcycle race that takes place in surrealistic settings. The tracks themselves and the background graphics are video played from a laserdisc, and are of higher quality than possible with real-time computer graphics at the time. The foreground graphics and racers are superimposed on the video. Star Rider has a rear view mirror—possibly the first racing game with one —which warns of opponents approaching from behind.
Star Rider was produced in both an upright and a sit-down version where the player would sit on a replica of the cycle. It was released after the video game crash of 1983 and was not widely distributed. According to Eugene Jarvis of Williams, Star Rider was a "major dog" and resulted in or contributed to a loss of US$50 million. The title character from Sinistar and a flying mount from Joust make cameo appearances in the background graphics.
Development and release
The game was conceived to compete with the laserdisc game Dragon's Lair which had just come to market. R.J. Mical coordinated the project, Python Anghelo was a co-designer, Ken Lantz directed software development, Richard Witt was the lead programmer, Ken Graham was a secondary programmer, and John Newcomer was the "creative director". The hardware was custom build specially for the game; the laser disc video production was outsourced to a third-party company, Computer Creations, of South Bend, Indiana. The CGI graphics were rendered at Grey and Associates. Witt and Lantz developed a means by which the first few lines of NTSC video signal contained data about the roadway, so that animated riders could appear to follow the track.
Star Rider was first demonstrated at the Amusement & Music Operators Association (AMOA) show in October 1983. It demonstrated the use of pre-rendered 3D computer graphics, which had previously been demonstrated by Funai's Interstellar at the Amusement Machine Show (AM Show) in September 1983. Star Rider was released in North America in November 1983.
Reception
In the United States, it was the top-grossing laserdisc game at arcade locations on the Play Meter charts in August 1984. It was later the top laserdisc game at street locations in November 1984.
Legacy
In the 1987 slasher horror movie Blood Rage, two characters, Artie (James Farrell) and Gregg (Chad Montgomery), are seen playing Star Rider on a television set. Later, Artie and Julie (Jayne Bentzen) are seen playing the game but using joysticks to control the screen.
References
External links
Star Rider page at the Dragon's Lair Project*
Star Rider: Arcade Laser Disc’s Last Stand at The Arcade Blogger
Star Rider Blu-Ray (2015) by Arrow Video
LaserDisc video games
Racing video games
1983 video games
Arcade video games
Arcade-only video games
Video games developed in the United States
Williams video gam |
https://en.wikipedia.org/wiki/Diodata%20Saluzzo%20Roero | Diodata Saluzzo Roero (1774–1840) was an Italian poet, playwright and author of prose fiction. Her work drew praise from such figures as Tommaso Valperga di Caluso, Giuseppe Parini, Ludovico di Breme, Alessandro Manzoni, Vittorio Alfieri and Ugo Foscolo, and her life served as an inspiration for the protagonist in Germaine de Staël's 1807 Corinne.
Diodata Saluzzo was born in Turin to Jeronima Cassotti di Casalgrasso and Giuseppe Angelo Saluzzo di Monesiglio, a well-known scientist. In 1795 she became one of the first women to be admitted to the Accademia degli Arcadi, and the following year released her first collection of poems. In 1799 she married the count Massimiliano Roero di Revello, but on his death three years later returned to live with her family. A collection of her romantic short stories on historical themes was published in 1830. Of these the best known is Il Castello di Binasco, a novella based on the second marriage and execution of Beatrice di Tenda, first published in Raccoglitore in 1819.
Diodata Saluzzo Roero died in Turin in 1840.
References
External links
‘Il Castello di Binasco. Novella (inedita) di cui li principali avvenimenti ed i personnaggi sono tratti dalla storia del 1360. (Della contessa Diodata Saluzzo)’, in Il Roccoglitore, I (Milan: Batellli e Fanfani, 1819), pp. 162–188.
1774 births
1840 deaths
Writers from Turin
Italian women poets
Members of the Academy of Arcadians
18th-century Italian women writers
19th-century Italian women writers
Italian women dramatists and playwrights |
https://en.wikipedia.org/wiki/P2P%20caching | Peer-to-peer caching (P2P caching) is a computer network traffic management technology used by Internet Service Providers (ISPs) to accelerate content delivered over peer-to-peer (P2P) networks while reducing related bandwidth costs.
P2P caching is similar in principle to the content caching long used by ISPs to accelerate Web (HTTP) content. P2P caching temporarily stores popular content that is flowing into an ISP's network. If the content requested by a subscriber is available from a cache, the cache satisfies the request from its temporary storage, eliminating data transfer through expensive transit links and reducing network congestion. This approach could make ISPs violate laws as P2P systems share files that infringe copyrights in significant portions.
P2P content responds well to caching because it has high reuse patterns reflecting a Zipf's-like distribution. P2P communities have different Zipf's parameters which determine what fraction of files is requested multiple times. For example, one P2P community may request 75% of content multiple times while another may request only 10%.
Some P2P caching devices can also accelerate HTTP video streaming traffic from YouTube, Facebook, RapidShare, MegaUpload, Google, AOL Video, MySpace and other web video-sharing sites.
How P2P caching works
P2P caching involves creating a cache or temporary storage space for P2P data, using specialized communications hardware, disk storage and associated software. This cache is placed in the ISP's network, either co-located with the Internet transit links or placed at key aggregation points or at each cable head-end.
Once a P2P cache is established, the network will transparently redirect P2P traffic to the cache, which either serves the file directly or passes the request on to a remote P2P user and simultaneously caches that data for the next user. To what extent the caching is beneficial depends on how similar the content interests of ISP's customers. Due to relatively small number of content shared in P2P systems (compared to Web) and semantic, geographic, and organization interests of users sharing ratio in P2P can be significantly higher than HTTP/Web caching.
P2P caching typically works with a network traffic-mitigation technology called Deep Packet Inspection (DPI). DPI technology is used by service providers to understand what traffic is running across their networks and to separate it and treat it for the most efficient delivery. DPI products identify and pass P2P packets to the P2P caching system so it can cache the traffic and accelerate it.
Peerapp Ltd. holds the first patent for P2P caching technology, which was filed in 2000.
The P2P bandwidth problem
In 2008, peer-to-peer traffic was estimated to account for 50% of all Internet traffic, and was expected to quadruple between 2008 and 2013, reaching 3.3 exabytes per month– or the equivalent of 500 million DVDs each month. However, this trend has been discontinued, as by 2016 the glob |
https://en.wikipedia.org/wiki/VideoBrain%20Family%20Computer | The VideoBrain Family Computer (model 101) is an 8-bit home computer manufactured by Umtech Incorporated, starting in 1977. It is based on the Fairchild Semiconductor F8 CPU. It was not a large commercial success and was discontinued from the market less than three years after its initial release. Some of its lack of success has been attributed to the decision to substitute the APL/S programming language over the then-standard BASIC. Due to the high cost of RAM memory, it only contained 1 KB. It had a full-travel keyboard, unlike some early home computers that featured membrane keypads (and earlier kit machines that used switches), but with a very non-standard layout. It was designed by David Chung and Albert Yu.
History
The VideoBrain Family Computer was designed and produced by Umtech Inc., doing business as the VideoBrain Computer Company of California in 1977. It was not widely available, although Macy's department store briefly carried the computer on its shelves. It was sold in various configurations, and the price ranged from $500 to $1100 depending on the accessories chosen. New software for the VideoBrain was available on cartridge, which was a first for home computer systems (Later price reductions brought costs down to $300 for the computer by itself, and $350–900 for the packaged deals).
Available software ranged in price from $20 to $40 for video games and educational software, and $70 to $150 for productivity tools.
Design
The VideoBrain Family Computer was built around the F8 processor from Fairchild Semiconductor, and featured 1KB of RAM and a 4KB ROM. It was able to output 384 x 336 graphics and 128 x 56 semigraphic characters in 16 colors, (based on UV-201 and UV-202 proprietary chips) and sound to a connected television set through an RF connector. By far its most striking feature was the 36-key keyboard - though the keyboard of the VideoBrain was poorly designed and difficult to use, keyboards were not available on any of the more common video game consoles of the time. Some popular kit-based computers also typically lacked a keyboard, opting for toggle switches instead. The system also features four joystick ports, a cartridge connector, and an expansion port.
The system included four built-in software titles, available if the unit is powered on without a cartridge inserted - a simple text editor, a clock, a countdown timer, and a Color Bar generator.
Two additional hardware modules were marketed that would extend the capabilities of the VideoBrain. The Expander 1 was an interface to various I/O devices. It allowed users to connect a cassette tape recorder for saving or loading data, and included two RS-232 ports for attaching a printer and the Expander 2. The Expander 2 was a 300 baud acoustic modem used by a single program (Timeshare) that allowed the VideoBrain to act as a terminal when dialed into a compatible mainframe computer.
Additional software was sold on cartridges measuring approximately the size of a Be |
https://en.wikipedia.org/wiki/Chris%20Shipley | Chris Shipley (born January 11, 1962) is an American tech author and analyst.
Biography
Shipley began her career as a technology writer, and later became executive editor at PC/Computing magazine, then joined the company's online publishing division, ZDNet, where she introduced online publications on CompuServe, Prodigy, and Ziff-Davis's Interchange Online Network. In 1994, Shipley became the founding editor of Computer Life magazine, based in San Francisco.
In 1996, Shipley joined International Data Group (IDG) as the executive producer of the DEMO Conference, a conference of industry insiders, investors, early adopters, and journalists working in the data and tech sectors.
She is the author of several books, including How to Connect (Ziff-Davis Press) and How the World Wide Web Works (Ziff-Davis Press). In 2020, Shipley co-authored The Adaptation Advantage (Wiley), a book about the future of work, with Heather Elizabeth McGowan. The book was selected as one of the top 30 business books of 2021 by Soundview
Shipley has served on the boards of several start-up companies, including Versaic, which was acquired by Benevity in 2018. She was also the founder and CEO of Guidewire Group, a technology services firm and startup incubator based in the San Francisco Bay Area, and a mentor for Unreasonable Group, a business accelerator for social entrepreneurs.
Awards
In 2002, Fortune Small Business Magazine cited Shipley as a "most perfect board member". In 2004 the San Jose Business Journal placed her at the top of its list of Most Influential Women in Silicon Valley. In 2010, SVForum honored Shipley with its Visionary Award.
References
External links
Official Website of Chris Shipley
Photography Website of Chris Shipley
1962 births
Living people
American technology writers
Writers from Pennsylvania
People from Westmoreland County, Pennsylvania |
https://en.wikipedia.org/wiki/Bryantia | Bryantia is a genus of moths in the subfamily Arctiinae. It contains the single species Bryantia caudata, which is found on Java.
References
Natural History Museum Lepidoptera generic names catalog
Lithosiini |
https://en.wikipedia.org/wiki/Brown%20Dog | Brown Dog may refer to
Brown Dog affair, 1900s-decade English vivisection controversy
NCSA Brown Dog, legacy-data access facility
A dog with a brown coat of fur
See also
Brown Dog Tick |
https://en.wikipedia.org/wiki/Milan%20Hudecek | Milan Hudecek (pron. who-de-check, born 9 January 1954) is a Czech-born Australian inventor and entrepreneur. He pioneered the fields of assistive technology for the blind (in particular computing for the blind) and radio communications (in particular software-defined radios). He is a Member of the Order of Australia, winner of the Winston Gordon Award for Technological Advancement in the Field of Blindness and Visual Impairment, and Rolls-Royce & Qantas Award of Engineering Excellence.
Professional career
Founder (1983) and managing director of the Melbourne based Australian Export Award-winning Robotron Group, Hudecek is credited with the invention of the world's first computer for the blind, the Eureka A4, and a number of other assistive products such as reading machines for the blind.
Hudecek is also the founder (1991) of the Australian company radixon Group (formerly Rosetta Laboratories), specializing in various radio communications equipment, in particular software-defined radio. The company's first product was "WiNRADiO" – a wide-band communications receiver on a PC card, the first such product of its kind. An article describing early WiNRADiO products appeared in 1998 in Wired magazine. Radixon Group now sells its computer-controlled radio communications receivers and associated hardware and software under the brand name WiNRADiO.
In the 1997 Australia Day Honours Hudecek was made a Member of the Order of Australia for his "service to people with disabilities through the invention of a laptop computer and other technology for use by people who are blind or partially sighted".
References
External links
Hudecek's company web site
Hudecek's assistive technology inventions
Hudecek's reading machines
Hudecek's radio communications company
Hudecek's software-defined radios
Living people
20th-century Australian inventors
Czech emigrants to Australia
1954 births
Members of the Order of Australia |
https://en.wikipedia.org/wiki/Follow-the-sun | Follow the Sun (FTS), a sub-field of globally distributed software engineering (GDSE), is a type of global knowledge workflow designed in order to reduce the time to market, in which the knowledge product is owned and advanced by a production site in one time zone and handed off at the end of their work day to the next production site that is several time zones west to continue that work. Ideally, the work days in these time zones overlap such that when one site ends their day, the next one starts.
FTS has the potential to significantly increase the total development time per day (as viewed from the perspective of a single time zone): with two sites the development time can increase to up to 16 hours, or up to 24 hours if there are three sites, reducing the development duration by as much as 67%.
It is not commonly practiced in industry and has few documented cases where it is applied successfully. This is likely because of its uncommon requirements, leading to a lack of knowledge on how to successfully apply FTS in practice.
History
Follow the Sun can be traced back to the mid-1990s where IBM had the first global software team which was specifically set up to take advantages of FTS. The team was spread out across five sites around the globe. Unfortunately, in this case FTS was unsuccessful because it was uncommon to hand off the software artifacts daily.
Two other cases of FTS at IBM have been documented by Treinen and Miller-Frost. The first team was spread out across a site in the United States and a site in Australia. FTS was successful for this team. The second team was spread out across a site in the United States and a site in India. In this case FTS was unsuccessful because of miscommunication, time zone issues and cultural differences.
Principles
FTS is based on the following four principles:
The main objective is the reduction of development duration / time to market.
Production sites are many time zones apart.
There is always one and only one site that owns and works on the project.
Handoffs are conducted daily at the end of each shift. The next production site is several time zones west.
Common misconceptions
An important step in defining FTS is to disambiguate it from other globally distributed configurations to clearly state what FTS is not. The following four types of similar globally distributed configurations are not FTS:
Global knowledge work is defined as geographically dispersed knowledge workers working collaboratively from multiple locations. This is not FTS because there are no handoffs.
24/7 service. In this configuration work is distributed to workers who are available at that time. It is focused on availability and the workers have little dependency, whereas FTS is focused on duration reductions and requires dependencies between the different sites in order to perform the daily handoffs.
24-hour manufacturing. This configuration focuses on making shifts fully optimize expensive resources that could not pr |
https://en.wikipedia.org/wiki/List%20of%20townships%20in%20Iowa%20by%20county | This is a list of townships in Iowa by county based on United States Geological Survey and U.S. Census data.
See: List of Iowa townships, List of counties in Iowa, List of cities in Iowa.
Adair County
Eureka
Grand River
Greenfield
Grove
Harrison
Jackson
Jefferson
Lee
Lincoln
Orient
Prussia
Richland
Summerset
Summit
Union
Walnut
Washington
Adams County
Carl
Colony
Douglas
Grant
Jasper
Lincoln
Mercer
Nodaway
Prescott
Quincy
Union
Washington
Allamakee County
Center
Fairview
Franklin
French Creek
Hanover
Iowa
Jefferson
Lafayette
Lansing
Linton
Ludlow
Makee
Paint Creek
Post
Taylor
Union City
Union Prairie
Waterloo
Appanoose County
Bellair
Caldwell
Chariton
Douglas
Franklin
Independence
Johns
Lincoln
Pleasant
Sharon
Taylor
Udell
Union
Vermillion
Walnut
Washington
Wells
Audubon County
Audubon
Cameron
Douglas
Exira
Greeley
Hamlin
Leroy
Lincoln
Melville
Oakfield
Sharon
Viola
Benton County
Benton
Big Grove
Bruce
Canton
Cedar
Eden
Eldorado
Florence
Fremont
Harrison
Homer
Iowa
Jackson
Kane
Leroy
Monroe
Polk
St. Clair
Taylor
Union
Black Hawk County
Barclay
Bennington
Big Creek
Black Hawk
Cedar
Cedar Falls
Eagle
East Waterloo
Fox
Lester
Lincoln
Mount Vernon
Orange
Poyner
Spring Creek
Union
Washington
Boone County
Amaqua
Beaver
Cass
Colfax
Des Moines
Dodge
Douglas
Garden
Grant
Harrison
Jackson
Marcy
Peoples
Pilot Mound
Union
Worth
Yell
Bremer County
Dayton
Douglas
Franklin
Frederika
Fremont
Jackson
Jefferson
Lafayette
Le Roy
Maxfield
Polk
Sumner No. 2
Warren
Washington
Buchanan County
Buffalo
Byron
Cono
Fairbank
Fremont
Hazleton
Homer
Jefferson
Liberty
Madison
Middlefield
Newton
Perry
Sumner
Washington
Westburg
Buena Vista County
Barnes
Brooke
Coon
Elk
Fairfield
Grant
Hayes
Lee
Lincoln
Maple Valley
Newell
Nokomis
Poland
Providence
Scott
Washington
Butler County
Albion
Beaver
Bennezette
Butler
Coldwater
Dayton
Fremont
Jackson
Jefferson
Madison
Monroe
Pittsford
Ripley
Shell Rock
Washington
West Point
Calhoun County
Butler
Calhoun
Cedar
Center
Elm Grove
Garfield
Greenfield
Jackson
Lake City
Lake Creek
Lincoln
Logan
Reading
Sherman
Twin Lakes
Union
Williams
Carroll County
Arcadia
Eden
Ewoldt
Glidden
Grant
Jasper
Kniest
Maple River
Newton
Pleasant Valley
Richland
Roselle
Sheridan
Union
Washington
Wheatland
Cass County
Bear Grove
Benton
Brighton
Cass
Edna
Franklin
Grant
Grove
Lincoln
Massena
Noble
Pleasant
Pymosa
Union
Victoria
Washington
Cedar County
Cass
Center
Dayton
Fairfield
Farmington
Fremont
Gower
Inland
Iowa
Linn
Massillon
Pioneer
Red Oak
Rochester
Springdale
Springfield
Sugar Creek
Cerro Gordo County
Bath
Clear Lake
Dougherty
Falls
Geneseo
Grant
Grimes
Lake
Lime Creek
Lincoln
Mason
Mount Vernon
Owen
Pleasant Valley
Portland
Union
Cherokee County
Afton
Amherst
Cedar |
https://en.wikipedia.org/wiki/The%20National%20Cyclopaedia%20of%20American%20Biography | The National Cyclopaedia of American Biography is a multi-volume collection of biographical articles and portraits of Americans, published since the 1890s. The primary method of data collection was by sending questionnaires to subjects or their relatives. It has over 60,000 entries, in 63 volumes. The entries are not credited. The overall editor was James Terry White. It is more comprehensive than the Dictionary of American Biography and the American National Biography, but less scholarly because it does not cite the original sources used for the information.
See also
Appletons' Cyclopædia of American Biography
References
External links
Hathi Trust. National Cyclopaedia of American Biography fulltext
The National Cyclopaedia of American Biography By James Terry White, online at Google Books:
Volume 2, published 1895. John Adams is in Volume 2, page 1.
Volume 3, published 1893.
Volume 4, published 1897. Ulysses S. Grant is in Volume 4, page 1.
Volume 5, published 1894.
Volume 8, published 1900.
Volume 9, published 1899.
Volume 10, published 1909. William Mason is in Vol.10, page 368.
Volume 11, published 1901.
Volume 12, published 1904.
Volume 14 (Supplement 1), published 1910.
Other volumes are accessible from The Online Books Page
United States biographical dictionaries |
https://en.wikipedia.org/wiki/Pinoy%20Records | Records () is a Philippine television infotainment show broadcast by GMA Network. Hosted by Chris Tiu and Sheena Halili, it premiered on December 8, 2007. The show concluded on July 17, 2010, with a total of 135 episodes.
Hosts
Manny Pacquiao
Chris Tiu
Sheena Halili
Jai Reyes (Face Your Fear segment host)
Bearwin Meily (Totoong Magic segment host)
Guest hosts
Rhian Ramos
Iza Calzado
Kris Bernal
Ratings
According to AGB Nielsen Philippines' Mega Manila People/Individual television ratings, the final episode of Records scored a 7.8% rating.
Accolades
References
2007 Philippine television series debuts
2010 Philippine television series endings
Filipino-language television shows
GMA Network original programming
Philippine reality television series |
https://en.wikipedia.org/wiki/Celebrity%20Rehab%20with%20Dr.%20Drew | Celebrity Rehab with Dr. Drew, later called simply Rehab with Dr. Drew, is a reality television show that aired on the cable network VH1 in which many of the episodes chronicle a group of well-known people as they are treated for alcohol and drug addiction by Dr. Drew Pinsky and his staff at the Pasadena Recovery Center in Pasadena, California. The first five seasons of the series, on which Pinsky also serves as executive producer, cast celebrities struggling with addiction, with the first season premiering on January 10, 2008, and the fifth airing in 2011.
The sixth season, which filmed in early 2012, featured non-celebrities as treatment subjects, and the series name shortened to Rehab with Dr. Drew. Season 6 premiered on September 16, 2012. In May 2013, Pinsky announced that season six was the final season, explaining that he had grown weary of the criticism leveled at him after celebrities that he treated had relapsed into addiction and died.
Recurring cast
The following are staff of the Pasadena Recovery Center (PRC), where the series is filmed. Casts for individual seasons are seen in sections for those seasons.
Dr. Drew Pinsky – Pinsky is the star of the show, and the lead specialist who treats the patients. A board-certified internist and addiction medicine specialist, he rose to fame as the host of the nationally syndicated radio talk show, Loveline. In addition to Celebrity Rehab, he also appears in its spinoffs, Sex Rehab with Dr. Drew and Sober House.
Shelly Sprague – The resident technician who runs the floor. A recovering addict herself, she has also appeared on Sex Rehab with Dr. Drew. She met Pinsky through Bob Forrest, a fellow recovering addict and colleague of Drew's with whom Sprague used to do drugs. She runs a center at Las Encinas Hospital in Pasadena, California. Pinsky observes that she becomes more personally involved with the patients than other technicians like Loesha do.
Bob Forrest – Pinsky's head counselor, who appears during group sessions. A rock musician who fronted the bands Thelonious Monster and The Bicycle Thief and a recovering addict since 1996, Forrest is the chemical dependency program director at Las Encinas Hospital, where he was hired by Pinsky.
Loesha Zeviar – A Resident Technician who first appears in the second episode of Season 2. Responding to observations that Loesha receives more abuse than Sprague, Pinsky describes her as more staid than Sprague. Pinsky has referred to her as one of the strongest staff members at the PRC.
Dr. Charles Sophy – psychiatrist and director of the Los Angeles County Department of Children and Family Services. He is also the author of Side By Side The Revolutionary Mother-Daughter Program for Conflict-Free Communication, and is the lead psychiatrist of the Celebrity Rehab and Sober House production team. Although he only appears occasionally, he was present throughout the filming of the second season of Sober House.
Sasha Kusina – A nurse at the Pasadena Recovery |
https://en.wikipedia.org/wiki/Bicycle%20Repairman | "Bicycle Repairman" is a postcyberpunk short story by American science fiction writer Bruce Sterling. It deals with the eponymous character, who lives in a functioning anarchist community in the near future and has an encounter with the misguided authorities. As is common in Sterling's stories, it deals with issues of markets, governance and the tensions between the two.
"Bicycle Repairman" was first published in Intersections in 1996. It won a Hugo Award for Best Novelette in 1997. It was reprinted in a 1999 collection of Sterling's work, A Good Old-Fashioned Future, and again in 2007 in Rewired: The Post-Cyberpunk Anthology.
References
External links
1996 short stories
Hugo Award for Best Novelette winning works
Science fiction short stories
American novellas
Short stories by Bruce Sterling |
https://en.wikipedia.org/wiki/Basel%20Action%20Network | The Basel Action Network (BAN), a charitable non-governmental organization, works to combat the export of toxic waste from technology and other products from industrialized societies to developing countries. BAN is based in Seattle, Washington, United States, with a partner office in the Philippines. BAN is named after the Basel Convention, a 1989 United Nations treaty designed to control and prevent the dumping of toxic wastes, particularly on developing countries. BAN serves as an unofficial watchdog and promoter of the Basel Convention and its decisions.
Campaigns
BAN currently runs four campaigns focusing on decreasing the amount of toxins entering the environment and protecting underdeveloped countries from serving as a toxic dump of the developed countries of the world. These include:
The e-Stewards Initiative
BAN's e-Stewards Electronics Stewardship campaign seeks to prevent toxic trade in hazardous electronic waste and includes a certification program for responsible electronics recycling known as the e-Stewards Initiative. It is available to electronics recyclers after they prove to have environmentally and socially responsible recycling techniques following audits conducted by accredited certifying bodies. Recyclers can become e-Steward certified after proving that they follow all national and international laws concerning electronic waste and its proper disposal, which includes bans on exporting, land dumping, incineration, and use of prison labor.
When the e-Stewards initiative was initially started with the Electronics TakeBack Coalition, it was called "The Electronics Recycler's Pledge of True Stewardship". In the beginning, the initiative verified a recycler's participation through "desk" and paper audits only. The e-Stewards certification, however, has been updated and requires compliance verification by a third party auditor.
Green ship recycling
BAN has teamed up with several other non-governmental organizations (NGOs), including Greenpeace to form the NGO Platform on Shipbreaking. The platform is focused on the responsible ship breaking disposal of end-of-life shipping vessels. The overall purpose of the platform is to stop the illegal dumping of toxic waste traveling from developed countries to undeveloped countries. The platform is focused on finding more sustainable, environmentally and socially responsible disposal techniques of disposing of such wastes, which can be achieved through a system where the polluter will be responsible for paying any fees associated with the legal and safe disposal of ships and other marine vessels. The NGO platform endorses the principles outlined in the Basel Convention on the Control of Transboundary Movements of Hazardous Wastes and their Disposal.
See also
Computer recycling
Electronic waste in the United States
Environmental issues in the United States
Notes
References
Metech Announces Support for BAN E-Stewards Program
USA's trashed TVs, computer monitors can make toxic mess BAN |
https://en.wikipedia.org/wiki/ProCurve%20Products | HP ProCurve was the name of the networking division of Hewlett-Packard from 1998 to 2010 and associated with the products that it sold. The name of the division was changed to HP Networking in September 2010. Please use HP Networking Products for an actual list of products.
The HP ProCurve division sold network switches, wireless access points, WAN routers, and Access Control Servers/Software under the "HP ProCurve" brand name.
Switching
Core Switches
8212zl Series - (Released September 2007) Core switch offering, 12-module slot chassis with dual fabric modules and options for dual management modules and system support modules for high availability (HA). IPV6-ready, 692 Gbit/s fabric. Up to 48 10GbE ports, 288 Gb ports, or 288 SFPs. Powered by a combination of either 875W or 1500W PSUs, to provide a maximum of 3600W (5400W using additional power supplies) of power for PoE.
Datacenter Switches
6600 Series - (Released February 2009) Datacenter switch offered in five versions. There are four switches with either 24 or 48 Gb ports, with two models featuring four 10GbE SFP ports. There is also a 24 port 10GbE version. All of these feature front to back cooling and removable power supplies.
Interconnect Fabric
8100fl series - Chassis based, 8 or 16 slot bays. Supports up to 16 10GE ports / 160 Gigabit Ethernet Ports / 160 SFPs.
Distribution/Aggregator
6200yl - Stackable switch, Layer 3, with 24 SFP transceiver ports, and the capability of 10GE ports
6400cl series - Stackable switch, Layer 3, with either CX4 10GE ports or X2 10GE ports
6108 - Stackable switch, with 6 Gb ports, and a further 2 Dual Personality Gb ports (either Gb or SFPs)
Managed edge switches
Entry level
2530, 2620 and 2540 lines are Aruba/HPE branded and included for comparison purposes only
Mainstream
2920 line is Aruba/HPE branded and included for comparison purposes only
Chassis/Advanced
Web managed switches
1800 series - Fanless 8 or 24 Gb ports. The 1800-24G also has 2 Dual Personality Ports (2 x Gb or SFP). No CLI or SNMP management.
1700 series - Fanless 7 10/100 ports plus 1 Gb or 22 10/100 ports plus 2 Gb. The 1700-24 also has 2 Dual Personality Ports (2 x Gb or SFPs). No CLI or SNMP management.
Unmanaged Switches
2300 series
2124
1400 series
408
Routing
WAN Routers
7000dl - Stackable WAN routers with modules for T1/E1, E1+G.703, ADSL2+, Serial, ISDN, and also IPsec VPN.
German company .vantronix marketed software products until 2009.
Mobility
Due to country laws, ProCurve released different versions of their wireless access points and MultiService Access points.
MultiService Mobility / Access Controllers
The MSM Access and Mobility Controllers support security, roaming and quality of service across MSM Access Points utilising 802.11 a/b/g/n wireless technology.
MSM710 - Supports up to 10 x MSM Access points. Supports up to 100 Guest Users.
MSM730 - Supports up to 40 x MSM Access points. Supports up to 500 Guest Users.
MSM750 - Suppor |
https://en.wikipedia.org/wiki/The%20Emotion%20Machine | The Emotion Machine: Commonsense Thinking, Artificial Intelligence, and the Future of the Human Mind is a 2006 book by cognitive scientist Marvin Minsky that elaborates and expands on Minsky's ideas as presented in his earlier book Society of Mind.
Minsky argues that emotions are different ways to think that our mind uses to increase our intelligence. He challenges the distinction between emotions and other kinds of thinking. His main argument is that emotions are "ways to think" for different "problem types" that exist in the world, and that the brain has rule-based mechanisms (selectors) that turn on emotions to deal with various problems. The book reviews the accomplishments of AI, why modelling an AI is difficult in terms of replicating the behaviors of humans, if and how AIs think, and in what manner they might experience struggles and pleasures.
Reviews
In a review for The Washington Post, neurologist Richard Restak states that:
Outline
Minsky outlines the book as follows:
"We are born with many mental resources."
"We learn from interacting with others."
"Emotions are different Ways to Think."
"We learn to think about our recent thoughts."
"We learn to think on multiple levels."
"We accumulate huge stores of commonsense knowledge."
"We switch among different Ways to Think."
"We find multiple ways to represent things."
"We build multiple models of ourselves."
Author's pre-publication draft
Introduction
Chapter 1. Falling in Love
Chapter 2. ATTACHMENTS AND GOALS
Chapter 3. FROM PAIN TO SUFFERING
Chapter 4. CONSCIOUSNESS
Chapter 5. LEVELS OF MENTAL ACTIVITIES
Chapter 6. COMMON SENSE
Chapter 7. Thinking.
Chapter 8. Resourcefulness.
Chapter 9. The Self.
BIBLIOGRAPHY
References
External links
Marvin Minsky at MIT
Other reviews
Science and Evolution - Books and Reviews
Technology Review
2006 non-fiction books
Books about cognition
Artificial neural networks
Artificial intelligence publications |
https://en.wikipedia.org/wiki/Christine%20Axsmith | Christine Axsmith (born 1964) is an American academic, author, lawyer who has specialized in computer security and elder law.
Axsmith was allegedly fired by BAE Systems for posting on a CIA blog that "waterboarding is torture, and torture is wrong".
Biography
Axsmith graduated from Drexel University in 1987. She then attended the Columbus School of Law at the Catholic University of America, graduating in 1990.
In 1993, Axsmith was granted a top secret security clearance by the government. She would work for the US State Department and the National Counterterrorism Center. Axsmith also worked on the United Nations Commission on International Trade Law in the Electronic Commerce Working Group.
In 2006, while working for BAE Systems as a CIA contractor, Axsmith posted on an internal top-secret CIA blog about the immorality of torture and waterboarding in particular. In July of that year, she was fired. Axsmith claims that her firing was in retribution for her posting. BAE Systems refused to answer that charge. She was also stripped of her security clearance.
In January 2007. Axsmith started practicing elder law and real estate law in the District of Columbia, continuing until July 2017.
Axsmith sits on the Fiduciary Panel for the Superior Court of the District of Columbia where she represents the elderly and disabled. Since 2017, she has been a writer for in Charlotte, North Carolina.
Publications
Axsmith has been published by the International Bar Association, the Massachusetts Institute of Technology (MIT) and the American Bar Association.
Her research is included in an annotated bibliography published by the World Bank entitled "International Initiatives Towards Harmonisation in the field of Funds Transfers, Payments, Payment Systems, and Securities Settlements."
Through her work with the American Bar Association, Axsmith was published at the Computers, Freedom and Privacy Conference at MIT.
References
1964 births
Living people
Central Intelligence Agency
BAE Systems people
American women bloggers
American bloggers
Drexel University alumni
Columbus School of Law alumni
21st-century American women lawyers
21st-century American lawyers
21st-century American women academics |
https://en.wikipedia.org/wiki/Divisia%20index | A Divisia index is a theoretical construct to create index number series for continuous-time data on prices and quantities of goods exchanged. The name comes from François Divisia who first proposed and formally analyzed the indexes in 1926, and discussed them in related 1925 and 1928 works.
The Divisia index is designed to incorporate quantity and price changes over time from subcomponents that are measured in different units, such as labor hours and equipment investment and materials purchases, and to summarize them in a time series that summarizes the changes in quantities and/or prices. The resulting index number series is unitless, like other index numbers.
In practice, economic data are not measured in continuous time. Thus, when a series is said to be a Divisia index, it usually means the series follows a procedure that makes a close analogue in discrete time periods, usually the Törnqvist index procedure or the Fisher Ideal Index procedures.
Uses
Divisia-type indices are used in these contexts for example:
Multifactor productivity calculations use quantity indexes which incorporate changes in the expenditure share and overall quality of the underlying goods, and are then multiplied by prices. A Divisia index of all measured outputs can be divided by a Divisia index of all measured inputs to get an estimate of the productivity change that occurred apart from the changes in inputs.
Aggregation of different monetary pools, e.g. cash and credit card borrowing and different currencies. Here the pools of various monetary aggregates are treated as a quantities, and the prices are usually taken as fixed, but their weights vary -- for example, the Bank of England has an index of the money stock that is available for transactions. The index weights the various money pools by the likelihood they will be used in transactions in the near run -- physical cash and checking accounts are ready to be spent, whereas long term bonds which are not ready to be spent. The interest rate received on the various money pools is a measure of the weight; pounds in cash count more than pounds in bonds. Movement of money from one form to another affects the index whereas it would not affect a simple sum of the money stock; thus the index is more useful to track the money ready-to-transact than a sum would be. Divisia monetary aggregate indexes for the United States, based on William A. Barnett's (1980) derivation, were previously available from the St. Louis Federal Reserve Bank. Those aggregates, along with newer extensions, are now available from the Center for Financial Stability in New York City.
Some price indexes incorporate changes in the quantity, expenditure share, and quality on various underlying goods as well as the changes in prices for them, although the term Divisia index is not often used in the official descriptions of consumer price indexes, producer price indexes, or personal consumption indexes. Various price indexes use the Törnqvist, Fishe |
https://en.wikipedia.org/wiki/Interpretation%20%28logic%29 | An interpretation is an assignment of meaning to the symbols of a formal language. Many formal languages used in mathematics, logic, and theoretical computer science are defined in solely syntactic terms, and as such do not have any meaning until they are given some interpretation. The general study of interpretations of formal languages is called formal semantics.
The most commonly studied formal logics are propositional logic, predicate logic and their modal analogs, and for these there are standard ways of presenting an interpretation. In these contexts an interpretation is a function that provides the extension of symbols and strings of symbols of an object language. For example, an interpretation function could take the predicate T (for "tall") and assign it the extension {a} (for "Abraham Lincoln"). Note that all our interpretation does is assign the extension {a} to the non-logical constant T, and does not make a claim about whether T is to stand for tall and 'a' for Abraham Lincoln. Nor does logical interpretation have anything to say about logical connectives like 'and', 'or' and 'not'. Though we may take these symbols to stand for certain things or concepts, this is not determined by the interpretation function.
An interpretation often (but not always) provides a way to determine the truth values of sentences in a language. If a given interpretation assigns the value True to a sentence or theory, the interpretation is called a model of that sentence or theory.
Formal languages
A formal language consists of a possibly infinite set of sentences (variously called words or formulas) built from a fixed set of letters or symbols. The inventory from which these letters are taken is called the alphabet over which the language is defined. To distinguish the strings of symbols that are in a formal language from arbitrary strings of symbols, the former are sometimes called well-formed formulæ (wff). The essential feature of a formal language is that its syntax can be defined without reference to interpretation. For example, we can determine that (P or Q) is a well-formed formula even without knowing whether it is true or false.
Example
A formal language can be defined with the
alphabet , and with a word being in if it begins with and is composed solely of the symbols and .
A possible interpretation of could assign the decimal digit '1' to and '0' to . Then would denote 101 under this interpretation of .
Logical constants
In the specific cases of propositional logic and predicate logic, the formal languages considered have alphabets that are divided into two sets: the logical symbols (logical constants) and the non-logical symbols. The idea behind this terminology is that logical symbols have the same meaning regardless of the subject matter being studied, while non-logical symbols change in meaning depending on the area of investigation.
Logical constants are always given the same meaning by every interpretation of the standard ki |
https://en.wikipedia.org/wiki/NCG | NCG may refer to:
National Centre for Geocomputation at Maynooth University, Ireland
National Co+op Grocers, an American business services cooperative
Network of Cancer Genes, a web resource
Nicaragua, ITU country code
Nicolaus-Cusanus-Gymnasium Bergisch Gladbach, a school in Bergisch Gladbach, Germany
Nicolaus-Cusanus-Gymnasium Bonn, a school in Bonn, Germany
Non-circular gear, a gear design
Noncommutative geometry, a branch of mathematics
NCG, formerly Newcastle College Group, in England
NCG Banco, S.A., Spain
Neighborhood Cinema Group, a movie theater franchise in Michigan, U.S.
Nisga'a language, ISO 639-3 language code ncg |
https://en.wikipedia.org/wiki/People%27s%20Computer%20Company | People's Computer Company (PCC) was an organization, a newsletter (the People's Computer Company Newsletter) and, later, a quasiperiodical called the Dragonsmoke. PCC was founded and produced by Dennis Allison, Bob Albrecht and George Firedrake in Menlo Park, California in the early 1970s.
The first newsletter, published in October 1972, announced itself with the following introduction:
"Computers are mostly used against people instead of for people; used to control people instead of to free them; Time to change all that - we need a... Peoples Computer Company."
It was published bimonthly. The name was chosen in reference to Janis Joplin’s rock group Big Brother and the Holding Company. The newsletter ceased publication in 1981.
History
PCC was one of the first organizations to recognize the potential of Tiny BASIC in the nascent field of personal computing when it published that language's design specification in their newsletter. This ultimately led to the design of an interpreter that was published in a publication, which they named Dr. Dobb's Journal of Tiny BASIC Calisthenics and Orthodontia, dedicated to Tiny BASIC. The newsletter's title was changed to Dr. Dobb's Journal of Computer Calisthenics & Orthodontia for the second issue; the popular reaction to it eventually led to the long-running computer magazine Dr. Dobb's Journal (DDJ) which continued publication until 2009.
PCC was among the first organizations to recognize and actively advocate playing as a legitimate way of learning. It published arguably the first best-seller in microcomputer literature, My Computer Likes Me When I Speak BASIC and What to Do After You Hit Return. The company was an early proponent of software without copyright, and published much of it in the above books, in DDJ and in another periodical. That magazine originally shared the company's name but it evolved and was later renamed Recreational Computing. It focused on publishing code listings, mostly for games, that users could hand type into their early-model (and some homebrew) personal computers. Because the code was without copyright, authors were free to study it, adapt, rewrite and build upon it. The same was true of the more systems-oriented code published in DDJ. This no-copyright practice was a significant boost to the growing body of microcomputer software and applications, and to the general base of knowledge and developing best practices in the young industry.
PCC also fostered the activities of its child organization, ComputerTown USA! That formalized PCC's long-standing activism around general computer literacy. At a time when many computers still were kept in clean rooms, PCC was taking them to libraries, grade schools and elder communities. Their activities encouraged hands-on exploration and just trying things. The Logo programming language and turtle graphics gave some users their first experience of controlling something on a computer display. Computer phobia was commonly perceived b |
https://en.wikipedia.org/wiki/Comparison%20of%20programming%20languages%20%28basic%20instructions%29 | This article compares a large number of programming languages by tabulating their data types, their expression, statement, and declaration syntax, and some common operating-system interfaces.
Conventions of this article
Generally, var, , or is how variable names or other non-literal values to be interpreted by the reader are represented. The rest is literal code. Guillemets ( and ) enclose optional sections. indicates a necessary (whitespace) indentation.
The tables are not sorted lexicographically ascending by programming language name by default, and that some languages have entries in some tables but not others.
Type identifiers
Integers
The standard constants and can be used to determine how many s and s can be usefully prefixed to and . The actual sizes of , , and are available as the constants , , and etc.
Commonly used for characters.
The ALGOL 68, C and C++ languages do not specify the exact width of the integer types , , , and (C99, C++11) , so they are implementation-dependent. In C and C++ , , and types are required to be at least 16, 32, and 64 bits wide, respectively, but can be more. The type is required to be at least as wide as and at most as wide as , and is typically the width of the word size on the processor of the machine (i.e. on a 32-bit machine it is often 32 bits wide; on 64-bit machines it is sometimes 64 bits wide). C99 and C++11 also define the exact-width types in the stdint.h header. See C syntax#Integral types for more information. In addition the types and are defined in relation to the address size to hold unsigned and signed integers sufficiently large to handle array indices and the difference between pointers.
Perl 5 does not have distinct types. Integers, floating point numbers, strings, etc. are all considered "scalars".
PHP has two arbitrary-precision libraries. The BCMath library just uses strings as datatype. The GMP library uses an internal "resource" type.
The value of is provided by the intrinsic function.
ALGOL 68G's runtime option can set precision for s to the required "number" significant digits. The standard constants and can be used to determine actual precision.
COBOL allows the specification of a required precision and will automatically select an available type capable of representing the specified precision. "", for example, would require a signed variable of four decimal digits precision. If specified as a binary field, this would select a 16-bit signed type on most platforms.
Smalltalk automatically chooses an appropriate representation for integral numbers. Typically, two representations are present, one for integers fitting the native word size minus any tag bit () and one supporting arbitrary sized integers (). Arithmetic operations support polymorphic arguments and return the result in the most appropriate compact representation.
Ada range types are checked for boundary violations at run-time (as well as at compile-time for static expressions |
https://en.wikipedia.org/wiki/Classic%20Rock%20%28Westwood%20One%29 | Classic Rock (formerly The Classic Rock Experience prior to 2011) was a 24-hour music format produced by Cumulus Media Networks (now Westwood One). It drew an adult mainstream audience between the ages of 25 and 49 with classic rock music from artists such as Aerosmith, The Allman Brothers Band, The Beatles, Phil Collins, Deep Purple, The Eagles, Jimi Hendrix, Pink Floyd, Queen, and The Rolling Stones.
The DJ line-up included Chaz Mixon, Michelle Michaels, Frank Welch, Jeff Davis, Debbie Douglas, Scott Manning, and Dave Bolt.
History
The Classic Rock Experience was first aired in 1972 by Satellite Music Network (SMN) and has since then maintained its classic rock format to this day. ABC Radio (now Cumulus Media Networks) acquired this network from SMN in 1989.
In May 2014, it was announced that the "Classic Rock" satellite format has been discontinued after the merger of Cumulus Media Networks and Westwood One.
Sample hour of programming
"Brown Sugar" - The Rolling Stones
"Money" - Pink Floyd
"We Will Rock You"/"We Are The Champions" - Queen
"Purple Haze" - The Jimi Hendrix Experience
"Slow Ride" - Foghat
"Don't Stop Believin'" - Journey
"Old Time Rock and Roll" - Bob Seger & The Silver Bullet Band
"In The Air Tonight" - Phil Collins
"Won't Get Fooled Again" - The Who
"Smoke on the Water" - Deep Purple
"Walk This Way" - Aerosmith
"Kashmir" - Led Zeppelin
Affiliates
This is a partial list.
Rock Springs, Wyoming - KSIT
Tatum, New Mexico - KTUM
Wenatchee, Washington - KZPH
References
Classic rock radio stations in the United States
Westwood One
Defunct radio networks in the United States
Former subsidiaries of The Walt Disney Company
Radio stations established in 1972
Radio stations disestablished in 2014
Defunct radio stations in the United States |
https://en.wikipedia.org/wiki/Benjamin%20Nichols | Benjamin Nichols (1920 – November 24, 2007) was a professor of electrical and computer engineering at Cornell University and mayor of Ithaca, New York. He was a member of the Democratic Socialists of America and as such was one of few Socialists elected to public office in the United States in the late 20th century.
Early life
Nichols was born on Staten Island in 1920 to a family of politically active Communist Party members. Nichols's family was active in union organizing and supporting the Republican cause in the Spanish Civil War. He enrolled at Cornell in 1937, but his studies were interrupted by his service in the United States Army during World War II. In 1946, he received his B.S. in electrical engineering, and later received an M.S. in 1949. He earned a PhD at the University of Alaska in 1956.
Professorship
He was admitted to the Cornell faculty as an assistant professor in 1949, but left temporarily to earn his Ph.D. In 1953, he became an associate professor and a full professor in 1959. Initially, his work at Cornell focused on radio waves in the ionosphere, but after he grew concerned that his studies would lead to military applications, his pacifist beliefs caused him to change his field of study to science education. In this field he developed new techniques in primary school science education.
In addition to the duties of his professorship, Nichols was very active in the administration of the University. He vocally championed the social justice vision of the University and was closely allied with the nascent Africana Studies department. He was one of the first speakers of the Cornell University Senate, a governing body during the 1970s a which included faculty, student, and employee representatives.
With Professor Michael Kelley, he published in 1989 an introductory engineering textbook entitled Introductory Linear Electrical Circuits and Electronics. He retired on July 1, 1988 as Professor Emeritus.
Mayoralty
Nichols was elected to the Ithaca Common Council in 1987, and was first elected mayor of Ithaca in 1989. He was elected to two more two-year terms, narrowly losing in his bid for a fourth term after helping to push through legislation increasing mayoral terms to four years. As mayor, Nichols was able to convince Cornell University (whose campus is tax-exempt) to increase their voluntary monetary contribution to the city in order to help pay for fire and emergency services which are normally supported only through property taxes. He also led the effort to extend domestic benefits to same-sex couples who worked for the city.
After retiring as mayor in 1995, Nichols remained active in local and Cornell affairs. He worked for the Cornell Institute for African Development and was cited for protesting the construction of a parking lot over an area of Redbud trees.
Nichols was married to Ethel Baron, who died in 1991. In 1995 he married Judith Van Allen, who survived him. He was also survived by his two childr |
https://en.wikipedia.org/wiki/Asian%20Food%20Network | The Asian Food Network (AFN), formerly known as Asian Food Channel, is a Southeast Asian pay television channel and website owned by Warner Bros. Discovery International through its Asia-Pacific division. Launched in 2005, it provides a mix of food programming content primarily focused on Asian cuisine.
History
The Asian Food Channel was co-founded by Hian Goh and Maria Brown in 2005. The idea was conceived by Goh, an investment banker, and Brown, a journalist at the BBC, in 2004 to bring a food television channel to Asia.
Content for the network was originally purchased from overseas markets and included shows such as Meat and Greet and Singapore Flavours from Mediacorp. In 2009, it launched AFC Studio at Orchard Central in Singapore. It allowed fans to purchase branded merchandise and also used for original content creation such as Great Dinners Of The World and Big Break. By 2013, the network reached 130 million viewers in 12 markets.
Scripps Networks Interactive purchased the channel in 2013. It became part of Discovery, Inc. in 2018 when Discovery acquired Scripps Networks Interactive, Six years after the acquisition of the channel by the same company that owned Food Network, the network was rebranded as the Asian Food Network in 2019, with a larger focus placed on multi-platform content.
Programming
The Asian Food Network provides a wide mix of food programming content that are sourced internationally such as the United Kingdom, the US, Canada, Europe, Australia, as well as Asian specific content from Korea, Japan, China, Philippines, Taiwan, Malaysia, Indonesia, Singapore and Thailand.
Most shows are subtitled, but English shows are sometimes subtitled in Chinese, like in SkyCable. Others don't have subtitles in English programming such as on Cignal.
Featured Chefs/Hosts
References
External links
About Asian Food Network
Channel Availability
Ngiam Ying Lan. "Asian Food Channel: For the first time – a new taste for cable TV", The Business Times, 12 August 2005. Retrieved on 3 November 2007.
Founder of AFC on ten lessons for a successful career
Food and drink television
Food Network
Warner Bros. Discovery Asia-Pacific
Warner Bros. Discovery networks
Television stations in Singapore
Television channels and stations established in 2005
Former E. W. Scripps Company subsidiaries |
https://en.wikipedia.org/wiki/Bournemouth%20to%20Birmingham%20route | The Bournemouth to Birmingham route is a part of the CrossCountry network, linking Bournemouth to Birmingham. The route consists of parts of several lines, and trains running the full length of the route are run by CrossCountry. It is also used in parts by Avanti West Coast, Chiltern Railways, Great Western Railway, South Western Railway and West Midlands Trains . After joining the Cross Country Route at Birmingham, trains proceed to Manchester, Glasgow, Edinburgh or even Aberdeen.
Railway lines in South West England
Railway lines in the West Midlands (region)
Railway lines in South East England
Railway lines in the East Midlands |
https://en.wikipedia.org/wiki/Cheboksary%20Dam | The Cheboksary Dam (, Cheboksary GES) is a hydroelectric dam on the Volga river, the latest of the Volga-Kama Cascade of dams.
Technical data
Construction started in the USSR in 1968 and mostly completed by 1986. The complex consists of power plant built in dam 548 m long, concrete spillway dam 120 m long, earth fill dams with a total length of 3355 m, and a single-chamber two-lane lock. The total water front length is 4480 m. Installed power is 1404 MW, designed average annual production is 3310 GWh, but actual annual production is 2100 GWh due to lowered reservoir level. Power house has 18 generator units with Kaplan turbines, each 78 MW at 12.4 m head. The dam forms Cheboksary Reservoir with surface area of 2182 km².
Reservoir level problem
The station began to work in 1981 with normal water level lowered to 63 m above sea level. Most of flooded land belonged to Mari El Republic. Flooded land included valuable meadows, several hundred acres ( hectares ) of oak forest that was not duly felled.
Rising normal water level to the design value of 68 m was hindered first by incomplete reservoir banks protection, then being opposed by Nizhny Novgorod Oblast and Mari El Republic. Now the station is operating at 63 m water level, with an actual installed power of 820 MW and an average annual production of 2100 GWh. Also lowered level poses difficulties to navigation on the Volga river between Nizhny Novgorod and Gorodets, with allowed draught down to 3 m, whereas it is 4 m on other parts of the Volga. Water quality in reservoir degrades because shallow waters comprise 33% of its area instead of the designed 19%. The water level problem is still being discussed.
Further water level rise will cause flood of vast areas of Nizhny Novgorod Oblast and Mari El, including most part of Nizhny Novgorod between the Oka and the Volga rivers.
See also
List of power stations in Russia
References
Dams in Russia
Hydroelectric power stations built in the Soviet Union
Hydroelectric power stations in Russia
Dams completed in 1986
Dams on the Volga River
1986 establishments in Russia
es:Embalse de Cheboksary |
https://en.wikipedia.org/wiki/Charles%20Payne%20%28television%20personality%29 | Charles V. Payne (born ) is an American Fox Business Network financial journalist and host of Fox's Making Money with Charles Payne.
Early life and education
At 17 years old, he enlisted in the United States Air Force and went on to serve as a security policeman stationed at Minot Air Force Base in Minot, North Dakota. Payne attended Minot State University and Central Texas College while in the service.
Career
Finance industry
Payne began his career on Wall Street as an analyst at E. F. Hutton in 1985. Payne is the chief executive officer and principal financial analyst of Wall Street Strategies, a stock market research firm he founded in 1991.
In 1999, Payne settled with the SEC over a complaint alleging that on at least eight occasions, Wall Street Strategies recommended that its clients purchase members stock through recorded messages on its telephonic stock recommendation service. The complaint also alleged that Payne failed to disclose that he received payments from members to promote members stock. Without admitting or denying the alleged violations, Payne consented to the entry of a permanent injunction against violations of Section 17(b) of the Securities Act of 1933. In addition, Payne agreed to pay a civil penalty of $25,000.
In 2007, Payne released his first book titled Be Smart, Act Fast, Get Rich: Your Game Plan for Getting It Right in the Stock Market. He has made several appearances on C-SPAN.
Fox Business
In 2007, Payne joined Fox Business as a contributor. In 2014, he became the host of Making Money with Charles Payne.
In June 2019, Payne claimed, "When President Obama was elected, the market crashed … Trump was up 9%, President Obama was down 14.8% and President Bush was down almost 4%. There is an instant reaction on Wall Street." PolitiFact described the claim as "mostly false", noting that while the numbers put forth are correct experts dismiss the causal claims put forth by Payne, and instead attribute the market crash to broader economic forces and long-term trends.
Rape accusation
In July 2017, Payne was suspended by Fox Business pending an investigation after a former network guest, Scottie Nell Hughes, accused him of rape. Payne denied the charge, but acknowledged having had a three-year-long "romantic relationship" with Hughes before the accusation was made. Hughes, who kept an apartment near Fox's Manhattan headquarters for the duration of the affair, claimed she believed it would help her obtain a permanent position at the network. Her appearances were drastically reduced after she ended the affair in 2015 and reported Payne to Fox. On , Payne's suspension was lifted.
Personal life
Payne is a resident of Teaneck, New Jersey. He is married to Yvonne Payne.
See also
Black conservatism in the United States
References
External links
1960 births
African-American journalists
American chief executives
American company founders
American financial commentators
American male journalists
Central Texas College al |
https://en.wikipedia.org/wiki/Range%20tree | In computer science, a range tree is an ordered tree data structure to hold a list of points. It allows all points within a given range to be reported efficiently, and is typically used in two or higher dimensions. Range trees were introduced by Jon Louis Bentley in 1979. Similar data structures were discovered independently by Lueker, Lee and Wong, and Willard.
The range tree is an alternative to the k-d tree. Compared to k-d trees, range trees offer faster query times of (in Big O notation) but worse storage of , where n is the number of points stored in the tree, d is the dimension of each point and k is the number of points reported by a given query.
Bernard Chazelle improved this to query time and space complexity .
Data structure
A range tree on a set of 1-dimensional points is a balanced binary search tree on those points. The points stored in the tree are stored in the leaves of the tree; each internal node stores the largest value of its left subtree.
A range tree on a set of points in d-dimensions is a recursively defined multi-level binary search tree. Each level of the data structure is a binary search tree on one of the d-dimensions.
The first level is a binary search tree on the first of the d-coordinates. Each vertex v of this tree contains an associated structure that is a (d−1)-dimensional range tree on the last (d−1)-coordinates of the points stored in the subtree of v.
Operations
Construction
A 1-dimensional range tree on a set of n points is a binary search tree, which can be constructed in time. Range trees in higher dimensions are constructed recursively by constructing a balanced binary search tree on the first coordinate of the points, and then, for each vertex v in this tree, constructing a (d−1)-dimensional range tree on the points contained in the subtree of v. Constructing a range tree this way would require time.
This construction time can be improved for 2-dimensional range trees to .
Let S be a set of n 2-dimensional points. If S contains only one point, return a leaf containing that point. Otherwise, construct the associated structure of S, a 1-dimensional range tree on the y-coordinates of the points in S. Let xm be the median x-coordinate of the points. Let SL be the set of points with x-coordinate less than or equal to xm and let SR be the set of points with x-coordinate greater than xm. Recursively construct vL, a 2-dimensional range tree on SL, and vR, a 2-dimensional range tree on SR. Create a vertex v with left-child vL and right-child vR.
If we sort the points by their y-coordinates at the start of the algorithm, and maintain this ordering when splitting the points by their x-coordinate, we can construct the associated structures of each subtree in linear time.
This reduces the time to construct a 2-dimensional range tree to , and also reduces the time to construct a d-dimensional range tree to .
Range queries
A range query on a range tree reports the set of points that lie inside a given in |
https://en.wikipedia.org/wiki/Working%20set%20size | In computing, working set size is the amount of memory needed to compute the answer to a problem. In any computing scenario, but especially high performance computing where mistakes can be costly, this is a significant design-criteria for a given super computer system in order to ensure that the system performs as expected.
When a program/algorithm computes the answer to a problem, it uses a set of data (input and intermediate data) to complete the work. For any given instance of the problem, the program has one such data set, which is called the working set. The Working Set Size (WSS) is the size of this data set.
The significance of this is that if the Working Set Size is larger than the available memory in a virtual memory system then the memory manager must refer to the next level in the memory hierarchy (usually hard disk) to perform a swap operation swapping some memory contents from RAM to hard disk to enable the program to continue working on the problem. If this swapping goes on continuously the program is slowed significantly. This phenomenon is known as thrashing.
References
Computer memory |
https://en.wikipedia.org/wiki/EFMI | EFMI may refer to:
Escape from Monkey Island, a computer adventure game developed and released by LucasArts in 2000
Mikkeli Airport (ICAO airport code: EFMI) in Mikkeli, Finland
European Federation for Medical Informatics |
https://en.wikipedia.org/wiki/Sieve%20of%20Sundaram | In mathematics, the sieve of Sundaram is a variant of the sieve of Eratosthenes, a simple deterministic algorithm for finding all the prime numbers up to a specified integer. It was discovered by Indian student S. P. Sundaram in 1934.
Algorithm
Start with a list of the integers from 1 to n. From this list, remove all numbers of the form where:
The remaining numbers are doubled and incremented by one, giving a list of the odd prime numbers (i.e., all primes except 2) below .
The sieve of Sundaram sieves out the composite numbers just as the sieve of Eratosthenes does, but even numbers are not considered; the work of "crossing out" the multiples of 2 is done by the final double-and-increment step. Whenever Eratosthenes' method would cross out k different multiples of a prime , Sundaram's method crosses out for .
Correctness
If we start with integers from to , the final list contains only odd integers from to . From this final list, some odd integers have been excluded; we must show these are precisely the composite odd integers less than .
Let be an odd integer of the form . Then, is excluded if and only if is of the form , that is . Then we have:
So, an odd integer is excluded from the final list if and only if it has a factorization of the form — which is to say, if it has a non-trivial odd factor. Therefore the list must be composed of exactly the set of odd prime numbers less than or equal to .
def sieve_of_Sundaram(n):
"""The sieve of Sundaram is a simple deterministic algorithm for finding all the prime numbers up to a specified integer."""
k = (n - 2) // 2
integers_list = [True] * (k + 1)
for i in range(1, k + 1):
j = i
while i + j + 2 * i * j <= k:
integers_list[i + j + 2 * i * j] = False
j += 1
if n > 2:
print(2, end=' ')
for i in range(1, k + 1):
if integers_list[i]:
print(2 * i + 1, end=' ')
Asymptotic Complexity
The above obscure but as commonly implemented Python version of the Sieve of Sundaram hides the true complexity of the algorithm due to the following reasons:
The range for the outer i looping variable is much too large, resulting in redundant looping that can't perform any composite number representation culling; the proper range is to the array index represent odd numbers less than the square root of the range.
The code doesn't properly account for indexing of Python arrays, which are zero index based so that it ignores the values at the bottom and top of the array; this is a minor issue, but serves to show that the algorithm behind the code has not been clearly understood.
The inner culling loop (the j loop) exactly reflects the way the algorithm is formulated, but seemingly without realizing that the indexed culling starts at exactly the index representing the square of the base odd number and that the indexing using multiplication can much more easily be expressed as a simple repeated addition of the base odd |
https://en.wikipedia.org/wiki/TV%20Brasil | TV Brasil is a Brazilian public television network owned by Empresa Brasil de Comunicação. Its main headquarters are in Brasília, DF and Rio de Janeiro, RJ, with owned-and-operated stations in São Paulo, SP and in São Luís, MA, as well as 21 states where its affiliated broadcasters operate, all components of the Rede Pública de Televisão.
History
TV Brasil originated from a decree which created Empresa Brasil de Comunicação, the network's maintainer, published on 24 December 2007 in the Diário Oficial da União, Brazil's official gazette. It was generated from the fusion of Empresa Brasileira de Comunicação - Radiobrás and Associação de Comunicação Educativa Roquette Pinto, responsible for the maintenance of the now defunct TVE Brasil - which was replaced by TV Brasil in several cities. The lack of equipment restricted TV Brasil's launching to only three cities (Rio de Janeiro, Brasília and São Luís). Its programming, however, is also available through its official website and cable and satellite television.
After winning the presidential elections in 2022, president Lula has announced plans to refurbish TV Brasil and turn it into "the Brazilian BBC"
Programming
TV Brasil affiliated stations broadcast four hours a day of regional programing. It also broadcast Brazilian films and programs made by other public television channels. The programming of is divided into five daily streams: children, animation, audio-visual, citizenry and sports.
Franklin Martins, Secretary of Social Communication, has commented that TV Brasil's programming is not yet fully prepared and may suffer from late changes. Martins also said he wished to use public opinion polls to determine the programming.
Stations
Among self-owned and affiliated stations, TV Brasil reaches over 30 municipalities throughout all regions of Brazil. On the rest of the country, TV Brasil's availability is limited to satellite and cable television. Its live programming can also be watched on the network's official website.
References
External links
Empresa Brasil de Comunicação
Mass media in Rio de Janeiro (city)
Television channels and stations established in 2007
Brazilian companies established in 2007
Publicly funded broadcasters |
https://en.wikipedia.org/wiki/Kikokugai%3A%20The%20Cyber%20Slayer | is a Japanese cyberpunk visual novel by Nitroplus. It's Nitroplus' third game, and the script is written by Gen Urobuchi.
The game was remade in 2011 with enhanced graphics, a new theme song, and character voices added.
The 2011 version is also rated for ages 15 and up instead of the original game's 18+ rating.
Plot
Kikokugai takes place in Shanghai, in a dystopian future of organized crime and cyborg assassins.
References
External links
Kikokugai: The Cyber Slayer's official website
2002 video games
Video games set in Shanghai
Cyberpunk video games
Japan-exclusive video games
Nitroplus
Video games developed in Japan
Visual novels
Windows games
Windows-only games
Dystopian video games |
https://en.wikipedia.org/wiki/Blacker%20%28security%29 | Blacker (styled BLACKER) is a U.S. Department of Defense computer network security project designed to achieve A1 class ratings (very high assurance) of the Trusted Computer System Evaluation Criteria (TCSEC).
The first Blacker program began in the late 1970s, with a follow-on eventually producing fielded devices in the late 1980s.
It was the first secure system with trusted end-to-end encryption on the United States' Defense Data Network.
The project was implemented by SDC (software) and Burroughs (hardware), and after their merger, by the resultant company Unisys.
See also
RED/BLACK concept for segregation of sensitive plaintext information (RED signals) from encrypted ciphertext (BLACK signals)
References
Computer network security
Computer security standards
Cryptography
Secure communication
Security engineering
Trusted computing
United States Department of Defense information technology |
https://en.wikipedia.org/wiki/Podar%20Group%20of%20Schools | Podar Education Network is a network of schools in India, managed by the Anandilal Podar Trust of Mumbai. The trust was established in 1927 by a Mumbai-based businessman Sheth Anandilal Podar. , the group had 116 schools across India. It was awarded the status of International Baccalaureate World School in 2005, and in 2011 was CIS (Council of International Schools) certified.
Locations
The schools are located in following cities of India.
Bihar
Gaya
Samastipur
Muzaffarpur
Chhattisgarh
Raipur
Gujarat
5 Podar World School
20 Podar International School
List of Podar World School in Gujarat:
List of Podar International School in Gujarat :
Karnataka
Belgaum
Bengaluru, Chikka Kodigehalli
Bengaluru, Off Bannerghatta Road
Bengaluru.Horamavu Kalkere
Davangere
Hassan
Mysore
Shimoga
Tumkur
Udupi
Madhya Pradesh
Chhindwara
Gwalior
Indore
Indore 2
Khandwa
Ratlam
Ujjain
Bhopal
Maharashtra
Ahmednagar
Akola
Ambegaon
Amravati
Aurangabad, Shahnoorwadi
Aurangabad, Garkhedha
Baramati
Beed
Bhandara
Bhusawal
Chakan
Chalisgaon
Chinchwad
Chandrapur
Dhule
Gondia
Hingoli
Jalgaon
Jalna
Kalyan
Karad
Kolhapur
Latur
Nagpur, Besa
Nagpur, Katol
Nagpur, Koradi
Nanded
Nandurbar
Nashik
Nerul, Palm Beach Road, Navi
Wardha
Talegaon
Mumbai
Nerul, Seawoods, Navi Mumbai
Osmanabad
Parbhani
Pimpri
Santacruz, Linking Road, Mumbai
Santacruz, Saraswati Road, Mumbai
Santacruz, Jain Derasar Marg, Mumbai
Podar World College, Santacruz, Juhu Tara Road, Mumbai
Powai, Mumbai
Sangli
Satara
Shirur
Solapur
Thane
Wagholi
Worli
Yavatmal
Daund
Punjab
Patiala
Ludhiana
See also
Podar World School
Podar International School
References
External links
Podar International School on CIS website
Podar International School on IBO site
Podar International School website
Private schools in Karnataka
1927 establishments in India
Educational institutions established in 1927
High schools and secondary schools in Karnataka
Private schools in Punjab, India
Private schools in Maharashtra
Private schools in Madhya Pradesh
Private schools in Gujarat
Private schools in Chhattisgarh
Private schools in Bihar |
https://en.wikipedia.org/wiki/Dev-Pascal | Dev-Pascal is a free integrated development environment (IDE) distributed under the GNU General Public License for programming in Pascal and Object Pascal. It supports an ancient version of the Free Pascal compiler and GNU Pascal as backends. The IDE is written in Delphi. It can also handle the Insight Debugger. Dev-Pascal runs on Microsoft Windows.
See also
Lazarus (IDE)
Dev-C++
Comparison of integrated development environments
External links
The Dev-Pascal development and resources page
Free software programmed in Delphi
Windows-only free software
Free integrated development environments
Free Pascal
Pascal (programming language) software |
https://en.wikipedia.org/wiki/Real-time%20Programming%20Language | Real-time Programming Language (RPL) is a compiled database programming language used on CMC/Microdata/McDonnell Douglas REALITY databases, derived and expanded from the PROC procedure language, with much extra functionality added. It was originally developed under the name "PORC" by John Timmons and Paul Desjardins in about 1975. "PORC" was then further developed by Tim Holland under the employ of George Ridgway's company Systems Management, Inc. (SMI) in Chicago. A number of large scale manufacturing applications were developed in RPL, including that which was in use at Plessey and GEC-Plessey Telecommunications limited in Liverpool and also the Trifid suite of manufacturing software.
Sources
RPL 1.3 Reference Manual (PDF)
"Software House Puts Emphasis on Nitty-Gritty", 10 Sep 1979.
Programming languages |
https://en.wikipedia.org/wiki/Channel%20%28programming%29 | In computing, a channel is a model for interprocess communication and synchronization via message passing. A message may be sent over a channel, and another process or thread is able to receive messages sent over a channel it has a reference to, as a stream. Different implementations of channels may be buffered or not, and either synchronous or asynchronous.
libthread channels
The multithreading library, libthread, which was first created for the operating system Plan 9, offers inter-thread communication based on fixed-size channels.
OCaml events
The OCaml event module offers typed channels for synchronization. When the module's send and receive functions are called, they create corresponding send and receive events which can be synchronized.
Examples
Lua Love2D
The Love2D library which is part of the Lua programming language implements channels with push and pop operations similar to stacks. The pop operation will block so as long as there is data resident on the stack. A demand operation is equivalent to pop, except it will block until there is data on the stack-- A string containing code which will be interpreted by a function such as loadstring(),
-- but on the C side to start a native thread.
local threadCode = [[
love.thread.getChannel("test"):push("Hello world!")
]]
function love.load()
-- Start the thread.
thread = love.thread.newThread(threadCode)
thread:start()
-- The thread will block until "Hello world!" is popped off channel test's stack.
-- Because the channel can be popped from before the thread first executes, there may not be data on the stack.
-- in that case use :demand() instead of :pop() because :demand() will block until there is data on the stack and then return the data.
print(love.thread.getChannel("test"):demand())
-- The thread can now finish.
end
XMOS XC
The XMOS programming language XC provides a primitive type "chan" and two operators "<:" and ":>" for sending and receiving data from a channel.
In this example, two hardware threads are started on the XMOS, running the two lines in the "par" block. The first line transmits the number 42 through the channel while the second waits until it is received and sets the value of x. The XC language also allows asynchronous receiving on channels through a select statement.
chan c;
int x;
par {
c <: 42;
c :> x;
}
Go
This snippet of Go code performs similarly to the XC code. First the channel c is created, then a goroutine is spawned which sends 42 through the channel. When the number is put in the channel x is set to 42. Go allows channels to buffer contents, as well as non blocking receiving through the use of a select block.
c := make(chan int)
go func() {c <- 42}()
x := <- c
Rust
Rust provides asynchronous channels for communication between threads. Channels allow a unidirectional flow of information between two end-points: the Sender and the Receiver.
use std::sync::mpsc;
use std::thread;
fn ma |
https://en.wikipedia.org/wiki/Incredibuild | Incredibuild is a suite of grid computing software developed by Incredibuild LTD. Incredibuild is designed to help accelerate computationally-intensive tasks by distributing them over the network, with notable applications including compiling source code, building software generally, and other software developmentrelated tasks. Jobs can be distributed to several computers over a network, giving both the possibility of accelerating the work by using more resources than were available on the initiating computer alone and potentially freeing local resources for other tasks.
Incredibuild tools are available for Microsoft Windows and Linux, and have support for accelerating builds targeting those platforms. Other platforms include but are not limited to Android, Nintendo Switch, PlayStation 4, Xbox One, and other platforms. Originally sold specifically as a tool to accelerate compiling, Incredibuild can now be used for other development processes as well as general high performance computing.
History
Incredibuild is a grid computing software start-up based in Tel Aviv, in Israel. Founded in 2002, the company is led by CEO Tami Mazel Shachar.
In 2002, they introduced Incredibuild v1.0, offering a solution for acceleration of Microsoft Visual Studio 6.0 C/C++ code builds. Incredibuild 1.3 was awarded with Game Developer Magazine's annual Front Line Award in The Category of Programing for the year of 2003.
After adding support to Visual Studio .NET and Visual Studio 2005, Incredibuild later expanded Incredibuild with what was at the time called "XGE Interfaces". This package allowed customers to implement custom acceleration of jobs that were not necessarily compilation-related, by exposing a set of interfaces to Incredibuild's core grid engine technology.
In 2008, Incredibuild won a "Productivity Award" in the Change and Configuration Management Category Of The 18th annual Jolt Awards.
Tools
Incredibuild's software suite is broken up into several, separately-licensable tools. Incredibuild for Visual Studio C/C++ provides Visual Studio integration to accelerate the builds of C and C++ projects. Incredibuild for Make and Other Build Tools provides integration with several standard build tools including make, CMake, and MSBuild. Incredibuild for Dev Tools provides additional interfaces for job distribution, accommodating various tasks beyond those directly related to building or compiling.
Notable users
Incredibuild is used by several software development companies, including a number of video game developers. In 2021, the gaming sector made up 60% of Incredibuild's business. Turn 10 Studios, for instance, used Incredibuild to accelerate builds, rendering from 3DS Max, code analysis, and other tasks during the development of Forza 5. Incredibuild also claims Epic Games, Electronic Arts, id Software, Bohemia Interactive, Scaleform Corporation, FromSoftware, and Bugbear Entertainment as clients. CryEngine and Unreal Engine include built-in support |
https://en.wikipedia.org/wiki/Crissy%20Criss | Chris Williamson (born 6 May 1987), better known by his stage name Crissy Criss, is a British DJ, radio producer and presenter, who was part of the BBC Radio network BBC Radio 1Xtra. He has also worked under the moniker Dead Exit.
Crissy Criss is the stepson of Kenny Ken and was born in Newmarket, Suffolk and raised in Leytonstone.
Career
The youngest DJ/Presenter at present to broadcast on BBC Radio 1Xtra. Introduced to a set of decks aged five by his stepfather Kenny Ken, he then started to teach himself to mix aged nine. The following year, Crissy covered for Kenny Ken at a festival in Essex. At age 11 he joined drum & bass pirate station, Kool FM, and played his first club set at The End in London, thanks to DJ Zinc who requested Crissy to play. Crissy has played at major drum & bass nights across the UK and elsewhere such as New York, Toronto, Norway, Switzerland, France, and Germany. Crissy started production work from the age of 12, making music on a gaming console then moved up to much larger programmes and hardware equipment. He released his first track on Back2Basics recordings in 2004. Since then Crissy has signed to Back2Basics Records and Mix 'n' Blen Records. In 2019 he released his debut album.
He presented a regular show on BBC 1Xtra from 2007, which was axed as part of the station's budget cuts in June 2014; An online petition was launched to save the show.
References
External links
BBC 1Xtra D&B Show with Crissy Criss updated tracklistings and downloads
British DJs
British radio personalities
British radio DJs
1987 births
Living people
BBC Radio 1Xtra presenters
People from Newmarket, Suffolk |
https://en.wikipedia.org/wiki/Old%20Elm%20GO%20Station | Old Elm GO Station (formerly Lincolnville) is a train and bus station in the GO Transit network located in Whitchurch-Stouffville, Ontario, Canada. Old Elm is the northeastern terminus of train service on the Stouffville line. The original station opened on September 2, 2008 on the north side of Bethesda Road, adjacent to the GO train storage yard. Old Elm was rebuilt further south on the west side of Tenth Line, and opened on October 17, 2023.
Station name
The station was referred to by the provisional name of Stouffville North before adopting the Lincolnville name partway through construction. Historically, Lincolnville is the name of a hamlet which was located at the corner of Bloomington Road and Highway 47 (Old Concession 10 Road), divided between the townships of Uxbridge to the east and Whitchurch to the west. On October 16, 2021, the station was renamed Old Elm GO after an elm tree on the premises of the future station site.
Description
The station has a bus loop and a passenger pick-up and drop-off area. There is parking for 673 vehicles including 15 accessibility stalls and 4 stalls for scooters and motorbikes. There are also 35 bike racks. The accessible platform features heated shelters, a platform canopy, and a platform snow-melting system. The station entrances for buses and motor vehicles are signalized.
History
Lincolnville station opened on September 2, 2008 at Bethesda Road, after some delay; it had initially been projected to open the preceding June. It was built to relieve the line's previous terminus, Stouffville GO Station, which is located in Stouffville proper; it could not expand its parking and had limited bus interchange capabilities. Constructed next to the existing Stouffville layover facility at 10th Line and Bethesda Road, Lincolnville station cost $5.5million and extended passenger service approximately farther from Union Station in Toronto. The station's park-and-ride catchment includes much of the municipality of Uxbridge, and it is seen as a precursor to eventual GO Train service to the townsite of Uxbridge proper. From 2010 to 2011, 410 additional parking spots were built, along with a bus storage facility and crew centre. The adjacent layover facility was completed in October 2019.
In 2021, construction began to relocate the station to the south. The new station would include a parking lot with 672 spaces, a bike lane, a bus loop, and improved accessibility. The new station opened on October 17, 2023.
Bus connections
70–71 GO Bus: Northbound to Goodwood and Uxbridge and southbound to Union Station.
There is no local York Region Transit bus service.
See also
Uxbridge railway station (Ontario)
References
External links
GO Transit railway stations
Buildings and structures in Whitchurch-Stouffville
Transport in Whitchurch-Stouffville
Railway stations in the Regional Municipality of York
Railway stations in Canada opened in 2008
2008 establishments in Ontario |
https://en.wikipedia.org/wiki/Canopy%20clustering%20algorithm | The canopy clustering algorithm is an unsupervised pre-clustering algorithm introduced by Andrew McCallum, Kamal Nigam and Lyle Ungar in 2000. It is often used as preprocessing step for the K-means algorithm or the Hierarchical clustering algorithm. It is intended to speed up clustering operations on large data sets, where using another algorithm directly may be impractical due to the size of the data set.
Description
The algorithm proceeds as follows, using two thresholds (the loose distance) and (the tight distance), where .
Begin with the set of data points to be clustered.
Remove a point from the set, beginning a new 'canopy' containing this point.
For each point left in the set, assign it to the new canopy if its distance to the first point of the canopy is less than the loose distance .
If the distance of the point is additionally less than the tight distance , remove it from the original set.
Repeat from step 2 until there are no more data points in the set to cluster.
These relatively cheaply clustered canopies can be sub-clustered using a more expensive but accurate algorithm.
An important note is that individual data points may be part of several canopies. As an additional speed-up, an approximate and fast distance metric can be used for 3, where a more accurate and slow distance metric can be used for step 4.
Applicability
Since the algorithm uses distance functions and requires the specification of distance thresholds, its applicability for high-dimensional data is limited by the curse of dimensionality. Only when a cheap and approximative – low-dimensional – distance function is available, the produced canopies will preserve the clusters produced by K-means.
Its benefits include:
The number of instances of training data that must be compared at each step is reduced.
There is some evidence that the resulting clusters are improved.
References
Cluster analysis algorithms |
https://en.wikipedia.org/wiki/Standards%20of%20Fundamental%20Astronomy | The Standards of Fundamental Astronomy (SOFA) software libraries are a collection of subroutines that implement official International Astronomical Union (IAU) algorithms for astronomical computations.
As of February 2009 they are available in both Fortran and C source code format.
Capabilities
The subroutines in the libraries cover the following areas:
Calendars
Time scales
Earth's rotation and sidereal time
Ephemerides (limited precision)
Precession, nutation, polar motion
Proper motion
Star catalog conversions
Astrometric transformations
Galactic Coordinates
Licensing
As of the February 2009 release, SOFA licensing changed to allow use for any purpose, provided certain requirements are met. Previously, commercial usage was specifically excluded and required written agreement of the SOFA board.
See also
Naval Observatory Vector Astrometry Subroutines
References
External links
SOFA Home Page
Scholarpedia overview of SOFA
International Astronomical Union and Working group "Standards of Fundamental Astronomy
Celestial mechanics
Astronomical coordinate systems
Numerical software
Astronomy software |
https://en.wikipedia.org/wiki/David%20Brody%20%28journalist%29 | David Philip Brody is an American commentator for the Christian Broadcasting Network. Brody is also known for his vocal support of Donald Trump
Brody was born in New Jersey on February 13, 1965, and grew up in New York City. He was raised Reform Jewish, with his sister Karen Rachel but he notes neither of his parents were very religious. He converted to Evangelical Christianity in his 20s.
Brody graduated from Ithaca College (Ithaca, NY) in 1987 with a Bachelor of Science degree in communications. He was News Director at ABC affiliate KRDO-TV, Colorado Springs, Colorado.
David Brody is married to Lisette Dorianne Bassett-Brody. Together, they have three children; Andrew, Aaron, and Elina Brody.
Brody wrote the 2012 book The Teavangelicals: The Inside Story of How the Evangelicals and the Tea Party are Taking Back America. Brody co-authored the book The Faith of Donald J. Trump: A Spiritual Biography, with Scott Lamb of The Washington Times, and it was published in early 2018.
References
External links
The Brody File Blog
Biography on Christian Broadcasting Network website
American television reporters and correspondents
Emmy Award winners
Living people
1965 births
American bloggers
Ithaca College alumni
Converts to evangelical Christianity
American evangelicals
21st-century American non-fiction writers |
https://en.wikipedia.org/wiki/List%20of%20American%20films%20of%201903 | A list of American films released in 1903.
See also
1903 in the United States
References
External links
1903 films at the Internet Movie Database
1903
Films
American
1900s in American cinema |
https://en.wikipedia.org/wiki/List%20of%20American%20films%20of%201904 | A list of American films released in 1904.
See also
1904 in the United States
External links
1904 films at the Internet Movie Database
1904
Films
American
1900s in American cinema |
https://en.wikipedia.org/wiki/Rademacher%20complexity | In computational learning theory (machine learning and theory of computation), Rademacher complexity, named after Hans Rademacher, measures richness of a class of real-valued functions with respect to a probability distribution.
Definitions
Rademacher complexity of a set
Given a set , the Rademacher complexity of A is defined as follows:
where are independent random variables drawn from the Rademacher distribution i.e. for , and . Some authors take the absolute value of the sum before taking the supremum, but if is symmetric this makes no difference.
Rademacher complexity of a function class
Let be a sample of points and consider a function class of real-valued functions over . Then, the empirical Rademacher complexity of given is defined as:
This can also be written using the previous definition:
where denotes function composition, i.e.:
Let be a probability distribution over .
The Rademacher complexity of the function class with respect to for sample size is:
where the above expectation is taken over an identically independently distributed (i.i.d.) sample generated according to .
Intuition
The Rademacher complexity is typically applied on a function class of models that are used for classification, with the goal of measuring their ability to classify points drawn from a probability space under arbitrary labellings. When the function class is rich enough, it contains functions that can appropriately adapt for each arrangement of labels, simulated by the random draw of under the expectation, so that this quantity in the sum is maximised.
Examples
1. contains a single vector, e.g., . Then:
The same is true for every singleton hypothesis class.
2. contains two vectors, e.g., . Then:
Using the Rademacher complexity
The Rademacher complexity can be used to derive data-dependent upper-bounds on the learnability of function classes. Intuitively, a function-class with smaller Rademacher complexity is easier to learn.
Bounding the representativeness
In machine learning, it is desired to have a training set that represents the true distribution of some sample data . This can be quantified using the notion of representativeness. Denote by the probability distribution from which the samples are drawn. Denote by the set of hypotheses (potential classifiers) and denote by the corresponding set of error functions, i.e., for every hypothesis , there is a function , that maps each training sample (features,label) to the error of the classifier (note in this case hypothesis and classifier are used interchangeably). For example, in the case that represents a binary classifier, the error function is a 0–1 loss function, i.e. the error function returns 1 if correctly classifies a sample and 0 else. We omit the index and write instead of when the underlying hypothesis is irrelevant. Define:
– the expected error of some error function on the real distribution ;
– the estimated error of some error function on the samp |
https://en.wikipedia.org/wiki/LML | LML may refer to:
Lazy ML, a programming language
Lightweight markup language in computing
Lifecycle Modeling Language, in systems engineering
Lohia Machinery Limited, scooter company
L.M.L. (album), a music album by group Nu Virgos |
https://en.wikipedia.org/wiki/Oracle%20Net%20Services | In the field of database computing, Oracle Net Services consists of sets of software which enable client applications to establish and maintain network sessions with Oracle Database servers. Since Oracle databases operate in and across a variety of software and hardware environments, Oracle Corporation supplies high-level transparent networking facilities with the intention of providing networking functionality regardless of differences in nodes and protocols.
Terminology
network service name (NSN): "[a] simple name for a service that resolves to a connect descriptor" For example: sales.acme.co.uk
Components
Oracle Corporation defines Oracle Net Services as comprising:
Oracle net
listener
Oracle Connection Manager
Oracle Net Configuration assistant
Oracle Net Manager
Oracle Net
Oracle Net,
a proprietary networking stack, runs both on client devices and on Oracle database servers in order to set up and maintain connections and messaging between client applications and servers. Oracle Net (formerly called "SQL*Net" or "Net8") comprises two software components:
Oracle Net Foundation Layer: makes and maintains connection sessions. The Oracle Net Foundation Layer establishes and also maintains the connection between the client application and server. It must reside on both the client and server for peer-to-peer communication to occur.
Oracle Protocol Support: interfaces with underlying networking protocols such as TCP/IP, named pipes, or Sockets Direct Protocol (SDP).
The listener
The listener process(es) on a server detect incoming requests from clients for connection - by default on port 1521 - and manage network-traffic once clients have connected to an Oracle database. The listener uses a configuration-file - listener.ora - to help keep track of names, protocols, services and hosts. The listener.ora file can include three sorts of parameters:
listener-address entries
SID_LIST entries
control entries
Apart from pre-defined and known statically-registered databases, a listener can also accept dynamic service registration from a database.
Oracle Connection Manager
The Oracle Connection Manager (CMAN) acts as a lightweight router for Oracle Net packets.
Oracle Net Manager
Oracle Net Manager, a GUI tool, configures Oracle Net Services for an Oracle home on a local client or server host. (Prior to Oracle 9i known as "Net8 Assistant".)
Associated software
Utilities and tools
tnsping: determines the accessibility of an Oracle net service.
Software suites
Oracle software integrating closely with and/or depending on Oracle Net Services includes:
Oracle Clusterware
Oracle Data Guard
Oracle Enterprise Manager
Oracle Internet Directory
Oracle RAC (real application clusters)
Oracle Streams
See also
Transparent Network Substrate (TNS)
References
Arun Kumar, John Kanagaraj and Richard Stroupe: Oracle Database 10g Insider Solutions. Sams, 2005.
External links
"Oracle Network Configuration"
Footnotes
Oracle s |
https://en.wikipedia.org/wiki/Facebook%20Beacon | Beacon formed part of Facebook's advertisement system that sent data from external websites to Facebook, for the purpose of allowing targeted advertisements and allowing users to share their activities with their friends. Beacon reported to Facebook on Facebook's members' activities on third-party sites that also participated with Beacon. These activities were published in users' News Feed. This occurred even when users were not connected to Facebook, and happened without the knowledge of the Facebook user. The service was controversial and became the target of a class-action lawsuit, resulting in it shutting down in September 2009. One of the main concerns was that Beacon did not give the user the option to block the information from being sent to Facebook. Beacon was launched on November 6, 2007, with 44 partner websites. Mark Zuckerberg, CEO of Facebook, characterized Beacon on the Facebook Blog in November 2011 as a "mistake." Although Beacon was unsuccessful, it did pave the way for Facebook Connect, which has become widely popular.
Privacy concerns and litigation
Beacon created considerable controversy soon after it was launched, due to privacy concerns. On November 20, 2007, civic action group MoveOn.org created a Facebook group and online petition demanding that Facebook not publish their activity from other websites without explicit permission from the user. In fewer than ten days, this group gained 50,000 members. After the class-action lawsuit, Lane v. Facebook, Inc., Beacon was changed to require that any actions transmitted to the website would have to be approved by the Facebook user before being published. On November 29, 2007, Stefan Berteau, a security researcher for Computer Associates, published a note on his tests of the Beacon system. He found that data was still being collected and sent to Facebook despite users' opt-outs and not being logged in to Facebook at the time. This revelation was in direct contradiction to the statements made by Chamath Palihapitiya, Facebook's vice president of marketing and operations, in an interview with The New York Times published the same day:
Q. If I buy tickets on Fandango, and decline to publish the purchase to my friends on Facebook, does Facebook still receive the information about my purchase?
A. "Absolutely not. One of the things we are still trying to do is dispel a lot of misinformation that is being propagated unnecessarily."
On November 30, 2007, Louise Story of The New York Times blogged that not only had she received the impression that Beacon would be an explicit opt-in program, but that Coca-Cola had also had a similar impression, and as a result, had chosen to withdraw their participation in Beacon.
On December 5, 2007, Facebook announced that it would allow people to opt-out of Beacon. Founder Mark Zuckerberg apologized for the controversy.
This has been the philosophy behind our recent changes. Last week we changed Beacon to be an opt-in system, and today we're relea |
https://en.wikipedia.org/wiki/Habang%20Kapiling%20Ka | (International title: With You / ) is a Philippine television drama romance series broadcast by GMA Network. Directed by Maryo J. de los Reyes, it stars Angelika dela Cruz. It premiered on November 4, 2002 on the network's Telebabad line up replacing Ikaw Lang ang Mamahalin. The series concluded on October 17, 2003 with a total of 248 episodes. It was replaced by Twin Hearts in its timeslot.
Cast and characters
Lead cast
Angelika dela Cruz as Erica Malvarosa
Victor Neri as Julius Javellana
Supporting cast
Albert Martinez as Alejandro Javellana
Snooky Serna as Olivia Malvarosa
Tonton Gutierrez as Marius Malvarosa / Xandro / Kenji Ogata
Richard Gutierrez as Basilio Malvarosa
Chynna Ortaleza as Donna Javellana-Capistrano
Toni Gonzaga as Emillie Capistrano-Bravo
Railey Valeroso as Pierre Paolo Capistrano-Bravo
Chin Chin Gutierrez as Helga Lamermoore
Ruffa Gutierrez as Venus Paraiso
Alma Moreno as Salve Capistrano
Zoren Legaspi as Jonas Capistrano
Amy Perez as Divine Ogata
Yul Servo as Nonoy Bautista
Jaime Fabregas as Fausto Bravo
Aleck Bovick as Liway
Tootsie Guevara as Bunny Bravo
Guest cast
Divine Tetay
Patricia Ismael
Long Mejia as Badong
Jake Roxas as Ludwig
Hans Montenegro as Lino
Nonie Buencamino as Javier
Camille Roxas as Medea
Andrea del Rosario as Nanette
Lloyd Samartino as Milton
Sheree Bautista as Magnolia
Rosette Cancino as young Emilie
Cheng Luciano as young Erika
Johnjohn Castro as young Julius
Lorenzo Hemulgada as young Pierre Paolo
Kitchie Nadal as Kimmie
Manny Pacquiao as himself
Jinkee Pacquiao as herself
Accolades
References
External links
2002 Philippine television series debuts
2003 Philippine television series endings
Filipino-language television shows
GMA Network drama series
Philippine romance television series
Television shows set in the Philippines |
https://en.wikipedia.org/wiki/T%C3%A9l%C3%A9toon%20R%C3%A9tro | Télétoon Rétro was a Canadian French language Category B specialty television channel that was owned by Corus Entertainment. The channel was based on the former Télétoon programming block Télétoon Retro and was dedicated to broadcasting French-dubbed animated series that had premiered on television at least 10 years prior to their airing on Télétoon Retro. Along with its English language sister station, Teletoon Retro, combined, both were available in over 9 million Canadian households as of 2013, having the most subscribers among the digital Canadian specialty channels.
History
Télétoon Rétro initially started as a programming block on Télétoon. On November 24, 2000, TELETOON Canada Inc. (at the time, an equal joint venture between Corus Entertainment and Astral Media) was granted approval by the Canadian Radio-television and Telecommunications Commission (CRTC) to launch TELETOON RETRO, described at the time as "a national Category 2 specialty television service with English- and French-language feeds. The service shall present classic cartoons from Canada and around the world, including animated movies, specials, series and shorts which commenced production at least ten (10) years prior to their exhibition by the licensee." The channel did not commence operation and the licence expired.
Plans to launch the channel arose again in 2005, when on October 21, TELETOON Canada Inc. was given approval again to launch TELETOON Rétro, this time as a singular French channel with no English language feed.
The channel was launched on September 4, 2008 as Télétoon Rétro, promoted with select programs airing on Télétoon on Saturday and Sunday nights at 7:00pm EST. An English-language counterpart, Teletoon Retro, had already been on the air since October 1, 2007.
Along with Teletoon Retro, Télétoon Rétro rebranded on February 4, 2013. On March 4, 2013, Corus Entertainment announced that it would acquire Astral Media's 50% ownership interest in TELETOON Canada Inc. The purchase was in relation to Bell Media's pending takeover of Astral, which had earlier been rejected by the CRTC in October 2012, but was restructured to allow the sale of certain Astral Media properties in order to allow the purchase to clear regulatory hurdles. Corus' purchase was cleared by the Competition Bureau two weeks later on March 18. On December 20, 2013, the CRTC approved Corus' full ownership of TELETOON Canada Inc. and it was purchased by Corus on January 1, 2014.
On March 24, 2014, Télétoon Rétro launched Télétoon Rétro HD, a high definition simulcast of the standard definition feed.
On April 16, 2015, Corus Entertainment announced that it had acquired long-term, Canadian multi-platform rights to Disney Channel's programming library; the cost and duration of the licensing deal were not disclosed. Alongside the licensing deal, Corus announced that it would officially launch a Canadian version of Disney Channel; the service will consist of linear television channels in English |
https://en.wikipedia.org/wiki/Internet%20Protocol%20Options | There are a number of optional parameters that may be present in an Internet Protocol version 4 datagram. They typically configure a number of behaviors such as for the method to be used during source routing, some control and probing facilities and a number of experimental features.
Loose source routing
Loose Source Routing is an IP option which can be used for address translation. LSR is also used to implement mobility in IP networks.
Loose source routing uses a source routing option in IP to record the set of routers a packet must visit. The destination of the packet is replaced with the next router the packet must visit. By setting the forwarding agent (FA) to one of the routers that the packet must visit, LSR is equivalent to tunneling. If the corresponding node stores the LSR options and reverses it, it is equivalent to the functionality in mobile IPv6.
The name loose source routing comes from the fact that only part of the path is set in advance.
Strict source routing
Strict source routing is in contrast with loose source routing, in which every step of the route is decided in advance where the packet is sent.
Restrictions and considerations
The following two options are discouraged because they create security concerns: Loose Source and Record Route (LSRR) and Strict Source and Record Route (SSRR). Many routers block packets containing these options.
See also
Dynamic Source Routing
Source routing
Internet Protocol
References
Routing
Internet architecture
Network protocols |
https://en.wikipedia.org/wiki/Morecambe%20%26%20Wise%3A%20Greatest%20Moments | Morecambe & Wise: Greatest Moments was a compilation programme originally aired on 2 December 2007 on the UKTV network channel UKTV Gold and featured clips, interviews and home move footage, culminating in the showing of the "best" sketch from their programmes. It featured contributions from several of their guest stars such as Cliff Richard, Edward Woodward, Bruce Forsyth, Francis Matthews, Michele Dotrice and Elton John whom Eric always referred to as "Elephant John" as well as interviews with both Joan Morecambe and Doreen Wise, the latter's first appearance on a show of this kind. There were also chats with writer Eddie Braben, co-star Ann Hamilton and fans Armstrong & Miller among others. The show was narrated by Liza Tarbuck, daughter of comedian Jimmy Tarbuck and gave the following as the choice of "best" sketches from to duo:
Antony & Cleopatra (With Glenda Jackson)
Singin' In The Rain Routine
"The Stripper" Breakfast Routine
Greig's Piano Concert (With André Previn)
"Exactly Like You" (With Tom Jones)
The show highlighted the high regard in which the pair are still held by the viewing public and their peers despite having last worked together in 1983 and many of the guest stars featured now being largely unknown to the youth of the twenty-first century. Their appeal had further been secured by the release of their first three series of BBC shows and the associated Christmas Specials on DVD earlier in the year. Also, as part of the anniversary celebrations for BAFTA earlier in the year, contemporary comedians Armstrong & Miller has recreated their famous making the breakfast scene, re-igniting interest in them.
References
British television sketch shows
Morecambe and Wise |
https://en.wikipedia.org/wiki/Professor%20Poopsnagle%27s%20Steam%20Zeppelin | Professor Poopsnagle's Steam Zeppelin (aka Professor Poopsnaggle and His Flying Zeppelin) was a popular Australian children's television series which aired on the Nine Network, a spin-off from the 1980 series Secret Valley. It was first aired in 1986 in Australia and also later in Switzerland (TSI) and Finland (1987), Spain (1989, TVE), Greece (1989, ERT), Netherlands (1989, KRO), France (1989, FR3) and Vietnam (1996, VTV3). In contrast to Secret Valley, which was a commercial failure in the United Kingdom when screened there in 1985, Professor Poopsnagle's Steam Zeppelin was hugely successful in the UK, where it was first broadcast in 1987 on the ITV network, and proved so popular that it was also later repeated on Channel 4 in both 1990 and 1998. The series still has a strong cult following in the United Kingdom today.
The overall story is divided into 6 parts, each for a particular quest, with 4 episodes each. Some TV channels, such as ITV Anglia, therefore showed the series as TV movies of 90 minutes each. In this form the story is slightly abridged, cutting a few scenes that are present in cut for a half-hour slot.
Summary
Professor Poopsnagle, the holder of a vital scientific secret, has been abducted and his mysterious disappearance jeopardizes the world of science. His young grandson, who assists him in his research, secures the help of Professor Garcia, a long-standing colleague and friend of the scientist.
Assisted by a group of children, spending their holidays in the Secret Valley Camp, Professor Garcia and the young boy build a flying bus. They set off in pursuit of the kidnappers and attempt, at the same time, to complete Poopsnagle's unfinished work. They are helped in their quest by a document that Garcia and the children gradually manage to decipher.
But alas, there is a traitor in their midst passing information to the evil kidnappers of Professor Poopsnagle: Count Sator and his accomplice. However, against all odds, and throughout countless and often irresistibly amusing adventures, Professor Garcia and his young group of friends finally win the day.
Time after time, the children show great courage and skill. Matt, the traitor, sees the error of his ways and they all live happily ever after.<ref name="Prospectus">{{cite book | title=Text from Professor Poopsnagle's Steam Zeppelin : Prospectus (1986) / Revcom/Grundy Organization}}</ref>
Part 1: The stranger arrives
Dr. Jose Calandre Garcia had been working on the theory of Mega- steam when he lost contact with his old friend Professor Poopsnagle. Determined to continue the work that Poopsnagle had originally begun, Garcia traveled to Australia in a hot air balloon in search of his old friend. Unbeknown to him, however, the wicked Count Sator had discovered his plan and sent his henchman Murk to shoot down the hot air balloon. Murk shot down the balloon, but the old doctor survived the crash and was rescued by some young children from a holiday camp in Secret Valley. When t |
https://en.wikipedia.org/wiki/Fokko%20du%20Cloux | Fokko du Cloux (20 December 1954, Rheden – 10 November 2006) was a Dutch mathematician and computer scientist. He worked on the Atlas of Lie groups and representations until his death.
Career in mathematics
Du Cloux was based at the Institut Girard Desargues, Université Claude Bernard Lyon 1, Villeurbanne, in France. One of the founding members of the project, he was responsible for building the Atlas software which was instrumental in the mapping of the structure of the E8 Lie group. Fokko du Cloux was diagnosed with Amyotrophic lateral sclerosis (ALS) in 2005, but he continued to actively participate in the project until his death from ALS. The Project successfully completed the task in 2007, a few months after du Cloux's death.
References
Cloux
1954 births
2006 deaths
Dutch expatriates in France
Deaths from motor neuron disease
Neurological disease deaths in the Netherlands
Cloux
20th-century Dutch mathematicians
20th-century Dutch scientists
21st-century Dutch scientists |
https://en.wikipedia.org/wiki/ZIZ | ZIZ Broadcasting Corporation commonly referred to as ZIZ, is the government-owned radio and (now cable-only) television service of Saint Kitts and Nevis. Its radio programming is broadcast on 555 AM, 95.9 & 96.1 FM, whilst the TV station formerly aired on channel 5 in St. Kitts and Channel 6 in Nevis.
External links
Official site of ZIZ
Official site of ZIZ TV
References
Communications in Saint Kitts and Nevis
Radio stations in the Caribbean
Television stations in the Caribbean
1961 establishments in Saint Kitts and Nevis
Radio stations established in 1961
Television in Saint Kitts and Nevis |
https://en.wikipedia.org/wiki/Cons%20%28disambiguation%29 | cons is a fundamental function in all dialects of the Lisp programming language.
Cons or CONS may also refer to:
Science and technology
Connection-Oriented Network Service, one of the two OSI network layer protocols
CONS, a build automation Make replacement, written in Perl, succeeded by SCons
Coagulase negative staphylococci (CoNS), a group of round bacteria lacking the enzyme coagulase
Other uses
Converse (shoe company), an American shoe manufacturer
Emma Cons (1838–1912), British social reformer, socialist, educationalist and theatre manager
See also
Con (disambiguation) |
https://en.wikipedia.org/wiki/Hard%20Disk%2020 | The Macintosh Hard Disk 20 was the first hard drive developed by Apple Computer specifically for use with the Macintosh 512K. Introduced on September 17, 1985, it was part of Apple's solution toward completing the Macintosh Office (a suite of integrated business hardware & software) announced in January 1985. It would be over a year more before Apple would release the file server software AppleShare that would link all of the hardware together. By that time the SCSI interface introduced on the Macintosh Plus in January 1986, would accommodate far faster and more efficient hard drives, rendering the Hard Disk 20 virtually obsolete.
Features
The Hard Disk 20 (or HD20, as it was known colloquially) contains a 20 MB 3.5" Rodime hard disk which provides over 50 times the data storage of the stock 400 kB disk drive. At the time when the average file size was around 10-20 kB and due to the vast number of those files the HD20 can contain, Apple's original Macintosh File System, which does not allow for directories, made organizing those files unwieldy. Therefore, Apple introduced it with a new System and Finder update which include the Hierarchical File System allowing the user to better organize files on such a large volume. As a result, only the Macintosh 512K can access it; the original Macintosh 128K does not have enough RAM to load the new file system. In fact, even for the Macintosh 512K to use the drive, it requires an additional file in the System Folder on a special startup disk which adds additional code into memory during startup. A startup routine also allows the Mac to check for the presence of a System file on the Hard Disk, switch over to it and eject the startup disk. The HD20 cannot be used as a startup disk directly without first loading the code from the floppy disk drive. With the release of the Macintosh Plus and the Macintosh 512Ke, both containing the upgraded 128 kB ROM which contains the additional code, the HD20 can finally be used alone as a startup disk.
While other hard drives were available on the market, Apple's HD20 was generally preferred because it uses the high-speed floppy disk port, whereas third-party drives use the lower-speed Serial Port. While the floppy port was not initially supposed to be used this way, making creative use of the port allows the HD20 to achieve much higher transfer rates than products limited to the serial ports. With few exceptions, this along with complete compatibility with the new Hierarchical File System, gave Apple an instant edge over the competition. In addition, the HD20 has a convenient "zero-footprint" design which fit precisely underneath the Macintosh, merely elevating it 3 inches, but otherwise taking up no more desk-space.
Specifications
Recording Surfaces: 2
Per Drive: 20.7 MB (formatted)
No. of Cylinders: 610
Total No. of Tracks: 1220
No. of Sector/Track: 32
Bytes/Sector: 532 (formatted)
Total No. of Blocks (Data): 38,964
Spare Blocks: 76
Access Time: Track to Trac |
https://en.wikipedia.org/wiki/List%20of%20New%20Zealand%20state%20highways | This is a list of highways of the New Zealand state highway network and some touring routes. State highways are administered by Waka Kotahi, while all other roads are the responsibility of territorial authorities.
Current
North Island
South Island
Past
The following state highways have been decommissioned. After revocation these routes have reverted to their original names (e.g. Crown Range Road), are referred to by their old route number (e.g. Route 72), or have been given white shields.
Unused numbers
The following numbers have never been used:
North Island: SH 13, SH 19, SH 42, SH 55
South Island: SH 9, SH 64, SH 66, SH 68, SH 81
See also
List of roads and highways, for notable or famous roads worldwide
References
List
State Highways |
https://en.wikipedia.org/wiki/Black%20Lamp%20%28video%20game%29 | Black Lamp is a platform game, originally published by Firebird Software for the Amiga, Atari ST, Commodore 64 and ZX Spectrum computers in 1988, and later published by Atari Corporation for the Atari 8-bit family in 1989.
The Atari ST version was included in the Atari ST Power Pack, a collection of 20 games which came with some editions of the computer system.
Plot
The game casts the player as Jack The Jester, in the fictional kingdom of Allegoria.
According to the story, Jack has fallen in love with the Princess Grizelda, but knows the king would never allow his daughter to marry a lowly court jester.
Unless, of course, he were to perform some kind of noble and heroic act.
That chance comes for Jack the day a gang of dragons attack the kingdom, stealing the magical black lamp which protects the kingdom from harm.
Without the lamp's protection the kingdom is soon overrun by monsters, so Jack sets off to recover the black lamp, save the kingdom, and hopefully win the hand of the fair princess.
Gameplay
The game is viewed from the side-on perspective typical of platform games. Jack, under the player's control, has to run, jump, climb and shoot his way through the kingdom of Allegoria in search of nine different coloured lamps, while under constant assault by all manner of creatures.
Eight of the nine lamps may be found randomly scattered around the kingdom (in locations which change with each new game), but the ninth lamp, the black lamp, is guarded by a dragon which must be defeated before the lamp can be recovered.
Each lamp must be returned to one of several lamp racks in the kingdom. As the player can only carry a single lamp at a time, this can mean a lot of traveling back and forth. Once all the lamps have been returned to the rack, the level is complete, and the player advances to the next level.
The game takes place across a series of static and scrolling rooms, which are connected by doorways leading into the foreground or background, as well as up down, left and right.
Several items can be picked up to assist the player
Food replenishes the player's health
Collecting 5 weapons gives the player temporarily increased firepower.
Collecting 5 musical instruments temporarily allows the player to fall from heights without being hurt.
Collecting 5 jewels gives the player temporary invincibility.
Controlling Jack can be difficult, as unlike many more modern platform games like Mario or Sonic where the character responds immediately to joystick input, Black Lamp moves the player in set increments of distance, so if the player starts walking in one direction, Jack cannot stop or turn around until he has taken a full step in that direction.
Music
In the Atari ST and Amiga versions of Black Lamp, the title screen music is a version of Elizabethan Serenade by Ronald Binge, while the in-game music is a rendition of the English folk song Greensleeves. In the ZX Spectrum and C64 versions, the title screen music is an original piece by Tim F |
https://en.wikipedia.org/wiki/REDIAL | REDIAL (Red Europea de Información y Documentación sobre América Latina), the European Network of Information and Documentation on Latin America, is an association formed by libraries and documentation centres in 12 European countries: France, Germany, Netherlands, Russia, United Kingdom, Spain, and Sweden. REDIAL is a meeting platform aiming at contributing to the development of communication and support between institutions, and the exchange of information between researchers, librarians and archivists working in the areas of Latin American humanities and social sciences in Europe. REDIAL is a non-profit European association, regulated by the Spanish legislation. Its organizational structure is formed by an Executive Committee of national coordinators who are elected by the member institution of each European country and a Members General Assembly.
Publications
Blog: REDIAL & CEISAL Portal Americanista Europeo. Updated information on Latin American research institutions activities and publications in Europe.
Academic Journal: Anuario Americanista Europeo, published 2003–2014(in collaboration with CEISAL). Information on research and projects of Latin Americanists in Europe.
History
In 1988, invited by the CNRS (Centre Nationale de la Recherche Scientifique) in France, researchers and other European centres for information and research on Latin America organized the symposium "Information Systems in Europe for Latin American Social Sciences and Humanities: balance for a European cooperation" as part of the 46th International Congress of Americanists in Amsterdam. During the symposium, participants agreed to create a European network which would share a collective instrument of work and documentation for the interchange of information about Latin America produced in Europe.
The "European Meeting" which took place in Madrid on 6 and 7 March 1989 took a step further in the formalization of the suggestions and ideas discussed in the Amsterdam symposium. The 35 European institutions that participated in the event put forward a plan of action to be implemented by an international association. This association would be responsible for the continuity of the work and development of the objectives initiated in these two previous meetings. A provisory Executive coordinator was appointed on the occasion who became responsible for writing a draft version of the organization's statute.
The constituent assembly of REDIAL took place in France on 30 November 1 and 2 December 1989 having as founding members 35 European institutions which specialized in Latin America – research and documentation centres, libraries and NGOs – from Austria, Belgium, France, Germany, Netherlands, Spain and UK.
External links
REDIAL & CEISAL Portal Americanista Europeo
Databases in Europe
American studies
International organisations based in Spain
Geographic region-oriented digital libraries
Scientific databases |
https://en.wikipedia.org/wiki/Fiber%20to%20the%20premises%20in%20the%20United%20States | Fiber to the premises in the United States are primarily covered by Google Fiber, Verizon, and Lightower.
By company
Open-access networks
Several carriers, municipalities, and planned communities across America are deploying their own fiber networks. Open Access Networks differ from incumbent models by being horizontally integrated, which allows for multiple service providers to operate on one network and promotes market competition. Among them is the City of Burlington, Vermont "Burlington Telecom" and Lafayette, Louisiana.
The city of San Francisco, California has released a feasibility study for government and public broadband via fiber optics. This was the result of San Francisco supervisors' vote to adopt a resolution to encourage certain city departments to consider installing FTTP for use primarily in city operations. This then evolved into the fiber feasibility study which also includes "services to businesses and residents." The study estimated build-out costs of $564 million. It has been released as a draft in order for members of the public to provide comments and input.
Service providers using Active FTTP technologies include YRT2 Inc.; PAXIO Inc.; SureWest; iProvo; Grant County, Washington; UTOPIA; CDE Lighband, Clarksville, TN and Broadweave Networks. Service providers using passive optical networks include Verizon (FiOS), AT&T (U-verse), and several greenfield development networks.
There is also another FTTH provider UTOPIA, based in Salt Lake County, Utah, which currently services 11 cities. This municipal fiber network is an open network to many local ISPs, including Xmission, Sumo, and Veracity, and other service providers who have bought onto the network. The speeds of the network range around 100 Mbit/s to 1 Gbit/s for residential use and 20 Mbit/s to 10 Gbit/s for business use.
Hargray Communications—Hilton Head Island, SC—Savannah, GA to Beaufort, SC—offers metro e - symmetrical data (up to 1g over 1g) 50x5
EPB Fiber Optics provides a GPON network that offers fiber to the premise to Chattanooga, TN and some neighboring cities. They offer 1Gig internet service, which is the fastest speed available in the nation, as well as TV and phone service.
In 2008, Greenlight was introduced in Wilson, North Carolina, which created the system at a cost of $28 million. The reason was the lack of interest in fiber optic from private companies.
With job losses, a major problem in Salisbury, North Carolina, the concept of municipal broadband was studied beginning in 2005. City council members looked at Wilson's system as an example of what Salisbury could do to help the economy. Also, Internet access in the city was slow.
Municipal power provider, CDE Lightband in Clarksville, TN launched their 1 Gig service in 2013 via an active FTTP plant. They also offer digital television and phone services.
State laws and litigation
Fibrant in Salisbury, North Carolina was one of 60 municipal networks located across the country. The city b |
https://en.wikipedia.org/wiki/Screen%20space%20ambient%20occlusion | Screen space ambient occlusion (SSAO) is a computer graphics technique for efficiently approximating the ambient occlusion effect in real time. It was developed by Vladimir Kajalin while working at Crytek and was used for the first time in 2007 by the video game Crysis, also developed by Crytek.
Implementation
The algorithm is implemented as a pixel shader, analyzing the scene depth buffer which is stored in a texture. For every pixel on the screen, the pixel shader samples the depth values around the current pixel and tries to compute the amount of occlusion from each of the sampled points. In its simplest implementation, the occlusion factor depends only on the depth difference between sampled point and current point.
Without additional smart solutions, such a brute force method would require about 200 texture reads per pixel for good visual quality. This is not acceptable for real-time rendering on current graphics hardware. In order to get high quality results with far fewer reads, sampling is performed using a randomly rotated kernel. The kernel orientation is repeated every N screen pixels in order to have only high-frequency noise in the final picture. In the end this high frequency noise is greatly removed by a NxN post-process blurring step taking into account depth discontinuities (using methods such as comparing adjacent normals and depths). Such a solution allows a reduction in the number of depth samples per pixel to about 16 or fewer while maintaining a high quality result, and allows the use of SSAO in soft real-time applications like computer games.
Compared to other ambient occlusion solutions, SSAO has the following advantages:
Independent from scene complexity.
No data pre-processing needed, no loading time and no memory allocations in system memory.
Works with dynamic scenes.
Works in the same consistent way for every pixel on the screen.
No CPU usage – it can be executed completely on the GPU.
May be easily integrated into any modern graphics pipeline.
SSAO also has the following disadvantages:
Rather local and in many cases view-dependent, as it is dependent on adjacent texel depths which may be generated by any geometry whatsoever.
Hard to correctly smooth/blur out the noise without interfering with depth discontinuities, such as object edges (the occlusion should not "bleed" onto objects).
See also
Screen space directional occlusion (SSDO)
References
External links
Finding Next Gen – CryEngine 2
Video showing SSAO in action
Image Enhancement by Unsharp Masking the Depth Buffer
Hardware Accelerated Ambient Occlusion Techniques on GPUs
Overview on Screen Space Ambient Occlusion Techniques
Real-Time Depth Buffer Based Ambient Occlusion
Source code of SSAO shader used in Crysis
Approximating Dynamic Global Illumination in Image Space
Accumulative Screen Space Ambient Occlusion
NVIDIA has integrated SSAO into drivers
Several methods of SSAO are described in ShaderX7 book
SSAO Shader ( Russian )
SS |
https://en.wikipedia.org/wiki/Occupational%20Information%20Network | The Occupational Information Network (O*NET) is a free online database that contains hundreds of job definitions to help students, job seekers, businesses and workforce development professionals to understand today's world of work in the United States. It was developed under the sponsorship of the US Department of Labor/Employment and Training Administration (USDOL/ETA) through a grant to the North Carolina Employment Security Commission (now part of the NC Commerce Department) during the 1990s. John L. Holland's vocational model, often referred to as the Holland Codes, is used in the "Interests" section of the O*NET.
History
From 1938 to the 1990s, vocational lists and employment matching offered by the U.S. government were available through the book, The Dictionary of Occupational Titles or the DOT. The DOT was first published in 1938 and "emerged in an industrial economy and emphasized blue-collar jobs. Updated periodically, the DOT provided useful occupational information for many years. But its usefulness waned as the economy shifted toward information and services and away from heavy industry." With the shift in the economy, plans developed to replace the book format of the DOT with an online database. A limited use, preliminary version was released in December 1997, followed by a public edition in December 1998. The O*NET thus, "supersedes the seventy-year-old Dictionary of Occupational Titles with current information that can be accessed online or through a variety of public and private sector career and labor market information systems." The decision to move from the DOT to O*NET, "remains controversial (e.g., Gibson, Harvey, & Harris, 2007; Harvey, 2009; Harvey & Hollander, 2002), even as we approach the 20-year anniversary of its inception (e.g., APDOT, 1992). Many applied psychologists have praised O*NET (e.g., Peterson, Mumford, Borman, Jeanneret, Fleishman, Levin, Campion, Mayfield, Morgeson, Pearlman, Gowing, Lancaster, Silver, & Dye, 2001)."
O*NET classifies jobs in job families (functional areas which include workers from entry level to advanced, and may include several sub-specialties). After the third major revision of O*NET realigned all O*NET occupations to conform to the newly mandated Standard Occupational Classification (SOC)), O*NET, with less than 1,000 listed occupational categories, compares to over 13,000 occupations in the last published DOT.
Overview
The O*NET system varies from the DOT in a number of ways. It is a digital database which offers a "flexible system, allowing users to reconfigure data to meet their needs" as opposed to the "fixed format" of the DOT; it reflects the employment needs of an Information society rather than an Industrial society; costs the government and users much less than a printed book would,
and is easier to update as new data is collected. The US Department of Labor/Employment and Training Administration (USDOL/ETA) describes the O*NET as: "a database of occupational requirem |
https://en.wikipedia.org/wiki/Embarcadero%20Technologies | Embarcadero Technologies, Inc. is an American computer software company that develops, manufactures, licenses and supports products and services related to software through several product divisions. It was founded in 1993, went public in 2000 and private in 2007, and became a division of Idera, Inc. in 2015.
History
Embarcadero was founded in October 1993 by Stephen Wong, Stuart Browning, and Nigel Myers and released a tool for Sybase database administrators in December of the same year called Rapid SQL. it later added tools for software development on Microsoft Windows and other operating systems, and for database design, development and management, for platforms including Oracle, Microsoft SQL Server, IBM DB2, and MySQL.
In April 2000, Embarcadero Technologies had its initial public offering, and was listed on NASDAQ with the symbol EMBT.
In November the same year, the company acquired GDPro, a Unified Modeling Language software provider. In October 2005 Embarcadero acquired data security business Ambeo. In June 2007, Thoma Cressey Bravo bought Embarcadero, and it became a private company. Wayne Williams was appointed chief executive officer of Embarcadero Technologies in 2007.
On May 7, 2008 Borland Software Corporation announced its software development tools division, CodeGear, was to be sold to Embarcadero Technologies for an expected $23 million price and $7 million in CodeGear accounts receivables retained by Borland. The acquisition closed on June 30, 2008, for approximately $24.5 million.
In December 2011, Embarcadero announced AppWave, an enterprise app store for PCs running Microsoft Windows instead of mobile phones. The platform supports Embarcadero software, commercial titles, and free and open source apps. In April 2012 the platform was moved to a web site called AppWave Store.
The corporate headquarters is located in Austin, Texas, with an international office located in Brazil. the company had an annual revenue of $100 million, and around 500 employees on its payroll.
In 2014 Embarcadero Technologies nearly acquired the CA ERwin Data Modeler product from CA, Inc. This acquisition was blocked by the Department of Justice over anti-competitive concerns.
On October 7, 2015, Idera, Inc. announced an agreement to acquire Embarcadero Technologies, Inc., but the Embarcadero mark was retained for the developer tools division. As of October 28, 2015, Embarcadero was listed as 'acquired'.
Products
Database products
Until 2015, Embarcadero sold products like Rapid SQL and DB Artisan, and ER/Studio, and these products are now sold by its parent company directly, Idera.
Interbase, a lightweight database for desktop and mobile app development, remained an Embarcadero product in 2016.
Application development
In July 2008 Embarcadero acquired CodeGear from the Borland Software Corporation.
Codegear owned a number of application development products, and some that were still developed in 2016 were:
Delphi is a rapid application |
https://en.wikipedia.org/wiki/Power%20system%20simulator%20for%20engineering | Power System Simulator for Engineering (PSS®E—often written as PSS/E) is a software tool used by power system engineers to simulate electrical power transmission networks in steady-state conditions as well as over timescales of a few seconds to tens of seconds.
Since its introduction in 1976, it has evolved from a simple command-line interface, to an integrated, interactive program for simulating, analyzing, and optimizing power system performance, and it can provide probabilistic and dynamic modeling features.
References
Siemens PSS®E homepage
Simulation software
Electric power transmission systems
Siemens software products |
https://en.wikipedia.org/wiki/SSAO | SSAO may refer to:
Screen space ambient occlusion, an implementation of an ambient occlusion illumination in computer graphics
Semicarbazide-sensitive amine oxidase, an enzyme |
https://en.wikipedia.org/wiki/Dryad%20%28programming%29 | Dryad was a research project at Microsoft Research for a general purpose runtime for execution of data parallel applications.
The research prototypes of the Dryad and DryadLINQ data-parallel processing frameworks are available in source form at GitHub.
Overview
Microsoft made several preview releases of this technology available as add-ons to Windows HPC Server 2008 R2.
An application written for Dryad is modeled as a directed acyclic graph (DAG). The DAG defines the dataflow of the application, and the vertices of the graph defines the operations that are to be performed on the data. The "computational vertices" are written using sequential constructs, devoid of any concurrency or mutual exclusion semantics. The Dryad runtime parallelizes the dataflow graph by distributing the computational vertices across various execution engines (which can be multiple processor cores on the same computer or different physical computers connected by a network, as in a cluster). Scheduling of the computational vertices on the available hardware is handled by the Dryad runtime, without any explicit intervention by the developer of the application or administrator of the network. The flow of data between one computational vertex to another is implemented by using communication "channels" between the vertices, which in physical implementation is realized by TCP/IP streams, shared memory or temporary files. A stream is used at runtime to transport a finite number of structured Items.
Dryad defines a domain-specific language, which is implemented via a C++ library, that is used to create and model a Dryad execution graph. Computational vertices are written using standard C++ constructs. To make them accessible to the Dryad runtime, they must be encapsulated in a class that inherits from the GraphNode base class. The graph is defined by adding edges; edges are added by using a composition operator (defined by Dryad) that connects two graphs (or two nodes of a graph) with an edge. Managed code wrappers for the Dryad API can also be written.
There exist several high-level language compilers which use Dryad as a runtime; examples include Scope (Structured Computations Optimized for Parallel Execution) and DryadLINQ.
In October 2011, Microsoft discontinued active development on Dryad, shifting focus to the Apache Hadoop framework.
References
Further reading
External links
Dryad: Programming the Data Center
Dryad Home
Video of Michael Isard explaining Dryad at Google
Concurrent programming libraries
Distributed computing architecture
Microsoft free software
Microsoft Research
Software using the Apache license
Windows-only free software |
https://en.wikipedia.org/wiki/Income%20deficit | Income deficit is the difference between a single person or family's income and its poverty threshold or poverty line, when the former is exceeded by the latter. Data on the income deficits of various members of a population allow for the construction of one type of measurement of income inequality in that population. Individuals or families that fall below the line are considered to be in poverty whereas families that fall above are not. The income deficit is one of two measures that are used to determine a person or family's income distance from the poverty threshold, the other being a ratio rather than a difference.
The net income deficit consists largely of income payments and receipts on capital, as well as cross-border labour income (compensation of employees). Given the relatively small level of net cross-border labor income payments, there are two key drivers of the net income deficit: the level of net foreign liabilities being financed and the yield on those liabilities.https://treasury.gov.au/sites/default/files/2019-03/round6.pdf
Poverty threshold
The poverty threshold in the U.S. is updated each year by the U.S. Census Bureau. The number is adjusted according to inflation to reflect the updated cost of living in particular areas. In 2016 12.7% of Americans were living below the poverty threshold. Poverty thresholds depend on the number of people living in the household.
Problems with income deficit
There is still debate as to how to accurately calculate poverty, and which factors would be the most appropriate. While the poverty line reflects the general circumstances of a household (specifically, number of people and location), it does not capture the household's individual circumstances, such as health problems. Therefore, supplemental poverty measures are also used to better represent the data.
US Income Deficit
In the United States, the census bureau separates data collected into several different categories. Each category is then separated even further by number of children, age of children, yearly salary, social security income, et cetera. The data below shows the average of each subcategory within the three larger ones. Data is from the year 2016.
Families have a mean income deficit of $10,505.
Married-couple families have a mean income deficit of $11,139.
Families with female householder and no male present have a mean income deficit of $9,991.
References
Hurst, Charles. Social Inequality: forms, causes, and consequences
External links
US Census Bureau
America's Deficit, the World's Problem
Measurements and definitions of poverty
Welfare economics
Personal financial problems |
https://en.wikipedia.org/wiki/File%20URI%20scheme | In programming, a file uniform resource identifier (URI) scheme is a specific format of URI, used to specifically identify a file on a host computer. While URIs can be used to identify anything, there is specific syntax associated with identifying files.
Format
A file URI has the format
file://host/path
where host is the fully qualified domain name of the system on which the path is accessible, and path is a hierarchical directory path of the form directory/directory/.../name. If host is omitted, it is taken to be "localhost", the machine from which the URL is being interpreted. Note that when omitting host, the slash is not omitted (while "file:///foo.txt" is valid, "file://foo.txt" is not, although some interpreters manage to handle the latter).
RFC 3986 includes additional information about the treatment of ".." and "." segments in URIs.
Number of slash characters
The character sequence of two slash characters (//) after the string file: denotes that either a hostname or the literal term localhost follows, although this part may be omitted entirely, or may contain an empty hostname.
The single slash between host and path denotes the start of the local-path part of the URI and must be present.
A valid file URI must therefore begin with either file:/path (no hostname), file:///path (empty hostname), or file://hostname/path.
file://path (i.e. two slashes, without a hostname) is never correct, but is often used.
Further slashes in path separate directory names in a hierarchical system of directories and subdirectories. In this usage, the slash is a general, system-independent way of separating the parts, and in a particular host system it might be used as such in any pathname (as in Unix systems).
There are two ways that Windows UNC filenames (such as \\server\folder\data.xml) can be represented. These are both described in RFC 8089, Appendix E as "non-standard". The first way (called here the 2-slash format) is to represent the server name using the Authority part of the URI, which then becomes file://server/folder/data.xml. The second way (called here the 4-slash format) is to represent the server name as part of the Path component, so the URI becomes file:////server/folder/data.xml. Both forms are actively used. Microsoft .NET (for example, the method new Uri(path)) generally uses the 2-slash form; Java (for example, the method new URI(path)) generally uses the 4-slash form. Either form allows the most common operations on URIs (resolving relative URIs, and dereferencing to obtain a connection to the remote file) to be used successfully. However, because these URIs are non-standard, some less common operations fail: an example is the normalize operation (defined in RFC 3986 and implemented in the Java java.net.URI.normalize() method) which reduces file:////server/folder/data.xml to the unusable form file:/server/folder/data.xml.
Examples
Unix
Here are two Unix examples pointing to the same /etc/fstab file:
file://localhost/etc/fs |
https://en.wikipedia.org/wiki/Phase%20Equilibria%20Diagrams | Phase Equilibria Diagrams can refer to:
Phase diagrams in equilibrium
Phase Equilibria Diagrams, a database for glass; see Glass databases |
https://en.wikipedia.org/wiki/JumpStart%20%28software%29 | JumpStart is a computer network installation tool set used by the Solaris operating system.
Usage
JumpStart is used to manage operating system installation in many Information technology environments (corporate and otherwise) where Solaris operating system computers are widely used. It can provide easier installation (minor setup on central server, then one command on an installation "client" system to start it installing). It also allows completely consistent system installation on many systems over time - each install can have exactly the same system configuration and software tools. Alternatively, different types of systems can be installed for different purposes, in each case with consistent installations for a given defined type. Tools used to manipulate JumpStart include JET, the JumpStart Enterprise Toolkit.
Created by: Thomas Fritz in 1994, at Sun.
Structure
JumpStart consists of two main parts: network booting of a system, and then network installation.
Network booting proceeds similarly to Solaris' standard network booting capabilities. A JumpStart and network booting server is set up on the same local network as the system(s) to be installed. Technically, the network boot and install servers can be separate functions, but they are typically the same system.
Once a client system begins the JumpStart process, it then accesses the operating system component software packages stored on the JumpStart server, usually but not exclusively using Network File System.
Those packages, and optionally additional tools or applications, are automatically installed, and then the system is rebooted. Some additional configuration may be manually performed, or the system's configuration may be set up completely automatically.
See also
Kickstart (Linux)
Fully Automatic Installation
System Installer
References
Solaris 10 Installation Guide: Network-Based Installations
Unix package management-related software
Sun Microsystems software
Booting
Network booting
Provisioning |
https://en.wikipedia.org/wiki/Kickstart%20%28Linux%29 | The Red Hat Kickstart installation method is used by Fedora, Red Hat Enterprise Linux and related Linux distributions to automatically perform unattended operating system installation and configuration. Red Hat publishes Cobbler as a tool to automate the Kickstart configuration process.
Usage
Kickstart is normally used at sites with many such Linux systems, to allow easy installation and consistent configuration of new computer systems.
Kickstart configuration files can be built three ways:
By hand.
By using the GUI system-config-kickstart tool.
By using the standard Red Hat installation program Anaconda.
Anaconda will produce an anaconda-ks.cfg configuration file at the end of any manual installation. This file can be used to automatically reproduce the same installation or edited (manually or with system-config-kickstart).
Structure
The kickstart file is a simple text file, containing a list of items, each identified by a keyword.
While not strictly required, there is a natural order for sections that should be followed. Items within the sections do not have to be in a specific order unless otherwise noted. The section order is:
Command section – single line general purpose commands.
The %packages section – listing of software packages to be installed & related options.
The %pre, %pre-install, %post, %onerror, and %traceback sections – can contain scripts that will be executed at the appropriate time during the installation.
The %packages, %pre, %pre-install, %post, %onerror, and %traceback sections are all required to be closed with %end.
Items that are not required for the given installation run can be omitted.
Lines starting with a pound sign (#) are treated as comments and are ignored.
If deprecated commands, options, or syntax are used during a kickstart installation, a warning message will be logged to the anaconda log. Since deprecated items are usually removed within a release or two, it makes sense to check the installation log to make sure you haven’t used any of them. When using ksvalidator, deprecated items will cause an error.
Example
A simple Kickstart for a fully automated Fedora installation.
# use Fedora mirror as installation source, set Fedora version and target architecture
url --mirrorlist=http://mirrors.fedoraproject.org/mirrorlist?repo=fedora-33&arch=x86_64
# set installation language
lang en_US.UTF-8
# set keyboard
keyboard us
# set root password
rootpw 12345
# create a sudo capable user
user --name wikipedia-user --password 12345 --groups=wheel
#set timezone
timezone America/New_York
# clear all existing storage (!)
zerombr
clearpart --all --initlabel
# automatically create default storage layout
autopart
%packages
# install the Fedora Workstation environment
@^Fedora Workstation
# install some package groups
@3D Printing
@C Development Tools and Libraries
@System Tools
# install some packages
vim
git
mc
%end
External links
Kickstart commands in Fedora - Kickstart command reference for F |
https://en.wikipedia.org/wiki/16%3A10%20aspect%20ratio | 16:10 (1.6:1) is an aspect ratio commonly used for computer displays and tablet computers. It is equal to 8/5, close to the golden ratio (), which is approximately 1.618.
History
LCD computer displays with a 16:10 ratio first rose to mass market prominence in 2003. By 2008, the 16:10 aspect ratio had become the most common aspect ratio for LCD monitors and laptop displays. After 2010, however, 16:9 became the mainstream standard. This shift was driven by lower manufacturing costs and the 16:9 aspect ratio being used as a standard in modern televisions.
Rise in popularity from 2003
Until about 2003, most computer monitors had a 4:3 aspect ratio, with some using a 5:4 ratio. Between 2003 and 2006, monitors with 16:10 aspect ratios became commonly available, first in laptops, and later in display monitors. Such displays were considered better suited for word processing and computer-aided design.
From 2005 to 2008, 16:10 overtook 4:3 as the highest-selling aspect ratio for LCD monitors. At the time, 16:10 made up 90% of the notebook market, and was the most commonly used aspect ratio for laptops. However, 16:10 had a short reign as the most common aspect ratio.
Decline from 2008
Around 2008–2010, computer display manufacturers began a rapid shift to the 16:9 aspect ratio. By 2011, 16:10 had almost disappeared from new mass-market products. By October 2012, the market share of 16:10 displays had dropped to less than 23%, according to Net Applications.
The primary reason for this move was considered to be production efficiency: Since display panels for TVs use the 16:9 aspect ratio, it became more efficient for display manufacturers to produce computer display panels in the same aspect ratio. A 2008 report by DisplaySearch also cited several other reasons, including the ability for PC and monitor manufacturers to expand their product ranges by offering products with wider screens and higher resolutions. This helped consumers adopt such products more easily, "stimulating the growth of the notebook PC and LCD monitor market".
The shift from 16:10 to 16:9 was met with a mixed response. The lower cost of 16:9 computer displays was seen as a positive, along with their suitability for gaming and movies, as well as the convenience of having the same aspect ratio in different devices. On the other hand, there was criticism towards the lack of vertical screen real estate when compared to 16:10 displays of the same screen diagonal. For this reason, some considered 16:9 displays less suitable for productivity-oriented tasks, such as editing documents or spreadsheets and using design or engineering applications, which are mostly designed for taller, rather than wider screens.
Several companies still offer 16:10 aspect ratio monitors as of March 2021. These monitors are intended for photographers, video editors, digital artists, desktop publishers, graphic designers, and business customers.
Resurgence
In 2020, Dell released high-end productivity laptops |
https://en.wikipedia.org/wiki/Allison%20Whitlock | Allison Whitlock is an Australian born craft stylist, designer and owner of the homewares label homeMADEmodern. In 2005 Allison became the host of DIY Network's Uncommon Threads, a daily half-hour craft program. In 2006 the series was picked up for a second season and began airing on HGTV in 2007.
References
Get Creative Magazine August 2007
Get Creative Magazine September 2007
Australian Quilters Companion October 2007
American television personalities
American women television personalities
Living people
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Ruby%20Central | Ruby Central, Inc., is a non-profit organization based in the United States, dedicated to support and advocacy for the Ruby programming language.
Ruby Central is the parent organization of the annual International Ruby and Ruby on Rails Conferences, and serves as a visible presence and point of contact for corporate sponsors interested in supporting these conferences and other Ruby activities.
The organization was founded by a group of Ruby advocates including David Alan Black, Chad Fowler and Richard Kilmer. Black and Fowler were involved in organizing the first annual International Ruby Conference. Shortly after that conference, the organizers realized that a permanent organization was required to handle conference arrangements, and Ruby Central was created to address this.
Ruby Central’s first project was RubyConf 2002, and annual RubyConfs have been held since then. Ruby Central produced the first official Ruby on Rails Conference, RailsConf 2006, in Chicago in June 2006. The organization partnered with the Bay Area-based SVForum to produce the 2006 Silicon Valley Ruby Conference, and with the UK training organization Skills Matter to produce the first official European Rails Conference in September 2006. In November 2007, Ruby Central presented RailsConf 2007 in Charlotte, North Carolina, in partnership with O'Reilly Media. The event was completely sold out by mid-October. RailsConf 2008, also presented in partnership with O'Reilly, was held May 29-June 1, 2008 in Portland, Oregon.
Ruby Central has also become a hub for support of Ruby activities. The organization's first project other than RubyConf was the Ruby Codefest Grant Program, through which they offered support for local and regional groups of programmers working on Ruby library projects. In 2006 Ruby Central inaugurated a Regional Conference Grant Program, aimed at promoting smaller regional Ruby and Rails conferences.
See also
RubyKaigi, the largest Ruby conference in Japan
References
External links
Ruby Central
RubyConf
RailsConf
RailsConf Europe
Ruby (programming language)
Non-profit organizations based in the United States |
https://en.wikipedia.org/wiki/Rule%20of%20Sarrus | In matrix theory, the Rule of Sarrus is a mnemonic device for computing the determinant of a matrix named after the French mathematician Pierre Frédéric Sarrus.
Consider a matrix
then its determinant can be computed by the following scheme.
Write out the first two columns of the matrix to the right of the third column, giving five columns in a row. Then add the products of the diagonals going from top to bottom (solid) and subtract the products of the diagonals going from bottom to top (dashed). This yields
A similar scheme based on diagonals works for matrices:
Both are special cases of the Leibniz formula, which however does not yield similar memorization schemes for larger matrices. Sarrus' rule can also be derived using the Laplace expansion of a matrix.
Another way of thinking of Sarrus' rule is to imagine that the matrix is wrapped around a cylinder, such that the right and left edges are joined.
References
External links
Sarrus' rule at Planetmath
Linear Algebra: Rule of Sarrus of Determinants at khanacademy.org
Linear algebra
Determinants
Mnemonics |
https://en.wikipedia.org/wiki/Takarach%C5%8D%20Station | is Station A-12 on the Toei Asakusa Line of the Tokyo Subway network in Japan. It is located underground in the Kyōbashi neighborhood of Chūō, Tokyo.
Station layout
Takaracho Station has two side platforms serving the line's two tracks.
Platforms
History
Takaracho Station opened on February 28, 1963, on what was then called Line 1. The line took its present name in 1978. The station takes its name from Takaracho, a neighborhood that was named in 1931. The neighborhood's name disappeared in 1978 when Takaracho merged with neighboring Kyōbashi, but the station continues to use the old name.
Surrounding area
Kyōbashi Station ( Tokyo Metro Ginza Line)
Hatchōbori Station ( Keiyō Line and Tokyo Metro Hibiya Line)
Railway stations in Japan opened in 1963
Toei Asakusa Line
Stations of Tokyo Metropolitan Bureau of Transportation
Railway stations in Tokyo |
https://en.wikipedia.org/wiki/Table%20of%20biodiesel%20crop%20yields | The following table shows the vegetable oil yields of common energy crops associated with biodiesel production. Included is growing zone data, relevant to farmers and agricultural scientists.
This is unrelated to ethanol production, which relies on starch, sugar and cellulose content instead of oil yields.
- Note: Chinese Tallow (Sapium sebiferum, or Triadica sebifera) is also known as the "Popcorn Tree".
Sources
Used with permission from the Global Petroleum Club
http://journeytoforever.org/biodiesel_yield.html
See also
Bioenergy in China
References
External links
, published in Hill, Amanda, Al Kurki, and Mike Morris. 2006. “Biodiesel: The Sustainability Dimensions.” ATTRA Publication. Butte, MT: National Center for Appropriate Technology. Pages 4–5.
Biodiesel feedstock sources
Biodiesel |
https://en.wikipedia.org/wiki/Sprog%20%28software%29 | Sprog is a graphical tool to build Perl programs by plugging parts (called "gears" in Sprog terminology) together. Given the available gears are mostly for reading and processing data, this program can be classified as an ETL (Extract-Transform-Load) tool.
References
External links
Sprog web site
Extract, transform, load tools
Perl software |
https://en.wikipedia.org/wiki/Auckland%20Ferry%20Terminal | The Auckland Ferry Terminal, also called the Downtown Ferry Terminal, is the hub of the Auckland ferry network, which connects the Auckland CBD with suburbs in North Shore, West Auckland, and South Auckland, and islands in the Hauraki Gulf. The terminal is on the Auckland waterfront, at the north end of Queen Street, across Quay Street from the Waitematā railway station, which is the hub for local buses and trains.
The ferry terminal is composed of two main elements, a yellow Edwardian Baroque building facing Queen Street and the CBD, and newer wharves and a waiting area building (the actual ferry terminal of today) facing the Waitematā Harbour.
Facilities
Edwardian building
By the early 20th century, the Auckland Harbour Board recognised the need for a dedicated ferry building in Auckland. Original plans were for a five-storey structure, but after public outrage at the height, a design of four storeys and a clock tower was proposed. The plan was similar to that of the San Francisco Ferry Building. The building was designed by Alex Wiseman, and erected by Philcox and Sons. It was completed in 1912, of sandstone and brick with a base of Coromandel granite, on reclaimed land. It cost £67,944, a large sum for the day, equivalent to NZ$10.9 million in 2016.
The ferry building was the major departure point for people travelling to the North Shore until 1959, when the Auckland Harbour Bridge was opened.
A new ferry building was built next to it in 1982 and a report released that year said that extensive renovations were needed to bring the Edwardian building up to earthquake and fire code standards. The Harbour Board were divided over whether to keep the building, but following strong public opinion decided to renovate it. It has had a Category I classification with the New Zealand Historic Places Trust (now Heritage New Zealand) since 1982. It was extensively restored from 1986 and reopened by the Governor General on 5 November 1988. It now contains shops and cafes on the lower level, with most ferry operations moved to the new building.
New building
The more contemporary ferry piers and waiting area were constructed mostly as an open-sided structure with a curved seagull/sail-roof, which together with ornamental "smokestack" turrets is designed to evoke ships berthed behind the original building. It also needed to be of a low profile to retain building views, and was designed by architect Murray Day to be easily maintainable and expandable.
Major remedial work
Between 2009 and 2010, Auckland Regional Transport Authority carried out major remedial work on the wharf structure, which had not had such work done since construction. The initial works found some parts of the structure in worse shape than expected, as saltwater had slowly infiltrated the reinforced concrete. Initial urgent works were expected to finish in 2009.
References
External links
Photographs of the Auckland Ferry Terminal held in Auckland Libraries' heritage collection |
https://en.wikipedia.org/wiki/Doris%20Hopp | Doris Hopp (16 July 1930 – 31 October 1998) was a Swedish brothel madam who organized a network of call girls in Stockholm, Sweden, in the early 1970s. She was arrested on pimping charges in 1976. A police investigation soon revealed that many of Hopp's customers were well-known politicians and other dignitaries.
In November 1977, the newspaper Dagens Nyheter published allegations citing Justice Minister Lennart Geijer as one of Doris Hopp's customers. The newspaper claimed as its source a classified report in which the chief of police Carl Persson had informed Prime Minister Olof Palme of the involvement of politicians in the prostitution scandal. At the time of the scandal broke, it was legal to pay for sexual services, but the fact that politicians socialized with prostitutes was viewed as a security risk as staff from foreign embassies were also reported to frequent the brothel.
Prime Minister Palme strongly denied the allegations, accusing the newspaper of aggravated libel. The newspaper was forced into a retreat and two days after the publication Lennart Geijer received an official apology. Years later, it emerged that a few minor details aside, the newspaper's assertions had in fact been largely correct. Over the years, there has been much speculation regarding the identities of those who made use of the brothel's services. Former Prime Minister Thorbjörn Fälldin and former Centre Party leader Olof Johansson have both publicly denied frequenting Doris Hopp's brothel.
References
Specific
1930 births
1998 deaths
Swedish criminals
Swedish brothel owners and madams
People from Stockholm |
https://en.wikipedia.org/wiki/Bijankhan%20Corpus | The Bijankhan corpus () is a tagged corpus that is suitable for natural language processing (NLP) research on the Persian language. This collection is gathered from daily news and common texts. In this collection all documents are categorized into different subjects such as political, cultural, etc.; in about 4300 different subject categories. The corpus contains about 2.6 million manually tagged words with a tag set that contains 550 Persian part-of-speech tags.
The Bijankhan corpus was created by the Database Research Group at the University of Tehran. The corpus is non-free in that it is not free for commercial use, although these restrictions vary by country. The Bijankhan corpus is named after Mahmood Bijankhan, professor of linguistics at the University of Tehran due to his contributions in this area.
See also
Hamshahri Corpus
Persian Today Corpus
References
External links
.
Persian corpora
Applied linguistics
Linguistic research |
https://en.wikipedia.org/wiki/Block%20Lanczos%20algorithm | In computer science, the block Lanczos algorithm is an algorithm for finding the nullspace of a matrix over a finite field, using only multiplication of the matrix by long, thin matrices. Such matrices are considered as vectors of tuples of finite-field entries, and so tend to be called 'vectors' in descriptions of the algorithm.
The block Lanczos algorithm is amongst the most efficient methods known for finding nullspaces, which is the final stage in integer factorization algorithms such as the quadratic sieve and number field sieve, and its development has been entirely driven by this application.
It is based on, and bears a strong resemblance to, the Lanczos algorithm for finding eigenvalues of large sparse real matrices.
Parallelization issues
The algorithm is essentially not parallel: it is of course possible to distribute the matrix–'vector' multiplication, but the whole vector must be available for the combination step at the end of each iteration, so all the machines involved in the calculation must be on the same fast network. In particular, it is not possible to widen the vectors and distribute slices of vectors to different independent machines.
The block Wiedemann algorithm is more useful in contexts where several systems each large enough to hold the entire matrix are available, since in that algorithm the systems can run independently until a final stage at the end.
References
Numerical linear algebra |
https://en.wikipedia.org/wiki/Kilgwrrwg | Kilgwrrwg () is a rural parish in Monmouthshire, south east Wales, United Kingdom. It is located north west of Chepstow and south east of Usk in a network of country lanes running through the rolling hills below the Trellech ridge.
History
The Welsh placename element cil means a corner, or retreat, usually in a religious context, and the settlement name is suggestive of its Celtic Christian origins. In 1811 the parish had a population of 133, and in 1831 it had a population of 113 and 26 houses. Historically the parish was part of the Hundred of Raglan and was endowed by the Diocese of Llandaff.
In the 1980s and early 1990s, Kilgwrrwg was home to American war correspondent and novelist Martha Gellhorn, the widow of Ernest Hemingway.
Church of the Holy Cross
The Church of the Holy Cross at Kilgwrrwg is one of the most remote parish churches in the UK still in regular use. It can only be reached by crossing two fields and a stream from the nearest house.
The church is surrounded by a partly curved churchyard, suggesting a Celtic foundation, and has been described as "the most perfect example of an early Christian site". It is thought to have been referred to indirectly in a charter of about 722, cited in the Book of Llandaff. According to local legend, the location of the church was determined when a pair of heifers, yoked together, were left to wander, and came to rest on a small mound, signifying that the place was divinely ordained for a church to be built there.
The churchyard contains a plain short-armed stone cross, impossible to date accurately but thought by some to be pre-Norman and described by others as mediaeval. There is also a stone carving of a head, again thought to be pre-Norman and sometimes described as a female fertility figure, placed in the wall. The church is built of Old Red Sandstone. It contains some Early English architectural features, including the walls and a window in the nave.
By the early nineteenth century, the building was partly ruined and used as a livestock shelter. According to the local schoolteacher and philanthropist James Davies of Devauden,"...the little church was in decay; rain and snow penetrated through the roof into the body of the building, and a neighbouring farmer folded his sheep within the walls of God's house. On twelve Sundays in the year, and on those only, was public worship performed in that church; and on those occasions the accumulated filth of sheep and cattle was shovelled out the day before." Davies encouraged the local residents to pay for the re-roofing of the church. It was further restored by John Prichard around 1871, and a porch, bellcote and windows were added at that time. Further restoration work was carried out in 1989/90. It is a Grade II* listed building.
Other buildings
Kilgwrrwg House is a hall house of the early sixteenth century, with a massive chimney stack of later date. The house is of architectural and historical interest.
The small hamlet of K |
https://en.wikipedia.org/wiki/Algebraic-group%20factorisation%20algorithm | Algebraic-group factorisation algorithms are algorithms for factoring an integer N by working in an algebraic group defined modulo N whose group structure is the direct sum of the 'reduced groups' obtained by performing the equations defining the group arithmetic modulo the unknown prime factors p1, p2, ... By the Chinese remainder theorem, arithmetic modulo N corresponds to arithmetic in all the reduced groups simultaneously.
The aim is to find an element which is not the identity of the group modulo N, but is the identity modulo one of the factors, so a method for recognising such one-sided identities is required. In general, one finds them by performing operations that move elements around and leave the identities in the reduced groups unchanged. Once the algorithm finds a one-sided identity all future terms will also be one-sided identities, so checking periodically suffices.
Computation proceeds by picking an arbitrary element x of the group modulo N and computing a large and smooth multiple Ax of it; if the order of at least one but not all of the reduced groups is a divisor of A, this yields a factorisation. It need not be a prime factorisation, as the element might be an identity in more than one of the reduced groups.
Generally, A is taken as a product of the primes below some limit K, and Ax is computed by successive multiplication of x by these primes; after each multiplication, or every few multiplications, the check is made for a one-sided identity.
The two-step procedure
It is often possible to multiply a group element by several small integers more quickly than by their product, generally by difference-based methods; one calculates differences between consecutive primes and adds consecutively by the . This means that a two-step procedure becomes sensible, first computing Ax by multiplying x by all the primes below a limit B1, and then examining p Ax for all the primes between B1 and a larger limit B2.
Methods corresponding to particular algebraic groups
If the algebraic group is the multiplicative group mod N, the one-sided identities are recognised by computing greatest common divisors with N, and the result is the p − 1 method.
If the algebraic group is the multiplicative group of a quadratic extension of N, the result is the p + 1 method; the calculation involves pairs of numbers modulo N. It is not possible to tell whether is actually a quadratic extension of without knowing the factorisation of N. This requires knowing whether t is a quadratic residue modulo N, and there are no known methods for doing this without knowledge of the factorisation. However, provided N does not have a very large number of factors, in which case another method should be used first, picking random t (or rather picking A with t = A2 − 4) will accidentally hit a quadratic non-residue fairly quickly. If t is a quadratic residue, the p+1 method degenerates to a slower form of the p − 1 method.
If the algebraic group is an elliptic curve, t |
https://en.wikipedia.org/wiki/Traditional%20knowledge%20GIS | Traditional knowledge geographic information systems (GIS) are the data, techniques, and technologies designed to document and utilize local knowledges in communities around the world. Traditional knowledge is information that encompasses the experiences of a particular culture or society. Traditional knowledge GIS differ in comparison to ordinary cognitive maps in that they express environmental and spiritual relationships among real and conceptual entities. This toolset focuses on cultural preservation, land rights disputes, natural resource management, and economic development.
Technical aspects
Traditional knowledge GIS employs cartographic and database management techniques such as participatory GIS, map biographies, and historical mapping. Participatory GIS aspires to a mutually beneficial relationship between the governing and the governed by fostering public involvement in all aspects of a GIS. It is widely accepted that this technique is necessary to sound environmental and economic planning in developing areas. This method generates a sense of place in scientific analysis that incorporates sacred sites and traditional land use practices. Participatory GIS can be effective for local resource management and planning, but researchers doubt its efficacy as a tool in attaining land tenure or fighting legal battles because of lack of expertise among local individuals and lack of access to technology.
Map biographies track the practices of local communities either for the sake of preservation or to argue for resource protection or land grants. GIS technologies are powerful in their ability to accommodate multimedia and multidimensional data sets, which allows for the recording and playing of oral histories and representations of abstract ecological knowledge.
Historical mapping documents and analyzes events that are meaningful to a particular tradition or locale. Cultural and humanitarian benefits derive from including maps in the historical record of an area.
Cultural preservation
Cultural preservation is perhaps the principal application of a traditional knowledge GIS. As adherents to traditional lifestyles decline in population, there has developed a degree of urgency surrounding the collection of data and wisdom from aging local elders. A central feature of cultural preservation is language revitalization. Bilingual visual and audible maps depict oral traditions and historical information in places of cultural significance at various scales and levels of detail.
Researchers encounter significant obstacles to data acquisition due to the sensitive natures of much of the data sought for a traditional knowledge GIS, and locals may distrust the motives of outside consultants.
Land rights and natural resource management
Traditional knowledge GIS have the power to frame debates over land rights and resource management in ecologically sensitive areas. Interests of local residents in these regions often conflict with those of mi |
https://en.wikipedia.org/wiki/PanOULU | panOULU is a municipal wireless network in Finland. panOULU is operated by City of Oulu, University of Oulu, Oulu University of Applied Sciences and Oulun Puhelin Oyj. The network coveres central Oulu (including various buildings, such as the city hall, public libraries, Oulun Energia Areena ice hockey arena, etc.), and the campus areas. In addition, outside of Oulu, the network covers Oulu Airport in Oulunsalo, the ferries to Hailuoto, University of Oulu campus in Kajaani, and the Chydenius Institute campus in Kokkola. The network also covers parts of Ylikiiminki. The network is free to use and requires no passwords; it can be used with any computer, cell phone, PDA or other device that is capable of using Wi-Fi.
the network has over 900 wireless access points. Based on coverage and potential number of users, it is currently the largest public wireless network in Finland. Also, it is the first free and open wireless network that operates in an airport in Finland.
References
External links
panOULU home page
Wi-Fi providers
Oulu
University of Oulu |
https://en.wikipedia.org/wiki/How%20Much%20Is%20Enough%3F | How Much Is Enough? is an American game show that aired on Game Show Network from January 8, 2008 to March 28, 2008. The show was hosted by Corbin Bernsen with four contestants competing with a "money clock" to avoid being the "greediest" contestant.
Despite high expectations among production staff, with one member calling it a potentially "network-defining" show that would "quickly become an audience favorite,” the series did not meet those expectations and was canceled after its first season.
Gameplay
The general objective of the game is to avoid being the greediest contestant. For each money clock played, a dollar figure is shown that rapidly increases or decreases. Contestants hold lock-out buzzers behind their backs and secretly lock-in at a point when they believe the money clock is high enough to be valuable to them, but low enough not to be the "greediest" contestant, or the contestant who locks-in at the highest value. For each of the five money clocks (ranging from $1,000 to $5,000), the greediest contestant banks no money for the just-played money clock. For the $5,000 clock, the most cautious (lowest value) contestant also banks nothing. The other contestants for each clock bank the value when they lock-in. The $1,000, $3,000, and $5,000 clocks count upward from $0 to that amount, while the $2,000 and $4,000 clocks count down to $0.
After five money clocks, the two contestants with the most money go to the final face-off. The contestants' scores are added together and become the top value for the final money clock. The clock counts up from $0, and the first contestant to lock-in won the value shown on the clock. The other contestant wins nothing. The maximum amount of money a contestant could win was $30,000.
Production
GSN announced the series on November 27, 2007, with actor Corbin Bernsen hosting the show. Bernsen expressed excitement in anticipation of hosting the series, saying, "I have always been a big fan of game shows and I have been tuning into GSN for years. I am excited to be part of the network and this great new show How Much Is Enough?." Jamie Roberts, GSN's Senior Vice President of Programming, had high expectations for Bernsen and the series as a whole, stating, "Corbin brings the game to life with his unique charm and charisma. Combining the show's inherent drama with such a great host, we know it will quickly become an audience favorite." Roberts also added: "It was so different and fresh, and we knew we wanted to get involved with it. The format is clean, simple and very straightforward, but it has surprising layers, and it takes real strategy to play it. This is going to be a network-defining show." Paul Telegdy, Executive Vice President of Content and Production for BBC Worldwide America, was equally optimistic: "This is a tremendously engaging concept. It conjures up such a heightened atmosphere of tension and anticipation recognized to be a crucial element of today’s massively popular game shows."
The seri |
https://en.wikipedia.org/wiki/Hank%20Levy%20%28computer%20scientist%29 | Henry M. "Hank" Levy is an American computer scientist. He holds the Wissner-Slivka Chair in Computer Science and Engineering at the University of Washington (U.W.).
Work
Levy's research concerns operating systems, distributed systems, the internet, and computer architecture. In his early career, Levy worked at Digital Equipment Corporation (DEC), where he was a member of the design and engineering team for the VMS operating system for the VAX computer. His graduate work resulted in the book Capability-Based Computer Systems. He joined the University of Washington Department of Computer Science & Engineering as a faculty member in 1983. In 2006 Levy became Chair of the department, and in 2017, when the department was elevated to become the Paul G. Allen School of Computer Science & Engineering, Levy became the first Director of the School, serving until the end of 2019, after over 13 years of leadership. Over that time he oversaw significant growth of the program and its stature, as well as the design and construction of two new buildings, the Paul G. Allen Center and the Bill & Melinda Gates Center. He was involved with several early object-oriented distributed systems (Eden and Emerald), and also with the invention of simultaneous multithreading. Levy co-founded two startups, Performant (founded in 2000 and acquired by Mercury in 2003), and Skytap (founded in 2006). He is a member of the National Academy of Engineering (NAE), a fellow of the Association for Computing Machinery (ACM), and a fellow of the Institute of Electrical and Electronics Engineers (IEEE).
Levy is also curator of an art collection for the Allen School. The resulting collection represents nearly thirty artists, each with some connection to the University of Washington. Artists represented include Jacob Lawrence, George Tsutakawa, Kenneth Callahan, Akio Takamori, Alden Mason, Imogen Cunningham, Art Wolfe, and Chuck Close.
Levy recently joined Google as a Distinguished Engineer.
Notes
External links
Hank Levy's home page, University of Washington
Art in the Allen Center, University of Washington
University of Washington faculty
American computer scientists
Year of birth missing (living people)
Living people |
https://en.wikipedia.org/wiki/WLUR | WLUR (91.5 FM) is a Public Radio and Variety formatted broadcast radio station licensed to and serving Lexington, Virginia. WLUR is owned and operated by Washington and Lee University.
Programming
WLUR broadcasts student created programming from its studios in Lexington. WLUR retransmits programming from Radio IQ in the late night and early morning hours, and also airs Radio IQ when W&L is not in session. Its frequency is 91.5 FM.
WLUR previously was operated for most of its history by the school's Department of Journalism & Communications and was located on the third floor of Reid Hall, which houses the department. However, the department gave up control of the station in the 2000s, and it has been a student organization since. It broadcasts out of the Elrod Student Commons.
Doug Harwood
Since the early 70s, Saturday nights on WLUR have been turned over to an alumnus, Doug Harwood. His show, which features four hours of eclectic music and no talking, has run continuously since Harwood was a student at the school. As of Winter 2020, the show still aired weekly. Much of the music is played off vinyl from Harwood's extensive collection. The formal name of his show is the Anti-Headache Machine.
References
External links
91-5 WLUR Online
NPR member stations
LUR
Washington and Lee University
LUR
Public radio stations in the United States
Radio stations established in 1967 |
https://en.wikipedia.org/wiki/Hierarchical%20internetworking%20model | The Hierarchical internetworking model is a three-layer model for network design first proposed by Cisco. It divides enterprise networks into three layers: core, distribution, and access layer.
Access layer
End-stations and servers connect to the enterprise at the access layer. Access layer devices are usually commodity switching platforms, and may or may not provide layer 3 switching services. The traditional focus at the access layer is minimizing "cost-per-port": the amount of investment the enterprise must make for each provisioned Ethernet port. This layer is also called the desktop layer because it focuses on connecting client nodes, such as workstations to the network.
Distribution layer
The distribution layer is the smart layer in the three-layer model. Routing, filtering, and QoS policies are managed at the distribution layer. Distribution layer devices also often manage individual branch-office WAN connections. This layer is also called the Workgroup layer.
Core layer
The core is the backbone of a network, where the internet(internetwork) gateway are located. The core network provides high-speed, highly redundant forwarding services to move packets between distribution-layer devices in different regions of the network. Core switches and routers are usually the most powerful, in terms of raw forwarding power, in the enterprise; core network devices manage the highest-speed connections, such as 10 Gigabit Ethernet or 100 Gigabit Ethernet.
See also
Multi-tier architecture
Service layer
References
Computer_networking
Reference models |
https://en.wikipedia.org/wiki/Lamport%27s%20distributed%20mutual%20exclusion%20algorithm | Lamport's Distributed Mutual Exclusion Algorithm is a contention-based algorithm for mutual exclusion on a distributed system.
Algorithm
Nodal properties
Every process maintains a queue of pending requests for entering critical section in order. The queues are ordered by virtual time stamps derived from Lamport timestamps.
Algorithm
Requesting process
Pushing its request in its own queue (ordered by time stamps)
Sending a request to every node.
Waiting for replies from all other nodes.
If own request is at the head of its queue and all replies have been received, enter critical section.
Upon exiting the critical section, remove its request from the queue and send a release message to every process.
Other processes
After receiving a request, pushing the request in its own request queue (ordered by time stamps) and reply with a time stamp.
After receiving release message, remove the corresponding request from its own request queue.
Message complexity
This algorithm creates 3(N − 1) messages per request, or (N − 1) messages and 2 broadcasts. 3(N − 1) messages per request includes:
(N − 1) total number of requests
(N − 1) total number of replies
(N − 1) total number of releases
Drawbacks
This algorithm has several disadvantages. They are:
It is very unreliable as failure of any one of the processes will halt progress.
It has a high message complexity of 3(N − 1) messages per entry/exit into the critical section.
See also
Ricart–Agrawala algorithm (an improvement over Lamport's algorithm)
Lamport's bakery algorithm
Raymond's algorithm
Maekawa's algorithm
Suzuki–Kasami algorithm
Naimi–Trehel algorithm
References
Concurrency control algorithms
Distributed computing |
https://en.wikipedia.org/wiki/Anant%20Agarwal | Anant Agarwal is an Indian computer architecture researcher. He is a professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT), where he led the development of Alewife, an early cache coherent multiprocessor, and also has served as director of the MIT Computer Science and Artificial Intelligence Laboratory. He is the founder and CTO of Tilera, a fabless semiconductor company focusing on scalable multicore embedded processor design. He also serves as the CEO of edX, a joint partnership between MIT and Harvard University that offers free online learning.
Education
Agarwal was born in Mangalore and did his schooling in St. Aloysius Mangalore. He holds a bachelor's degree (1982) in electrical engineering from Indian Institute of Technology Madras. For postgraduate study, he attended Stanford University, where he received an MS (1984) and a PhD (1987), both in electrical engineering. His PhD thesis, Analysis of Cache Performance for Operating Systems and Multiprogramming, was written under John L. Hennessy.
Career
Agarwal is the CEO of edX, a worldwide, online learning initiative of MIT and Harvard. He is a leader of the Carbon Project, which is developing new scalable multicore architectures, a new operating system for multicore and clouds called fos, and a distributed, parallel simulator for multicore and clouds called Graphite. He is a leader of the Angstrom Project, which is creating fundamental technologies for exascale computing. He contributes to WebSim, a web-based electronic circuits laboratory. He led the Raw Project at CSAIL, and is a founder of Tilera Corporation. Raw was an early tiled multicore processor with 16 cores. He also teaches the edX offering of MIT's 6.002 Circuits and Electronics.
In 2013, he was elected as a member into the National Academy of Engineering for contributions to shared-memory and multicore computer architectures.
His previous projects include Sparcle, a coarse-grain multithreaded (CGMT or switch-on-event SOE) microprocessor, Alewife, a scalable distributed shared memory multiprocessor, Virtual Wires, a scalable FPGA-based logic emulation system, LOUD, a beamforming microphone array, Oxygen, a pervasive human-centered computing project, and Fugu, a protected, multiuser multiprocessor.
Awards
Agarwal received the 2001 Maurice Wilkes Award for computer architecture.
In 2007 he was inducted as a Fellow of the Association for Computing Machinery. In 2011 he was appointed Director of MIT's Computer Science and Artificial Intelligence Laboratory. In 2013, he became a member of the National Academy of Engineering and was appointed the CEO of EdX. In March 2016, he was awarded the Harold W. McGraw, Jr. Prize in Education in higher education as an outstanding leader of the development of the Massive Open Online Course movement. In addition to that, he is also a Distinguished Alumnus of IIT Madras. He received Padma Shri, the fourth highest civilian award in the Repub |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.