In linguistics , Heaps law is an empirical law which describes the portion of a vocabulary which is represented by an instance document or set of instance documents consisting of words chosen from the vocabulary. This can be formulated as math V R n Kn beta math Where V sub R sub is the subset of the vocabulary V represented by the instance text of size n . K and are free parameters determined empirically. With English text corpus text corpora , typically K is between 10 and 100, and is between 0.4 and 0.6. center Image Heaps law plot.png br A typical Heaps law plot. The x axis represents the text size, and the y axis represents the number of distinct vocabulary elements present in the text. Compare the values of the two axes. center Heaps law means that as more instance text is gathered, there will be diminishing returns in terms of discovery of the full vocabulary from which the distinct terms are drawn. It is interesting to note that Heaps law applies in the general case where the vocabulary is just some set of distinct types which are attributes of some collection of objects. For example, the objects could be people, and the types could be country of origin of the person. If persons are selected randomly that is, we are not selecting based on country of origin , then Heaps law says we will quickly have representatives from most countries in proportion to their population but it will become increasingly difficult to cover the entire set of countries by continuing this method of sampling. See also Zipf s law References Harold Stanley Heaps. Information Retrieval Computational and Theoretical Aspects . Academic Press, 1978. Heaps law is proposed in Section 7.5 pages 206 208 . Ricardo Baeza Yates and Berthier Ribeiro Neto, Modern Information Retrieval , ACM Press, 1999. planetmath id 3431 title Heaps law Category Computational linguistics Category Statistical laws Category Empirical laws ... more details
Infobox college football player name Jake Heaps school Kansas Jayhawks currentnumber 9 currentposition ... 2010 2011 cbs 1737127 espn 501563 rivals Jake Heaps born June 19, 1991 is an American football .... Heaps chose to play for Brigham Young University. He completed his freshman year at BYU leading the Cougars ... of the University of Texas El Paso. Heaps was named the games most valuable player with a quarterback rating of 122.5 and 4 touchdowns with 1 interception. As a college quarterback, Jake Heaps has thrown for 2,316 yards and 15 touchdowns. High school career Heaps led Skyline High School Sammamish, Washington ... athletes NfwIhIH15kyapU7Lsyi0JA football fall 09 stats jake heaps.htm title Jake Heaps Football Stats ... web url http rivals.yahoo.com ncaa football recruiting player Jake Heaps 80519 title Jake Heaps Yahoo ... in 2009, Heaps signed a letter of intent to play college football at Brigham Young University , ref Citation url http seattletimes.nwsource.com html huskies 2009301432 heaps05.html title Jake Heaps ... Coming out of high school, Heaps was the number one rated high school quarterback in the country according ... a.z?s 73&p 8&c 1&nid 2750323 title Scout.com Jake Heaps Profile publisher Recruiting.scout.com ... date accessdate 2010 09 08 ref Heaps was also named as top quarterback on the Parade ... football columns story?columnist luginbill tom&id 4230171 title Heaps chooses the right school first Tom last Luginbill newspaper Espn.com date June 4, 2009 ref College career Heaps began his ... against Florida State, Heaps led the Cougars the rest of the season to six wins and four losses. He ... and the December bowl game, Heaps threw 13 touchdowns and two interceptions and passed for 1,259 ... game appearances. Heaps was named the 2010 New Mexico Bowl New Mexico Bowl s Most Valuable Player, breaking some of the bowl s records after leading BYU to a comfortable victory. As a true freshman, Heaps ..., Heaps started the first five games of the season but was benched in favor of Riley Nelson. Following ... more details
Infobox football biography playername Jay Heaps image Image JayHeaps 2006 MLS Cup.jpg 180px Jay Heaps fullname John F. Heaps IV dateofbirth birth date and age 1976 8 2 cityofbirth Nashua, New Hampshire ... New England Revolution medaltemplates pcupdate ntupdate Jay Heaps born August 2, 1976 is a former ... Soccer . After a successful college career at Duke University , Heaps spent his entire professional ... Heaps also played with the United States men s national soccer team , earning four caps at the 2009 CONCACAF Gold Cup . Career College After graduating from Longmeadow High School , Heaps played college ... s top college player. Additionally, Heaps played for the Duke Blue Devils men s basketball Duke University ... Duke, Heaps was drafted second overall in the 1999 MLS College Draft by Miami Fusion , and was named ... year, Heaps was named an MLS All Star, while registering 5 goals and six assists for the Fusion. Before ... for the opposing Houston Dynamo . Heaps announced his retirement from the game on December ... mls&fext .jsp ref Post playing career Since announcing his retirement from professional soccer, Heaps ... management for ultra high net worth individuals . In 2010, Heaps became the color commentator ... career On November 14, 2011, Heaps was named the head coach for the New England Revolution . He ... Revolution to name Heaps ref International As of February 2009, Heaps had played more MLS matches 289 ... 16 author Scaryice date 2009 02 16 publisher Climbing the Ladder ref On June 25, 2009, Heaps received ... Gold Cup . On July 11, 2009, Heaps made his debut with the United States men s national soccer ... players bio.jsp?team t109&player heaps j&playerId hea504282&statType current MLS player profile ... Wikipedia Persondata . NAME Heaps, Jay ALTERNATIVE NAMES SHORT DESCRIPTION DATE OF BIRTH August 2 ... Heaps, Jay Category 1976 births Category Duke University alumni Category Duke Blue Devils men s basketball ... Cup players de Jay Heaps it Jay Heaps pl Jay Heaps pt Jay Heaps ru , ... more details
Notability Music date August 2009 Unreferenced date August 2009 Infobox album See Wikipedia WikiProject Albums Name Swollen Heaps Type Demo Artist Skinless Released 1995 Genre Death metal Label Stinky Dung Records Swollen Heaps is the second demo album from death metal band Skinless . Track listing tracklist title1 Crispy Kids title2 Cuntaminated title3 Merrie Melodie title4 Tug of War Intestines title5 Pool of Stool Line up Sherwood Webber Drums,Vocals Noah Carpenter Guitar, Backing Vocals Adam Lewis Bass Ryan Wade Drums,Vocals Category 1995 albums 1990s album stub ... more details
Orphan date November 2010 Heaps Rock coor dm 76 0 S 132 46 W is a rock exposure above Bursey Icefalls and 2 nautical miles 3.7 km west northwest of Hutt Peak on the Mount Bursey massif, in Marie Byrd Land . Mapped by United States Geological Survey USGS from ground surveys and U.S. Navy air photos, 1959 66. Named by Advisory Committee on Antarctic Names US ACAN for Kenneth L. Heaps , meteorologist at South Pole Station , 1970. usgs gazetteer Category Rock formations in Marie Byrd Land MarieByrdLand geo stub ... more details
Infobox Politician name Adrian Heaps image caption office Toronto City Councillor for Scarborough Southwest ... residence Scarborough, Ontario religion occupation Adrian A. Heaps born c. 1954 is a politician in Toronto ... to 2010. Background Heaps is the grandson of Abraham Albert Heaps , a leader of the Winnipeg General ... member of the Co operative Commonwealth Federation . Heaps father, Leo, received a military ... US presidential campaign. ref name dv Donovan Vincent. Are Heaps ideas novel or naive? Rookie politician .... Toronto Star. November 25, 2006. pg. B3. ref Heaps is a former vice president of an independent ... several municipalities with development projects. ref name dv Politics In 1999, Heaps ran as the Liberal ... 2006 , he ran again for City Councillor after Altobello was appointed a justice of the peace . Heaps ... that Heaps defamed her by distributing copies of a Globe and Mail article that endorsed him two days before the election. The article by columnist John Barber who described himself as a classmate of Heaps .... November 11, 2006. pp M1, M4. ref Heaps and Berardinetti eventually settled out of court. In December, 2009, City Council voted to reimburse Heaps for the both the settlement and legal expenses which amounted to 65,680. In January, 2010 Heaps elected to refuse the reimbursement. ref name lawsuit ... matter, City Council also decided to reimburse legal fees incurred by Heaps when a group called the Toronto Party for a Better City TPBC requested a compliance audit on Heaps campaign expenses. The audit ... and fellow councillor Doug Holyday launched a second legal action to force Heaps to repay the money. Heaps had refused the reimbursement for the defamation lawsuit but still accepted the reimbursement ... to reimburse Heaps since he was a candidate at the time and not yet a councillor. In August ... refused the city s request for an appeal. However, the court did not force Heaps to return the money ... City can t appeal ruling on payments to Heaps and Mammoliti . Toronto Star. December 28, 2010. ref ... more details
Orphan date February 2009 Elizabeth Heaps is an England English university administrator and academic at the University of York , who has been Pro Vice Chancellor there since October 2007, one of the four key positions which support the University s Vice Chancellor. Her duties include responsibility for Estates and Strategic Projects, including the growth of the campus agreed on its Heslington Heslington East site. She was Head of the University Library from 1997, where her role included responsibility for the Borthwick Institute for Archives , one of the biggest British archive repositories, particularly for ecclesiastical material. Founded in 1957, the Institute holds archives from all around the world, from the 12th century to the present day. She was elected to the University Council in 1999, and has sat on the Council since then. Within the University she is also a member of Court, Planning Committee, Senate, Information Committee and the Strategic Information Projects Implementation Group. As a qualified professional librarian, she is a senior participant in a variety of national and regional organisations in the field of information and libraries, including the Joint Information Systems Committee JISC , Society of College, National and University Libraries SCONUL , and the Yorkshire Museums, Libraries and Archives Council. Elizabeth Heaps has degrees in French language French and in Medieval studies . External links http www.york.ac.uk services library index.htm The University of York Library and Archives http www.york.ac.uk inst bihr welcome.htm The University of York Library and Archives Borthwick Institute References BLP sources article date May 2007 references Persondata Metadata see Wikipedia Persondata . NAME Heaps, Elizabeth ALTERNATIVE NAMES SHORT DESCRIPTION DATE OF BIRTH PLACE OF BIRTH DATE OF DEATH PLACE OF DEATH DEFAULTSORT Heaps, Elizabeth Category Year of birth missing living people Category Living people Category Academics of the University of York ... more details
Stanley A. Heaps 1880&ndash 1962 sfn Karol 2007 p 270 was an England English architect responsible for the design of a number of stations on the London Underground system as well as the design of train depots and bus and trolleybus garages for London Passenger Transport Board London Transport . Works File Kilburn park tube station.jpg thumb Kilburn Park Underground station File Edgware stn.jpg thumb Edgware Underground station File Osterley station building2.JPG thumb Osterley Underground station In 1903 Heaps became assistant to Leslie Green the architect for the Underground Electric Railways Company of London UERL and aided him in the design of the station buildings for the Baker Street and Waterloo Railway Baker Street & Waterloo Railway now part of the Bakerloo line , the Charing Cross, Euston and Hampstead Railway Charing Cross, Euston & Hampstead Railway CCE&HR, now part of the Northern line and the Great Northern, Piccadilly and Brompton Railway Great Northern, Piccadilly & Brompton Railway part of the Piccadilly line all distinctive with their striking red Glazed architectural ... death of Green in 1908, Heaps became the UERL s architect and produced designs for a number of new stations on the Bakerloo and Northern lines during the 1910s and early 1920s. Heaps first independent ... floor level behind the characteristic semi circular arched windows. By using escalators, Heaps stations ... the curved top section to reflect Green s design. In 1915 Heaps also designed a new frontage ... similar to those installed at Maida Vale station. After World War I , Heaps designed the stations ... design, until 1962. After the Edgware extension stations, Heaps concentrated on the design of less ... 135 Heaps remained Chief Architect for the UERL and its successor London Transport into the 1940s. He ... Ealing Common . sfn Day Reed 2008 p 99 During the World War II Second War World Heaps served as Director ... Archive Stanley A Heaps, 1943 DEFAULTSORT Heaps, Stanley Category English architects Category ... more details
Image Aaheaps.jpg thumb 1930 election leaflet Abraham Albert A.A. Heaps December 24, 1885 &ndash April 4, 1954 was a Canada Canadian politician and Labor movement labour leader. Born in Leeds , England , Heaps immigrated to Canada in 1911 and worked in Winnipeg, Manitoba Winnipeg as an upholsterer. He was one of the leaders of the Winnipeg General Strike of 1919 and was a Labor alderman on the Winnipeg City Council from 1917 to 1925. He ran for the Canadian House of Commons as a Labour candidates and parties in Canada Labour candidate in 1923 in the riding of Winnipeg North but was defeated. He was elected in the Canadian federal election, 1925 1925 election and joined J.S. Woodsworth as the sole Labor MP in Parliament. The Liberal Party of Canada Liberal government of William Lyon Mackenzie King was elected with a minority government . Heaps and Woodsworth agreed to support the Liberals in exchange for the government creating Canada s first old age pension . Heaps and Woodsworth joined other left wing MPs to form the Ginger Group . He was a founding member of the Co operative Commonwealth Federation in 1932, and was a charter member of the CCF s caucus . One of the few Jew s in Parliament, Heaps pressured the government to allow Jewish refugees from the Nazis into Canada. He was defeated ... North by the Communist Party of Canada Communist Party s candidate. His son, Leo Heaps, wrote a 1984 biography about him called The Rebel in the House The Life and Times of A.A. Heaps MP and was an unsuccessful ... . His grandson, Adrian Heaps , was elected to Toronto City Council in 2006. References http mikan3.archives.ca ... Heaps fonds External links CanParlbio ID 5F73217F 27D7 4BEC 9943 554CA0DAADE8 http thecanadianencyclopedia.com index.cfm?PgNm TCE&Params A1ARTA0003659 Abraham Albert Heaps at The Canadian Encyclopedia ... Persondata Metadata see Wikipedia Persondata . NAME Heaps, Abraham ALTERNATIVE NAMES SHORT DESCRIPTION ... PLACE OF DEATH DEFAULTSORT Heaps, Abraham Category 1885 births Category 1954 deaths Category Canadian ... more details
The History of Early Analytic Philosophy Society HEAPS is a philosophy philosophical learned society society whose purpose is to foster a better understanding of early analytic philosophy . The society examines the work of the early contributors to analytic thought including Gottlob Frege , Bertrand Russell , Ludwig Wittgenstein , Frank P. Ramsey , and G. E. Moore . The Society sponsors conference sessions in conjunction with the American Philosophical Association . External links http www.lehman.edu deanhum philosophy heapsHEAPS website Category Philosophical societies Category Analytic philosophy Category Organizations based in New York City ... more details
In computer science , a skew binomial heap or skew binomial queue is a variant of the binomial heap that supports worst case O 1 insertion, rather than the O lg n worst case insertion from the original binomial heap. Just as binomial heap s are based on the binary number system , skew binary heaps are based on the skew binary number system . ref Okasaki, Chris. Purely Functional Data Structures. ref References reflist Category Priority queues Category Heaps structure algorithm stub ... more details
Fair use rationale Non free media rationale Non free image data Description Descript cvr The Goon Heaps of Ruination trade paperback collected edition 2005 Art by Eric Powell. Source cite web title Goon, The Heaps of Ruination nn publisher Grand Comics Database Project url http www.comics.org coverview.lasso?id 370411&zoom 4 accessdate 2008 10 08 Portion Full cover as published. Resolution 300px size unsuitable to use for high end reproduction. other information Non free image rationale Article Eric Powell comics Purpose Illustration of one of the creator s signature series characters. Replaceability Comics replaceability Publication y Licensing Non free book cover Category Dark Horse Comics covers comicsyrimage 2005 Goon Heaps of Ruination ... more details
Summary SVG softball field diagram, created by Yours Truly. Shows outfield, infield, foul territory, distances. Distances, alas, only available when zoomed in heaps. I don t know how useful this will be, but it s here ... Licensing cc by sa 2.5 Orphan image ... more details
languages, skew heaps become extremely simple to implement. Here is a complete sample implementation ... last2 Robert Tarjan Tarjan first2 Robert Endre year 1986 title Self Adjusting Heaps journal SIAM ... Animations comparing leftist heaps and skew heaps, York University http people.cis.ksu.edu rhowell viewer heapviewer.html Java applet for simulating heaps, Kansas State University Category Binary trees Category Heaps structure th Skew heap ... more details
Kibzaim two heaps, a city of Ephraim , assigned to the Kohath ite Levite s, and appointed as a Cities of Refuge City of Refuge bibleverse Joshua 21 22 . It is also called Jokmeam bibleverse 1 Chronicles 6 68 . Eastons Tanakh stub Palestine geo stub coord missing Palestine Category Hebrew Bible places ... more details
Wikify date January 2011 In computer science , a min max heap is a double ended priority queue implemented as a modified version of a binary heap . Like a binary heap, a min max heap is represented as a complete binary tree. Unlike a binary heap, though, the nodes in this tree do not obey the min heap property rather they obey the min max heap property. Each node at an even level in the tree is less than all of its descendants, while each node at an odd level in the tree is greater than all of its descendants. Like binary heaps, min max heaps support O lg n insertion and deletion, can be built in time O n , and are often represented implicitly in an array. Operations like findmin and findmax take constant time. References Atkinson et al. http www.cs.otago.ac.nz staffpriv mike Papers MinMaxHeaps MinMaxHeaps.pdf Min Max Heaps and Generalized Priority Queues . Category Priority queues Category Heaps structure datastructure stub ... more details
In computer science , a 2 3 heap is a data structure , a variation on the heap data structure heap , designed by Tadao Takaoka in 1999 . The structure is similar to the Fibonacci heap , and borrows from the 2 3 tree . Time costs for some common heap operations delete min takes math O log n math amortized time decrease key takes constant amortized time insertion takes constant amortized time. References Tadao Takaoka. http www.cosc.canterbury.ac.nz tad 2 3heaps.pdf Theory of 2 3 Heaps , Cocoon 1999 . datastructure stub Category Heaps structure ... more details
Summary Spenser Heaps, http www.babula2008.com issues.htm Image Michaelbabula.jpg thumb Dr. Michael Babula, MBA, PhD. Licensing PD self date April 2009 duplicate file info differentlicense true otheraddress Image Babula.jpg othertext Template di no license Template di no license date 29 December 2007 Spenser Heaps, http www.babula2008.com issues.htm Image Michaelbabula.jpg thumb Dr. Michael Babula, MBA, PhD end duplicate file info template Orphan image Copy to Wikimedia Commons bot Fbot ... more details
In Archaeology , spoil is the term used for the soil, dirt and rubble that results from an Excavation archaeology excavation , and discarded off site on spoil heaps. These heaps are commonly accessed by barrow run s. Spoil management Effective management of spoil is necessary because its volume is in general three times that which it was before excavation. Best practice involves removing the spoil away from the excavation site by mechanical earth moving equipment, or the creation of barrow run fed spoil heaps. In the barrow run method, a ramp is built using spoil transported in barrows along the barrow runs. The spoil heap is progressively enlarged by tipping off the vertical end face of the barrow run. This method is efficient in storing the maximum amount of spoil in the minimum area, where there is no mechanised means of removing spoil a long distance from the site. See also Excavation archaeology Excavation References The MoLAS archaeological site manual MoLAS, London 1994. ISBN 0 904818 40 3. Rb 128pp. bl wh Category Methods and principles in archaeology ... more details
Fletchertown is a small village in the parish of Allhallows, Cumbria , England. Historically within Cumberland , the parish recorded 548 residents 2001 census , Fletchertown being the largest centre of population in the parish. The village was originally built to house workers in a nearby coal mining coal mine , since abandoned. The site of the mine and its spoil heaps remain. The heaps are known locally as the pit bank area. Fletchertown is also the home of a number of industrial units. The school, closed in 1984, now serves as a local community centre. External links http www.cumbria railways.co.uk old fletchertown pictures.html Historic pictures http www.geograph.org.uk photo 138976 Recent photograph and map coord 54.77537 N 3.23311 W type city 500 region GB display title format dms Cumbria geo stub Category villages in Cumbria pl Fletchertown ... more details
In computer security , heap feng shui is a technique used in exploit computer security exploits to facilitate arbitrary code execution . ref cite web url http blog.trendmicro.com heaps and bounds title Heaps and Bounds publisher Trend Micro date September 3rd, 2007 accessdate 2009 08 10 ref The technique attempts to manipulate the layout of the Heap programming heap by making heap allocations of carefully selected sizes. It is named after feng shui , an ancient Chinese system of aesthetics that involves the selection of precise alignments in space. References reflist See also Heap spraying JIT spraying External links http www.blackhat.com presentations bh europe 07 Sotirov Presentation bh eu 07 sotirov apr19.pdf Heap Feng Shui in JavaScript Slides of the BlackHat presentation on this subject. computer security stub Category Computer security exploits ... more details
objects from distinct heaps. On each turn, a player must remove at least one object, and may ... Game where the Poset consists of disjoint Total order Chains the heaps . Game play and illustration The normal game is between two players and played with three heaps of any number of objects. The two players alternate taking any number of objects from any single one of the heaps. The goal is to be the last ... Alice and Bob who start with heaps of 3, 4 and 5 objects. The winning strategy is for a player to leave .... Sizes of heaps Moves A B C 3 4 5 Alice takes 2 from A 1 4 5 Bob takes 3 from C 1 4 2 Alice ... theory Nim has been mathematically solved for any number of initial heaps and objects that is, there is an easily ... to that player. In a game that starts with heaps of 3, 4, and 5, the first player will win with optimal ... y to distinguish it from the ordinary sum, x y . An example of the calculation with heaps ... 2 sub 10 sub The nim sum of heaps A, B, and C, 3 4 5 2 An equivalent procedure, which is often easier ..., if there are only two heaps left, the strategy is to reduce the number of objects in the bigger heap to make the heaps equal. After that, no matter what move your opponent makes, you can make the same ..., the correct move is to leave an odd number of heaps of size 1 in normal play, the correct move would be to leave an even number of such heaps . In a mis re game with heaps of sizes 3, 4 and 5 ... number 2 heaps of size 1. For mis re play, I take the entire B heap, to leave an odd number 1 of heaps ... . source lang python def nim heaps, misere True Computes next move for Nim in a normal or mis re default game, returns tuple chosen heap, nb remove X reduce lambda x,y x y, heaps if X 0 Will lose unless all non empty heaps have size one if max heaps 1 print You will lose for i, heap in enumerate heaps if heap 0 Empty any non empty heap chosen heap, nb remove i, heap break else sums t X t for t in heaps chosen heap sums.index True nb remove heaps chosen heap heaps chosen heap X heaps twomore ... more details
A pairing heaps is a type of heap data structure heap data structure with relatively simple implementation and excellent practical amortized performance. However, it has proven very difficult to determine the precise asymptotic running time of pairing heaps. Pairing heaps are heap property heap ordered multiway Tree data structure tree s. Describing the various heap operations is relatively simple in the following we assume a min heap find min simply return the top element of the heap. merge compare the two root elements, the smaller remains the root of the result, the larger element and its subtree is appended as a child of this root. insert create a new heap for the inserted element and merge ... Improved upper bounds for pairing heaps url http john2.poly.edu papers swat00 paper.pdf doi 10.1007 ... contribution Towards a final analysis of pairing heaps doi 10.1109 SFCS.2005.75 url http www.eecs.umich.edu ... issue 4 journal Journal of the ACM pages 473 501 title On the efficiency of pairing heaps and related ... 214748.214759 issue 3 journal Communications of the ACM pages 234 249 title Pairing heaps experiments ... and Data Structures volume 519 year 1991 . ref conducted experiments on pairing heaps and other ... an empty heap, or a pair consisting of a root element and a possibly empty list of pairing heaps. The heap ... that gave this datastructure its name from left to right and then merges the resulting list of heaps ... , H7 switch direction, merge the last two resulting heaps, giving H567 merge H12, merge H34, H567 merge the last two resulting heaps, giving H34567 merge H12, H34567 finally, merge the first merged pair ... discusses pairing heaps and their implementation in Haskell programming language Haskell in http themonadreader.files.wordpress.com ... www.cise.ufl.edu sahni dsaaj enrich c13 pairing.htm pairing heaps , Sartaj Sahni Citation url http www.siam.org proceedings soda 2009 SODA09 052 elmasrya.pdf title Pairing Heaps with O log log n decrease ... Algorithms SODA 09 year 2009 pages 471 476 location New York Category Heaps structure ... more details
Summary logo fur Article LEAP Long range Energy Alternatives Planning System Use Brand ADDITIONAL INFORMATION Used for Owner Website History Commentary OVERRIDE FIELDS Description Source Portion Low resolution Purpose Must be specified if Use is not Infobox Org Brand Product Replaceability other information Charlie Heaps Licensing non free logo ... more details
Beckton is a place in the East End of London. It may also refer to Railway stations in Beckton Beckton DLR station , on the Docklands Light Railway Beckton Park DLR station , on the Docklands Light Railway Beckton railway station , a former railway station Other Norm Beckton , Australian Rules footballer Beckton microprocessor Beckton , a microprocessor Beckton Gas Works , in Beckton, London Beckton Alps , former spoil heaps near Beckton Gas Works disambig ... more details
Encyclopedia
top
